{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017554983,0.00014683041,0.9702327,0.00021226678,0.000044811248,0.00010506033,0.000024132118,0.00027031163,0.01140881],"genre_scores_gemma":[0.42957848,0.00020915238,0.5627962,0.000116310286,0.00004880889,0.00026320165,0.00011404171,0.00013313553,0.0067407093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993199,0.000326404,0.00004005042,0.00009228518,0.00016830143,0.000052999974],"domain_scores_gemma":[0.99782443,0.0018400642,0.00006263441,0.0001357868,0.000093986826,0.00004305149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123031,0.0006372535,0.0005865814,0.0006501352,0.00054546585,0.001116557,0.0015043103,0.00088846247,0.0046625133],"category_scores_gemma":[0.0052315826,0.00035917276,0.0009096473,0.0006105533,0.0011472163,0.0019827029,0.0013403274,0.0016925669,0.00044148075],"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.00018517648,0.00026660328,0.0007799709,0.00029282385,0.000109666355,0.00019300608,0.0007008905,0.25325435,0.0072737453,0.42990106,0.003998127,0.30304456],"study_design_scores_gemma":[0.000036176865,0.00004625534,0.00011152636,0.00002223866,0.000021281687,0.00006214953,0.000050399816,0.81314325,0.0018738462,0.1825156,0.0021047753,0.000012458422],"about_ca_topic_score_codex":0.0015111716,"about_ca_topic_score_gemma":0.0021340572,"teacher_disagreement_score":0.0046625133,"about_ca_system_score_codex":0.0007248741,"about_ca_system_score_gemma":0.0006498146,"threshold_uncertainty_score":0.0155976415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004719942,0.00033522682,0.98930943,0.000107589825,0.000051539722,0.000060229206,0.00015698734,0.0029099942,0.0023491231],"genre_scores_gemma":[0.08568652,0.0003788876,0.9108675,0.000101818885,0.000028638353,0.00026493054,0.0003602997,0.0003424159,0.0019690238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.00016494203,0.000046818863,0.00010635756,0.00024177441,0.000042048887],"domain_scores_gemma":[0.9984596,0.0007422355,0.000104076345,0.0003517068,0.00024027315,0.00010212398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086280797,0.00066186173,0.000890945,0.0009396309,0.00045854363,0.0013055358,0.0024589566,0.00091821497,0.007041259],"category_scores_gemma":[0.0039499537,0.0005553455,0.0005533709,0.002068472,0.00058247487,0.002168514,0.0021147563,0.0013093762,0.002585719],"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.0006359355,0.00023143868,0.0016525743,0.00045976057,0.00008439577,0.00012112851,0.00020801362,0.27434805,0.010882552,0.07436684,0.014681776,0.62232757],"study_design_scores_gemma":[0.0001056707,0.00014431067,0.00017117256,0.000025565725,0.000018388033,0.000093743765,0.000026765401,0.95466816,0.0051639145,0.02574186,0.013817578,0.000022874694],"about_ca_topic_score_codex":0.0056256647,"about_ca_topic_score_gemma":0.0041517895,"teacher_disagreement_score":0.007041259,"about_ca_system_score_codex":0.00049904984,"about_ca_system_score_gemma":0.0012876452,"threshold_uncertainty_score":0.023555338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2513757,0.00035877628,0.7024162,0.0005169976,0.00009428022,0.00030162072,0.00017916631,0.0019168407,0.042840455],"genre_scores_gemma":[0.7337671,0.00006022026,0.2562777,0.0002088315,0.000014280259,0.00016859692,0.00020884821,0.00020965004,0.009084858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.0001795055,0.00004043427,0.00021662265,0.00020953121,0.00013891947],"domain_scores_gemma":[0.9988519,0.00048593245,0.00012195695,0.0002564379,0.00017780274,0.000105973304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139171,0.00053827744,0.00076996774,0.0007466143,0.0006456933,0.0006566203,0.0014899543,0.0007400894,0.006510031],"category_scores_gemma":[0.003624853,0.0002641721,0.00046754366,0.00046865724,0.0009875845,0.0015499028,0.0016349785,0.0006482546,0.0007443077],"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.00060723745,0.0003239702,0.009479841,0.00025868858,0.000085102285,0.00029025497,0.0006077635,0.2663391,0.01477922,0.15844285,0.009096902,0.53968894],"study_design_scores_gemma":[0.00007987088,0.00023912308,0.00094639254,0.000031308864,0.000020725396,0.00016338158,0.00009030244,0.91627294,0.0049212324,0.07128792,0.005921276,0.0000254374],"about_ca_topic_score_codex":0.002817898,"about_ca_topic_score_gemma":0.0055836705,"teacher_disagreement_score":0.006510031,"about_ca_system_score_codex":0.0012240718,"about_ca_system_score_gemma":0.0013824701,"threshold_uncertainty_score":0.021778166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041331593,0.000084711995,0.9470066,0.00010675826,0.000028386656,0.00019966785,0.00003207813,0.0011453289,0.010064953],"genre_scores_gemma":[0.5401258,0.0001145368,0.4545533,0.00007100793,0.000017257724,0.0003793772,0.00014034801,0.00021494634,0.0043834504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989003,0.0005092741,0.00010256991,0.00021199457,0.00019813317,0.000077713514],"domain_scores_gemma":[0.9975011,0.0010893483,0.00028473476,0.0006034179,0.00026476893,0.0002565793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013173072,0.0008167992,0.0005105844,0.0004965265,0.00049121917,0.0014358158,0.0010608223,0.00064545823,0.00303047],"category_scores_gemma":[0.0054566837,0.00044714127,0.00055109337,0.00034395585,0.001242693,0.0018454688,0.0014323504,0.0007463771,0.000581049],"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.00021104942,0.0003406745,0.0030995626,0.00022773641,0.000087573164,0.0005106254,0.0021570462,0.53299916,0.03244498,0.1780581,0.002028789,0.24783479],"study_design_scores_gemma":[0.000036745838,0.00011838285,0.00043407688,0.000034723602,0.000023206117,0.00011872884,0.00016840959,0.90548307,0.0073453076,0.08025192,0.005954087,0.000031361367],"about_ca_topic_score_codex":0.0012009729,"about_ca_topic_score_gemma":0.0013243834,"teacher_disagreement_score":0.00303047,"about_ca_system_score_codex":0.0005869964,"about_ca_system_score_gemma":0.00069544284,"threshold_uncertainty_score":0.010137975},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003068998,0.012384545,0.0033431384,0.18267046,0.25263655,0.001172411,0.020706607,0.0011147568,0.52290255],"genre_scores_gemma":[0.010250706,0.0042329254,0.0010575453,0.026929798,0.015972205,0.0006151168,0.0085321795,0.00045641314,0.93195313],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985644,0.00013271942,0.000069928356,0.0002006128,0.0007019083,0.00033057612],"domain_scores_gemma":[0.99463236,0.00058386376,0.00013518368,0.0002040876,0.0025856544,0.0018588592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034299511,0.0013221634,0.0010407721,0.00221676,0.0039506424,0.008026138,0.0022850565,0.0070542735,0.18643034],"category_scores_gemma":[0.004424982,0.0006395165,0.0013346577,0.0013708711,0.00083637674,0.003006243,0.0029211214,0.0077778194,0.075438954],"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.00003293518,0.000016666398,0.00005739096,0.000033862187,0.0000027972453,0.000008858442,0.0000064874857,0.000024834188,0.000034106943,0.00063094636,0.99491405,0.004237012],"study_design_scores_gemma":[0.000040577357,0.000021950655,0.00092694326,0.00015936831,0.000015053166,0.000011250005,0.00006210519,0.00007414687,0.00011938992,0.0011887713,0.9973701,0.000010423553],"about_ca_topic_score_codex":0.013642706,"about_ca_topic_score_gemma":0.053803295,"teacher_disagreement_score":0.18643034,"about_ca_system_score_codex":0.0022568475,"about_ca_system_score_gemma":0.0059662387,"threshold_uncertainty_score":0.6236716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087543726,0.00014200722,0.90379435,0.00035433902,0.000034764278,0.00021750625,0.00019049371,0.00029393335,0.007428841],"genre_scores_gemma":[0.7471907,0.00024065383,0.24365443,0.00011768114,0.000022391658,0.00034056292,0.00033134254,0.00005630127,0.00804591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899846,0.00048402086,0.000060673956,0.00019445944,0.00015554694,0.00010695886],"domain_scores_gemma":[0.9982668,0.0011213357,0.00018556257,0.00015495141,0.00014701091,0.00012437403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514077,0.0009579742,0.0004278916,0.0007843183,0.00042199084,0.0016504107,0.0018096906,0.0014602023,0.0019770127],"category_scores_gemma":[0.004908242,0.00053910795,0.0009606736,0.0003808901,0.0011135669,0.0021268022,0.0015624334,0.0015510235,0.00051091495],"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.00020119104,0.00020033176,0.007287491,0.00012746935,0.000063106476,0.000367784,0.0012094416,0.79747,0.0026922347,0.14522497,0.0011227465,0.04403329],"study_design_scores_gemma":[0.00001165903,0.000026545766,0.00023525098,0.000009994948,0.000008120893,0.000024768635,0.000069183385,0.96888196,0.00036237197,0.029131413,0.0012311948,0.0000075122243],"about_ca_topic_score_codex":0.0067789527,"about_ca_topic_score_gemma":0.011157348,"teacher_disagreement_score":0.0067789527,"about_ca_system_score_codex":0.00090060197,"about_ca_system_score_gemma":0.000959266,"threshold_uncertainty_score":0.013478994},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2965666,0.0013863844,0.22974762,0.007734939,0.00031163733,0.0002675049,0.00055047724,0.0008175916,0.4626172],"genre_scores_gemma":[0.9854392,0.000122045065,0.009649855,0.00016232986,0.00004606703,0.00008707207,0.0000766713,0.00012098506,0.0042958097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881774,0.0007312539,0.000041560503,0.00013727548,0.00017545582,0.00009668204],"domain_scores_gemma":[0.99570245,0.0023075948,0.00043260923,0.0005465453,0.00063331536,0.00037740765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011860185,0.0004284553,0.00020945567,0.002034751,0.0017361838,0.00636792,0.0008620392,0.0012148122,0.0056876168],"category_scores_gemma":[0.010061407,0.00032216302,0.00025422015,0.001022642,0.0088399025,0.007494667,0.0031598376,0.0017040166,0.0004485338],"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.00013437966,0.000039434108,0.0056999456,0.00018390449,0.000021757445,0.00034725835,0.096625976,0.00090370094,0.0054828622,0.865774,0.002689928,0.022096753],"study_design_scores_gemma":[0.00004556177,0.0003374534,0.01990757,0.00036399343,0.00007114758,0.0019806775,0.14533132,0.02060515,0.005634539,0.6716189,0.13397887,0.0001248118],"about_ca_topic_score_codex":0.0010804783,"about_ca_topic_score_gemma":0.00096020056,"teacher_disagreement_score":0.00636792,"about_ca_system_score_codex":0.00078970636,"about_ca_system_score_gemma":0.000624157,"threshold_uncertainty_score":0.019026995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47216833,0.00012634518,0.48896965,0.0016249344,0.00017148959,0.00031203768,0.0001971694,0.0050969417,0.03133296],"genre_scores_gemma":[0.91353744,0.00003492199,0.08374865,0.00011485719,0.0000083336645,0.000097408156,0.00004605845,0.000113129776,0.0022991768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933076,0.0003543529,0.000041925767,0.00008433316,0.00012351506,0.000065054715],"domain_scores_gemma":[0.9969183,0.0021151714,0.00013775035,0.00029763926,0.00020575893,0.00032538676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011517187,0.0004762904,0.00031392518,0.00021529586,0.0004559485,0.0007282555,0.0010822306,0.0011142768,0.0034153715],"category_scores_gemma":[0.006346916,0.0002683761,0.0003479558,0.00013106203,0.0009278569,0.00110967,0.0011040763,0.001592418,0.0005649845],"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.0013684238,0.0026135787,0.02190773,0.00045999468,0.00018496762,0.0021880555,0.0042912522,0.6036244,0.09995337,0.08375816,0.009055185,0.170595],"study_design_scores_gemma":[0.00011880173,0.00036787216,0.0016785971,0.000018579673,0.000013463288,0.00016802723,0.00010917142,0.96574914,0.012763768,0.015184991,0.0037967204,0.000030875024],"about_ca_topic_score_codex":0.003481323,"about_ca_topic_score_gemma":0.003245607,"teacher_disagreement_score":0.003481323,"about_ca_system_score_codex":0.00043564782,"about_ca_system_score_gemma":0.00048160614,"threshold_uncertainty_score":0.011425555},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06288096,0.00022232367,0.89809686,0.000915054,0.00011644001,0.00015780661,0.00045714842,0.020055551,0.017097825],"genre_scores_gemma":[0.55207855,0.00023734059,0.4299999,0.0007303072,0.00006404246,0.0003513787,0.0012319136,0.00347066,0.011835937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987514,0.00038291197,0.000051193783,0.00026345908,0.00035687676,0.00019423566],"domain_scores_gemma":[0.996358,0.0026051488,0.00023395002,0.00039386502,0.00028863168,0.00012035125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016180674,0.00085893535,0.0007608366,0.0009301548,0.00071550236,0.0012645501,0.0014875393,0.0010849636,0.008816662],"category_scores_gemma":[0.0075425818,0.00040188848,0.0009859026,0.00060936564,0.0027127129,0.0033337146,0.0035543717,0.0020481767,0.0012139064],"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.0020520343,0.00026716277,0.010151482,0.0009668224,0.00014353343,0.00070914946,0.0018009838,0.063993774,0.022769192,0.5610825,0.03531103,0.30075237],"study_design_scores_gemma":[0.00033347122,0.0005383257,0.0013228969,0.00019335335,0.00015299972,0.0005095093,0.0004965026,0.33733737,0.06520039,0.52642596,0.06735023,0.00013913483],"about_ca_topic_score_codex":0.0017675118,"about_ca_topic_score_gemma":0.0018342135,"teacher_disagreement_score":0.008816662,"about_ca_system_score_codex":0.00067600777,"about_ca_system_score_gemma":0.0010939378,"threshold_uncertainty_score":0.029494643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053971265,0.000056058056,0.94028693,0.00015451724,0.00002298151,0.00012474798,0.00014240065,0.001260565,0.003980656],"genre_scores_gemma":[0.7179795,0.000094146926,0.27864492,0.00008441239,0.000017303202,0.00021315814,0.00035352178,0.00013659227,0.002476456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.0005393049,0.00008173676,0.00019064957,0.0003873987,0.00020219991],"domain_scores_gemma":[0.99693274,0.0020804626,0.00020695334,0.00045972833,0.0002014395,0.00011863925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784737,0.0010112018,0.0012093724,0.00073081633,0.00063564937,0.0016578711,0.001835175,0.0008705275,0.0036839934],"category_scores_gemma":[0.0064582247,0.00053957145,0.0014060383,0.00057214266,0.0013896642,0.002646493,0.0022855166,0.0021598912,0.00042276672],"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.00015531728,0.00009464324,0.0012607804,0.0000780965,0.00004463239,0.00017463524,0.0002833429,0.8548276,0.0016749426,0.08513085,0.0010144567,0.055260673],"study_design_scores_gemma":[0.000016827687,0.000013393345,0.00007398749,0.000006967866,0.0000057803163,0.000011015847,0.000020294874,0.9529374,0.0007573544,0.04566195,0.0004904124,0.0000046113805],"about_ca_topic_score_codex":0.00395948,"about_ca_topic_score_gemma":0.006046338,"teacher_disagreement_score":0.00395948,"about_ca_system_score_codex":0.0016805778,"about_ca_system_score_gemma":0.0016599622,"threshold_uncertainty_score":0.012324154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02198935,0.00045816952,0.9661872,0.000111811045,0.00012890389,0.0001645941,0.0003756168,0.00441923,0.0061651752],"genre_scores_gemma":[0.25790277,0.00031447425,0.7340704,0.00007097822,0.000030851785,0.00021278983,0.0009302453,0.00036272965,0.006104743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00005856301,0.000017728747,0.000080607206,0.00012484354,0.0000672326],"domain_scores_gemma":[0.99933225,0.00035771777,0.000034170374,0.00010282145,0.00011857926,0.000054501612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037114884,0.0011264853,0.0015761099,0.0011304375,0.0007779714,0.00081402215,0.0020920439,0.0009402453,0.011133913],"category_scores_gemma":[0.0018059923,0.00058068556,0.0006518904,0.0013616418,0.00041541716,0.0012049301,0.0020237707,0.0011604748,0.0019092407],"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.000663498,0.00023461043,0.0010117869,0.00026525863,0.00008038979,0.00014302439,0.00015401925,0.3154032,0.007398305,0.018496279,0.020952221,0.63519746],"study_design_scores_gemma":[0.000045774526,0.000041341973,0.00016389693,0.0000095065225,0.0000073875217,0.000041975356,0.000034805995,0.98686105,0.0010123643,0.0101518445,0.0016217541,0.000008225593],"about_ca_topic_score_codex":0.016527332,"about_ca_topic_score_gemma":0.019918919,"teacher_disagreement_score":0.016527332,"about_ca_system_score_codex":0.00070898666,"about_ca_system_score_gemma":0.0011952599,"threshold_uncertainty_score":0.037246644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11018372,0.00014848776,0.8821454,0.00019740798,0.0000937657,0.00019498442,0.00031131538,0.0026321292,0.0040928237],"genre_scores_gemma":[0.78394085,0.00011022469,0.2077266,0.00010573176,0.000022228858,0.00027113862,0.0009707954,0.00034514748,0.006507246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996,0.000107207044,0.000015734246,0.00011555807,0.00011211526,0.00004940494],"domain_scores_gemma":[0.99856406,0.00096346874,0.00007946924,0.00017701933,0.00014227364,0.00007374712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004910343,0.0009693007,0.0008122722,0.0004972528,0.00041398744,0.0007372142,0.0017640708,0.0012493666,0.0048136846],"category_scores_gemma":[0.0028392854,0.00088456215,0.001080429,0.00034175024,0.00073531,0.0010368692,0.0017373337,0.0011896936,0.00082582433],"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.00041992392,0.0002836716,0.0024198205,0.00022780495,0.000105019324,0.00045773524,0.0003552555,0.83049893,0.010351137,0.016992694,0.003411563,0.13447648],"study_design_scores_gemma":[0.000014311941,0.000038846203,0.00015908848,0.00000700738,0.000008729579,0.000034715937,0.00002434051,0.9919917,0.0020658767,0.0053037917,0.00034505484,0.0000065216377],"about_ca_topic_score_codex":0.0031992926,"about_ca_topic_score_gemma":0.004360326,"teacher_disagreement_score":0.0048136846,"about_ca_system_score_codex":0.0006628768,"about_ca_system_score_gemma":0.0005557,"threshold_uncertainty_score":0.016103327},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024091188,0.0007599085,0.96513015,0.0010430284,0.00012363569,0.0001686377,0.00008929978,0.0022229012,0.006371298],"genre_scores_gemma":[0.17177571,0.0006294652,0.8221265,0.0003979103,0.0001401011,0.00022416527,0.00026395725,0.00055718457,0.003885065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98552763,0.005308135,0.0012867665,0.00255386,0.0041443966,0.0011792637],"domain_scores_gemma":[0.94618356,0.038342234,0.0024433958,0.009785329,0.002727526,0.0005179866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008243583,0.0014979359,0.0019737019,0.0017884354,0.0014958868,0.0039681816,0.0032543421,0.0027549958,0.0039092307],"category_scores_gemma":[0.058486264,0.0013997776,0.0023338464,0.0020408323,0.00390945,0.011052218,0.0049717734,0.0042634304,0.0016858098],"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.0006059471,0.00023490132,0.0027653512,0.00082414766,0.00021324088,0.00039458956,0.00090386486,0.22881927,0.0082117915,0.4335466,0.011093194,0.3123871],"study_design_scores_gemma":[0.00016054494,0.00010814421,0.0002162318,0.0001304956,0.00008390612,0.0003806413,0.00015828926,0.5235821,0.007492431,0.4569809,0.010648908,0.000057437584],"about_ca_topic_score_codex":0.0015870739,"about_ca_topic_score_gemma":0.0021474059,"teacher_disagreement_score":0.008243583,"about_ca_system_score_codex":0.0017805336,"about_ca_system_score_gemma":0.004513999,"threshold_uncertainty_score":0.043596745},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34345648,0.0006988873,0.15882465,0.0064090397,0.0019327074,0.0006716187,0.0024850452,0.028333046,0.4571886],"genre_scores_gemma":[0.8818069,0.0003429233,0.050217442,0.0008187381,0.000089051464,0.00019858862,0.0014985047,0.00062310667,0.064404696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.00009935574,0.000014281997,0.000060394283,0.00016655528,0.00006483378],"domain_scores_gemma":[0.99956757,0.00015574467,0.000019036512,0.00007375931,0.000069689006,0.00011412304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060672534,0.00034256425,0.0002995395,0.0003297592,0.0011867632,0.0012095222,0.0008818906,0.0010989242,0.019205688],"category_scores_gemma":[0.0013017141,0.00016752139,0.00020806315,0.0002451422,0.000885399,0.0012906011,0.0020468584,0.0010985746,0.0041833282],"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.003419754,0.0018144909,0.017558144,0.0006819012,0.00019048007,0.009422831,0.0035582616,0.06710998,0.10067976,0.29026985,0.2695535,0.23574108],"study_design_scores_gemma":[0.0006141266,0.0014279784,0.0075017414,0.000119110424,0.000053892058,0.002009998,0.0011492308,0.38380107,0.051580798,0.061895214,0.48972654,0.00012034356],"about_ca_topic_score_codex":0.0031775364,"about_ca_topic_score_gemma":0.0028016479,"teacher_disagreement_score":0.019205688,"about_ca_system_score_codex":0.0004450712,"about_ca_system_score_gemma":0.00061191333,"threshold_uncertainty_score":0.064249456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39440906,0.0035546396,0.55904424,0.0008177823,0.00009089226,0.0004970144,0.00039227336,0.0021122051,0.03908195],"genre_scores_gemma":[0.7848192,0.00068238593,0.21002844,0.00019593953,0.00003804,0.00019719945,0.0003550748,0.00014250378,0.0035412763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895006,0.0005440147,0.000062581996,0.00013805281,0.00020627171,0.00009896259],"domain_scores_gemma":[0.99562126,0.0032456603,0.00021421268,0.000500147,0.0002528552,0.0001658855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001870359,0.00042404662,0.0005566162,0.0006490369,0.00059080665,0.0008308823,0.0008702074,0.0006598466,0.002608924],"category_scores_gemma":[0.008900373,0.00025459708,0.00040737193,0.0009536177,0.0009953001,0.0024065343,0.001256834,0.0011091285,0.0005058629],"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.001157245,0.0005638354,0.010260027,0.0005640198,0.00010238401,0.00034348926,0.0014176469,0.28631404,0.008584461,0.2503065,0.007473414,0.4329131],"study_design_scores_gemma":[0.00017060216,0.000553499,0.0024568082,0.00012365224,0.00007805211,0.00032535952,0.00024409354,0.80525005,0.0032028565,0.17098132,0.016575933,0.000037685913],"about_ca_topic_score_codex":0.0027072886,"about_ca_topic_score_gemma":0.004376941,"teacher_disagreement_score":0.0027072886,"about_ca_system_score_codex":0.0006418331,"about_ca_system_score_gemma":0.00086312625,"threshold_uncertainty_score":0.00989157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07747446,0.0003440959,0.6801849,0.0013345972,0.00072239654,0.0014825499,0.0038562517,0.13751097,0.097089775],"genre_scores_gemma":[0.40897417,0.00026800792,0.5021447,0.00091951486,0.000052403244,0.0012281841,0.004498756,0.015871607,0.06604269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962366,0.00012633015,0.000023035385,0.000056488047,0.00012515078,0.000045390938],"domain_scores_gemma":[0.998752,0.00075017015,0.000030695126,0.00020999451,0.00011640678,0.0001406321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010682228,0.00064044696,0.00025400546,0.0004668692,0.00032016577,0.0008848964,0.001444165,0.0010084257,0.028015928],"category_scores_gemma":[0.0031879551,0.00034503356,0.00046259188,0.00023956166,0.0006187202,0.00091633684,0.0014472764,0.0009229686,0.007417446],"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.0020326944,0.0018759295,0.011523485,0.0017196294,0.00010656551,0.0070451363,0.008421184,0.04807377,0.091263995,0.08292141,0.26994538,0.47507083],"study_design_scores_gemma":[0.001271424,0.0012649837,0.0064224754,0.00032338672,0.00006682586,0.0044019828,0.0008913926,0.4038159,0.07104365,0.030557305,0.47976595,0.00017478778],"about_ca_topic_score_codex":0.0013683725,"about_ca_topic_score_gemma":0.0017530442,"teacher_disagreement_score":0.028015928,"about_ca_system_score_codex":0.0002654076,"about_ca_system_score_gemma":0.000403793,"threshold_uncertainty_score":0.09372264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20473708,0.0010992616,0.5596641,0.016732793,0.00052833336,0.0006379916,0.00025791934,0.002818661,0.21352385],"genre_scores_gemma":[0.61173356,0.00066091155,0.34578097,0.0010702276,0.00008920928,0.00020780685,0.00024300783,0.0002485607,0.039965812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.00017284404,0.00002090708,0.00009597548,0.000169116,0.00007957565],"domain_scores_gemma":[0.9992787,0.00036508648,0.000038161594,0.0000491566,0.00007518696,0.00019377339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075257925,0.00037534768,0.00024933997,0.00043289902,0.0013935062,0.0018074112,0.0010540667,0.00084548746,0.0077615394],"category_scores_gemma":[0.0026261003,0.00025196513,0.00043571595,0.00023836823,0.0022249287,0.0025825005,0.0021143237,0.0018921663,0.0006644907],"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.00085007603,0.0005139496,0.003285022,0.0003562156,0.00006947895,0.000501426,0.0024464906,0.04352632,0.019105438,0.6046364,0.046727017,0.2779822],"study_design_scores_gemma":[0.00029127608,0.00094029505,0.004560356,0.00033481626,0.00008580296,0.0007955117,0.00205747,0.41698915,0.015758922,0.26566523,0.29241335,0.0001077942],"about_ca_topic_score_codex":0.0064907596,"about_ca_topic_score_gemma":0.012862898,"teacher_disagreement_score":0.0077615394,"about_ca_system_score_codex":0.0012143013,"about_ca_system_score_gemma":0.0016961036,"threshold_uncertainty_score":0.025964916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080884665,0.0021285033,0.70023686,0.009826925,0.00053820526,0.00008443817,0.0007874336,0.001664164,0.20384884],"genre_scores_gemma":[0.89284545,0.0011557401,0.062269807,0.0006928643,0.00023218196,0.00009120863,0.00092798687,0.0002572595,0.041527588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994086,0.00021660264,0.000033851218,0.00017385914,0.00012205891,0.000044983586],"domain_scores_gemma":[0.99710625,0.0019339528,0.00014232221,0.0005353141,0.000192611,0.000089600704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008597194,0.00053689705,0.0006093645,0.00051178696,0.0006018021,0.0015542493,0.00069607573,0.0005991634,0.014982315],"category_scores_gemma":[0.010531784,0.00035715173,0.0006086827,0.0005153148,0.0020312374,0.005563861,0.002009929,0.0022781726,0.0016297392],"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.000055577802,0.000029112563,0.00093695335,0.0001059179,0.000038813032,0.000057603036,0.0002497456,0.0085926885,0.00028873188,0.8722214,0.011628314,0.10579517],"study_design_scores_gemma":[0.0000048293728,0.000008245612,0.000102953,0.000014623134,0.0000053666886,0.000021634398,0.000029889741,0.009276146,0.00013678447,0.98708016,0.003316033,0.0000032770388],"about_ca_topic_score_codex":0.00061426056,"about_ca_topic_score_gemma":0.00096380437,"teacher_disagreement_score":0.014982315,"about_ca_system_score_codex":0.00053478946,"about_ca_system_score_gemma":0.0005359698,"threshold_uncertainty_score":0.05012083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087761275,0.0014058149,0.8720439,0.0043118275,0.00021879502,0.0002788808,0.0007658869,0.0026780996,0.030535625],"genre_scores_gemma":[0.9068024,0.0003900636,0.08701104,0.0008151583,0.00015890639,0.00020530625,0.00028522167,0.00014912749,0.0041828407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.977887,0.008776875,0.0017718856,0.0059295744,0.003889795,0.0017447928],"domain_scores_gemma":[0.84334224,0.080995455,0.013283714,0.05692066,0.0037737137,0.0016842266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017070021,0.0023473932,0.0028854022,0.0016257138,0.0021351837,0.005663621,0.0057795425,0.004640229,0.008903108],"category_scores_gemma":[0.111049995,0.002046389,0.0018656852,0.0017733765,0.006694376,0.016787646,0.0071041235,0.005951927,0.001794441],"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.0017139099,0.00054369937,0.016844526,0.0012193499,0.0007388607,0.0014127647,0.0022717186,0.24352947,0.008169191,0.5383256,0.009502985,0.17572792],"study_design_scores_gemma":[0.00024380401,0.0008341632,0.0025839312,0.00021878016,0.00027590542,0.0012395,0.00031912964,0.26271558,0.008048112,0.70752037,0.015787005,0.00021368357],"about_ca_topic_score_codex":0.0037475084,"about_ca_topic_score_gemma":0.0034896105,"teacher_disagreement_score":0.017070021,"about_ca_system_score_codex":0.0027101547,"about_ca_system_score_gemma":0.002874897,"threshold_uncertainty_score":0.090276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013477779,0.00016097234,0.96233445,0.0002929234,0.00015698033,0.000174339,0.00026132577,0.005201335,0.017939871],"genre_scores_gemma":[0.19111207,0.00015929023,0.7917541,0.00042479098,0.00008391764,0.00027486423,0.00067907275,0.0015842513,0.013927617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990415,0.00019912317,0.000052282034,0.00020169876,0.00032654527,0.00017884164],"domain_scores_gemma":[0.9990246,0.00052949466,0.000047512458,0.00019371303,0.0001559998,0.000048638718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000939417,0.001336203,0.0012823921,0.00083767046,0.00086184946,0.0013372035,0.0026234514,0.0013431604,0.015570829],"category_scores_gemma":[0.002762497,0.00066324713,0.0016527788,0.0008657665,0.0012214449,0.0024209656,0.0036628018,0.0028498918,0.0027243893],"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.0009495596,0.0003614141,0.0007984461,0.0012272579,0.00016776762,0.00055941264,0.00063066016,0.24922878,0.021991171,0.28556535,0.027040297,0.41147986],"study_design_scores_gemma":[0.00042231314,0.00021596905,0.00019346882,0.00012288072,0.00016232651,0.00018275662,0.0001728382,0.6818003,0.017510729,0.2699869,0.029184889,0.000044604174],"about_ca_topic_score_codex":0.0027611903,"about_ca_topic_score_gemma":0.0060715424,"teacher_disagreement_score":0.015570829,"about_ca_system_score_codex":0.0006635215,"about_ca_system_score_gemma":0.0015570045,"threshold_uncertainty_score":0.052089572},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03264622,0.0041709202,0.006273001,0.033079296,0.03439335,0.0004711304,0.0019698397,0.0010875962,0.88590866],"genre_scores_gemma":[0.08089738,0.0017791727,0.0034798733,0.003817469,0.0036434846,0.0002584464,0.004441628,0.00045891484,0.9012236],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975904,0.0003226784,0.000057226393,0.00021344425,0.0013631614,0.00045303642],"domain_scores_gemma":[0.9953818,0.00025763604,0.00009071821,0.00015196338,0.0011919494,0.00292585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032078964,0.00067224714,0.00054062315,0.0011971924,0.0032613256,0.00822886,0.0010009225,0.0017850854,0.085591525],"category_scores_gemma":[0.0051974435,0.00024887064,0.00036644645,0.0008422919,0.0008260498,0.0025951613,0.0032254371,0.002927759,0.027778529],"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.00009877618,0.00014436385,0.0004331694,0.000037906528,0.000006848335,0.000055488796,0.00009184624,0.00015924596,0.00027809033,0.014616158,0.93330896,0.05076909],"study_design_scores_gemma":[0.000019843952,0.00010026849,0.0020268532,0.00003940469,0.000002724795,0.00008594309,0.00017138424,0.00047616448,0.00018642354,0.003034961,0.9938438,0.000012132031],"about_ca_topic_score_codex":0.0033340664,"about_ca_topic_score_gemma":0.010163281,"teacher_disagreement_score":0.085591525,"about_ca_system_score_codex":0.0015836813,"about_ca_system_score_gemma":0.0035545575,"threshold_uncertainty_score":0.2863322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013197029,0.00022342283,0.9738289,0.00061666785,0.000062329076,0.00009991133,0.00008233843,0.00049361994,0.011395808],"genre_scores_gemma":[0.40141213,0.0004646741,0.5886987,0.00069102854,0.00012631537,0.00045735942,0.00018216077,0.00023845202,0.007729221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839336,0.0007157941,0.000078109304,0.00028057885,0.00036836223,0.00016385666],"domain_scores_gemma":[0.9960317,0.002957197,0.00025866425,0.00032481164,0.00021883968,0.00020882048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031995072,0.0013151699,0.0012159559,0.0005828325,0.0011756171,0.0018602959,0.0034944224,0.0018581032,0.006155923],"category_scores_gemma":[0.009916872,0.00068231364,0.0012017264,0.0005904478,0.002042484,0.0042480323,0.0026205948,0.003185645,0.0009852584],"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.00034026676,0.00022093827,0.0018833495,0.00036150895,0.00012944528,0.00017976188,0.0004241527,0.48947912,0.0024675091,0.38653785,0.007759547,0.11021664],"study_design_scores_gemma":[0.000027419035,0.000042396656,0.00008273864,0.000025711732,0.000011923337,0.000062489315,0.000022701519,0.8899041,0.0005576888,0.106385894,0.0028634972,0.000013471862],"about_ca_topic_score_codex":0.0027300424,"about_ca_topic_score_gemma":0.004999383,"teacher_disagreement_score":0.006155923,"about_ca_system_score_codex":0.0015426736,"about_ca_system_score_gemma":0.0020769294,"threshold_uncertainty_score":0.020593643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033321433,0.001575283,0.49259278,0.02755667,0.0018880856,0.00020200353,0.00026227187,0.0011255442,0.44147596],"genre_scores_gemma":[0.6551008,0.0010768361,0.22922052,0.009336623,0.0008573856,0.00067896425,0.00033904935,0.001139498,0.10225027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994364,0.0019237101,0.0003385323,0.0011546621,0.0014757462,0.00074328034],"domain_scores_gemma":[0.9957503,0.0018576928,0.00023047926,0.0012564044,0.0004675558,0.00043748622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004089386,0.0011387776,0.001569422,0.0014087316,0.004653239,0.0063162586,0.00332806,0.004563074,0.01957173],"category_scores_gemma":[0.018162569,0.000798647,0.0013781072,0.001163864,0.012288695,0.024056748,0.008802839,0.008737918,0.0027395214],"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.00002383744,0.000012850079,0.000056538727,0.000015062543,0.000003590711,0.000020210537,0.00020671563,0.00013569302,0.00012267544,0.9940731,0.0012236293,0.0041061],"study_design_scores_gemma":[0.000016921342,0.000018053777,0.00007116342,0.00002829703,0.000005408902,0.000057684938,0.00013153274,0.0016496559,0.00031497085,0.9787708,0.018919626,0.000015859592],"about_ca_topic_score_codex":0.0027186961,"about_ca_topic_score_gemma":0.002374922,"teacher_disagreement_score":0.01957173,"about_ca_system_score_codex":0.0026128674,"about_ca_system_score_gemma":0.0024182897,"threshold_uncertainty_score":0.065473914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024077546,0.00015707989,0.9053919,0.001028914,0.0002507746,0.000421449,0.00045921566,0.0016257552,0.066587344],"genre_scores_gemma":[0.32699257,0.00019199251,0.64500165,0.0005555289,0.00010199068,0.0005582483,0.00082697696,0.00069359975,0.025077458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.0001784834,0.000038236107,0.00014169404,0.00018359405,0.00015787242],"domain_scores_gemma":[0.9986437,0.0010450653,0.00003838609,0.00009162923,0.00008752775,0.00009375734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010096946,0.0011952667,0.0014490831,0.00058518763,0.0012547115,0.0021162904,0.0029055537,0.0026710783,0.024337493],"category_scores_gemma":[0.004771625,0.00052188744,0.001501193,0.0005920951,0.0017827029,0.002501473,0.004732235,0.00311857,0.0020048565],"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.0004335369,0.0003756014,0.0007628022,0.00047334348,0.00010075315,0.00042620316,0.00065713277,0.2515399,0.0026215592,0.62140816,0.019443525,0.10175756],"study_design_scores_gemma":[0.0002136598,0.00006147988,0.00006284762,0.000046480174,0.000032690725,0.000052778247,0.00014734773,0.6529426,0.0008312949,0.3390949,0.006497218,0.00001668108],"about_ca_topic_score_codex":0.0052398206,"about_ca_topic_score_gemma":0.011847827,"teacher_disagreement_score":0.024337493,"about_ca_system_score_codex":0.00091386633,"about_ca_system_score_gemma":0.0020500526,"threshold_uncertainty_score":0.081417024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053316258,0.0001843042,0.8305373,0.0005380967,0.0002515157,0.00016322204,0.00022061964,0.0012395064,0.113549285],"genre_scores_gemma":[0.55297774,0.00030464426,0.39183405,0.00022640903,0.00007692365,0.00040924913,0.0007038929,0.00075549143,0.052711606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994941,0.00016725143,0.000025265283,0.0001097992,0.000117650954,0.00008598609],"domain_scores_gemma":[0.99954176,0.00025761596,0.00002432681,0.00009575021,0.000048461967,0.000032055912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955744,0.00095795444,0.00074856245,0.00034963267,0.0011435143,0.0017498577,0.0015780913,0.001213626,0.02566446],"category_scores_gemma":[0.0017065776,0.00050024263,0.00095643144,0.00052575296,0.0013708221,0.0030280796,0.0023958064,0.0023389473,0.002642805],"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.0001601004,0.0001304928,0.0002532853,0.00022736113,0.000049815222,0.00012532924,0.0005951425,0.111399986,0.0038759562,0.72748184,0.0131513635,0.14254932],"study_design_scores_gemma":[0.000031857664,0.000036432728,0.00008574844,0.000030086441,0.000020126128,0.000053243486,0.00018709006,0.2616567,0.00294386,0.7207349,0.014200362,0.000019567167],"about_ca_topic_score_codex":0.0022161377,"about_ca_topic_score_gemma":0.0031151772,"teacher_disagreement_score":0.02566446,"about_ca_system_score_codex":0.00061012374,"about_ca_system_score_gemma":0.0007236831,"threshold_uncertainty_score":0.08585614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22369638,0.00049239164,0.70757353,0.0013779739,0.00008766778,0.00015920993,0.00039130155,0.00078789203,0.06543378],"genre_scores_gemma":[0.9555627,0.00017206048,0.032189704,0.000042908225,0.000020653804,0.00019488957,0.00027638412,0.00011239966,0.011428306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.00048365057,0.000049957347,0.00016024725,0.00017007517,0.000110476634],"domain_scores_gemma":[0.99570686,0.0031959906,0.00031538948,0.0003631818,0.0002230176,0.00019554015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711806,0.00095395744,0.00053421425,0.0007405868,0.00070365856,0.0035529803,0.0019641651,0.0018697013,0.009178196],"category_scores_gemma":[0.008711755,0.0006105702,0.0011096178,0.0005596981,0.002308682,0.004900041,0.0016773369,0.0017181957,0.0011283153],"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.00037423483,0.00020457347,0.0030308121,0.00020756075,0.00010956788,0.00033821716,0.005390479,0.30090502,0.003141901,0.65614814,0.0012738918,0.028875573],"study_design_scores_gemma":[0.000027896338,0.000076024815,0.0005879714,0.000024615332,0.000029741608,0.00011025432,0.00053007633,0.7909087,0.0009393413,0.20456743,0.0021717756,0.000026164927],"about_ca_topic_score_codex":0.0033806812,"about_ca_topic_score_gemma":0.00184993,"teacher_disagreement_score":0.009178196,"about_ca_system_score_codex":0.0010384303,"about_ca_system_score_gemma":0.00048162285,"threshold_uncertainty_score":0.030704081},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135829,0.0012631381,0.24616055,0.008808312,0.00037604055,0.0014100847,0.013831328,0.0056597097,0.10890793],"genre_scores_gemma":[0.8952098,0.00074919075,0.06644628,0.0016937492,0.00021356423,0.00051261304,0.010100931,0.0004056507,0.024668254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980946,0.0003006021,0.00013088311,0.0005417982,0.00042799537,0.000504135],"domain_scores_gemma":[0.99644035,0.0018635999,0.00031069567,0.0006492911,0.00034396615,0.000391964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074435055,0.0015514194,0.0019184109,0.0004665073,0.0013455157,0.0035831018,0.0023540435,0.001349122,0.012024367],"category_scores_gemma":[0.0038032797,0.0008948339,0.0019978962,0.0011926033,0.0020090186,0.004614664,0.003085437,0.0034622916,0.0013078998],"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.0029319965,0.0005584056,0.004384811,0.0035848948,0.0007552987,0.0033119651,0.0012451166,0.245553,0.030430961,0.49990067,0.089590974,0.11775191],"study_design_scores_gemma":[0.00073143997,0.00020191634,0.0024882895,0.00007174873,0.00017216976,0.0012817964,0.00041192264,0.17846574,0.006611533,0.78208226,0.027390538,0.00009052243],"about_ca_topic_score_codex":0.0107442,"about_ca_topic_score_gemma":0.017956505,"teacher_disagreement_score":0.012024367,"about_ca_system_score_codex":0.0023065282,"about_ca_system_score_gemma":0.0029362093,"threshold_uncertainty_score":0.040225506},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04325051,0.005669332,0.70109147,0.008940444,0.00049610646,0.00041708976,0.0006656462,0.0015981207,0.23787121],"genre_scores_gemma":[0.55513173,0.005848275,0.38719705,0.00096992956,0.00017089296,0.0007793811,0.001197469,0.00049437216,0.04821096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987987,0.0005944091,0.00007458259,0.000237011,0.00018603916,0.00010937054],"domain_scores_gemma":[0.9987413,0.0006890683,0.00010400786,0.00014314249,0.00015696064,0.00016553923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082240516,0.0011389225,0.00066518993,0.0009697414,0.0019720956,0.0045330017,0.0014070187,0.001986162,0.015308424],"category_scores_gemma":[0.0056139156,0.0004782061,0.0007978475,0.0008599607,0.003664828,0.0066198753,0.004355549,0.001795332,0.002126207],"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.00007176461,0.000042748074,0.00054009905,0.00034974664,0.00003304566,0.00013132983,0.002056466,0.024182154,0.00074517354,0.9015218,0.010851072,0.059474546],"study_design_scores_gemma":[0.000048023034,0.00006713354,0.0005031612,0.00025263958,0.000027360406,0.00022518409,0.0017942254,0.057005364,0.0008488486,0.7255393,0.21365029,0.000038376977],"about_ca_topic_score_codex":0.008085561,"about_ca_topic_score_gemma":0.008027293,"teacher_disagreement_score":0.015308424,"about_ca_system_score_codex":0.0018361554,"about_ca_system_score_gemma":0.0018175079,"threshold_uncertainty_score":0.051211715},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023162074,0.009454128,0.012200807,0.003048524,0.0005632806,0.0000478625,0.00005153638,0.00008887542,0.9722288],"genre_scores_gemma":[0.12231719,0.024155404,0.022704663,0.0023142726,0.0005131163,0.0002449814,0.00018010523,0.0001438029,0.8274265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960583,0.00012733848,0.000011645737,0.00005141389,0.00015500782,0.000048779693],"domain_scores_gemma":[0.9997763,0.00010066781,0.000013080946,0.000021904185,0.00003645237,0.00005151641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035959025,0.001144843,0.00042126456,0.0007221895,0.0013360305,0.0055158483,0.00092582096,0.0015134908,0.018555367],"category_scores_gemma":[0.0011143697,0.00040151775,0.0002443171,0.0010695119,0.0039592925,0.0053049736,0.0014435779,0.002276307,0.0045951265],"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.0000069667117,0.000014727192,0.00006683335,0.00005763417,0.000003373138,0.000021412781,0.0008660987,0.00032014007,0.00015577233,0.9358324,0.034447905,0.028206717],"study_design_scores_gemma":[0.0000057956404,0.00001185922,0.00017179048,0.00013402746,0.000003186148,0.00007360065,0.00080289575,0.00062301196,0.00022016725,0.32061395,0.677334,0.0000056331905],"about_ca_topic_score_codex":0.0044763647,"about_ca_topic_score_gemma":0.007905114,"teacher_disagreement_score":0.018555367,"about_ca_system_score_codex":0.001884904,"about_ca_system_score_gemma":0.0014247646,"threshold_uncertainty_score":0.062073886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548057,0.00044614938,0.7267052,0.0009795047,0.00025364003,0.00026916259,0.00021133976,0.0005104305,0.105144],"genre_scores_gemma":[0.8949298,0.00014643367,0.06475274,0.00010903405,0.000046945883,0.00023742158,0.00014093754,0.00017293161,0.039463624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.00012528723,0.000013421497,0.000056568082,0.00007453625,0.00009633702],"domain_scores_gemma":[0.99950314,0.00028174656,0.00003207553,0.000034299344,0.000051572177,0.00009711491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008041522,0.0011538013,0.0016275962,0.0005980745,0.00077221583,0.0016848112,0.0015767689,0.0024680863,0.015323296],"category_scores_gemma":[0.0020355452,0.0008907851,0.0006926724,0.00039993547,0.0011525562,0.00090360694,0.0020964085,0.0012658733,0.0011038418],"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.000500276,0.00015329268,0.0003467532,0.00009803268,0.00005740488,0.00013050988,0.00007883881,0.9347604,0.0027060853,0.039299797,0.0025300835,0.01933854],"study_design_scores_gemma":[0.00003635931,0.000083189516,0.00010379637,0.00001058729,0.000010804139,0.00001940164,0.000022359725,0.99279344,0.00036016322,0.0056915986,0.0008609183,0.000007436043],"about_ca_topic_score_codex":0.0045160097,"about_ca_topic_score_gemma":0.0025845068,"teacher_disagreement_score":0.015323296,"about_ca_system_score_codex":0.0009641025,"about_ca_system_score_gemma":0.001348989,"threshold_uncertainty_score":0.051261604},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50456214,0.0033815047,0.38104168,0.004215575,0.00016214405,0.00052793854,0.0004161996,0.0025786536,0.10311414],"genre_scores_gemma":[0.87619805,0.00076435844,0.11458157,0.00034884384,0.000038714763,0.00014744645,0.00038167273,0.00013885832,0.007400416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942636,0.00020540538,0.000035422614,0.00009706023,0.0001260394,0.00010976958],"domain_scores_gemma":[0.99744534,0.00211031,0.00012081594,0.000115407674,0.00008141624,0.00012674545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095875753,0.00069522415,0.0006607396,0.0007842111,0.0006794827,0.0013360254,0.0011462212,0.0013969265,0.0077024847],"category_scores_gemma":[0.007545073,0.00019769651,0.00054046756,0.00046681048,0.001436038,0.004155713,0.0019293719,0.0013926274,0.0007144146],"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.0019565874,0.0010198279,0.006762523,0.0014743055,0.00024830588,0.00030980035,0.0015747513,0.28206807,0.008947596,0.27229622,0.012285247,0.41105676],"study_design_scores_gemma":[0.00030318045,0.0009073292,0.0018891491,0.0001512681,0.00015096432,0.00026079942,0.000922025,0.7070417,0.007944086,0.2640869,0.016289445,0.000053245538],"about_ca_topic_score_codex":0.003990991,"about_ca_topic_score_gemma":0.008387617,"teacher_disagreement_score":0.0077024847,"about_ca_system_score_codex":0.0006469914,"about_ca_system_score_gemma":0.0010534609,"threshold_uncertainty_score":0.025767446},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40484503,0.008390944,0.16040578,0.004733493,0.0026502132,0.0016246125,0.0010495479,0.0013166365,0.4149838],"genre_scores_gemma":[0.88354594,0.0029636058,0.04410088,0.0010716608,0.00046841087,0.00077481003,0.001963365,0.00020029412,0.06491094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976585,0.0009404902,0.000105117775,0.00024357661,0.00073632895,0.00031600162],"domain_scores_gemma":[0.9959611,0.0018581669,0.0003143585,0.00021602723,0.0005676647,0.0010826659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257744,0.00074894127,0.00070392847,0.0008591536,0.0011034996,0.0019335311,0.0015962457,0.0010473243,0.012569612],"category_scores_gemma":[0.0068517686,0.00021153432,0.0005065567,0.0011637028,0.00095452025,0.0018610777,0.001681687,0.0014714621,0.001964006],"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.0025058908,0.0028846809,0.0059011816,0.001656231,0.00036094242,0.0010748674,0.0027769234,0.043167576,0.013205879,0.42068964,0.0921047,0.41367152],"study_design_scores_gemma":[0.0008085783,0.0027630797,0.012145529,0.00035997233,0.00010522547,0.0011124306,0.002179989,0.12577638,0.007271534,0.16308138,0.68417096,0.00022491021],"about_ca_topic_score_codex":0.002830109,"about_ca_topic_score_gemma":0.006825839,"teacher_disagreement_score":0.012569612,"about_ca_system_score_codex":0.0015051743,"about_ca_system_score_gemma":0.0011859299,"threshold_uncertainty_score":0.042049527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0832379,0.0015216809,0.8869181,0.00095228886,0.00012628121,0.0001807,0.00027413445,0.0006557534,0.02613318],"genre_scores_gemma":[0.7302538,0.0010140681,0.23879334,0.0004095545,0.00024203387,0.00078925636,0.0008116696,0.00070091785,0.026985351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829215,0.0009968274,0.000060056613,0.00021665511,0.0002336643,0.00020066064],"domain_scores_gemma":[0.9884511,0.010066218,0.00034908473,0.00045918187,0.00022594859,0.00044832082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025632544,0.0021416591,0.004455931,0.0018838914,0.0012750342,0.0035812722,0.003375751,0.003211385,0.010848182],"category_scores_gemma":[0.015917696,0.0018694878,0.0016624318,0.002065419,0.0032411737,0.0057987813,0.0042169695,0.003676816,0.0009766322],"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.0003552283,0.00015699306,0.00045777674,0.00034600374,0.00012799416,0.00008114867,0.00019414253,0.68140185,0.0007467099,0.27990773,0.0054039964,0.030820308],"study_design_scores_gemma":[0.0000555619,0.000038750117,0.000057956793,0.000025058785,0.000017133156,0.000017485696,0.00003015411,0.7327433,0.00013867016,0.26641357,0.00044871235,0.000013680719],"about_ca_topic_score_codex":0.0024718517,"about_ca_topic_score_gemma":0.0038743215,"teacher_disagreement_score":0.010848182,"about_ca_system_score_codex":0.002014046,"about_ca_system_score_gemma":0.0014301881,"threshold_uncertainty_score":0.036290824},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06929331,0.00026419075,0.8551954,0.00040494977,0.00016583057,0.0008315313,0.0005268328,0.017136863,0.056180995],"genre_scores_gemma":[0.35501656,0.00028007268,0.5990495,0.00041680533,0.000036636655,0.0010213573,0.0014024759,0.000879731,0.041896895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996761,0.00011952943,0.000016938659,0.000076701544,0.00006340126,0.000047358175],"domain_scores_gemma":[0.9995704,0.00021943921,0.000027288213,0.000046518126,0.000049648985,0.00008660894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261841,0.0010788157,0.00064078276,0.00049301673,0.00065350067,0.0011717918,0.0021761141,0.0010238697,0.013328527],"category_scores_gemma":[0.001645365,0.00033571527,0.0005586048,0.00033249648,0.00041017524,0.001387113,0.0024077925,0.0008829988,0.0028119644],"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.0020374837,0.0028836837,0.0056570703,0.001310986,0.0003326418,0.0010880439,0.0037779105,0.0577641,0.071025364,0.108839266,0.0667003,0.6785832],"study_design_scores_gemma":[0.00057201774,0.001384983,0.005952745,0.00028917927,0.000250667,0.0013316076,0.0010361203,0.5517732,0.047502737,0.13237876,0.25733903,0.00018892129],"about_ca_topic_score_codex":0.0015599249,"about_ca_topic_score_gemma":0.0033450604,"teacher_disagreement_score":0.013328527,"about_ca_system_score_codex":0.0004110311,"about_ca_system_score_gemma":0.0007042418,"threshold_uncertainty_score":0.044588327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13644122,0.0018104651,0.54019,0.005676043,0.0014843532,0.00021983666,0.00035569974,0.0029989178,0.31082353],"genre_scores_gemma":[0.8437137,0.00039092434,0.045467082,0.00060336344,0.00026172708,0.00024331376,0.00020946152,0.00075598806,0.1083545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842465,0.00070839317,0.00006517226,0.00024124078,0.00026965974,0.00029082573],"domain_scores_gemma":[0.99750024,0.0015507493,0.000096684154,0.00041265658,0.00021527495,0.00022444093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024892823,0.0011605595,0.0015998762,0.0005490248,0.0016226108,0.0030330284,0.0015523171,0.0020493348,0.036327295],"category_scores_gemma":[0.009882286,0.0005159235,0.00066625356,0.0006376016,0.0018897842,0.0041244267,0.003452009,0.0026444572,0.0042036627],"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.0010448013,0.00018490346,0.0004564732,0.00022582132,0.00006158563,0.000097096294,0.00035598341,0.075109996,0.0017600784,0.79894084,0.028546205,0.093216315],"study_design_scores_gemma":[0.00011130889,0.00020862665,0.00037175464,0.00006528882,0.000023705607,0.000076311655,0.000100763864,0.3695747,0.0018714402,0.620825,0.006743883,0.000027179442],"about_ca_topic_score_codex":0.0011955058,"about_ca_topic_score_gemma":0.0012746826,"teacher_disagreement_score":0.036327295,"about_ca_system_score_codex":0.0013680643,"about_ca_system_score_gemma":0.0015515841,"threshold_uncertainty_score":0.12152696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008167164,0.00024975894,0.9741958,0.00021733645,0.0001363406,0.00013835655,0.00038052682,0.011468468,0.0050462917],"genre_scores_gemma":[0.17286666,0.0003003662,0.8170518,0.0003128282,0.000053490883,0.00043929397,0.0013537456,0.0012774392,0.0063443873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863905,0.00030148803,0.00016452026,0.00035464196,0.00038932177,0.00015100323],"domain_scores_gemma":[0.9969843,0.0010862233,0.00027099546,0.0010842298,0.00040963836,0.000164581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011576186,0.0010886546,0.00078610406,0.00095038087,0.0010804515,0.0020757567,0.003427958,0.0013718237,0.011401627],"category_scores_gemma":[0.0060883416,0.000688182,0.0012945671,0.0012692128,0.0012885309,0.0025871017,0.0030679419,0.0017192388,0.0041474663],"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.0011226542,0.00038835092,0.0020799679,0.0005893489,0.0001462554,0.0002885594,0.0002566313,0.21880488,0.019142896,0.15215267,0.039892852,0.56513494],"study_design_scores_gemma":[0.000102412945,0.00019117317,0.0001716169,0.000037943093,0.00003858971,0.0001853534,0.00004534957,0.8835583,0.012813504,0.07682788,0.025993526,0.00003445279],"about_ca_topic_score_codex":0.004747846,"about_ca_topic_score_gemma":0.005002614,"teacher_disagreement_score":0.011401627,"about_ca_system_score_codex":0.00082799554,"about_ca_system_score_gemma":0.0027138586,"threshold_uncertainty_score":0.038142204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43611476,0.0009436882,0.4463107,0.002053196,0.00021338595,0.00015480693,0.00081154885,0.00062012364,0.112777844],"genre_scores_gemma":[0.95211107,0.0005529135,0.023502735,0.00020552243,0.0001868163,0.00018750814,0.0005243837,0.00021728144,0.02251166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993759,0.00019061661,0.000039462328,0.00009606522,0.00015398553,0.00014398547],"domain_scores_gemma":[0.9954269,0.0030031707,0.00035708453,0.00033827146,0.00041668516,0.00045792334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013199056,0.00048703866,0.00066671375,0.0030979645,0.0010009058,0.0035568872,0.001215268,0.0011608148,0.010160926],"category_scores_gemma":[0.008663724,0.00042947882,0.0008402074,0.0014230033,0.0016863943,0.004445154,0.0017475062,0.0019231024,0.0009849393],"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.000010042548,0.00001755073,0.0003194513,0.000025199743,0.0000027643382,0.000025643663,0.000120002805,0.0011142356,0.00023527427,0.99225837,0.001079999,0.0047914316],"study_design_scores_gemma":[0.000005559507,0.0000054896664,0.00029595164,0.000012754366,0.0000034764703,0.0000687459,0.000041124662,0.020223549,0.00019667156,0.978104,0.0010343478,0.000008278097],"about_ca_topic_score_codex":0.0012466266,"about_ca_topic_score_gemma":0.0014616868,"teacher_disagreement_score":0.010160926,"about_ca_system_score_codex":0.0018788914,"about_ca_system_score_gemma":0.00060745206,"threshold_uncertainty_score":0.033991694},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06903094,0.0012867755,0.53227794,0.0041554654,0.00050617126,0.00019153552,0.00013062634,0.000576318,0.39184412],"genre_scores_gemma":[0.837379,0.0005495549,0.12856479,0.00047831432,0.00005024146,0.00027834767,0.0001049199,0.00018762237,0.032407235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.00047005952,0.00003625906,0.0001287985,0.00016916946,0.000111955254],"domain_scores_gemma":[0.9984976,0.0009673538,0.00009141116,0.00015644194,0.0000819703,0.00020515188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100719,0.00072257087,0.00067411596,0.0005401593,0.0015114228,0.0033651362,0.0015058676,0.0018999487,0.012530727],"category_scores_gemma":[0.005633988,0.00035687315,0.0007051838,0.0005095466,0.0052759433,0.0069967723,0.0040006847,0.0023810328,0.0011057004],"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.00008000655,0.00001753416,0.00012835981,0.00006614338,0.00001104706,0.00006199839,0.00071547076,0.006459919,0.0010828036,0.98034704,0.0012265595,0.009803132],"study_design_scores_gemma":[0.00003267622,0.000039814902,0.00009286466,0.0000655449,0.000010549868,0.000060876406,0.00042549497,0.023632418,0.000609853,0.95782375,0.01718674,0.000019326795],"about_ca_topic_score_codex":0.0026291795,"about_ca_topic_score_gemma":0.0029758941,"teacher_disagreement_score":0.012530727,"about_ca_system_score_codex":0.0011416739,"about_ca_system_score_gemma":0.0010039605,"threshold_uncertainty_score":0.04191941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46436712,0.000944804,0.24732982,0.0047053816,0.00038514123,0.00011889769,0.00024696792,0.000545352,0.28135663],"genre_scores_gemma":[0.9546068,0.00018731599,0.016330693,0.0002744312,0.00003382717,0.000043714324,0.00008719355,0.00009581143,0.028340247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901414,0.00027987832,0.000038994738,0.00022308166,0.00010680205,0.0003371582],"domain_scores_gemma":[0.9987464,0.00063964364,0.00009749889,0.00017919694,0.000101439095,0.00023573669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065406144,0.00045586526,0.00070623937,0.00024548225,0.0015977237,0.002861214,0.0011507329,0.001846582,0.018495562],"category_scores_gemma":[0.0036489987,0.00030945687,0.00041603102,0.000248864,0.0028553405,0.0073656514,0.002123461,0.0018253974,0.001829751],"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.00061515166,0.000054563672,0.00065171835,0.00007221077,0.000020988477,0.00021423031,0.00072752807,0.0063934703,0.001754968,0.9701588,0.0032379976,0.016098319],"study_design_scores_gemma":[0.0001513639,0.00021288646,0.000551035,0.000041283856,0.000032306256,0.00017953408,0.0011552552,0.04125781,0.0029185843,0.93760556,0.015857909,0.000036467223],"about_ca_topic_score_codex":0.0019507804,"about_ca_topic_score_gemma":0.0017957159,"teacher_disagreement_score":0.018495562,"about_ca_system_score_codex":0.00069547497,"about_ca_system_score_gemma":0.00045218956,"threshold_uncertainty_score":0.061873794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09299327,0.0038961635,0.86419207,0.003000479,0.0005362956,0.00012848614,0.00024737738,0.0007650717,0.034240764],"genre_scores_gemma":[0.5758369,0.0034505704,0.3475778,0.0003955689,0.00019503469,0.00024440538,0.00038622302,0.00063287764,0.07128073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996112,0.00009541575,0.000013839915,0.00008974711,0.00013979577,0.0000500244],"domain_scores_gemma":[0.9995061,0.00028130307,0.000035326895,0.000044840883,0.00007710211,0.000055350407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008152634,0.00064264383,0.001066733,0.0004386038,0.00070930534,0.0020135248,0.0009108629,0.001438618,0.007611922],"category_scores_gemma":[0.0021756191,0.00065956055,0.0011721752,0.000511439,0.0010348556,0.0011156901,0.0015983955,0.0017548994,0.0006868391],"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.00031206498,0.00006125826,0.0011921445,0.00032741576,0.00007024968,0.0002902006,0.00032818448,0.80210304,0.00603877,0.11720355,0.0061614364,0.06591169],"study_design_scores_gemma":[0.000026768192,0.00005685583,0.00051203056,0.000048868336,0.000023107863,0.000051700725,0.00006823097,0.9721876,0.0015383794,0.014422583,0.011041918,0.000022049278],"about_ca_topic_score_codex":0.0146657005,"about_ca_topic_score_gemma":0.011354764,"teacher_disagreement_score":0.0146657005,"about_ca_system_score_codex":0.0015512657,"about_ca_system_score_gemma":0.0014351986,"threshold_uncertainty_score":0.029160678},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03914853,0.39364752,0.3088619,0.11366186,0.0024199726,0.00017817291,0.0007066344,0.0011443477,0.14023098],"genre_scores_gemma":[0.56888,0.1772074,0.19149475,0.006422739,0.0050526224,0.0004940163,0.0013449332,0.0005391852,0.048564386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528885,0.0017746001,0.0002902905,0.0006593694,0.0015717956,0.00041498925],"domain_scores_gemma":[0.97551596,0.020431247,0.00039100868,0.0008461876,0.0019401021,0.0008755929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010427924,0.0008103039,0.0023388404,0.00155613,0.0018536963,0.012155704,0.006722225,0.0060672075,0.021664277],"category_scores_gemma":[0.029034965,0.00082226837,0.00075133605,0.0036249459,0.0042319675,0.02533833,0.004378558,0.004274286,0.005058323],"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.00025512232,0.00026971236,0.0012650113,0.0015634344,0.00006796701,0.00011301771,0.00066719163,0.017578846,0.00058226124,0.49919504,0.04115832,0.43728414],"study_design_scores_gemma":[0.000056453955,0.00010798976,0.00053320144,0.00051424565,0.000040291914,0.00046039984,0.0017810031,0.11614311,0.0006526967,0.7444139,0.1352358,0.00006089604],"about_ca_topic_score_codex":0.0047373422,"about_ca_topic_score_gemma":0.006079741,"teacher_disagreement_score":0.021664277,"about_ca_system_score_codex":0.0021908528,"about_ca_system_score_gemma":0.0027918464,"threshold_uncertainty_score":0.0724743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16371071,0.002371368,0.75456,0.0008896151,0.00044578747,0.0008548608,0.0056726346,0.0437232,0.027771834],"genre_scores_gemma":[0.43648452,0.0005884791,0.5326676,0.00022521663,0.00010205016,0.00034811816,0.0150090465,0.0016610504,0.012914025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994854,0.00012106972,0.00003912122,0.00011249652,0.00017542615,0.00006654503],"domain_scores_gemma":[0.99880934,0.00056312344,0.000053070133,0.00021554061,0.00031523407,0.000043608823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538685,0.0006795213,0.000873044,0.0017153397,0.0005292698,0.0012696293,0.0014137991,0.00090135867,0.0076372065],"category_scores_gemma":[0.0033404357,0.0005539657,0.000935053,0.0015080593,0.00040535792,0.0014197269,0.0009883497,0.00064509874,0.0030378683],"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.00072028756,0.0004576311,0.0033442078,0.0009237093,0.00017713927,0.00075904175,0.00027697923,0.058623135,0.04834219,0.03597728,0.057231408,0.793167],"study_design_scores_gemma":[0.000190755,0.00021429131,0.0013581325,0.00007668875,0.00016425147,0.00060564326,0.00013206966,0.8899524,0.04732603,0.033878647,0.026061388,0.000039535742],"about_ca_topic_score_codex":0.0015664643,"about_ca_topic_score_gemma":0.003116423,"teacher_disagreement_score":0.0076372065,"about_ca_system_score_codex":0.0005689746,"about_ca_system_score_gemma":0.000984261,"threshold_uncertainty_score":0.025548995},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014430455,0.00015402844,0.94099253,0.00005791307,0.000043855714,0.00041944283,0.00016582002,0.03864332,0.0050926213],"genre_scores_gemma":[0.12853141,0.0003240806,0.85764223,0.00008537771,0.00001936607,0.00027436143,0.0011049588,0.004289544,0.0077286274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994167,0.00013615428,0.00010103259,0.00014254008,0.00016065754,0.000043007],"domain_scores_gemma":[0.99887043,0.00045044578,0.00010216678,0.0002880226,0.00019348763,0.00009543784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747331,0.0011334324,0.0004872885,0.0007090107,0.00042028766,0.0011875859,0.0014790897,0.00063283317,0.0040251594],"category_scores_gemma":[0.003873882,0.0007462789,0.00079073955,0.00032421076,0.0007058457,0.0016381829,0.0010424157,0.0009621471,0.0017060669],"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.0004486306,0.00056468585,0.0047729113,0.0011080854,0.00014850627,0.0017527819,0.004377275,0.03437738,0.17568581,0.05654881,0.019274851,0.7009404],"study_design_scores_gemma":[0.00016603222,0.00036106477,0.002774603,0.00024526485,0.00021013895,0.0022932524,0.00043034198,0.5327957,0.26746786,0.022305027,0.17073742,0.00021322395],"about_ca_topic_score_codex":0.0023294287,"about_ca_topic_score_gemma":0.0022609322,"teacher_disagreement_score":0.0040251594,"about_ca_system_score_codex":0.00046061428,"about_ca_system_score_gemma":0.00092195306,"threshold_uncertainty_score":0.013465524},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049669,0.00010781835,0.9115187,0.0000869845,0.00013365324,0.00020259483,0.0017458331,0.077525064,0.0037124222],"genre_scores_gemma":[0.08471226,0.00021322315,0.8818723,0.000121134566,0.00006518064,0.0006379329,0.0062674377,0.014409209,0.01170135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991155,0.00020124447,0.00011760224,0.00018809621,0.0003249571,0.000052695486],"domain_scores_gemma":[0.9965322,0.002168138,0.00015615232,0.00052321167,0.0004547478,0.00016556276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013178361,0.001411867,0.0009596947,0.0014510632,0.0007093256,0.0022403223,0.0024192273,0.0014758565,0.04556714],"category_scores_gemma":[0.006618646,0.0008903561,0.0011826358,0.0009376031,0.0006383781,0.0020842587,0.0023653475,0.0012378643,0.013857033],"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.0016457232,0.00039764206,0.0016887237,0.0011703395,0.00015713945,0.0017344613,0.0015321187,0.020910457,0.07707008,0.048194878,0.12122885,0.7242696],"study_design_scores_gemma":[0.00043255455,0.00022437489,0.0005949804,0.00015644947,0.00010918953,0.0011103608,0.00034316347,0.6283686,0.14640935,0.034801,0.1872975,0.00015239438],"about_ca_topic_score_codex":0.0009143148,"about_ca_topic_score_gemma":0.0014183498,"teacher_disagreement_score":0.04556714,"about_ca_system_score_codex":0.00052835495,"about_ca_system_score_gemma":0.0009052481,"threshold_uncertainty_score":0.15243721},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01268222,0.019822126,0.19468056,0.0051717083,0.0004365958,0.000044708555,0.00024423862,0.00028204877,0.7666359],"genre_scores_gemma":[0.5084698,0.017957184,0.07982905,0.0007192451,0.0005820337,0.00024975184,0.00057572813,0.00024643895,0.39137077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965453,0.00012514868,0.000022301729,0.000064605956,0.00010143281,0.000031982152],"domain_scores_gemma":[0.99918216,0.00052662886,0.000055980916,0.00009675762,0.00010116322,0.000037385125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037870667,0.0005013303,0.00044278835,0.00092693046,0.00078811904,0.0037860598,0.0007710158,0.0014047427,0.017876495],"category_scores_gemma":[0.002414794,0.00032628115,0.00038054603,0.0018524077,0.0029450327,0.008491211,0.00077677215,0.0014393135,0.0022749698],"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.000008043086,0.000007380518,0.00007123894,0.000057981782,0.000004216328,0.000026470709,0.00036779046,0.0011406265,0.00010816557,0.96372694,0.005491341,0.028989904],"study_design_scores_gemma":[0.000005149617,0.000006780467,0.00008573901,0.000071939685,0.000004523938,0.000058251862,0.00016539778,0.0027164323,0.00017860226,0.9349425,0.06175931,0.000005311042],"about_ca_topic_score_codex":0.0023521944,"about_ca_topic_score_gemma":0.0024341838,"teacher_disagreement_score":0.017876495,"about_ca_system_score_codex":0.0016815149,"about_ca_system_score_gemma":0.0008833367,"threshold_uncertainty_score":0.05980289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006117405,0.00015869929,0.9880326,0.00011901885,0.00009716305,0.000068722984,0.00005886783,0.001955144,0.0033924172],"genre_scores_gemma":[0.1595477,0.000105225816,0.83333415,0.00018114324,0.00005794464,0.00031232965,0.0002248217,0.00060331466,0.005633339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987411,0.00034941395,0.00007130155,0.00019464607,0.00046603254,0.00017754377],"domain_scores_gemma":[0.9978155,0.0010342556,0.00008032174,0.00048953376,0.00039969553,0.00018072236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016870679,0.00056551414,0.0016112278,0.00069990655,0.0011142212,0.001543165,0.0029991544,0.0017988536,0.011232025],"category_scores_gemma":[0.0068732076,0.0006880049,0.00082229427,0.0013659045,0.00080683245,0.0016629273,0.0025491999,0.002023348,0.0030879606],"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.0008933884,0.00041164018,0.00130081,0.0002123515,0.00016474363,0.00015587138,0.00019892042,0.44639766,0.0071568643,0.071496055,0.01327913,0.45833257],"study_design_scores_gemma":[0.00010502502,0.00003759855,0.0000848702,0.000008665408,0.000021837708,0.000029431874,0.00000871535,0.9781908,0.0008066976,0.018599316,0.0020961962,0.000010834663],"about_ca_topic_score_codex":0.0036653276,"about_ca_topic_score_gemma":0.005417318,"teacher_disagreement_score":0.011232025,"about_ca_system_score_codex":0.0008143019,"about_ca_system_score_gemma":0.0027266263,"threshold_uncertainty_score":0.037574828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017465595,0.00051506795,0.96777457,0.00054544676,0.0001642418,0.00015289307,0.00009640712,0.0007178249,0.01256786],"genre_scores_gemma":[0.2821578,0.0004576603,0.70356786,0.0004553025,0.0002630331,0.0004604288,0.00046015924,0.001140032,0.0110377995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995246,0.002595432,0.00016296886,0.00045409636,0.0011900377,0.00035142474],"domain_scores_gemma":[0.9735173,0.02157443,0.00061035296,0.002475165,0.0013256287,0.0004970743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006613034,0.0010361193,0.0025362486,0.00228612,0.0016118699,0.002355568,0.0045419615,0.0036173433,0.013370078],"category_scores_gemma":[0.042286783,0.0011899219,0.0015670008,0.003428983,0.0026496085,0.00700756,0.0044573783,0.0037161277,0.0024347154],"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.00037851176,0.00029849398,0.0014628426,0.00026699682,0.00010565716,0.00009550382,0.0006104229,0.38227135,0.0007781867,0.45657307,0.009647979,0.14751087],"study_design_scores_gemma":[0.000052767704,0.00006113646,0.00010750248,0.00005290052,0.000026588437,0.000026189258,0.000040670864,0.777308,0.00028613137,0.21886016,0.0031652686,0.000012682547],"about_ca_topic_score_codex":0.0060301116,"about_ca_topic_score_gemma":0.008669103,"teacher_disagreement_score":0.013370078,"about_ca_system_score_codex":0.0015458409,"about_ca_system_score_gemma":0.0028667566,"threshold_uncertainty_score":0.044727325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05953153,0.00077016925,0.9224638,0.00048811495,0.00008919142,0.000116513394,0.00009616898,0.0011183942,0.015326084],"genre_scores_gemma":[0.7623786,0.00042837416,0.2315939,0.00013111817,0.00006019211,0.00021250862,0.00016235697,0.000119048265,0.004913932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999699,0.00015460709,0.00001407502,0.000063366264,0.000050683724,0.000018319879],"domain_scores_gemma":[0.99960595,0.0002694633,0.000034326535,0.00003251124,0.00002971105,0.000028065118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042436528,0.00055913744,0.00034977822,0.00023464962,0.00028231196,0.001466441,0.00093926437,0.0005156008,0.003873808],"category_scores_gemma":[0.0018153966,0.000299465,0.00055049063,0.00016633829,0.0007943768,0.0011299186,0.0014104331,0.0007976951,0.00045703675],"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.0003663617,0.00024000501,0.0016419396,0.00044721703,0.00018403702,0.00046241406,0.0017217869,0.7183109,0.0299398,0.10016639,0.0045418236,0.14197731],"study_design_scores_gemma":[0.000026641512,0.000043633965,0.00037971194,0.000015012029,0.000019467401,0.000045627465,0.00007663713,0.9563076,0.0022471682,0.03709306,0.0037291388,0.000016199643],"about_ca_topic_score_codex":0.0010239908,"about_ca_topic_score_gemma":0.0012533003,"teacher_disagreement_score":0.003873808,"about_ca_system_score_codex":0.00046620035,"about_ca_system_score_gemma":0.00019890528,"threshold_uncertainty_score":0.012959123},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26572537,0.00025475424,0.09890799,0.0044369316,0.0027815832,0.00061137375,0.0017912692,0.015007355,0.6104833],"genre_scores_gemma":[0.6398373,0.00010754446,0.043748267,0.00079974806,0.00010275556,0.00037422788,0.001277967,0.0011570116,0.31259522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995043,0.00012591359,0.000017985181,0.000088604545,0.0001414118,0.00012177608],"domain_scores_gemma":[0.99922776,0.00026085868,0.00002954559,0.00015310147,0.00011745247,0.00021124173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048632076,0.00090280786,0.0004261575,0.000537345,0.0013853275,0.0016204262,0.0008955521,0.0011923306,0.09245916],"category_scores_gemma":[0.0033305774,0.00025077784,0.00032667487,0.0002531566,0.00084495515,0.002163108,0.0021863263,0.0014744372,0.01199772],"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.005522726,0.0020211611,0.008856921,0.0005756739,0.00021578159,0.0019084412,0.005465922,0.017563084,0.017165098,0.25971487,0.2879852,0.39300504],"study_design_scores_gemma":[0.00079356786,0.0024693941,0.007737594,0.00042369575,0.0001635424,0.0015138973,0.006383111,0.10658649,0.018140886,0.18262996,0.67292136,0.00023640282],"about_ca_topic_score_codex":0.002129658,"about_ca_topic_score_gemma":0.0063816323,"teacher_disagreement_score":0.09245916,"about_ca_system_score_codex":0.0004944121,"about_ca_system_score_gemma":0.00050815893,"threshold_uncertainty_score":0.30930668},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19676334,0.00042158779,0.73345363,0.0008597831,0.00045445864,0.00027650903,0.0006802852,0.00091513136,0.06617528],"genre_scores_gemma":[0.8776761,0.00016773319,0.09321889,0.00013587036,0.000042580734,0.0001690526,0.00041444958,0.00020110943,0.027974203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987545,0.00046882176,0.00005387248,0.00022181103,0.00028239467,0.00021857988],"domain_scores_gemma":[0.9978188,0.0010922104,0.00011208852,0.0004553282,0.00025644523,0.00026516692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010041565,0.0006743994,0.0014900011,0.00047106927,0.0012147345,0.0016620955,0.0024536569,0.0019235326,0.012341168],"category_scores_gemma":[0.0072868485,0.00040884095,0.0007813378,0.00053633185,0.0014690806,0.0025452394,0.0030643067,0.0014591363,0.0014773161],"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.002288876,0.00016413615,0.00076365314,0.00032800238,0.00014932457,0.0006779853,0.0005993436,0.35074562,0.007774297,0.55571556,0.011122167,0.069671035],"study_design_scores_gemma":[0.00012772236,0.0001682028,0.00015442974,0.000029445142,0.000024503479,0.00020108483,0.0001382815,0.7717679,0.0021597235,0.21997847,0.0052088564,0.000041318417],"about_ca_topic_score_codex":0.003683178,"about_ca_topic_score_gemma":0.002870144,"teacher_disagreement_score":0.012341168,"about_ca_system_score_codex":0.0009058762,"about_ca_system_score_gemma":0.0013316541,"threshold_uncertainty_score":0.041285336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67809635,0.00015486586,0.280668,0.00028470543,0.00004419734,0.0001520238,0.00014092415,0.000523779,0.039935198],"genre_scores_gemma":[0.9273738,0.00007593585,0.062519066,0.0000222751,0.0000026676985,0.000072400195,0.00012756241,0.000040485837,0.00976594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998332,0.0000392822,0.0000099604185,0.00004839425,0.00002632239,0.000042728472],"domain_scores_gemma":[0.9996105,0.00020035426,0.0000323045,0.000027413284,0.000055048637,0.00007444841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021314021,0.0006511574,0.00043619837,0.0005213333,0.00066830893,0.0010462761,0.0008301475,0.0012070684,0.0050213286],"category_scores_gemma":[0.0013861108,0.00023632299,0.00034889864,0.00036248172,0.00045469048,0.001361131,0.0009486886,0.0004430155,0.000612343],"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.0027518352,0.00077392446,0.012381689,0.00060481916,0.00017318041,0.0030513767,0.0038690802,0.23296787,0.10486223,0.2646189,0.007902025,0.36604306],"study_design_scores_gemma":[0.00011958488,0.00051314424,0.002973823,0.000050489125,0.000065700064,0.00059790385,0.0016139895,0.9069818,0.010566168,0.07221714,0.004243829,0.00005629569],"about_ca_topic_score_codex":0.0040810346,"about_ca_topic_score_gemma":0.0048648748,"teacher_disagreement_score":0.0050213286,"about_ca_system_score_codex":0.00044090586,"about_ca_system_score_gemma":0.00070371124,"threshold_uncertainty_score":0.01679802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032211994,0.020912826,0.11207571,0.0042119375,0.0013855217,0.000109042085,0.00042409054,0.0020622353,0.8555974],"genre_scores_gemma":[0.17071097,0.033719603,0.09018863,0.0018507005,0.0012638988,0.0005470957,0.0017081106,0.0010128958,0.6989982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996094,0.00013924454,0.000023916515,0.00005806652,0.00013799054,0.000031397576],"domain_scores_gemma":[0.9996117,0.00018268584,0.000019819892,0.00007019435,0.00006439836,0.000051314502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039549315,0.0010690911,0.0006757099,0.0008478157,0.0005621379,0.0053001526,0.0010214653,0.0013193237,0.05427705],"category_scores_gemma":[0.001770442,0.0003987865,0.00025395124,0.0015563692,0.0012990693,0.0038041526,0.001564394,0.0014547596,0.0167752],"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.000040865078,0.00013066878,0.00019696557,0.0005238523,0.000022123702,0.00009346264,0.0003021566,0.0033945467,0.00088944595,0.51607597,0.16782326,0.31050676],"study_design_scores_gemma":[0.00002406161,0.000028442255,0.00021365796,0.00025935142,0.000018919382,0.00016032641,0.0001752727,0.009387207,0.0007075288,0.38143596,0.6075754,0.000013852068],"about_ca_topic_score_codex":0.001880985,"about_ca_topic_score_gemma":0.0017784584,"teacher_disagreement_score":0.05427705,"about_ca_system_score_codex":0.00072794216,"about_ca_system_score_gemma":0.0007689272,"threshold_uncertainty_score":0.18157482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59719265,0.0014078531,0.3933808,0.000807716,0.00007726735,0.00018291194,0.00039445524,0.0026081959,0.0039482596],"genre_scores_gemma":[0.9692879,0.000094097224,0.029562883,0.00007291978,0.000019814403,0.00003893307,0.00032718235,0.00004289984,0.0005533445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973489,0.0013932346,0.00017444356,0.0004954297,0.0003132336,0.00027469482],"domain_scores_gemma":[0.9779037,0.018809961,0.00080135296,0.0011525031,0.0008577926,0.00047468606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050898963,0.0013700932,0.0021109611,0.0010779087,0.000614445,0.0014378689,0.0019078918,0.0017887392,0.0018743193],"category_scores_gemma":[0.034220766,0.0007875087,0.0005125793,0.00061109505,0.0013407149,0.004130475,0.0021198743,0.0021991283,0.00040259497],"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.0019957032,0.00088027347,0.022430755,0.00023491652,0.00019797996,0.0001114635,0.00034011618,0.7766551,0.0021385283,0.005858101,0.0016702368,0.18748681],"study_design_scores_gemma":[0.000036155572,0.00008773475,0.0010829519,0.000007985267,0.000013834407,0.0000085286765,0.00001701544,0.9956577,0.00054530817,0.002456103,0.0000778626,0.000008919634],"about_ca_topic_score_codex":0.01843967,"about_ca_topic_score_gemma":0.018447222,"teacher_disagreement_score":0.01843967,"about_ca_system_score_codex":0.0013456078,"about_ca_system_score_gemma":0.001773758,"threshold_uncertainty_score":0.036664724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013903519,0.00008540232,0.9794601,0.000047011723,0.00003148398,0.00007197792,0.00016309292,0.004134024,0.0021033173],"genre_scores_gemma":[0.5072681,0.00015619917,0.48706335,0.000049915783,0.000018783403,0.00018070723,0.00087543414,0.0004556434,0.003931844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999448,0.00011623667,0.000041565556,0.00012489714,0.000169266,0.00009995098],"domain_scores_gemma":[0.999246,0.00038764055,0.000045009307,0.00017762557,0.00011010337,0.000033655484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005882083,0.0007703875,0.0008782039,0.0007580138,0.00065154076,0.0012391715,0.00169614,0.00066835986,0.006753345],"category_scores_gemma":[0.0021071124,0.0005354964,0.0012440657,0.0006713303,0.00090763916,0.0022477317,0.0022401304,0.0015872084,0.00090055517],"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.000725714,0.00030399024,0.0016901976,0.0006288673,0.00014740457,0.00035316555,0.0012347155,0.20225158,0.028982803,0.15377846,0.010282061,0.59962106],"study_design_scores_gemma":[0.000037067464,0.000039303788,0.00040649268,0.000026593005,0.00003433474,0.00005242007,0.00010429888,0.89348835,0.008741384,0.09320706,0.0038419052,0.000020864352],"about_ca_topic_score_codex":0.006417367,"about_ca_topic_score_gemma":0.010213898,"teacher_disagreement_score":0.006753345,"about_ca_system_score_codex":0.000761122,"about_ca_system_score_gemma":0.00096423976,"threshold_uncertainty_score":0.022592247},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006518896,0.04087821,0.63795847,0.010739399,0.0014256656,0.0002157607,0.00043241555,0.0004799609,0.30135122],"genre_scores_gemma":[0.20926864,0.053722527,0.64624316,0.0034207504,0.003463989,0.00086730014,0.0012186085,0.00050813693,0.081286855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869615,0.00047344138,0.00006299369,0.0002238662,0.00043828177,0.00010533866],"domain_scores_gemma":[0.99879116,0.00087132637,0.00005289525,0.00013966177,0.00008266784,0.00006234474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011441453,0.001741718,0.0011287018,0.0012918882,0.0011769251,0.0058058864,0.0025445193,0.002185933,0.010300292],"category_scores_gemma":[0.0035705802,0.0007808964,0.0010825961,0.0036671145,0.0050510517,0.010778211,0.0018958668,0.0054254555,0.0027053053],"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.0000050306394,0.000015874337,0.000083358536,0.00014683609,0.00000917038,0.000018519093,0.000097994125,0.0019395557,0.000090047004,0.9704516,0.008428325,0.01871377],"study_design_scores_gemma":[0.0000053655685,0.0000075836633,0.00008983354,0.000065101915,0.0000050219023,0.00007029079,0.00004045691,0.006457731,0.00007847752,0.9431406,0.050033025,0.000006458183],"about_ca_topic_score_codex":0.0012484477,"about_ca_topic_score_gemma":0.0015183345,"teacher_disagreement_score":0.010300292,"about_ca_system_score_codex":0.002499765,"about_ca_system_score_gemma":0.0014431739,"threshold_uncertainty_score":0.034457862},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041609477,0.016017977,0.018518655,0.08517143,0.10230885,0.0029536476,0.021862198,0.0037005555,0.7078572],"genre_scores_gemma":[0.06467154,0.011699588,0.009101821,0.009817456,0.01355793,0.0019578047,0.02705112,0.0011806313,0.86096203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99274784,0.00092050823,0.0002607129,0.0004106173,0.0048129708,0.0008474112],"domain_scores_gemma":[0.98240525,0.0014544935,0.00071280997,0.0007867305,0.009370997,0.005269608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008787786,0.0012541213,0.00058260927,0.0044957027,0.0030473294,0.00759605,0.0015691597,0.0021863792,0.06210829],"category_scores_gemma":[0.012280792,0.0005350117,0.00081777887,0.0031546913,0.0004815905,0.002370334,0.003822408,0.003695319,0.029697077],"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.000228457,0.000342982,0.0005327048,0.00030715988,0.0000158137,0.00014760297,0.0005396176,0.0002962815,0.00094963907,0.00205507,0.9382888,0.05629581],"study_design_scores_gemma":[0.000028712991,0.00011163388,0.0022586014,0.00014746118,0.000014723655,0.000053477946,0.00095514435,0.00028821456,0.0012206171,0.0008282396,0.9940645,0.000028607326],"about_ca_topic_score_codex":0.005904897,"about_ca_topic_score_gemma":0.02032271,"teacher_disagreement_score":0.06210829,"about_ca_system_score_codex":0.0022772385,"about_ca_system_score_gemma":0.0050266054,"threshold_uncertainty_score":0.20777291},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029078538,0.00017134682,0.9470039,0.00027841792,0.00010161436,0.00023687322,0.00031145188,0.007318457,0.0154993],"genre_scores_gemma":[0.37978953,0.00013548635,0.61262155,0.0001664906,0.00004446001,0.00029497955,0.0010286494,0.0007611817,0.0051577124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998879,0.00042184835,0.00008076756,0.0002283497,0.00026652473,0.00012353506],"domain_scores_gemma":[0.99652857,0.0020112954,0.000118311895,0.00081115874,0.00044062352,0.00009003193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013350644,0.0009557742,0.0008985517,0.00094790076,0.0007322235,0.0013419566,0.0022723987,0.0014658448,0.0154056195],"category_scores_gemma":[0.009290879,0.00050949684,0.0011448102,0.0008769839,0.00090969756,0.0029882651,0.0026048387,0.001861489,0.0022589066],"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.0005553272,0.00049608905,0.0016043269,0.00047083982,0.000113536364,0.00025893486,0.00040800168,0.40679333,0.008302601,0.06644833,0.011183043,0.50336564],"study_design_scores_gemma":[0.000031185515,0.000037207745,0.000103232305,0.000024385525,0.000030077746,0.000037351696,0.000032181248,0.96448386,0.005005752,0.027298832,0.002908626,0.0000073572446],"about_ca_topic_score_codex":0.0033994657,"about_ca_topic_score_gemma":0.004858897,"teacher_disagreement_score":0.0154056195,"about_ca_system_score_codex":0.0009691266,"about_ca_system_score_gemma":0.0011423625,"threshold_uncertainty_score":0.051536977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008159295,0.0005479281,0.9863963,0.00014622002,0.000080339945,0.000039054656,0.000024891144,0.0008980824,0.003707911],"genre_scores_gemma":[0.47628665,0.00039752712,0.5095438,0.0002551053,0.00024011168,0.00025132875,0.00019546511,0.00068637874,0.012143644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994591,0.002657079,0.0003051827,0.00065340014,0.0014978931,0.00029541235],"domain_scores_gemma":[0.99101007,0.0055574025,0.00043209395,0.0014619342,0.0013101419,0.00022825257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006208108,0.00077973376,0.0019274895,0.0011957056,0.00059074163,0.0019735666,0.0016289327,0.0010828292,0.0059444443],"category_scores_gemma":[0.020020435,0.0005069968,0.0006577799,0.0012491565,0.0011118011,0.0028777814,0.002191294,0.002627597,0.0012942257],"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.0005482199,0.00025559825,0.0016172349,0.0002670575,0.00014475643,0.000049647733,0.00011395333,0.16742247,0.008956575,0.12080493,0.00817877,0.69164073],"study_design_scores_gemma":[0.00003003219,0.00009254484,0.0005301626,0.00002815726,0.000022572516,0.00003900155,0.000012724023,0.9472793,0.0032560702,0.046819706,0.001868287,0.000021361344],"about_ca_topic_score_codex":0.0006688247,"about_ca_topic_score_gemma":0.0008589796,"teacher_disagreement_score":0.006208108,"about_ca_system_score_codex":0.0009834071,"about_ca_system_score_gemma":0.00090138795,"threshold_uncertainty_score":0.032832026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014053021,0.00060506654,0.97859585,0.00038158524,0.000158926,0.00017290059,0.000083946106,0.0023778493,0.0035707934],"genre_scores_gemma":[0.514172,0.0004415146,0.47816974,0.0003860256,0.00014754703,0.0003570242,0.00026320716,0.00023736327,0.005825626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998002,0.00059286004,0.00019726882,0.00036238163,0.00057009055,0.00027542232],"domain_scores_gemma":[0.9942017,0.0029463666,0.00044187007,0.00084494153,0.00094860134,0.0006164628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003960116,0.0009401046,0.0013113125,0.0008346977,0.0008530274,0.0024219297,0.0037376743,0.0013875669,0.0059374375],"category_scores_gemma":[0.010908906,0.0007653721,0.00066356297,0.0011206511,0.0009531707,0.0030513215,0.0016643751,0.0020716153,0.0013066957],"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.0014050485,0.0006146901,0.0023412239,0.00039285017,0.00020727173,0.0002664276,0.00042175682,0.52020556,0.0060449233,0.098052844,0.012864478,0.35718295],"study_design_scores_gemma":[0.00020223392,0.00011946261,0.00008772898,0.00001182761,0.000029330287,0.000047909816,0.000020627542,0.97630966,0.0011848413,0.01922851,0.0027389778,0.000018744944],"about_ca_topic_score_codex":0.008357572,"about_ca_topic_score_gemma":0.0111079095,"teacher_disagreement_score":0.008357572,"about_ca_system_score_codex":0.0017483433,"about_ca_system_score_gemma":0.0047628535,"threshold_uncertainty_score":0.020943344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02363624,0.0007486827,0.8741169,0.0016679326,0.00018864614,0.00014815819,0.0002812176,0.00071998395,0.098492205],"genre_scores_gemma":[0.49875274,0.0017457014,0.41360703,0.0006156967,0.000448046,0.0005545598,0.0017114696,0.00068633154,0.08187847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.0004667438,0.00007006721,0.0002638905,0.00044223908,0.0001390901],"domain_scores_gemma":[0.99790025,0.0015906307,0.00008330748,0.00020741255,0.00011545215,0.00010289947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315606,0.0013040191,0.0013533662,0.0007475616,0.0010831067,0.0030106052,0.0027082118,0.0016399504,0.019608445],"category_scores_gemma":[0.0073278374,0.0010920548,0.0017626188,0.001629893,0.0014883355,0.004089813,0.0030975007,0.0038349368,0.002015346],"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.00005947534,0.00012904001,0.0002776586,0.00026455586,0.00007949046,0.00006263267,0.00018856679,0.08244156,0.000979624,0.83136255,0.009848604,0.07430624],"study_design_scores_gemma":[0.000029169658,0.000018355486,0.000101398946,0.00002429157,0.000022106953,0.0000567456,0.000035565634,0.18869583,0.00049586175,0.80331606,0.0071926103,0.000011926397],"about_ca_topic_score_codex":0.0015758489,"about_ca_topic_score_gemma":0.0025958281,"teacher_disagreement_score":0.019608445,"about_ca_system_score_codex":0.0013122894,"about_ca_system_score_gemma":0.0011806176,"threshold_uncertainty_score":0.06559676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045730934,0.00022214117,0.91284895,0.00035410316,0.00024145897,0.00030267518,0.0010406455,0.012330613,0.026928477],"genre_scores_gemma":[0.713714,0.00018988385,0.2674671,0.00029183895,0.00004410877,0.00020181655,0.0021510066,0.0012987672,0.014641515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859816,0.00025459487,0.000109404595,0.0003074391,0.00041838855,0.00031191861],"domain_scores_gemma":[0.99845684,0.0007495956,0.00007112969,0.00039371065,0.0002861337,0.000042557036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088392774,0.0009629375,0.000980096,0.0008041587,0.0008099797,0.0021371646,0.0012244029,0.0009590143,0.018030217],"category_scores_gemma":[0.0032662787,0.00064975396,0.0016641802,0.0006044553,0.0011319903,0.0026773622,0.0027952895,0.0016381316,0.00466685],"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.0009761894,0.00020896744,0.0017659665,0.0008177775,0.00014312442,0.0009223018,0.00047420617,0.05491518,0.033890165,0.4897629,0.017793102,0.3983302],"study_design_scores_gemma":[0.00014769603,0.00013158888,0.00062598434,0.00014275764,0.00008987303,0.00024433332,0.00026477283,0.32553396,0.051014382,0.6054536,0.016288351,0.000062706844],"about_ca_topic_score_codex":0.002439081,"about_ca_topic_score_gemma":0.0031241577,"teacher_disagreement_score":0.018030217,"about_ca_system_score_codex":0.00095921115,"about_ca_system_score_gemma":0.0015113781,"threshold_uncertainty_score":0.0603171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012845013,0.0002949851,0.005788705,0.0053540496,0.0025947578,0.00012074504,0.0023625956,0.0049776607,0.97722197],"genre_scores_gemma":[0.015242432,0.00030576708,0.0030208726,0.0013225506,0.0003503919,0.000062288476,0.0019777422,0.0014297483,0.9762882],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996586,0.00004887708,0.000011435673,0.000048406106,0.00018404829,0.000048713468],"domain_scores_gemma":[0.99880826,0.00019552953,0.000039347644,0.00010304861,0.0004932437,0.00036059716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005370252,0.00052540726,0.00029745267,0.0009230478,0.0015576391,0.002438617,0.0011384485,0.0008562583,0.46565],"category_scores_gemma":[0.002436786,0.00022722852,0.0002414659,0.0008790302,0.00045961994,0.002040338,0.0017681387,0.0010635898,0.15198353],"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.000034776218,0.0000178024,0.000100734425,0.000027259173,0.000001343913,0.00005848354,0.00004599006,0.00008589715,0.0002201489,0.008366714,0.95324355,0.037797313],"study_design_scores_gemma":[0.000011266367,0.000008255963,0.00019676659,0.000027832695,0.0000014940002,0.0000672104,0.0000625878,0.000540549,0.00053275004,0.0020838543,0.99646217,0.0000054205093],"about_ca_topic_score_codex":0.011092133,"about_ca_topic_score_gemma":0.037037805,"teacher_disagreement_score":0.46565,"about_ca_system_score_codex":0.0012665613,"about_ca_system_score_gemma":0.0010072687,"threshold_uncertainty_score":0.76218545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076176256,0.00010028042,0.9162407,0.00031731912,0.00023816313,0.00019422022,0.00009834139,0.003307287,0.0033274223],"genre_scores_gemma":[0.51112705,0.00006875631,0.48174194,0.00015609727,0.00006200245,0.00027209547,0.00028801482,0.00019594225,0.0060880557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994825,0.000112644775,0.000033212575,0.00014848691,0.00015086781,0.000072259434],"domain_scores_gemma":[0.99895906,0.000425086,0.00006380034,0.00010269937,0.0003546061,0.00009471203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122774,0.0006951785,0.0006841342,0.00045923828,0.00040844476,0.0007311379,0.0011223081,0.0012228894,0.004482942],"category_scores_gemma":[0.003460127,0.00048690752,0.00042414485,0.0002639893,0.00042901153,0.0011406357,0.0007806751,0.0013919942,0.0014576217],"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.00048578164,0.00064779655,0.0078085396,0.00018999142,0.00017459519,0.00035376262,0.00023470308,0.27957654,0.040649258,0.0082981875,0.007933159,0.6536477],"study_design_scores_gemma":[0.000022083474,0.000092153925,0.0002868669,0.0000053410467,0.000009314373,0.000040595303,0.00001551914,0.9924396,0.0044744504,0.0013602263,0.0012458353,0.0000080660175],"about_ca_topic_score_codex":0.0012230043,"about_ca_topic_score_gemma":0.0014040907,"teacher_disagreement_score":0.004482942,"about_ca_system_score_codex":0.00028642965,"about_ca_system_score_gemma":0.00053478434,"threshold_uncertainty_score":0.014997005},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023732513,0.003555124,0.29019025,0.0017571367,0.0005471836,0.00022140161,0.00028811293,0.00093452854,0.6787737],"genre_scores_gemma":[0.5511356,0.0036422953,0.16168919,0.00058863795,0.0002978436,0.00037804665,0.00069802295,0.00035915454,0.2812112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997423,0.00007713835,0.00001162726,0.000053513562,0.00007050297,0.00004476102],"domain_scores_gemma":[0.9998323,0.00006783459,0.000010986029,0.000040055824,0.00002262347,0.000026160647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021245363,0.0007938267,0.00047576564,0.00030955777,0.0007305281,0.0019154705,0.0011854323,0.0011043645,0.017473893],"category_scores_gemma":[0.0009321669,0.00034745113,0.00069096906,0.000591079,0.0012593565,0.001783262,0.0011583152,0.0016715069,0.0029343923],"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.00010409593,0.0000896476,0.00021180211,0.00029434962,0.000038952265,0.00013278605,0.0003382234,0.03560063,0.002592228,0.86776495,0.017659888,0.075172395],"study_design_scores_gemma":[0.000046629677,0.000040785013,0.00022492059,0.00006120092,0.000017578022,0.0001989587,0.0000822739,0.06340925,0.0012600626,0.844324,0.09031923,0.000015131684],"about_ca_topic_score_codex":0.0012842153,"about_ca_topic_score_gemma":0.0016991072,"teacher_disagreement_score":0.017473893,"about_ca_system_score_codex":0.0007149421,"about_ca_system_score_gemma":0.00057763123,"threshold_uncertainty_score":0.058456063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12592284,0.000324165,0.8639535,0.0004663053,0.00007212723,0.00016041944,0.00007017383,0.00045135018,0.008579169],"genre_scores_gemma":[0.5233476,0.00019811862,0.4612133,0.00023495665,0.000066588,0.0001628581,0.0002216892,0.00017240198,0.01438247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994722,0.00015423361,0.000032491087,0.00014582727,0.00012326353,0.00007195742],"domain_scores_gemma":[0.9971973,0.0018092303,0.00011960375,0.00025146632,0.0004914043,0.00013105133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449754,0.0003989793,0.0013334017,0.0014258553,0.000917153,0.0014693988,0.002385359,0.0018419789,0.0043007536],"category_scores_gemma":[0.0052996273,0.0004790154,0.0009329124,0.0012118876,0.0010701877,0.0019332165,0.0012461477,0.0011468317,0.00054521085],"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.00022621271,0.00046598833,0.008290742,0.00021905913,0.00014513776,0.0003273579,0.00051997893,0.40634784,0.0076006046,0.049732406,0.003361919,0.5227627],"study_design_scores_gemma":[0.000009926537,0.00003191955,0.00041157362,0.0000086260525,0.000015784724,0.000060552386,0.0000482629,0.9841202,0.00070168247,0.014162925,0.00042160435,0.0000069141156],"about_ca_topic_score_codex":0.0034160207,"about_ca_topic_score_gemma":0.0036183163,"teacher_disagreement_score":0.0043007536,"about_ca_system_score_codex":0.00071537896,"about_ca_system_score_gemma":0.0007859392,"threshold_uncertainty_score":0.014387429},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04062356,0.0601929,0.2308291,0.43587255,0.0045616445,0.000097175405,0.00028204144,0.0007968363,0.22674409],"genre_scores_gemma":[0.7511286,0.043364264,0.11843472,0.015982203,0.008176663,0.00031660593,0.0003052684,0.000660578,0.06163109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683654,0.0011639952,0.00009960191,0.00044502842,0.0012167636,0.00023806916],"domain_scores_gemma":[0.9841283,0.010944152,0.00045241578,0.0009304196,0.0017943614,0.0017504239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008167002,0.00065164233,0.0012247628,0.001074536,0.0013717401,0.00921444,0.0020811558,0.003764237,0.011139101],"category_scores_gemma":[0.016823258,0.00030934685,0.000651997,0.0010690994,0.007227493,0.026452793,0.0027041193,0.008311839,0.0022330543],"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.00012248142,0.00011468587,0.0004728251,0.00022567048,0.000026018108,0.0000663296,0.00090128626,0.00182964,0.00071043114,0.8726541,0.017629642,0.10524688],"study_design_scores_gemma":[0.000034407145,0.00010497304,0.00027813006,0.00011255575,0.000011951147,0.00012317042,0.0013871371,0.00906658,0.00044324927,0.89537424,0.09304126,0.000022492137],"about_ca_topic_score_codex":0.0009483669,"about_ca_topic_score_gemma":0.0012396477,"teacher_disagreement_score":0.011139101,"about_ca_system_score_codex":0.001823539,"about_ca_system_score_gemma":0.0021280807,"threshold_uncertainty_score":0.04319173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73020494,0.00046597613,0.15725136,0.0020957082,0.00004782415,0.00011151998,0.000030363211,0.00025376177,0.109538645],"genre_scores_gemma":[0.9919733,0.000037604797,0.00546211,0.000046295598,0.000007848122,0.000016033546,0.000011817479,0.000024352388,0.0024207588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969469,0.001981412,0.00008817309,0.0003944106,0.0003431182,0.0002460375],"domain_scores_gemma":[0.9945977,0.0029660792,0.00070499984,0.0010068903,0.00036618675,0.00035818075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019294048,0.00044169903,0.00024586244,0.00077692606,0.0012922955,0.003908828,0.00089282525,0.0010468409,0.0024822978],"category_scores_gemma":[0.010905609,0.00032416102,0.00040278365,0.00032303864,0.007585927,0.006822598,0.0032712065,0.0020143853,0.00022996758],"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.0005328159,0.00028877723,0.02686401,0.0002123352,0.00008452694,0.0011257266,0.31629682,0.005755986,0.0097744735,0.53100723,0.0015156082,0.10654168],"study_design_scores_gemma":[0.000093528964,0.00077095634,0.05763031,0.00022739885,0.00012461949,0.002853155,0.10010928,0.051559005,0.015205472,0.7115832,0.0596105,0.00023258776],"about_ca_topic_score_codex":0.0012111801,"about_ca_topic_score_gemma":0.000954357,"teacher_disagreement_score":0.003908828,"about_ca_system_score_codex":0.0013297196,"about_ca_system_score_gemma":0.00037078405,"threshold_uncertainty_score":0.010203779},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00959935,0.023121858,0.5288864,0.020237561,0.0006462939,0.00026945595,0.00017876574,0.0005427046,0.41651767],"genre_scores_gemma":[0.6169454,0.025244175,0.28855816,0.003191573,0.0010729095,0.0006979617,0.00033411276,0.00025772452,0.06369799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867564,0.00065134675,0.00007763804,0.0002192361,0.00027304885,0.00010306657],"domain_scores_gemma":[0.9987066,0.0008117939,0.00010058484,0.00012283654,0.00014632217,0.00011186452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017704886,0.0008297264,0.0005829853,0.0023284934,0.0015953036,0.008801316,0.0023462733,0.0024296632,0.0067828577],"category_scores_gemma":[0.0025422836,0.0005214578,0.00096281595,0.001177667,0.00937796,0.008797278,0.003069214,0.0025211638,0.0011792734],"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.00001119993,0.000019782337,0.00023033566,0.00015475586,0.000025850464,0.00013409632,0.0013016803,0.0038539052,0.00024711623,0.9772207,0.0027469196,0.014053682],"study_design_scores_gemma":[0.000017425176,0.000035389392,0.00022327935,0.00019227406,0.000031810767,0.00026232746,0.0013347153,0.015471489,0.0005816987,0.81184095,0.1699842,0.000024447796],"about_ca_topic_score_codex":0.0035244834,"about_ca_topic_score_gemma":0.0028203845,"teacher_disagreement_score":0.008801316,"about_ca_system_score_codex":0.0037321264,"about_ca_system_score_gemma":0.002186967,"threshold_uncertainty_score":0.027078629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012458639,0.00021964825,0.96628433,0.0006242807,0.0000620296,0.00006932432,0.000072621966,0.00021007049,0.019999081],"genre_scores_gemma":[0.66954917,0.0005645758,0.29204583,0.00021375422,0.000109104825,0.0004581185,0.00017868234,0.00019330451,0.036687467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994,0.00024734958,0.000022587976,0.00009443808,0.0001575974,0.00007798119],"domain_scores_gemma":[0.9987864,0.0008833941,0.000067667796,0.000055739358,0.000114518385,0.000092327966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013339098,0.00086241384,0.0013494978,0.0008636235,0.0006045509,0.001297028,0.0019587267,0.0022410322,0.009325158],"category_scores_gemma":[0.005734557,0.0007363685,0.0006321589,0.00084354565,0.0010972363,0.002331587,0.0016220594,0.002230701,0.0006299282],"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.00004173743,0.000035895875,0.000093232724,0.000035318168,0.000016647187,0.000037471822,0.000042471947,0.8322691,0.00024455844,0.14923368,0.0016854354,0.016264515],"study_design_scores_gemma":[0.00001571139,0.000010697504,0.000024203628,0.000006533898,0.0000044629696,0.000010033507,0.0000057400725,0.9328605,0.000073544994,0.06630416,0.00067927706,0.000005198043],"about_ca_topic_score_codex":0.0057458347,"about_ca_topic_score_gemma":0.006257306,"teacher_disagreement_score":0.009325158,"about_ca_system_score_codex":0.0027252068,"about_ca_system_score_gemma":0.0019173741,"threshold_uncertainty_score":0.0311957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017720796,0.0019057976,0.6064783,0.003605474,0.0004986411,0.00012107102,0.0003704946,0.0024138922,0.36688548],"genre_scores_gemma":[0.22741358,0.0028935669,0.57534266,0.0012164766,0.00019784259,0.0002816137,0.0015969527,0.0011015931,0.18995568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950147,0.00017338317,0.000024725758,0.00013751494,0.00010547669,0.000057443398],"domain_scores_gemma":[0.9994887,0.00023851845,0.00002693573,0.00013610283,0.00005851527,0.000051249215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049358874,0.001068806,0.00051783386,0.00032025337,0.0009713082,0.0029918617,0.0016702532,0.0012689534,0.03479639],"category_scores_gemma":[0.0017855298,0.00045072293,0.00058577186,0.0004671786,0.0023720597,0.0064241905,0.0028524448,0.001929921,0.0063949283],"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.00012744748,0.00007735464,0.00045251308,0.0005504238,0.00004398783,0.00010561294,0.0016315486,0.010421984,0.0026243047,0.6652813,0.0416479,0.27703568],"study_design_scores_gemma":[0.000029482433,0.000047063393,0.00021550922,0.00024102099,0.000017931077,0.00016058215,0.0010270653,0.01984078,0.0036929406,0.75663495,0.21807274,0.0000199502],"about_ca_topic_score_codex":0.0018898248,"about_ca_topic_score_gemma":0.0028036681,"teacher_disagreement_score":0.03479639,"about_ca_system_score_codex":0.0006343367,"about_ca_system_score_gemma":0.0011067733,"threshold_uncertainty_score":0.11640549},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016317982,0.0012549694,0.27485502,0.001638038,0.0007414799,0.00012049367,0.00066757994,0.0013356354,0.7030688],"genre_scores_gemma":[0.30501428,0.0023874163,0.11080562,0.0011415808,0.0007050875,0.00025119327,0.0022689581,0.002526062,0.5748998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.000114615155,0.000032441694,0.0002131861,0.00028255553,0.00013671744],"domain_scores_gemma":[0.9992449,0.00011771544,0.000045613273,0.00029605994,0.00023811805,0.000057541154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006884995,0.0013308477,0.0010133673,0.0036940253,0.0025512327,0.0032684589,0.0019401661,0.0015715976,0.049235802],"category_scores_gemma":[0.0028678132,0.00056929875,0.0018549017,0.0018286653,0.0020047838,0.005253444,0.0037824863,0.003335767,0.017901333],"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.000032179945,0.000020067393,0.00019689345,0.000059373855,0.000011182849,0.000060584814,0.00011224568,0.00064353744,0.0010123514,0.9644088,0.007194337,0.026248438],"study_design_scores_gemma":[0.000010329082,0.00002326971,0.00039381481,0.000072990035,0.00003509251,0.0002065527,0.00014151983,0.009368367,0.0024513132,0.91274464,0.07452647,0.000025661893],"about_ca_topic_score_codex":0.002045251,"about_ca_topic_score_gemma":0.0022606796,"teacher_disagreement_score":0.049235802,"about_ca_system_score_codex":0.0013887468,"about_ca_system_score_gemma":0.0013115897,"threshold_uncertainty_score":0.16471016},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04781433,0.001095441,0.30057874,0.009122144,0.0006155196,0.0004181928,0.0004856132,0.00038389108,0.63948613],"genre_scores_gemma":[0.7887831,0.00093577034,0.060881514,0.0012250247,0.00029099634,0.00047841007,0.0005153028,0.00008009508,0.14680986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988739,0.0004785635,0.00003986613,0.00016541017,0.0003266107,0.00011564992],"domain_scores_gemma":[0.99810046,0.0011188042,0.00008802124,0.00016233028,0.00025050802,0.0002799295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874527,0.00085207366,0.0005658846,0.00057007035,0.0010396576,0.0031740568,0.0011207616,0.0014043027,0.018856132],"category_scores_gemma":[0.0059050927,0.00024131584,0.0005086079,0.00060085615,0.0020772102,0.004218219,0.0016862738,0.0028758394,0.0017383355],"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.000024606561,0.000034349367,0.000047115525,0.000026470558,0.00000622989,0.000014758425,0.00007760203,0.0014169378,0.00012068098,0.9843396,0.004325771,0.009565762],"study_design_scores_gemma":[0.000036274356,0.000025041516,0.000051320247,0.000013439008,0.0000057584175,0.000027174015,0.00004616495,0.011558329,0.00016427005,0.9733164,0.014750655,0.0000052016912],"about_ca_topic_score_codex":0.0011746953,"about_ca_topic_score_gemma":0.0010877444,"teacher_disagreement_score":0.018856132,"about_ca_system_score_codex":0.0014048999,"about_ca_system_score_gemma":0.0013182089,"threshold_uncertainty_score":0.06308007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046721138,0.00079664314,0.6585521,0.0033578703,0.00069029117,0.00021175803,0.0005690461,0.0014823817,0.28761882],"genre_scores_gemma":[0.48921028,0.0010753503,0.4241073,0.00060153945,0.00027918944,0.00023687769,0.0007100847,0.00060247234,0.08317692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.00007542461,0.000012791251,0.000068577894,0.00006761682,0.000056625315],"domain_scores_gemma":[0.99950814,0.00031094177,0.000020533258,0.000061318584,0.00005313148,0.000045952966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051571307,0.0005691191,0.0007830544,0.0005616056,0.0014173945,0.001531574,0.0012316386,0.0025954996,0.02102217],"category_scores_gemma":[0.0035274974,0.00018234696,0.0009848399,0.0009282111,0.0013336348,0.00286401,0.002551847,0.0018356283,0.0019003528],"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.00010234181,0.000063252955,0.00053441373,0.00015512214,0.000015766935,0.00024583135,0.00027416833,0.01718242,0.0012142808,0.85694623,0.022770032,0.100496195],"study_design_scores_gemma":[0.000034703207,0.000017634295,0.00020181708,0.000027927766,0.000011273361,0.00017893495,0.00015330318,0.063231185,0.00077990023,0.914247,0.021102402,0.000013842702],"about_ca_topic_score_codex":0.005476586,"about_ca_topic_score_gemma":0.0050072446,"teacher_disagreement_score":0.02102217,"about_ca_system_score_codex":0.0007564833,"about_ca_system_score_gemma":0.00078408926,"threshold_uncertainty_score":0.07032615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052863993,0.0019063365,0.7546715,0.00094752776,0.00049245305,0.00081924925,0.035411898,0.059157163,0.093729764],"genre_scores_gemma":[0.2514788,0.0011949558,0.61383724,0.0004741405,0.000091423615,0.0004947421,0.073778726,0.004030494,0.054619424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.000110024375,0.00012686478,0.0003872267,0.0005364418,0.00012936548],"domain_scores_gemma":[0.9986644,0.00022489153,0.00006408082,0.00063844904,0.00031022157,0.00009799779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080653536,0.0010288542,0.0015400075,0.002890054,0.0011336381,0.004998484,0.0055028405,0.0010670399,0.035551902],"category_scores_gemma":[0.004562177,0.0015126899,0.0017368648,0.0027176207,0.0006887892,0.0069416286,0.0033092678,0.0013890371,0.016003784],"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.0009077816,0.00044584146,0.005024471,0.0005913629,0.00025817647,0.00048268324,0.00067555247,0.03244142,0.0061868834,0.11074365,0.17239368,0.6698484],"study_design_scores_gemma":[0.0002658469,0.00034992935,0.0030572088,0.0003106726,0.00031035778,0.0008234819,0.0011455626,0.36706793,0.035970014,0.15290223,0.43763235,0.00016445294],"about_ca_topic_score_codex":0.013356317,"about_ca_topic_score_gemma":0.022439362,"teacher_disagreement_score":0.035551902,"about_ca_system_score_codex":0.0012200988,"about_ca_system_score_gemma":0.0017639861,"threshold_uncertainty_score":0.11893296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021946544,0.000067341476,0.99193,0.00011138865,0.000032322627,0.00022801083,0.00011647953,0.0011286273,0.004191222],"genre_scores_gemma":[0.063872576,0.00009546327,0.9281555,0.00011696047,0.000045685556,0.0004636415,0.0006711558,0.00023323987,0.0063457945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976489,0.0007860214,0.00018058848,0.00042638823,0.00084532145,0.00011278242],"domain_scores_gemma":[0.99342877,0.0047087446,0.00016682873,0.0007679502,0.0007947527,0.00013291692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003452685,0.0008583802,0.0007325431,0.0025162129,0.0009951077,0.0026850393,0.004463186,0.0015176674,0.020790966],"category_scores_gemma":[0.010366132,0.0008320842,0.001179306,0.0015615283,0.0011969255,0.0032003773,0.0037451766,0.0016904749,0.0033120778],"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.00025338444,0.0003366774,0.0007397662,0.00025273982,0.000065294436,0.00022935121,0.0005138213,0.018031158,0.0075023505,0.08785381,0.01119673,0.873025],"study_design_scores_gemma":[0.00012929227,0.00011819804,0.0004958851,0.00013804997,0.00009354042,0.00049830927,0.00022451897,0.75052625,0.016026562,0.1971165,0.034590974,0.00004199844],"about_ca_topic_score_codex":0.001270424,"about_ca_topic_score_gemma":0.0020117287,"teacher_disagreement_score":0.020790966,"about_ca_system_score_codex":0.00060134626,"about_ca_system_score_gemma":0.0011075584,"threshold_uncertainty_score":0.06955272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057808585,0.00043450083,0.88826174,0.0004646884,0.00013100103,0.00016641569,0.00009533046,0.0022197934,0.050417922],"genre_scores_gemma":[0.7220889,0.0003775728,0.2287658,0.00012990422,0.00003570115,0.0002471632,0.00025594543,0.00018718878,0.047911853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997316,0.000085196945,0.00001907071,0.000059941194,0.00007410586,0.000030011539],"domain_scores_gemma":[0.9997323,0.000104083265,0.000019211318,0.00005256785,0.00007124099,0.000020602718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048566598,0.00043040115,0.00048681864,0.00020529171,0.0006059735,0.0015556085,0.0014039704,0.0007105122,0.006781711],"category_scores_gemma":[0.0013307229,0.00023200428,0.00027756745,0.00024472884,0.00083215395,0.0014657311,0.001537879,0.0006766949,0.0012861327],"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.00032072354,0.0003058504,0.0009141797,0.00022201924,0.00007413334,0.00033565122,0.0014809641,0.17320584,0.03762806,0.46617705,0.010180367,0.3091552],"study_design_scores_gemma":[0.000048184636,0.00010094555,0.00030745592,0.000026190337,0.000038483096,0.00012822612,0.00017781528,0.87133545,0.011579261,0.095335215,0.020900767,0.000022026772],"about_ca_topic_score_codex":0.0009459759,"about_ca_topic_score_gemma":0.0010306062,"teacher_disagreement_score":0.006781711,"about_ca_system_score_codex":0.00043970963,"about_ca_system_score_gemma":0.00030620047,"threshold_uncertainty_score":0.022687018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029855495,0.0012637858,0.9155656,0.00031689488,0.00025973064,0.00018256635,0.0001262937,0.0006835953,0.05174613],"genre_scores_gemma":[0.5191609,0.0012133255,0.45034465,0.00014260519,0.00015859285,0.00042993526,0.00030646313,0.00032794423,0.027915526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.0002233347,0.000023069928,0.000046715737,0.000113873866,0.000057788213],"domain_scores_gemma":[0.99897563,0.0007732747,0.000037465186,0.00006740011,0.00010291698,0.000043312208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075908046,0.0008415679,0.0012482628,0.0009730551,0.00072116824,0.0012901605,0.001325956,0.0010630175,0.007682535],"category_scores_gemma":[0.00412795,0.00045881802,0.0006725438,0.0015565293,0.0009983925,0.0010375506,0.0010202996,0.0013294765,0.0006067161],"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.00013462872,0.00008338514,0.00023287017,0.00019213685,0.000047425052,0.000077791796,0.00015157385,0.6765925,0.00068985444,0.18466225,0.006019976,0.13111554],"study_design_scores_gemma":[0.000038454855,0.00003130394,0.00007324739,0.000021909578,0.000012213814,0.000015756726,0.000023191587,0.918103,0.00023656616,0.07917517,0.0022609916,0.000008236741],"about_ca_topic_score_codex":0.008775077,"about_ca_topic_score_gemma":0.007777463,"teacher_disagreement_score":0.008775077,"about_ca_system_score_codex":0.0011471836,"about_ca_system_score_gemma":0.0014330981,"threshold_uncertainty_score":0.025700629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13428372,0.00047695293,0.7557844,0.0014269567,0.00022570758,0.00007615717,0.00013633845,0.0007223035,0.106867515],"genre_scores_gemma":[0.9117844,0.00039500443,0.047898233,0.00025660053,0.000057867663,0.000072898714,0.0001010561,0.000088517896,0.039345354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998036,0.000070245675,0.000005984118,0.000038365088,0.000041176103,0.000040684976],"domain_scores_gemma":[0.99920636,0.00055146636,0.000064050626,0.00007714363,0.00003727474,0.00006371385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046806026,0.0005716583,0.0004186029,0.00026781735,0.00028435225,0.00073875446,0.00085940654,0.0013741114,0.006808908],"category_scores_gemma":[0.0033077316,0.00033462295,0.0004304026,0.00024866572,0.0008395687,0.0016470632,0.0012467994,0.0013932734,0.00057414855],"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.00018853274,0.0000692957,0.00072462327,0.00010588929,0.000058944916,0.000123706,0.0001438166,0.58294326,0.0035128307,0.36059356,0.004631494,0.04690404],"study_design_scores_gemma":[0.000015164716,0.0000232276,0.000121802026,0.000012679965,0.000008650382,0.000029548284,0.000020000083,0.846444,0.00066868315,0.15148364,0.001163467,0.000009123739],"about_ca_topic_score_codex":0.0017876576,"about_ca_topic_score_gemma":0.0025341457,"teacher_disagreement_score":0.006808908,"about_ca_system_score_codex":0.0005623027,"about_ca_system_score_gemma":0.0003738416,"threshold_uncertainty_score":0.022778034},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14926037,0.00033626132,0.83940816,0.00028456148,0.000036687317,0.0003568231,0.00028331828,0.0035473453,0.006486551],"genre_scores_gemma":[0.47932923,0.00018803625,0.5172601,0.0001083304,0.000016525402,0.00017734623,0.00052120286,0.0003501834,0.0020490412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981793,0.0006595674,0.000096588825,0.0002498421,0.00056867074,0.0002459935],"domain_scores_gemma":[0.99505675,0.003736038,0.0002566379,0.00056704914,0.00028126733,0.000102280435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834385,0.0008475589,0.0010481252,0.0010627076,0.00093114877,0.0012491565,0.0018905982,0.001045594,0.0019989973],"category_scores_gemma":[0.009421877,0.0005519302,0.0008015537,0.0009748232,0.00087014766,0.0023743887,0.0014256496,0.0015078944,0.0004074968],"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.0009062115,0.00062660786,0.0035678875,0.0005989952,0.00014450101,0.00065352063,0.0010434843,0.3688513,0.044172566,0.08037258,0.008802985,0.49025935],"study_design_scores_gemma":[0.00007857651,0.00012015186,0.0008476945,0.000038387425,0.00003667431,0.00020544339,0.00010905326,0.94491047,0.01438736,0.03616635,0.0030763377,0.000023408253],"about_ca_topic_score_codex":0.005162003,"about_ca_topic_score_gemma":0.010893296,"teacher_disagreement_score":0.005162003,"about_ca_system_score_codex":0.0007591719,"about_ca_system_score_gemma":0.0014109651,"threshold_uncertainty_score":0.01026392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2310311,0.00076043064,0.39655563,0.0022728508,0.00051508914,0.000502097,0.0011158504,0.0009995786,0.3662473],"genre_scores_gemma":[0.8640892,0.00040226988,0.060348585,0.0010348337,0.00015927336,0.00040846915,0.00081949256,0.00017137294,0.07256652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.00029034851,0.0000656871,0.00026569932,0.00026360175,0.00032539017],"domain_scores_gemma":[0.9978746,0.0007158764,0.0002443202,0.0003594728,0.00030833107,0.0004973733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007350199,0.0006785092,0.00088375085,0.0007134726,0.002379622,0.0025767721,0.0021263154,0.0017041204,0.01924008],"category_scores_gemma":[0.0045234645,0.00039551785,0.0006115361,0.0008246825,0.0024784175,0.0032010407,0.0029251364,0.0015611775,0.0023482754],"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.00021176298,0.00006114474,0.00033901806,0.00007412003,0.000012174501,0.00014622329,0.00019839994,0.0046038,0.0016918611,0.9781738,0.0043637957,0.010124015],"study_design_scores_gemma":[0.00010733315,0.000112608046,0.00047899806,0.000049784674,0.000026143616,0.0003078895,0.00027663467,0.08731787,0.002267207,0.86962014,0.03938769,0.000047761616],"about_ca_topic_score_codex":0.00257745,"about_ca_topic_score_gemma":0.002927148,"teacher_disagreement_score":0.01924008,"about_ca_system_score_codex":0.0015635072,"about_ca_system_score_gemma":0.0011872906,"threshold_uncertainty_score":0.06436449},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7771906,0.00040001166,0.21359223,0.00031301545,0.000037202695,0.0002867923,0.00018243655,0.00061220553,0.0073854676],"genre_scores_gemma":[0.9457737,0.00013753603,0.05267304,0.000041303603,0.000011074651,0.00013834902,0.00020962022,0.00006379729,0.00095158594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850464,0.000617103,0.000096873846,0.00026255107,0.00029930135,0.00021963441],"domain_scores_gemma":[0.99199003,0.006247494,0.0004960219,0.00041246874,0.00042497503,0.00042896098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036219573,0.0011560775,0.0010299736,0.0016873747,0.0004436748,0.0017206527,0.0011490262,0.0013973461,0.0018941739],"category_scores_gemma":[0.017147006,0.00050981063,0.0005852356,0.0006437755,0.0009248511,0.0018618114,0.0010089788,0.0006817771,0.00026241064],"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.00054504006,0.00022788942,0.006294585,0.00011792276,0.000092278715,0.000050714374,0.000089136796,0.9382081,0.001221678,0.0088688,0.000541057,0.043742705],"study_design_scores_gemma":[0.00003110738,0.00016989198,0.00056046585,0.000008200071,0.000014120779,0.00000933468,0.0000343607,0.99580485,0.0005876447,0.002628602,0.00014619717,0.0000051907477],"about_ca_topic_score_codex":0.0066272733,"about_ca_topic_score_gemma":0.004813312,"teacher_disagreement_score":0.0066272733,"about_ca_system_score_codex":0.0019377862,"about_ca_system_score_gemma":0.0023013668,"threshold_uncertainty_score":0.019154906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06575914,0.00082856254,0.9203934,0.000803294,0.000109636174,0.00014744188,0.00012831515,0.00032523155,0.011504987],"genre_scores_gemma":[0.8932854,0.00061445235,0.09580708,0.00028404524,0.000120770455,0.0003131363,0.00017480069,0.00014200088,0.009258234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811965,0.0012190563,0.00006338156,0.00019175657,0.00019601865,0.00021011328],"domain_scores_gemma":[0.9881231,0.0104867285,0.0003686802,0.00035449982,0.00032563138,0.00034139075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034272107,0.0010401575,0.0032667073,0.0008291008,0.0007271462,0.0015179174,0.0026873949,0.002739037,0.004050418],"category_scores_gemma":[0.019307887,0.0008751195,0.0010407126,0.001497103,0.002038983,0.0034582447,0.0021615534,0.0026883625,0.0005395241],"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.00015549427,0.00008831124,0.00035286412,0.00010934339,0.000066368644,0.000077079705,0.00010311788,0.85307676,0.00033108646,0.12886338,0.0025390692,0.014237177],"study_design_scores_gemma":[0.000024022267,0.000018694096,0.00004215231,0.000005997159,0.0000067559117,0.000011415206,0.0000061840487,0.9460487,0.00003517094,0.05360995,0.00018545265,0.000005456254],"about_ca_topic_score_codex":0.0045179264,"about_ca_topic_score_gemma":0.003808293,"teacher_disagreement_score":0.0045179264,"about_ca_system_score_codex":0.0014314811,"about_ca_system_score_gemma":0.0016543934,"threshold_uncertainty_score":0.018124998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01063268,0.00010229102,0.9852989,0.00009194667,0.000036604706,0.0000236242,0.000032115062,0.00039803344,0.0033838812],"genre_scores_gemma":[0.5572715,0.0001563428,0.4340591,0.00007467804,0.000054065156,0.00017562477,0.00018525204,0.00023835506,0.007785164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.000087203574,0.000017396775,0.000073128205,0.000057152258,0.00004063821],"domain_scores_gemma":[0.9992824,0.00046539618,0.00003090673,0.000099780234,0.00007655963,0.000045004508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073970685,0.0003036967,0.00058196514,0.00028506233,0.0003700947,0.0007387703,0.0011721501,0.00068996195,0.007835563],"category_scores_gemma":[0.0028499314,0.0002481849,0.0004855856,0.0002739206,0.0008181523,0.0015834981,0.0013503658,0.001356737,0.0007151493],"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.00022708684,0.00010308194,0.00092257035,0.00016580394,0.00003503419,0.000101614554,0.00023242085,0.17685357,0.006300105,0.33555767,0.0062522003,0.47324887],"study_design_scores_gemma":[0.000028629938,0.0000507419,0.00019269402,0.000021505151,0.000009448077,0.00003426179,0.00002144633,0.78400314,0.0019259498,0.21105081,0.0026511163,0.000010230667],"about_ca_topic_score_codex":0.0011320572,"about_ca_topic_score_gemma":0.0014297598,"teacher_disagreement_score":0.007835563,"about_ca_system_score_codex":0.0006459607,"about_ca_system_score_gemma":0.00038591272,"threshold_uncertainty_score":0.026212573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51762414,0.0017375379,0.1421049,0.0013749658,0.00017211355,0.0002436648,0.00012956056,0.00036180034,0.33625138],"genre_scores_gemma":[0.96140397,0.00027226645,0.025989735,0.000079105994,0.000029781306,0.000056296485,0.000038412367,0.00006495141,0.012065544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989605,0.0005171269,0.000042220014,0.00011251435,0.00025442895,0.000113119866],"domain_scores_gemma":[0.9930292,0.0053060255,0.00040935483,0.00047395323,0.0004910342,0.00029049456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011383394,0.00036267217,0.00036422792,0.00048522797,0.00075613055,0.0021286712,0.0010424902,0.0007788775,0.00676093],"category_scores_gemma":[0.014733868,0.00022337334,0.0003527985,0.00087557203,0.001408299,0.0032015017,0.00076144,0.0013735507,0.00030072415],"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.00044551792,0.0003476086,0.00279334,0.00023728282,0.000032722408,0.00027966825,0.0020295004,0.028437084,0.0037175762,0.87192804,0.0031012732,0.086650304],"study_design_scores_gemma":[0.00013791166,0.0009928219,0.007785539,0.00015388298,0.00014543957,0.0009895555,0.0025899692,0.6152101,0.005480876,0.3235342,0.04292035,0.00005937596],"about_ca_topic_score_codex":0.0067913504,"about_ca_topic_score_gemma":0.005027231,"teacher_disagreement_score":0.0067913504,"about_ca_system_score_codex":0.0013543855,"about_ca_system_score_gemma":0.0009723994,"threshold_uncertainty_score":0.022617519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016451437,0.001458288,0.9285676,0.00072972866,0.0005819944,0.00015310013,0.00017990555,0.0021262977,0.04975178],"genre_scores_gemma":[0.31489703,0.001095484,0.5907533,0.0010896403,0.00025444533,0.0005610456,0.0006722724,0.0017634153,0.08891339],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923825,0.0002878913,0.000037259044,0.00014114568,0.00020031347,0.00009506377],"domain_scores_gemma":[0.99904317,0.00042639163,0.000042930293,0.000332675,0.000108401764,0.000046451747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014416366,0.0009641153,0.0019316798,0.0009520756,0.00078332046,0.0012026993,0.0028300835,0.0017803726,0.018173791],"category_scores_gemma":[0.0042441073,0.0005752029,0.0011635998,0.0014741584,0.0011364726,0.0019515416,0.002680055,0.0024480668,0.0038596622],"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.0003872427,0.0001746173,0.00029257484,0.00042989725,0.00011746955,0.000093704024,0.00011134836,0.16650937,0.0031058476,0.25527674,0.028193392,0.54530776],"study_design_scores_gemma":[0.00011113938,0.00024941223,0.000175048,0.00011232309,0.000058701153,0.00020151975,0.00003707691,0.7202074,0.003204733,0.25237584,0.023230825,0.00003597808],"about_ca_topic_score_codex":0.0011327104,"about_ca_topic_score_gemma":0.0015173792,"teacher_disagreement_score":0.018173791,"about_ca_system_score_codex":0.00068496173,"about_ca_system_score_gemma":0.0011609885,"threshold_uncertainty_score":0.060797393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041444143,0.00011965848,0.9878226,0.00019017165,0.000020642554,0.00015956418,0.00017199708,0.00044925173,0.00692166],"genre_scores_gemma":[0.20961669,0.00033737902,0.78282803,0.00038058916,0.000084935135,0.0007231517,0.00061410764,0.00030771666,0.005107421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968274,0.0008835423,0.00016460329,0.0006478142,0.000990472,0.00048619995],"domain_scores_gemma":[0.9953928,0.0022456786,0.0006027162,0.0008748556,0.00060318795,0.00028082295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497685,0.0017283008,0.0010128046,0.0037107277,0.0014611079,0.0031200885,0.003678467,0.001638818,0.007250665],"category_scores_gemma":[0.011867723,0.00089617644,0.0029103954,0.0026398406,0.00429719,0.0072846073,0.0041880887,0.0052568465,0.0008735745],"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.0000434483,0.0000717059,0.0009080859,0.00018691238,0.0000760592,0.00015323189,0.00038242014,0.054743543,0.002577737,0.9076241,0.0020451562,0.031187648],"study_design_scores_gemma":[0.000019997608,0.000061341845,0.00046597817,0.000060518934,0.000054641834,0.0001447687,0.00013818062,0.18808761,0.0018150487,0.7981724,0.010941815,0.000037615177],"about_ca_topic_score_codex":0.005680443,"about_ca_topic_score_gemma":0.0064745713,"teacher_disagreement_score":0.007250665,"about_ca_system_score_codex":0.0021571643,"about_ca_system_score_gemma":0.0022379926,"threshold_uncertainty_score":0.024255872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008466088,0.000047732436,0.98920816,0.000042918964,0.000018419913,0.00014711898,0.00013415534,0.008147494,0.0014073888],"genre_scores_gemma":[0.04034992,0.00017253906,0.95330137,0.000079024954,0.000022965707,0.0002799352,0.00092748355,0.0012033865,0.0036633743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986695,0.00018048451,0.00014013785,0.00033563955,0.00048732958,0.0001870456],"domain_scores_gemma":[0.9991278,0.00020749112,0.000058526894,0.0002996778,0.00022641546,0.000080112906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016273081,0.0012134776,0.0011934725,0.0018396132,0.001000523,0.004617696,0.0039936607,0.0020130007,0.008266776],"category_scores_gemma":[0.0032066645,0.0011945519,0.0024488613,0.001072951,0.0014106097,0.0037753722,0.004332726,0.0025940274,0.0046948683],"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.00028765397,0.00050245255,0.00265998,0.00087629625,0.00022514121,0.00067178544,0.0011176842,0.078253284,0.024708327,0.41742662,0.034290638,0.43898007],"study_design_scores_gemma":[0.00004563172,0.000060656115,0.00056185224,0.00015905936,0.00010614945,0.00039779083,0.00020036448,0.7702995,0.019480843,0.123743795,0.08487236,0.00007195533],"about_ca_topic_score_codex":0.0060383026,"about_ca_topic_score_gemma":0.009443504,"teacher_disagreement_score":0.008266776,"about_ca_system_score_codex":0.0011363757,"about_ca_system_score_gemma":0.0018992499,"threshold_uncertainty_score":0.027655125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010493658,0.00027659207,0.9591679,0.00031574376,0.00015536584,0.00020652864,0.00030936545,0.00308686,0.025987996],"genre_scores_gemma":[0.123049065,0.00026320937,0.85692817,0.00031016022,0.00004906743,0.0004174313,0.00078699907,0.00048031588,0.017715616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994492,0.00008825862,0.000032017997,0.00012401353,0.00021708172,0.000089342335],"domain_scores_gemma":[0.99970144,0.0000675785,0.000016591412,0.00005542197,0.000121545854,0.000037365586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048362775,0.0005798736,0.00060215406,0.000725363,0.000734252,0.0011377637,0.0017078203,0.00062380644,0.011914691],"category_scores_gemma":[0.0018331391,0.00035999462,0.00056686974,0.0006991915,0.00048912363,0.0010963462,0.0023630226,0.0010564447,0.0034310073],"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.0004670485,0.00016458429,0.0015717456,0.0002991921,0.000063222884,0.00022642064,0.00019147452,0.15955824,0.006228558,0.10798187,0.03148611,0.6917615],"study_design_scores_gemma":[0.00019938569,0.00009108525,0.00027183487,0.00003471786,0.000034850054,0.00027478748,0.000061015653,0.8632748,0.0045941113,0.08180462,0.04933612,0.000022604641],"about_ca_topic_score_codex":0.004110648,"about_ca_topic_score_gemma":0.004154961,"teacher_disagreement_score":0.011914691,"about_ca_system_score_codex":0.0007508676,"about_ca_system_score_gemma":0.0018482616,"threshold_uncertainty_score":0.03985864},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74382013,0.0011080593,0.14281209,0.0015175475,0.00011299224,0.00052546745,0.005965794,0.0013049039,0.102833],"genre_scores_gemma":[0.9430969,0.00030961048,0.041154783,0.0000541828,0.000013177889,0.00012774416,0.005120677,0.00020854628,0.009914552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869883,0.00061065063,0.00007599162,0.0002222079,0.00030118163,0.00009113639],"domain_scores_gemma":[0.9943538,0.0042622965,0.00037423155,0.00034944178,0.0005394117,0.00012080001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009901696,0.00043402935,0.00017899537,0.0039998507,0.000962053,0.0038235206,0.00065499113,0.00044372704,0.007159432],"category_scores_gemma":[0.011985015,0.0002746502,0.0002925793,0.0028494624,0.00090990914,0.004610075,0.0014795709,0.00073422084,0.0012926488],"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.00042623465,0.00036040085,0.09093931,0.00069060194,0.00012742996,0.001583053,0.11160356,0.007277746,0.0107494285,0.28137073,0.026381241,0.46849018],"study_design_scores_gemma":[0.00004367951,0.00013668039,0.0680381,0.00084783457,0.0001508642,0.00179289,0.21114789,0.17421526,0.017842384,0.19863853,0.32701972,0.00012616938],"about_ca_topic_score_codex":0.010647447,"about_ca_topic_score_gemma":0.015267357,"teacher_disagreement_score":0.010647447,"about_ca_system_score_codex":0.001539847,"about_ca_system_score_gemma":0.0010495931,"threshold_uncertainty_score":0.023950696},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08216634,0.035866562,0.05242269,0.082483396,0.25544864,0.0036854704,0.010830176,0.0042333747,0.4728634],"genre_scores_gemma":[0.06848127,0.017233023,0.019511629,0.005753077,0.014480258,0.0010578985,0.012176268,0.0012487578,0.8600578],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969381,0.0006636274,0.000132815,0.0004944859,0.0012955703,0.00047540705],"domain_scores_gemma":[0.991638,0.0006496619,0.0001997993,0.0003535576,0.003387028,0.0037719465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007623432,0.0014312882,0.0012914675,0.001963137,0.0031281507,0.0070144124,0.0017839175,0.0020720677,0.06342376],"category_scores_gemma":[0.005306947,0.0005636082,0.0012287836,0.0014200946,0.00074875646,0.0047011,0.0053423517,0.0047306404,0.027023477],"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.00031633882,0.00050020503,0.0013000628,0.00022095007,0.00004682594,0.000272094,0.0008717403,0.00018450174,0.003276714,0.0024782396,0.9061248,0.084407546],"study_design_scores_gemma":[0.000052008094,0.00020821101,0.0037579485,0.00021259862,0.000052415347,0.00013830297,0.0014418036,0.0008345917,0.0024395075,0.0016983367,0.9891076,0.000056659752],"about_ca_topic_score_codex":0.0041025914,"about_ca_topic_score_gemma":0.010728722,"teacher_disagreement_score":0.06342376,"about_ca_system_score_codex":0.0016187092,"about_ca_system_score_gemma":0.0033075698,"threshold_uncertainty_score":0.21217358},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30355516,0.0012053236,0.67369854,0.0024658248,0.00006520126,0.00017406297,0.00018875355,0.00027581386,0.018371316],"genre_scores_gemma":[0.9624686,0.00034173366,0.036203366,0.00015979401,0.00004089012,0.000102874845,0.000080224825,0.000044853157,0.00055762264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945933,0.0036486054,0.00018894952,0.00052607124,0.00064950687,0.0003935538],"domain_scores_gemma":[0.87158555,0.116776675,0.004496633,0.0033936333,0.0020992933,0.0016482711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013354074,0.0009028104,0.0014530877,0.0018606262,0.0010544836,0.0030803606,0.0021400545,0.002660055,0.0021075788],"category_scores_gemma":[0.1386604,0.0007884886,0.0005330947,0.0011268132,0.0043702032,0.007522608,0.0023238866,0.0024847894,0.0002794389],"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.00019052766,0.00009558174,0.0067423033,0.00016811265,0.00007499042,0.00008690542,0.00047898194,0.6262693,0.00068739033,0.35159495,0.00089383847,0.0127172135],"study_design_scores_gemma":[0.000018651379,0.000049975646,0.0005643851,0.000025378356,0.00000895293,0.000025363866,0.00005182836,0.8919989,0.00024448094,0.10673746,0.00025848747,0.000016070015],"about_ca_topic_score_codex":0.0047032875,"about_ca_topic_score_gemma":0.0035766163,"teacher_disagreement_score":0.013354074,"about_ca_system_score_codex":0.002395117,"about_ca_system_score_gemma":0.0022875562,"threshold_uncertainty_score":0.070623934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091359936,0.00013908894,0.88190544,0.00065728824,0.00005056817,0.00011747836,0.00004391194,0.00015231853,0.025573904],"genre_scores_gemma":[0.88766205,0.0001393265,0.101770505,0.000112979265,0.00001585479,0.00015747505,0.00003987764,0.000031447707,0.010070411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.00016489174,0.000015724996,0.000056589826,0.000089741516,0.00003447424],"domain_scores_gemma":[0.9991817,0.00046142723,0.00011374439,0.00010944263,0.00008133288,0.0000523176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066957925,0.00042938502,0.0004241788,0.00021118468,0.000368771,0.001209262,0.0015293887,0.0010960329,0.0025302216],"category_scores_gemma":[0.0031786647,0.00021058046,0.00045593028,0.00013074698,0.0011305101,0.0013403007,0.0012097135,0.0015178272,0.0004423713],"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.00016007261,0.00011884813,0.0016607901,0.00007866905,0.000037331658,0.00031794916,0.0008675898,0.7271738,0.004020795,0.23850569,0.00069234805,0.026366064],"study_design_scores_gemma":[0.000014701634,0.000046060246,0.00010788167,0.000011480401,0.0000063766806,0.00004096496,0.000041214258,0.9761973,0.0005375561,0.02111609,0.0018730743,0.0000072263806],"about_ca_topic_score_codex":0.0022352939,"about_ca_topic_score_gemma":0.0028351315,"teacher_disagreement_score":0.0025302216,"about_ca_system_score_codex":0.00054227305,"about_ca_system_score_gemma":0.00063513435,"threshold_uncertainty_score":0.008464396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20696726,0.00019716934,0.7825389,0.0003674868,0.000029475117,0.00007261539,0.00017446427,0.00033936964,0.009313262],"genre_scores_gemma":[0.8738024,0.00015269859,0.122032836,0.00007277992,0.00001770324,0.00012323022,0.000305838,0.00009395912,0.0033985146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994198,0.00021468019,0.00002506685,0.00008157694,0.00015247498,0.00010640735],"domain_scores_gemma":[0.9977063,0.0016624875,0.00014686072,0.00023333439,0.000119742086,0.00013120277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847484,0.0008007704,0.0011046334,0.00063051016,0.00046319462,0.0019201821,0.0010994944,0.0012228581,0.0038435296],"category_scores_gemma":[0.008025653,0.000663685,0.000927936,0.0004877455,0.0015719008,0.0024517006,0.001890099,0.002196422,0.0003580333],"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.00006881055,0.000029755256,0.00040412153,0.000039954135,0.000014485066,0.000035471883,0.000106236635,0.9055353,0.00038311645,0.08786852,0.00039645462,0.0051177964],"study_design_scores_gemma":[0.0000070440046,0.000012912463,0.000043799555,0.0000040598875,0.0000017263062,0.000006450357,0.000017770068,0.9589349,0.00009587884,0.040727627,0.00014525898,0.000002595237],"about_ca_topic_score_codex":0.0048417896,"about_ca_topic_score_gemma":0.0057106433,"teacher_disagreement_score":0.0048417896,"about_ca_system_score_codex":0.0024500857,"about_ca_system_score_gemma":0.0014812979,"threshold_uncertainty_score":0.017776668},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030749196,0.0007174831,0.9528557,0.00037210007,0.00016921794,0.00022323843,0.00025981627,0.0014187767,0.013234546],"genre_scores_gemma":[0.49716175,0.00060577574,0.48763838,0.00063846045,0.00012617734,0.0006511672,0.0009406929,0.00055015064,0.011687443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983481,0.0005984497,0.00007463516,0.00040284908,0.00034537324,0.00023061031],"domain_scores_gemma":[0.9972046,0.0016959452,0.00018759345,0.00041039605,0.00033280937,0.00016860814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017791798,0.0011279339,0.0018120533,0.0013104465,0.0010850684,0.0015538943,0.0026665675,0.0016807282,0.008450348],"category_scores_gemma":[0.008654756,0.0007466285,0.0015089342,0.0010477563,0.0015342626,0.003023103,0.0025065634,0.001814951,0.001726358],"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.0006268406,0.00030780688,0.0036128445,0.00038756797,0.00022794184,0.0002057059,0.00027732042,0.6323479,0.0035903982,0.16955802,0.012639736,0.17621796],"study_design_scores_gemma":[0.00008037177,0.00009605775,0.00020229851,0.000028421897,0.000037097117,0.00007814394,0.000040428884,0.9313355,0.00094524876,0.06277035,0.0043665217,0.000019594872],"about_ca_topic_score_codex":0.0030476176,"about_ca_topic_score_gemma":0.0036493575,"teacher_disagreement_score":0.008450348,"about_ca_system_score_codex":0.001534592,"about_ca_system_score_gemma":0.002488694,"threshold_uncertainty_score":0.02826929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26246768,0.00030863698,0.7290012,0.0012678474,0.000025070434,0.00022920745,0.00012849896,0.00031591541,0.0062559373],"genre_scores_gemma":[0.82074755,0.00016897255,0.17782228,0.00008351651,0.000024794199,0.00020534608,0.0001701264,0.00009968563,0.0006777181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99186605,0.0046204925,0.00040354647,0.00094834913,0.0015682308,0.0005933565],"domain_scores_gemma":[0.9219545,0.07043582,0.002978899,0.00277209,0.00123344,0.0006251459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009364225,0.0010698319,0.0009960989,0.0015247632,0.0008291451,0.0038247216,0.0019434626,0.0016752796,0.002192683],"category_scores_gemma":[0.06638033,0.0009471271,0.0013364678,0.0006658346,0.0033487154,0.0076741935,0.0032484636,0.0027998325,0.00022364226],"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.0005565574,0.0003345305,0.008690473,0.0003059529,0.00013092895,0.00017242206,0.0005415619,0.6963454,0.0055157915,0.2181494,0.0009082206,0.068348855],"study_design_scores_gemma":[0.000038550177,0.00010221987,0.00049312797,0.000022038457,0.00002381969,0.000035007597,0.0001047319,0.8636763,0.0020944371,0.1328842,0.0005061408,0.000019472514],"about_ca_topic_score_codex":0.0019930976,"about_ca_topic_score_gemma":0.0026834996,"teacher_disagreement_score":0.009364225,"about_ca_system_score_codex":0.0022304505,"about_ca_system_score_gemma":0.001996632,"threshold_uncertainty_score":0.049523413},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24275978,0.0011488212,0.64152056,0.001227077,0.0014684807,0.0005153918,0.0004565004,0.0026463503,0.1082571],"genre_scores_gemma":[0.7647823,0.00063576654,0.19303212,0.0004812203,0.00018999145,0.00029156607,0.0005516408,0.0004952687,0.039540138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992526,0.00022314748,0.00004121067,0.0001842176,0.000133093,0.00016568923],"domain_scores_gemma":[0.9979328,0.0007811497,0.00019083667,0.00052166695,0.00015432142,0.00041925034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073547853,0.0008731609,0.0008988814,0.00073224615,0.0011685587,0.0021452939,0.0015462819,0.0012239331,0.014157332],"category_scores_gemma":[0.0053409203,0.00053663075,0.0009422725,0.0008117027,0.0010067846,0.0022864572,0.002342721,0.0017329545,0.002721776],"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.00093012134,0.0004606244,0.0024062279,0.0005504746,0.00023126103,0.000770955,0.0008478925,0.08124675,0.027671862,0.54920024,0.0321081,0.30357546],"study_design_scores_gemma":[0.00039598206,0.0005695525,0.0015139685,0.00015140948,0.0001920618,0.00070684095,0.00061972655,0.27023825,0.009776318,0.6549405,0.06079788,0.00009759001],"about_ca_topic_score_codex":0.0011010235,"about_ca_topic_score_gemma":0.0020371645,"teacher_disagreement_score":0.014157332,"about_ca_system_score_codex":0.0004537044,"about_ca_system_score_gemma":0.00044962435,"threshold_uncertainty_score":0.047360957},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015489132,0.0031404074,0.015140185,0.017647717,0.021032639,0.000846308,0.014300725,0.008842277,0.90356064],"genre_scores_gemma":[0.039954033,0.0012950749,0.009830309,0.0027925586,0.0021030344,0.0004845532,0.036174074,0.0019013309,0.90546507],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823976,0.0001914549,0.00004711834,0.00027269576,0.00083313225,0.00041587526],"domain_scores_gemma":[0.99639755,0.00014401201,0.000061006915,0.00015735127,0.00086869416,0.0023714297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029903897,0.0016593096,0.0011253313,0.0014767739,0.0033798697,0.007753618,0.002280697,0.0026843448,0.1844882],"category_scores_gemma":[0.0028774093,0.00056095264,0.0009352178,0.00083430967,0.00073577126,0.00274647,0.00413528,0.0037201846,0.11250099],"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.00047243398,0.00022931349,0.00026863642,0.000083789004,0.00001488102,0.00008504448,0.000053181775,0.00049649924,0.00081634254,0.0048141615,0.9652716,0.027394067],"study_design_scores_gemma":[0.00009430963,0.00012606634,0.00076897454,0.000031142816,0.000005992367,0.00006353158,0.00007885871,0.0014564884,0.0006236632,0.002272315,0.99445975,0.000018905563],"about_ca_topic_score_codex":0.008476402,"about_ca_topic_score_gemma":0.030354861,"teacher_disagreement_score":0.1844882,"about_ca_system_score_codex":0.0023169562,"about_ca_system_score_gemma":0.0038004715,"threshold_uncertainty_score":0.6171745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08119228,0.00012067236,0.9135093,0.00017662218,0.00004378118,0.0002909304,0.000109641376,0.0027690083,0.0017877241],"genre_scores_gemma":[0.61697453,0.000085372325,0.38103047,0.00008934903,0.00002575997,0.00016041328,0.00022424321,0.00018294247,0.0012268967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938269,0.0020189874,0.00048213877,0.0010435493,0.0021750368,0.0004532887],"domain_scores_gemma":[0.9789717,0.013493763,0.0028325415,0.0019877334,0.0020592785,0.00065493723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037195699,0.0012810212,0.0019186849,0.002088334,0.000999246,0.0019582682,0.0021527524,0.0011185239,0.0015146977],"category_scores_gemma":[0.022397215,0.0008191484,0.00089784956,0.00077934196,0.0014238445,0.002669829,0.0036598048,0.0022397053,0.0005556758],"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.0017915927,0.0009310767,0.03807762,0.00081249233,0.00042522355,0.0010144868,0.0023435855,0.22252204,0.08226396,0.06525373,0.0060265204,0.5785377],"study_design_scores_gemma":[0.000043175423,0.000084862935,0.0013395242,0.000019500447,0.000020339772,0.00017252557,0.00008569329,0.9651016,0.012206303,0.01976844,0.0011273407,0.00003082926],"about_ca_topic_score_codex":0.0035935652,"about_ca_topic_score_gemma":0.004400094,"teacher_disagreement_score":0.0037195699,"about_ca_system_score_codex":0.001092854,"about_ca_system_score_gemma":0.0020164223,"threshold_uncertainty_score":0.019671202},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16268489,0.00029838886,0.8240754,0.0003262347,0.00003932217,0.00010839001,0.00018255693,0.00065932213,0.011625537],"genre_scores_gemma":[0.70429194,0.00020216485,0.2908544,0.00008389795,0.000013728736,0.00013983878,0.00029135318,0.0001723981,0.003950199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997913,0.000070666305,0.000010585423,0.000048401915,0.000042355547,0.000036750458],"domain_scores_gemma":[0.9991339,0.0006403191,0.00006092392,0.000055179455,0.00007006104,0.00003959234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046512575,0.0005933509,0.0007007091,0.00048966944,0.000390756,0.0005984819,0.00066374417,0.000859109,0.002945678],"category_scores_gemma":[0.002414316,0.0005175935,0.00041532112,0.0004895159,0.0008218725,0.0010166009,0.000834644,0.0005980044,0.0003001527],"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.00006249222,0.000026767982,0.00038277108,0.00004661203,0.000012705596,0.00003739236,0.000046243604,0.9706449,0.0013012361,0.00750329,0.00066760054,0.019268004],"study_design_scores_gemma":[0.000016865455,0.000023685323,0.00013734728,0.0000049421237,0.0000043888595,0.000010766133,0.000017774542,0.9942345,0.00037525393,0.0048064734,0.00036428723,0.0000037353238],"about_ca_topic_score_codex":0.0090693,"about_ca_topic_score_gemma":0.009599763,"teacher_disagreement_score":0.0090693,"about_ca_system_score_codex":0.0009528983,"about_ca_system_score_gemma":0.0013084593,"threshold_uncertainty_score":0.018033028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008042659,0.000092173614,0.9899365,0.00023009705,0.00001853388,0.000038864557,0.000015403213,0.00023091768,0.0013947431],"genre_scores_gemma":[0.59849995,0.00026323285,0.39493454,0.0003150357,0.00011927612,0.00037527087,0.00014702376,0.00022770792,0.005117927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978933,0.0011177093,0.00007988201,0.00030569034,0.00041863963,0.00018474637],"domain_scores_gemma":[0.9957397,0.0029670235,0.00033624368,0.00047204414,0.00028008968,0.00020478085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037156013,0.001631034,0.0014669815,0.00066826434,0.00054930116,0.0016426953,0.0021169703,0.0018551704,0.0025687672],"category_scores_gemma":[0.012069319,0.0008449297,0.0012063535,0.00046474877,0.0017133483,0.003301578,0.0029923595,0.0029494897,0.00045733227],"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.000115702904,0.00011179979,0.00062468153,0.00010586222,0.00006081331,0.000055547218,0.00014056776,0.8845324,0.0010667302,0.07548194,0.0011512361,0.036552712],"study_design_scores_gemma":[0.0000125258075,0.000023645793,0.000048483234,0.0000072130656,0.0000044621606,0.000008819783,0.000005417722,0.9746449,0.00026267016,0.024687277,0.00029014854,0.000004419126],"about_ca_topic_score_codex":0.0026064955,"about_ca_topic_score_gemma":0.0025540933,"teacher_disagreement_score":0.0037156013,"about_ca_system_score_codex":0.0016002724,"about_ca_system_score_gemma":0.001851484,"threshold_uncertainty_score":0.01965022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9686025,0.00008148806,0.023286695,0.00014477374,0.00003334286,0.00016881498,0.000050892726,0.00040481356,0.0072267065],"genre_scores_gemma":[0.97750914,0.00011650583,0.019297222,0.00010766769,0.000017526037,0.0001437647,0.0000885744,0.00006399775,0.00265563],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939156,0.0002791629,0.00003857655,0.00007641247,0.00016622744,0.000048019323],"domain_scores_gemma":[0.99533844,0.003430776,0.00041553212,0.00028472694,0.00035082997,0.00017968191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068382,0.0005353622,0.00018388414,0.00022384858,0.00017466504,0.0010231711,0.00048203417,0.0005575059,0.0027897616],"category_scores_gemma":[0.009598812,0.00015846961,0.0001858219,0.00007945192,0.00033560809,0.00095250795,0.000949483,0.0005363357,0.00043030534],"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.0020384095,0.0028790478,0.023548493,0.0017702123,0.000112666065,0.000703638,0.013444339,0.0037647926,0.73715365,0.003896826,0.0017742679,0.20891365],"study_design_scores_gemma":[0.0009995879,0.02841683,0.2797956,0.0009375244,0.0009122946,0.0028704447,0.016765974,0.111928165,0.50232375,0.008895629,0.0456446,0.00050954625],"about_ca_topic_score_codex":0.00025469685,"about_ca_topic_score_gemma":0.0003659141,"teacher_disagreement_score":0.0027897616,"about_ca_system_score_codex":0.00014127562,"about_ca_system_score_gemma":0.000106274005,"threshold_uncertainty_score":0.009332716},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003152625,0.0031369699,0.7578676,0.0020457797,0.00090202066,0.0001862771,0.001187367,0.010778677,0.22074272],"genre_scores_gemma":[0.07886219,0.00629734,0.74734724,0.0024401387,0.0007464447,0.00071937294,0.0033245706,0.0093958145,0.15086682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711144,0.00080099015,0.0003379192,0.00053975644,0.00096384285,0.0002459777],"domain_scores_gemma":[0.99794596,0.0012034711,0.00010185954,0.00042051444,0.00022390485,0.00010430631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017449611,0.0014902899,0.0010736536,0.0015082131,0.0015954616,0.005815246,0.0017057168,0.0013255582,0.037385892],"category_scores_gemma":[0.0055037593,0.0013950366,0.0019688415,0.0023053149,0.0031970614,0.012369039,0.0037078287,0.0040173386,0.015505206],"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.00006210626,0.00003754626,0.0002534988,0.00035781565,0.000021869984,0.00014148044,0.00038598565,0.0011837599,0.0010873534,0.775462,0.061109964,0.15989675],"study_design_scores_gemma":[0.000026357086,0.000016269069,0.000118145894,0.00012810326,0.000017092492,0.0005138415,0.00010307364,0.0033447067,0.0011757402,0.45797804,0.5365526,0.000026033575],"about_ca_topic_score_codex":0.0014217984,"about_ca_topic_score_gemma":0.0023181348,"teacher_disagreement_score":0.037385892,"about_ca_system_score_codex":0.0013573929,"about_ca_system_score_gemma":0.0014285239,"threshold_uncertainty_score":0.12506825},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50322205,0.0019720576,0.425453,0.0009991957,0.00078016135,0.0035682982,0.004408872,0.025506532,0.034089886],"genre_scores_gemma":[0.7245337,0.0007889757,0.25776896,0.00020803905,0.00008062408,0.0015144967,0.0060823206,0.0015984632,0.007424521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974058,0.00067553687,0.0002509621,0.0003142227,0.000987555,0.00036581515],"domain_scores_gemma":[0.99462104,0.0012528594,0.00034096884,0.00073381036,0.0025270565,0.0005242143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034486332,0.0012562153,0.00065619993,0.0014519306,0.0005843613,0.0012437546,0.0030824917,0.0006190715,0.003995059],"category_scores_gemma":[0.007754554,0.0004320436,0.00037395512,0.0016153343,0.00053350086,0.0013863299,0.00075384043,0.0010041465,0.0007755015],"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.003924634,0.004197517,0.014051444,0.0022882558,0.00039891567,0.00063342,0.00048754225,0.2662616,0.10920058,0.024397405,0.048105396,0.5260533],"study_design_scores_gemma":[0.0008386514,0.0052691167,0.008051429,0.000108582186,0.00018164406,0.00042704822,0.00025352518,0.7762597,0.16536655,0.003385049,0.039720636,0.00013799498],"about_ca_topic_score_codex":0.008069289,"about_ca_topic_score_gemma":0.004382164,"teacher_disagreement_score":0.008069289,"about_ca_system_score_codex":0.0017597618,"about_ca_system_score_gemma":0.0019005953,"threshold_uncertainty_score":0.018238366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15956096,0.0005635124,0.8153501,0.00034731792,0.000047005848,0.00018564439,0.00025976717,0.0022461344,0.021439511],"genre_scores_gemma":[0.7022989,0.00025240317,0.29307932,0.00009870582,0.000019359371,0.00026045568,0.0004419545,0.00028115066,0.0032678277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.00020910983,0.000017499602,0.00005707952,0.000091166025,0.000058272297],"domain_scores_gemma":[0.99844897,0.001138662,0.000089062814,0.00014181997,0.000107234024,0.00007428748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083599676,0.00082029385,0.0006929051,0.00071281136,0.00044818677,0.0009345676,0.0010381602,0.0010181735,0.0048708552],"category_scores_gemma":[0.004398862,0.0006108001,0.0005566038,0.00046812813,0.0007407901,0.0013154937,0.0010449358,0.0010611148,0.000785258],"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.0002120865,0.00008237414,0.00084026833,0.00010438959,0.000040518356,0.00012877739,0.00013235254,0.9207643,0.0017907995,0.027175266,0.00209248,0.046636246],"study_design_scores_gemma":[0.000031638338,0.000028079297,0.00006878467,0.000007223729,0.000003982286,0.000014052581,0.000026205775,0.9896667,0.00028734832,0.009174627,0.0006877077,0.0000035877663],"about_ca_topic_score_codex":0.003843639,"about_ca_topic_score_gemma":0.005345522,"teacher_disagreement_score":0.0048708552,"about_ca_system_score_codex":0.0008737672,"about_ca_system_score_gemma":0.0010693377,"threshold_uncertainty_score":0.016294658},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024178471,0.00020838564,0.9470066,0.00012827055,0.000061000283,0.000050763032,0.00041210823,0.0025529056,0.025401587],"genre_scores_gemma":[0.52793914,0.0007075028,0.4352509,0.00008092259,0.00003552398,0.0001416443,0.0015531449,0.00070128276,0.033589963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.000021268614,0.000009051159,0.000047458256,0.000086209395,0.000036422156],"domain_scores_gemma":[0.9996661,0.000105857776,0.000015407542,0.0001335986,0.000057220965,0.000021858827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017475316,0.0006691655,0.00061855186,0.00080958963,0.00050878245,0.0012190575,0.0017734878,0.00058096787,0.0139229465],"category_scores_gemma":[0.0010722914,0.00049066066,0.00078824826,0.0012812469,0.0005578189,0.0024621193,0.0031527816,0.0011725164,0.0023290762],"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.00029457596,0.00011798848,0.00089388504,0.00051847746,0.00009282775,0.00028999487,0.0006411693,0.16422652,0.03030508,0.31558886,0.022699926,0.46433076],"study_design_scores_gemma":[0.000030669304,0.000047262918,0.00048294594,0.000036970963,0.000041824016,0.0002288529,0.00016935835,0.65712637,0.010500742,0.3094529,0.021846399,0.00003563974],"about_ca_topic_score_codex":0.0051895455,"about_ca_topic_score_gemma":0.007075772,"teacher_disagreement_score":0.0139229465,"about_ca_system_score_codex":0.0004935657,"about_ca_system_score_gemma":0.00056384807,"threshold_uncertainty_score":0.046576917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5728041,0.000120596465,0.41955218,0.00042942583,0.00002800172,0.00014800864,0.000045927878,0.0009601718,0.005911623],"genre_scores_gemma":[0.9603713,0.000024660889,0.037636194,0.000071508795,0.00000680305,0.00007391796,0.000034147764,0.000045278015,0.0017362533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995844,0.00017068925,0.000013646463,0.00008659652,0.000078759476,0.00006592473],"domain_scores_gemma":[0.9966698,0.0023611472,0.0002503413,0.0001946574,0.00021705996,0.00030703482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015358302,0.00065893726,0.00083693245,0.00042036176,0.0003395461,0.0006900017,0.0013431675,0.00084080483,0.0021820145],"category_scores_gemma":[0.008115722,0.0003053352,0.0003596545,0.00020727864,0.0016062388,0.001405033,0.0010232282,0.0009686932,0.00030664305],"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.00063127815,0.0003626472,0.006371999,0.000082531624,0.000061667066,0.00013628372,0.00022858515,0.872176,0.009486323,0.012292386,0.0009100192,0.09726028],"study_design_scores_gemma":[0.000026248965,0.00012459379,0.00040942337,0.0000033088659,0.0000063480047,0.00001608707,0.000018212166,0.99368864,0.0012387846,0.004274057,0.0001875016,0.00000670953],"about_ca_topic_score_codex":0.0033141058,"about_ca_topic_score_gemma":0.0036777086,"teacher_disagreement_score":0.0033141058,"about_ca_system_score_codex":0.001013086,"about_ca_system_score_gemma":0.0006730106,"threshold_uncertainty_score":0.008122385},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020230675,0.0003323036,0.97180533,0.00021389248,0.00007204576,0.00008406841,0.000079620935,0.00052910834,0.0066529303],"genre_scores_gemma":[0.3378384,0.00039190802,0.6550857,0.00023447571,0.00003897964,0.0003051294,0.00029505615,0.00024104917,0.0055693532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994361,0.00019249295,0.000026762658,0.00010114089,0.0001853089,0.00005822829],"domain_scores_gemma":[0.9986689,0.00074876443,0.00011668919,0.00015628549,0.00024091166,0.00006846314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076934946,0.00082900084,0.00089118705,0.0009711795,0.0006835818,0.0010475642,0.0013222654,0.001292485,0.0046910485],"category_scores_gemma":[0.0041733608,0.00038411573,0.00044940715,0.00089196605,0.00064548774,0.0015503486,0.0015642077,0.0007961513,0.0009601895],"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.00024121992,0.000121835845,0.002010146,0.0002747199,0.00011705715,0.00018712725,0.00014748312,0.55318683,0.0072507286,0.09450386,0.0069141947,0.33504474],"study_design_scores_gemma":[0.00006231715,0.0001257002,0.000317114,0.000040046252,0.000030276102,0.00022796799,0.000047625363,0.94505036,0.0028732235,0.043133132,0.0080696475,0.00002257361],"about_ca_topic_score_codex":0.0027800617,"about_ca_topic_score_gemma":0.0023275998,"teacher_disagreement_score":0.0046910485,"about_ca_system_score_codex":0.00065923756,"about_ca_system_score_gemma":0.0013998662,"threshold_uncertainty_score":0.015693069},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012178683,0.0003969356,0.9814068,0.00018653402,0.00006909155,0.000049078822,0.00020225246,0.0010906063,0.004420011],"genre_scores_gemma":[0.22100462,0.00037479898,0.77391785,0.00015054483,0.00003707618,0.00017912558,0.000505505,0.00022740068,0.0036031043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923515,0.00021770895,0.00005944321,0.00016035012,0.00025700746,0.00007035861],"domain_scores_gemma":[0.99793136,0.0009151957,0.00020848816,0.00051145285,0.00030918134,0.00012431682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077037833,0.0005553653,0.0006153003,0.00090663566,0.00047260206,0.0011774629,0.0019000075,0.0006631337,0.0077350955],"category_scores_gemma":[0.0029782252,0.00038844696,0.0005124994,0.0016715188,0.0007462334,0.0030479508,0.0018705594,0.0011670692,0.0017401469],"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.0009829089,0.00024221223,0.0027104102,0.00039157466,0.000098299504,0.00012281955,0.00020629734,0.3975924,0.00996083,0.15316288,0.012720622,0.42180878],"study_design_scores_gemma":[0.00011406561,0.0002161734,0.00048435718,0.00004050444,0.000025088693,0.00014524619,0.00004128276,0.9130779,0.0073115113,0.06314632,0.015367662,0.00002993962],"about_ca_topic_score_codex":0.0043462864,"about_ca_topic_score_gemma":0.0027721226,"teacher_disagreement_score":0.0077350955,"about_ca_system_score_codex":0.0006222542,"about_ca_system_score_gemma":0.0011226513,"threshold_uncertainty_score":0.025876522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53874165,0.00076035806,0.24672464,0.0016733486,0.00023280595,0.00020404658,0.0005150633,0.0004886386,0.2106595],"genre_scores_gemma":[0.956873,0.0001939162,0.02651019,0.00023173609,0.000046143243,0.00014796441,0.0002707637,0.00013193703,0.015594369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666876,0.000762358,0.00022819453,0.0006348726,0.00096210197,0.0007436044],"domain_scores_gemma":[0.9953998,0.0022137938,0.0004102718,0.0005419465,0.0005559454,0.00087823224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020658653,0.00069486914,0.0011287772,0.0016700927,0.0041525923,0.0061830347,0.0023448027,0.0022872004,0.01022214],"category_scores_gemma":[0.007864084,0.0006907188,0.0011266029,0.0010213008,0.006035865,0.0076309717,0.0074559343,0.0028405858,0.0015495406],"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.00004773348,0.000015393758,0.00020643225,0.000023949586,0.000008619105,0.00007882419,0.0003777207,0.0011523572,0.00072742713,0.99431926,0.00028241653,0.0027598978],"study_design_scores_gemma":[0.000021230884,0.0000238728,0.00016654709,0.000016107826,0.00000986731,0.000104539555,0.00028593905,0.0080057075,0.0011115285,0.9850581,0.0051744767,0.000022100536],"about_ca_topic_score_codex":0.0013183232,"about_ca_topic_score_gemma":0.0014633775,"teacher_disagreement_score":0.01022214,"about_ca_system_score_codex":0.0020745944,"about_ca_system_score_gemma":0.001028277,"threshold_uncertainty_score":0.034196436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056892997,0.020509128,0.2511296,0.03267507,0.015280647,0.00009053734,0.0020837432,0.007139044,0.66540295],"genre_scores_gemma":[0.053781763,0.007066193,0.07358342,0.0062039103,0.0023524875,0.000110270485,0.0019498592,0.0050235046,0.84992856],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962497,0.000065860666,0.000021680858,0.00008946344,0.00012450133,0.00007347463],"domain_scores_gemma":[0.99969923,0.00007376212,0.000012312601,0.00005870939,0.00009220292,0.000063850166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080718164,0.0009286153,0.00051328185,0.000631643,0.001529999,0.003874973,0.0011535271,0.0015373484,0.06424029],"category_scores_gemma":[0.0021170538,0.00069439545,0.00040469805,0.00070445234,0.0011407243,0.006146126,0.0024673184,0.003064075,0.03765248],"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.00007679579,0.00003907485,0.00026028408,0.00009252004,0.00001333414,0.000046000438,0.00031486418,0.001003122,0.00075943995,0.1924401,0.56974953,0.23520502],"study_design_scores_gemma":[0.00001117869,0.000012269301,0.00023579555,0.00009630951,0.000009910469,0.00011711185,0.00013579357,0.0020548103,0.001085838,0.10829844,0.88792044,0.00002203877],"about_ca_topic_score_codex":0.0046742405,"about_ca_topic_score_gemma":0.016289828,"teacher_disagreement_score":0.06424029,"about_ca_system_score_codex":0.001270746,"about_ca_system_score_gemma":0.0017500228,"threshold_uncertainty_score":0.2149052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39588812,0.00014182886,0.5965433,0.0002692558,0.000117753734,0.00019043396,0.00004752661,0.0013176333,0.005484221],"genre_scores_gemma":[0.9020336,0.00004033743,0.09561543,0.00005378752,0.000010471373,0.000057007415,0.00004522207,0.000030873853,0.0021131644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997354,0.000086194064,0.000016301825,0.00006571497,0.000061703606,0.00003462384],"domain_scores_gemma":[0.9988356,0.0007981456,0.00004607752,0.00005202717,0.0002056406,0.00006247238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010681933,0.0003176638,0.0002938543,0.00029101415,0.00031313603,0.0005104452,0.00058267923,0.0005154941,0.0024370516],"category_scores_gemma":[0.004540688,0.00013769402,0.0002518251,0.0003196397,0.0003291003,0.00047698256,0.00049664057,0.0007153176,0.00018024149],"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.0013738514,0.0007404227,0.0044635474,0.00017648442,0.00006653828,0.00028504815,0.00039879893,0.34272385,0.028756699,0.009289369,0.0014197197,0.6103056],"study_design_scores_gemma":[0.000015856996,0.00013607487,0.00044925502,0.0000022020859,0.0000057464044,0.000018170484,0.0000154419,0.9941221,0.0036733719,0.0012358133,0.00032129322,0.0000046850987],"about_ca_topic_score_codex":0.009023246,"about_ca_topic_score_gemma":0.006922875,"teacher_disagreement_score":0.009023246,"about_ca_system_score_codex":0.00067505945,"about_ca_system_score_gemma":0.0006071572,"threshold_uncertainty_score":0.017941475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47982433,0.0005690709,0.5069374,0.00040687528,0.0000554608,0.00013647057,0.00030947535,0.0015349304,0.010225935],"genre_scores_gemma":[0.98543036,0.00006655176,0.011647461,0.000032634613,0.000005411803,0.000022957945,0.00017834376,0.00006529665,0.0025508853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892503,0.00039760926,0.000051559797,0.00028090447,0.00023367778,0.00011117561],"domain_scores_gemma":[0.99741995,0.0014270718,0.00033421692,0.00020235317,0.00041017632,0.00020620042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022010973,0.0007981475,0.00085323275,0.00070722,0.00034672697,0.0015587957,0.00068714743,0.0006529226,0.004296564],"category_scores_gemma":[0.008576074,0.0003466278,0.00028717096,0.00038153096,0.0010632358,0.0026389959,0.0015052288,0.00088532903,0.00060145545],"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.00068625057,0.00013094388,0.018256998,0.000112125126,0.00007094536,0.00012554065,0.00038663717,0.8425108,0.002165879,0.010390059,0.0014523291,0.12371147],"study_design_scores_gemma":[0.000015221588,0.00020622197,0.003250369,0.000019488694,0.0000099639565,0.000026148238,0.00009139139,0.9865346,0.0016321428,0.007595162,0.00060057215,0.000018695931],"about_ca_topic_score_codex":0.0076217474,"about_ca_topic_score_gemma":0.008518739,"teacher_disagreement_score":0.0076217474,"about_ca_system_score_codex":0.0012488252,"about_ca_system_score_gemma":0.0006854816,"threshold_uncertainty_score":0.015154719},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011269643,0.0014023671,0.0017941417,0.0011787215,0.001233979,0.000047103058,0.0007416241,0.0009870364,0.9914881],"genre_scores_gemma":[0.0080149975,0.0008388282,0.0010398513,0.00021862962,0.00009083382,0.00003174325,0.0009075658,0.0003046316,0.9885529],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949205,0.00003174127,0.00001621026,0.00010504104,0.00030647195,0.000048457434],"domain_scores_gemma":[0.9985978,0.0002192188,0.00011565368,0.0001331125,0.00042748897,0.00050668593],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004656614,0.00068438,0.00053967664,0.0008114127,0.0012268804,0.0028639962,0.000695195,0.0011146368,0.45933372],"category_scores_gemma":[0.002196396,0.00026487323,0.00021667707,0.0013961177,0.0006809287,0.0026602459,0.0010106523,0.001343902,0.20109425],"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.000102012,0.00006846418,0.00036096622,0.00015056886,0.000005753966,0.000055336805,0.00016189691,0.000093989074,0.0013519133,0.026924465,0.73151463,0.23920996],"study_design_scores_gemma":[0.000005999322,0.000028670012,0.00025161647,0.000028453358,0.0000016315914,0.000033723943,0.00002598931,0.00009045382,0.00021464012,0.00090819673,0.9984066,0.0000040505547],"about_ca_topic_score_codex":0.0044779484,"about_ca_topic_score_gemma":0.015512922,"teacher_disagreement_score":0.45933372,"about_ca_system_score_codex":0.0007673261,"about_ca_system_score_gemma":0.0014590931,"threshold_uncertainty_score":0.7711948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075261,0.000063456864,0.14947417,0.00033707713,0.000067674955,0.00040136502,0.0005023208,0.011672834,0.029954934],"genre_scores_gemma":[0.93533653,0.000036157915,0.053167913,0.00007784307,0.000004140608,0.00015182514,0.00025536324,0.00064121676,0.010328984],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998728,0.000039801704,0.0000058498163,0.000020128822,0.00003437141,0.00002711193],"domain_scores_gemma":[0.99961424,0.00013827694,0.00002312764,0.00006262862,0.000033019147,0.00012866501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019341407,0.0003873487,0.00012109096,0.00015064381,0.00023889815,0.00027760107,0.0005558732,0.00041408138,0.0050316],"category_scores_gemma":[0.0008408057,0.00013414331,0.0002053761,0.00005254468,0.00041595032,0.00026215133,0.000640137,0.00044020617,0.0006453958],"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.00091591093,0.0017201334,0.013220046,0.00065163063,0.00007013765,0.0052088085,0.011885248,0.04023853,0.7331853,0.028104177,0.013315189,0.15148501],"study_design_scores_gemma":[0.0003284228,0.0035963038,0.034926817,0.00019587898,0.00006203014,0.0034401398,0.0021093548,0.4483478,0.37888178,0.010441307,0.11750272,0.00016743985],"about_ca_topic_score_codex":0.0010399875,"about_ca_topic_score_gemma":0.0019210275,"teacher_disagreement_score":0.0050316,"about_ca_system_score_codex":0.0001533014,"about_ca_system_score_gemma":0.00015081656,"threshold_uncertainty_score":0.016832352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018299893,0.00018727372,0.9271219,0.00014333546,0.00008380769,0.0007266032,0.001305561,0.0449484,0.0071832226],"genre_scores_gemma":[0.1381441,0.00019279587,0.8441205,0.00007593232,0.00003091404,0.0006804625,0.0055547724,0.0054391674,0.0057612807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865437,0.0004736587,0.0001347329,0.00023908081,0.0004284691,0.00006959785],"domain_scores_gemma":[0.9963644,0.0022954764,0.00018448621,0.00044747264,0.0005660502,0.00014215043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578458,0.0014634792,0.0006342835,0.0015080608,0.0006773162,0.0017367897,0.0019420164,0.0009925233,0.017998686],"category_scores_gemma":[0.008498404,0.0010393908,0.0011375569,0.0006725608,0.0006477149,0.0019256382,0.0015041635,0.0009753161,0.0051286877],"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.0009840148,0.00048676092,0.004421284,0.0020101278,0.00010485382,0.001970303,0.003684129,0.03147243,0.074933544,0.038985964,0.06268514,0.7782615],"study_design_scores_gemma":[0.0003247023,0.0003299372,0.0017150776,0.00021667319,0.000094393006,0.0015842621,0.00082378375,0.71101725,0.115470916,0.030945823,0.13735932,0.00011778149],"about_ca_topic_score_codex":0.0009575959,"about_ca_topic_score_gemma":0.0016373309,"teacher_disagreement_score":0.017998686,"about_ca_system_score_codex":0.0006996025,"about_ca_system_score_gemma":0.0005663359,"threshold_uncertainty_score":0.06021166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52466273,0.0003158525,0.4582875,0.00032976884,0.000039218892,0.00027807336,0.00007747602,0.00084759155,0.015161795],"genre_scores_gemma":[0.9568919,0.0000849764,0.041751947,0.000057348792,0.000005473358,0.000102165686,0.000028683653,0.00004429771,0.001033168],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997234,0.00011486986,0.000014661907,0.000070509974,0.000043012646,0.000033597466],"domain_scores_gemma":[0.9995759,0.0002411944,0.00006966873,0.00004393989,0.000038447324,0.000030728184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059047877,0.0004874218,0.00020273917,0.00027713802,0.00020469632,0.001199658,0.00047360596,0.00036922516,0.0014966491],"category_scores_gemma":[0.0027066565,0.00025771878,0.00032541723,0.00009801226,0.0004969846,0.0010025378,0.00080307096,0.0005094114,0.00021449615],"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.0011863187,0.0009965368,0.030592319,0.0006997184,0.00018902858,0.00040495014,0.012473562,0.0926945,0.42863202,0.03880343,0.0019926545,0.39133495],"study_design_scores_gemma":[0.00012721638,0.00085770263,0.065396175,0.00017512716,0.00020185829,0.0003538962,0.0021900742,0.80977726,0.066960774,0.042294737,0.011508781,0.00015646523],"about_ca_topic_score_codex":0.0008286443,"about_ca_topic_score_gemma":0.0008835631,"teacher_disagreement_score":0.0014966491,"about_ca_system_score_codex":0.00035789734,"about_ca_system_score_gemma":0.00020631582,"threshold_uncertainty_score":0.00500679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23586856,0.000528788,0.6849376,0.0018360346,0.00035127287,0.00084748893,0.0016020341,0.015449295,0.05857891],"genre_scores_gemma":[0.69641197,0.00036854154,0.2796983,0.0004034101,0.000046460627,0.0005622173,0.0012017866,0.0010073049,0.02030004],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991092,0.00053855526,0.000031396412,0.00011501494,0.0001403961,0.00006532713],"domain_scores_gemma":[0.9979469,0.001547826,0.00005461782,0.00014308539,0.00009360324,0.00021392776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093149615,0.0007982475,0.00026412122,0.00021434996,0.000459733,0.0011591801,0.0019764756,0.0018282727,0.011850078],"category_scores_gemma":[0.0042821085,0.00035074458,0.0005536062,0.00010722823,0.0009248366,0.0014579897,0.0019665745,0.0014480368,0.002155057],"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.004944136,0.003153838,0.009266215,0.0034723564,0.00037327825,0.015575339,0.05084988,0.14514722,0.3350191,0.1193977,0.082071625,0.23072922],"study_design_scores_gemma":[0.0007932249,0.0032502639,0.007863175,0.00052185584,0.00015904565,0.00531662,0.0035044716,0.4631452,0.10024548,0.036733482,0.37817663,0.0002906455],"about_ca_topic_score_codex":0.0014324262,"about_ca_topic_score_gemma":0.001960688,"teacher_disagreement_score":0.011850078,"about_ca_system_score_codex":0.0003179453,"about_ca_system_score_gemma":0.00035298234,"threshold_uncertainty_score":0.039642513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006639158,0.00059882633,0.96908444,0.0014483714,0.00006342937,0.00007586529,0.00042265316,0.0005166468,0.02115053],"genre_scores_gemma":[0.50538135,0.002708459,0.47615764,0.0004875163,0.00015667042,0.00050161284,0.0018926095,0.0005329978,0.01218112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00013847752,0.00002391925,0.000089878165,0.000114881404,0.000042472573],"domain_scores_gemma":[0.9994066,0.00023781817,0.00007002591,0.0001263498,0.000115807634,0.000043370248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066066085,0.0010226526,0.0005320198,0.0020384125,0.00079020514,0.0036876723,0.0013069797,0.0012159883,0.009637757],"category_scores_gemma":[0.003763972,0.00065967557,0.0011676857,0.00072478125,0.0032234662,0.0075099766,0.0026074836,0.0017276381,0.0010543946],"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.00003481208,0.000012635304,0.00024011517,0.00018016328,0.000020697318,0.00010917663,0.00094612996,0.03185218,0.0025582528,0.93395406,0.0027193737,0.02737238],"study_design_scores_gemma":[0.000009239571,0.000011098941,0.00020362466,0.00008238258,0.0000094847765,0.000058948594,0.0004106237,0.089440525,0.0011062976,0.89151615,0.017136082,0.000015623027],"about_ca_topic_score_codex":0.00465019,"about_ca_topic_score_gemma":0.0027586585,"teacher_disagreement_score":0.009637757,"about_ca_system_score_codex":0.0017440808,"about_ca_system_score_gemma":0.00079606817,"threshold_uncertainty_score":0.032241464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788961,0.000085704116,0.018838964,0.00015433392,0.000009494514,0.000023344688,0.000280649,0.00011530374,0.0015960755],"genre_scores_gemma":[0.99656063,0.00004894968,0.0024083932,0.000011866719,0.0000026577554,0.0000094328825,0.00028310472,0.0000074285103,0.0006675129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998553,0.00004309199,0.0000052152523,0.000038713704,0.000031966767,0.000025659821],"domain_scores_gemma":[0.99927825,0.00039135874,0.00011108698,0.000029759885,0.00008645194,0.00010305797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656494,0.00048393165,0.0003787034,0.0004967786,0.00021419612,0.00062352646,0.00035976252,0.00056051515,0.0012583439],"category_scores_gemma":[0.0031844915,0.00030531982,0.00015134037,0.0002444378,0.0003158877,0.0006752821,0.00052331155,0.00075974077,0.00034710282],"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.00034964152,0.00016103825,0.088531286,0.000030997813,0.000038789934,0.00011411527,0.0001408735,0.8842652,0.0009101216,0.0016770307,0.0010275841,0.022753391],"study_design_scores_gemma":[0.0000147886285,0.00009633488,0.015087682,0.000009631775,0.0000058741794,0.000014057546,0.00004577637,0.98192227,0.00061566365,0.0019461295,0.0002304536,0.0000113414735],"about_ca_topic_score_codex":0.013976034,"about_ca_topic_score_gemma":0.020598384,"teacher_disagreement_score":0.013976034,"about_ca_system_score_codex":0.0005157413,"about_ca_system_score_gemma":0.00046307326,"threshold_uncertainty_score":0.027789354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047695026,0.000083737345,0.94708765,0.00029849968,0.000022746794,0.0001314452,0.00003120501,0.00058812025,0.0040615783],"genre_scores_gemma":[0.6493995,0.00018025958,0.3476902,0.00013041389,0.000020054433,0.00030625705,0.00008776909,0.000082240884,0.0021032616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920434,0.0004636516,0.000041392464,0.00011088338,0.00013613794,0.000043551157],"domain_scores_gemma":[0.99838674,0.0010600813,0.00016862924,0.00017170279,0.00013013172,0.0000828151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825648,0.00091127213,0.0005256209,0.00044677575,0.0003457275,0.0012163515,0.0014391643,0.0008147796,0.0012324296],"category_scores_gemma":[0.0046424232,0.0004893764,0.0005852671,0.00023535475,0.0008032225,0.0018286784,0.0010971214,0.001162318,0.00025202593],"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.00006968693,0.00018546567,0.0026405593,0.000079157224,0.00006529521,0.00008404149,0.00038359629,0.9171085,0.0029131968,0.038068634,0.000618669,0.037783273],"study_design_scores_gemma":[0.00000836989,0.000020749862,0.00008066277,0.0000048567767,0.0000056254175,0.000010165625,0.00001311795,0.99222034,0.0003874402,0.0066590565,0.00058535824,0.000004144716],"about_ca_topic_score_codex":0.0034266491,"about_ca_topic_score_gemma":0.004487398,"teacher_disagreement_score":0.0034266491,"about_ca_system_score_codex":0.00075648684,"about_ca_system_score_gemma":0.00067441544,"threshold_uncertainty_score":0.006813407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44447872,0.0002017479,0.12945916,0.0011610133,0.00050337816,0.00037761664,0.00091480056,0.00087928795,0.42202434],"genre_scores_gemma":[0.889327,0.000066963665,0.03884911,0.00011250617,0.000038660502,0.00012008277,0.0004477532,0.00004130996,0.07099656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.000087839035,0.000011727159,0.000060149916,0.00005279072,0.00008753047],"domain_scores_gemma":[0.9996221,0.00010157143,0.000017715189,0.00005095879,0.00007321806,0.00013442304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037224445,0.0004264696,0.00059293455,0.00024367527,0.002151028,0.0011263115,0.0011786681,0.0006448329,0.037087213],"category_scores_gemma":[0.0008916691,0.00018856412,0.0002965559,0.0002441397,0.0009887188,0.0012460783,0.0012948595,0.0006784371,0.0022746043],"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.0021595545,0.00034846112,0.0030964739,0.00041844576,0.00010743348,0.0023255504,0.0029175375,0.014838538,0.01221185,0.8872902,0.02771066,0.046575382],"study_design_scores_gemma":[0.0009341761,0.0011310395,0.0047518127,0.00009076594,0.00016835412,0.000945022,0.0040199035,0.1972315,0.011495257,0.6170269,0.16201031,0.00019495866],"about_ca_topic_score_codex":0.00787684,"about_ca_topic_score_gemma":0.014505345,"teacher_disagreement_score":0.037087213,"about_ca_system_score_codex":0.00064596004,"about_ca_system_score_gemma":0.0009578094,"threshold_uncertainty_score":0.124069035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068055406,0.00012093993,0.9260751,0.00019156426,0.00000869225,0.00011603469,0.00007968432,0.00031362698,0.005038849],"genre_scores_gemma":[0.5787667,0.0002597227,0.4175436,0.000101728605,0.000011284135,0.00028435275,0.0002418573,0.0000928472,0.0026978906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931526,0.00026013324,0.000051679497,0.00012764963,0.00014742702,0.00009773499],"domain_scores_gemma":[0.99836916,0.0012691179,0.00011838593,0.000103625316,0.000074776304,0.00006500111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252831,0.0009665176,0.0010847838,0.0008258644,0.0005352553,0.0017042536,0.0008500852,0.0009705783,0.0025482834],"category_scores_gemma":[0.0048795254,0.00062226696,0.0007350329,0.0006530141,0.0013550894,0.0026374727,0.0013648239,0.0010906865,0.00038861678],"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.00012943067,0.000111589514,0.0013078892,0.0001756174,0.000066080116,0.00012724356,0.0003663556,0.74113166,0.0029702613,0.1736315,0.0011772804,0.07880505],"study_design_scores_gemma":[0.00003320107,0.000052560612,0.0001331966,0.000021849886,0.000014548348,0.000029338233,0.00008350642,0.8310333,0.0015860515,0.16608083,0.0009194019,0.000012254746],"about_ca_topic_score_codex":0.0019460253,"about_ca_topic_score_gemma":0.0025181067,"teacher_disagreement_score":0.0025482834,"about_ca_system_score_codex":0.00121614,"about_ca_system_score_gemma":0.0015202805,"threshold_uncertainty_score":0.008823752},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20013477,0.0023022937,0.7238965,0.0015202974,0.0002721069,0.0004649666,0.00046450028,0.0033242784,0.06762028],"genre_scores_gemma":[0.65282226,0.00048049193,0.3373886,0.000290672,0.000091891445,0.0001983298,0.00029349455,0.00026383746,0.008170428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976447,0.0009440029,0.000112807335,0.00035797418,0.0006667513,0.00027374577],"domain_scores_gemma":[0.9946944,0.003264858,0.0003816276,0.0008436814,0.00044216157,0.00037332653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001718442,0.0010358592,0.00066608656,0.0017400021,0.0010578108,0.0020037652,0.0021168815,0.0013102512,0.010532052],"category_scores_gemma":[0.010406114,0.0004727717,0.00077800703,0.0015872886,0.0019494124,0.004685548,0.0028832064,0.001691659,0.0012952898],"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.0015427328,0.0010163579,0.0059388466,0.00053909066,0.000109359775,0.00023413256,0.0016836843,0.13279583,0.012410723,0.29931465,0.0070325066,0.53738225],"study_design_scores_gemma":[0.0002845764,0.0014051795,0.0029414082,0.00014525249,0.00014450598,0.0003837909,0.0005039299,0.73399603,0.009170186,0.22564398,0.02526528,0.00011585973],"about_ca_topic_score_codex":0.0047119446,"about_ca_topic_score_gemma":0.007907587,"teacher_disagreement_score":0.010532052,"about_ca_system_score_codex":0.0015014425,"about_ca_system_score_gemma":0.0018677838,"threshold_uncertainty_score":0.0352332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18270326,0.00021952984,0.80089724,0.0005569009,0.000076597615,0.00010976236,0.00011877289,0.0021378063,0.013180135],"genre_scores_gemma":[0.7888539,0.00008949375,0.20791431,0.00012039313,0.00002307603,0.00012075581,0.00013582471,0.00021093916,0.0025314654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873227,0.00043235655,0.000055771645,0.00016158758,0.00032637757,0.00029167207],"domain_scores_gemma":[0.9941474,0.0042783907,0.00031599207,0.00064343464,0.00035715566,0.00025762053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020524247,0.0008671424,0.0010304688,0.00064829877,0.0007930347,0.0017014456,0.0015062978,0.00087739265,0.0052622547],"category_scores_gemma":[0.013072298,0.00042318448,0.0005773247,0.000707839,0.0013003573,0.0026378036,0.0020283696,0.0016891654,0.0007946274],"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.00032308034,0.0001491364,0.0020740677,0.00011332267,0.000054411666,0.00014820191,0.00028579394,0.86986774,0.0034190833,0.07658207,0.0024399122,0.044543188],"study_design_scores_gemma":[0.000015624693,0.000021845623,0.00012411574,0.000005507558,0.0000050346275,0.000012459731,0.000030385923,0.97021186,0.00095765124,0.028251572,0.00035902148,0.000004931668],"about_ca_topic_score_codex":0.00648538,"about_ca_topic_score_gemma":0.009275328,"teacher_disagreement_score":0.00648538,"about_ca_system_score_codex":0.0015681844,"about_ca_system_score_gemma":0.0018489381,"threshold_uncertainty_score":0.017603993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029908087,0.00033278254,0.96072084,0.00024235254,0.00004915827,0.00008717513,0.000080742626,0.0003744341,0.008204469],"genre_scores_gemma":[0.4356161,0.00044419043,0.55536765,0.00037922163,0.00008745944,0.00038209202,0.00035674212,0.00027148658,0.007095108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985519,0.0005075399,0.00006097682,0.00019839793,0.00046588475,0.0002153006],"domain_scores_gemma":[0.9974859,0.0016572777,0.00016177548,0.00032678762,0.00025425624,0.00011405493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020126894,0.0011542784,0.0011027902,0.0009825274,0.0008755648,0.0011131555,0.0015970287,0.00088785443,0.00323716],"category_scores_gemma":[0.007427905,0.00065392494,0.0010780914,0.0006769648,0.0010198748,0.0023153652,0.0019534652,0.002838864,0.00070983986],"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.0004730419,0.00027675106,0.001762659,0.00032761233,0.00014867367,0.00035906074,0.00034627848,0.35982615,0.0145989,0.35992765,0.008742092,0.2532112],"study_design_scores_gemma":[0.00004735808,0.00009625402,0.00028359945,0.000044002074,0.000026558886,0.0001005233,0.000029277366,0.8223032,0.0034285786,0.17004411,0.0035839921,0.000012521052],"about_ca_topic_score_codex":0.0019398902,"about_ca_topic_score_gemma":0.002945639,"teacher_disagreement_score":0.00323716,"about_ca_system_score_codex":0.00094366376,"about_ca_system_score_gemma":0.001393955,"threshold_uncertainty_score":0.010829389},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703371,0.000119306256,0.023892207,0.00011756764,0.000023141258,0.000054266195,0.000087048815,0.00006271308,0.005306668],"genre_scores_gemma":[0.9970291,0.000027205575,0.0022694254,0.000009745715,0.0000024021556,0.000025609677,0.00004786033,0.000005733747,0.0005828775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00015953538,0.000010881842,0.00003736649,0.000043006432,0.00004627366],"domain_scores_gemma":[0.9978562,0.0016997599,0.00015083925,0.00005519894,0.00013188139,0.00010604389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007365106,0.00056224933,0.00025822004,0.00031514652,0.00017014994,0.0014202102,0.0005461546,0.00047498214,0.0015211318],"category_scores_gemma":[0.0063459803,0.0002165835,0.00034617324,0.0002592225,0.00026664205,0.0006904675,0.00043902503,0.0008795232,0.00019524698],"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.002125891,0.0033371632,0.2994872,0.00040780005,0.00058658276,0.0005184089,0.0045286366,0.4576078,0.013987543,0.024453117,0.0038881616,0.18907166],"study_design_scores_gemma":[0.000043467728,0.00026622997,0.085720174,0.000024233312,0.000079922014,0.000040137482,0.0004994826,0.90081674,0.0016469163,0.010310613,0.0005183268,0.000033733748],"about_ca_topic_score_codex":0.005492209,"about_ca_topic_score_gemma":0.0065185516,"teacher_disagreement_score":0.005492209,"about_ca_system_score_codex":0.00071021775,"about_ca_system_score_gemma":0.0002525397,"threshold_uncertainty_score":0.010920465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77192664,0.0017064281,0.1963063,0.0009407909,0.00020726063,0.0002649304,0.0009953735,0.0053892653,0.022263033],"genre_scores_gemma":[0.9744539,0.00010920829,0.019817267,0.00014470535,0.000015282627,0.000038028316,0.000646906,0.00006147315,0.004713184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943155,0.00012013655,0.000023530265,0.00017078673,0.00012069201,0.00013337327],"domain_scores_gemma":[0.9989748,0.0005549147,0.000119822544,0.00008702573,0.0001374291,0.00012603439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095005904,0.0012959624,0.00084948033,0.00086711795,0.00047755265,0.0010694579,0.0015422064,0.0013253078,0.0032082608],"category_scores_gemma":[0.0041784765,0.00036403106,0.0004906448,0.00045368407,0.0007068012,0.0019009499,0.0010918311,0.0014631051,0.0007068433],"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.0011406599,0.00047739848,0.017978251,0.00017958769,0.00018351962,0.00020613329,0.00013215814,0.7351831,0.004690301,0.0068114,0.0069898586,0.2260276],"study_design_scores_gemma":[0.00002226111,0.000090410285,0.0014368795,0.00001620542,0.000010630978,0.00001586206,0.000026074169,0.9942147,0.001143748,0.0025325685,0.00048247707,0.000008187921],"about_ca_topic_score_codex":0.037582867,"about_ca_topic_score_gemma":0.063168794,"teacher_disagreement_score":0.037582867,"about_ca_system_score_codex":0.0019360082,"about_ca_system_score_gemma":0.0010973806,"threshold_uncertainty_score":0.07472825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019564275,0.00014994739,0.5410327,0.0018967115,0.00039072437,0.00022587505,0.0019175912,0.0026118937,0.43221027],"genre_scores_gemma":[0.238422,0.00033857324,0.48216403,0.00048833305,0.000103591796,0.0003602851,0.0037598538,0.0021751565,0.2721881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996233,0.000095552954,0.000020413469,0.00009555988,0.00009362949,0.000071533446],"domain_scores_gemma":[0.9995889,0.00016887898,0.000022019953,0.00008644138,0.000077952274,0.000055806227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037279064,0.0008715225,0.0005986622,0.00040833867,0.0014924578,0.0024999613,0.0014874976,0.0010116801,0.12858258],"category_scores_gemma":[0.0019768162,0.00036630884,0.00101084,0.0005882487,0.00083088304,0.003340166,0.0032456196,0.001511307,0.020360744],"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.00017709253,0.00014050583,0.0007069195,0.0003874089,0.000041008014,0.00026838612,0.00086116896,0.014555063,0.0028053906,0.7343045,0.115810856,0.12994161],"study_design_scores_gemma":[0.00011090097,0.000060121773,0.0003538895,0.00009151132,0.000028782577,0.00020257669,0.0008663478,0.06517383,0.0052116974,0.67120993,0.2566546,0.000035804682],"about_ca_topic_score_codex":0.0028702687,"about_ca_topic_score_gemma":0.0073198327,"teacher_disagreement_score":0.12858258,"about_ca_system_score_codex":0.00076098164,"about_ca_system_score_gemma":0.0010579565,"threshold_uncertainty_score":0.43015158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014896875,0.00003104381,0.98964065,0.00010176195,0.000039841132,0.000092852395,0.000069803835,0.004749967,0.0037844146],"genre_scores_gemma":[0.091607556,0.00019102402,0.89013547,0.00036008458,0.000045313893,0.0006016596,0.00044146035,0.0027259982,0.013891569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992161,0.00026387212,0.00006765057,0.00015277689,0.00023454618,0.00006506078],"domain_scores_gemma":[0.99872786,0.000528139,0.000062865096,0.00040805116,0.0001425768,0.00013047883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011885037,0.00082120515,0.00049994997,0.0005054565,0.0007329059,0.0021665052,0.0026568929,0.0010535211,0.0089362655],"category_scores_gemma":[0.003948076,0.0006757601,0.0013025115,0.00038548012,0.0018064333,0.0028557968,0.002411339,0.0033617173,0.0019336619],"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.0001729263,0.0002404627,0.00084308506,0.0003450629,0.00006813292,0.0002616481,0.0018791023,0.022388328,0.01486663,0.7585368,0.01991762,0.18048023],"study_design_scores_gemma":[0.00010690119,0.00012022112,0.00025568684,0.00011699343,0.00005563039,0.0005457238,0.00016740836,0.33858615,0.019182984,0.4622574,0.17853701,0.00006783897],"about_ca_topic_score_codex":0.0014966575,"about_ca_topic_score_gemma":0.0026083186,"teacher_disagreement_score":0.0089362655,"about_ca_system_score_codex":0.0005693636,"about_ca_system_score_gemma":0.00094235735,"threshold_uncertainty_score":0.02989477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6122937,0.0019098518,0.2245168,0.008584139,0.00032204014,0.0001687929,0.0017913033,0.0007104071,0.1497029],"genre_scores_gemma":[0.966724,0.00056036183,0.015979402,0.00025009565,0.00018265449,0.000073985895,0.000759008,0.00016153582,0.015309081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977196,0.00051142724,0.00011243355,0.0004643786,0.0006785533,0.0005136993],"domain_scores_gemma":[0.9915071,0.0057144547,0.0007102065,0.00095747993,0.00039590403,0.0007147324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011069382,0.0007738966,0.0017256292,0.0011134057,0.0021960647,0.005868192,0.003179372,0.0028730526,0.020166434],"category_scores_gemma":[0.01571957,0.001069514,0.0013972983,0.0015443364,0.0036609594,0.013226058,0.00399386,0.0034631866,0.0012412516],"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.00022838975,0.00007972615,0.0010936899,0.00016820533,0.000043035496,0.00017035274,0.0004706403,0.03199382,0.0005583547,0.94612724,0.00648537,0.012581177],"study_design_scores_gemma":[0.000031044798,0.00001453131,0.00041464364,0.0000140657585,0.000015260768,0.00009301293,0.000119035714,0.038230658,0.00020179855,0.95899904,0.0018494084,0.000017458005],"about_ca_topic_score_codex":0.005012871,"about_ca_topic_score_gemma":0.0037760127,"teacher_disagreement_score":0.020166434,"about_ca_system_score_codex":0.0022345462,"about_ca_system_score_gemma":0.0019183834,"threshold_uncertainty_score":0.0674634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012570952,0.00024738096,0.98151314,0.00012286652,0.000028447981,0.000035197616,0.00016759653,0.0026623395,0.0026521648],"genre_scores_gemma":[0.27785861,0.0005907738,0.71566904,0.0000929723,0.000029065903,0.00019831822,0.00065481255,0.00054070697,0.004365723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994192,0.00011251557,0.000057496658,0.0001267961,0.00019071982,0.00009321492],"domain_scores_gemma":[0.9983461,0.00072981574,0.0001288761,0.00059354794,0.00014290992,0.000058732952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304097,0.0009038747,0.0007351324,0.00088313385,0.00089407415,0.0017860306,0.002074626,0.0007315037,0.0057389196],"category_scores_gemma":[0.0034621796,0.00073579716,0.0014960327,0.001280507,0.0012860997,0.004651881,0.003522762,0.0023192952,0.0012213902],"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.000469973,0.000093552444,0.0012185997,0.0005213241,0.00010310102,0.00020185555,0.001374255,0.25172403,0.016833952,0.3622882,0.009115264,0.3560559],"study_design_scores_gemma":[0.00006473731,0.00008947979,0.0003824767,0.00008032461,0.00007389793,0.00013413832,0.0002503221,0.5670536,0.013473864,0.39158708,0.026761087,0.000048983682],"about_ca_topic_score_codex":0.0057457257,"about_ca_topic_score_gemma":0.0066104094,"teacher_disagreement_score":0.0057457257,"about_ca_system_score_codex":0.00095669396,"about_ca_system_score_gemma":0.0011106202,"threshold_uncertainty_score":0.019198596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10915582,0.00075879693,0.513207,0.004498522,0.00060920825,0.00034391857,0.0008067782,0.000706248,0.3699137],"genre_scores_gemma":[0.8255883,0.0007018442,0.08285059,0.0012268171,0.00034833487,0.00041431526,0.0007153515,0.0003624504,0.08779197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973105,0.0011808656,0.00009685512,0.00034611678,0.00059362024,0.00047204067],"domain_scores_gemma":[0.9907358,0.0052280123,0.00034971943,0.001538883,0.0007954178,0.0013520555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001986733,0.0014307267,0.0015220772,0.0013403377,0.0031836017,0.0048128255,0.0034439855,0.0024877647,0.020091133],"category_scores_gemma":[0.009729923,0.0007956351,0.0012702262,0.0022083751,0.003178284,0.0063467836,0.0035263295,0.0058169616,0.0019100633],"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.00007104438,0.000044588025,0.000072645555,0.000042447424,0.000013696624,0.000029428758,0.00010000821,0.004762658,0.00026517475,0.9853308,0.004169702,0.005097686],"study_design_scores_gemma":[0.000035219742,0.000014397869,0.000045875924,0.000009983333,0.000011703532,0.000037540416,0.000032261894,0.02212019,0.00017214839,0.97386,0.0036516925,0.00000906842],"about_ca_topic_score_codex":0.0021535533,"about_ca_topic_score_gemma":0.0031198629,"teacher_disagreement_score":0.020091133,"about_ca_system_score_codex":0.0022173019,"about_ca_system_score_gemma":0.0018054396,"threshold_uncertainty_score":0.06721157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07988883,0.0009430322,0.90242803,0.00067496643,0.00013769821,0.0003140239,0.00019002949,0.00057409995,0.014849348],"genre_scores_gemma":[0.43329367,0.0003181715,0.555346,0.00038126766,0.000074074334,0.0003119009,0.0005161927,0.00022052131,0.009538103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978307,0.0010938585,0.000107080785,0.00020962721,0.0004993451,0.0002594373],"domain_scores_gemma":[0.9932214,0.005259153,0.00022831226,0.00048976997,0.00053051906,0.0002708151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428524,0.0006147739,0.0017842437,0.0019263267,0.0011733074,0.0014720802,0.002725917,0.0022331157,0.005823625],"category_scores_gemma":[0.015442397,0.0007761114,0.000912013,0.0017190875,0.001299594,0.0024718517,0.0021677755,0.002347957,0.0006911887],"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.00073216885,0.00050678116,0.0036144347,0.00041486695,0.00015007141,0.00027008305,0.0005385397,0.4465395,0.0020490834,0.22070323,0.01198289,0.31249836],"study_design_scores_gemma":[0.00006761316,0.0000912042,0.0003645153,0.000059584523,0.00005285849,0.00009143264,0.00006263885,0.8874922,0.00067927106,0.10873112,0.0022960932,0.00001150949],"about_ca_topic_score_codex":0.004544347,"about_ca_topic_score_gemma":0.0074226726,"teacher_disagreement_score":0.005823625,"about_ca_system_score_codex":0.0011979726,"about_ca_system_score_gemma":0.0014654708,"threshold_uncertainty_score":0.019481897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53979474,0.00080247317,0.30636135,0.0023830694,0.00064334716,0.00015563983,0.00034384793,0.00029587816,0.14921969],"genre_scores_gemma":[0.9640601,0.0002616501,0.023776373,0.00022998809,0.00014897827,0.00010499049,0.00014536711,0.000044061002,0.011228566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989505,0.00035232885,0.00009600592,0.000181932,0.00020416827,0.00021513834],"domain_scores_gemma":[0.99716717,0.001641233,0.00034766097,0.0002934671,0.0002630023,0.00028743353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011402989,0.00041124213,0.00077207194,0.00080215896,0.0014692359,0.0023272487,0.00075281423,0.0008007205,0.005358661],"category_scores_gemma":[0.006099325,0.0003013343,0.00079214154,0.00091498025,0.0032866956,0.004214347,0.0013638729,0.0018554025,0.00047922778],"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.00006642621,0.000014967631,0.00015840653,0.00002066268,0.000003989007,0.000054231532,0.00018964185,0.0011914098,0.0003622742,0.993491,0.0004451275,0.0040018423],"study_design_scores_gemma":[0.000018960927,0.000015706275,0.000101828744,0.0000048623483,0.000003344869,0.00003370912,0.0000572725,0.0042698337,0.00018432668,0.9945511,0.0007522823,0.00000687387],"about_ca_topic_score_codex":0.0009959841,"about_ca_topic_score_gemma":0.0009770017,"teacher_disagreement_score":0.005358661,"about_ca_system_score_codex":0.0009358115,"about_ca_system_score_gemma":0.0010967896,"threshold_uncertainty_score":0.017926514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2648578,0.00010078389,0.721805,0.0002842663,0.00009992761,0.00052933366,0.00013946177,0.0025620947,0.00962132],"genre_scores_gemma":[0.5579166,0.00008015943,0.43267396,0.00017643948,0.00002641243,0.0007670653,0.00036961972,0.00024053185,0.007749202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995066,0.0001146928,0.00003287546,0.00011867428,0.00015059316,0.000076550736],"domain_scores_gemma":[0.99864036,0.00047033906,0.000093763294,0.0003296407,0.00030346384,0.00016238556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001186663,0.00091123127,0.0007150222,0.0006417775,0.00077072857,0.00086945936,0.0030466616,0.0008218779,0.004876665],"category_scores_gemma":[0.0035845377,0.00064988836,0.0008140416,0.00042335253,0.0008543823,0.0016639363,0.0023701906,0.0015106328,0.00096853916],"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.00017236256,0.0005032719,0.008609734,0.00013787652,0.0001399396,0.00027501595,0.0004180683,0.76066303,0.012546073,0.01237307,0.00235286,0.20180869],"study_design_scores_gemma":[0.000028008506,0.000096501564,0.00051901845,0.000008635257,0.000018823723,0.000036051784,0.000073546194,0.9885358,0.0031421275,0.0055266544,0.0020047363,0.000010146525],"about_ca_topic_score_codex":0.0034727692,"about_ca_topic_score_gemma":0.006638405,"teacher_disagreement_score":0.004876665,"about_ca_system_score_codex":0.00085747935,"about_ca_system_score_gemma":0.0009993146,"threshold_uncertainty_score":0.01631409},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014422677,0.00025853072,0.9385993,0.000082914856,0.000083729654,0.0003964338,0.00036596364,0.037857648,0.007932832],"genre_scores_gemma":[0.13205041,0.00031443126,0.8553527,0.000089446155,0.000027739427,0.00041149274,0.0012591142,0.004260851,0.0062339087],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994916,0.0001761639,0.0000655125,0.00010830448,0.00011687489,0.000041495678],"domain_scores_gemma":[0.9988544,0.00057963183,0.000080428144,0.0001994224,0.00018819667,0.00009792544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783294,0.0010364639,0.00039569775,0.00048204607,0.00043067036,0.0011428844,0.0011845287,0.00062217924,0.010296092],"category_scores_gemma":[0.004433163,0.0006189363,0.0006474917,0.00026497626,0.0005720996,0.0014268917,0.0010753578,0.0010057129,0.0028931608],"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.0007279485,0.00035973053,0.0032434126,0.0013777276,0.00007636227,0.0009944843,0.003359326,0.02688239,0.12509863,0.05053827,0.033263,0.7540788],"study_design_scores_gemma":[0.00016481281,0.0004292095,0.002761329,0.00031306865,0.00009910441,0.0014742151,0.000539926,0.55439115,0.18738647,0.030484881,0.22181533,0.00014048362],"about_ca_topic_score_codex":0.0015302277,"about_ca_topic_score_gemma":0.0025253117,"teacher_disagreement_score":0.010296092,"about_ca_system_score_codex":0.00034723885,"about_ca_system_score_gemma":0.00052383484,"threshold_uncertainty_score":0.034443915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008313016,0.00010215389,0.99563843,0.00013808468,0.000026045946,0.00027572268,0.00006503032,0.0009833834,0.0019397608],"genre_scores_gemma":[0.02336595,0.00011668541,0.97380686,0.00009817597,0.000022468515,0.0004131072,0.00018188352,0.00019125613,0.0018035943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426174,0.0026136239,0.0005635497,0.0008502533,0.0015175802,0.0001932495],"domain_scores_gemma":[0.99271387,0.002954014,0.00044326272,0.0024373871,0.0011192873,0.000332174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006364626,0.0019019281,0.00091262854,0.004459609,0.0012370694,0.0036711104,0.0032706498,0.0022057898,0.0042557144],"category_scores_gemma":[0.015230702,0.001465357,0.002308803,0.0018663035,0.0029386436,0.004560259,0.0028958307,0.0043581324,0.001859294],"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.00012799547,0.00058475183,0.0016702411,0.0011186403,0.00013875001,0.00030047115,0.0024731762,0.042414535,0.013935432,0.6076322,0.0075654765,0.32203826],"study_design_scores_gemma":[0.00009751597,0.00023992073,0.0007842881,0.00047861048,0.00013851954,0.0009791483,0.00039357785,0.48685026,0.00748917,0.39054307,0.111863635,0.00014236107],"about_ca_topic_score_codex":0.0031416262,"about_ca_topic_score_gemma":0.0059588,"teacher_disagreement_score":0.006364626,"about_ca_system_score_codex":0.0018979902,"about_ca_system_score_gemma":0.0024331328,"threshold_uncertainty_score":0.033659756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38998237,0.00013984191,0.5707739,0.0001491049,0.00012809482,0.00040011524,0.00019388596,0.0035180757,0.03471464],"genre_scores_gemma":[0.8881535,0.000094007395,0.09182605,0.000043263262,0.00000821476,0.00027914072,0.0001149382,0.00012093833,0.019359944],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997272,0.0000857691,0.0000129579685,0.000054028726,0.00008782843,0.00003222267],"domain_scores_gemma":[0.9998023,0.000057548605,0.00002146185,0.000038883478,0.000029831459,0.000050033672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025254235,0.00048907724,0.00033564377,0.00023041223,0.0004863203,0.0007452634,0.00072657305,0.000520265,0.0049423054],"category_scores_gemma":[0.00041827638,0.00020684213,0.00038935806,0.00011111427,0.0006303762,0.0005462458,0.0011180323,0.00030645277,0.0006642681],"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.0015573986,0.00081538805,0.0057851356,0.0005738607,0.00009952813,0.0031253141,0.0050137374,0.28492668,0.49220273,0.056535076,0.0051866747,0.14417852],"study_design_scores_gemma":[0.0002734903,0.0016090572,0.005493665,0.0000788441,0.00011076817,0.0011283212,0.0009790179,0.7289866,0.16588737,0.010188679,0.08510368,0.000160481],"about_ca_topic_score_codex":0.0017101347,"about_ca_topic_score_gemma":0.0016308073,"teacher_disagreement_score":0.0049423054,"about_ca_system_score_codex":0.00025981682,"about_ca_system_score_gemma":0.0003238314,"threshold_uncertainty_score":0.016533613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013374935,0.0060491697,0.5086396,0.005782696,0.0018916308,0.00008002037,0.00042770692,0.0009851211,0.46276915],"genre_scores_gemma":[0.5023147,0.0050405706,0.20762415,0.0024941366,0.0027840072,0.00035311974,0.00089591206,0.0011815128,0.2773119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988393,0.00043074467,0.000047507492,0.0002983513,0.0002923107,0.00009174416],"domain_scores_gemma":[0.9990996,0.00048812633,0.000034971992,0.00019741592,0.00010862179,0.0000712754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008179301,0.0011010965,0.000982709,0.0013673538,0.0019424342,0.0043775523,0.0008807284,0.0013639429,0.03287981],"category_scores_gemma":[0.0038917938,0.00044336062,0.0010433244,0.0013755457,0.0031252021,0.0073510716,0.0026485387,0.0041363286,0.0068465173],"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.000011720668,0.000010245611,0.000044759738,0.000039753984,0.000006772633,0.00001023889,0.00006559809,0.0004326376,0.000100498335,0.9783507,0.0042719943,0.01665494],"study_design_scores_gemma":[0.000006597345,0.0000056095428,0.000037236787,0.000015554819,0.0000047034528,0.000033701646,0.000014261658,0.0016470328,0.00015270767,0.97351336,0.024565253,0.0000040659365],"about_ca_topic_score_codex":0.00041670637,"about_ca_topic_score_gemma":0.0004276836,"teacher_disagreement_score":0.03287981,"about_ca_system_score_codex":0.0011954193,"about_ca_system_score_gemma":0.00058521435,"threshold_uncertainty_score":0.109993875},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28484708,0.0007939978,0.3221418,0.028489215,0.002367122,0.000927934,0.0016143511,0.004461925,0.35435665],"genre_scores_gemma":[0.7506116,0.0004966486,0.06517378,0.0028321203,0.000080643134,0.00033341759,0.00081922184,0.0007066462,0.17894587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976224,0.000035298995,0.000013627665,0.00005411452,0.00006198021,0.00007273402],"domain_scores_gemma":[0.9997787,0.00004418305,0.000015703385,0.000045268145,0.0000379733,0.00007813195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003542178,0.00087676034,0.0006869828,0.00022442002,0.0015604909,0.0020325186,0.0009237684,0.0016284528,0.03794448],"category_scores_gemma":[0.002176459,0.0004107125,0.0005738788,0.00020182804,0.0013763391,0.0038698502,0.0022046922,0.002856473,0.0075901933],"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.0033313902,0.00065024407,0.003791817,0.00061742176,0.0002665394,0.0013825635,0.008610774,0.0075517264,0.03299715,0.7110719,0.093681574,0.1360469],"study_design_scores_gemma":[0.00034323338,0.0010090664,0.004565582,0.00017688135,0.00012018593,0.0006653883,0.009639638,0.02943763,0.014778392,0.44496882,0.4941037,0.00019150603],"about_ca_topic_score_codex":0.0046663005,"about_ca_topic_score_gemma":0.004638188,"teacher_disagreement_score":0.03794448,"about_ca_system_score_codex":0.0004227101,"about_ca_system_score_gemma":0.00054296176,"threshold_uncertainty_score":0.12693691},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13712135,0.07937229,0.15118112,0.17418705,0.007532553,0.00032908132,0.001079064,0.0011791994,0.44801825],"genre_scores_gemma":[0.82229155,0.022581547,0.07505817,0.006164137,0.001107667,0.00024041042,0.0011918729,0.000318082,0.07104649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974456,0.0012621385,0.00013997317,0.00028033816,0.00048914837,0.00038288735],"domain_scores_gemma":[0.99741864,0.0006963266,0.00023608588,0.0001997221,0.0006146977,0.00083443796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017990206,0.00079059036,0.0008087206,0.0008386065,0.0015389338,0.010047562,0.0020446777,0.0030157866,0.0106560495],"category_scores_gemma":[0.010220504,0.00040340654,0.00057441456,0.00091639097,0.003536086,0.012288353,0.002997884,0.0036868453,0.0021389308],"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.00028222156,0.00019012786,0.0037227164,0.0005723613,0.00012023586,0.00016458119,0.002887326,0.0045628357,0.0010697942,0.74496776,0.04569719,0.19576292],"study_design_scores_gemma":[0.000066677225,0.000107088694,0.0018583403,0.0004010818,0.00004469714,0.00021340536,0.0051058866,0.014042302,0.0008579351,0.6608968,0.31634983,0.000056039895],"about_ca_topic_score_codex":0.00794435,"about_ca_topic_score_gemma":0.013766215,"teacher_disagreement_score":0.0106560495,"about_ca_system_score_codex":0.002898492,"about_ca_system_score_gemma":0.0035158156,"threshold_uncertainty_score":0.035648048},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028293911,0.0033293369,0.23932521,0.028953284,0.0039571896,0.0003699057,0.0023727927,0.009431732,0.6839665],"genre_scores_gemma":[0.39976397,0.0038705985,0.25186148,0.008210871,0.001131753,0.0003737746,0.006641711,0.0032218052,0.32492405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715555,0.00062652177,0.00015788872,0.0008027145,0.0007976106,0.00045973397],"domain_scores_gemma":[0.997036,0.0011423415,0.0002717409,0.0006109705,0.000608563,0.0003304178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647368,0.0011451413,0.00097469136,0.0011127404,0.003537387,0.0058256765,0.001856534,0.0025480532,0.052349348],"category_scores_gemma":[0.009989784,0.00075640326,0.0014924457,0.0012894855,0.0039290274,0.0061213626,0.0042213346,0.0035882075,0.012380916],"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.00020257989,0.00008748371,0.0015863756,0.00036480377,0.00008624034,0.0002712036,0.00062513206,0.0056571797,0.0014905577,0.74122673,0.13732363,0.11107811],"study_design_scores_gemma":[0.00009230716,0.00009457532,0.0005918654,0.00018778938,0.00006335332,0.00044989728,0.0004976785,0.01507665,0.0030117605,0.3910987,0.58878607,0.000049332848],"about_ca_topic_score_codex":0.008549187,"about_ca_topic_score_gemma":0.008265529,"teacher_disagreement_score":0.052349348,"about_ca_system_score_codex":0.0020507153,"about_ca_system_score_gemma":0.0046300874,"threshold_uncertainty_score":0.17512602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055007335,0.00012515654,0.93715495,0.00011711921,0.000028163564,0.00017669486,0.000030624775,0.0007063772,0.006653654],"genre_scores_gemma":[0.6706523,0.00012925468,0.32575426,0.00004440957,0.000011674677,0.00013927746,0.000046758556,0.00012167138,0.0031004979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962616,0.00011091506,0.000018389854,0.00008315311,0.0001174741,0.000043908458],"domain_scores_gemma":[0.9991497,0.00026540717,0.00012029536,0.00010892579,0.00021440386,0.0001412534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068147405,0.00075945526,0.000460672,0.0005222151,0.0005016541,0.0012777665,0.0012726913,0.00062480546,0.0015791745],"category_scores_gemma":[0.0027320113,0.00040675007,0.00038463055,0.00027570804,0.00092916226,0.0009884301,0.0012891005,0.00053492276,0.00039285194],"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.0002567179,0.0002794236,0.0062192813,0.00035775342,0.00010266792,0.00041273926,0.0010401112,0.7003188,0.046630975,0.0514577,0.0020870094,0.19083676],"study_design_scores_gemma":[0.000014709304,0.0000950978,0.00044863563,0.0000135319915,0.00001667342,0.00007611917,0.00012449747,0.9857226,0.0050453707,0.0059397025,0.002485917,0.000017039998],"about_ca_topic_score_codex":0.004635089,"about_ca_topic_score_gemma":0.005145498,"teacher_disagreement_score":0.004635089,"about_ca_system_score_codex":0.0005851667,"about_ca_system_score_gemma":0.0011624569,"threshold_uncertainty_score":0.009216249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056585077,0.00011170707,0.9301497,0.00016959463,0.000029016932,0.000102625156,0.00004374307,0.00089580467,0.011912887],"genre_scores_gemma":[0.57141894,0.00009048685,0.42088607,0.000073921,0.00000830078,0.00028111914,0.00010186369,0.00018422946,0.0069550457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944645,0.00019672168,0.000031739186,0.00010115573,0.0001425518,0.00008145885],"domain_scores_gemma":[0.9992968,0.00037373154,0.000053841315,0.00013540057,0.000064660366,0.00007554922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069339457,0.0006844456,0.00053139264,0.00054404937,0.0006385253,0.0015574665,0.0009038175,0.00088098017,0.0049050404],"category_scores_gemma":[0.0026290994,0.00039831025,0.0008530416,0.00028144204,0.0011674017,0.0015164331,0.0022212625,0.0010963931,0.0006822753],"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.00024143024,0.00019484504,0.0017152178,0.000266954,0.00005311027,0.00033406506,0.0008733165,0.26475182,0.0278773,0.541831,0.0025624372,0.15929846],"study_design_scores_gemma":[0.000058629856,0.00010889049,0.00032083402,0.000033695145,0.000024156048,0.00017489724,0.00007373304,0.82436657,0.007084656,0.15432808,0.013391288,0.000034559598],"about_ca_topic_score_codex":0.0007543165,"about_ca_topic_score_gemma":0.0010834205,"teacher_disagreement_score":0.0049050404,"about_ca_system_score_codex":0.001032959,"about_ca_system_score_gemma":0.0004841702,"threshold_uncertainty_score":0.01640904},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22692771,0.0010755631,0.119285375,0.007678022,0.0043748803,0.0011485356,0.004013789,0.045191526,0.59030455],"genre_scores_gemma":[0.39059445,0.0004886481,0.07874497,0.0013493614,0.00020243364,0.0003369378,0.0038774242,0.0032441875,0.52116156],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997243,0.000048732236,0.00001145485,0.0000549327,0.000087728484,0.00007278997],"domain_scores_gemma":[0.9995695,0.000061019113,0.000016019378,0.00006410997,0.000080004975,0.00020951201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042628995,0.0009097825,0.00044056427,0.0007155979,0.0022311204,0.0013251279,0.001362213,0.0012402117,0.08088574],"category_scores_gemma":[0.0012413787,0.0003940304,0.00042671463,0.0005022941,0.0007021275,0.0018583986,0.002260271,0.0012124198,0.012121077],"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.0036192434,0.0007964671,0.0053463015,0.00044118814,0.00014562598,0.0028845938,0.0022214726,0.006074132,0.01382543,0.050741427,0.65196645,0.26193762],"study_design_scores_gemma":[0.0002474855,0.000593035,0.003404476,0.0001679439,0.0001263226,0.0012634412,0.0019405308,0.030327115,0.0066117244,0.010872039,0.9443316,0.00011436637],"about_ca_topic_score_codex":0.0069647715,"about_ca_topic_score_gemma":0.015612203,"teacher_disagreement_score":0.08088574,"about_ca_system_score_codex":0.0005819247,"about_ca_system_score_gemma":0.00071229326,"threshold_uncertainty_score":0.27058977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006913881,0.0005291603,0.9761431,0.00045288642,0.000093817645,0.00019482117,0.000030286828,0.0012842045,0.014357755],"genre_scores_gemma":[0.26883477,0.0008477519,0.7150934,0.00021967643,0.00005249341,0.00065058435,0.000114710936,0.0001288509,0.014057763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.00011603694,0.000024616016,0.000064168584,0.00010713032,0.000034254135],"domain_scores_gemma":[0.9997274,0.00008413506,0.000022095248,0.00004794018,0.00006557453,0.000052938125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061799533,0.0006825185,0.00048541976,0.00040523562,0.00088396645,0.0017123406,0.0020955468,0.0014395803,0.0046747085],"category_scores_gemma":[0.0015111673,0.00042541916,0.00047773955,0.0003554857,0.0010080357,0.0015806855,0.0014444119,0.0015378658,0.0013225299],"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.00017013313,0.0002569638,0.001266562,0.00037776816,0.00016414658,0.00043009565,0.0006689313,0.42549905,0.016059078,0.33278763,0.0073097707,0.21500987],"study_design_scores_gemma":[0.000043123633,0.00008911189,0.00019496615,0.00004736855,0.000035182995,0.00013919166,0.000052025567,0.9069641,0.0017998411,0.06426263,0.026348606,0.00002380353],"about_ca_topic_score_codex":0.0036325937,"about_ca_topic_score_gemma":0.004215792,"teacher_disagreement_score":0.0046747085,"about_ca_system_score_codex":0.0007997916,"about_ca_system_score_gemma":0.0011822466,"threshold_uncertainty_score":0.015638411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061301194,0.0003552102,0.9291491,0.00045916092,0.00003187344,0.00013898515,0.00010682818,0.00047174422,0.007985929],"genre_scores_gemma":[0.77448726,0.00021758492,0.22068694,0.00023547998,0.00003741034,0.00040568362,0.0002625127,0.00014664448,0.003520428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998004,0.0012040779,0.00007324246,0.00021568994,0.00027959136,0.00022330583],"domain_scores_gemma":[0.98765904,0.010493109,0.00049466325,0.0005754135,0.0004614248,0.00031638134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003506673,0.00093511277,0.0015436228,0.001255338,0.00085372425,0.0016026283,0.001630437,0.0014311901,0.0033019187],"category_scores_gemma":[0.019212466,0.00072334736,0.0007263266,0.0008953195,0.0023186323,0.0020580285,0.0018546926,0.001717016,0.00041534725],"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.00010510959,0.000047403355,0.000758471,0.00005778175,0.000039430568,0.00006153129,0.00009224819,0.8261958,0.00031888497,0.15881272,0.00092120626,0.012589494],"study_design_scores_gemma":[0.000014727997,0.000010036249,0.000042214913,0.0000046372834,0.0000035058106,0.0000055780865,0.0000064328356,0.965692,0.00009586785,0.033895466,0.00022497054,0.0000046234795],"about_ca_topic_score_codex":0.007181776,"about_ca_topic_score_gemma":0.009003964,"teacher_disagreement_score":0.007181776,"about_ca_system_score_codex":0.0021031727,"about_ca_system_score_gemma":0.002494184,"threshold_uncertainty_score":0.01854527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19020696,0.0026038585,0.7808716,0.000840147,0.000108342574,0.00036903014,0.00009446825,0.0010623838,0.02384312],"genre_scores_gemma":[0.60580105,0.0013641757,0.3882174,0.00040283386,0.00012252183,0.00026125,0.00015421236,0.00013922602,0.0035372337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700505,0.0012539163,0.00021041757,0.00047403344,0.0008246033,0.00023206051],"domain_scores_gemma":[0.9847206,0.011328795,0.0009953076,0.0015137498,0.0009162603,0.0005253876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037045327,0.0016828049,0.0010352575,0.0018367096,0.0007596264,0.002043389,0.00267471,0.0013159266,0.003835984],"category_scores_gemma":[0.015456201,0.00041441526,0.0006862708,0.0013108678,0.0016374415,0.0046191826,0.0023255155,0.0018419026,0.0007860262],"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.0015378784,0.00269516,0.0072131865,0.0013795185,0.00028555733,0.00013635728,0.000982315,0.17982757,0.038739204,0.13469997,0.0025732054,0.6299301],"study_design_scores_gemma":[0.00017387,0.0026650797,0.0016003775,0.00015543419,0.00016748553,0.00033723097,0.00029464738,0.91247755,0.016774263,0.05658665,0.00870145,0.00006607099],"about_ca_topic_score_codex":0.0014325107,"about_ca_topic_score_gemma":0.002488992,"teacher_disagreement_score":0.003835984,"about_ca_system_score_codex":0.0011477945,"about_ca_system_score_gemma":0.00122475,"threshold_uncertainty_score":0.01959169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010949775,0.00023467343,0.90085524,0.00026982065,0.00013851332,0.0004260042,0.0014202273,0.04914091,0.03656486],"genre_scores_gemma":[0.14241794,0.00032696693,0.8239024,0.00066656613,0.000058853624,0.0010253523,0.0038597558,0.011359718,0.01638241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.0000680948,0.000032363616,0.00007239699,0.00022988174,0.00009824539],"domain_scores_gemma":[0.9995691,0.0001527053,0.000030987474,0.000069097085,0.00014647409,0.00003161034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337611,0.0012867581,0.0003867019,0.0008291032,0.00035301884,0.0010550492,0.0012726948,0.0005120953,0.02433811],"category_scores_gemma":[0.0016106624,0.0004742253,0.00070630125,0.0004587174,0.0005065278,0.000485305,0.0007284651,0.0012362554,0.0075631654],"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.00086822564,0.00032238103,0.0020479625,0.0014846106,0.00014745386,0.0010824086,0.00053018046,0.16546609,0.101540565,0.09819431,0.10995852,0.5183573],"study_design_scores_gemma":[0.0005272189,0.00054381124,0.0014621973,0.0004721685,0.00010177041,0.0006387221,0.00010594455,0.47366977,0.1444578,0.068718635,0.3091471,0.0001549047],"about_ca_topic_score_codex":0.0032073567,"about_ca_topic_score_gemma":0.0035614786,"teacher_disagreement_score":0.02433811,"about_ca_system_score_codex":0.00065392215,"about_ca_system_score_gemma":0.0013165734,"threshold_uncertainty_score":0.08141905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03312062,0.0002494325,0.88122416,0.0010379499,0.00024281534,0.00034405373,0.0023712553,0.0023311698,0.07907849],"genre_scores_gemma":[0.28377438,0.00022476971,0.68358904,0.00046866832,0.00013367947,0.00037054764,0.0022529992,0.00060056115,0.0285855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00018192558,0.00007023227,0.00020647689,0.00034791592,0.00020289383],"domain_scores_gemma":[0.9989417,0.0006148609,0.00004942243,0.00013555733,0.00018701417,0.000071534996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007833966,0.00069044804,0.0006360245,0.0005610246,0.00042319353,0.0017501768,0.0017182555,0.00092423457,0.02445223],"category_scores_gemma":[0.0044663465,0.000420469,0.0010124294,0.0007740057,0.0005944961,0.0018093978,0.0022558235,0.001650776,0.002714011],"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.00047483985,0.00026137035,0.0019002762,0.0005340968,0.0000954806,0.00062835665,0.00028282034,0.22038582,0.0055816094,0.55621487,0.0382231,0.17541735],"study_design_scores_gemma":[0.00026874058,0.000077711695,0.00026801255,0.000048903647,0.00003407451,0.0002938397,0.00008981728,0.7742949,0.0035188203,0.1781725,0.04290594,0.00002679701],"about_ca_topic_score_codex":0.0045085214,"about_ca_topic_score_gemma":0.009412309,"teacher_disagreement_score":0.02445223,"about_ca_system_score_codex":0.0009241363,"about_ca_system_score_gemma":0.002151252,"threshold_uncertainty_score":0.08180088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6037826,0.00018478227,0.29629153,0.0037303825,0.00020260135,0.00018438621,0.0003812989,0.0013513165,0.09389112],"genre_scores_gemma":[0.9502325,0.00005667844,0.029022198,0.00032221017,0.00003686505,0.00006646381,0.00026852588,0.000073320916,0.019921282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999326,0.00017150574,0.00003269058,0.00018728623,0.0001192774,0.00016332108],"domain_scores_gemma":[0.9979705,0.0013587432,0.00012812654,0.00022892246,0.00013679484,0.00017691446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090320106,0.0003966372,0.0006082666,0.0003175742,0.001175013,0.0017047696,0.0010548321,0.0013025842,0.011912238],"category_scores_gemma":[0.00651786,0.00020456659,0.0006550483,0.0002961976,0.0017507558,0.002894311,0.0020534564,0.0016389802,0.0010288659],"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.00062136166,0.0002679213,0.0045191143,0.00024054846,0.00006968101,0.0006615489,0.0007266602,0.06092261,0.00522364,0.862082,0.011323739,0.05334119],"study_design_scores_gemma":[0.00008502836,0.00016554621,0.000768556,0.00002876356,0.000028913115,0.00020722326,0.00039897152,0.2641059,0.007348161,0.7202212,0.0066122883,0.00002941283],"about_ca_topic_score_codex":0.001432845,"about_ca_topic_score_gemma":0.0020847905,"teacher_disagreement_score":0.011912238,"about_ca_system_score_codex":0.0007684434,"about_ca_system_score_gemma":0.0011902024,"threshold_uncertainty_score":0.039850354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27710283,0.00046878698,0.67980343,0.0015779289,0.00008021507,0.00018204922,0.00044796686,0.0006375673,0.039699167],"genre_scores_gemma":[0.9651932,0.0002066278,0.025030732,0.00009439067,0.000027694017,0.00012673702,0.00019789182,0.000061758445,0.009060934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988244,0.0005330831,0.000053072505,0.00017484264,0.00021608992,0.00019838453],"domain_scores_gemma":[0.995697,0.0029445502,0.0003652966,0.0004470032,0.00020888411,0.00033711756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013040875,0.0012325653,0.001351832,0.00041978352,0.00057881756,0.0022220227,0.0019339675,0.002117739,0.005987364],"category_scores_gemma":[0.009567447,0.0005479228,0.00069323205,0.00064553635,0.0013415318,0.0034934862,0.002164019,0.0022109349,0.0005447787],"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.0007306167,0.00020917242,0.0010929962,0.00016945922,0.00009821068,0.00019987572,0.00021745668,0.48052233,0.0035059333,0.48029724,0.00423277,0.028724054],"study_design_scores_gemma":[0.0001454924,0.00007719744,0.00020464249,0.000012011312,0.000018396882,0.000052957286,0.000031898137,0.7793347,0.00052122213,0.21846017,0.0011261803,0.0000151420745],"about_ca_topic_score_codex":0.0010025492,"about_ca_topic_score_gemma":0.0009984928,"teacher_disagreement_score":0.005987364,"about_ca_system_score_codex":0.001848433,"about_ca_system_score_gemma":0.0012325852,"threshold_uncertainty_score":0.020029783},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026130242,0.10834732,0.07299844,0.031585995,0.002263195,0.00020334734,0.00023494073,0.00016994713,0.75806653],"genre_scores_gemma":[0.8547713,0.043632988,0.029739786,0.0046164338,0.0013243684,0.00045645196,0.0002834761,0.00008456124,0.06509059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986424,0.00077030965,0.000058512407,0.00012937274,0.00028758496,0.00011169147],"domain_scores_gemma":[0.99863094,0.0009378557,0.00009695718,0.00009295833,0.000110656474,0.0001306588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010236879,0.0009123668,0.0009804533,0.0009716043,0.001162926,0.007659192,0.0007767669,0.002134504,0.010087791],"category_scores_gemma":[0.003939959,0.0002911987,0.0003892176,0.001556992,0.0076873675,0.004784109,0.0017212305,0.0024745702,0.00083999167],"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.000022312845,0.000027253405,0.00026181553,0.0001633535,0.00001999338,0.000023581944,0.0003946345,0.0015484573,0.00010244946,0.97718924,0.0062477626,0.013999189],"study_design_scores_gemma":[0.000025126059,0.000017856457,0.0003811607,0.000092347575,0.000012938488,0.000037346465,0.0005290722,0.0019436314,0.00006638923,0.92021084,0.07667476,0.0000085546735],"about_ca_topic_score_codex":0.0072127064,"about_ca_topic_score_gemma":0.008182417,"teacher_disagreement_score":0.010087791,"about_ca_system_score_codex":0.0026413314,"about_ca_system_score_gemma":0.0019323297,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014260714,0.0044518346,0.091182,0.12409237,0.06770604,0.0003957105,0.019185644,0.015252441,0.6763079],"genre_scores_gemma":[0.014084829,0.0066632186,0.06869866,0.026624981,0.017641714,0.00046892153,0.014543826,0.012786884,0.8384869],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989519,0.0002716326,0.00010645292,0.00012823466,0.00044495918,0.0000967178],"domain_scores_gemma":[0.99535865,0.0022007737,0.0001345875,0.00040144307,0.0015568852,0.00034774537],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016436114,0.0014661206,0.001076147,0.0018763114,0.0017346919,0.0037077973,0.0022297725,0.0021207076,0.34682992],"category_scores_gemma":[0.007070913,0.0008986583,0.0013905222,0.0027056076,0.001051892,0.0066437996,0.0017119022,0.004604167,0.20253763],"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.000024922341,0.00002244392,0.000029162831,0.0000550974,0.0000027474475,0.000032678578,0.000039249502,0.000106586966,0.00022658998,0.011580349,0.9781737,0.009706474],"study_design_scores_gemma":[0.000014237957,0.000015461155,0.00027939258,0.00006105578,0.0000030009915,0.000054607313,0.0000394758,0.00035074676,0.00037895664,0.011716233,0.9870613,0.000025564928],"about_ca_topic_score_codex":0.016384471,"about_ca_topic_score_gemma":0.036184277,"teacher_disagreement_score":0.34682992,"about_ca_system_score_codex":0.0027740519,"about_ca_system_score_gemma":0.0017685681,"threshold_uncertainty_score":0.93166786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60062885,0.0016686989,0.27894008,0.004825332,0.00032238054,0.00028364145,0.001078676,0.0006436534,0.11160877],"genre_scores_gemma":[0.97202015,0.00055159244,0.0117973015,0.00019905601,0.00007305576,0.00013929718,0.00031244013,0.00016894823,0.014738275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.00033613664,0.00003869494,0.00018428169,0.00015082805,0.00033672666],"domain_scores_gemma":[0.9911248,0.0061436947,0.000534574,0.00034102795,0.00039243503,0.0014635243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017274331,0.0010083863,0.0015117496,0.001021762,0.0009655282,0.0035288788,0.002171,0.0025887303,0.019008474],"category_scores_gemma":[0.013820525,0.00077450526,0.0006780625,0.0006984716,0.0017905317,0.005655289,0.0016686035,0.0026129333,0.0010160499],"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.0014810086,0.00024695744,0.0012387373,0.0003582927,0.000100246136,0.00018384762,0.000475279,0.13236478,0.0054956186,0.829381,0.009009582,0.019664718],"study_design_scores_gemma":[0.0002219054,0.00030638414,0.0012464283,0.000098189405,0.000060166512,0.00012045571,0.00030613865,0.5237578,0.0016326297,0.46965533,0.0025257235,0.00006891865],"about_ca_topic_score_codex":0.0029232346,"about_ca_topic_score_gemma":0.002556401,"teacher_disagreement_score":0.019008474,"about_ca_system_score_codex":0.0021618004,"about_ca_system_score_gemma":0.0031346572,"threshold_uncertainty_score":0.06358975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27186158,0.00022940604,0.7103505,0.000335673,0.000030143947,0.00032885087,0.000057260135,0.00046199912,0.016344605],"genre_scores_gemma":[0.792191,0.00014503188,0.20534302,0.000095914904,0.0000059993254,0.00028940433,0.000059093378,0.00014778058,0.0017227405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989442,0.0004345035,0.00006043044,0.00016762367,0.0002635127,0.00012980551],"domain_scores_gemma":[0.9971961,0.0016434138,0.00027811935,0.00032213124,0.0003912969,0.00016882374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020791742,0.0011519328,0.00058945315,0.0010856672,0.0005662577,0.0020418582,0.001184078,0.00096130127,0.002183508],"category_scores_gemma":[0.011907815,0.000567207,0.00051715417,0.00040025817,0.0011069224,0.0025785165,0.0018607688,0.0011781881,0.0005906738],"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.00032515693,0.0005635514,0.021132883,0.0004021,0.00017391438,0.00046337378,0.0022782306,0.6100076,0.07191785,0.1097405,0.0016391922,0.18135573],"study_design_scores_gemma":[0.00008921992,0.00048051495,0.0030771953,0.00011897028,0.000069232396,0.0003384913,0.00080822094,0.91389406,0.01166861,0.06311067,0.006263371,0.00008142803],"about_ca_topic_score_codex":0.00096704037,"about_ca_topic_score_gemma":0.0021720456,"teacher_disagreement_score":0.002183508,"about_ca_system_score_codex":0.00090337533,"about_ca_system_score_gemma":0.0010005878,"threshold_uncertainty_score":0.010995865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02322219,0.00019098035,0.96142584,0.00035051754,0.000054069624,0.00011638677,0.00008131594,0.004136241,0.010422416],"genre_scores_gemma":[0.56413066,0.00014673432,0.42906716,0.0003681773,0.00007466534,0.00033653327,0.00036781916,0.00088165415,0.004626662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766517,0.0007214252,0.00013160665,0.0005013425,0.0006744815,0.00030592605],"domain_scores_gemma":[0.99206394,0.0050622546,0.00046972337,0.0013866397,0.00075543846,0.0002619969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028596842,0.0016039464,0.0021242676,0.001263865,0.00088883593,0.002059908,0.0031951563,0.0021372156,0.0059658284],"category_scores_gemma":[0.015816217,0.0009743562,0.00076391955,0.0013321857,0.0019463791,0.0050896476,0.003176061,0.0024424698,0.0013568844],"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.0002813653,0.00020420238,0.0016452223,0.000096508695,0.00006009886,0.00012455147,0.000109385284,0.75742906,0.0011673723,0.021515515,0.004645112,0.21272153],"study_design_scores_gemma":[0.000027891672,0.000026405265,0.0000901515,0.000009728074,0.000009253434,0.000029469087,0.00001166285,0.98758113,0.00083889836,0.010466848,0.00090041134,0.000008180867],"about_ca_topic_score_codex":0.0073062563,"about_ca_topic_score_gemma":0.007442752,"teacher_disagreement_score":0.0073062563,"about_ca_system_score_codex":0.0017540766,"about_ca_system_score_gemma":0.0028689327,"threshold_uncertainty_score":0.019957662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15829211,0.00083953183,0.81761545,0.00057410257,0.00035113504,0.000107283435,0.00011303532,0.00024779598,0.021859435],"genre_scores_gemma":[0.6684378,0.0009392902,0.3125046,0.00018395986,0.0004031458,0.00012021337,0.00038062196,0.00034786467,0.016682591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990409,0.000245803,0.000078933146,0.00020279242,0.00031591303,0.00011558522],"domain_scores_gemma":[0.9973239,0.0017785747,0.00013134688,0.0001947036,0.00038580227,0.00018563677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520971,0.0010330973,0.0019087847,0.0027585982,0.001294439,0.0023584925,0.0018112764,0.0012019514,0.006617214],"category_scores_gemma":[0.01061998,0.0007315738,0.001933268,0.0016330448,0.0024887635,0.006504411,0.0029239669,0.0030129876,0.0011329397],"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.00030429955,0.000108778804,0.0027317442,0.0004931729,0.000104744126,0.0006520427,0.0009365348,0.013116064,0.008622108,0.8618731,0.004016854,0.10704056],"study_design_scores_gemma":[0.000030136092,0.00006432503,0.00036315515,0.000038514074,0.000059422044,0.00030359928,0.00011758756,0.087145954,0.003564413,0.9055443,0.0027348795,0.00003377307],"about_ca_topic_score_codex":0.00068210426,"about_ca_topic_score_gemma":0.0007328968,"teacher_disagreement_score":0.006617214,"about_ca_system_score_codex":0.0005767137,"about_ca_system_score_gemma":0.00082258857,"threshold_uncertainty_score":0.022136807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03169796,0.00007945072,0.95474815,0.000148106,0.000052976793,0.00023775814,0.00006363244,0.0014073846,0.011564632],"genre_scores_gemma":[0.76538897,0.00016322098,0.22591357,0.000083358675,0.000009484287,0.0005884908,0.00013545554,0.00023462319,0.007482789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946755,0.00018343667,0.000024941068,0.000075813325,0.00019124978,0.000057029727],"domain_scores_gemma":[0.9993747,0.0002667063,0.00006887222,0.00008320516,0.0001609687,0.00004561171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096911466,0.0005457012,0.00033222997,0.0003671752,0.00042475422,0.0011985758,0.001221649,0.00076218817,0.0054412256],"category_scores_gemma":[0.0020466023,0.0004246182,0.0006007118,0.00015594726,0.0010596884,0.00077001355,0.00096640893,0.00076952646,0.00045025873],"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.0000809818,0.00009312756,0.0006160486,0.00013243846,0.000039037117,0.00014542497,0.00023569241,0.91037107,0.011378194,0.064631246,0.0005751543,0.011701624],"study_design_scores_gemma":[0.000019337154,0.00004192857,0.00007711197,0.000012376687,0.000012156159,0.000012731881,0.000013556159,0.9897854,0.002237431,0.0049196496,0.0028624914,0.000005853273],"about_ca_topic_score_codex":0.0048550093,"about_ca_topic_score_gemma":0.0046818955,"teacher_disagreement_score":0.0054412256,"about_ca_system_score_codex":0.0010594083,"about_ca_system_score_gemma":0.001196849,"threshold_uncertainty_score":0.018202662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016082508,0.00088419166,0.94515216,0.0009857472,0.00047461924,0.00018488383,0.00020056973,0.00864257,0.027392752],"genre_scores_gemma":[0.3691117,0.0013994392,0.5564126,0.0012088417,0.00033367288,0.00045705668,0.00076741213,0.0021528262,0.068156555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812835,0.00055240357,0.00010658591,0.00041328257,0.00065670715,0.00014269179],"domain_scores_gemma":[0.99838567,0.0006142486,0.000070220616,0.0004964131,0.0003594721,0.000074054165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016857289,0.0011557841,0.0008077672,0.0010871228,0.0011129259,0.0027627624,0.0020165711,0.0016004895,0.0120435795],"category_scores_gemma":[0.0063587334,0.00062289386,0.001523251,0.0006957425,0.0012792252,0.0030134204,0.002601398,0.0028417597,0.0040792325],"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.0006318181,0.0002718637,0.0019954247,0.00063629216,0.00028863995,0.00040944372,0.0013492999,0.083284535,0.010302843,0.19886962,0.029012978,0.67294717],"study_design_scores_gemma":[0.00028766037,0.00026341737,0.0012260933,0.00027398544,0.00028947767,0.0005706373,0.00057260145,0.5281674,0.009825834,0.2258959,0.23251736,0.0001096121],"about_ca_topic_score_codex":0.0043661054,"about_ca_topic_score_gemma":0.00682798,"teacher_disagreement_score":0.0120435795,"about_ca_system_score_codex":0.0009585392,"about_ca_system_score_gemma":0.0016341007,"threshold_uncertainty_score":0.04028976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27689844,0.0006772822,0.70702094,0.00059905165,0.000079659214,0.00017494259,0.00016445798,0.00096876774,0.013416566],"genre_scores_gemma":[0.90771234,0.00018291001,0.0896577,0.00008797445,0.000012830804,0.00018230833,0.000111144065,0.00006826998,0.0019845476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997316,0.00013745822,0.0000114776785,0.00003138459,0.000051638006,0.00003649767],"domain_scores_gemma":[0.99848723,0.0012117829,0.000086466,0.000046437413,0.00009108477,0.00007700236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009742095,0.0006273899,0.00086491683,0.00054263655,0.00039753906,0.00077659666,0.0007828227,0.0010081634,0.0019902145],"category_scores_gemma":[0.003849497,0.0004221196,0.00037492873,0.00057732,0.0008382581,0.0007717913,0.0008238504,0.0006826249,0.0002334713],"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.000030559215,0.000010832546,0.00024222667,0.000009712195,0.000006387175,0.000015866104,0.000013104106,0.99515694,0.00009251674,0.001608318,0.00012530065,0.0026881793],"study_design_scores_gemma":[0.0000051066113,0.0000068540444,0.000025292762,0.0000011453275,9.0767e-7,0.0000016653678,0.0000041075878,0.9991794,0.000045717887,0.00066254305,0.000066371176,8.8141604e-7],"about_ca_topic_score_codex":0.010939438,"about_ca_topic_score_gemma":0.008639117,"teacher_disagreement_score":0.010939438,"about_ca_system_score_codex":0.0009581261,"about_ca_system_score_gemma":0.0011232268,"threshold_uncertainty_score":0.021751523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19199434,0.00076006557,0.7913664,0.00067388,0.000112892354,0.00013908182,0.00005951636,0.0018849247,0.013008845],"genre_scores_gemma":[0.8873244,0.000115965544,0.108925216,0.00016822274,0.00007610691,0.000096834825,0.000092601214,0.0005798864,0.002620699],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99086964,0.0050167865,0.00043725048,0.0011782553,0.0019042382,0.0005938281],"domain_scores_gemma":[0.9794428,0.013671128,0.00085836544,0.002658116,0.0024972106,0.00087231764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010139539,0.0011423641,0.0020762645,0.0020482643,0.0009486538,0.0030638054,0.0019516421,0.0024904334,0.0029815629],"category_scores_gemma":[0.03959311,0.00066552823,0.0006807243,0.0012871596,0.0014821147,0.0029102874,0.002790291,0.002016715,0.0009557205],"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.0018199047,0.0005881493,0.009317809,0.00046137252,0.00034556855,0.00016559905,0.0005202139,0.31730956,0.031605054,0.117396645,0.007197059,0.5132732],"study_design_scores_gemma":[0.00011136805,0.00020391178,0.001379796,0.00005693149,0.000076224096,0.000090754686,0.000081378974,0.91873276,0.010987519,0.066826224,0.0014178724,0.000035259665],"about_ca_topic_score_codex":0.00055942056,"about_ca_topic_score_gemma":0.0006971031,"teacher_disagreement_score":0.010139539,"about_ca_system_score_codex":0.0014017285,"about_ca_system_score_gemma":0.0012560717,"threshold_uncertainty_score":0.053623676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528211,0.0001538622,0.22551578,0.00031530848,0.0000668274,0.000050186434,0.000031366897,0.0002543229,0.02079116],"genre_scores_gemma":[0.9895489,0.000022651891,0.005889142,0.00001849998,0.0000057802076,0.000013454557,0.000016047758,0.0000225275,0.0044628857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.00011730012,0.000011864519,0.00004165976,0.00006757515,0.00007527453],"domain_scores_gemma":[0.9985185,0.00091829477,0.000101275036,0.00016544879,0.00009239753,0.00020412302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007330627,0.00037630985,0.00084672385,0.00028702314,0.0006412342,0.00086263486,0.0009548854,0.0009915942,0.004941644],"category_scores_gemma":[0.004753449,0.00036021537,0.00029895236,0.00021784539,0.0010179752,0.0015597118,0.0016007052,0.0011934435,0.00036884414],"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.001437459,0.00054173527,0.0038418998,0.00016745788,0.00011980179,0.00082603894,0.0007012197,0.65805566,0.016043665,0.2392874,0.0027780114,0.07619958],"study_design_scores_gemma":[0.000033153672,0.00009888829,0.00070099626,0.0000050250515,0.00001023978,0.000101650025,0.000055762972,0.94651717,0.00089919963,0.051246963,0.00032017997,0.00001075629],"about_ca_topic_score_codex":0.00097139704,"about_ca_topic_score_gemma":0.0012137301,"teacher_disagreement_score":0.004941644,"about_ca_system_score_codex":0.0003931944,"about_ca_system_score_gemma":0.0005922136,"threshold_uncertainty_score":0.016531467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06999095,0.00008130093,0.8895759,0.00007963557,0.00009556633,0.0005021884,0.00079674274,0.02684601,0.012031788],"genre_scores_gemma":[0.3494213,0.00010880819,0.6289582,0.00007078245,0.000026552103,0.0005234357,0.0032355678,0.0031719,0.014483413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962366,0.00007957556,0.00002257524,0.00012071706,0.00011583975,0.000037702102],"domain_scores_gemma":[0.99915814,0.00040122663,0.000043119144,0.00015219161,0.00017695379,0.00006830359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049822737,0.0010346171,0.0004886334,0.000773745,0.00033716584,0.0008461444,0.0014063985,0.00047703172,0.011981972],"category_scores_gemma":[0.0026251713,0.00045107707,0.0006027371,0.00034875682,0.00028505066,0.00078243116,0.0014430006,0.00041820525,0.0034099082],"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.0009203455,0.0004736173,0.0062858462,0.0008349672,0.00010853792,0.0015382519,0.0018475102,0.019537657,0.18142587,0.027080199,0.024561478,0.73538566],"study_design_scores_gemma":[0.0002262595,0.00051630544,0.006016174,0.00009106131,0.000108132204,0.0011511568,0.00064544706,0.59637403,0.2773277,0.019682467,0.09775014,0.00011112868],"about_ca_topic_score_codex":0.00045619477,"about_ca_topic_score_gemma":0.000662531,"teacher_disagreement_score":0.011981972,"about_ca_system_score_codex":0.0002921879,"about_ca_system_score_gemma":0.00036103357,"threshold_uncertainty_score":0.040083647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7066869,0.00055506185,0.19239725,0.0009230269,0.00036415283,0.000098565026,0.00016143595,0.00035957978,0.098453976],"genre_scores_gemma":[0.9615307,0.00014434848,0.019133374,0.00010288747,0.0000541924,0.000059081103,0.00008718632,0.00008868499,0.018799648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.0001062175,0.000032255044,0.00009111642,0.00012367712,0.00010147618],"domain_scores_gemma":[0.99908996,0.00034149794,0.00016641787,0.00012001935,0.00009486202,0.00018736256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223348,0.0003937409,0.0010832244,0.0008083882,0.0019786204,0.0019019165,0.0010259363,0.0017826216,0.007553098],"category_scores_gemma":[0.0031802803,0.00054790004,0.00066672044,0.00043722062,0.0022244747,0.0025158918,0.0016908959,0.0015790495,0.0005609053],"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.000074231044,0.000020297373,0.00017828392,0.00002420111,0.000005201345,0.00009753002,0.00015226442,0.0043299575,0.00090137403,0.9894666,0.00052873476,0.004221359],"study_design_scores_gemma":[0.000055930665,0.000045862875,0.00029095655,0.000016395481,0.000005473811,0.00012942519,0.00012891201,0.05110864,0.00056810497,0.94513583,0.002490217,0.000024241213],"about_ca_topic_score_codex":0.0017193141,"about_ca_topic_score_gemma":0.0013731702,"teacher_disagreement_score":0.007553098,"about_ca_system_score_codex":0.0009422739,"about_ca_system_score_gemma":0.00057771255,"threshold_uncertainty_score":0.02526766},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23915519,0.0018156782,0.2727399,0.011903183,0.00056353747,0.00058357115,0.007434471,0.004152775,0.46165168],"genre_scores_gemma":[0.81743395,0.0009942288,0.06386336,0.0022996806,0.00027717534,0.0003962206,0.00711575,0.00053937203,0.10708024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.0001465604,0.000042381263,0.00015863604,0.00020524919,0.00018347132],"domain_scores_gemma":[0.997752,0.0014137102,0.00013965745,0.0002224126,0.00026685337,0.00020538164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212895,0.001211656,0.0012828136,0.00085055927,0.0017061408,0.0026170847,0.0014930606,0.0016570315,0.028306216],"category_scores_gemma":[0.0044137035,0.0005351785,0.0011543456,0.0012000808,0.0012966916,0.003835558,0.00219819,0.003653082,0.003843073],"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.0009992291,0.00043616036,0.001074479,0.0017739517,0.00020399783,0.0007644635,0.0006443948,0.051362813,0.0073951283,0.71454245,0.09621846,0.12458457],"study_design_scores_gemma":[0.00014956652,0.000053181637,0.00032868114,0.000055689197,0.000033720044,0.00025718834,0.00011614929,0.034259994,0.002524944,0.9447926,0.01740512,0.000023081482],"about_ca_topic_score_codex":0.0020912206,"about_ca_topic_score_gemma":0.0033017022,"teacher_disagreement_score":0.028306216,"about_ca_system_score_codex":0.0016469283,"about_ca_system_score_gemma":0.0013928136,"threshold_uncertainty_score":0.09469372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012332106,0.0008386595,0.99038786,0.00042357104,0.00020107105,0.000044677152,0.000038661237,0.00024129219,0.0065910276],"genre_scores_gemma":[0.08468119,0.0020544939,0.8908483,0.00054917956,0.00036091325,0.0004272757,0.00027873102,0.0006581014,0.020141724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845576,0.00059101696,0.000071762865,0.00017806866,0.0005898016,0.000113554604],"domain_scores_gemma":[0.9976683,0.0014466186,0.00007672723,0.00030224957,0.000376991,0.00012901788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002407244,0.0012224492,0.0019400213,0.0017572958,0.0012714263,0.0034724954,0.0024560986,0.0021244667,0.010163036],"category_scores_gemma":[0.012697714,0.0009132239,0.0012137648,0.0022944524,0.0028252741,0.004793786,0.0028631713,0.0062589226,0.003996894],"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.000100427926,0.000055531327,0.00015590686,0.00021191161,0.00005077708,0.000030264764,0.000084565014,0.037005067,0.00060966326,0.8191744,0.010231835,0.1322896],"study_design_scores_gemma":[0.000066014865,0.000043116266,0.000076129596,0.00006847186,0.000023904511,0.00005684144,0.000017897111,0.30827215,0.0007232874,0.6707212,0.019904945,0.000026025844],"about_ca_topic_score_codex":0.0023013724,"about_ca_topic_score_gemma":0.0016453257,"teacher_disagreement_score":0.010163036,"about_ca_system_score_codex":0.0014359253,"about_ca_system_score_gemma":0.0021885242,"threshold_uncertainty_score":0.033998728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025225798,0.00034969667,0.9664691,0.00021219018,0.00009119017,0.000059149985,0.00006926031,0.0019925337,0.005531043],"genre_scores_gemma":[0.33869994,0.00023257824,0.6566271,0.00018146625,0.00005823354,0.00019377886,0.00025857188,0.00031418042,0.0034341086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993917,0.00010864153,0.000041799885,0.00012358103,0.00024098901,0.00009327078],"domain_scores_gemma":[0.9986559,0.00051578094,0.00011647032,0.00024431615,0.00036370693,0.000103880804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260426,0.00057793304,0.0011162482,0.00096583547,0.0005674522,0.0011372658,0.0016661563,0.0009850303,0.0039253063],"category_scores_gemma":[0.003961333,0.00044660093,0.00061874406,0.0013935223,0.00043452712,0.0013291346,0.0010829741,0.00087147154,0.0008304137],"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.00041481972,0.00014944636,0.0016152897,0.00012154353,0.0000727999,0.00014416978,0.000093627525,0.66750187,0.0059462986,0.025893217,0.006108141,0.2919389],"study_design_scores_gemma":[0.00002211166,0.000015972033,0.00006717702,0.0000027508345,0.000004737317,0.00002372382,0.0000051892334,0.9950701,0.0007180225,0.0031792244,0.0008875011,0.0000035365028],"about_ca_topic_score_codex":0.012366744,"about_ca_topic_score_gemma":0.009721923,"teacher_disagreement_score":0.012366744,"about_ca_system_score_codex":0.00072667556,"about_ca_system_score_gemma":0.0016994576,"threshold_uncertainty_score":0.024589539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029779853,0.00013189644,0.93882835,0.00065637846,0.000050386985,0.00016756,0.00004679411,0.00039993704,0.029938905],"genre_scores_gemma":[0.62841445,0.00015095145,0.36546558,0.00013839026,0.000022149348,0.000370858,0.00009055002,0.00011827814,0.0052287765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905664,0.0005037741,0.000040793857,0.00014507989,0.00017635495,0.00007722488],"domain_scores_gemma":[0.99909353,0.00039995054,0.00008735023,0.00014416473,0.00013013258,0.00014493891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783179,0.000535791,0.00028061413,0.00046921708,0.0013212148,0.0017233742,0.0009834948,0.00080782955,0.0032187246],"category_scores_gemma":[0.002521435,0.00025971775,0.00059957925,0.00014454337,0.0042561893,0.0022629942,0.002453224,0.001258788,0.00035730004],"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.000025215644,0.000044646484,0.0008821393,0.00008540412,0.000009415714,0.0003074957,0.0037344417,0.014790462,0.0035395783,0.9651077,0.0007124245,0.010761004],"study_design_scores_gemma":[0.00005710167,0.00017356707,0.0015876552,0.0001443362,0.000028609478,0.00065416377,0.0030630303,0.21948406,0.0028711993,0.7098549,0.062012527,0.000068939866],"about_ca_topic_score_codex":0.002313391,"about_ca_topic_score_gemma":0.0033979428,"teacher_disagreement_score":0.0032187246,"about_ca_system_score_codex":0.0012067,"about_ca_system_score_gemma":0.0014475245,"threshold_uncertainty_score":0.010767639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2864601,0.0006244033,0.35746685,0.003939159,0.0003555465,0.00065914326,0.0033861662,0.0016529222,0.3454557],"genre_scores_gemma":[0.83087087,0.00061388995,0.05552257,0.000962333,0.00016491076,0.00044880479,0.0031970358,0.00045561165,0.10776393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990588,0.00022267671,0.00003803248,0.0002668372,0.00020460211,0.00020915829],"domain_scores_gemma":[0.9966001,0.0012581489,0.00040055564,0.00061319245,0.00047376432,0.0006541708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005862036,0.0009545844,0.0010545719,0.0015758519,0.0032192722,0.003195518,0.0018542318,0.0019894436,0.037994638],"category_scores_gemma":[0.0051490404,0.0006821654,0.0008776735,0.0019055624,0.0014475039,0.0055817408,0.0020146153,0.0027674737,0.0051428233],"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.00015374873,0.000104195926,0.00057240255,0.00010758921,0.000041890784,0.000221269,0.00021096891,0.004468527,0.0013099108,0.953586,0.015144221,0.024079336],"study_design_scores_gemma":[0.00003868709,0.000020879395,0.0002450008,0.000014895173,0.000025858777,0.00014772458,0.00013221492,0.009682774,0.0005443141,0.98047316,0.008664395,0.000010043471],"about_ca_topic_score_codex":0.0011864128,"about_ca_topic_score_gemma":0.0023723622,"teacher_disagreement_score":0.037994638,"about_ca_system_score_codex":0.0009919036,"about_ca_system_score_gemma":0.0013132859,"threshold_uncertainty_score":0.12710476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037155673,0.009828598,0.47676313,0.0075744637,0.0014596387,0.00024555225,0.0024804487,0.0010934838,0.46339908],"genre_scores_gemma":[0.72819036,0.0053700833,0.15240352,0.0014197754,0.001857955,0.0006408126,0.0032582122,0.00051961886,0.10633967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975431,0.0010096516,0.00017933645,0.00044580683,0.0005822588,0.00023998256],"domain_scores_gemma":[0.99690753,0.0015705533,0.00020292233,0.00041895104,0.00047712703,0.00042286073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014051434,0.0013606864,0.0018847039,0.0033240546,0.003512862,0.009668952,0.0014446512,0.0015535916,0.01743621],"category_scores_gemma":[0.00502601,0.0012126161,0.0015373015,0.003159136,0.0069704535,0.01085858,0.003023649,0.004420663,0.0031640518],"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.000005289204,0.000004356257,0.000022249893,0.000012471849,0.0000023068246,0.000006439432,0.00007257743,0.00022448783,0.000028506776,0.9976259,0.0008498337,0.0011455902],"study_design_scores_gemma":[0.000007941037,0.000002817449,0.000019501604,0.000008587603,0.0000023477107,0.0000135182245,0.000042479922,0.00077111984,0.000038046815,0.9906114,0.008478381,0.000003884255],"about_ca_topic_score_codex":0.0036916968,"about_ca_topic_score_gemma":0.0034223183,"teacher_disagreement_score":0.01743621,"about_ca_system_score_codex":0.003115404,"about_ca_system_score_gemma":0.0017719041,"threshold_uncertainty_score":0.05832994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0663399,0.00023874277,0.9161855,0.000193754,0.00008482142,0.00025572136,0.000104347244,0.0020312595,0.014565982],"genre_scores_gemma":[0.56734866,0.00012354602,0.42434743,0.00019060916,0.000017468108,0.00028542528,0.00014232217,0.00017638617,0.0073681613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921405,0.00022622239,0.0000737947,0.00009468571,0.00025043092,0.00014076264],"domain_scores_gemma":[0.9993525,0.00019065944,0.00007355246,0.00010247699,0.000214713,0.000066183115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224301,0.0008363772,0.000352507,0.00088879315,0.00050431094,0.00090344506,0.0014408798,0.0006501262,0.006109569],"category_scores_gemma":[0.0013519871,0.00027571278,0.00046240917,0.00035668252,0.0005499599,0.000982313,0.0009546248,0.00069000403,0.001082307],"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.0012037888,0.00050280686,0.0031477846,0.0005922002,0.00019967933,0.00057007227,0.00062459544,0.324569,0.0931721,0.19247934,0.008086584,0.37485203],"study_design_scores_gemma":[0.00014164452,0.00073979615,0.00052020594,0.000042805077,0.00008509583,0.00028569569,0.00007289204,0.92761385,0.026072342,0.027909286,0.016450683,0.00006564606],"about_ca_topic_score_codex":0.0018924547,"about_ca_topic_score_gemma":0.0035152312,"teacher_disagreement_score":0.006109569,"about_ca_system_score_codex":0.00082652224,"about_ca_system_score_gemma":0.0010863552,"threshold_uncertainty_score":0.020438552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11758891,0.00085284543,0.86405814,0.00082036236,0.00009262115,0.00021937743,0.00010439578,0.00032254987,0.015940791],"genre_scores_gemma":[0.7749073,0.0003624004,0.2173278,0.00017127489,0.00006101179,0.00014071932,0.00015201882,0.000096500844,0.0067809923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978642,0.0010737353,0.00009565563,0.00020659211,0.0004831703,0.00027672885],"domain_scores_gemma":[0.9897803,0.0076613645,0.00049696484,0.00071691914,0.00095746276,0.00038688793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004287644,0.00061904726,0.0014178143,0.0014486746,0.0011260653,0.0019953032,0.0022477796,0.0015324958,0.004093435],"category_scores_gemma":[0.023716297,0.00046476364,0.0006169501,0.001116177,0.0011101586,0.0029107344,0.0020606685,0.0017785624,0.0003719775],"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.00033020056,0.00031952505,0.0053016366,0.00020346764,0.00012573299,0.00019445267,0.00054687756,0.4801265,0.0015725866,0.32269022,0.0057204654,0.18286836],"study_design_scores_gemma":[0.000031772834,0.00005729598,0.000497615,0.000032998403,0.000044803804,0.00007307316,0.000060143324,0.8496239,0.00044531326,0.14744128,0.0016807646,0.000011082868],"about_ca_topic_score_codex":0.0046098456,"about_ca_topic_score_gemma":0.0070677497,"teacher_disagreement_score":0.0046098456,"about_ca_system_score_codex":0.0012750797,"about_ca_system_score_gemma":0.0017640793,"threshold_uncertainty_score":0.022675514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035255622,0.00015486575,0.95637697,0.0002546804,0.00004156108,0.0005687031,0.000096207674,0.004160443,0.0030909502],"genre_scores_gemma":[0.17469272,0.000271588,0.8200541,0.00019938557,0.000017965744,0.0008287149,0.0002998863,0.0008440274,0.0027915211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673945,0.00085194624,0.00056265225,0.00038289884,0.0012571919,0.00020586175],"domain_scores_gemma":[0.994093,0.0021180674,0.001054045,0.0014087978,0.0010727601,0.000253382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003291523,0.0012991955,0.00041270076,0.001258447,0.00044435266,0.0013999889,0.0014723871,0.001020389,0.0013839903],"category_scores_gemma":[0.010911139,0.0009608709,0.0007794778,0.0006038472,0.0009115448,0.002307077,0.0015687676,0.0014676404,0.00046323967],"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.0006962787,0.0012780366,0.015349807,0.00220545,0.00033742114,0.0016719616,0.004129989,0.037581805,0.1532974,0.0787682,0.008579182,0.6961045],"study_design_scores_gemma":[0.0009991609,0.002962009,0.011492381,0.0010422166,0.00071662606,0.008345473,0.0011354453,0.33617446,0.2630035,0.11141324,0.2623354,0.00038012638],"about_ca_topic_score_codex":0.0008720168,"about_ca_topic_score_gemma":0.0015260479,"teacher_disagreement_score":0.003291523,"about_ca_system_score_codex":0.0004781263,"about_ca_system_score_gemma":0.0012110774,"threshold_uncertainty_score":0.017407417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9072776,0.00014444346,0.06767745,0.0002703443,0.000015780017,0.00009293351,0.000019127392,0.000038342972,0.024463935],"genre_scores_gemma":[0.9774989,0.000058257276,0.02008281,0.000029618135,0.0000036204012,0.000059148235,0.00002216346,0.000007973666,0.0022375104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861705,0.00081938086,0.000060496837,0.00018367234,0.00018122615,0.00013819657],"domain_scores_gemma":[0.99684876,0.0019540277,0.00044165357,0.00019568506,0.00019046765,0.00036930406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015419591,0.0005150828,0.00036289246,0.0006552691,0.00085606624,0.0030168407,0.000777788,0.0005930416,0.0019636538],"category_scores_gemma":[0.006681509,0.00020199417,0.00046856474,0.0004287296,0.0027899754,0.0016611867,0.0017702896,0.0007859142,0.00013670094],"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.0008469024,0.0005100305,0.037106615,0.00023414227,0.00015296858,0.0011301814,0.007543814,0.20026243,0.021473316,0.64551765,0.00060119265,0.0846208],"study_design_scores_gemma":[0.00030070485,0.0013328976,0.017796298,0.00006660351,0.00010207869,0.0011323509,0.0052059637,0.5845609,0.009460241,0.36518794,0.014686949,0.00016714414],"about_ca_topic_score_codex":0.0015021996,"about_ca_topic_score_gemma":0.0014125004,"teacher_disagreement_score":0.0030168407,"about_ca_system_score_codex":0.0011022856,"about_ca_system_score_gemma":0.00074065843,"threshold_uncertainty_score":0.00815475},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14081931,0.0006767826,0.2180917,0.0030942005,0.0015729418,0.00019354156,0.00082169945,0.00087913946,0.63385063],"genre_scores_gemma":[0.7935754,0.00068369927,0.033234615,0.0009855143,0.0006845383,0.00033917025,0.0008628126,0.00077237503,0.1688619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797446,0.00046128436,0.00014518916,0.0003932301,0.00049305434,0.0005328794],"domain_scores_gemma":[0.99876547,0.00031494617,0.00011073833,0.0001919403,0.00038506862,0.00023190584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118286,0.0010401708,0.0010150423,0.0028150934,0.0032062314,0.0069883447,0.0015199186,0.0016489727,0.035091743],"category_scores_gemma":[0.0031425117,0.0008138252,0.0011649772,0.0020762468,0.003601816,0.008547417,0.004076357,0.0036810162,0.0062332875],"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.000011766662,0.000008517253,0.000028116681,0.000007690002,0.0000023513828,0.000030584266,0.00009668516,0.000041632262,0.00010028492,0.99643916,0.0009840805,0.0022491415],"study_design_scores_gemma":[0.0000122083,0.0000071340482,0.000051385825,0.000008399874,0.000005668838,0.00010441013,0.00012172534,0.00060634874,0.00028619717,0.9911267,0.0076601333,0.000009710228],"about_ca_topic_score_codex":0.0005208282,"about_ca_topic_score_gemma":0.0006884312,"teacher_disagreement_score":0.035091743,"about_ca_system_score_codex":0.0011839494,"about_ca_system_score_gemma":0.00073799555,"threshold_uncertainty_score":0.11739355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009146342,0.0003710829,0.98346245,0.00010608096,0.000067867724,0.00012001235,0.00013356934,0.0025648284,0.004027767],"genre_scores_gemma":[0.052397974,0.00023941383,0.94441336,0.000082639606,0.00002690489,0.00025917214,0.0003202225,0.00031985118,0.0019404454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986425,0.0005574682,0.00017027475,0.00019998511,0.00029710805,0.00013267894],"domain_scores_gemma":[0.99612063,0.002254744,0.00036551492,0.0006880602,0.00042205976,0.0001490145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011659325,0.0011469268,0.0010788856,0.001796315,0.0016843028,0.0019653637,0.0022935322,0.0015056237,0.006605504],"category_scores_gemma":[0.0065587107,0.00080968917,0.0013352401,0.0030328066,0.00080784765,0.0027728174,0.002178215,0.0016977328,0.002995126],"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.00059321645,0.00038759474,0.0010480968,0.00050295505,0.00013563206,0.0003020687,0.00046018485,0.22132868,0.011911305,0.123671204,0.01847984,0.6211792],"study_design_scores_gemma":[0.00016106918,0.00021392603,0.00032405226,0.00007032076,0.000061580904,0.00028186146,0.00018279592,0.83472955,0.0076249125,0.13455565,0.021729756,0.00006449366],"about_ca_topic_score_codex":0.0034699289,"about_ca_topic_score_gemma":0.005653118,"teacher_disagreement_score":0.006605504,"about_ca_system_score_codex":0.0010639769,"about_ca_system_score_gemma":0.0019192693,"threshold_uncertainty_score":0.022097647},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2017714,0.002478415,0.16499442,0.007290224,0.0006486178,0.000089793015,0.00059218507,0.00020414656,0.6219307],"genre_scores_gemma":[0.85674065,0.0023505883,0.026983649,0.0012750796,0.00080805295,0.00017373741,0.0007156018,0.00019311014,0.11075952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.000103962935,0.000013917065,0.000044319502,0.00018483303,0.00007882223],"domain_scores_gemma":[0.9992532,0.00028338114,0.00006209511,0.00003776574,0.00017879136,0.00018477881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068150775,0.0006608889,0.0009109874,0.00165168,0.0024958195,0.0026900994,0.0008530664,0.0011122507,0.008853906],"category_scores_gemma":[0.0022787894,0.00033270894,0.0005112986,0.001141893,0.0023000347,0.0028666542,0.0015180403,0.0033087549,0.0011268406],"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.000016134876,0.000007849829,0.00003749808,0.000010971259,0.0000015483935,0.000020601798,0.0000403466,0.0004998411,0.00014636146,0.9963935,0.0013357766,0.0014896381],"study_design_scores_gemma":[0.0000101299365,0.0000048048755,0.00007960703,0.000010516635,0.000001107492,0.000023189823,0.000027399885,0.005149536,0.00005378504,0.99247426,0.0021617438,0.0000038552485],"about_ca_topic_score_codex":0.0045405757,"about_ca_topic_score_gemma":0.0033306691,"teacher_disagreement_score":0.008853906,"about_ca_system_score_codex":0.0015712162,"about_ca_system_score_gemma":0.0009891593,"threshold_uncertainty_score":0.029619277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02143353,0.00019886387,0.9124541,0.0004143742,0.0009876683,0.00017726209,0.0011844207,0.014164558,0.04898512],"genre_scores_gemma":[0.3370917,0.00034948232,0.6299277,0.00017883923,0.0001646523,0.00028273804,0.0020459231,0.004436833,0.025522111],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991196,0.00026004904,0.00005641564,0.00013211287,0.0003424555,0.00008943569],"domain_scores_gemma":[0.99553263,0.0011871154,0.00015569518,0.001670782,0.0012514187,0.00020225787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009888828,0.0006985322,0.00043351186,0.0014309998,0.0008113482,0.0026566477,0.0017484798,0.0007246938,0.048269663],"category_scores_gemma":[0.013974898,0.0005040404,0.00044682834,0.001933255,0.000885022,0.0024021138,0.0024118102,0.0011089932,0.007821819],"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.0004921804,0.00016862717,0.0014745204,0.00032548653,0.000033445143,0.00021325072,0.0011562931,0.028886145,0.01264879,0.22438528,0.070046864,0.6601691],"study_design_scores_gemma":[0.00019450531,0.00020446694,0.0021978002,0.00015579684,0.00007583853,0.00048464022,0.0008621311,0.4416828,0.032325253,0.19525184,0.32637906,0.00018584669],"about_ca_topic_score_codex":0.001948634,"about_ca_topic_score_gemma":0.002582632,"teacher_disagreement_score":0.048269663,"about_ca_system_score_codex":0.00048064895,"about_ca_system_score_gemma":0.0007771505,"threshold_uncertainty_score":0.1614781},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029401613,0.007681521,0.12003891,0.011167927,0.0019107875,0.00003567275,0.00049261766,0.00040000214,0.8288709],"genre_scores_gemma":[0.6667833,0.006200305,0.03445111,0.004000909,0.0017601681,0.000110069916,0.0005900623,0.00038146184,0.28572264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957854,0.00015250924,0.000022240567,0.00009988674,0.000097013464,0.000049819286],"domain_scores_gemma":[0.99940336,0.0002909063,0.00004055861,0.00012091349,0.00007666491,0.00006772846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003813339,0.00043151097,0.0006402456,0.00095624337,0.001642048,0.0042322404,0.00050255726,0.00071103213,0.031193782],"category_scores_gemma":[0.001417105,0.00026494192,0.0004330831,0.0013440421,0.0046334923,0.006036288,0.0017590574,0.0029255298,0.0043149563],"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.000004772442,0.000002493143,0.000026766367,0.000012718504,0.000001262483,0.000007210448,0.00004767363,0.00008137487,0.000031542426,0.9945957,0.0017458824,0.0034426071],"study_design_scores_gemma":[0.0000033232925,0.0000023966816,0.000036953235,0.000008968272,0.0000014647003,0.000025574309,0.000060737446,0.00023499448,0.00006503748,0.9760482,0.023510214,0.0000021269032],"about_ca_topic_score_codex":0.0010517556,"about_ca_topic_score_gemma":0.00087839476,"teacher_disagreement_score":0.031193782,"about_ca_system_score_codex":0.0014231299,"about_ca_system_score_gemma":0.0005973411,"threshold_uncertainty_score":0.10435361},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29779017,0.00081507175,0.63426584,0.0033631802,0.000064225285,0.00030498224,0.00057034666,0.0005084329,0.06231779],"genre_scores_gemma":[0.8918792,0.00047646626,0.10024349,0.00031075624,0.000043836713,0.00031528302,0.00029501968,0.000041604744,0.006394451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.00018100752,0.000015386267,0.00013496439,0.00009772821,0.00005152125],"domain_scores_gemma":[0.9988243,0.0007207456,0.00014334482,0.00012452256,0.0001018059,0.000085268715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000805978,0.00068902853,0.0004566142,0.0013904261,0.0005316548,0.0017870391,0.0011849423,0.0012163278,0.0057528936],"category_scores_gemma":[0.0031430225,0.00040661052,0.0010549633,0.00091843813,0.0022331262,0.0033238255,0.00058617006,0.00091032224,0.0008131182],"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.00008420263,0.0001531793,0.0024126945,0.00012834312,0.000066131375,0.00019815918,0.00086229824,0.18363707,0.0038121217,0.794299,0.0014994082,0.012847319],"study_design_scores_gemma":[0.00003283071,0.000098006545,0.0018989039,0.000016295837,0.000020688381,0.000121911224,0.0001528927,0.35775912,0.00025030642,0.63769466,0.0019329163,0.000021431428],"about_ca_topic_score_codex":0.008488429,"about_ca_topic_score_gemma":0.0075311214,"teacher_disagreement_score":0.008488429,"about_ca_system_score_codex":0.0016729333,"about_ca_system_score_gemma":0.0009977135,"threshold_uncertainty_score":0.019245327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21054298,0.00042136144,0.64741373,0.0016821049,0.0002735888,0.00039943188,0.00047105126,0.0016913664,0.1371044],"genre_scores_gemma":[0.81531954,0.00017147187,0.16100813,0.0007295976,0.000048394235,0.0003430098,0.00028618914,0.0003490165,0.021744682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979266,0.00085935,0.000116489406,0.00036790888,0.0004085006,0.0003212014],"domain_scores_gemma":[0.9962219,0.0021750084,0.00033441454,0.00052673,0.0003583101,0.00038361116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019017082,0.0009083889,0.000978895,0.00080556533,0.0014163427,0.0027621947,0.0014683862,0.0014643484,0.02674276],"category_scores_gemma":[0.010613019,0.00056741084,0.0008314747,0.0006779643,0.0021089853,0.0056695635,0.0046340576,0.0024726174,0.0020393585],"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.0003297802,0.00014579044,0.0010001676,0.00019944034,0.000051392064,0.000296502,0.0004607346,0.08111911,0.0023598543,0.8668713,0.005302866,0.04186302],"study_design_scores_gemma":[0.00015259834,0.00017724793,0.00024380958,0.00007477309,0.000033943663,0.00019046672,0.0002319301,0.26437193,0.0024659852,0.71757466,0.014453234,0.000029358398],"about_ca_topic_score_codex":0.001273386,"about_ca_topic_score_gemma":0.0018538771,"teacher_disagreement_score":0.02674276,"about_ca_system_score_codex":0.0009821632,"about_ca_system_score_gemma":0.0013097322,"threshold_uncertainty_score":0.08946341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019027337,0.00033222197,0.96732026,0.00019280288,0.00009824613,0.00029509433,0.000028207132,0.0022492732,0.010456472],"genre_scores_gemma":[0.17266719,0.00031591344,0.8187404,0.0001745342,0.000042580326,0.00041788915,0.00010075307,0.00023285422,0.007307977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987269,0.00045966276,0.000085745574,0.0002717123,0.0003442078,0.000111843765],"domain_scores_gemma":[0.9987154,0.00052530685,0.000111361616,0.0002810478,0.00015622021,0.00021071141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171887,0.0014873098,0.0005849902,0.0009137879,0.00061465474,0.0021395253,0.002375028,0.0010327843,0.0056904755],"category_scores_gemma":[0.004202697,0.0005250463,0.0008209723,0.00040571394,0.0017721951,0.0028448638,0.004624094,0.0012877377,0.0013545391],"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.0008796703,0.00090495456,0.005735236,0.0011012733,0.00027170742,0.0012906201,0.008785503,0.037210107,0.086687066,0.14472632,0.009390271,0.7030173],"study_design_scores_gemma":[0.0006915151,0.0033854705,0.0043956023,0.00056877517,0.00047650398,0.004394506,0.0031182915,0.48491603,0.06967891,0.11706299,0.31090468,0.00040676293],"about_ca_topic_score_codex":0.0015420091,"about_ca_topic_score_gemma":0.0014189753,"teacher_disagreement_score":0.0056904755,"about_ca_system_score_codex":0.00046755193,"about_ca_system_score_gemma":0.000765281,"threshold_uncertainty_score":0.019036591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43283743,0.0011445389,0.43618128,0.0016392525,0.00043298476,0.00015148988,0.00072091934,0.0008075581,0.12608449],"genre_scores_gemma":[0.88608414,0.00068968884,0.058105294,0.000238805,0.00018142757,0.000104200495,0.0005362527,0.00032697446,0.05373313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00009434844,0.000016720103,0.00010132116,0.00010878895,0.00009566218],"domain_scores_gemma":[0.9982395,0.0009296742,0.00018917455,0.00021211168,0.00016403967,0.00026550854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039677354,0.00074627355,0.0010427431,0.0012443052,0.0018073759,0.002074552,0.0017207076,0.0014919875,0.014496963],"category_scores_gemma":[0.00441151,0.0004853096,0.0007145583,0.0009864504,0.0016938767,0.0043347194,0.0019864663,0.0017039704,0.0009752988],"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.00023634202,0.000032866632,0.00024868693,0.000112413785,0.000021650425,0.00016672519,0.00023781188,0.03180354,0.0014013116,0.9434882,0.005404671,0.01684582],"study_design_scores_gemma":[0.000033491295,0.00003864571,0.00020830659,0.000017910364,0.00001152187,0.00009413554,0.000114876115,0.06936589,0.00045586162,0.9257392,0.0039059424,0.000014225834],"about_ca_topic_score_codex":0.004203635,"about_ca_topic_score_gemma":0.0037207115,"teacher_disagreement_score":0.014496963,"about_ca_system_score_codex":0.00091668917,"about_ca_system_score_gemma":0.00067431584,"threshold_uncertainty_score":0.04849714},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13038732,0.001967562,0.1251921,0.003820777,0.0011673433,0.00011897593,0.00035830616,0.0002986195,0.7366891],"genre_scores_gemma":[0.9020352,0.0007330609,0.034825772,0.0009247944,0.000509105,0.0002814979,0.00020581101,0.0001649177,0.060319874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855787,0.0004438404,0.00008465214,0.00017278228,0.00041568358,0.0003252459],"domain_scores_gemma":[0.9986639,0.0006327382,0.00006772444,0.00018498728,0.00026286152,0.00018780027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015721403,0.00075828156,0.0011534666,0.003145773,0.005219507,0.0052919034,0.0014026773,0.0026397451,0.014215542],"category_scores_gemma":[0.004843267,0.00063352677,0.0010514315,0.0018868148,0.0053864066,0.0048626917,0.002705694,0.0033885366,0.0021175214],"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.000008079342,0.0000030666013,0.00001250921,0.0000041810235,0.0000014696382,0.00000865008,0.000041096268,0.000090229914,0.000047504855,0.99835914,0.00037678122,0.0010471751],"study_design_scores_gemma":[0.00000544176,0.0000031135528,0.000032698616,0.000004190039,0.0000016093578,0.00001528421,0.000021551621,0.00037547539,0.00006257258,0.9979352,0.0015378942,0.0000050853946],"about_ca_topic_score_codex":0.0016924767,"about_ca_topic_score_gemma":0.0020107431,"teacher_disagreement_score":0.014215542,"about_ca_system_score_codex":0.0023915921,"about_ca_system_score_gemma":0.0015129268,"threshold_uncertainty_score":0.047555685},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00773404,0.0007058258,0.010906369,0.0039572534,0.0052750777,0.0015675806,0.49169934,0.0025373744,0.47561717],"genre_scores_gemma":[0.05522075,0.0008446536,0.0125572,0.0007154358,0.0010793274,0.0017522121,0.31726217,0.0012362013,0.6093321],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852836,0.00022201706,0.000117449315,0.00016041083,0.000760974,0.00021075916],"domain_scores_gemma":[0.9864861,0.0034848293,0.0005015881,0.0013522612,0.007115322,0.0010599574],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015471389,0.000740295,0.0007023782,0.0026392832,0.0011251126,0.0016563328,0.0014025646,0.00073202886,0.48549467],"category_scores_gemma":[0.016213888,0.00033839032,0.00039237642,0.0043504625,0.0001836735,0.001250023,0.0009959845,0.0010598802,0.22257474],"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.00012437189,0.000082722734,0.00058087707,0.000085275824,0.000007585055,0.000022514772,0.000030566844,0.00025348354,0.00011959621,0.0032411984,0.9652105,0.030241344],"study_design_scores_gemma":[0.00009462357,0.00013738255,0.007838235,0.00006364205,0.000012824081,0.000069332804,0.00012769144,0.00039623384,0.00065834797,0.005994801,0.984582,0.000024821276],"about_ca_topic_score_codex":0.012600844,"about_ca_topic_score_gemma":0.018327901,"teacher_disagreement_score":0.48549467,"about_ca_system_score_codex":0.0013090644,"about_ca_system_score_gemma":0.002062453,"threshold_uncertainty_score":0.7338794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6571842,0.0002995806,0.3310833,0.00033033016,0.00008524763,0.00020168853,0.00005911997,0.00035024266,0.010406342],"genre_scores_gemma":[0.9789283,0.00003142341,0.020047873,0.000011640629,0.000006136901,0.000030409938,0.000033069322,0.000006843551,0.000904269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989882,0.0004975538,0.000069377216,0.000085884974,0.0002514221,0.00010748797],"domain_scores_gemma":[0.9981146,0.00082883815,0.00025547584,0.000092097696,0.0005554427,0.00015356108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024603198,0.00044775187,0.00048025462,0.00062406156,0.00048673025,0.0010152217,0.00037130737,0.0004148912,0.0014832048],"category_scores_gemma":[0.0076527186,0.00014949703,0.00043376235,0.00020484041,0.00032827054,0.0007748492,0.0006426751,0.00033809463,0.00020446557],"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.0052829576,0.0005935306,0.07878077,0.00035550742,0.00039708993,0.0007722297,0.0014070328,0.5362183,0.026114205,0.032661885,0.0027924823,0.31462398],"study_design_scores_gemma":[0.000033534543,0.00019000587,0.005684992,0.000013031622,0.00003958475,0.00005347466,0.000117406926,0.98859966,0.0026420767,0.0022058985,0.00039946366,0.000020957019],"about_ca_topic_score_codex":0.0037291916,"about_ca_topic_score_gemma":0.0023574785,"teacher_disagreement_score":0.0037291916,"about_ca_system_score_codex":0.0013366911,"about_ca_system_score_gemma":0.00043125046,"threshold_uncertainty_score":0.013011575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041948903,0.006924662,0.8814975,0.014506729,0.00068691716,0.00020245311,0.00048278976,0.0009929669,0.0527571],"genre_scores_gemma":[0.5296608,0.004632204,0.43444452,0.0031776417,0.0009884919,0.00075559504,0.00082661014,0.0010462853,0.024467815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972167,0.0017561383,0.000087283224,0.0002817137,0.00042680977,0.00023141156],"domain_scores_gemma":[0.97844064,0.01828867,0.00043685117,0.0014696826,0.0006837918,0.00068040955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061543947,0.0007820641,0.0025387132,0.0012062725,0.0014332216,0.0030970252,0.0037764143,0.003695377,0.0107485],"category_scores_gemma":[0.036478598,0.0007528605,0.0013777995,0.0020931321,0.0031199106,0.0077628503,0.0041513443,0.004752321,0.0014909059],"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.00025095354,0.000146772,0.0007284053,0.0002618553,0.000085783955,0.000079037156,0.0002928137,0.1973463,0.00015737148,0.7275484,0.019720279,0.053382017],"study_design_scores_gemma":[0.000044311695,0.000025230593,0.00007662978,0.000041299416,0.000013401336,0.000027511713,0.000034839144,0.48941866,0.000056831566,0.50659156,0.00365857,0.000011085936],"about_ca_topic_score_codex":0.0063911816,"about_ca_topic_score_gemma":0.011109192,"teacher_disagreement_score":0.0107485,"about_ca_system_score_codex":0.0020869898,"about_ca_system_score_gemma":0.003706304,"threshold_uncertainty_score":0.035957336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33841768,0.00022815347,0.6186765,0.0007386908,0.000104225706,0.00034337948,0.00027470844,0.0002946833,0.040921975],"genre_scores_gemma":[0.89428186,0.00016361247,0.097576335,0.00010502921,0.000010659587,0.00022923255,0.00010900884,0.0000200872,0.0075041894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989355,0.0005508614,0.00006950468,0.00018277462,0.00018692101,0.00007434807],"domain_scores_gemma":[0.9975169,0.001694788,0.00022206435,0.000249523,0.00018561711,0.00013122542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094251457,0.00047845754,0.0006544767,0.00028749695,0.00058678805,0.0016410094,0.0010372329,0.0007844353,0.00225395],"category_scores_gemma":[0.003629316,0.00021036493,0.00041283589,0.00031603713,0.001554626,0.0015226405,0.0009229137,0.0008699019,0.00021164327],"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.000416804,0.00020642605,0.0023090737,0.00018618439,0.00009950878,0.00062962,0.00088545855,0.43668872,0.010820055,0.5072515,0.002279714,0.038226917],"study_design_scores_gemma":[0.000072305134,0.0002503499,0.00051417574,0.000021339569,0.00002705445,0.00032521074,0.00019355875,0.81087357,0.0035629063,0.17836116,0.0057548746,0.000043536413],"about_ca_topic_score_codex":0.0017125217,"about_ca_topic_score_gemma":0.0013216704,"teacher_disagreement_score":0.00225395,"about_ca_system_score_codex":0.000998557,"about_ca_system_score_gemma":0.0009151327,"threshold_uncertainty_score":0.007540226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043979634,0.000081012666,0.94836885,0.00016968089,0.000021548221,0.00018760731,0.00001765977,0.0004781117,0.0066958843],"genre_scores_gemma":[0.7511882,0.00010320152,0.24515425,0.00006842992,0.000011358562,0.00036608815,0.000052200274,0.00008812549,0.0029681984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917585,0.00031243407,0.000051154908,0.00012654468,0.00025690938,0.00007708987],"domain_scores_gemma":[0.99847585,0.00095749326,0.00015036973,0.00016624454,0.00019521073,0.00005489341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701688,0.0005349878,0.0002789733,0.00033714593,0.0005310658,0.0010252553,0.00093048636,0.00061956723,0.0023681037],"category_scores_gemma":[0.004834402,0.00034807477,0.00047949463,0.000104307386,0.0015856851,0.0010585508,0.0010829944,0.0008760322,0.00024682612],"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.0001788701,0.00023210302,0.00172884,0.00032048093,0.000061393584,0.0003029136,0.0008525879,0.41977063,0.03737521,0.41758662,0.0009775691,0.120612755],"study_design_scores_gemma":[0.000064835964,0.0001832109,0.0003278911,0.000036276742,0.000029198425,0.00006793209,0.00007075585,0.8784003,0.010753529,0.103079855,0.006971548,0.000014592136],"about_ca_topic_score_codex":0.0016369623,"about_ca_topic_score_gemma":0.002050848,"teacher_disagreement_score":0.0023681037,"about_ca_system_score_codex":0.00076111977,"about_ca_system_score_gemma":0.0010268008,"threshold_uncertainty_score":0.007922053},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018648821,0.0016455195,0.18951419,0.00582259,0.0051039984,0.0001568138,0.005963452,0.009252359,0.7806761],"genre_scores_gemma":[0.11040533,0.0037015376,0.17022523,0.003275233,0.003090763,0.00062855124,0.009277654,0.011167973,0.6882277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990663,0.0002372724,0.000059000013,0.00022836486,0.00032400625,0.00008508286],"domain_scores_gemma":[0.99870384,0.00047077893,0.00006333047,0.00024289047,0.00043151545,0.00008757443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086851505,0.0011494992,0.00068542437,0.0018435268,0.0021484657,0.0047414694,0.001332739,0.0013092097,0.21690868],"category_scores_gemma":[0.004958611,0.0006180415,0.00082666206,0.0016750277,0.0015933022,0.006078067,0.0019073143,0.0035390109,0.12989077],"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.000079780504,0.000014635106,0.00011313389,0.00010222705,0.0000055970972,0.00010133947,0.00031756988,0.00027052843,0.00060765306,0.66242766,0.29661244,0.039347496],"study_design_scores_gemma":[0.0000100820425,0.0000064206733,0.000061029525,0.000027048933,0.0000023260902,0.000082044906,0.00003815173,0.0005886816,0.00059323,0.049838047,0.94874364,0.000009309073],"about_ca_topic_score_codex":0.007858981,"about_ca_topic_score_gemma":0.007662741,"teacher_disagreement_score":0.21690868,"about_ca_system_score_codex":0.0021875654,"about_ca_system_score_gemma":0.0013832537,"threshold_uncertainty_score":0.72563183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004004066,0.00011653885,0.9927012,0.00018422875,0.00004239763,0.00007484829,0.000007258978,0.00014904296,0.0027204042],"genre_scores_gemma":[0.61212295,0.0003212725,0.38087258,0.0002679235,0.00006753738,0.0007785019,0.00003413904,0.000048448677,0.0054865996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987024,0.00034036583,0.00010231114,0.00032290778,0.0004153213,0.00011673317],"domain_scores_gemma":[0.99901855,0.00032449636,0.00014568758,0.00013460529,0.00029619617,0.00008052748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021884597,0.00059996056,0.00053770776,0.0005884203,0.00047850495,0.0012676881,0.0021426291,0.0012651875,0.0023143357],"category_scores_gemma":[0.0035199497,0.0003398682,0.0008581255,0.00034507172,0.0015478205,0.0014414507,0.0011006068,0.0015208075,0.00036350708],"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.000119602206,0.00019345859,0.00095629034,0.00031716385,0.00018841708,0.00031787457,0.0005133532,0.32370523,0.017911367,0.54699016,0.0017278644,0.10705926],"study_design_scores_gemma":[0.0000819899,0.00015775114,0.00027757435,0.000031908803,0.000060866994,0.00013615831,0.00003326561,0.87188625,0.0058334707,0.113473974,0.0079906285,0.00003608486],"about_ca_topic_score_codex":0.0017798701,"about_ca_topic_score_gemma":0.00094040926,"teacher_disagreement_score":0.0023143357,"about_ca_system_score_codex":0.0012643719,"about_ca_system_score_gemma":0.0016139515,"threshold_uncertainty_score":0.0115737915},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08571437,0.0005020921,0.33163658,0.007782146,0.00091960246,0.0006372325,0.0027551595,0.0023356793,0.56771713],"genre_scores_gemma":[0.6601476,0.0006951562,0.11524563,0.0013470721,0.00017661156,0.00055964926,0.0031742656,0.0011536406,0.21750033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982912,0.00033917496,0.00011274326,0.00035959747,0.000360482,0.0005368805],"domain_scores_gemma":[0.9987569,0.0005045539,0.000049019865,0.00011905951,0.00025001957,0.00032038306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189003,0.0016716078,0.0011655428,0.0013119477,0.0034987675,0.0051380266,0.0019973589,0.003920097,0.04776679],"category_scores_gemma":[0.0034822063,0.0006126121,0.0017125754,0.00083265646,0.0019509809,0.0047522425,0.0039662994,0.0023295747,0.011625003],"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.0003373506,0.00014790091,0.00060093385,0.00028739535,0.000113051756,0.00048341264,0.00055711076,0.002799933,0.004819863,0.92277217,0.043243375,0.02383744],"study_design_scores_gemma":[0.00020425666,0.0001982913,0.0005707016,0.00014890972,0.00008578529,0.00047093577,0.00087715086,0.02532635,0.0068553924,0.906611,0.058577225,0.00007403205],"about_ca_topic_score_codex":0.0033418522,"about_ca_topic_score_gemma":0.0065350253,"teacher_disagreement_score":0.04776679,"about_ca_system_score_codex":0.002152146,"about_ca_system_score_gemma":0.002324446,"threshold_uncertainty_score":0.15979576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016553578,0.00014096568,0.9890587,0.00014167502,0.00015282503,0.000098333265,0.000023001812,0.00083750195,0.0078917965],"genre_scores_gemma":[0.3815217,0.00073788885,0.5718129,0.0005612732,0.00024032091,0.00084011373,0.0001466827,0.00020856218,0.043930475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994211,0.00007880671,0.000040779712,0.00010723254,0.00030880835,0.00004335438],"domain_scores_gemma":[0.9997284,0.00007289294,0.000035356792,0.00003502856,0.00009862913,0.000029620247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065557664,0.0008405169,0.0006086421,0.0005724822,0.00051787973,0.0019258114,0.0015609872,0.001108322,0.0073406957],"category_scores_gemma":[0.0009458443,0.00038691933,0.00077109225,0.00037847657,0.0010418792,0.0008759779,0.0012713652,0.0011066514,0.0016351201],"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.00042001376,0.000254488,0.00074757705,0.0006062115,0.0002091276,0.0006682864,0.0007185503,0.23513344,0.08340899,0.2036157,0.012209254,0.4620084],"study_design_scores_gemma":[0.000055120712,0.0002739623,0.00035205917,0.000055422217,0.00004920186,0.00023808412,0.00005814855,0.9217964,0.013209134,0.020545354,0.043317437,0.000049751507],"about_ca_topic_score_codex":0.0023699484,"about_ca_topic_score_gemma":0.0024272893,"teacher_disagreement_score":0.0073406957,"about_ca_system_score_codex":0.0005181879,"about_ca_system_score_gemma":0.0007688668,"threshold_uncertainty_score":0.024557114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37458602,0.00023221337,0.5965264,0.0008307617,0.000043957494,0.0003242275,0.000029482046,0.00029316416,0.027133774],"genre_scores_gemma":[0.8610616,0.000118484626,0.1343957,0.00016131665,0.000010455257,0.00012750881,0.000025681831,0.000035457593,0.0040638167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987338,0.0006626402,0.00005040738,0.00019610542,0.00024263015,0.000114478295],"domain_scores_gemma":[0.9982096,0.0008658421,0.0001319008,0.00030313974,0.0002558886,0.00023375129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021981315,0.00054402807,0.0005625252,0.000598499,0.0009278782,0.0023444402,0.0013623234,0.0012486309,0.0020230513],"category_scores_gemma":[0.0069079916,0.00032892433,0.00042636902,0.00041071716,0.0024278148,0.0026924298,0.0023924706,0.0012199822,0.00035193664],"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.00027092276,0.00048124872,0.010115276,0.00016963381,0.0002828193,0.0007641687,0.004483965,0.39749724,0.03655442,0.43349546,0.0013227017,0.11456215],"study_design_scores_gemma":[0.0000479079,0.0001795939,0.0010208456,0.000028842973,0.000056812543,0.00025224642,0.00047655564,0.91386986,0.005413144,0.07311099,0.0055011204,0.000042130454],"about_ca_topic_score_codex":0.0024813937,"about_ca_topic_score_gemma":0.0021417048,"teacher_disagreement_score":0.0024813937,"about_ca_system_score_codex":0.00070730224,"about_ca_system_score_gemma":0.0007757594,"threshold_uncertainty_score":0.011624932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42679578,0.0004270245,0.5414665,0.0003168112,0.00015200012,0.00033579188,0.00031705815,0.004478028,0.025710959],"genre_scores_gemma":[0.63770443,0.00011965739,0.34889695,0.00010803353,0.000010349457,0.00028782192,0.0004987889,0.0005947786,0.0117792785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997267,0.00004785258,0.00001488132,0.00005747098,0.00009205539,0.00006100421],"domain_scores_gemma":[0.9992242,0.00025406835,0.000051128754,0.00013478407,0.00022706744,0.00010880746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048874406,0.00085322215,0.000789714,0.0017654375,0.00080124976,0.0016505341,0.0015656376,0.0009797437,0.0044358643],"category_scores_gemma":[0.0028316167,0.0005168326,0.00057624443,0.0005859257,0.00059576664,0.0009594818,0.0018890181,0.00051201915,0.0010947802],"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.00033721828,0.00051763916,0.010541413,0.00022619283,0.00015418378,0.0005866705,0.00095100055,0.65677583,0.052624352,0.030268224,0.009707262,0.23731],"study_design_scores_gemma":[0.00003895955,0.00011699425,0.00094194006,0.000024740073,0.000034661753,0.00007752637,0.00016960532,0.97992814,0.006292885,0.0047107334,0.0076366593,0.00002729606],"about_ca_topic_score_codex":0.0067529357,"about_ca_topic_score_gemma":0.0131450705,"teacher_disagreement_score":0.0067529357,"about_ca_system_score_codex":0.0014655426,"about_ca_system_score_gemma":0.00079329166,"threshold_uncertainty_score":0.01483947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003619497,0.000911045,0.98102796,0.0004884446,0.00021332051,0.000047239944,0.000065801556,0.00010516142,0.013521546],"genre_scores_gemma":[0.21833313,0.0037083698,0.7172928,0.0005413978,0.00114334,0.00096591207,0.0005734208,0.0007726905,0.05666889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982627,0.0009851106,0.000050011255,0.00012779812,0.0004692691,0.000105202096],"domain_scores_gemma":[0.9959013,0.0029373216,0.00013412922,0.00028839073,0.0004801008,0.0002587066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027218496,0.0015327716,0.0020873246,0.002381036,0.0011590774,0.0026429233,0.0027073554,0.0015559508,0.012135268],"category_scores_gemma":[0.00909663,0.00086037995,0.0018166519,0.002063086,0.002769132,0.00382426,0.002730737,0.006038228,0.0023152418],"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.000023374863,0.00004496432,0.00008890388,0.000088497756,0.00002987584,0.000011666322,0.000058952042,0.02688974,0.0002076167,0.9520293,0.0031934266,0.017333698],"study_design_scores_gemma":[0.000024294368,0.0000106038915,0.00002648824,0.000021295693,0.000007355006,0.000006696509,0.000019122534,0.20056756,0.00007745159,0.7958452,0.0033867909,0.000007116489],"about_ca_topic_score_codex":0.0032675907,"about_ca_topic_score_gemma":0.0038251905,"teacher_disagreement_score":0.012135268,"about_ca_system_score_codex":0.001671397,"about_ca_system_score_gemma":0.0015847506,"threshold_uncertainty_score":0.040596485},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32469884,0.0016020369,0.1979077,0.028533036,0.003715541,0.0010859526,0.0069288104,0.0033154336,0.4322127],"genre_scores_gemma":[0.8495723,0.00097071513,0.05689277,0.0028855095,0.0005728094,0.00055421045,0.004447801,0.0009472299,0.083156675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743867,0.0005075996,0.00016701451,0.00067066407,0.00032359408,0.0008924509],"domain_scores_gemma":[0.983906,0.010566173,0.00077357277,0.0019356746,0.0008928098,0.0019258272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016235164,0.0020591796,0.0027064711,0.00074035925,0.003939669,0.0051234765,0.0024545535,0.004219507,0.03920636],"category_scores_gemma":[0.018144023,0.0008964946,0.0016790887,0.0009183935,0.002229689,0.010878135,0.0054153996,0.0046286792,0.0060726823],"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.0053186943,0.0021682088,0.009139973,0.0033587608,0.00052765413,0.002484797,0.001462646,0.0541027,0.01248265,0.53458965,0.17084387,0.20352031],"study_design_scores_gemma":[0.0002404865,0.00025405307,0.0014017177,0.00024678983,0.00009047515,0.00060133927,0.0014960027,0.061868615,0.002879883,0.90782607,0.023026055,0.000068452944],"about_ca_topic_score_codex":0.0020783392,"about_ca_topic_score_gemma":0.0036160338,"teacher_disagreement_score":0.03920636,"about_ca_system_score_codex":0.0008782943,"about_ca_system_score_gemma":0.002345174,"threshold_uncertainty_score":0.13115835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007421976,0.00025244753,0.98355466,0.00010371834,0.000070087306,0.00004915735,0.000016436168,0.00035728625,0.008174297],"genre_scores_gemma":[0.45947897,0.0008613781,0.53353924,0.0001270268,0.0000808878,0.0002997998,0.0001258911,0.000096026786,0.005390731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00013994369,0.00003417472,0.00010812897,0.0001659,0.000047561436],"domain_scores_gemma":[0.99986434,0.00005480063,0.000017372748,0.000014331348,0.000040455223,0.000008695876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047554032,0.00060565246,0.000658276,0.00063382305,0.000509117,0.0010577368,0.00076088414,0.0007702855,0.001111916],"category_scores_gemma":[0.00092206814,0.0002006082,0.0005897243,0.0006795077,0.00083171716,0.0007655899,0.00042397509,0.0007152839,0.00022684214],"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.00009575842,0.000062314284,0.0013374813,0.00021127566,0.00009200202,0.00040093416,0.00022751941,0.43222758,0.021636173,0.37152913,0.002367709,0.1698121],"study_design_scores_gemma":[0.000049425038,0.00011921599,0.00045669486,0.000042178865,0.000045270997,0.00030141533,0.000035462046,0.9371116,0.0059475126,0.047037315,0.008814545,0.00003921467],"about_ca_topic_score_codex":0.0035285032,"about_ca_topic_score_gemma":0.0015692784,"teacher_disagreement_score":0.0035285032,"about_ca_system_score_codex":0.0005810385,"about_ca_system_score_gemma":0.0012335553,"threshold_uncertainty_score":0.0070159435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10283623,0.000054652286,0.89015454,0.00017102138,0.000014594227,0.00015519415,0.0000643396,0.0012213744,0.005328157],"genre_scores_gemma":[0.739768,0.000058052086,0.25815293,0.000048501464,0.0000050242506,0.00014127654,0.00011982314,0.00011154641,0.001594777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966633,0.0001475735,0.00001912837,0.00005460038,0.00007160751,0.00004070485],"domain_scores_gemma":[0.9993794,0.0004126377,0.00004732778,0.000053028056,0.000055082113,0.00005258188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000502794,0.00065411127,0.00036469434,0.0002756129,0.00040186738,0.0005299768,0.00059907546,0.00042053635,0.0019856072],"category_scores_gemma":[0.0017015323,0.00032126653,0.00037781833,0.00021398178,0.0007167779,0.00053916685,0.00078523066,0.00049386994,0.00026440292],"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.00042539038,0.00018420308,0.0025108936,0.00015669725,0.00005149234,0.0003315031,0.0006890775,0.83407545,0.01496175,0.028663468,0.001750232,0.1161998],"study_design_scores_gemma":[0.000021944485,0.00004950268,0.00012525306,0.0000039678825,0.000009342492,0.000025939615,0.000042167158,0.9900788,0.0034549972,0.0053552887,0.00082663284,0.000006156212],"about_ca_topic_score_codex":0.005499418,"about_ca_topic_score_gemma":0.007721745,"teacher_disagreement_score":0.005499418,"about_ca_system_score_codex":0.00047171945,"about_ca_system_score_gemma":0.0011183636,"threshold_uncertainty_score":0.01093483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40399933,0.0012755714,0.5194935,0.0044944435,0.0003746586,0.00038711043,0.000675253,0.0008923929,0.06840781],"genre_scores_gemma":[0.87433696,0.00070288347,0.09511961,0.00041624333,0.00015229927,0.00029576712,0.00050167943,0.00023830034,0.02823632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.00040635432,0.000042578158,0.0001332559,0.00022875008,0.00016336559],"domain_scores_gemma":[0.989965,0.0077592977,0.00045370535,0.00060703914,0.00048385613,0.0007310655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013602484,0.0010365488,0.0018824287,0.0015509792,0.0012936039,0.0027572133,0.002029933,0.0023616068,0.010171895],"category_scores_gemma":[0.012845801,0.00081669725,0.00097482133,0.0014242892,0.001626045,0.0057099503,0.0023264196,0.0031003703,0.00061362976],"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.0004851912,0.00018193708,0.0005635393,0.0002085187,0.00006725987,0.00010664068,0.0002263585,0.17652436,0.0025997562,0.78165376,0.010666408,0.026716242],"study_design_scores_gemma":[0.00010825695,0.00006577974,0.0001599867,0.000015598405,0.000017881954,0.00004854736,0.00004952178,0.42731935,0.000385451,0.57039636,0.0014190611,0.000014103225],"about_ca_topic_score_codex":0.002494112,"about_ca_topic_score_gemma":0.002472194,"teacher_disagreement_score":0.010171895,"about_ca_system_score_codex":0.0017387484,"about_ca_system_score_gemma":0.001286961,"threshold_uncertainty_score":0.03402835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14236479,0.0012767998,0.74895924,0.0060854214,0.00025521097,0.000104885905,0.00033940183,0.00027427208,0.10034001],"genre_scores_gemma":[0.8942405,0.00089370366,0.08962712,0.0006666272,0.0006768933,0.00022006253,0.00031586702,0.00019442798,0.013164812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775356,0.0010896489,0.00008730557,0.00032376204,0.00047877958,0.00026693728],"domain_scores_gemma":[0.9890827,0.007965533,0.0008339517,0.0008339374,0.0006589178,0.0006249805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030105151,0.0010365611,0.0015238668,0.0027425757,0.0018939937,0.0042185197,0.0025440932,0.0022577024,0.008561532],"category_scores_gemma":[0.015504631,0.0009176072,0.0018175521,0.0028521626,0.0068718665,0.0128959995,0.0042565246,0.005179128,0.00073823193],"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.0000068140316,0.00001002043,0.000050236264,0.000015822625,0.0000031436855,0.000019722358,0.000061020008,0.0010180972,0.00007856607,0.9970726,0.00033661595,0.0013273263],"study_design_scores_gemma":[0.000004612515,0.0000027513393,0.00002637944,0.000004963574,0.0000021332314,0.000020970156,0.000014313709,0.0052554524,0.000023237495,0.9943856,0.00025627797,0.0000032960513],"about_ca_topic_score_codex":0.001936185,"about_ca_topic_score_gemma":0.0014859077,"teacher_disagreement_score":0.008561532,"about_ca_system_score_codex":0.0020620339,"about_ca_system_score_gemma":0.0010169632,"threshold_uncertainty_score":0.028641164},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17653233,0.0049799695,0.38397655,0.0058986493,0.0018004092,0.0001239009,0.0005952225,0.0004510405,0.42564186],"genre_scores_gemma":[0.8967747,0.0010650157,0.028051961,0.0008118188,0.0005019217,0.0001265585,0.00031103578,0.00019846749,0.07215851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879885,0.00044061517,0.00006398203,0.00021019712,0.00027965475,0.00020665275],"domain_scores_gemma":[0.9985285,0.00059949706,0.000106995554,0.00019227726,0.00032741105,0.00024529558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240442,0.0007895356,0.0009102316,0.002379278,0.0047602803,0.006549722,0.0012980662,0.0019699614,0.009569373],"category_scores_gemma":[0.0045099724,0.0006124869,0.00076812634,0.0016346392,0.0066008503,0.01077198,0.0032556774,0.003610288,0.0015875516],"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.0000099785175,0.0000022548063,0.000029729075,0.000004939597,8.767075e-7,0.000011499243,0.00013231377,0.00010210131,0.00004158584,0.9983998,0.00030316744,0.000961709],"study_design_scores_gemma":[0.0000035417322,0.0000040014265,0.000024359584,0.0000062660597,0.0000018237813,0.000019441777,0.000064112646,0.0006803045,0.000057952882,0.9960531,0.0030796132,0.000005382126],"about_ca_topic_score_codex":0.0024129348,"about_ca_topic_score_gemma":0.0029866458,"teacher_disagreement_score":0.009569373,"about_ca_system_score_codex":0.0017619493,"about_ca_system_score_gemma":0.0013452806,"threshold_uncertainty_score":0.03201276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018327538,0.000070382535,0.9733869,0.00015353532,0.000060468014,0.00012221934,0.000050427123,0.00075536635,0.0070731635],"genre_scores_gemma":[0.707127,0.00007645047,0.2868478,0.00007720079,0.000018320608,0.0002541597,0.00008255064,0.000092729606,0.00542376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966645,0.00006809088,0.000019046312,0.00007485512,0.0001062159,0.00006539929],"domain_scores_gemma":[0.9996642,0.00012104612,0.000033482247,0.000042661482,0.00007185595,0.000066797234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057405577,0.000768014,0.00090168725,0.0006144538,0.0007923707,0.0011637865,0.0018440263,0.0013920538,0.006127092],"category_scores_gemma":[0.0015050962,0.00050118385,0.00060522,0.000298633,0.0009446074,0.00077836704,0.0017271035,0.001308587,0.0005211532],"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.00016033986,0.000083655934,0.0002632598,0.000073456555,0.000030072428,0.00016423114,0.00010856465,0.9294782,0.0054722545,0.028581383,0.0010603913,0.034524117],"study_design_scores_gemma":[0.0000181993,0.000019214045,0.000030694122,0.0000034835382,0.0000052336563,0.000009941552,0.000007749484,0.9969758,0.0003937831,0.0021932083,0.000336629,0.0000061505793],"about_ca_topic_score_codex":0.014074971,"about_ca_topic_score_gemma":0.01552783,"teacher_disagreement_score":0.014074971,"about_ca_system_score_codex":0.0011033913,"about_ca_system_score_gemma":0.0023548857,"threshold_uncertainty_score":0.02798611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024792468,0.0003934551,0.96583974,0.00028321217,0.000080701604,0.00007485484,0.000044474466,0.00066953036,0.0078216335],"genre_scores_gemma":[0.60641474,0.0005521821,0.3857622,0.00015579342,0.000052171217,0.0002843123,0.0001380498,0.00016534534,0.006475181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997732,0.00006382792,0.000017891947,0.000052704137,0.000060459945,0.00003201488],"domain_scores_gemma":[0.9994197,0.00040311174,0.000042800097,0.000043776643,0.00006620176,0.000024477165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564184,0.0008675122,0.00051926426,0.00048139546,0.00036044364,0.000787979,0.00096948683,0.0011060222,0.0035435474],"category_scores_gemma":[0.0025743847,0.00050032325,0.0006163374,0.0003585115,0.00082095625,0.0011750377,0.0010437837,0.0013536583,0.000416036],"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.00002378916,0.000040392504,0.0002648418,0.000072541465,0.000020448677,0.000052739713,0.00006099214,0.94027156,0.0026489545,0.023644706,0.00038673598,0.032512445],"study_design_scores_gemma":[0.0000053218946,0.000011953975,0.000028795277,0.0000064663177,0.00000466763,0.000006077365,0.000007461057,0.9862061,0.00080459163,0.012217383,0.0006982991,0.0000027680649],"about_ca_topic_score_codex":0.0039800163,"about_ca_topic_score_gemma":0.008601895,"teacher_disagreement_score":0.0039800163,"about_ca_system_score_codex":0.0010024847,"about_ca_system_score_gemma":0.00059347873,"threshold_uncertainty_score":0.011854351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12314358,0.0005557137,0.8455872,0.00039809168,0.000051869294,0.00014719773,0.00012245907,0.001329569,0.028664317],"genre_scores_gemma":[0.71798754,0.00060039974,0.26292786,0.00008905865,0.000028270346,0.00034785076,0.00018024226,0.0003710942,0.017467694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990017,0.00026932196,0.000052406842,0.00020960339,0.00037493903,0.00009207394],"domain_scores_gemma":[0.99831223,0.0008844162,0.00024148684,0.0002243355,0.00022438554,0.00011317904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011034166,0.000773215,0.00036912624,0.0010833472,0.00079824106,0.002558245,0.0009332026,0.0007708413,0.006284843],"category_scores_gemma":[0.005394677,0.00040325892,0.00048060107,0.00086793344,0.0024430277,0.0037026745,0.0021883473,0.0010364199,0.0009573459],"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.000736111,0.00016240733,0.007183997,0.00076222955,0.000058125534,0.00029938613,0.0037898745,0.11576717,0.105285585,0.44629988,0.001244626,0.31841052],"study_design_scores_gemma":[0.00010725318,0.0014608357,0.019905325,0.0004381736,0.00019779475,0.00086736004,0.0034569807,0.35491866,0.12115389,0.3710922,0.12615833,0.00024322674],"about_ca_topic_score_codex":0.0021547629,"about_ca_topic_score_gemma":0.0026469356,"teacher_disagreement_score":0.006284843,"about_ca_system_score_codex":0.0008504612,"about_ca_system_score_gemma":0.0008145059,"threshold_uncertainty_score":0.021024883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14978789,0.0006910762,0.52265745,0.0030611581,0.00029349013,0.00054358674,0.006056211,0.0016525714,0.3152566],"genre_scores_gemma":[0.7880701,0.001030747,0.11298376,0.0013408059,0.0003036193,0.0008456389,0.0121641075,0.0013520954,0.08190907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864906,0.00021743772,0.00009708616,0.0004412242,0.00034053923,0.00025461585],"domain_scores_gemma":[0.99481344,0.0021198175,0.00081660104,0.00074412697,0.0009069313,0.0005990299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079907745,0.00087234844,0.000498348,0.0027226345,0.0019522541,0.004530586,0.0018478016,0.0013493482,0.03426302],"category_scores_gemma":[0.006371943,0.00064639514,0.0009416995,0.0027758346,0.0018413722,0.005774533,0.0021161323,0.0023777594,0.0040221764],"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.00004441197,0.000038311737,0.000525026,0.00008752741,0.000013332589,0.00012548943,0.00029959032,0.0016187902,0.0008892688,0.976439,0.008246965,0.011672342],"study_design_scores_gemma":[0.000023647668,0.000021116059,0.0006823492,0.000060711758,0.000022130998,0.0003329663,0.00032038116,0.009558235,0.0016160341,0.96064425,0.026696669,0.000021512646],"about_ca_topic_score_codex":0.0020159034,"about_ca_topic_score_gemma":0.0032356202,"teacher_disagreement_score":0.03426302,"about_ca_system_score_codex":0.0017140703,"about_ca_system_score_gemma":0.0009957995,"threshold_uncertainty_score":0.11462122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54854435,0.004176152,0.13188769,0.0041887546,0.00033573835,0.0018646593,0.0007648934,0.0008538704,0.30738395],"genre_scores_gemma":[0.93331736,0.0012486837,0.049279373,0.00038620894,0.000046125504,0.00045132937,0.0003345485,0.0001473389,0.014789047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794084,0.0011039646,0.00007192697,0.00018838837,0.00044682517,0.00024802441],"domain_scores_gemma":[0.990053,0.007381287,0.00027593286,0.00058501255,0.0012767075,0.0004280772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044981963,0.0005866667,0.0007844787,0.0007489517,0.0012823403,0.0021608234,0.0016902046,0.0017142182,0.010512109],"category_scores_gemma":[0.022943342,0.0003456509,0.00050540117,0.00065936666,0.0018887807,0.003017456,0.0015553035,0.0019566873,0.00100854],"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.0017413256,0.0022145335,0.014255262,0.0015797114,0.00018209306,0.0011363238,0.003010895,0.5007336,0.003506943,0.35446936,0.015772419,0.101397656],"study_design_scores_gemma":[0.00017582242,0.0010482625,0.0014423896,0.00021011946,0.000039570703,0.00015706934,0.0010329038,0.93795145,0.0019290023,0.03615478,0.019823574,0.00003507202],"about_ca_topic_score_codex":0.008415985,"about_ca_topic_score_gemma":0.011495545,"teacher_disagreement_score":0.010512109,"about_ca_system_score_codex":0.0017713021,"about_ca_system_score_gemma":0.0014021264,"threshold_uncertainty_score":0.035166502},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109548695,0.0008354248,0.28211915,0.022433082,0.0038069568,0.0028684586,0.0001851896,0.003224698,0.5749784],"genre_scores_gemma":[0.40650618,0.0006981599,0.2769968,0.0015629057,0.00058569096,0.002680062,0.00055506866,0.0006113103,0.3098038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935464,0.0043817526,0.00015650186,0.00043933283,0.0008611971,0.00061487907],"domain_scores_gemma":[0.98430866,0.001677369,0.00040339906,0.0020842382,0.0013474375,0.010178892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01055375,0.0005544516,0.00047505487,0.0009777853,0.005587545,0.007937074,0.0018026446,0.0017860526,0.039771043],"category_scores_gemma":[0.0135026965,0.00041832167,0.0004006953,0.0007418324,0.0024343901,0.0063393116,0.008898779,0.0034557742,0.01103486],"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.00069021183,0.0028923252,0.0035830776,0.00029056257,0.000034322522,0.0005297246,0.012314867,0.0029293117,0.0033784858,0.46370402,0.1870643,0.32258877],"study_design_scores_gemma":[0.00016358116,0.0010390858,0.0019512983,0.00016762447,0.000011615653,0.0005198564,0.007341278,0.006817719,0.0019739305,0.11031715,0.86964107,0.000055901495],"about_ca_topic_score_codex":0.00040535926,"about_ca_topic_score_gemma":0.00170563,"teacher_disagreement_score":0.039771043,"about_ca_system_score_codex":0.0012521276,"about_ca_system_score_gemma":0.003994808,"threshold_uncertainty_score":0.1330474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70211107,0.00028010504,0.25362608,0.002222285,0.00017226729,0.00025186216,0.00024953243,0.0010272821,0.040059555],"genre_scores_gemma":[0.9409576,0.00008757648,0.0496646,0.00021295735,0.000021338723,0.0000828895,0.00015916112,0.00010225633,0.008711647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981279,0.0007395132,0.000074367206,0.00039261428,0.00031045554,0.00035523978],"domain_scores_gemma":[0.9941214,0.0030699086,0.00044972132,0.0013777473,0.00037801216,0.0006031332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016777833,0.00063187786,0.0007365545,0.0005070437,0.0016754502,0.0019045704,0.0017056039,0.0013621832,0.007951554],"category_scores_gemma":[0.014105899,0.0004409432,0.000951706,0.0005278571,0.0030276177,0.003950751,0.0029314863,0.0016176723,0.0008508158],"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.0014703212,0.00037102244,0.0070369723,0.00028403956,0.00018504342,0.0011420146,0.0017761093,0.09928524,0.009557253,0.7580153,0.008786281,0.11209043],"study_design_scores_gemma":[0.00027206296,0.00072345155,0.00179153,0.00007615211,0.00013105106,0.0007915822,0.00069102907,0.44794983,0.008882781,0.5166045,0.022015333,0.00007068914],"about_ca_topic_score_codex":0.0016882891,"about_ca_topic_score_gemma":0.001804108,"teacher_disagreement_score":0.007951554,"about_ca_system_score_codex":0.0009569834,"about_ca_system_score_gemma":0.0013704723,"threshold_uncertainty_score":0.0266006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044442233,0.00015673015,0.95040005,0.00014961789,0.000031448675,0.000060810853,0.0000410386,0.002460308,0.002257852],"genre_scores_gemma":[0.709849,0.000102072794,0.28572953,0.00015152167,0.000024425733,0.00021322242,0.00010655829,0.00015162762,0.0036720773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953294,0.00012795745,0.000037069298,0.000132224,0.000116478914,0.00005334574],"domain_scores_gemma":[0.9979644,0.0010104948,0.00020557079,0.00047861002,0.00023293975,0.00010800891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012048665,0.00058742764,0.00076073006,0.00041942255,0.00028448377,0.00078690145,0.001960535,0.000711228,0.0029176748],"category_scores_gemma":[0.0044485107,0.00039560176,0.0004687948,0.00042584218,0.0010243278,0.0019154651,0.0012831056,0.0011862365,0.0005015337],"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.00042294842,0.00021618251,0.002509956,0.00012690728,0.000105786836,0.00009994276,0.00015892953,0.6869864,0.0057812403,0.027153479,0.0015046248,0.27493367],"study_design_scores_gemma":[0.000024318315,0.00008631983,0.0001552076,0.000004473942,0.000009295642,0.000023395685,0.000005850757,0.99092746,0.0017693725,0.006348409,0.00063875644,0.000007153487],"about_ca_topic_score_codex":0.003849109,"about_ca_topic_score_gemma":0.0047497037,"teacher_disagreement_score":0.003849109,"about_ca_system_score_codex":0.0007521538,"about_ca_system_score_gemma":0.0010076646,"threshold_uncertainty_score":0.009760618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011364303,0.004951778,0.9182115,0.0033117472,0.00031193456,0.00023130768,0.00006070679,0.00018244745,0.06137423],"genre_scores_gemma":[0.5805868,0.0041426686,0.39792433,0.0006983424,0.00019612226,0.0006075778,0.000073655334,0.000049016722,0.015721437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984106,0.0008407695,0.000088764384,0.00012654715,0.00042424895,0.000108990534],"domain_scores_gemma":[0.9990388,0.00063523866,0.00006594482,0.000045198336,0.00014996846,0.00006483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002881218,0.0007508082,0.00065787276,0.00085986644,0.00095626106,0.002454529,0.001359221,0.0019632464,0.003885174],"category_scores_gemma":[0.0037880929,0.00040770313,0.0006924503,0.00068161945,0.0028249545,0.002028056,0.00094894035,0.0017605863,0.0004691556],"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.000068901776,0.00006747733,0.0002646734,0.00017418565,0.00005176944,0.00018858312,0.0005320594,0.14087862,0.0012349804,0.8067652,0.002245951,0.047527585],"study_design_scores_gemma":[0.00008942859,0.00010275847,0.00012063061,0.0001250589,0.00003896606,0.00009566677,0.00016255767,0.25819072,0.0009884939,0.7184133,0.021638205,0.000034249897],"about_ca_topic_score_codex":0.0068122377,"about_ca_topic_score_gemma":0.0052713305,"teacher_disagreement_score":0.0068122377,"about_ca_system_score_codex":0.002210649,"about_ca_system_score_gemma":0.0014783435,"threshold_uncertainty_score":0.016039431},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09696374,0.0012365704,0.8749358,0.00053341495,0.00010198098,0.00012428335,0.0001967479,0.00054309284,0.025364324],"genre_scores_gemma":[0.6833302,0.00087835453,0.299269,0.0001881506,0.000052360712,0.00021216589,0.00036159347,0.00026788557,0.015440223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.00015279657,0.000020440542,0.00010606188,0.00011777952,0.000070422924],"domain_scores_gemma":[0.99918073,0.0005658638,0.00006782564,0.000050821294,0.00006115293,0.00007366673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060441665,0.00081934634,0.0009912541,0.0005686149,0.0005088794,0.00096875045,0.0007471734,0.00086371024,0.006465379],"category_scores_gemma":[0.0022744993,0.000571164,0.0006783634,0.0006192845,0.0016582406,0.001424802,0.0014012834,0.0015465409,0.0004677793],"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.00013351795,0.00007913408,0.0006950606,0.00015761935,0.000029750689,0.00011244454,0.00017905586,0.82850325,0.0011823458,0.13873579,0.00211325,0.028078677],"study_design_scores_gemma":[0.000052558,0.00008300984,0.00018913097,0.000024125698,0.000011668428,0.000036118487,0.00008074214,0.8523071,0.0006705655,0.1411347,0.00539843,0.000011988824],"about_ca_topic_score_codex":0.006292224,"about_ca_topic_score_gemma":0.0069445777,"teacher_disagreement_score":0.006465379,"about_ca_system_score_codex":0.0011606711,"about_ca_system_score_gemma":0.0011217693,"threshold_uncertainty_score":0.021628857},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24192142,0.00062361,0.62420297,0.0029187049,0.00061514723,0.00071203004,0.0012296073,0.0015220803,0.12625442],"genre_scores_gemma":[0.81999075,0.0004575765,0.13410947,0.00070353324,0.00006555053,0.00050323823,0.0012166658,0.00036981943,0.042583387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961925,0.00011842998,0.000016628523,0.00008654968,0.000080640166,0.00007840348],"domain_scores_gemma":[0.999273,0.0003864195,0.000037482165,0.000057149333,0.000048794762,0.00019705232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003980899,0.0009540907,0.00065677555,0.00045338317,0.001407061,0.0019206181,0.0011215808,0.0012229921,0.0076695825],"category_scores_gemma":[0.0023830568,0.00029704315,0.0006601838,0.00049214106,0.0013401015,0.0026228526,0.0016184472,0.0016302639,0.0005084748],"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.0008322596,0.00023400932,0.00057880254,0.000310837,0.00007601177,0.00045523632,0.0005683913,0.044814844,0.009987473,0.88249165,0.023507826,0.036142748],"study_design_scores_gemma":[0.00017975381,0.00018689958,0.00023906394,0.000036127316,0.000046364774,0.0002011698,0.00020254892,0.16446024,0.0023022655,0.81501186,0.017106412,0.000027273603],"about_ca_topic_score_codex":0.004512598,"about_ca_topic_score_gemma":0.0055667935,"teacher_disagreement_score":0.0076695825,"about_ca_system_score_codex":0.0010185888,"about_ca_system_score_gemma":0.0012111212,"threshold_uncertainty_score":0.025657237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0682512,0.0003051332,0.90036416,0.00044372867,0.000067427194,0.0001786211,0.000117077034,0.0004274604,0.02984522],"genre_scores_gemma":[0.7357064,0.0005161672,0.2529953,0.00029292027,0.00010304832,0.00043930416,0.0002688885,0.00016259201,0.009515299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988078,0.0004941161,0.00007080013,0.00016843638,0.00033644433,0.00012239328],"domain_scores_gemma":[0.9975182,0.0017859202,0.00011613532,0.0002753471,0.00013256646,0.00017177999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013860164,0.00062987657,0.00074457016,0.0010955413,0.0010101743,0.0022923488,0.0010505819,0.0009875176,0.005545976],"category_scores_gemma":[0.006654905,0.00046051547,0.0013121057,0.0009723425,0.0034074024,0.004581952,0.002793432,0.00256249,0.0006546982],"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.00003282623,0.000048857233,0.0003095346,0.000045958703,0.000018098133,0.000071131806,0.00021968369,0.042902224,0.00096713525,0.93905747,0.0006881602,0.015639056],"study_design_scores_gemma":[0.000019931696,0.000023036633,0.00010642395,0.0000131700135,0.000008612126,0.000028645612,0.000041218336,0.12381426,0.0005948375,0.87292284,0.0024177865,0.000009258011],"about_ca_topic_score_codex":0.0012038895,"about_ca_topic_score_gemma":0.0012932745,"teacher_disagreement_score":0.005545976,"about_ca_system_score_codex":0.001294987,"about_ca_system_score_gemma":0.00083155517,"threshold_uncertainty_score":0.018553138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91871,0.00019726636,0.07650682,0.0002067243,0.00006435427,0.00020860015,0.00003722949,0.00030542898,0.0037635504],"genre_scores_gemma":[0.98989445,0.00002691888,0.009633549,0.000033298096,0.0000028271058,0.00004885437,0.000012827463,0.0000118127955,0.00033547077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872833,0.0007003344,0.00007876035,0.00016997024,0.00018237719,0.00014012164],"domain_scores_gemma":[0.9898689,0.007950478,0.000843227,0.0004385488,0.0005697398,0.00032914255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031456847,0.0007980494,0.0005019416,0.00044737983,0.00033970314,0.0008806587,0.0010488699,0.00066698703,0.00096382096],"category_scores_gemma":[0.023350775,0.00033550363,0.00024802735,0.0002282221,0.00091746467,0.0012099255,0.0007644719,0.00127479,0.00012678273],"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.0015814924,0.00091084564,0.009199329,0.00020293143,0.0001481856,0.00020972728,0.00035143216,0.89502686,0.014356218,0.0046884757,0.00039422736,0.07293017],"study_design_scores_gemma":[0.000089610796,0.0008885199,0.0016083356,0.00002407593,0.000032150423,0.000055604538,0.000074406526,0.9856542,0.008495127,0.0026909623,0.00035613167,0.000030961488],"about_ca_topic_score_codex":0.0047963685,"about_ca_topic_score_gemma":0.0033329814,"teacher_disagreement_score":0.0047963685,"about_ca_system_score_codex":0.00095133024,"about_ca_system_score_gemma":0.00077334733,"threshold_uncertainty_score":0.016636133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0219404,0.00009668645,0.93925947,0.0005944558,0.00012368958,0.00027693014,0.00008922945,0.0007261928,0.036892872],"genre_scores_gemma":[0.41305137,0.00022242751,0.5552478,0.00049168605,0.000059102764,0.00055913045,0.0002208728,0.00012640457,0.030021194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995857,0.00013413973,0.000021701457,0.00008692918,0.00011420687,0.000057421184],"domain_scores_gemma":[0.9995012,0.00024687077,0.000036481077,0.000060954986,0.00008774019,0.00006675431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005105535,0.0007226948,0.00036782477,0.0002768792,0.00046368386,0.0007813594,0.0011808802,0.0008910631,0.0101830205],"category_scores_gemma":[0.0027981475,0.00020406378,0.00037454363,0.0002537276,0.0011008899,0.001361848,0.000774689,0.0014447414,0.0008608412],"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.00032807968,0.00021166133,0.0010413891,0.0002483486,0.00007371323,0.00024792133,0.0007010858,0.24491243,0.013893516,0.6044618,0.012162559,0.121717565],"study_design_scores_gemma":[0.00011163214,0.00015027262,0.00031620316,0.000026525504,0.000022512504,0.000108107335,0.00007559729,0.84729743,0.0025513635,0.12773387,0.021580096,0.000026372374],"about_ca_topic_score_codex":0.0029035376,"about_ca_topic_score_gemma":0.0038827239,"teacher_disagreement_score":0.0101830205,"about_ca_system_score_codex":0.0009677178,"about_ca_system_score_gemma":0.00086435245,"threshold_uncertainty_score":0.034065545},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010285966,0.009142369,0.018374182,0.38827968,0.005587564,0.00002896634,0.00010227433,0.00020268149,0.5679963],"genre_scores_gemma":[0.6423124,0.0094960295,0.011025613,0.060560774,0.006858836,0.00016715123,0.0001942918,0.00047243285,0.26891246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967507,0.0016379087,0.00007068626,0.00046210526,0.0007234629,0.00035513993],"domain_scores_gemma":[0.9944494,0.0028744363,0.00019383366,0.00083686854,0.00077213376,0.00087346154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045560314,0.0004520594,0.0009113016,0.0009365638,0.007389592,0.011885422,0.0015723244,0.008010879,0.024920871],"category_scores_gemma":[0.019775309,0.0003297023,0.00042747415,0.0009844224,0.017853672,0.021358073,0.00507875,0.011571864,0.0072470587],"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.000018369334,0.000012027229,0.00011041421,0.000024770156,0.0000032577818,0.00003587501,0.00057722384,0.00011600359,0.000031777407,0.9508649,0.037365444,0.010840013],"study_design_scores_gemma":[0.000008318639,0.00000763461,0.00006896746,0.000040318548,0.0000017877899,0.000082630904,0.0009040797,0.00034861328,0.00004801801,0.8322541,0.16622801,0.000007504814],"about_ca_topic_score_codex":0.001223041,"about_ca_topic_score_gemma":0.0014631615,"teacher_disagreement_score":0.024920871,"about_ca_system_score_codex":0.0015023985,"about_ca_system_score_gemma":0.0024284534,"threshold_uncertainty_score":0.08336866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19592299,0.0005310818,0.7499408,0.00064324395,0.00013804428,0.00013182181,0.0002998404,0.0006373869,0.05175473],"genre_scores_gemma":[0.8351283,0.00019274106,0.156383,0.0003159095,0.000024826912,0.00019391219,0.000323406,0.00014170678,0.0072962707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947506,0.00024467797,0.000020321524,0.000061590545,0.00011825784,0.00008001535],"domain_scores_gemma":[0.998401,0.001182685,0.000080208454,0.00011465502,0.00014844978,0.00007299386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064534997,0.00030909243,0.00072487793,0.00043937715,0.0005222878,0.00097141834,0.00075089163,0.0008548586,0.00574016],"category_scores_gemma":[0.005088984,0.00025505747,0.0004349117,0.00055171223,0.001105136,0.0011165023,0.0009834025,0.0008447092,0.00048825977],"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.000119716446,0.000033579963,0.00094059523,0.000035391215,0.000017359147,0.00008344939,0.00009351835,0.82940674,0.00048147084,0.15561709,0.0013119865,0.011859273],"study_design_scores_gemma":[0.000015708792,0.000014082022,0.00008532569,0.0000050590384,0.0000030345357,0.000011896573,0.000019019626,0.9668642,0.00017293397,0.031917404,0.0008875647,0.000003741795],"about_ca_topic_score_codex":0.006007894,"about_ca_topic_score_gemma":0.0056890133,"teacher_disagreement_score":0.006007894,"about_ca_system_score_codex":0.0008843139,"about_ca_system_score_gemma":0.00085944956,"threshold_uncertainty_score":0.019202769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015080634,0.0002008405,0.9813208,0.00024120107,0.000024684081,0.000057644094,0.00003941053,0.00039145176,0.0026432725],"genre_scores_gemma":[0.51187164,0.00021260226,0.48386562,0.00023001325,0.000072096766,0.00034825923,0.00020990013,0.00020316454,0.0029866346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660146,0.0019756837,0.000105343315,0.00030952762,0.0007311466,0.0002768561],"domain_scores_gemma":[0.98715717,0.010257038,0.00066275755,0.0009787484,0.00068846834,0.0002558967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051845117,0.0012147907,0.0019522123,0.001288296,0.0007205606,0.001667753,0.0023220752,0.001510953,0.002949198],"category_scores_gemma":[0.022529017,0.0009703855,0.0009377983,0.0011044865,0.001679311,0.0024561756,0.001804816,0.0022077921,0.00055902847],"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.000094279916,0.000051620747,0.00062015565,0.000040951785,0.000040080733,0.000045098026,0.000050088733,0.93921417,0.00034266768,0.043076776,0.000795741,0.015628396],"study_design_scores_gemma":[0.0000065472414,0.0000053302806,0.000022229571,0.0000032673497,0.0000022457687,0.000005061825,0.000002546241,0.99132454,0.00009749617,0.008419811,0.00010896844,0.0000019558188],"about_ca_topic_score_codex":0.006220234,"about_ca_topic_score_gemma":0.0075866524,"teacher_disagreement_score":0.006220234,"about_ca_system_score_codex":0.0020525702,"about_ca_system_score_gemma":0.0024550287,"threshold_uncertainty_score":0.027418673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041814963,0.08320817,0.092871204,0.04984399,0.007564347,0.000036736612,0.0004900948,0.0006281358,0.76117575],"genre_scores_gemma":[0.23572569,0.05728853,0.05839124,0.008275109,0.0053379945,0.00021955995,0.00057858427,0.001801093,0.6323822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973124,0.00008044479,0.000018007391,0.00007066326,0.000065129345,0.00003456942],"domain_scores_gemma":[0.99973875,0.00014277638,0.000016632524,0.000031491127,0.00004430394,0.00002592589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355504,0.0010590784,0.00058300333,0.0009291148,0.002986071,0.0056268647,0.001121788,0.002714956,0.038071852],"category_scores_gemma":[0.003125015,0.0008513997,0.0004963398,0.0012358521,0.004930037,0.011512723,0.0019113009,0.00444801,0.008059407],"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.00001658385,0.0000070042265,0.00007658888,0.000041431424,0.0000068418167,0.000030473931,0.00054707506,0.00032368055,0.000058262696,0.80891144,0.15489171,0.0350889],"study_design_scores_gemma":[0.000008277874,0.0000042787083,0.0001367937,0.00008518317,0.000007829803,0.00006014255,0.000274706,0.0006640969,0.000114342074,0.56485564,0.43377638,0.000012295522],"about_ca_topic_score_codex":0.010425622,"about_ca_topic_score_gemma":0.027551888,"teacher_disagreement_score":0.038071852,"about_ca_system_score_codex":0.0021283734,"about_ca_system_score_gemma":0.0016649178,"threshold_uncertainty_score":0.12736297},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03272189,0.00023203557,0.96500087,0.00016412178,0.000018504934,0.00012988105,0.000017243952,0.000112840455,0.0016025493],"genre_scores_gemma":[0.7706903,0.00020251684,0.22717549,0.00012820562,0.00007587866,0.00035086472,0.0000680619,0.000054214124,0.0012544642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899581,0.0069973245,0.00034226014,0.00081041374,0.0015034255,0.0003884423],"domain_scores_gemma":[0.9517834,0.042999674,0.0014830357,0.0014001059,0.0015149759,0.00081874494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014882715,0.0013893599,0.0023065556,0.0016766295,0.0007408762,0.0017204259,0.0018692644,0.0015248306,0.0015216129],"category_scores_gemma":[0.058768302,0.0009714193,0.00066787534,0.0010480724,0.0027738856,0.0040790853,0.0029737302,0.0019870119,0.00017475498],"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.0004979383,0.00024561153,0.004218392,0.00016257666,0.00016889282,0.00019719976,0.00031605325,0.8099055,0.0013376247,0.101390846,0.0007211727,0.08083811],"study_design_scores_gemma":[0.00003352472,0.00007888132,0.00028684144,0.000011665882,0.000013426824,0.000024230732,0.000015899725,0.9543659,0.0004895933,0.044500217,0.00016996039,0.000009802555],"about_ca_topic_score_codex":0.002327469,"about_ca_topic_score_gemma":0.002712023,"teacher_disagreement_score":0.014882715,"about_ca_system_score_codex":0.0015903142,"about_ca_system_score_gemma":0.0015312692,"threshold_uncertainty_score":0.07870823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090319617,0.00002387068,0.99638724,0.00007294535,0.000014276636,0.000054071766,0.000031995638,0.00011348871,0.0023988963],"genre_scores_gemma":[0.08606253,0.00015786992,0.9083112,0.00013851898,0.00003457721,0.00044363167,0.00015481333,0.00022888307,0.0044680117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925405,0.00019206753,0.00004163135,0.00019260129,0.00026269574,0.00005703587],"domain_scores_gemma":[0.9994369,0.00019732254,0.000054969987,0.00015136188,0.00010907813,0.000050372728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008524907,0.0009840089,0.0006156528,0.0008011425,0.00085394393,0.0020767823,0.0028950186,0.0016823475,0.0056461478],"category_scores_gemma":[0.0024507688,0.00062124187,0.0021022821,0.0006734392,0.001672895,0.0015696842,0.0017527489,0.002576854,0.0011010063],"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.0000338678,0.00009250111,0.0006696114,0.0002190907,0.00006331394,0.00018377719,0.00053784443,0.3642056,0.0102701755,0.5695048,0.0023972527,0.05182211],"study_design_scores_gemma":[0.000010283394,0.000031084124,0.00013509914,0.000038327253,0.000023750728,0.000096607095,0.000050534352,0.8858254,0.002256927,0.093740754,0.017766578,0.000024685616],"about_ca_topic_score_codex":0.002962871,"about_ca_topic_score_gemma":0.004434555,"teacher_disagreement_score":0.0056461478,"about_ca_system_score_codex":0.001282218,"about_ca_system_score_gemma":0.001529388,"threshold_uncertainty_score":0.018888235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04327348,0.00009278547,0.9493883,0.00032953912,0.00004416,0.00031527795,0.00015129481,0.0017843666,0.0046206866],"genre_scores_gemma":[0.530985,0.0001386778,0.46051067,0.0002006801,0.00006039918,0.0005673553,0.00040394507,0.00029603843,0.0068372875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941491,0.001265443,0.00072484656,0.0014919837,0.0013435635,0.0010251398],"domain_scores_gemma":[0.986932,0.008754658,0.000983939,0.001719216,0.0010669716,0.0005431947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005559518,0.0010438797,0.00096258166,0.0008952018,0.0015096485,0.002615482,0.002355596,0.0011000832,0.0054015047],"category_scores_gemma":[0.01357909,0.0010869385,0.0023496342,0.00063248735,0.0043041776,0.0056516435,0.0037900514,0.0022120157,0.00061232754],"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.001182285,0.0003671555,0.00481428,0.0005171145,0.0002273576,0.0017244885,0.0017862726,0.33313116,0.02587199,0.5494009,0.0025222139,0.07845474],"study_design_scores_gemma":[0.00019871119,0.00016412909,0.00037168988,0.00006147648,0.000121639656,0.00023106212,0.00014848812,0.66643006,0.02484639,0.2988324,0.008529067,0.00006488438],"about_ca_topic_score_codex":0.008956178,"about_ca_topic_score_gemma":0.008965727,"teacher_disagreement_score":0.008956178,"about_ca_system_score_codex":0.0022672433,"about_ca_system_score_gemma":0.0049895295,"threshold_uncertainty_score":0.029401898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005716948,0.000035960387,0.99114054,0.00010976386,0.000033661414,0.00010842715,0.000045231158,0.0006678016,0.0021417239],"genre_scores_gemma":[0.11400781,0.00006378699,0.88118947,0.00015881236,0.00005175958,0.00055670575,0.00025567113,0.0002378526,0.0034781653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989466,0.00025862726,0.00007163864,0.00024068698,0.00035670595,0.0001257151],"domain_scores_gemma":[0.99769336,0.0013412061,0.00016614055,0.0003401118,0.00031824832,0.0001408189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018468318,0.0011987671,0.0011823863,0.001356991,0.0012424516,0.0014685888,0.0026787336,0.0015933483,0.007119608],"category_scores_gemma":[0.008188344,0.0005923934,0.0011267349,0.0011934225,0.0013279073,0.002820882,0.0030772986,0.0019502828,0.0017765987],"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.00033463506,0.00025274677,0.0016043683,0.00020493615,0.00010351051,0.00017553926,0.0004297353,0.42984825,0.005522614,0.21936044,0.009122515,0.3330408],"study_design_scores_gemma":[0.000094902294,0.00006580576,0.00008045325,0.000016551907,0.000014108724,0.00006198055,0.000027434018,0.91425383,0.0012373303,0.081709996,0.0024216268,0.000016023285],"about_ca_topic_score_codex":0.0020750724,"about_ca_topic_score_gemma":0.0035610672,"teacher_disagreement_score":0.007119608,"about_ca_system_score_codex":0.00124539,"about_ca_system_score_gemma":0.0017531826,"threshold_uncertainty_score":0.02381742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18935971,0.00033615268,0.8004631,0.0005571654,0.00008484475,0.00068207417,0.00023867025,0.0025325823,0.005745728],"genre_scores_gemma":[0.8254593,0.00009847827,0.17158492,0.00008578769,0.000016359194,0.00015080033,0.00021310616,0.000086568114,0.0023047016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880695,0.00034858024,0.00007979716,0.00028031628,0.00037502006,0.00010931419],"domain_scores_gemma":[0.99470466,0.0028885503,0.00075109943,0.0006493867,0.0006412551,0.00036511337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002189241,0.00082782353,0.00064123666,0.0007899386,0.0002929846,0.00077306293,0.002414028,0.00085991935,0.0034291542],"category_scores_gemma":[0.012878208,0.00041579193,0.00042397223,0.00038441774,0.00085913186,0.0019878878,0.0010114796,0.0011981112,0.00069652667],"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.0009797789,0.0011916853,0.015115121,0.00035089758,0.0001401239,0.00060279097,0.0003936834,0.5235704,0.015734846,0.010114533,0.0023573115,0.42944878],"study_design_scores_gemma":[0.00004830152,0.00018487422,0.0008945516,0.0000187509,0.000022721264,0.00011812806,0.000042637977,0.9887079,0.004440292,0.0046938565,0.0008123361,0.000015712194],"about_ca_topic_score_codex":0.0038177748,"about_ca_topic_score_gemma":0.0071310513,"teacher_disagreement_score":0.0038177748,"about_ca_system_score_codex":0.0011150775,"about_ca_system_score_gemma":0.0008545614,"threshold_uncertainty_score":0.011577904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035094224,0.000083692066,0.9514628,0.0008532268,0.000072984294,0.00025864274,0.0000424964,0.00021438352,0.011917513],"genre_scores_gemma":[0.749729,0.00017522287,0.24093965,0.00029989466,0.000058295576,0.00044055143,0.000076316384,0.00007840024,0.008202696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795145,0.0011877901,0.00008237846,0.00023960962,0.00031840804,0.0002204503],"domain_scores_gemma":[0.99601054,0.0030126686,0.00026417623,0.0001614615,0.00017946267,0.00037176663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027122006,0.0010694426,0.0007932463,0.0004967502,0.0007739375,0.0015032141,0.001166454,0.0018781367,0.0056039616],"category_scores_gemma":[0.009379816,0.0004253693,0.00070398016,0.00033272002,0.0019200075,0.002530513,0.0024762282,0.0020303426,0.00054649677],"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.00033672538,0.00021984523,0.000784273,0.00012849718,0.00006239971,0.00034573715,0.00061647303,0.5827415,0.0030145827,0.37846956,0.0022406215,0.031039836],"study_design_scores_gemma":[0.00008513542,0.00013636764,0.0000994259,0.00002220962,0.000014892118,0.000042591037,0.000054725588,0.8796023,0.0007159501,0.11667836,0.0025254267,0.000022706512],"about_ca_topic_score_codex":0.0022110234,"about_ca_topic_score_gemma":0.0026778346,"teacher_disagreement_score":0.0056039616,"about_ca_system_score_codex":0.0011042815,"about_ca_system_score_gemma":0.0018233157,"threshold_uncertainty_score":0.01874715},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04474459,0.0035338267,0.1320581,0.0052511594,0.00077356945,0.000053791948,0.00039357637,0.00044023432,0.8127512],"genre_scores_gemma":[0.66479963,0.0021802646,0.031845905,0.00080796913,0.00030564214,0.00009196237,0.00027063573,0.00060603,0.29909185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00011320578,0.000016610831,0.00008371634,0.0002233217,0.00013676754],"domain_scores_gemma":[0.999134,0.000421431,0.000043865042,0.0001949036,0.00012617881,0.00007975366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072259,0.0006193288,0.0008055473,0.0009507422,0.0011210184,0.0025382242,0.0012358757,0.0013864236,0.04796218],"category_scores_gemma":[0.004617471,0.0002627659,0.00050634146,0.0012825411,0.0022529305,0.004255007,0.0017416626,0.00198208,0.003988571],"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.000038665505,0.0000077496525,0.00008006828,0.000022660583,0.000003306061,0.000022306689,0.000042631546,0.0023525993,0.0001167045,0.97471875,0.0040851436,0.018509371],"study_design_scores_gemma":[0.000007531261,0.000017220593,0.00026915435,0.000053584852,0.000008451835,0.00010459426,0.00009832105,0.007299754,0.00029835285,0.9660769,0.025754856,0.000011283529],"about_ca_topic_score_codex":0.0048434143,"about_ca_topic_score_gemma":0.005359777,"teacher_disagreement_score":0.04796218,"about_ca_system_score_codex":0.0021362323,"about_ca_system_score_gemma":0.0008330204,"threshold_uncertainty_score":0.1604495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13888295,0.0009000284,0.49325892,0.0039505004,0.00085797644,0.00029940566,0.00096821284,0.000503184,0.3603788],"genre_scores_gemma":[0.7833161,0.0008138705,0.09806824,0.00055032823,0.00027214142,0.00034079017,0.0010941376,0.00041047556,0.11513393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986507,0.00043831806,0.00008637854,0.00023676129,0.00036979103,0.00021798538],"domain_scores_gemma":[0.9976935,0.0011352121,0.00020786218,0.00027060666,0.0002857669,0.00040698837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006653938,0.00093815,0.0010888256,0.0018114875,0.0023717282,0.0038146118,0.0016010336,0.0016642166,0.025521489],"category_scores_gemma":[0.0054061357,0.0007897038,0.0013631871,0.0016062907,0.0029662438,0.0053757518,0.0046077697,0.003419381,0.0019798807],"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.000015867812,0.000006049094,0.00004153481,0.000015760701,0.0000047073563,0.0000237538,0.00012423215,0.0014514525,0.00014516897,0.9944689,0.0011397063,0.0025628712],"study_design_scores_gemma":[0.000015940452,0.000007735289,0.000045482288,0.000010871783,0.000004483293,0.000027439755,0.00010608363,0.0067359456,0.00007580205,0.98821634,0.0047489847,0.0000047480353],"about_ca_topic_score_codex":0.003556071,"about_ca_topic_score_gemma":0.0033174313,"teacher_disagreement_score":0.025521489,"about_ca_system_score_codex":0.0018199449,"about_ca_system_score_gemma":0.00073042396,"threshold_uncertainty_score":0.08537787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004807711,0.0003011837,0.9869565,0.00032205635,0.000096064905,0.0001424168,0.00011446491,0.0007363673,0.00652333],"genre_scores_gemma":[0.1983426,0.0004465993,0.7907064,0.00030323834,0.00023604349,0.00043399972,0.0003985592,0.0008381523,0.008294421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922069,0.0030289467,0.0003803591,0.0005593762,0.0032083502,0.0006161131],"domain_scores_gemma":[0.98879415,0.007624637,0.00035515762,0.0013437174,0.0014280116,0.00045430547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068857465,0.0015582757,0.0029611166,0.0027857227,0.001444042,0.0047634146,0.004192038,0.0022134937,0.009466977],"category_scores_gemma":[0.027978301,0.0010185844,0.0016316094,0.003119651,0.0028248567,0.008700364,0.004826546,0.003758255,0.0012477],"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.00039330858,0.00027368465,0.0012589152,0.00038629546,0.00010298123,0.000113233335,0.000640359,0.18128735,0.0025304165,0.49541643,0.0144129945,0.30318406],"study_design_scores_gemma":[0.000032515167,0.000053259635,0.00014191723,0.000058133726,0.000042237643,0.00003475461,0.000046878537,0.8374892,0.0009684018,0.15683383,0.0042766393,0.00002221789],"about_ca_topic_score_codex":0.0082563525,"about_ca_topic_score_gemma":0.01054708,"teacher_disagreement_score":0.009466977,"about_ca_system_score_codex":0.002212444,"about_ca_system_score_gemma":0.0031853074,"threshold_uncertainty_score":0.036415756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011091909,0.00015011754,0.9456417,0.0006106135,0.00026510653,0.00026485987,0.0005177571,0.008120735,0.033337206],"genre_scores_gemma":[0.21175694,0.00023325713,0.7406916,0.000821355,0.00018987014,0.0005045098,0.0018819883,0.0024487406,0.041471664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876934,0.00025157232,0.00008115949,0.00025361552,0.0004330498,0.00021125701],"domain_scores_gemma":[0.998621,0.00071327726,0.000059867354,0.00027980047,0.00026623285,0.000059921676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011275895,0.0014539985,0.0011188036,0.0011627953,0.0012158516,0.00168141,0.0029370442,0.0016428307,0.03155714],"category_scores_gemma":[0.0040392284,0.000729144,0.0017649822,0.0010179761,0.0011765071,0.003043403,0.003906127,0.003966571,0.0055312975],"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.0007773384,0.0005037345,0.0006309569,0.0007635653,0.00012286758,0.00033508512,0.00046414277,0.106547505,0.010001886,0.41503844,0.050394103,0.41442043],"study_design_scores_gemma":[0.00033773246,0.00014195619,0.000162088,0.00008911232,0.00010720977,0.00013551718,0.00013278659,0.5143045,0.010206664,0.43654785,0.037798975,0.00003556522],"about_ca_topic_score_codex":0.0027795183,"about_ca_topic_score_gemma":0.006016845,"teacher_disagreement_score":0.03155714,"about_ca_system_score_codex":0.0010502037,"about_ca_system_score_gemma":0.0022315565,"threshold_uncertainty_score":0.105569184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19994967,0.00056348933,0.68953145,0.0018445133,0.00044363755,0.00033202936,0.00035328235,0.00064157567,0.10634029],"genre_scores_gemma":[0.8469867,0.00020239536,0.09021353,0.00019301064,0.000084896215,0.00029612312,0.00025029105,0.00027264195,0.061500467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948186,0.00018062099,0.000019724517,0.00008407213,0.0001042472,0.00012945953],"domain_scores_gemma":[0.9993861,0.0003468583,0.000036526864,0.000041260224,0.000051948424,0.00013729309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010533083,0.0012613252,0.0019732174,0.0008486996,0.001019345,0.0019604128,0.0020292192,0.0036298211,0.018653918],"category_scores_gemma":[0.0027216375,0.0011033434,0.00083271525,0.0005847845,0.0014897585,0.0012362017,0.002615517,0.0015128676,0.0014324405],"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.0008222729,0.00025056725,0.0006186256,0.00014035859,0.000087939596,0.00021999552,0.00010978526,0.88299805,0.0033454609,0.07950715,0.005983675,0.025916073],"study_design_scores_gemma":[0.000057065132,0.0000969114,0.00013054168,0.000013297752,0.000011298039,0.000023458288,0.000025451347,0.98708296,0.00039583826,0.011126132,0.001026524,0.000010604279],"about_ca_topic_score_codex":0.004933716,"about_ca_topic_score_gemma":0.0027676537,"teacher_disagreement_score":0.018653918,"about_ca_system_score_codex":0.0014077619,"about_ca_system_score_gemma":0.0016263933,"threshold_uncertainty_score":0.06240362},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011492702,0.0013478964,0.013352578,0.0099893,0.0083697755,0.00033728871,0.0014217609,0.0066733253,0.94701535],"genre_scores_gemma":[0.0239515,0.0006319226,0.004276608,0.0021977464,0.00057864626,0.000117072654,0.0011069069,0.00096713484,0.9661726],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942183,0.000060802213,0.00001827136,0.00010098668,0.00021538504,0.00018278757],"domain_scores_gemma":[0.99800307,0.00007531711,0.000038596834,0.00013101933,0.00038283347,0.0013691619],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004375648,0.0012147306,0.0008085334,0.0008612095,0.0021506883,0.0038791955,0.0011446706,0.0011049912,0.5566701],"category_scores_gemma":[0.0025364463,0.00032656526,0.00058719254,0.00045521045,0.00052026554,0.0045208265,0.006458727,0.0024863346,0.39109975],"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.00016165744,0.00023883172,0.0013321372,0.00013738936,0.000017711445,0.0003398147,0.0008200487,0.0000801544,0.0018295395,0.00489444,0.8280478,0.1621005],"study_design_scores_gemma":[0.000012885246,0.000072762465,0.00092128786,0.00007338799,0.0000055489304,0.0002597138,0.00078299193,0.00014857562,0.00025191557,0.0012300491,0.9962197,0.000021223403],"about_ca_topic_score_codex":0.0019181654,"about_ca_topic_score_gemma":0.0061239125,"teacher_disagreement_score":0.5566701,"about_ca_system_score_codex":0.0002903075,"about_ca_system_score_gemma":0.0005539144,"threshold_uncertainty_score":0.6323562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94607705,0.002012797,0.04456601,0.00091993494,0.0002459175,0.00019020129,0.00058252347,0.0017014352,0.0037041416],"genre_scores_gemma":[0.9816289,0.00039247924,0.015973208,0.00012149711,0.000032882606,0.00004418981,0.0006727098,0.000055893554,0.001078229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794894,0.0010533402,0.00016268188,0.00030959636,0.00034044267,0.0001850443],"domain_scores_gemma":[0.98465216,0.0123634655,0.00057203067,0.00053414016,0.0013198429,0.00055840646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007755838,0.0020327652,0.0015455597,0.0012602126,0.00066207495,0.001383964,0.0017807056,0.002372931,0.00108292],"category_scores_gemma":[0.016455969,0.000610487,0.0009176828,0.0005982544,0.0005883603,0.0016407274,0.00078992505,0.0016100308,0.0003874569],"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.002040415,0.001013662,0.015403692,0.00018206603,0.0004836941,0.00007997825,0.00015314897,0.9198966,0.0010544577,0.0006725586,0.0015715586,0.05744819],"study_design_scores_gemma":[0.000031836003,0.00026320195,0.0009877518,0.0000090268,0.000027008173,0.000009146926,0.000020568497,0.9980032,0.0004323136,0.00014040447,0.00006821879,0.0000074280338],"about_ca_topic_score_codex":0.056606684,"about_ca_topic_score_gemma":0.034699604,"teacher_disagreement_score":0.056606684,"about_ca_system_score_codex":0.0020059461,"about_ca_system_score_gemma":0.0015398925,"threshold_uncertainty_score":0.11255437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100739235,0.00020687416,0.9831768,0.00025562535,0.00012978303,0.000094420866,0.00025424076,0.002727786,0.003080519],"genre_scores_gemma":[0.21316546,0.00019934047,0.7698833,0.00035274588,0.00012353864,0.00034412806,0.001624465,0.00046357574,0.013843533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.000075323725,0.000025394727,0.00014346126,0.0001216811,0.000047980604],"domain_scores_gemma":[0.99963784,0.00010337003,0.00001798767,0.000094852156,0.00012308895,0.000022804454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005757089,0.0006112882,0.0009856184,0.00083995925,0.00056245626,0.0010001322,0.0012924758,0.0014299735,0.009791399],"category_scores_gemma":[0.0019346201,0.0003395728,0.0007910667,0.0010673724,0.0003791246,0.0011243916,0.0013468805,0.0013570323,0.0046847565],"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.00024505082,0.0001540604,0.0008270355,0.000080808095,0.00006669012,0.00012104709,0.000024680641,0.047516122,0.0070979823,0.010031113,0.0139827635,0.9198526],"study_design_scores_gemma":[0.00006502787,0.00008483845,0.00070034526,0.000016073362,0.00003582802,0.00014281069,0.000013173845,0.9746947,0.0039527947,0.014332568,0.0059480635,0.000013704721],"about_ca_topic_score_codex":0.002411495,"about_ca_topic_score_gemma":0.002131999,"teacher_disagreement_score":0.009791399,"about_ca_system_score_codex":0.00035859866,"about_ca_system_score_gemma":0.0008065654,"threshold_uncertainty_score":0.032755494},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052389703,0.0017145539,0.38829198,0.0030670203,0.0023435787,0.0014414878,0.029034749,0.016226672,0.55264103],"genre_scores_gemma":[0.09812229,0.0033747437,0.27832282,0.0031078258,0.0007386948,0.001664688,0.089395046,0.009874281,0.51539963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956369,0.0010444372,0.0006652889,0.0008081121,0.0014534128,0.0003918435],"domain_scores_gemma":[0.99532264,0.0010913099,0.00025147758,0.0011446072,0.0019088935,0.00028117243],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026094536,0.0015721485,0.00066028355,0.003209943,0.0017778025,0.00633055,0.003350274,0.0018679651,0.13859916],"category_scores_gemma":[0.00807761,0.0008439735,0.0011155838,0.002741862,0.0013027788,0.0096778,0.004404027,0.0022696166,0.07222843],"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.00020149366,0.0001259515,0.0007483332,0.0006645447,0.000025239908,0.00049927406,0.0015478219,0.0009804919,0.0027286347,0.5955035,0.24351172,0.15346292],"study_design_scores_gemma":[0.000011582359,0.000013661677,0.000086041386,0.00006808051,0.0000067024343,0.0002779676,0.0002861713,0.00066227507,0.0010660766,0.03276393,0.96473897,0.000018508521],"about_ca_topic_score_codex":0.0036191018,"about_ca_topic_score_gemma":0.0030491827,"teacher_disagreement_score":0.86140084,"about_ca_system_score_codex":0.0018230295,"about_ca_system_score_gemma":0.0024692887,"threshold_uncertainty_score":0.46366036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038315397,0.00029803027,0.9552431,0.00021222174,0.00007318223,0.00014141209,0.000081987884,0.001324888,0.004309775],"genre_scores_gemma":[0.6217349,0.0001966515,0.37321344,0.00038210294,0.000098495846,0.0005444598,0.000401195,0.0003940715,0.003034618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870133,0.00059977756,0.000053659904,0.00020413216,0.00031972857,0.00012122537],"domain_scores_gemma":[0.99506336,0.0034061582,0.00025838445,0.0006905817,0.0004227645,0.00015877577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200889,0.00079234276,0.0016053512,0.0010768889,0.0005627657,0.00087671063,0.0022502516,0.0012758382,0.0038622813],"category_scores_gemma":[0.015778162,0.0005704617,0.0006348408,0.0007974758,0.0011400877,0.0021074663,0.0019511108,0.0016147101,0.0010083709],"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.0003112625,0.00017909777,0.002987717,0.00017344867,0.00008236136,0.00020878889,0.0003001465,0.65139794,0.0031723322,0.06532414,0.005629543,0.2702332],"study_design_scores_gemma":[0.000027225604,0.00003618876,0.000120855,0.000014602991,0.000006116716,0.00003241441,0.00001339849,0.9727622,0.0004511031,0.02554149,0.0009885305,0.0000058806154],"about_ca_topic_score_codex":0.0016430191,"about_ca_topic_score_gemma":0.0024537211,"teacher_disagreement_score":0.0038622813,"about_ca_system_score_codex":0.0008688929,"about_ca_system_score_gemma":0.00093696057,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016299892,0.0001068629,0.9752703,0.00028426034,0.000034462733,0.00020904568,0.00010255189,0.00029261826,0.00740002],"genre_scores_gemma":[0.32263324,0.0003963872,0.66913575,0.0002731482,0.00007004761,0.0007396023,0.00041196405,0.00019972927,0.0061401785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691594,0.0013456322,0.00018333954,0.00053535914,0.0005526241,0.00046707503],"domain_scores_gemma":[0.9945446,0.004069821,0.00031101174,0.00051330694,0.00027863472,0.000282701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028083913,0.0017745881,0.0018741454,0.0011316258,0.0009243403,0.0024564187,0.0014681072,0.0012058021,0.0046789926],"category_scores_gemma":[0.009018881,0.00089580123,0.0023279341,0.0009798416,0.0023919279,0.0032874956,0.0031266536,0.0031631945,0.0006968786],"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.00020640025,0.00018202151,0.0006845596,0.00031100368,0.00012699154,0.00015250295,0.00039804768,0.66410226,0.0032350123,0.2713245,0.003296891,0.055979863],"study_design_scores_gemma":[0.000048626087,0.000051675295,0.00009544243,0.000033962508,0.000025101035,0.000040762203,0.00006563793,0.7832403,0.0012352589,0.21328253,0.0018616861,0.000019019546],"about_ca_topic_score_codex":0.004505374,"about_ca_topic_score_gemma":0.0040048575,"teacher_disagreement_score":0.0046789926,"about_ca_system_score_codex":0.00242999,"about_ca_system_score_gemma":0.003684436,"threshold_uncertainty_score":0.017630935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020420687,0.0001974503,0.9727233,0.00021241099,0.000023362458,0.00020008648,0.00023757297,0.0016206364,0.00436447],"genre_scores_gemma":[0.4365415,0.00034501762,0.55893236,0.00006443881,0.000017940558,0.00047775672,0.0006232751,0.00031298902,0.0026847087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989065,0.0005323496,0.00006375325,0.00019539738,0.00023446343,0.00006756321],"domain_scores_gemma":[0.9979437,0.0014972445,0.00015442366,0.00017816311,0.00014257399,0.00008398992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131066,0.0010574405,0.00047225284,0.000549293,0.0005961833,0.0015305767,0.0018754748,0.00093896594,0.004375111],"category_scores_gemma":[0.0048867874,0.0007156583,0.0009898578,0.0004336633,0.0009293694,0.0014348058,0.0017176282,0.0011766214,0.0006892939],"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.00019226247,0.0001431198,0.001804468,0.00022329377,0.0000616904,0.00030018046,0.0009920367,0.9029744,0.0044907127,0.032670688,0.0017502743,0.054396927],"study_design_scores_gemma":[0.00001605754,0.000021235104,0.00011346378,0.000011001393,0.000012208596,0.000032232398,0.000054483888,0.9876425,0.0010139265,0.008287653,0.0027867802,0.000008458502],"about_ca_topic_score_codex":0.012399739,"about_ca_topic_score_gemma":0.021002013,"teacher_disagreement_score":0.012399739,"about_ca_system_score_codex":0.001136581,"about_ca_system_score_gemma":0.001771253,"threshold_uncertainty_score":0.024655104},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051921703,0.00016525484,0.37144446,0.007155778,0.00056295394,0.0005348761,0.002911022,0.002293202,0.5630107],"genre_scores_gemma":[0.525468,0.000441883,0.17711942,0.0019288998,0.00013724098,0.0006114546,0.0028792415,0.0014278489,0.28998604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865675,0.0005203008,0.000057460686,0.00020250557,0.00037036111,0.00019257376],"domain_scores_gemma":[0.99853826,0.0007995511,0.000053246524,0.00020921286,0.00022580265,0.00017399142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008842511,0.00073564326,0.0007770994,0.0005661567,0.0018438743,0.0024142552,0.0017791401,0.0015227195,0.08282488],"category_scores_gemma":[0.006243235,0.0003494221,0.0006537685,0.00050944753,0.0011696623,0.004192862,0.002878062,0.0016202219,0.013204916],"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.00031298315,0.00013411058,0.0006678884,0.0001072816,0.000033198245,0.00017853083,0.0005627323,0.010981891,0.0027180768,0.8780489,0.06933125,0.036923155],"study_design_scores_gemma":[0.00017310184,0.00012381583,0.00062097434,0.00010386997,0.00003323584,0.00013019519,0.00048681366,0.11433983,0.0031780011,0.7585693,0.12218021,0.000060658742],"about_ca_topic_score_codex":0.008074489,"about_ca_topic_score_gemma":0.016335584,"teacher_disagreement_score":0.08282488,"about_ca_system_score_codex":0.0013528082,"about_ca_system_score_gemma":0.0014813353,"threshold_uncertainty_score":0.27707684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03321248,0.00016437612,0.9423561,0.0002205702,0.000047940077,0.00042830806,0.0005878028,0.0154158855,0.007566503],"genre_scores_gemma":[0.32513547,0.00018553545,0.66323,0.00013136824,0.000025324633,0.0002976289,0.0015953535,0.0025683409,0.0068310355],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970149,0.001139821,0.00022076892,0.00052152923,0.0009800183,0.0001230279],"domain_scores_gemma":[0.9946613,0.0031420134,0.00033899266,0.0009636817,0.00078668375,0.000107286665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024988009,0.0006631982,0.00040999913,0.0012716843,0.0007125733,0.0018580571,0.0011449069,0.00064004917,0.005054626],"category_scores_gemma":[0.0116746845,0.00045301576,0.0010376119,0.0005516491,0.0013131134,0.0024793195,0.0011426525,0.0009024587,0.00125111],"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.000557931,0.00040149374,0.0089517515,0.0017641784,0.00023972572,0.001963596,0.006977015,0.19973214,0.07091298,0.31896797,0.014736188,0.37479502],"study_design_scores_gemma":[0.00005301301,0.00023131119,0.0013708296,0.00010133321,0.00010034805,0.0005836063,0.0005222301,0.82204545,0.054269534,0.06769271,0.052943435,0.000086224405],"about_ca_topic_score_codex":0.00457697,"about_ca_topic_score_gemma":0.005529498,"teacher_disagreement_score":0.005054626,"about_ca_system_score_codex":0.0012140336,"about_ca_system_score_gemma":0.001261145,"threshold_uncertainty_score":0.01690942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032615855,0.000104926025,0.9858657,0.0007845892,0.00008774509,0.00019486583,0.00019329738,0.00084210426,0.008665153],"genre_scores_gemma":[0.10690275,0.00037069534,0.8680377,0.0006078905,0.00016283545,0.0005774136,0.0006510412,0.00029581704,0.02239378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716043,0.00055443327,0.00015330431,0.0008660806,0.0008869375,0.00037882294],"domain_scores_gemma":[0.99740124,0.00093075115,0.00022199436,0.00089863484,0.00036787093,0.00017955394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019874885,0.0012193501,0.0009796428,0.000918692,0.0016296812,0.001947948,0.0034097848,0.003342521,0.019580998],"category_scores_gemma":[0.00853636,0.0006898814,0.0016490199,0.0012209459,0.0017727552,0.0054858783,0.005344364,0.004115607,0.003298385],"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.00018855125,0.00016793013,0.0005156344,0.0003909381,0.000072817114,0.0002692854,0.0004418705,0.052319665,0.0051163053,0.7281706,0.024701877,0.1876446],"study_design_scores_gemma":[0.00015826496,0.00014538605,0.00024756935,0.000065417546,0.00006121719,0.0004872366,0.000144205,0.28896746,0.0043048044,0.643362,0.06200787,0.000048471975],"about_ca_topic_score_codex":0.0018369351,"about_ca_topic_score_gemma":0.0024880262,"teacher_disagreement_score":0.019580998,"about_ca_system_score_codex":0.0010316559,"about_ca_system_score_gemma":0.0028250604,"threshold_uncertainty_score":0.06550491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038754918,0.00008675335,0.9353548,0.00026410617,0.00008899769,0.00014891107,0.00006145167,0.0017278603,0.023512246],"genre_scores_gemma":[0.7903158,0.00007467595,0.20017722,0.00015335681,0.000025997424,0.00024101233,0.000104734674,0.00014368724,0.008763399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994215,0.00024412318,0.000034263492,0.00011912782,0.00013022014,0.000050764214],"domain_scores_gemma":[0.998445,0.0009021113,0.00008857007,0.00029992402,0.00013980803,0.00012459284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786034,0.00044323134,0.0003657373,0.00029977548,0.0003900206,0.0009441922,0.0011576749,0.0005596645,0.00500068],"category_scores_gemma":[0.0051260237,0.00037640746,0.00040071268,0.00024959492,0.0011094967,0.0016495662,0.0012443792,0.0013820996,0.0005015446],"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.0003639298,0.0003803184,0.002313068,0.00019935964,0.000107696615,0.00036414195,0.0008205376,0.39947772,0.014819763,0.41544718,0.005504163,0.16020222],"study_design_scores_gemma":[0.00002998577,0.000043492117,0.00015208032,0.000009050589,0.00001149807,0.000049198592,0.000028035212,0.8831071,0.0017240117,0.11179286,0.0030408103,0.000011746125],"about_ca_topic_score_codex":0.0016583329,"about_ca_topic_score_gemma":0.0017524569,"teacher_disagreement_score":0.00500068,"about_ca_system_score_codex":0.00043960946,"about_ca_system_score_gemma":0.0005844488,"threshold_uncertainty_score":0.016728938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8267467,0.0011423287,0.07236032,0.0057112547,0.000147379,0.00026785312,0.0019928678,0.00037544602,0.09125582],"genre_scores_gemma":[0.9564641,0.00051536795,0.029337324,0.0002376688,0.00011051108,0.00021904077,0.0020944586,0.00016771775,0.010853853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990964,0.00024404284,0.00003909149,0.00017817577,0.00024553834,0.0001967914],"domain_scores_gemma":[0.9952958,0.0035934157,0.0003652217,0.00027516318,0.00018586309,0.0002845019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965054,0.00087977434,0.0008565219,0.00091911876,0.0011583345,0.0035407518,0.0018706786,0.0015347463,0.011546465],"category_scores_gemma":[0.01057414,0.00055745884,0.0012836643,0.0008463089,0.0019939258,0.0047284546,0.00209004,0.0026020922,0.00070737774],"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.0012858317,0.00038724949,0.0061246827,0.0007329275,0.0002406049,0.0006155266,0.001405309,0.26666382,0.005196848,0.63611424,0.029303871,0.05192904],"study_design_scores_gemma":[0.00020295718,0.000073273986,0.0023588508,0.00004442631,0.00004399365,0.00023972885,0.0003384386,0.41441545,0.0015316703,0.5744863,0.0062206318,0.000044290686],"about_ca_topic_score_codex":0.006054457,"about_ca_topic_score_gemma":0.0047847563,"teacher_disagreement_score":0.011546465,"about_ca_system_score_codex":0.002166468,"about_ca_system_score_gemma":0.0012529936,"threshold_uncertainty_score":0.03862679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37771228,0.00094877667,0.424245,0.002429614,0.00046308152,0.0004346404,0.00064948044,0.00030693508,0.19281027],"genre_scores_gemma":[0.9176919,0.0005531814,0.05111655,0.00052900845,0.00012538346,0.00029393702,0.00042794127,0.00008713757,0.029174931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881834,0.00048486024,0.000050476734,0.00020221449,0.0001825807,0.00026155848],"domain_scores_gemma":[0.9987845,0.0005919986,0.00014496334,0.00014175511,0.00008151583,0.0002551424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000809798,0.0011369718,0.000755003,0.00057976396,0.0011605225,0.00239735,0.0019908056,0.0017647302,0.0052799014],"category_scores_gemma":[0.0025699108,0.0003130044,0.0008339091,0.00060959044,0.002307996,0.0026866754,0.0025487742,0.0019867064,0.0007474732],"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.00012233574,0.00006806451,0.00035376742,0.000059476744,0.000023936085,0.0004018057,0.00020351961,0.013916215,0.0018424677,0.97560436,0.0013643146,0.006039724],"study_design_scores_gemma":[0.00011160731,0.000085672575,0.0001635432,0.000017661434,0.000028468725,0.00021970696,0.00013727175,0.052758284,0.0011130141,0.9376525,0.007690175,0.000022097563],"about_ca_topic_score_codex":0.0015521449,"about_ca_topic_score_gemma":0.0012588833,"teacher_disagreement_score":0.0052799014,"about_ca_system_score_codex":0.00094887806,"about_ca_system_score_gemma":0.0006727143,"threshold_uncertainty_score":0.017663002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110381424,0.0023333612,0.6828599,0.008309286,0.0002655293,0.00025623987,0.001534296,0.0010591596,0.19300081],"genre_scores_gemma":[0.83118504,0.0019164897,0.1274559,0.001351383,0.0004264007,0.0006205463,0.0025239708,0.00057592697,0.033944342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965983,0.0011769327,0.00025820418,0.00062045467,0.0008506437,0.00049554853],"domain_scores_gemma":[0.99292165,0.005128675,0.00028694715,0.0007738782,0.0005462761,0.0003426404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024659224,0.0011034486,0.0015512236,0.0017504543,0.00259981,0.0055683665,0.0032133656,0.0022399484,0.011368792],"category_scores_gemma":[0.0084173465,0.0011932418,0.002388944,0.003418374,0.0053245276,0.017188787,0.0042922758,0.010233629,0.0011978899],"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.000041972802,0.000037417853,0.000092449474,0.00007793116,0.00001506151,0.00002766666,0.0002895676,0.0050738105,0.00033578114,0.98557556,0.002407504,0.0060254023],"study_design_scores_gemma":[0.000015392188,0.0000071562094,0.000052021067,0.000009792608,0.000007327123,0.00002237121,0.00004940922,0.0062761777,0.00021401212,0.9915514,0.0017878339,0.000007098441],"about_ca_topic_score_codex":0.0034530936,"about_ca_topic_score_gemma":0.0032335368,"teacher_disagreement_score":0.011368792,"about_ca_system_score_codex":0.002530264,"about_ca_system_score_gemma":0.0015443292,"threshold_uncertainty_score":0.038032353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094905965,0.00011427014,0.89783925,0.0004514425,0.000028840146,0.00013785528,0.00010114855,0.0007589579,0.0056622303],"genre_scores_gemma":[0.90116334,0.000061377315,0.09577337,0.00017865167,0.000032502663,0.0001591835,0.00013637975,0.00009986065,0.0023951533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474394,0.0018496058,0.00031093555,0.0012929556,0.0012768507,0.00052562426],"domain_scores_gemma":[0.98019224,0.0138969505,0.002052857,0.0021850516,0.0010442617,0.00062857295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007844506,0.0016929335,0.0018260282,0.0008416842,0.00092750957,0.0021460413,0.0023974,0.0018671011,0.0021503116],"category_scores_gemma":[0.034548055,0.0007816535,0.0011740704,0.00041145372,0.0028599873,0.0036477093,0.003871972,0.0028245125,0.00058165437],"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.0017920826,0.00026296076,0.005518782,0.00030105817,0.00037177178,0.00048722775,0.0008780996,0.76570636,0.01931348,0.11382055,0.0019767005,0.08957088],"study_design_scores_gemma":[0.00004562322,0.00006590672,0.00032566662,0.000012448144,0.000019571955,0.000051973082,0.00003284952,0.9541054,0.0020633147,0.042963788,0.00029873013,0.000014756901],"about_ca_topic_score_codex":0.0019924983,"about_ca_topic_score_gemma":0.002185696,"teacher_disagreement_score":0.007844506,"about_ca_system_score_codex":0.0014900054,"about_ca_system_score_gemma":0.001431753,"threshold_uncertainty_score":0.041486204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028627533,0.000512472,0.9652584,0.0006507576,0.000037431284,0.00013422029,0.00005727699,0.00033445348,0.0043874704],"genre_scores_gemma":[0.65207744,0.00044360332,0.3421046,0.00048677356,0.00009078512,0.00051064097,0.00022427912,0.00020545514,0.003856385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954222,0.0029699777,0.00013228462,0.00049128634,0.00065264065,0.0003315508],"domain_scores_gemma":[0.9738057,0.023074044,0.0009784092,0.00096235255,0.00070235,0.0004771948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084569305,0.0014570209,0.0022045285,0.0010277032,0.000946396,0.0018697698,0.0024657995,0.0021837999,0.0024906478],"category_scores_gemma":[0.0333282,0.0011091976,0.0010225358,0.0010895706,0.0025913208,0.002970869,0.001961415,0.0028729718,0.00037875233],"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.0001658459,0.00008001228,0.0007058127,0.00007543502,0.0000640541,0.00005830212,0.00007754383,0.91417354,0.00029595275,0.06478119,0.0009325572,0.018589739],"study_design_scores_gemma":[0.000018153038,0.000017871296,0.00006158965,0.000009100055,0.0000064532132,0.000011131708,0.000005698244,0.9739135,0.00016501543,0.025599647,0.00018722964,0.00000458405],"about_ca_topic_score_codex":0.0064519374,"about_ca_topic_score_gemma":0.007292533,"teacher_disagreement_score":0.0084569305,"about_ca_system_score_codex":0.0026422183,"about_ca_system_score_gemma":0.003003319,"threshold_uncertainty_score":0.04472506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4529068,0.00037314335,0.5426035,0.00041377128,0.000026190533,0.00021895255,0.00022436108,0.0005703377,0.0026629337],"genre_scores_gemma":[0.9481729,0.00012510273,0.050944682,0.000047433667,0.000010215996,0.00010464423,0.00019554852,0.00003322963,0.00036637508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959785,0.0021499624,0.00022724236,0.0004859543,0.0008304304,0.00032796225],"domain_scores_gemma":[0.96545136,0.0291016,0.0021551172,0.0017362707,0.0007151715,0.0008405642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070308414,0.0015641035,0.0014021858,0.0014332522,0.0006112305,0.002201206,0.0010651523,0.0013216465,0.0013925438],"category_scores_gemma":[0.03619947,0.0008511571,0.0010627022,0.00081126235,0.0026493212,0.004252749,0.0026026098,0.00185552,0.00014641591],"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.0001030503,0.000051736504,0.0032931184,0.00004693926,0.00004803819,0.00004107467,0.00013402084,0.9760414,0.00031141055,0.012529833,0.0000930309,0.007306371],"study_design_scores_gemma":[0.000012916996,0.00005205043,0.00034280334,0.000011090983,0.000008688832,0.0000080645,0.00003166815,0.97396165,0.00030054647,0.025171176,0.00009250136,0.0000068102586],"about_ca_topic_score_codex":0.0048774653,"about_ca_topic_score_gemma":0.0052753775,"teacher_disagreement_score":0.0070308414,"about_ca_system_score_codex":0.002292077,"about_ca_system_score_gemma":0.0019377207,"threshold_uncertainty_score":0.037183106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06230725,0.0009904052,0.899461,0.001699641,0.000091779955,0.00014975588,0.00015403208,0.00025549319,0.034890596],"genre_scores_gemma":[0.8633416,0.0012562826,0.12367242,0.00065108394,0.00022760339,0.00035581147,0.00019400152,0.0001096207,0.010191585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724495,0.0011872445,0.00015201933,0.00031403065,0.00084706413,0.00025475572],"domain_scores_gemma":[0.9939711,0.004294812,0.00045870544,0.0005334235,0.00037594227,0.00036606655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028382933,0.0011997364,0.0011185863,0.0014791678,0.001565121,0.003007614,0.0012973443,0.0015684031,0.0042986814],"category_scores_gemma":[0.012846798,0.0006617082,0.0018818731,0.0010163607,0.006189824,0.0078116003,0.004165556,0.0048605343,0.0005739007],"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.00001133292,0.000008880265,0.00020368921,0.000038472936,0.000010939207,0.00010143376,0.00022959629,0.010763179,0.0003284762,0.984774,0.00046666295,0.003063271],"study_design_scores_gemma":[0.0000065074755,0.0000071357035,0.000051317376,0.00001004765,0.000004480087,0.000048930266,0.00003498403,0.023104902,0.000108840475,0.9752985,0.0013183176,0.0000060657558],"about_ca_topic_score_codex":0.0017005485,"about_ca_topic_score_gemma":0.0012607733,"teacher_disagreement_score":0.0042986814,"about_ca_system_score_codex":0.0020895705,"about_ca_system_score_gemma":0.0012014867,"threshold_uncertainty_score":0.015160978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021532038,0.0013953716,0.9594408,0.00057756266,0.00012130583,0.00007636135,0.00003513585,0.0005493908,0.016272029],"genre_scores_gemma":[0.7625882,0.0012091359,0.22927044,0.00032509438,0.00013204932,0.00036691112,0.00008285041,0.0001614613,0.00586383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987207,0.0004943867,0.000058811387,0.00024592958,0.0003553396,0.00012477995],"domain_scores_gemma":[0.9960867,0.002785562,0.0003242839,0.00040036577,0.00029528525,0.00010774352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019906652,0.0008131384,0.0007367433,0.0006983082,0.00047445451,0.0017598841,0.0015614154,0.0011229492,0.0034524372],"category_scores_gemma":[0.009126629,0.000543997,0.00044543896,0.0008389702,0.0031927652,0.0025729316,0.0013434516,0.001477891,0.00041495488],"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.00014014261,0.00008202504,0.00033649965,0.00018091855,0.000037802383,0.00009041041,0.00013575538,0.74125946,0.001836428,0.18540332,0.0013026608,0.06919452],"study_design_scores_gemma":[0.00005233318,0.00004732352,0.000083509025,0.000018803954,0.000010645533,0.000029745666,0.000022222728,0.9146658,0.0007984615,0.080444194,0.0038149087,0.0000119341485],"about_ca_topic_score_codex":0.004558701,"about_ca_topic_score_gemma":0.002517963,"teacher_disagreement_score":0.004558701,"about_ca_system_score_codex":0.0018039098,"about_ca_system_score_gemma":0.001408303,"threshold_uncertainty_score":0.013088286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07537016,0.00016069761,0.91325206,0.00019764523,0.00006836053,0.00019084333,0.00007414425,0.0011859912,0.009500208],"genre_scores_gemma":[0.57901686,0.00009879831,0.416636,0.00004795093,0.000019969943,0.00021591557,0.00014446603,0.00008130307,0.0037387982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959105,0.00013255618,0.00002042052,0.000087239765,0.00011224124,0.000056564044],"domain_scores_gemma":[0.999428,0.00024234236,0.00004892199,0.00010006132,0.00009266214,0.000087895896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062952307,0.00046879658,0.0007258955,0.00042275366,0.00057195587,0.0008091173,0.0011501181,0.0004812578,0.002472764],"category_scores_gemma":[0.0017174607,0.00025874027,0.0004307566,0.0007081716,0.00052619586,0.00087839976,0.0009989743,0.0004745373,0.00046066628],"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.00064949226,0.00036468534,0.0015849174,0.00013484972,0.00006758229,0.00023261642,0.00030506655,0.67253757,0.016870745,0.050751545,0.004991039,0.25150988],"study_design_scores_gemma":[0.000087777604,0.00009794606,0.00014036322,0.000003019196,0.000009821342,0.00004333607,0.000030449846,0.98377925,0.0020643857,0.011683791,0.0020528869,0.0000070745605],"about_ca_topic_score_codex":0.004471406,"about_ca_topic_score_gemma":0.0052053467,"teacher_disagreement_score":0.004471406,"about_ca_system_score_codex":0.00081622927,"about_ca_system_score_gemma":0.0015971602,"threshold_uncertainty_score":0.008890748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052962918,0.00042393774,0.88282317,0.0015886079,0.00008740585,0.00016208684,0.0005324023,0.000511436,0.06090805],"genre_scores_gemma":[0.6713321,0.0011035525,0.28648677,0.00046801294,0.00012057511,0.0003683885,0.0008799135,0.00032888635,0.03891174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993236,0.00016066464,0.00005191516,0.00017660222,0.000167188,0.00012004204],"domain_scores_gemma":[0.99898547,0.00046900308,0.0001742833,0.00016800973,0.00010529685,0.00009800425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048954086,0.0006338599,0.0006472681,0.0007631625,0.00080671295,0.0020317372,0.0015224614,0.0019333232,0.013818661],"category_scores_gemma":[0.0036392047,0.00032479703,0.00090557983,0.0011449242,0.0019871113,0.007741136,0.0017501245,0.0018243636,0.0012567658],"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.00004906943,0.000027272054,0.00031167874,0.00011643041,0.000008444219,0.00022503072,0.00027936892,0.02529854,0.002240081,0.9491291,0.0033855955,0.01892938],"study_design_scores_gemma":[0.00004648189,0.00012935461,0.00037825512,0.000058839585,0.000019808116,0.0006252243,0.00040108376,0.19542226,0.0033719656,0.7649857,0.034520913,0.000040171595],"about_ca_topic_score_codex":0.0017336633,"about_ca_topic_score_gemma":0.001310481,"teacher_disagreement_score":0.013818661,"about_ca_system_score_codex":0.00071889383,"about_ca_system_score_gemma":0.00057786616,"threshold_uncertainty_score":0.04622799},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010696381,0.0032256779,0.00048350435,0.12390209,0.8568751,0.00004046348,0.0013418206,0.00020287538,0.0128587345],"genre_scores_gemma":[0.035502844,0.016528117,0.0038681924,0.16347663,0.28780922,0.00027517113,0.0032260215,0.0009556741,0.48835814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981963,0.00020029877,0.00036786395,0.00020934193,0.00085312396,0.00017322383],"domain_scores_gemma":[0.98639464,0.0045184083,0.0006641627,0.00045287036,0.007448754,0.00052112923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531978,0.0011657792,0.0012247447,0.0020587456,0.0036489433,0.002772766,0.0022025127,0.0068993573,0.039758507],"category_scores_gemma":[0.027677143,0.00057976897,0.0007573893,0.001658497,0.0018003911,0.0017784289,0.0013676449,0.0078101372,0.018221641],"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.000041234067,0.000010809685,0.0000871892,0.000060178816,0.0000034523018,0.00016444374,0.000040873558,0.000023522487,0.000024794566,0.0009005129,0.9933021,0.005340978],"study_design_scores_gemma":[0.00004673615,0.00007936141,0.0030779464,0.00061315246,0.000055284014,0.0005941339,0.00068784686,0.00035374027,0.0005139729,0.0026383083,0.9912717,0.00006773861],"about_ca_topic_score_codex":0.034894284,"about_ca_topic_score_gemma":0.042892132,"teacher_disagreement_score":0.039758507,"about_ca_system_score_codex":0.0036221535,"about_ca_system_score_gemma":0.0050473106,"threshold_uncertainty_score":0.13300544},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74031013,0.00012106391,0.24666162,0.00030851926,0.00005775732,0.00024739254,0.00004000275,0.0003097661,0.011943834],"genre_scores_gemma":[0.8919449,0.00006153864,0.10257609,0.000090658024,0.000007816339,0.0001705632,0.000060196217,0.000024326715,0.0050638556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978715,0.000065220505,0.000013786965,0.000042898188,0.000057201756,0.00003369896],"domain_scores_gemma":[0.9989761,0.00049032306,0.00014044034,0.00013514029,0.0001537388,0.00010431704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088274095,0.00046537496,0.00042614003,0.00042721888,0.0005055377,0.00076722295,0.0009414165,0.0008537279,0.0017721588],"category_scores_gemma":[0.003387603,0.00028237415,0.0002736794,0.00021644002,0.00070439896,0.0010384505,0.00094458886,0.00074199395,0.0002192436],"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.00022162366,0.00035510107,0.008406633,0.000055343175,0.00011674915,0.0003369902,0.0003984186,0.89990604,0.0069213985,0.020494835,0.00085325254,0.061933666],"study_design_scores_gemma":[0.00002639707,0.00009937176,0.00043832796,0.000007432029,0.0000147518385,0.00005342744,0.000050409515,0.9937084,0.0020301496,0.0024960472,0.0010657009,0.0000095814885],"about_ca_topic_score_codex":0.00191558,"about_ca_topic_score_gemma":0.003202899,"teacher_disagreement_score":0.00191558,"about_ca_system_score_codex":0.0006813042,"about_ca_system_score_gemma":0.0005337114,"threshold_uncertainty_score":0.005928457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5851515,0.001238837,0.31069314,0.0021828068,0.00024205765,0.00277878,0.00030943114,0.0004758177,0.09692762],"genre_scores_gemma":[0.7477364,0.00060125545,0.24891384,0.0003006859,0.000036937203,0.00047202373,0.00020906483,0.000043058455,0.001686758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9670496,0.025597908,0.001237324,0.0013590712,0.004156524,0.0005996306],"domain_scores_gemma":[0.6254152,0.36069834,0.0039070575,0.0053144614,0.003898181,0.000766689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029472964,0.0013172884,0.0006963192,0.0031185285,0.0015995122,0.004342615,0.0034216552,0.0028711217,0.005422796],"category_scores_gemma":[0.18479364,0.00068538287,0.0012126635,0.002428004,0.0026525739,0.005560174,0.0031220466,0.0023021793,0.0005835284],"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.0045297774,0.007907853,0.03745335,0.0028107015,0.0010681933,0.0013000978,0.015690327,0.36004722,0.0070027346,0.16763811,0.0027642625,0.39178732],"study_design_scores_gemma":[0.0009537855,0.0036428196,0.009839365,0.0007118581,0.00054995256,0.0007979301,0.007437102,0.8660171,0.009103905,0.08525524,0.015473981,0.00021696693],"about_ca_topic_score_codex":0.013533855,"about_ca_topic_score_gemma":0.010557171,"teacher_disagreement_score":0.029472964,"about_ca_system_score_codex":0.0027867707,"about_ca_system_score_gemma":0.0020148223,"threshold_uncertainty_score":0.15586978},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055602316,0.00046788898,0.24693893,0.004546671,0.0005107788,0.00018058831,0.0003710984,0.0006927823,0.69068885],"genre_scores_gemma":[0.7984808,0.0002679606,0.079571865,0.0013967174,0.00012461195,0.00033142598,0.00032434647,0.0002482036,0.11925411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835,0.00086472806,0.000044666216,0.00022471078,0.00025248775,0.00026332456],"domain_scores_gemma":[0.99930215,0.0002534362,0.000036672973,0.00014462452,0.00007967297,0.00018333443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158313,0.00066016207,0.00057963823,0.00038807976,0.004205813,0.0037283944,0.0015899197,0.0018467025,0.016980374],"category_scores_gemma":[0.003410903,0.0003389872,0.00078459526,0.0004194587,0.0037366413,0.006200925,0.004146163,0.0021914304,0.0026281455],"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.00006814825,0.000016270278,0.000099412275,0.000019513052,0.0000053848266,0.00005004797,0.00039277147,0.0009558334,0.00025639802,0.98967415,0.0038592708,0.0046027447],"study_design_scores_gemma":[0.000034764536,0.0000394928,0.0001501512,0.00003468469,0.000008938563,0.00011369973,0.000577758,0.012169652,0.0006273834,0.9089849,0.07723676,0.000021815216],"about_ca_topic_score_codex":0.0025521212,"about_ca_topic_score_gemma":0.0046894457,"teacher_disagreement_score":0.016980374,"about_ca_system_score_codex":0.0014877787,"about_ca_system_score_gemma":0.0011262429,"threshold_uncertainty_score":0.056805015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8184899,0.005717299,0.07134001,0.00314433,0.00073282304,0.0006310637,0.002815016,0.0010424404,0.096087165],"genre_scores_gemma":[0.90782225,0.0006809302,0.081859455,0.00032229992,0.00014568151,0.00044022728,0.0019997025,0.00046356829,0.0062659234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917681,0.006342492,0.00040960792,0.0006166281,0.0005355481,0.00032750622],"domain_scores_gemma":[0.77274513,0.21139199,0.0020824645,0.010315473,0.0025379595,0.0009270318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011711683,0.0016651968,0.0016613504,0.0019115647,0.0013390561,0.0021540257,0.0035648833,0.002916299,0.01593899],"category_scores_gemma":[0.08816391,0.0008968932,0.0014213482,0.002655785,0.0023937125,0.005925876,0.0016618131,0.0033222493,0.0017767695],"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.014717562,0.010914517,0.008555588,0.0037098497,0.0012117225,0.00033896964,0.0023413165,0.51121604,0.002046039,0.1715378,0.051496122,0.22191449],"study_design_scores_gemma":[0.0038844799,0.002665856,0.0036393583,0.000378594,0.00050882297,0.00023465138,0.0011459489,0.79637426,0.0032835181,0.17504361,0.012671355,0.00016957149],"about_ca_topic_score_codex":0.00377411,"about_ca_topic_score_gemma":0.0053433245,"teacher_disagreement_score":0.01593899,"about_ca_system_score_codex":0.0020970271,"about_ca_system_score_gemma":0.0010562812,"threshold_uncertainty_score":0.061938047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7845975,0.00042675048,0.09479722,0.0006638315,0.00042087885,0.00024273458,0.00018691969,0.0008447275,0.11781945],"genre_scores_gemma":[0.9794937,0.00006751769,0.011551462,0.000076235025,0.000030808493,0.0000649263,0.00008073739,0.00011351146,0.0085210875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.00045347537,0.00003056573,0.00012275619,0.00019408102,0.00020679903],"domain_scores_gemma":[0.9965767,0.002234658,0.00028418616,0.00028487135,0.00017422589,0.00044524565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121865,0.00057862647,0.0005090888,0.0003805027,0.000838893,0.0019524058,0.0013357862,0.0006734934,0.013497616],"category_scores_gemma":[0.0067989933,0.000369784,0.00030383657,0.00047932076,0.0007409733,0.0012144512,0.0011703668,0.001274137,0.0007752126],"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.006594396,0.0026898594,0.007330343,0.0004932904,0.00034659822,0.00065754936,0.0022944917,0.18511325,0.042356353,0.4661966,0.027492588,0.25843474],"study_design_scores_gemma":[0.0011672749,0.001482768,0.008867042,0.00009559123,0.00021761443,0.0002294462,0.0013529736,0.59631854,0.0122450255,0.34041983,0.037462197,0.00014167945],"about_ca_topic_score_codex":0.0014061702,"about_ca_topic_score_gemma":0.003909398,"teacher_disagreement_score":0.013497616,"about_ca_system_score_codex":0.000696846,"about_ca_system_score_gemma":0.0004619567,"threshold_uncertainty_score":0.045154035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6788689,0.00081855233,0.20525753,0.00033408336,0.0000652594,0.00016797612,0.00026949687,0.00025745446,0.113960706],"genre_scores_gemma":[0.9747813,0.00016942863,0.016954703,0.000053492968,0.000035785135,0.00009454969,0.00020584658,0.000032316937,0.007672671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840003,0.00048172646,0.00015194075,0.00033472053,0.00036540066,0.00026615718],"domain_scores_gemma":[0.9983406,0.00073027983,0.00019552447,0.00033585556,0.00017738492,0.00022032039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009458989,0.00042731012,0.00070248294,0.0012661405,0.0015769257,0.003081037,0.00078783074,0.0005060927,0.003629785],"category_scores_gemma":[0.0030646154,0.00046855622,0.001107512,0.0004528556,0.003179396,0.0032905655,0.0021368677,0.0013310164,0.00033293356],"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.000049940973,0.000020123072,0.0005882097,0.00002713271,0.000009666931,0.0000975072,0.00080201926,0.0020194955,0.0009241372,0.9922218,0.00012775903,0.0031122407],"study_design_scores_gemma":[0.000052776428,0.00006742719,0.0018409394,0.00003454435,0.000042711537,0.00024761667,0.0007042701,0.027979614,0.0028757313,0.9563379,0.009766103,0.000050358463],"about_ca_topic_score_codex":0.0026761757,"about_ca_topic_score_gemma":0.0019017707,"teacher_disagreement_score":0.003629785,"about_ca_system_score_codex":0.0012692382,"about_ca_system_score_gemma":0.00049515325,"threshold_uncertainty_score":0.012142777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08298684,0.00021634385,0.90774816,0.00031291824,0.00004722192,0.00027572465,0.00004821859,0.00086726324,0.007497307],"genre_scores_gemma":[0.43852937,0.00021973054,0.55440944,0.00018786681,0.000034277327,0.00067864807,0.00019062521,0.0001330451,0.0056169857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956304,0.00012182667,0.00003751093,0.00010045876,0.000115531104,0.00006149759],"domain_scores_gemma":[0.9985801,0.00083523366,0.0001822818,0.00012237704,0.000185315,0.0000946825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014873382,0.0010785778,0.0007489481,0.00083608757,0.0008537548,0.0010275934,0.0023117936,0.0019161946,0.003282919],"category_scores_gemma":[0.0049856137,0.0005103759,0.00045144875,0.00055559905,0.0009869947,0.0013821857,0.0012937523,0.0010047436,0.0005135777],"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.000106612766,0.00019729743,0.0026694608,0.00007152976,0.000071088536,0.00010477677,0.00029234585,0.84762764,0.0019500919,0.020326793,0.001341433,0.12524097],"study_design_scores_gemma":[0.00003689553,0.000034649896,0.0001270935,0.0000066058064,0.000013043149,0.000030733845,0.000028432538,0.99477357,0.00063000177,0.0035032874,0.00080939545,0.0000062995487],"about_ca_topic_score_codex":0.004325427,"about_ca_topic_score_gemma":0.0057738787,"teacher_disagreement_score":0.004325427,"about_ca_system_score_codex":0.0012929117,"about_ca_system_score_gemma":0.000982766,"threshold_uncertainty_score":0.010982394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08358241,0.00064033014,0.8199972,0.0006358999,0.0009825492,0.0010358688,0.0008169353,0.020644234,0.07166464],"genre_scores_gemma":[0.4466265,0.00030850974,0.49035037,0.00044307462,0.00011560221,0.00046260224,0.0009390586,0.000866279,0.059887942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999871,0.00002058941,0.0000062201702,0.0000325799,0.000049563136,0.00001995794],"domain_scores_gemma":[0.99988735,0.000032794214,0.0000071806394,0.000018065248,0.000032187745,0.000022503951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016453228,0.0005141542,0.00028178896,0.00042492713,0.00033522514,0.00047052786,0.0008703881,0.0004577702,0.021350842],"category_scores_gemma":[0.00045062564,0.00023687928,0.0002384985,0.00022672494,0.00025459757,0.00050138525,0.0003879122,0.0005275121,0.0034592177],"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.0017675257,0.00031178579,0.0017157494,0.0006803445,0.00009505175,0.0015026742,0.00029710232,0.024927035,0.21717276,0.08640489,0.03811146,0.6270136],"study_design_scores_gemma":[0.0013803005,0.003048119,0.0048202747,0.00017671881,0.00019639429,0.004350333,0.00013832231,0.43634903,0.21577059,0.03130642,0.30226195,0.00020147066],"about_ca_topic_score_codex":0.00063020317,"about_ca_topic_score_gemma":0.001133252,"teacher_disagreement_score":0.021350842,"about_ca_system_score_codex":0.0003388376,"about_ca_system_score_gemma":0.00029288293,"threshold_uncertainty_score":0.07142562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30384707,0.0011113837,0.6210206,0.0014890383,0.00027578243,0.00025073017,0.00033194153,0.00029500722,0.07137837],"genre_scores_gemma":[0.9040642,0.0008838216,0.06935194,0.00031148814,0.00018843336,0.00040611767,0.00024931793,0.00022731438,0.024317546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975019,0.0010095531,0.00009132977,0.00042855213,0.000457893,0.0005107508],"domain_scores_gemma":[0.99491465,0.00267664,0.00072964124,0.00055120396,0.0002803339,0.00084743765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017698945,0.0011186858,0.0016084985,0.0012797401,0.0019275986,0.0030254938,0.0019320181,0.0016883349,0.009068692],"category_scores_gemma":[0.010257748,0.0007085371,0.0010730819,0.0011297674,0.0042474237,0.007619324,0.0035771024,0.0024181285,0.0010498991],"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.00012724678,0.00003386286,0.00027539252,0.000072442555,0.00002176477,0.00016574678,0.00016622039,0.060681086,0.0010353752,0.93155706,0.001562945,0.0043008095],"study_design_scores_gemma":[0.000040716146,0.000055718807,0.0001924253,0.000028960867,0.000011390623,0.00011402823,0.00016851284,0.22370873,0.00089284696,0.77057284,0.0041872025,0.000026524762],"about_ca_topic_score_codex":0.0014355875,"about_ca_topic_score_gemma":0.0011661513,"teacher_disagreement_score":0.009068692,"about_ca_system_score_codex":0.0016973934,"about_ca_system_score_gemma":0.00075901934,"threshold_uncertainty_score":0.03033781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00898476,0.00005564784,0.9796913,0.00007123551,0.000030441535,0.00017473179,0.00039191457,0.0046037077,0.005996227],"genre_scores_gemma":[0.12644094,0.00014466792,0.86571074,0.000071996976,0.0000105205545,0.00043275006,0.0018157872,0.0016605491,0.0037120185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.00019801204,0.00004261448,0.00009753454,0.00031924335,0.00004606217],"domain_scores_gemma":[0.998638,0.0006374885,0.000099943994,0.00027881886,0.000293432,0.000052255735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053450075,0.0013961949,0.0005101422,0.0011729096,0.00041242797,0.0017578279,0.0010261768,0.00075809803,0.0149331065],"category_scores_gemma":[0.003849654,0.00078798947,0.0008041553,0.00062647415,0.00055509544,0.0008189642,0.0014053689,0.0012002758,0.0027899686],"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.00024452055,0.00015796047,0.0025284858,0.0011402856,0.00006305624,0.0007116153,0.0008449304,0.4974692,0.049677968,0.089005925,0.021888522,0.3362675],"study_design_scores_gemma":[0.0000618366,0.00011925001,0.0005367825,0.000104345745,0.000025592613,0.00021921704,0.00018539229,0.90023756,0.020238142,0.026420308,0.051810138,0.00004154967],"about_ca_topic_score_codex":0.0018913993,"about_ca_topic_score_gemma":0.003546483,"teacher_disagreement_score":0.0149331065,"about_ca_system_score_codex":0.000664025,"about_ca_system_score_gemma":0.000986924,"threshold_uncertainty_score":0.049956203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02946736,0.00003777547,0.9644485,0.000119014665,0.000024126919,0.00013109256,0.000029976303,0.002669294,0.0030728688],"genre_scores_gemma":[0.3541718,0.00003773828,0.6423038,0.00005969523,0.000023359114,0.00014690816,0.000105905245,0.00039097358,0.0027597817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971667,0.001057287,0.00013203507,0.00040218377,0.0010752486,0.0001666093],"domain_scores_gemma":[0.9947054,0.002399917,0.00061220065,0.001395754,0.0006486163,0.00023806252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025868951,0.00065901387,0.0010718702,0.00089076214,0.0009001276,0.0011537228,0.0015465167,0.0009698522,0.0036996554],"category_scores_gemma":[0.013251933,0.00051928236,0.0006273097,0.0005921467,0.0016217567,0.0021435705,0.0021732727,0.0017434832,0.0009889572],"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.00044227816,0.00029560327,0.008875583,0.00009951348,0.00007803763,0.00031899847,0.0007715359,0.26600233,0.023129694,0.05224216,0.0047647543,0.6429795],"study_design_scores_gemma":[0.000042260715,0.00016609958,0.00090079574,0.000011990597,0.000015296913,0.00021501341,0.00003856456,0.9761839,0.0065878485,0.012481817,0.0033275993,0.000028730556],"about_ca_topic_score_codex":0.0033407947,"about_ca_topic_score_gemma":0.004222646,"teacher_disagreement_score":0.0036996554,"about_ca_system_score_codex":0.00086583995,"about_ca_system_score_gemma":0.0018026179,"threshold_uncertainty_score":0.0136809945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08157592,0.00027116534,0.8699428,0.002296898,0.00017812669,0.0014628462,0.0003890726,0.009902389,0.0339807],"genre_scores_gemma":[0.22387646,0.00016043866,0.76643395,0.00029697156,0.00003131735,0.00020241372,0.00074748154,0.00037043676,0.007880581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929067,0.002058301,0.00047951288,0.0012019251,0.0029703227,0.00038324448],"domain_scores_gemma":[0.9788905,0.012262823,0.0010497919,0.0042908248,0.0028787476,0.0006274012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009149396,0.0013262932,0.0009301609,0.0043227747,0.0017556672,0.0036244704,0.0049705207,0.0024936527,0.012818221],"category_scores_gemma":[0.030944027,0.0010573309,0.0011572477,0.0013771954,0.0026488411,0.0060029896,0.0046974113,0.0028997809,0.0024733113],"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.0007534063,0.0029962042,0.010820562,0.0004903476,0.00018676733,0.0018808492,0.0030835322,0.22657561,0.014638907,0.095192485,0.017105618,0.6262758],"study_design_scores_gemma":[0.00021180313,0.00032957987,0.0012792046,0.00019596415,0.000109902765,0.0008823692,0.000599791,0.9157902,0.008028625,0.025067367,0.047404397,0.00010073431],"about_ca_topic_score_codex":0.011547205,"about_ca_topic_score_gemma":0.016538357,"teacher_disagreement_score":0.012818221,"about_ca_system_score_codex":0.002593977,"about_ca_system_score_gemma":0.003887849,"threshold_uncertainty_score":0.04838723},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010079317,0.6710196,0.1869106,0.026348254,0.0021818914,0.00023448527,0.0001904293,0.00069522683,0.102340214],"genre_scores_gemma":[0.22508352,0.61442375,0.13473271,0.0049554105,0.00569969,0.0005742637,0.00046512255,0.0004303757,0.013635238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501437,0.001956726,0.0004452065,0.0008701056,0.001323641,0.0003900184],"domain_scores_gemma":[0.9891599,0.0085481005,0.0003481294,0.0005580465,0.0008217183,0.0005641257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057073953,0.001853032,0.002136274,0.003684774,0.0018145744,0.009798655,0.0036176338,0.005045352,0.0063150525],"category_scores_gemma":[0.011682545,0.0012935959,0.0010351499,0.0052809655,0.010017688,0.017345453,0.003582591,0.0077160546,0.002493968],"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.00018063464,0.00032133659,0.0018400283,0.003632342,0.000084964595,0.00026067364,0.0018065869,0.0068773627,0.00051817513,0.57435185,0.026918408,0.38320768],"study_design_scores_gemma":[0.00004180997,0.00015883046,0.0018507055,0.0019378132,0.000044054803,0.0013817042,0.0022997865,0.016369533,0.00044919187,0.746024,0.22934745,0.00009520784],"about_ca_topic_score_codex":0.00381919,"about_ca_topic_score_gemma":0.0025613105,"teacher_disagreement_score":0.009798655,"about_ca_system_score_codex":0.0034922843,"about_ca_system_score_gemma":0.00238503,"threshold_uncertainty_score":0.03018397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067506135,0.000054808475,0.90435296,0.000076565,0.000025799873,0.00073520734,0.00054588553,0.022080744,0.004621816],"genre_scores_gemma":[0.4712799,0.000041678875,0.522286,0.00006320021,0.000013575045,0.0005438945,0.0010788679,0.000827587,0.0038652718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983442,0.0006909305,0.00010778234,0.00025885,0.0004889297,0.0001093509],"domain_scores_gemma":[0.9952099,0.0028602758,0.0002120999,0.0007411367,0.00075651624,0.00022006324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017863085,0.0010142007,0.00080425834,0.0011100422,0.00036645884,0.0010568067,0.0015248343,0.0007937786,0.009942636],"category_scores_gemma":[0.0104563935,0.00043015365,0.0005412238,0.0005085485,0.0003567893,0.0011481795,0.0012922931,0.00062017667,0.0021959404],"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.002522892,0.0010990605,0.011111471,0.000656866,0.00015186645,0.00064290536,0.00143546,0.045504086,0.08637634,0.013814945,0.014520526,0.8221636],"study_design_scores_gemma":[0.00021813462,0.00026078432,0.003743785,0.000028162825,0.00004503897,0.00024071983,0.0001993503,0.949508,0.030951638,0.007566095,0.007163872,0.00007443197],"about_ca_topic_score_codex":0.0017931081,"about_ca_topic_score_gemma":0.003794124,"teacher_disagreement_score":0.009942636,"about_ca_system_score_codex":0.0005349503,"about_ca_system_score_gemma":0.00053916656,"threshold_uncertainty_score":0.03326136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32065415,0.00032945842,0.62066096,0.0012943863,0.00054708053,0.00031596565,0.000791129,0.0011278378,0.054279055],"genre_scores_gemma":[0.92596644,0.000081948805,0.05985608,0.00012332712,0.000027840464,0.000114505034,0.0003263298,0.00013034976,0.01337317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832696,0.00064040447,0.00007395101,0.00028881262,0.00037904084,0.00029084858],"domain_scores_gemma":[0.9965121,0.0017122104,0.00017872447,0.00079157646,0.00041303562,0.00039242834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011927503,0.00063552096,0.0014485002,0.00048095462,0.0012402211,0.001603125,0.002453412,0.0021709402,0.0108011635],"category_scores_gemma":[0.01117947,0.0003756169,0.00078036863,0.00046993548,0.0014888544,0.0025676738,0.0030657111,0.0014679709,0.0012882444],"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.004094829,0.00022578686,0.0017526497,0.00034709316,0.00023393678,0.0012046325,0.0009595731,0.4432998,0.0107934605,0.45450526,0.011405582,0.07117741],"study_design_scores_gemma":[0.00014656628,0.0002139904,0.00024727106,0.00002590841,0.000028890132,0.00023883735,0.00021554287,0.83659077,0.0028276474,0.15473346,0.004685907,0.00004523987],"about_ca_topic_score_codex":0.004681276,"about_ca_topic_score_gemma":0.0036416848,"teacher_disagreement_score":0.0108011635,"about_ca_system_score_codex":0.000947364,"about_ca_system_score_gemma":0.0015300317,"threshold_uncertainty_score":0.036133528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008306877,0.0004523591,0.98807484,0.0002682353,0.00003779564,0.000047876863,0.000031637614,0.0002174802,0.0025628523],"genre_scores_gemma":[0.57819176,0.0007966943,0.41570956,0.00040445724,0.00014707807,0.00042441543,0.00017220575,0.00034617272,0.0038076076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494225,0.0029767517,0.00018368186,0.00043849947,0.0011929226,0.00026583706],"domain_scores_gemma":[0.9813706,0.015617802,0.0008271809,0.0011077859,0.00082757545,0.0002489614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006851463,0.0009785631,0.0017373502,0.0011616374,0.00082698814,0.0013473096,0.0017562355,0.0016855123,0.0025492145],"category_scores_gemma":[0.030943282,0.00072933163,0.0011305527,0.0012023029,0.002793764,0.0021662258,0.0028684852,0.0028502797,0.0004286248],"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.00011790584,0.0000510871,0.0008055093,0.00014210634,0.00008409563,0.0000794516,0.00014642933,0.7749545,0.0009944895,0.1854046,0.0013557534,0.035864044],"study_design_scores_gemma":[0.000019825762,0.00003742101,0.00009130293,0.000021233578,0.000012199793,0.000022389666,0.000008116636,0.9207962,0.000402766,0.07786545,0.0007136165,0.000009538231],"about_ca_topic_score_codex":0.002732596,"about_ca_topic_score_gemma":0.0024887163,"teacher_disagreement_score":0.006851463,"about_ca_system_score_codex":0.0015825635,"about_ca_system_score_gemma":0.0019679759,"threshold_uncertainty_score":0.03623444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12361947,0.00046823162,0.85933566,0.00044263457,0.00003490841,0.00012486028,0.00002589111,0.00032595164,0.015622361],"genre_scores_gemma":[0.76128936,0.00043216802,0.23316856,0.0001656915,0.00006107932,0.00016183552,0.000051315183,0.00009621671,0.004573718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982339,0.00080954266,0.00008647862,0.00026092996,0.00040142896,0.00020772482],"domain_scores_gemma":[0.9929007,0.005437972,0.00043082665,0.0005986032,0.00027523894,0.00035668022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022014533,0.0009287489,0.00073697296,0.00085774617,0.0010605172,0.001373144,0.0012417785,0.001237252,0.0030727102],"category_scores_gemma":[0.01214741,0.00053765473,0.0007044439,0.00076064083,0.0034417016,0.0039656665,0.0031056805,0.0023403696,0.0003398476],"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.00041043104,0.00028379477,0.0025315662,0.00020654664,0.00007354575,0.00034509838,0.002380106,0.43096226,0.009686051,0.4134357,0.0016465661,0.13803838],"study_design_scores_gemma":[0.000053706302,0.0002369012,0.00059564423,0.000036495825,0.000024085832,0.00010369512,0.00021243928,0.740803,0.0027545185,0.2514042,0.0037436518,0.000031716016],"about_ca_topic_score_codex":0.0022512302,"about_ca_topic_score_gemma":0.002027943,"teacher_disagreement_score":0.0030727102,"about_ca_system_score_codex":0.00096555805,"about_ca_system_score_gemma":0.00063922466,"threshold_uncertainty_score":0.011642516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045108847,0.000070916954,0.9502834,0.00030798043,0.00001982831,0.00008545574,0.000056390436,0.00025655763,0.0038105806],"genre_scores_gemma":[0.76652503,0.00019348622,0.22595985,0.00018727306,0.000057906756,0.0005543096,0.0001826084,0.00011909432,0.006220433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974062,0.0013232619,0.000156684,0.00042129224,0.0005295636,0.00016299864],"domain_scores_gemma":[0.9931854,0.005382063,0.00046237576,0.00049485615,0.00024392603,0.00023140549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030578778,0.00095777615,0.0011065508,0.0006763074,0.0007043154,0.0016583762,0.0012012126,0.0012217846,0.0038536715],"category_scores_gemma":[0.01327538,0.000777997,0.0011821965,0.00076067564,0.003659871,0.004750364,0.0029351264,0.0019850575,0.00042993535],"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.00010952325,0.00008078049,0.00047178083,0.000098988676,0.000034561363,0.0002992766,0.00045873589,0.4825469,0.0012615485,0.49678847,0.0005963573,0.017253136],"study_design_scores_gemma":[0.000028189443,0.0000362334,0.00009337933,0.000008434185,0.000007314404,0.000032954944,0.00003907902,0.6377247,0.0004271914,0.3609839,0.0006082115,0.00001050291],"about_ca_topic_score_codex":0.0015773847,"about_ca_topic_score_gemma":0.0012804345,"teacher_disagreement_score":0.0038536715,"about_ca_system_score_codex":0.0015527309,"about_ca_system_score_gemma":0.0010292624,"threshold_uncertainty_score":0.016171813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05571709,0.00005113974,0.93678415,0.00014119274,0.00002692093,0.00014408561,0.000032834447,0.00024327262,0.0068592587],"genre_scores_gemma":[0.64208317,0.00009843907,0.3543772,0.00012160252,0.000012717373,0.00024274334,0.000085321844,0.000049849114,0.0029289597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904186,0.0004189866,0.000054122116,0.00015558736,0.00020758291,0.00012192246],"domain_scores_gemma":[0.9986708,0.0008674777,0.00010365316,0.000094018484,0.00017019143,0.00009376722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013394105,0.00044679127,0.00056035444,0.00036538672,0.00050502433,0.0010017086,0.0010412416,0.0007770809,0.0023965186],"category_scores_gemma":[0.0037209378,0.0002052565,0.00054614525,0.000325184,0.00073310954,0.0013746795,0.0009347715,0.000988273,0.00026249347],"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.00042860673,0.000457172,0.002945507,0.00018462102,0.00010665549,0.00024963755,0.0006778989,0.6365862,0.010469654,0.19367166,0.002091118,0.15213127],"study_design_scores_gemma":[0.000027540716,0.00015299954,0.00018801127,0.0000148949675,0.000017867978,0.00004837517,0.000042545635,0.97421205,0.0017804464,0.022327496,0.0011729159,0.000014868215],"about_ca_topic_score_codex":0.002134565,"about_ca_topic_score_gemma":0.002123642,"teacher_disagreement_score":0.0023965186,"about_ca_system_score_codex":0.00070364645,"about_ca_system_score_gemma":0.0012156316,"threshold_uncertainty_score":0.008017182},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032102246,0.00024582807,0.8855055,0.00026336656,0.00016057339,0.0009918495,0.0018610867,0.06860251,0.010267013],"genre_scores_gemma":[0.14531878,0.00021640639,0.83743006,0.00012514731,0.000041433374,0.00060758175,0.005216869,0.0051861764,0.005857493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991968,0.00025056134,0.000096683965,0.00019762803,0.00021340561,0.000044785564],"domain_scores_gemma":[0.99699104,0.001869834,0.00018552491,0.00034933595,0.000472451,0.0001317844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011775958,0.0014564805,0.00076344324,0.0015486401,0.00053085224,0.0017130597,0.0016903478,0.0010133069,0.011909095],"category_scores_gemma":[0.0074381777,0.0007890095,0.0008761787,0.0005497555,0.00050939416,0.0016747979,0.0018491625,0.0008284888,0.0044045267],"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.0011105349,0.0006934548,0.004080973,0.001997989,0.0001410553,0.0018786328,0.0035076786,0.030460551,0.09639022,0.029203009,0.05400068,0.7765353],"study_design_scores_gemma":[0.00042570068,0.000305668,0.0022342878,0.00027485512,0.00016504923,0.0011691217,0.000660442,0.66351813,0.16376753,0.026350634,0.1409753,0.00015338558],"about_ca_topic_score_codex":0.0009957858,"about_ca_topic_score_gemma":0.0012327883,"teacher_disagreement_score":0.011909095,"about_ca_system_score_codex":0.0006733817,"about_ca_system_score_gemma":0.0007446919,"threshold_uncertainty_score":0.039839923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29042038,0.00010706995,0.6927014,0.00040355825,0.00007133294,0.0005199612,0.000064992324,0.0006711014,0.015040199],"genre_scores_gemma":[0.72958136,0.000036614412,0.26583767,0.00015036855,0.000014001026,0.0004675373,0.000073483934,0.00007082189,0.0037682247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979698,0.0009818142,0.00008337458,0.00025128797,0.0005401727,0.00017341129],"domain_scores_gemma":[0.9950846,0.002830952,0.000580738,0.0008128457,0.00043851492,0.00025230472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041423333,0.0008209516,0.0006129926,0.0006798526,0.00073028484,0.0012469395,0.0022695486,0.0010870689,0.0026607646],"category_scores_gemma":[0.008879366,0.0004059929,0.0006465415,0.00035452997,0.001744281,0.0011846466,0.0027482845,0.0012565444,0.0003457654],"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.00047543453,0.00073276175,0.0034317612,0.00010028697,0.00014175015,0.00038590285,0.0007330385,0.77255225,0.009401439,0.14236122,0.0013340544,0.06835017],"study_design_scores_gemma":[0.00007612152,0.00022488317,0.00024947626,0.000009971097,0.000024421492,0.00007814869,0.00004750534,0.96317166,0.005046641,0.029047195,0.002007485,0.000016423357],"about_ca_topic_score_codex":0.0008703554,"about_ca_topic_score_gemma":0.0011957103,"teacher_disagreement_score":0.0041423333,"about_ca_system_score_codex":0.0010167201,"about_ca_system_score_gemma":0.00080246816,"threshold_uncertainty_score":0.021906972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13434437,0.00076600496,0.70180017,0.0030714232,0.00014037854,0.00025128818,0.00014138513,0.0008179525,0.15866707],"genre_scores_gemma":[0.90268797,0.00036779922,0.08500724,0.00035150733,0.000037686583,0.00025472394,0.0001249277,0.00017559591,0.010992548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983119,0.00086326385,0.00009807492,0.00013215293,0.000447799,0.00014686397],"domain_scores_gemma":[0.99864846,0.0007090705,0.0001395714,0.00011280201,0.00029815012,0.000092010494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009868391,0.00053516496,0.00017739821,0.0004630152,0.0006600142,0.0023786442,0.00058091275,0.00097536243,0.0023432872],"category_scores_gemma":[0.0055094673,0.0004217946,0.00031269956,0.0002545444,0.0018663957,0.0021956677,0.0014913226,0.0011070942,0.0004060858],"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.00012784159,0.000056160912,0.0008531437,0.00025485025,0.00001592975,0.0007543348,0.0074042967,0.023977537,0.020839028,0.88462305,0.00442534,0.05666848],"study_design_scores_gemma":[0.00007263361,0.0001516897,0.0032570388,0.00025390118,0.000043523534,0.0011438915,0.005826207,0.14494792,0.014080202,0.70346445,0.12665762,0.00010085351],"about_ca_topic_score_codex":0.002130205,"about_ca_topic_score_gemma":0.0014095174,"teacher_disagreement_score":0.0023786442,"about_ca_system_score_codex":0.0010556827,"about_ca_system_score_gemma":0.00037680453,"threshold_uncertainty_score":0.007839084},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5414586,0.002452018,0.37099713,0.0036033744,0.00032863786,0.000095539435,0.00027514002,0.00058119086,0.08020837],"genre_scores_gemma":[0.9730266,0.0001862922,0.018117674,0.000117072355,0.000034447254,0.000025613434,0.0000744608,0.000046874047,0.008371031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00020792804,0.000025340556,0.00008577417,0.00012212284,0.00009486244],"domain_scores_gemma":[0.99605197,0.0030275728,0.00018661158,0.00025847644,0.00023664182,0.00023866551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010604995,0.00024621008,0.0007783281,0.0010773927,0.0009870261,0.0015463452,0.0013687909,0.0016836693,0.012011344],"category_scores_gemma":[0.011258332,0.0002498654,0.00044479314,0.0010317124,0.0014111385,0.004730643,0.0013956724,0.0013385549,0.00039034276],"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.000339973,0.000101878635,0.0009772377,0.00009445382,0.000029036737,0.000102690115,0.00023975695,0.058109034,0.0009238943,0.9115672,0.0021494997,0.025365237],"study_design_scores_gemma":[0.000045590426,0.000044482327,0.00034543822,0.000014842801,0.000012974721,0.0000516067,0.000094756906,0.31688628,0.00034600627,0.68097156,0.0011734469,0.000012994138],"about_ca_topic_score_codex":0.0053713857,"about_ca_topic_score_gemma":0.0062554623,"teacher_disagreement_score":0.012011344,"about_ca_system_score_codex":0.0012267535,"about_ca_system_score_gemma":0.0011261366,"threshold_uncertainty_score":0.040181994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6143522,0.000115977404,0.31489608,0.00054522796,0.000047900303,0.00039659106,0.00025178085,0.0029121356,0.06648202],"genre_scores_gemma":[0.91357654,0.000032054988,0.07740148,0.00008599772,0.000008080999,0.00015459556,0.00024639996,0.00014055628,0.008354369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993622,0.00013762066,0.00002618723,0.00012987657,0.00012542472,0.00021871977],"domain_scores_gemma":[0.9988399,0.0006800066,0.00010508178,0.00012708691,0.000071738184,0.00017615451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011835813,0.00083494984,0.0008556959,0.0005485456,0.0007374124,0.0010416757,0.0013331071,0.0015677983,0.009666081],"category_scores_gemma":[0.0038705822,0.00029355666,0.000656047,0.00038201938,0.0012185838,0.0014872958,0.0022545431,0.0011158872,0.000893329],"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.0008456086,0.00045784615,0.0040597306,0.00014414107,0.00007019745,0.00038711002,0.0008202732,0.80599767,0.003198024,0.071129456,0.0046133893,0.108276494],"study_design_scores_gemma":[0.000092524766,0.0002296468,0.00083103945,0.00001966576,0.000009697598,0.00007715362,0.00019770114,0.95450455,0.0016676693,0.038966447,0.00338842,0.000015387606],"about_ca_topic_score_codex":0.010005254,"about_ca_topic_score_gemma":0.012843062,"teacher_disagreement_score":0.010005254,"about_ca_system_score_codex":0.0012344891,"about_ca_system_score_gemma":0.001331904,"threshold_uncertainty_score":0.032336295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099201605,0.00010614649,0.8964137,0.00018738839,0.00004341392,0.000096412456,0.000057379653,0.0012265561,0.0026674527],"genre_scores_gemma":[0.77988136,0.000049125643,0.21797083,0.00012070768,0.00002387512,0.00016900901,0.00016826087,0.0001659938,0.0014508722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983387,0.00050070544,0.00012406691,0.00047244263,0.00036833683,0.00019578944],"domain_scores_gemma":[0.99368685,0.003940296,0.0005948441,0.0008989269,0.0006314923,0.00024757435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485748,0.0014290764,0.0014151332,0.0012301209,0.00061212014,0.0018099241,0.002075653,0.0020721024,0.0024870408],"category_scores_gemma":[0.017002683,0.0006560667,0.0008542626,0.00051768456,0.0015060353,0.00248778,0.0020214808,0.001546019,0.0005588559],"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.00020694283,0.00007616581,0.0023379223,0.000055384702,0.00009864271,0.00010708596,0.000107356114,0.9323457,0.0035629428,0.016855594,0.0005879997,0.04365818],"study_design_scores_gemma":[0.0000095056475,0.000026352127,0.00010499415,0.0000036561798,0.0000063450443,0.000016790622,0.000015729753,0.990604,0.001284977,0.0077660824,0.00015543196,0.0000061708424],"about_ca_topic_score_codex":0.002024415,"about_ca_topic_score_gemma":0.002048624,"teacher_disagreement_score":0.0024870408,"about_ca_system_score_codex":0.0013006373,"about_ca_system_score_gemma":0.0014244186,"threshold_uncertainty_score":0.013146043},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038742542,0.00032630545,0.9541334,0.00018636747,0.00003989644,0.0001919789,0.00006605294,0.0016441274,0.0046693026],"genre_scores_gemma":[0.32469416,0.00023544733,0.6715762,0.00011667922,0.000030702424,0.00037105978,0.00027523446,0.0001539947,0.00254648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992569,0.00020419352,0.00006016845,0.00015076618,0.00023078258,0.0000971966],"domain_scores_gemma":[0.9988084,0.0006376016,0.000107502754,0.00019241187,0.00017457658,0.000079572106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011188206,0.0007425988,0.0008473538,0.0013245108,0.000401597,0.0012689583,0.0021660733,0.000942172,0.0042250743],"category_scores_gemma":[0.0043401355,0.00055093394,0.0007351913,0.0012510146,0.0012202878,0.0018316775,0.0015475265,0.0010281164,0.00072321435],"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.00034825757,0.00038806634,0.0019033732,0.00019838379,0.000073843396,0.00019374065,0.0004144762,0.51084024,0.005068672,0.041379455,0.0036631995,0.4355283],"study_design_scores_gemma":[0.00006026129,0.00008081173,0.0002723134,0.000014275169,0.000017578646,0.000045242563,0.000048292506,0.9829609,0.0016168354,0.012609363,0.0022613583,0.000012819924],"about_ca_topic_score_codex":0.0124316625,"about_ca_topic_score_gemma":0.00945476,"teacher_disagreement_score":0.0124316625,"about_ca_system_score_codex":0.0013389622,"about_ca_system_score_gemma":0.001429218,"threshold_uncertainty_score":0.024718583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011842556,0.00008147467,0.9841388,0.00013971352,0.0000130197195,0.00007291865,0.000031439362,0.00040499878,0.00327514],"genre_scores_gemma":[0.6976312,0.00022957532,0.29947907,0.00008640131,0.000024893785,0.00026870088,0.00012080602,0.00010089169,0.0020584827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883693,0.0006143083,0.000049241018,0.00016364706,0.00024710345,0.00008879738],"domain_scores_gemma":[0.9965514,0.0026364247,0.00022245916,0.0003134351,0.00015336579,0.00012287118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002048166,0.0009574796,0.0006872781,0.00069572986,0.00048738092,0.0010129454,0.0012780617,0.00084911985,0.0027521804],"category_scores_gemma":[0.006306889,0.00052471564,0.0006049316,0.0005523465,0.0017068255,0.0016547155,0.0017378854,0.0012777348,0.00031957388],"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.000042572316,0.00002333618,0.00026408996,0.000024923791,0.00002096847,0.000039247556,0.000054275948,0.95208687,0.0005732768,0.032952815,0.00026291868,0.013654729],"study_design_scores_gemma":[0.000007743109,0.000013458888,0.000022631777,0.000004070937,0.0000035591968,0.000009128738,0.0000062670038,0.97759277,0.00033617584,0.021626191,0.00037473862,0.0000033004449],"about_ca_topic_score_codex":0.00413004,"about_ca_topic_score_gemma":0.004291039,"teacher_disagreement_score":0.00413004,"about_ca_system_score_codex":0.0010046584,"about_ca_system_score_gemma":0.0015280691,"threshold_uncertainty_score":0.010831833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06288635,0.0017149237,0.92449707,0.00076744164,0.00021331274,0.00030899284,0.00023879074,0.0011915787,0.008181502],"genre_scores_gemma":[0.7239865,0.00084665837,0.2683454,0.0005266221,0.00021417647,0.0005878504,0.0006387589,0.00014878232,0.0047051157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982566,0.00066370337,0.00013177865,0.00042467655,0.00037965932,0.00014364916],"domain_scores_gemma":[0.9914449,0.006353978,0.0004638838,0.00075531774,0.0007777772,0.0002041661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028478792,0.0022197266,0.001930259,0.0016531597,0.0005728954,0.001768712,0.0023183324,0.0017501751,0.0039961785],"category_scores_gemma":[0.014723204,0.00085945445,0.0011632555,0.0016615537,0.0010308842,0.002564598,0.0015512753,0.0024147446,0.0008184973],"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.0002384833,0.00026269813,0.0027946702,0.0003192676,0.00022190592,0.00014531365,0.00012436735,0.6803834,0.0008746852,0.014480446,0.0035396589,0.29661518],"study_design_scores_gemma":[0.00004792938,0.00009224509,0.00027293732,0.00003562655,0.000038010843,0.000031705957,0.000027801134,0.980893,0.0005428788,0.017177716,0.0008268611,0.0000132889745],"about_ca_topic_score_codex":0.0024982851,"about_ca_topic_score_gemma":0.004047539,"teacher_disagreement_score":0.0039961785,"about_ca_system_score_codex":0.0014357406,"about_ca_system_score_gemma":0.001672345,"threshold_uncertainty_score":0.0150612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07477766,0.0007617187,0.897903,0.0006883649,0.00020911398,0.0010658331,0.0019432147,0.012660933,0.009990157],"genre_scores_gemma":[0.3227871,0.0004348533,0.6691953,0.0003814499,0.00006665926,0.0019035382,0.0021614279,0.0016133126,0.0014563373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9908516,0.0054394486,0.00049613015,0.00076411327,0.002081631,0.00036709628],"domain_scores_gemma":[0.96632564,0.025580129,0.0010276043,0.004656256,0.0016648073,0.0007455472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01258691,0.0029997746,0.0017739108,0.004129222,0.00077623164,0.0030453382,0.0035366004,0.0018964651,0.0037182516],"category_scores_gemma":[0.058330882,0.00087580306,0.0012482116,0.0026831196,0.0019964513,0.0037258586,0.0033924957,0.003674167,0.0009239057],"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.0008867511,0.001359514,0.011132119,0.0010170623,0.0008020084,0.0002761289,0.00054878485,0.6378581,0.003903428,0.085407555,0.032883022,0.22392546],"study_design_scores_gemma":[0.0001338718,0.00034662758,0.000858437,0.00005993847,0.00004129797,0.00008919664,0.00007878155,0.9364335,0.0033620049,0.05377599,0.0047760583,0.00004426309],"about_ca_topic_score_codex":0.0027104926,"about_ca_topic_score_gemma":0.004876463,"teacher_disagreement_score":0.01258691,"about_ca_system_score_codex":0.0015180468,"about_ca_system_score_gemma":0.0018435576,"threshold_uncertainty_score":0.066566706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04105259,0.00016494984,0.92526734,0.0011496565,0.00006719564,0.0001266189,0.000041711024,0.00017798747,0.03195198],"genre_scores_gemma":[0.7372216,0.0001762216,0.2537639,0.00018216849,0.000027223217,0.00031267808,0.000047739068,0.000070914735,0.008197567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866533,0.000832092,0.000047533613,0.00016229348,0.000208478,0.00008435516],"domain_scores_gemma":[0.9992987,0.0002777386,0.00007742398,0.00013174108,0.000092353745,0.00012200161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012875893,0.0008280156,0.000365979,0.0006327297,0.0012738281,0.0022470066,0.0012079104,0.0010486415,0.0037647625],"category_scores_gemma":[0.0023079475,0.0005392802,0.0010182962,0.00029058967,0.0026880326,0.0027996527,0.0038349165,0.0017087782,0.00047352628],"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.00009792517,0.00017660907,0.0026878237,0.00012432567,0.00009025618,0.0005808014,0.0070939674,0.0906745,0.0058187474,0.8519125,0.0011427664,0.03959972],"study_design_scores_gemma":[0.000059906874,0.00026320014,0.0014252403,0.00009612127,0.000104950006,0.0005651147,0.002415811,0.4609129,0.002176461,0.5052143,0.026680743,0.000085302585],"about_ca_topic_score_codex":0.0016399053,"about_ca_topic_score_gemma":0.002834056,"teacher_disagreement_score":0.0037647625,"about_ca_system_score_codex":0.0009979417,"about_ca_system_score_gemma":0.0010033256,"threshold_uncertainty_score":0.012594342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004717972,0.00033772923,0.9912902,0.00013022286,0.00004194177,0.000019978988,0.000051615534,0.000072951916,0.0033373903],"genre_scores_gemma":[0.58141315,0.003606184,0.3895138,0.0003714989,0.00022682498,0.00047923962,0.00029605342,0.00023413546,0.023859182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.00025189613,0.000037921574,0.00009723128,0.00024369528,0.00005694343],"domain_scores_gemma":[0.99830914,0.0010689128,0.00013319693,0.00015714773,0.00024682313,0.00008479619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011769627,0.0007272367,0.00069625815,0.00112433,0.00055139046,0.00146255,0.0018500243,0.0009960918,0.0038694423],"category_scores_gemma":[0.006521563,0.00042106182,0.00086675904,0.0011079948,0.0015619098,0.0019416339,0.0011343992,0.0016170156,0.00093632477],"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.000040324903,0.000029190724,0.00060048467,0.000068006855,0.00002142581,0.00012835812,0.000204971,0.44315794,0.0013223533,0.52506196,0.0014462038,0.027918823],"study_design_scores_gemma":[0.0000065656395,0.00002727657,0.000099226505,0.000018246412,0.000008884107,0.000073064206,0.000022014308,0.79792213,0.00037663104,0.19897626,0.0024560846,0.000013572404],"about_ca_topic_score_codex":0.006470935,"about_ca_topic_score_gemma":0.0044716904,"teacher_disagreement_score":0.006470935,"about_ca_system_score_codex":0.0012593679,"about_ca_system_score_gemma":0.0009682079,"threshold_uncertainty_score":0.012944579},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019164104,0.00006966256,0.97427326,0.00026227266,0.00004005393,0.00006812168,0.00014112596,0.0006448546,0.005336474],"genre_scores_gemma":[0.7439665,0.00012659965,0.24259499,0.00016749975,0.000046867124,0.00032312342,0.00038290152,0.00014996492,0.012241533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899656,0.0002653898,0.000057866735,0.00024025707,0.00031151768,0.00012841908],"domain_scores_gemma":[0.9966832,0.0016897855,0.0003091329,0.0007643904,0.00039817733,0.00015533005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410388,0.0010882403,0.0012071639,0.00038769783,0.00057058973,0.0021136375,0.0031702768,0.0020133667,0.0064601745],"category_scores_gemma":[0.008061912,0.0005787285,0.00086462963,0.0004109549,0.0011644484,0.003182019,0.002918406,0.0026449615,0.001227791],"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.00011715724,0.000074424934,0.0011181792,0.00007136078,0.00003317138,0.00012902348,0.00016053695,0.91271406,0.0013083614,0.05384586,0.0010221711,0.029405724],"study_design_scores_gemma":[0.000007697823,0.000009118482,0.00004191503,0.0000025587112,0.0000029523533,0.00001033156,0.000005181423,0.98973465,0.0002429274,0.009472661,0.00046704442,0.000003003729],"about_ca_topic_score_codex":0.0036529326,"about_ca_topic_score_gemma":0.004985677,"teacher_disagreement_score":0.0064601745,"about_ca_system_score_codex":0.0008972428,"about_ca_system_score_gemma":0.0012909035,"threshold_uncertainty_score":0.021611392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04715468,0.00006196722,0.9265233,0.00010050563,0.000050735347,0.00017231694,0.00018834656,0.0015239523,0.024224136],"genre_scores_gemma":[0.4352021,0.00011369343,0.55047816,0.00009070777,0.000012758166,0.00027008617,0.00061557646,0.0010034669,0.012213397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996772,0.000049255006,0.000018109968,0.00006179452,0.00014141656,0.000052169322],"domain_scores_gemma":[0.99961424,0.00012150408,0.000027844713,0.00012751759,0.000077830795,0.000031067822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860116,0.0005582123,0.0005061431,0.000504517,0.00054400787,0.0012417756,0.0010168576,0.0006205216,0.008657836],"category_scores_gemma":[0.0014952167,0.00038427778,0.0007420471,0.00039386065,0.0008309021,0.0010135405,0.0015344401,0.0005957386,0.0017563886],"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.00021382757,0.0001374787,0.0016959613,0.00039233043,0.00004188835,0.00073269545,0.00052901363,0.55644727,0.114058554,0.1739099,0.0038847532,0.14795636],"study_design_scores_gemma":[0.00004989469,0.00021510737,0.0009239208,0.000054289972,0.000051556737,0.00037123222,0.00018727728,0.84331715,0.053223487,0.05553396,0.046033163,0.000038978797],"about_ca_topic_score_codex":0.0013455759,"about_ca_topic_score_gemma":0.0019026687,"teacher_disagreement_score":0.008657836,"about_ca_system_score_codex":0.0006517721,"about_ca_system_score_gemma":0.00073745253,"threshold_uncertainty_score":0.028963387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103222206,0.00034336254,0.8825979,0.0010506401,0.000035859848,0.00026378766,0.00006884582,0.00029456534,0.012122794],"genre_scores_gemma":[0.73122823,0.00039243104,0.26309618,0.00020147579,0.000029986595,0.0003528619,0.00019767045,0.000052463645,0.0044486676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977852,0.0012630054,0.00010794917,0.00035643938,0.00032762912,0.00015978627],"domain_scores_gemma":[0.99279165,0.005362488,0.00043970507,0.0007422076,0.0003723506,0.00029161875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025946207,0.0006897427,0.00086537685,0.0007528716,0.0006847947,0.0017520398,0.001698981,0.0013882,0.0023875034],"category_scores_gemma":[0.015908752,0.0004685585,0.00090012205,0.00062878133,0.0031802729,0.0034304778,0.0025783535,0.0015997865,0.00026677657],"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.00017957855,0.0003086331,0.0015969113,0.0002999206,0.00012009031,0.00027230429,0.0011797845,0.5855092,0.0026202695,0.33249593,0.0012657366,0.07415166],"study_design_scores_gemma":[0.00006594959,0.00009092732,0.00034315744,0.000032063657,0.000025933101,0.0000736427,0.00014146056,0.6991036,0.0013775356,0.29622325,0.0025055218,0.00001698575],"about_ca_topic_score_codex":0.0037367567,"about_ca_topic_score_gemma":0.0028698428,"teacher_disagreement_score":0.0037367567,"about_ca_system_score_codex":0.0013203601,"about_ca_system_score_gemma":0.0011749016,"threshold_uncertainty_score":0.013721824},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06867039,0.0012610691,0.46036327,0.002361163,0.0015834316,0.0010751332,0.0064838054,0.17859025,0.2796115],"genre_scores_gemma":[0.3844042,0.0012857366,0.4184158,0.0017660629,0.00019867052,0.0014823527,0.013302305,0.030254938,0.14888999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993082,0.00015308897,0.000046482688,0.00009906637,0.00030203728,0.00009111724],"domain_scores_gemma":[0.9989573,0.0003603182,0.000046584566,0.0002315521,0.000195395,0.00020886894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085760566,0.0007393774,0.00033233804,0.0003960729,0.0005562283,0.0014378361,0.0015856964,0.0010376208,0.043002587],"category_scores_gemma":[0.0029181796,0.0004915473,0.00051834795,0.00032275481,0.00058933743,0.0018898939,0.0021288919,0.001578044,0.012981215],"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.002856341,0.0017882761,0.0063474877,0.0024173579,0.00013366395,0.0073318616,0.005642792,0.0201905,0.15049712,0.09949269,0.41617507,0.28712675],"study_design_scores_gemma":[0.0003189543,0.00047898293,0.0017498243,0.0002779171,0.00002446761,0.0019641323,0.00036568253,0.054664567,0.047687825,0.009589548,0.88278145,0.000096563665],"about_ca_topic_score_codex":0.0018192218,"about_ca_topic_score_gemma":0.0017289304,"teacher_disagreement_score":0.043002587,"about_ca_system_score_codex":0.0003709502,"about_ca_system_score_gemma":0.0006396747,"threshold_uncertainty_score":0.14385796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027859248,0.00016996326,0.96299434,0.00032091571,0.000042474203,0.00016497898,0.00010199541,0.0004323321,0.007913807],"genre_scores_gemma":[0.3480181,0.00033544868,0.64093816,0.00016778144,0.000038050777,0.00036936798,0.0004916197,0.00041307157,0.00922836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933416,0.00022707663,0.000036138015,0.0001409975,0.00015808585,0.00010350758],"domain_scores_gemma":[0.9988206,0.00080655277,0.000060731574,0.00014832393,0.00009348019,0.00007029704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113837,0.00085286045,0.0009350931,0.00047682237,0.00061030523,0.0015594845,0.001155805,0.001391417,0.007318624],"category_scores_gemma":[0.0031330318,0.00052183616,0.0012295442,0.00056403514,0.0011941525,0.001630052,0.001922879,0.0013725008,0.0008773939],"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.00013662952,0.000070241156,0.00071067346,0.00020010876,0.000045066892,0.00042389394,0.00025842956,0.8291839,0.0063780984,0.088409774,0.00283853,0.07134464],"study_design_scores_gemma":[0.000049191633,0.0000813034,0.00017464132,0.000022373131,0.000026270689,0.00012539487,0.00010540121,0.92261606,0.0024359068,0.06813655,0.006212961,0.00001395058],"about_ca_topic_score_codex":0.0025961427,"about_ca_topic_score_gemma":0.002618509,"teacher_disagreement_score":0.007318624,"about_ca_system_score_codex":0.0008834919,"about_ca_system_score_gemma":0.00094154786,"threshold_uncertainty_score":0.024483204},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05797576,0.0042790505,0.20456561,0.008431344,0.004974182,0.00053963606,0.0063743955,0.0153632825,0.6974968],"genre_scores_gemma":[0.42256516,0.0013131299,0.14201857,0.0047811437,0.000896757,0.00077653787,0.008350738,0.0027382597,0.41655973],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990042,0.00027284186,0.000037698406,0.00022548484,0.00028506728,0.00017459814],"domain_scores_gemma":[0.9989569,0.0004487638,0.0000591262,0.00022311909,0.00015543932,0.00015656198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055463,0.0008696976,0.00096515205,0.0006630291,0.0010756601,0.0018645648,0.0012917657,0.0009327742,0.07530646],"category_scores_gemma":[0.0039900057,0.00029293096,0.0007271483,0.0005796311,0.000541108,0.0009563937,0.0014894288,0.0014721404,0.014378307],"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.0012123677,0.00017642982,0.0026176379,0.00028384873,0.00017676725,0.00028759614,0.00013832534,0.031562295,0.0016116445,0.12956463,0.49294814,0.33942032],"study_design_scores_gemma":[0.0006231385,0.00046070293,0.0029903962,0.00020377059,0.000102711776,0.0006156338,0.00014753753,0.14149289,0.0031700376,0.10351031,0.7465995,0.000083418905],"about_ca_topic_score_codex":0.0027423773,"about_ca_topic_score_gemma":0.006765803,"teacher_disagreement_score":0.07530646,"about_ca_system_score_codex":0.0010781485,"about_ca_system_score_gemma":0.0010277629,"threshold_uncertainty_score":0.25192523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37945423,0.00048418163,0.3094517,0.0019555264,0.001116088,0.00018409833,0.0018618354,0.0027889952,0.30270338],"genre_scores_gemma":[0.8510644,0.00022763693,0.096031256,0.0007356723,0.000041224775,0.00009796324,0.001295486,0.0009792061,0.049527194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996202,0.0000724401,0.0000140269185,0.00006717932,0.00010950633,0.000116627474],"domain_scores_gemma":[0.999624,0.000108803455,0.000026917136,0.00013174527,0.000057188277,0.000051233816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023105704,0.00043567186,0.0005878743,0.00043521923,0.001015051,0.0017753273,0.00084736786,0.0015427815,0.029355526],"category_scores_gemma":[0.001410814,0.00036215238,0.00041136544,0.00071251154,0.0007430802,0.001959011,0.0016119212,0.0013466182,0.0062903995],"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.0007524747,0.00014662097,0.0027894243,0.00022241636,0.000026586074,0.00088003586,0.00052276946,0.032307953,0.022274364,0.7897263,0.034857035,0.115494125],"study_design_scores_gemma":[0.000095361385,0.00021758399,0.0011575018,0.000112160305,0.000029874762,0.0007947515,0.0014553105,0.22502813,0.033703808,0.643287,0.09403915,0.00007930784],"about_ca_topic_score_codex":0.0010847161,"about_ca_topic_score_gemma":0.001667253,"teacher_disagreement_score":0.029355526,"about_ca_system_score_codex":0.0004979966,"about_ca_system_score_gemma":0.0004325995,"threshold_uncertainty_score":0.09820402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016354175,0.0006046823,0.97101915,0.0003751612,0.00027108056,0.00015858836,0.0002350461,0.0032179,0.0077641755],"genre_scores_gemma":[0.26232994,0.0006224951,0.7224725,0.0005980431,0.00021912318,0.00048672728,0.00097391603,0.001133862,0.011163394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791807,0.00062247517,0.000117946445,0.00039244193,0.0006972708,0.00025193745],"domain_scores_gemma":[0.9963258,0.0019249814,0.0002502716,0.000611911,0.0006179522,0.00026906282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002097612,0.0014060918,0.0021536027,0.0015274355,0.0010745791,0.0018400126,0.003589456,0.001819349,0.008903002],"category_scores_gemma":[0.010833267,0.0008169073,0.0018631198,0.001784039,0.001607175,0.0034428402,0.0038832407,0.0027214072,0.0030581104],"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.000677617,0.0003558464,0.0020757772,0.00040277134,0.00016008994,0.00015290028,0.00021806269,0.51169395,0.004670419,0.11381363,0.024397742,0.34138125],"study_design_scores_gemma":[0.00009265852,0.000079576,0.00010166653,0.000017213226,0.000025365416,0.000065623564,0.000019643803,0.9634504,0.0011034188,0.030241093,0.00478774,0.000015688822],"about_ca_topic_score_codex":0.005641202,"about_ca_topic_score_gemma":0.005595083,"teacher_disagreement_score":0.008903002,"about_ca_system_score_codex":0.0017555635,"about_ca_system_score_gemma":0.0039357287,"threshold_uncertainty_score":0.029783487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05668357,0.010331556,0.53020984,0.002279721,0.00096499914,0.00011567952,0.0006196519,0.0008837478,0.39791125],"genre_scores_gemma":[0.69334596,0.006006268,0.15958837,0.00085724914,0.00040580993,0.00020247747,0.000950509,0.00073982426,0.13790347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922824,0.00020102931,0.00007246903,0.0001612298,0.00020818869,0.000128803],"domain_scores_gemma":[0.99875236,0.00070611417,0.000085628606,0.00026294196,0.00012604623,0.00006683445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074048905,0.0004967625,0.0010380984,0.0013092116,0.0017466688,0.0034624445,0.0012367795,0.0017977597,0.020466331],"category_scores_gemma":[0.0044383854,0.0004675243,0.00068543875,0.0032198126,0.003913193,0.009792218,0.0017695315,0.0022808297,0.0030148374],"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.000037641727,0.000010805063,0.00010463686,0.000051801715,0.000004225258,0.00003863048,0.00008712656,0.0013219021,0.00020045866,0.96859163,0.0033806036,0.026170364],"study_design_scores_gemma":[0.0000065998483,0.000008222414,0.000055709992,0.000020316076,0.000004189669,0.0000978335,0.000057336565,0.0032398128,0.0002513513,0.9877863,0.008464338,0.000007967993],"about_ca_topic_score_codex":0.0025415546,"about_ca_topic_score_gemma":0.002700688,"teacher_disagreement_score":0.020466331,"about_ca_system_score_codex":0.0008715508,"about_ca_system_score_gemma":0.000782174,"threshold_uncertainty_score":0.06846666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04169048,0.000091922855,0.9317787,0.0005730008,0.000086806926,0.003403291,0.00022899255,0.002469654,0.019677076],"genre_scores_gemma":[0.101991326,0.0001095087,0.88895905,0.00009124645,0.000008097254,0.0012343433,0.00027258988,0.00020323976,0.0071305814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976046,0.0007297269,0.0002331142,0.00044229353,0.000839559,0.00015068852],"domain_scores_gemma":[0.99649626,0.0019596065,0.00022496146,0.00040536918,0.0006503609,0.00026345017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036317483,0.00056323496,0.00048037205,0.0013194054,0.000812259,0.0028058977,0.0033867033,0.0014397716,0.011782167],"category_scores_gemma":[0.009741692,0.00084470474,0.00060302706,0.0004997994,0.0013367427,0.002301126,0.0023052327,0.0015644841,0.001950862],"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.00063099404,0.0022454574,0.0072184727,0.0010252794,0.00012221708,0.0031437944,0.006161364,0.22862788,0.06377793,0.26192516,0.012858435,0.4122631],"study_design_scores_gemma":[0.00038515666,0.0008336746,0.0013896354,0.00034136156,0.00009655778,0.0017466481,0.0017481279,0.777382,0.048913807,0.027264506,0.13977793,0.000120602526],"about_ca_topic_score_codex":0.0014386681,"about_ca_topic_score_gemma":0.0014524154,"teacher_disagreement_score":0.011782167,"about_ca_system_score_codex":0.0013784276,"about_ca_system_score_gemma":0.0023294461,"threshold_uncertainty_score":0.0394153},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07643001,0.00007971205,0.9118731,0.00009286669,0.000040574865,0.000119804,0.000069725815,0.0017629919,0.009531248],"genre_scores_gemma":[0.7434072,0.00008979558,0.2491223,0.000049525926,0.000017084718,0.00021399352,0.00025041605,0.00033290274,0.006516801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995703,0.00018189425,0.000020338819,0.00007333166,0.000110281624,0.000043746262],"domain_scores_gemma":[0.99904996,0.00068476074,0.00003147387,0.00009295877,0.00009377778,0.00004714674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006457779,0.0004826728,0.0003434853,0.00022519528,0.00032154965,0.0006818378,0.0010736969,0.00051183766,0.003909112],"category_scores_gemma":[0.0032950288,0.00031922248,0.00048762144,0.00016779444,0.0007094649,0.0009471046,0.0011854914,0.0007942879,0.00057357695],"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.000604088,0.00062033854,0.0036512488,0.00045294914,0.0000756627,0.0005377042,0.0026126094,0.28419942,0.04354366,0.33078307,0.005435315,0.32748398],"study_design_scores_gemma":[0.000058219055,0.000110212626,0.00043814039,0.00003128638,0.00002327504,0.00008688465,0.00016220429,0.8231254,0.007700711,0.16464217,0.0036064705,0.000014995472],"about_ca_topic_score_codex":0.00073974003,"about_ca_topic_score_gemma":0.0012507817,"teacher_disagreement_score":0.003909112,"about_ca_system_score_codex":0.00026493333,"about_ca_system_score_gemma":0.00027397778,"threshold_uncertainty_score":0.013077259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010961398,0.0007640261,0.9396316,0.004243919,0.000498554,0.00037648916,0.0006454335,0.0023177697,0.04056077],"genre_scores_gemma":[0.14191918,0.00047015172,0.8346708,0.0009951683,0.00027291873,0.00037938435,0.000828277,0.0007360244,0.019728176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973028,0.0007668993,0.00014244806,0.000566288,0.0007891183,0.00043242547],"domain_scores_gemma":[0.99458164,0.003306131,0.000197932,0.0011922976,0.00050117663,0.00022086322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032552164,0.0011588291,0.0018923329,0.0021749642,0.0017605325,0.003125111,0.0044247108,0.004324801,0.032624587],"category_scores_gemma":[0.019749105,0.0009552799,0.0019678813,0.002406312,0.00275391,0.0058585694,0.004694093,0.005044933,0.005938684],"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.000415753,0.00019303283,0.00032324268,0.0006576844,0.00008697345,0.00015608322,0.00037488493,0.034349587,0.0023590147,0.6498419,0.049100246,0.2621416],"study_design_scores_gemma":[0.00021043402,0.000078880264,0.00010037729,0.000090465655,0.000047818532,0.00018428928,0.000085323256,0.12790099,0.0014571679,0.85099316,0.018818738,0.00003226452],"about_ca_topic_score_codex":0.0016146917,"about_ca_topic_score_gemma":0.0022581436,"teacher_disagreement_score":0.032624587,"about_ca_system_score_codex":0.0018394389,"about_ca_system_score_gemma":0.0033145454,"threshold_uncertainty_score":0.10914004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19207917,0.00040279177,0.7267816,0.0026030457,0.00026164207,0.0005185384,0.00028804323,0.005479925,0.07158516],"genre_scores_gemma":[0.50217366,0.00023223725,0.4653912,0.0013023416,0.00005715515,0.00040208016,0.00032195507,0.0007275199,0.029391872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957234,0.00015464055,0.000017699313,0.00011474652,0.0000771849,0.00006325318],"domain_scores_gemma":[0.99917275,0.00047265878,0.000056897807,0.00012460236,0.00006654731,0.00010638774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013771435,0.0010776637,0.00065801037,0.00034782148,0.0004773312,0.0016341973,0.0014607523,0.001224589,0.01075141],"category_scores_gemma":[0.0038439273,0.00023451808,0.00043377126,0.00018251534,0.0010338514,0.002383196,0.001687178,0.0014731887,0.0016018219],"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.0038626094,0.0011409144,0.008694232,0.0009297705,0.0003866289,0.00052408915,0.003200457,0.12566525,0.09300238,0.16903763,0.028421579,0.56513447],"study_design_scores_gemma":[0.0005166251,0.002054158,0.00277211,0.00019460659,0.00019258531,0.00055490364,0.0013511635,0.7865759,0.031582627,0.08265949,0.09139863,0.00014717723],"about_ca_topic_score_codex":0.0012602265,"about_ca_topic_score_gemma":0.0033567077,"teacher_disagreement_score":0.01075141,"about_ca_system_score_codex":0.00037321472,"about_ca_system_score_gemma":0.00051602704,"threshold_uncertainty_score":0.035966992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01634452,0.00022604404,0.97234625,0.0015599002,0.000051980704,0.000040083425,0.00006339021,0.00012460168,0.009243328],"genre_scores_gemma":[0.7908402,0.0005282209,0.18956171,0.000790116,0.00016950327,0.00025189665,0.00015511742,0.00018095691,0.01752232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722314,0.0015995103,0.0000732969,0.0003907299,0.00048886816,0.0002244261],"domain_scores_gemma":[0.991744,0.007087934,0.00034788207,0.00039223552,0.00022173634,0.00020608796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060385577,0.00089459866,0.0012646718,0.0007897117,0.0011015738,0.002301875,0.0023355104,0.0028061061,0.0056972676],"category_scores_gemma":[0.022226315,0.00085892313,0.0010987326,0.00064747815,0.0041740956,0.004347029,0.0028229067,0.0041929316,0.0008151547],"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.000094008836,0.000032942786,0.0009878427,0.00006801232,0.000041317264,0.00016958344,0.0005629575,0.2460406,0.00047189783,0.7343738,0.0013448324,0.015812343],"study_design_scores_gemma":[0.000014340523,0.000012832823,0.00011647044,0.000017193994,0.000007914968,0.000040662315,0.000043136337,0.55797243,0.0001858188,0.44042873,0.0011465572,0.0000139148815],"about_ca_topic_score_codex":0.0049103103,"about_ca_topic_score_gemma":0.004899348,"teacher_disagreement_score":0.0060385577,"about_ca_system_score_codex":0.0017917227,"about_ca_system_score_gemma":0.0014100685,"threshold_uncertainty_score":0.031935334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3831392,0.0023788095,0.54578507,0.011845431,0.0003923346,0.0006158431,0.0022365842,0.0014710702,0.05213572],"genre_scores_gemma":[0.8772387,0.0013640978,0.106198095,0.0009493255,0.0005730742,0.0005254118,0.0028257866,0.0005785375,0.009746979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98694694,0.0041955756,0.0011604436,0.0022401074,0.003582067,0.0018748643],"domain_scores_gemma":[0.8783607,0.10868179,0.0028033825,0.0052633802,0.0025292125,0.0023615696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069830595,0.0020696446,0.0041960827,0.0036263878,0.003924009,0.017384907,0.0057774,0.0046276334,0.017565746],"category_scores_gemma":[0.07100796,0.0022814819,0.0052325386,0.0050617605,0.007896888,0.03678782,0.009071345,0.009839365,0.0014520274],"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.0014433985,0.0006289858,0.005645386,0.0007725141,0.000330577,0.00031626623,0.0018363394,0.11304087,0.0020678341,0.81762916,0.00873681,0.04755175],"study_design_scores_gemma":[0.00009260918,0.00004938935,0.00041403153,0.000034523677,0.00006739113,0.00007291696,0.00018096376,0.115603834,0.000518312,0.8820969,0.00082927255,0.000039965027],"about_ca_topic_score_codex":0.007706684,"about_ca_topic_score_gemma":0.009402787,"teacher_disagreement_score":0.017565746,"about_ca_system_score_codex":0.007131466,"about_ca_system_score_gemma":0.0056949374,"threshold_uncertainty_score":0.058763325},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741451,0.0004883962,0.94884044,0.0008097611,0.00009652264,0.00020889213,0.00013494358,0.00039579035,0.011610782],"genre_scores_gemma":[0.88192725,0.0005120677,0.11095236,0.00033145805,0.00011586224,0.0003792839,0.00018017237,0.0000985397,0.0055030026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418724,0.0032963464,0.00022917638,0.0006947084,0.0010108763,0.00058170466],"domain_scores_gemma":[0.9788471,0.016178971,0.0013720285,0.0022825853,0.00054818526,0.0007711492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007380109,0.002068602,0.0015694249,0.001003156,0.0012237174,0.0028706493,0.0020558264,0.001801407,0.0060101696],"category_scores_gemma":[0.020020897,0.0007411809,0.0013394846,0.00072646193,0.0037971677,0.0057561873,0.0059982683,0.005651172,0.00067182473],"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.00024482378,0.000104127925,0.000508323,0.00014309197,0.00008050835,0.0001580977,0.00022842892,0.63664645,0.0013454468,0.34239078,0.0015283206,0.016621571],"study_design_scores_gemma":[0.000025424875,0.000057515103,0.00007597426,0.000020272588,0.000013604363,0.000033690714,0.000033667715,0.71849895,0.00037491904,0.27991772,0.0009359697,0.000012283698],"about_ca_topic_score_codex":0.0014228873,"about_ca_topic_score_gemma":0.0015783461,"teacher_disagreement_score":0.007380109,"about_ca_system_score_codex":0.0024913456,"about_ca_system_score_gemma":0.0018609992,"threshold_uncertainty_score":0.039030254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05351372,0.00008728125,0.8733123,0.00024927055,0.00010793822,0.00024228221,0.00045279606,0.003920785,0.068113685],"genre_scores_gemma":[0.48918027,0.00019857007,0.4398737,0.00012560855,0.000024549598,0.0003143017,0.0012190025,0.0022187496,0.0668453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978095,0.000039771414,0.000009910921,0.000047893667,0.000093460556,0.000028056116],"domain_scores_gemma":[0.9997186,0.00008858543,0.000020005391,0.00007801326,0.00006888357,0.00002592596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028230902,0.00035552742,0.00022703406,0.0004359515,0.0005993247,0.0018185887,0.0006796,0.00046859268,0.018259482],"category_scores_gemma":[0.0013119134,0.00028756712,0.00055554137,0.00034884247,0.00096654985,0.0011299993,0.0016569936,0.0005369305,0.0025118804],"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.00021237801,0.00012329945,0.002112852,0.0003663451,0.000026993936,0.0005751867,0.0024403625,0.06430648,0.04239891,0.73251146,0.016445167,0.13848051],"study_design_scores_gemma":[0.00008719816,0.00021803087,0.0015026263,0.00014808441,0.00005118641,0.0006697649,0.0011006604,0.39756128,0.064307585,0.16422676,0.37006316,0.000063686544],"about_ca_topic_score_codex":0.0009455037,"about_ca_topic_score_gemma":0.001384254,"teacher_disagreement_score":0.018259482,"about_ca_system_score_codex":0.0006318213,"about_ca_system_score_gemma":0.00061102695,"threshold_uncertainty_score":0.06108409},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23119745,0.0012358861,0.5302072,0.0028226872,0.00024733474,0.00042393498,0.00015905098,0.0019200257,0.2317865],"genre_scores_gemma":[0.7428724,0.0011540749,0.16907865,0.0005131566,0.00006856026,0.00040395214,0.00029539148,0.00020485088,0.08540897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970955,0.000082636834,0.00001146221,0.00007081243,0.00008615749,0.000039406743],"domain_scores_gemma":[0.9988858,0.0007341036,0.00006257427,0.00010384122,0.000096646494,0.00011701098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090450066,0.00066924846,0.0002822926,0.0002347868,0.00036190334,0.0012461446,0.0006549806,0.0005143861,0.0062154876],"category_scores_gemma":[0.004473928,0.00020049348,0.00021137687,0.00014810287,0.0014363376,0.0020938902,0.0009492655,0.0015478551,0.0019014032],"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.0003893837,0.0006175121,0.005909844,0.00044018554,0.00008066182,0.00020063587,0.0010883294,0.0648936,0.01920189,0.30650926,0.013297117,0.5873716],"study_design_scores_gemma":[0.00013542762,0.0015355746,0.0042977342,0.00015624086,0.000047265836,0.00068532414,0.0005940766,0.42024973,0.014214389,0.47777188,0.08026437,0.000048046073],"about_ca_topic_score_codex":0.00039589658,"about_ca_topic_score_gemma":0.0006509822,"teacher_disagreement_score":0.0062154876,"about_ca_system_score_codex":0.00049229123,"about_ca_system_score_gemma":0.0005325033,"threshold_uncertainty_score":0.020792842},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21593936,0.00014344088,0.7711528,0.00040118588,0.00003987413,0.00021078753,0.00012232031,0.0007209253,0.011269214],"genre_scores_gemma":[0.5170302,0.00010397446,0.47959986,0.000074305775,0.0000072417956,0.0003646298,0.00011176703,0.000099021054,0.0026090401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995865,0.00023564875,0.000022725064,0.00004425235,0.000072280665,0.000038437796],"domain_scores_gemma":[0.9980578,0.0015112555,0.00010182201,0.00015019327,0.00009877581,0.00008009177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015345154,0.00060529035,0.00042407692,0.0005922977,0.00040101304,0.00094758923,0.0012362354,0.0011962007,0.0031389017],"category_scores_gemma":[0.006978075,0.00030344343,0.0006025597,0.00037885652,0.0012539822,0.0015178835,0.0015015347,0.00082982046,0.0003130835],"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.000120887926,0.00010942373,0.0015678129,0.0001147717,0.000029452738,0.00007730484,0.00045513618,0.89984035,0.002727557,0.076706074,0.0005268872,0.017724382],"study_design_scores_gemma":[0.000027717171,0.000046806534,0.000055851084,0.000008942482,0.000005896713,0.000008878469,0.00004417182,0.9906488,0.00060061866,0.007843473,0.00070422544,0.000004655649],"about_ca_topic_score_codex":0.0041182227,"about_ca_topic_score_gemma":0.0042561064,"teacher_disagreement_score":0.0041182227,"about_ca_system_score_codex":0.00077017903,"about_ca_system_score_gemma":0.0010807784,"threshold_uncertainty_score":0.0105006695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01927519,0.000254518,0.97535616,0.0001448732,0.000051331714,0.000049946604,0.00008739016,0.001920971,0.002859619],"genre_scores_gemma":[0.5121384,0.00033900174,0.4833028,0.00010787532,0.000048766386,0.00019235387,0.00035587337,0.00056120916,0.0029536819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816364,0.00046389858,0.00010658094,0.00034183642,0.0006208034,0.00030330336],"domain_scores_gemma":[0.9964049,0.0018759896,0.00033576746,0.00081841927,0.00032985077,0.0002351255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013000538,0.0013852958,0.0013043446,0.0008689484,0.00067434984,0.002125052,0.0023714586,0.001078111,0.0044336556],"category_scores_gemma":[0.007709716,0.00070522405,0.0013537955,0.0011448838,0.0011715523,0.0040477025,0.0042364383,0.0026060417,0.0010171076],"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.0006008171,0.00012769383,0.0013966444,0.00026693087,0.00010148515,0.00020962158,0.00042300366,0.7582933,0.007828591,0.063508384,0.004263414,0.16298011],"study_design_scores_gemma":[0.000036849022,0.0000668357,0.00016547504,0.0000147116125,0.000016562019,0.00004654596,0.000045209632,0.9643721,0.0023250198,0.030341078,0.0025532874,0.000016283837],"about_ca_topic_score_codex":0.004350087,"about_ca_topic_score_gemma":0.0034725051,"teacher_disagreement_score":0.0044336556,"about_ca_system_score_codex":0.0014252526,"about_ca_system_score_gemma":0.0016097005,"threshold_uncertainty_score":0.014832079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01466092,0.0002820109,0.935866,0.00056972826,0.000113918046,0.00017681587,0.000039436552,0.0005687395,0.047722492],"genre_scores_gemma":[0.63929474,0.000497848,0.328741,0.00039643102,0.0000757603,0.00046194074,0.00008217353,0.00015585974,0.03029424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995302,0.00017069482,0.000023200251,0.000078727346,0.00014509066,0.00005209186],"domain_scores_gemma":[0.99966884,0.00012527012,0.000027535676,0.00004231846,0.00006929642,0.000066821114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049861975,0.0005551306,0.00022944894,0.00032055884,0.0005948962,0.0019249484,0.0013080287,0.0007181608,0.0041355467],"category_scores_gemma":[0.0012946172,0.00024995167,0.00050952623,0.00016713065,0.0020022297,0.0013089554,0.0014414232,0.0014436707,0.0005069407],"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.00017639612,0.00014229858,0.0006983518,0.00020970605,0.000056549477,0.00029205027,0.0019325254,0.12020588,0.024768883,0.78473914,0.0032063334,0.06357198],"study_design_scores_gemma":[0.00006200792,0.0002771873,0.0004117107,0.00007775548,0.00004097918,0.00021900704,0.0003877488,0.7429026,0.007922052,0.16985044,0.0778065,0.00004203748],"about_ca_topic_score_codex":0.004135763,"about_ca_topic_score_gemma":0.0032246094,"teacher_disagreement_score":0.004135763,"about_ca_system_score_codex":0.00067876367,"about_ca_system_score_gemma":0.0007524689,"threshold_uncertainty_score":0.0138347745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012287467,0.00008550676,0.9795009,0.0004393059,0.000045759745,0.00012470549,0.000030172452,0.00024349392,0.0072427676],"genre_scores_gemma":[0.6244538,0.00019416063,0.37038288,0.0003389578,0.00006756121,0.0005135002,0.00007793167,0.00013989961,0.0038312883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834454,0.0009359586,0.00005611249,0.0003074522,0.00022233532,0.00013362968],"domain_scores_gemma":[0.99750537,0.0014592077,0.00023051191,0.00041138084,0.00016623604,0.00022729595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025622963,0.00074224646,0.00042784345,0.00049197924,0.00053390197,0.0019478672,0.0020225586,0.0011949411,0.0035416116],"category_scores_gemma":[0.0076778247,0.0003815779,0.0005599924,0.00031575284,0.0025331746,0.0027104241,0.0029514018,0.0019395734,0.00031913634],"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.00019663935,0.00027767406,0.0017564492,0.00016063798,0.00008387609,0.00034005832,0.0020615726,0.40083215,0.0064678574,0.49274892,0.0021493565,0.09292483],"study_design_scores_gemma":[0.000046650228,0.00012684402,0.00033880843,0.000040128427,0.00003372546,0.000074598196,0.00028413124,0.81344795,0.0021160308,0.1703621,0.013083231,0.00004580538],"about_ca_topic_score_codex":0.0027260557,"about_ca_topic_score_gemma":0.0024832864,"teacher_disagreement_score":0.0035416116,"about_ca_system_score_codex":0.001000005,"about_ca_system_score_gemma":0.001377396,"threshold_uncertainty_score":0.013550878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022476558,0.00040090687,0.9552527,0.00048410887,0.00007680414,0.00014875502,0.000040627707,0.001125254,0.019994188],"genre_scores_gemma":[0.44601476,0.0005638365,0.54091805,0.00027202704,0.00006872479,0.00032228898,0.000119270146,0.0002642001,0.011456784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991398,0.0003913928,0.00006121858,0.00010046671,0.0002357385,0.00007144997],"domain_scores_gemma":[0.99860054,0.0007841704,0.0001123397,0.00021000954,0.00020113902,0.00009168025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013234529,0.00060130015,0.0005155671,0.0006566497,0.00048779623,0.0018753392,0.0013916469,0.0011569952,0.0036058174],"category_scores_gemma":[0.0054116924,0.00049356336,0.00042838807,0.00052632205,0.0012480197,0.0022494295,0.0017196948,0.0012272098,0.00080365886],"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.00012162812,0.00018072175,0.0015003757,0.00017630483,0.00009227759,0.00016355368,0.00043609575,0.5638434,0.0047275377,0.2983069,0.0025442154,0.12790698],"study_design_scores_gemma":[0.000043813943,0.00005908627,0.00012415281,0.000023791938,0.000022006298,0.000040152176,0.000044540342,0.93394643,0.0013424736,0.052784424,0.0115565,0.000012564043],"about_ca_topic_score_codex":0.0031547453,"about_ca_topic_score_gemma":0.00391911,"teacher_disagreement_score":0.0036058174,"about_ca_system_score_codex":0.0007474782,"about_ca_system_score_gemma":0.001236316,"threshold_uncertainty_score":0.012062669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09159674,0.0006358561,0.4623357,0.001148383,0.0004163319,0.00050483365,0.0005417593,0.001592247,0.44122818],"genre_scores_gemma":[0.7540209,0.0005101634,0.13494802,0.0006033553,0.00014430973,0.0005585717,0.0007528004,0.00032663348,0.10813525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993636,0.00014207733,0.00002213841,0.00013121059,0.00016654063,0.00017437819],"domain_scores_gemma":[0.99960464,0.00011155893,0.000037537324,0.00009529973,0.00005415653,0.00009686355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003717898,0.00079647143,0.0010145222,0.00063228904,0.0019199272,0.0022252982,0.0023596068,0.0017925884,0.023291029],"category_scores_gemma":[0.0016917629,0.0003313857,0.00091476616,0.00071373826,0.001697223,0.0028893503,0.002652884,0.0015224477,0.0033904149],"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.00014122436,0.00011840488,0.00018422063,0.00014647134,0.000026171534,0.00017927024,0.00013849574,0.033797994,0.0022184567,0.9264337,0.0061367922,0.03047886],"study_design_scores_gemma":[0.0001195623,0.00010888638,0.00016659085,0.000049497,0.000028594177,0.0003244763,0.00014785108,0.19428356,0.003000429,0.7569753,0.044753537,0.000041664873],"about_ca_topic_score_codex":0.0007707179,"about_ca_topic_score_gemma":0.0016690437,"teacher_disagreement_score":0.023291029,"about_ca_system_score_codex":0.0011665868,"about_ca_system_score_gemma":0.0010841954,"threshold_uncertainty_score":0.077916205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21893176,0.0007395116,0.72568744,0.0014663615,0.00028761305,0.0010749616,0.019320328,0.007877446,0.02461459],"genre_scores_gemma":[0.62962294,0.00066113763,0.33753374,0.00017725716,0.000081657854,0.0009688952,0.015082743,0.0006774692,0.015194257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798965,0.00045599914,0.00017591931,0.000556439,0.0006691114,0.00015284572],"domain_scores_gemma":[0.99190813,0.005343788,0.0004974134,0.00062320393,0.0013674961,0.00025987256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021918819,0.00059547654,0.00035131248,0.00400066,0.0010783898,0.0023976145,0.0006993705,0.0006609909,0.008788507],"category_scores_gemma":[0.014546943,0.00033644773,0.0009044054,0.0030422474,0.0008910376,0.0030767152,0.0012886955,0.00079353584,0.0010951088],"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.0012358576,0.00044172126,0.04001989,0.0012645337,0.00010794485,0.0020410009,0.016694115,0.060658846,0.016389495,0.17737646,0.023122432,0.66064775],"study_design_scores_gemma":[0.00010396637,0.00026379095,0.023778941,0.0005749993,0.000090282505,0.0007636754,0.006863492,0.55359286,0.041188337,0.12340302,0.24922341,0.0001531612],"about_ca_topic_score_codex":0.012017684,"about_ca_topic_score_gemma":0.009784555,"teacher_disagreement_score":0.012017684,"about_ca_system_score_codex":0.0024144538,"about_ca_system_score_gemma":0.0017744707,"threshold_uncertainty_score":0.029400468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07014296,0.00079439307,0.92371637,0.00067168055,0.000049142716,0.000113690454,0.00009521496,0.0013664984,0.0030500665],"genre_scores_gemma":[0.8110819,0.00031631484,0.1846754,0.0002679784,0.00005286469,0.00029411496,0.00032258726,0.00027159948,0.0027172565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986345,0.00054824987,0.000081554834,0.00032939835,0.00025586132,0.00015042632],"domain_scores_gemma":[0.99189126,0.0058831167,0.0005263613,0.0008453916,0.0005196315,0.00033409268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00265185,0.0014140503,0.0023320995,0.0013074683,0.0013353582,0.0013566273,0.002136834,0.0020487362,0.003054828],"category_scores_gemma":[0.015508932,0.001057295,0.0012648682,0.0011740621,0.0025286686,0.0043479353,0.0039110878,0.0025586186,0.0005089282],"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.00011190991,0.00007672239,0.0012425532,0.0000689626,0.00004028868,0.00005826776,0.000110799214,0.9386878,0.00050529954,0.01530618,0.00102383,0.04276742],"study_design_scores_gemma":[0.000009262255,0.000028505001,0.000056728717,0.000006497169,0.0000037533298,0.000010202024,0.000007056203,0.9902473,0.00019375028,0.009262277,0.00017051553,0.0000041699304],"about_ca_topic_score_codex":0.008113426,"about_ca_topic_score_gemma":0.0074243727,"teacher_disagreement_score":0.008113426,"about_ca_system_score_codex":0.0018790406,"about_ca_system_score_gemma":0.0021473456,"threshold_uncertainty_score":0.016132355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073503517,0.000058761074,0.9899545,0.000083870946,0.000013110204,0.000039397004,0.000027077887,0.00048199284,0.0019910166],"genre_scores_gemma":[0.33946332,0.00016352587,0.65345174,0.00013187376,0.000018614277,0.0002614547,0.00016718042,0.0011156925,0.005226631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998475,0.00061258214,0.00008080437,0.0003171733,0.00038314966,0.00013129172],"domain_scores_gemma":[0.99565226,0.003251935,0.00020687426,0.00052169827,0.0002065417,0.00016069338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428101,0.001163029,0.0007447508,0.0010386014,0.0011600085,0.0019555935,0.0022960103,0.0019814926,0.005515979],"category_scores_gemma":[0.008543329,0.0012782607,0.0016439221,0.00048690915,0.004321267,0.002190759,0.003715836,0.002211702,0.0010092979],"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.00007750998,0.00007599073,0.001439125,0.00016980445,0.0000378115,0.00019890792,0.0013106707,0.741673,0.008325801,0.2043777,0.0011959752,0.04111766],"study_design_scores_gemma":[0.00002794592,0.000030079369,0.00013496487,0.00003523248,0.0000144735895,0.00006524955,0.000105554536,0.8997376,0.0032412736,0.09262206,0.0039638523,0.000021762145],"about_ca_topic_score_codex":0.0037579373,"about_ca_topic_score_gemma":0.007402089,"teacher_disagreement_score":0.005515979,"about_ca_system_score_codex":0.0018623193,"about_ca_system_score_gemma":0.0011387515,"threshold_uncertainty_score":0.018452823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042573843,0.00033677559,0.94002074,0.00026107224,0.000107051506,0.00026068612,0.00016337732,0.009022765,0.0072537265],"genre_scores_gemma":[0.5321,0.00033470665,0.45735905,0.0002483342,0.000057823218,0.00028410048,0.0005758249,0.00033672818,0.008703479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993319,0.00015072127,0.00006444834,0.00016747216,0.0002157871,0.000069660615],"domain_scores_gemma":[0.9986443,0.0005800977,0.00020874717,0.00017190685,0.0002949278,0.00010018186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008203541,0.00066131604,0.0005831056,0.00069938984,0.00037157454,0.0011576351,0.0012586135,0.0008811636,0.0032177884],"category_scores_gemma":[0.0047285757,0.00029377727,0.0005727854,0.0003237447,0.00067400554,0.0015624074,0.0006271534,0.0010679038,0.0014923448],"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.0006969147,0.00059800927,0.009246722,0.0005163931,0.0001697392,0.0007679657,0.0013955331,0.06596366,0.120812416,0.045132633,0.010494585,0.7442053],"study_design_scores_gemma":[0.00003164651,0.00015348553,0.0043000416,0.000046268568,0.00004243806,0.00034701327,0.00015573732,0.94348925,0.022844406,0.017987333,0.010541384,0.00006101775],"about_ca_topic_score_codex":0.0049914923,"about_ca_topic_score_gemma":0.0055492013,"teacher_disagreement_score":0.0049914923,"about_ca_system_score_codex":0.0010443969,"about_ca_system_score_gemma":0.00063726987,"threshold_uncertainty_score":0.010764539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14188255,0.00062447134,0.8197699,0.0016259864,0.0001571325,0.00055247167,0.00038610213,0.0010917783,0.033909637],"genre_scores_gemma":[0.876604,0.00021782605,0.11220527,0.0006766399,0.00008503298,0.0004935717,0.00026707092,0.00015506962,0.0092953965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580777,0.001376798,0.00027235044,0.0006835019,0.0013811839,0.00047843662],"domain_scores_gemma":[0.9793285,0.012832175,0.0025004197,0.0029937723,0.0015808257,0.0007642595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046878858,0.0017359649,0.0016033952,0.0015866705,0.0008196809,0.0028400833,0.003209034,0.00284108,0.005751634],"category_scores_gemma":[0.029601468,0.0005462981,0.0008569832,0.0009965712,0.0020338015,0.004524932,0.003930771,0.0019864975,0.0012662268],"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.0017583398,0.00047245435,0.005285831,0.0004726619,0.000512219,0.00094817195,0.00080251583,0.49984485,0.020116553,0.29283184,0.008112032,0.1688426],"study_design_scores_gemma":[0.00013932302,0.00029507288,0.00044705562,0.00005213947,0.0000734538,0.00038969834,0.00011959521,0.8822556,0.0051377458,0.10787847,0.0031572373,0.000054598775],"about_ca_topic_score_codex":0.0011016736,"about_ca_topic_score_gemma":0.0010734008,"teacher_disagreement_score":0.005751634,"about_ca_system_score_codex":0.0014975442,"about_ca_system_score_gemma":0.0018749089,"threshold_uncertainty_score":0.024792254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06489643,0.00011422672,0.9309908,0.00011098613,0.000028619688,0.00015582166,0.000064686785,0.0006914877,0.0029468606],"genre_scores_gemma":[0.68731576,0.00012453941,0.30903083,0.00008399576,0.000017652634,0.00041841483,0.00017068979,0.00019990897,0.0026382098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.00032338916,0.000054964705,0.00019126074,0.00024266672,0.00010689843],"domain_scores_gemma":[0.99689317,0.0023338103,0.00018731841,0.00029670302,0.00013218756,0.00015684226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021630393,0.0011249583,0.0011108589,0.0007758533,0.00052107446,0.0010415596,0.0011995371,0.0008316954,0.0036077609],"category_scores_gemma":[0.008657959,0.0006921758,0.00086194515,0.0004373717,0.0016996582,0.0025560667,0.0022674105,0.0017610873,0.00046070447],"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.00029239152,0.00014615693,0.001396354,0.00012213127,0.00004873573,0.00017820908,0.0005322822,0.8168553,0.0066415584,0.07942764,0.0008608547,0.093498364],"study_design_scores_gemma":[0.00003132,0.00007357264,0.00012641138,0.000014773514,0.000007875375,0.000015235934,0.000032607364,0.95488614,0.0016401972,0.042409748,0.00075308676,0.000009048747],"about_ca_topic_score_codex":0.0016779996,"about_ca_topic_score_gemma":0.002430588,"teacher_disagreement_score":0.0036077609,"about_ca_system_score_codex":0.0010235435,"about_ca_system_score_gemma":0.0009157312,"threshold_uncertainty_score":0.012069106},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04754154,0.00014730566,0.91863686,0.00022923894,0.00010240238,0.00031238055,0.00024026186,0.01907521,0.013714766],"genre_scores_gemma":[0.29668352,0.000113763184,0.6894247,0.00023835433,0.000012013742,0.00021180353,0.0009462206,0.002648658,0.00972098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993062,0.0001708471,0.000048898586,0.00014769545,0.0002611567,0.00006528065],"domain_scores_gemma":[0.9991918,0.0003022937,0.000047010784,0.00023047789,0.00016660508,0.000061760926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008912983,0.0007661895,0.000488693,0.0006580944,0.00046512374,0.001030728,0.0016960269,0.00078755565,0.0059437677],"category_scores_gemma":[0.0040136827,0.00054273824,0.00055477617,0.00026543924,0.0009503098,0.0017852852,0.00226199,0.0009908275,0.0015626276],"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.0007236405,0.00044948386,0.004826599,0.00046094132,0.00014830909,0.0005726278,0.0010038316,0.15676428,0.059715357,0.11293762,0.025407929,0.63698936],"study_design_scores_gemma":[0.00015758844,0.00031379217,0.00070262246,0.00007438507,0.000041682695,0.0002374072,0.00014168311,0.8829262,0.040264208,0.044329382,0.030756785,0.000054261047],"about_ca_topic_score_codex":0.0021722617,"about_ca_topic_score_gemma":0.0034934878,"teacher_disagreement_score":0.0059437677,"about_ca_system_score_codex":0.0006779769,"about_ca_system_score_gemma":0.001141246,"threshold_uncertainty_score":0.01988393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14376236,0.00046119816,0.8434709,0.0005962136,0.00009014674,0.000120308905,0.000115215575,0.0007524098,0.010631236],"genre_scores_gemma":[0.95872116,0.0001390903,0.037176248,0.00010748722,0.000023357876,0.00007878826,0.00007135271,0.00004324914,0.0036392573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994294,0.00023700466,0.000025791574,0.00007991324,0.00011277767,0.00011511898],"domain_scores_gemma":[0.99796665,0.0014368284,0.00018708249,0.00012025679,0.00013662443,0.00015254339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011713983,0.0007779618,0.00094248756,0.0004713882,0.00038668717,0.000720044,0.0011450759,0.00093168346,0.0032320437],"category_scores_gemma":[0.003988918,0.00039083406,0.00054219476,0.0004086535,0.0013464129,0.0010983789,0.0011920235,0.0012597517,0.00030356093],"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.000020770178,0.000009076917,0.00010596221,0.0000075937464,0.000006099309,0.000014337458,0.000011770548,0.99116313,0.00020061663,0.0064046313,0.00014416948,0.0019118863],"study_design_scores_gemma":[0.0000033321598,0.0000070095534,0.000019775418,8.1954084e-7,8.817581e-7,0.0000018024114,0.0000012898513,0.99802506,0.000054597615,0.0018375955,0.000046937977,0.0000010125231],"about_ca_topic_score_codex":0.010400488,"about_ca_topic_score_gemma":0.0065126186,"teacher_disagreement_score":0.010400488,"about_ca_system_score_codex":0.0015554478,"about_ca_system_score_gemma":0.0013696653,"threshold_uncertainty_score":0.020679891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14198403,0.00028133098,0.8157467,0.0032084654,0.000061169885,0.00013194309,0.00045882224,0.0005100561,0.03761744],"genre_scores_gemma":[0.8836987,0.00024043623,0.10367106,0.00038846376,0.00004593487,0.00033647782,0.00032147334,0.00012502597,0.011172354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948657,0.00021937226,0.000017153552,0.000114098555,0.00009543662,0.000067328234],"domain_scores_gemma":[0.99812037,0.0013114857,0.00014042821,0.00021800907,0.00010641118,0.00010332943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000838189,0.0005133163,0.00045836074,0.0007297474,0.0007475819,0.0015101029,0.0015390511,0.0014427698,0.0048793703],"category_scores_gemma":[0.0037479799,0.00049353327,0.0011837188,0.00036678286,0.002658904,0.0020746782,0.0011487817,0.0013648747,0.00061742513],"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.000053858523,0.00008480378,0.00245879,0.000054144086,0.000047987123,0.00023971948,0.0009431409,0.27440017,0.0015410116,0.7118472,0.0017791425,0.006550058],"study_design_scores_gemma":[0.000019004998,0.000023327377,0.00044503974,0.000009890743,0.000014533418,0.00010509786,0.000054972075,0.7682455,0.00012977049,0.22976094,0.0011754255,0.000016353611],"about_ca_topic_score_codex":0.006408304,"about_ca_topic_score_gemma":0.0059960056,"teacher_disagreement_score":0.006408304,"about_ca_system_score_codex":0.0013063032,"about_ca_system_score_gemma":0.0010121082,"threshold_uncertainty_score":0.01632315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030327445,0.0001018017,0.87309456,0.00018872548,0.00015684929,0.0008306666,0.0010560913,0.07232284,0.02192102],"genre_scores_gemma":[0.19811219,0.00029015902,0.7368622,0.00024090923,0.000046579436,0.0014289874,0.005901013,0.016291631,0.040826447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944896,0.00011283247,0.00006155329,0.00010719984,0.00021307953,0.00005640475],"domain_scores_gemma":[0.998684,0.00042095064,0.00009689032,0.00042227752,0.0001753972,0.00020051764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587545,0.0010416101,0.0003535712,0.0006060936,0.0004022758,0.002083745,0.0019325479,0.00069214153,0.011894051],"category_scores_gemma":[0.003655016,0.00078572956,0.0009002824,0.0003092684,0.00075070624,0.0028234664,0.002537903,0.001276102,0.0037052277],"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.0019148173,0.0011020652,0.009032673,0.0015269568,0.00023351565,0.0031417948,0.0077012605,0.02335487,0.14357446,0.103652254,0.113474526,0.5912908],"study_design_scores_gemma":[0.00050272915,0.00076572906,0.0043242844,0.00022461932,0.000095003656,0.0029454008,0.00072667433,0.27744612,0.15001842,0.03731009,0.5253881,0.00025293123],"about_ca_topic_score_codex":0.0007656151,"about_ca_topic_score_gemma":0.0010967102,"teacher_disagreement_score":0.011894051,"about_ca_system_score_codex":0.000326659,"about_ca_system_score_gemma":0.00063953147,"threshold_uncertainty_score":0.039789557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134674385,0.0015949842,0.94667345,0.011083914,0.00032607987,0.00013877134,0.00015814473,0.0019125872,0.024644632],"genre_scores_gemma":[0.31735498,0.001430998,0.6688976,0.0021665324,0.00034385448,0.00042985924,0.00039647555,0.00078707683,0.008192647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721575,0.0015999507,0.0001541798,0.0004921873,0.00042578406,0.000112136],"domain_scores_gemma":[0.9950304,0.003302024,0.0002564094,0.0008211372,0.00030597803,0.00028396043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034392967,0.00094734004,0.0006363228,0.0007053474,0.00088142516,0.006713456,0.0026237534,0.002984429,0.0060793],"category_scores_gemma":[0.009698309,0.0012477974,0.0017585803,0.00042579972,0.004971825,0.010887637,0.0025884348,0.004023441,0.0018286679],"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.00032726268,0.0003288346,0.0028121849,0.0009416531,0.00014352916,0.0006149011,0.013110517,0.05696163,0.014001088,0.74470913,0.0119087845,0.15414047],"study_design_scores_gemma":[0.00008665281,0.00012653912,0.0011381822,0.00040033655,0.00010752078,0.00046624168,0.0017386029,0.27731144,0.0049174093,0.5893935,0.124184616,0.0001289986],"about_ca_topic_score_codex":0.0017807708,"about_ca_topic_score_gemma":0.0019926263,"teacher_disagreement_score":0.006713456,"about_ca_system_score_codex":0.0015887545,"about_ca_system_score_gemma":0.0008041959,"threshold_uncertainty_score":0.020337224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010809856,0.0004970663,0.9554812,0.0004015058,0.00010109152,0.00058003026,0.0006895599,0.010616744,0.020822851],"genre_scores_gemma":[0.16980088,0.00057429046,0.8052966,0.00036610945,0.000048884423,0.0013597377,0.0022205992,0.0021327042,0.018200161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896204,0.00030063305,0.00015581294,0.00015165412,0.00036497842,0.00006487939],"domain_scores_gemma":[0.99897003,0.0003678434,0.00010028567,0.00031536867,0.0001495598,0.00009686467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007335253,0.00088478555,0.00032948705,0.00065391435,0.0006271226,0.0022055462,0.0015600036,0.0008829302,0.011518949],"category_scores_gemma":[0.004261823,0.0008177992,0.0008764417,0.00064144883,0.0011512405,0.002580504,0.002128191,0.0017035771,0.0030852917],"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.00045739132,0.0003002811,0.002572603,0.00084760034,0.00007671066,0.0006656426,0.00270635,0.023858504,0.020855268,0.6030854,0.037406407,0.30716774],"study_design_scores_gemma":[0.00014566077,0.0001939015,0.0013091267,0.0002547136,0.000048787784,0.0010453317,0.0004250027,0.16873546,0.01508128,0.36880407,0.44388252,0.00007415577],"about_ca_topic_score_codex":0.0016963837,"about_ca_topic_score_gemma":0.0029086873,"teacher_disagreement_score":0.011518949,"about_ca_system_score_codex":0.0006429925,"about_ca_system_score_gemma":0.0005340865,"threshold_uncertainty_score":0.03853476},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34954917,0.0012079981,0.017138168,0.007999144,0.011226326,0.0014542078,0.005993305,0.0033506402,0.60208094],"genre_scores_gemma":[0.49355212,0.00065861625,0.022261625,0.0017313794,0.00213066,0.0012780315,0.012929282,0.0012221438,0.46423608],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657947,0.00048605562,0.0000781702,0.00027323217,0.0017649584,0.0008181697],"domain_scores_gemma":[0.9910342,0.0005575436,0.00016382405,0.00032741867,0.001877261,0.006039783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039214916,0.0005526219,0.00062372943,0.0015249925,0.005022539,0.008298471,0.0014017953,0.0014977782,0.04222943],"category_scores_gemma":[0.0062242886,0.00033217296,0.00070071575,0.0010486515,0.0009949494,0.003078418,0.0075888173,0.004963161,0.01198489],"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.0032758291,0.0033433654,0.011740278,0.00046199615,0.0000845766,0.0012075596,0.026988076,0.0011889073,0.0083929915,0.027327258,0.6514778,0.26451135],"study_design_scores_gemma":[0.00013561768,0.0013648609,0.022844616,0.00019593119,0.000023315815,0.00035588857,0.010559433,0.0016045761,0.003831859,0.0040235645,0.9549326,0.00012782941],"about_ca_topic_score_codex":0.0040453253,"about_ca_topic_score_gemma":0.025140474,"teacher_disagreement_score":0.04222943,"about_ca_system_score_codex":0.0017418525,"about_ca_system_score_gemma":0.0024596504,"threshold_uncertainty_score":0.14127159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957528,0.000040281488,0.001951747,0.000032044718,0.0000034022062,0.00030625187,0.000029823817,0.000059992006,0.001823463],"genre_scores_gemma":[0.98890966,0.000044257522,0.009901967,0.000018754135,0.0000028929715,0.00039289723,0.00009108914,0.0000127745325,0.0006255813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977003,0.0013740603,0.0001756735,0.00024188604,0.00039599967,0.00011206323],"domain_scores_gemma":[0.9752212,0.018524984,0.0022333828,0.0010796622,0.0013314515,0.0016093351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041594603,0.00062973786,0.00031054742,0.0005112625,0.00037495178,0.0018311074,0.00073491107,0.00045016277,0.0027348916],"category_scores_gemma":[0.02824824,0.00030912837,0.0003476839,0.00024402846,0.00063173036,0.0012052768,0.0009654605,0.000649814,0.00031987808],"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.013729732,0.02640385,0.35720065,0.0031650425,0.0007369429,0.0005756908,0.059665903,0.018983329,0.04519886,0.0038504167,0.0033589855,0.46713066],"study_design_scores_gemma":[0.0023600564,0.060369577,0.7448843,0.000405279,0.0015525096,0.0005795692,0.034058157,0.10953883,0.032594033,0.0029751656,0.010337946,0.00034451703],"about_ca_topic_score_codex":0.0012062541,"about_ca_topic_score_gemma":0.0021906414,"teacher_disagreement_score":0.0041594603,"about_ca_system_score_codex":0.000730383,"about_ca_system_score_gemma":0.0005053048,"threshold_uncertainty_score":0.02199763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031649057,0.000039239603,0.95990247,0.00012592458,0.000020846992,0.00044072984,0.000105896426,0.00467376,0.0030421424],"genre_scores_gemma":[0.27538052,0.00008564552,0.71910894,0.00008944343,0.0000066359294,0.0005989785,0.00036081026,0.0009051891,0.003463816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984617,0.00065539713,0.00016357389,0.00029769551,0.00033224173,0.00008944401],"domain_scores_gemma":[0.9967062,0.0018187675,0.00034946372,0.00059579214,0.00038666523,0.00014316804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001659575,0.00091008167,0.0003299787,0.0006787595,0.00037256896,0.0011430695,0.0016234546,0.00070718833,0.002079467],"category_scores_gemma":[0.00870872,0.0007750641,0.00070578617,0.00027922555,0.0012424724,0.0015720804,0.0010036889,0.0010439303,0.00087824493],"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.0005916752,0.0009205513,0.01855261,0.00093540683,0.00015047677,0.0011608017,0.0076322313,0.31273457,0.051248014,0.1451813,0.0073198043,0.45357257],"study_design_scores_gemma":[0.00008210604,0.00015928532,0.0010500116,0.000079905854,0.00004572671,0.00030706884,0.00022550832,0.9219977,0.022445304,0.033962686,0.019591924,0.00005281132],"about_ca_topic_score_codex":0.002367465,"about_ca_topic_score_gemma":0.004047518,"teacher_disagreement_score":0.002367465,"about_ca_system_score_codex":0.0011843804,"about_ca_system_score_gemma":0.0010137617,"threshold_uncertainty_score":0.008776784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036793336,0.00025912264,0.95682675,0.00028710207,0.000031821557,0.00010313538,0.000101035774,0.0003246814,0.0052729477],"genre_scores_gemma":[0.8025454,0.00035033183,0.19255942,0.00014656674,0.000032126143,0.00024591348,0.00025591376,0.00011698366,0.0037472793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.0003424017,0.00003494546,0.00013721359,0.00015642094,0.00010059173],"domain_scores_gemma":[0.99555826,0.003667763,0.00024289075,0.00018272178,0.00014003355,0.0002082907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735706,0.0009428684,0.00086050987,0.0005359966,0.00060679094,0.00074292405,0.0013202834,0.0007561723,0.0038001847],"category_scores_gemma":[0.0068629296,0.00037555548,0.0006135935,0.0006007868,0.0013179007,0.0022330107,0.0015616571,0.0016636905,0.00031760507],"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.000056891546,0.000034040895,0.00031100994,0.000043067565,0.000016986647,0.00003356813,0.000062941624,0.95587784,0.00028183576,0.03057133,0.0007596906,0.011950762],"study_design_scores_gemma":[0.0000061581686,0.00001221078,0.00003210011,0.000002913566,0.0000026513828,0.0000056432223,0.00000684285,0.98370355,0.00007848453,0.015903499,0.00024336281,0.0000024837937],"about_ca_topic_score_codex":0.011898999,"about_ca_topic_score_gemma":0.0134569835,"teacher_disagreement_score":0.011898999,"about_ca_system_score_codex":0.0017909604,"about_ca_system_score_gemma":0.0018659463,"threshold_uncertainty_score":0.023659468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20374472,0.00018298766,0.79072696,0.00028616743,0.000029944818,0.00026256253,0.000030778996,0.0010721325,0.003663701],"genre_scores_gemma":[0.9122762,0.00007463183,0.08641912,0.00006886641,0.000010784226,0.00018956108,0.000034145618,0.00003113299,0.000895529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919564,0.00043480916,0.00004303014,0.00013700746,0.00012182093,0.00006767372],"domain_scores_gemma":[0.9970024,0.0020913067,0.00027125378,0.00018002608,0.00027413628,0.00018083084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016607858,0.00094734726,0.0006743868,0.00033271336,0.0002519649,0.0005562983,0.0010690495,0.00062784774,0.0009800218],"category_scores_gemma":[0.006920649,0.0003680533,0.00030100698,0.00016941673,0.00069657806,0.0010012911,0.00074440695,0.0010801974,0.00017716798],"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.00033506384,0.0010583916,0.006196959,0.00018357621,0.0000983492,0.00016230048,0.00038333537,0.84508026,0.008883258,0.0076985536,0.0009789726,0.128941],"study_design_scores_gemma":[0.00003573226,0.00012366634,0.00030289084,0.00000687634,0.000008235209,0.000018100425,0.000017230579,0.99437356,0.0014262451,0.0033462215,0.00033383162,0.0000073458828],"about_ca_topic_score_codex":0.0023145822,"about_ca_topic_score_gemma":0.0028606427,"teacher_disagreement_score":0.0023145822,"about_ca_system_score_codex":0.00062430365,"about_ca_system_score_gemma":0.0006643732,"threshold_uncertainty_score":0.008783162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16033809,0.00073359243,0.6612749,0.0015102803,0.00027987268,0.00049645535,0.0011732699,0.00077381777,0.17341968],"genre_scores_gemma":[0.82967705,0.0003741386,0.12893625,0.00057470775,0.00019065297,0.000386894,0.0010413562,0.00017254622,0.038646378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735886,0.0007004745,0.00021909553,0.0006270108,0.00070369605,0.00039078496],"domain_scores_gemma":[0.9982874,0.0006548504,0.00017930295,0.00031760675,0.0003168982,0.0002438622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059457,0.0007054412,0.00079763046,0.00088210654,0.0016237283,0.0033302847,0.0013411593,0.0010693275,0.009874101],"category_scores_gemma":[0.004169355,0.00031633436,0.0010150969,0.00070562103,0.0028831435,0.0037067966,0.0022614412,0.0018427977,0.0012099411],"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.00003526134,0.000023346542,0.00034130242,0.000032626023,0.000010288502,0.000049600563,0.00019474805,0.0013697245,0.00060421356,0.9865513,0.001274385,0.009513083],"study_design_scores_gemma":[0.000026789938,0.000043360626,0.00032845527,0.000024354162,0.000012340476,0.00011331815,0.00011965724,0.012439625,0.0007390244,0.96730405,0.01883222,0.000016728396],"about_ca_topic_score_codex":0.0024819886,"about_ca_topic_score_gemma":0.0022966866,"teacher_disagreement_score":0.009874101,"about_ca_system_score_codex":0.001543905,"about_ca_system_score_gemma":0.0011656027,"threshold_uncertainty_score":0.03303218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006095374,0.00052842754,0.9877653,0.000468656,0.000044925713,0.00015218378,0.000027678196,0.00020886154,0.0047085183],"genre_scores_gemma":[0.18270038,0.0008585414,0.81296974,0.00024511237,0.00011033675,0.0005799931,0.00022387464,0.00014923693,0.0021627995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99131423,0.0047292067,0.00051154353,0.0009558085,0.0020314623,0.00045780622],"domain_scores_gemma":[0.96584857,0.027088761,0.0016545353,0.0030590082,0.001832396,0.000516742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010116225,0.0012102368,0.0013352584,0.0023859355,0.0015082369,0.0041029695,0.0037022212,0.002311335,0.0052896123],"category_scores_gemma":[0.04625238,0.0011590935,0.0013199496,0.0031878417,0.0054989015,0.006517897,0.0039250487,0.0033368785,0.00111245],"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.00014260384,0.00016802485,0.00096138456,0.00023877183,0.00006351531,0.00017616479,0.0004785838,0.5777277,0.0010548382,0.28130966,0.0022743747,0.13540438],"study_design_scores_gemma":[0.00007874849,0.000074648844,0.00015163627,0.00007421882,0.00002601219,0.00010931809,0.00008208359,0.8324633,0.0010509952,0.16007587,0.005784298,0.000028896964],"about_ca_topic_score_codex":0.0065871757,"about_ca_topic_score_gemma":0.0054248255,"teacher_disagreement_score":0.010116225,"about_ca_system_score_codex":0.0031843067,"about_ca_system_score_gemma":0.0034271409,"threshold_uncertainty_score":0.053500295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18346834,0.000706746,0.66867733,0.0018013595,0.00026907166,0.00093635864,0.0028782166,0.019374719,0.12188789],"genre_scores_gemma":[0.511709,0.00041054958,0.45230308,0.00023978109,0.000047654816,0.00040543388,0.0029385586,0.0008358136,0.031110162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995009,0.00021764205,0.00003842186,0.0001195851,0.00008678721,0.000036764242],"domain_scores_gemma":[0.99845004,0.0008325483,0.00011658442,0.00029905216,0.00011692849,0.00018493761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071669975,0.0006895869,0.0003674799,0.00043956167,0.000664014,0.0018469759,0.0010442048,0.0008904485,0.02005863],"category_scores_gemma":[0.0035712048,0.00029348306,0.00047570735,0.0003475106,0.0007856988,0.003179786,0.00175404,0.00076844636,0.004151717],"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.0017251645,0.0010166755,0.013422623,0.0017910057,0.00014114495,0.003718568,0.0343763,0.012846874,0.07058448,0.11398401,0.05666873,0.6897244],"study_design_scores_gemma":[0.00037362598,0.0014739452,0.009319838,0.0003573599,0.00024126004,0.0068426575,0.008669539,0.14426425,0.06580355,0.06333734,0.6990916,0.00022500266],"about_ca_topic_score_codex":0.0016802218,"about_ca_topic_score_gemma":0.0040528364,"teacher_disagreement_score":0.02005863,"about_ca_system_score_codex":0.00041259747,"about_ca_system_score_gemma":0.0004557775,"threshold_uncertainty_score":0.06710279},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028206455,0.00032286547,0.9631013,0.00021441226,0.000046327914,0.00008597475,0.000079211655,0.00035129066,0.0075920885],"genre_scores_gemma":[0.42291793,0.00044721342,0.5685137,0.00035711285,0.0000823681,0.00037601317,0.00035068858,0.00026519736,0.0066896463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986808,0.00045960973,0.000057890662,0.00018280887,0.00041929257,0.00019966898],"domain_scores_gemma":[0.9976757,0.0015316004,0.0001509098,0.00029758541,0.0002397754,0.00010435795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019407333,0.0011722222,0.0010994378,0.0009621979,0.0008291332,0.0010540953,0.0015345928,0.00084375637,0.0031570378],"category_scores_gemma":[0.0070522497,0.0006346451,0.0010568298,0.000658127,0.0009864199,0.0021499167,0.0018358032,0.0027277388,0.0006909282],"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.00048354614,0.00027807694,0.0018437058,0.0003519002,0.00015922691,0.0003742577,0.00035400735,0.36744463,0.01537445,0.34586233,0.008784867,0.25868902],"study_design_scores_gemma":[0.000047325764,0.00009841625,0.00029137506,0.00004701115,0.000028490083,0.000106467334,0.000029671908,0.82788545,0.0035855847,0.16428454,0.003583151,0.00001254112],"about_ca_topic_score_codex":0.001849482,"about_ca_topic_score_gemma":0.0028097965,"teacher_disagreement_score":0.0031570378,"about_ca_system_score_codex":0.00087264815,"about_ca_system_score_gemma":0.0012925257,"threshold_uncertainty_score":0.010561407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008023436,0.000341612,0.9625774,0.0007652775,0.00015696575,0.0003194631,0.0001148605,0.0021138473,0.025587127],"genre_scores_gemma":[0.17592873,0.0005269421,0.8040892,0.0002112037,0.000065951834,0.00053166883,0.00043769018,0.00039264932,0.017815977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992866,0.00031764648,0.000045150777,0.00012404562,0.00018917388,0.000037450445],"domain_scores_gemma":[0.999445,0.00021008612,0.00003437355,0.00016288258,0.00009730032,0.00005022683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011766825,0.0005489157,0.00032497387,0.0008342377,0.0010040164,0.0016736949,0.0012765068,0.00082100794,0.012455329],"category_scores_gemma":[0.0033325122,0.0003453485,0.0007871808,0.0004909753,0.000930978,0.0021074906,0.002158008,0.0011224578,0.0017209968],"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.00006725947,0.00014376284,0.0012646264,0.0002640007,0.000054204203,0.0003671817,0.0010962208,0.057169225,0.0077310293,0.6695625,0.016102174,0.24617784],"study_design_scores_gemma":[0.000057784142,0.00009177692,0.00051678333,0.000103063154,0.00003493556,0.00044981204,0.0002889126,0.4481309,0.0040411837,0.37541163,0.17083555,0.00003767491],"about_ca_topic_score_codex":0.00168975,"about_ca_topic_score_gemma":0.0035327494,"teacher_disagreement_score":0.012455329,"about_ca_system_score_codex":0.0010130391,"about_ca_system_score_gemma":0.0007148689,"threshold_uncertainty_score":0.041667163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02454617,0.00672163,0.6005961,0.00664531,0.0008206035,0.00018077422,0.00018514041,0.0002678203,0.36003652],"genre_scores_gemma":[0.60983914,0.0077877073,0.2687214,0.0024708058,0.0015532087,0.0009033045,0.00023587715,0.00044302404,0.10804548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957854,0.00016266791,0.000013563062,0.000056686567,0.00014603027,0.00004242511],"domain_scores_gemma":[0.99955374,0.0002469242,0.000034543977,0.000060454284,0.00006157184,0.000042698117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075571775,0.0009607295,0.00066972827,0.0011953294,0.0012765202,0.0015812913,0.0012225757,0.0013758884,0.006158447],"category_scores_gemma":[0.0018525127,0.00039516343,0.0010153261,0.0007716123,0.004364644,0.00448087,0.0013885444,0.0024665876,0.0013567732],"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.772125e-7,0.0000029254663,0.000012268211,0.000011681706,0.0000017359731,0.000013225272,0.000037273632,0.0012501689,0.00011558892,0.9962993,0.0007977873,0.0014570961],"study_design_scores_gemma":[0.000002572877,0.0000043974924,0.000035717472,0.000007835917,0.0000012894164,0.000031999414,0.000014948388,0.008664109,0.00006667406,0.98515344,0.006013014,0.000004117975],"about_ca_topic_score_codex":0.0013299127,"about_ca_topic_score_gemma":0.0011185724,"teacher_disagreement_score":0.006158447,"about_ca_system_score_codex":0.0023783771,"about_ca_system_score_gemma":0.00089631265,"threshold_uncertainty_score":0.020602047},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003468265,0.08579336,0.0009518466,0.26871443,0.49639553,0.00019352438,0.00033058078,0.00029799438,0.14697592],"genre_scores_gemma":[0.0052259113,0.034118094,0.00063180097,0.17062679,0.16890009,0.00028264537,0.00041620302,0.0002886519,0.61950976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979886,0.0005973768,0.000111031666,0.0002450136,0.0008029316,0.00025515],"domain_scores_gemma":[0.9962603,0.00060925895,0.0001845593,0.0002431557,0.001788597,0.00091419916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024529614,0.0009924306,0.0011040232,0.0022336799,0.002689309,0.0050470876,0.0016147086,0.0042820615,0.14142902],"category_scores_gemma":[0.0119950585,0.00051011133,0.0010226313,0.0013040762,0.0014824993,0.0036854164,0.004112186,0.0078120437,0.10568626],"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.000009645622,0.000006203604,0.000022221257,0.00009791864,0.0000026604152,0.000028490515,0.000018013128,0.000003586052,0.000029562763,0.0018060002,0.9813255,0.016650144],"study_design_scores_gemma":[0.0000053500726,0.0000061932387,0.00007964751,0.00012945548,0.000002712617,0.00005496561,0.00003048544,0.000005382827,0.000017156059,0.0005310588,0.9991352,0.0000023989132],"about_ca_topic_score_codex":0.002253755,"about_ca_topic_score_gemma":0.0042582834,"teacher_disagreement_score":0.14142902,"about_ca_system_score_codex":0.0021225037,"about_ca_system_score_gemma":0.0033050806,"threshold_uncertainty_score":0.4731272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30421358,0.00035866693,0.50405043,0.0015495202,0.0002503013,0.00033680885,0.00050803047,0.00037178447,0.18836088],"genre_scores_gemma":[0.8995784,0.00016428667,0.058868635,0.00019222085,0.000040383078,0.00029093068,0.00033699875,0.00007397385,0.04045414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998334,0.00062791875,0.00009566197,0.00024520568,0.00041809742,0.0002791029],"domain_scores_gemma":[0.9991062,0.0003776366,0.000075808246,0.00014151882,0.000120758865,0.00017809938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013403452,0.0007508161,0.00065731024,0.0005345973,0.0011177486,0.0025190003,0.0011526571,0.0011086351,0.0069311084],"category_scores_gemma":[0.0043136743,0.00034240686,0.00048416603,0.0005108329,0.0028627736,0.0047971723,0.0022827978,0.0015780132,0.0008986532],"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.0002205559,0.000048098067,0.00044499993,0.000041849507,0.000016495329,0.00017135615,0.0004741103,0.010666038,0.0022802253,0.9686547,0.0017650253,0.015216398],"study_design_scores_gemma":[0.00004088461,0.00009303471,0.00029987982,0.000035737132,0.000008767839,0.00011851289,0.00022353907,0.06480011,0.0022160835,0.9189412,0.013186726,0.00003551703],"about_ca_topic_score_codex":0.002452181,"about_ca_topic_score_gemma":0.0021966929,"teacher_disagreement_score":0.0069311084,"about_ca_system_score_codex":0.0014875748,"about_ca_system_score_gemma":0.0010246246,"threshold_uncertainty_score":0.023186803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022420187,0.00082351494,0.9548456,0.00041083706,0.00009438786,0.00009776884,0.00013168839,0.0005398117,0.02063626],"genre_scores_gemma":[0.3492214,0.00079210073,0.63708097,0.0002871532,0.00009902634,0.00042520833,0.00047730235,0.0003239918,0.011292824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.00018386984,0.000029328858,0.00017673333,0.00018886547,0.000087937704],"domain_scores_gemma":[0.9992156,0.00047496145,0.00008695419,0.00007840493,0.00009529534,0.00004873141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079276983,0.0011030813,0.0010664277,0.001195778,0.0006073291,0.0011177522,0.001533536,0.0019449384,0.009649342],"category_scores_gemma":[0.0050188825,0.00045378355,0.00072161714,0.0010599943,0.0010814134,0.001741045,0.0014930612,0.0016503894,0.001160607],"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.00014775016,0.00011018127,0.00030207855,0.0002784598,0.000046768702,0.00008374062,0.00012905842,0.6729648,0.00147561,0.21738541,0.00834867,0.09872746],"study_design_scores_gemma":[0.000051302013,0.00007445736,0.00012237545,0.000044823206,0.000014108715,0.00006413792,0.000041694522,0.84172994,0.00078001857,0.15213673,0.004925515,0.000014951752],"about_ca_topic_score_codex":0.0016800177,"about_ca_topic_score_gemma":0.0014538476,"teacher_disagreement_score":0.009649342,"about_ca_system_score_codex":0.0013445152,"about_ca_system_score_gemma":0.0010466714,"threshold_uncertainty_score":0.032280266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02249191,0.010939084,0.024303705,0.0020396486,0.0007732964,0.00013101462,0.000691349,0.00058647816,0.93804353],"genre_scores_gemma":[0.23154575,0.009607417,0.040811002,0.001179606,0.00025879705,0.0001301772,0.0015707138,0.00021682747,0.71467966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998416,0.00001753387,0.000006346823,0.00004898613,0.00006601858,0.000019538575],"domain_scores_gemma":[0.9999175,0.000040149578,0.0000057896245,0.000010272514,0.000011923805,0.000014260232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011324982,0.0006447929,0.0002781935,0.00060377154,0.00087582815,0.002148473,0.00072836963,0.000620695,0.02491395],"category_scores_gemma":[0.00052752695,0.00022752727,0.000269729,0.0009176098,0.0012721138,0.002047246,0.0006068861,0.000985896,0.0057898615],"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.00016589835,0.00008057471,0.0009960345,0.0005766777,0.000039522394,0.00037104508,0.0013720948,0.0021011478,0.0032406661,0.41974235,0.16129793,0.41001615],"study_design_scores_gemma":[0.000011432045,0.00012622861,0.0018465559,0.00018342627,0.000022367876,0.00097026903,0.00063152594,0.0031265279,0.0020728575,0.08437012,0.9066174,0.00002132319],"about_ca_topic_score_codex":0.0020667985,"about_ca_topic_score_gemma":0.0059107714,"teacher_disagreement_score":0.02491395,"about_ca_system_score_codex":0.00087576924,"about_ca_system_score_gemma":0.0005994741,"threshold_uncertainty_score":0.08334541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018590214,0.0032690442,0.025896918,0.006759407,0.0027201327,0.00017141098,0.00047633215,0.006606882,0.95224077],"genre_scores_gemma":[0.00962717,0.0021366123,0.017797796,0.0013481486,0.0002805329,0.00013337408,0.00070731196,0.002669906,0.9652991],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995053,0.000073127165,0.000026992982,0.00007096622,0.00026474087,0.000058784604],"domain_scores_gemma":[0.9996389,0.00007559808,0.000014637254,0.00006888701,0.000108748856,0.00009308056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040254372,0.0011055698,0.00043122662,0.0012934462,0.0018648986,0.006073436,0.0009025055,0.0014408118,0.102632605],"category_scores_gemma":[0.0021341457,0.0005693693,0.00037073228,0.0008696578,0.0009629008,0.0072812284,0.002705505,0.0024614304,0.111168005],"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.000021269208,0.000027381873,0.000074960495,0.000116429845,0.0000046561363,0.0000769886,0.00076934765,0.00009768732,0.0006209659,0.042346805,0.7815904,0.17425308],"study_design_scores_gemma":[0.0000058385244,0.00000855396,0.00008646017,0.000061336345,0.0000017092784,0.00017182529,0.00015451177,0.00020937924,0.00027387202,0.0071732574,0.9918459,0.0000073364045],"about_ca_topic_score_codex":0.0024634358,"about_ca_topic_score_gemma":0.008106281,"teacher_disagreement_score":0.102632605,"about_ca_system_score_codex":0.0010543589,"about_ca_system_score_gemma":0.0008685672,"threshold_uncertainty_score":0.34334028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589509,0.003969967,0.030451527,0.046953786,0.00078138104,0.000254285,0.0025144247,0.00043431713,0.35568944],"genre_scores_gemma":[0.947339,0.0013753832,0.0031943019,0.0022854505,0.000111824105,0.00006571988,0.0006834911,0.00008476646,0.044860087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989581,0.00034287642,0.0000362694,0.00017223497,0.00019848185,0.0002918825],"domain_scores_gemma":[0.99648416,0.0016793783,0.00058764894,0.0002039126,0.00045955306,0.0005852474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012665505,0.0006887613,0.0005971817,0.0006184696,0.0022114085,0.0036156524,0.000940166,0.0017639778,0.025251552],"category_scores_gemma":[0.011076526,0.00031376598,0.00033142205,0.00074048305,0.0015458608,0.0041493597,0.00096714904,0.002322062,0.0065910113],"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.0021384575,0.00062991434,0.12765045,0.0007162628,0.00027765348,0.0011236181,0.009838528,0.0039573396,0.0036091032,0.33754438,0.24050735,0.27200687],"study_design_scores_gemma":[0.00019926747,0.0013821156,0.0920424,0.00062600925,0.0001966341,0.0038072031,0.05806429,0.03982838,0.0065368474,0.33450767,0.46258828,0.0002209457],"about_ca_topic_score_codex":0.007002253,"about_ca_topic_score_gemma":0.017941331,"teacher_disagreement_score":0.025251552,"about_ca_system_score_codex":0.0013726112,"about_ca_system_score_gemma":0.0006886937,"threshold_uncertainty_score":0.0844748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100317895,0.000056514375,0.89722633,0.00010408541,0.000028447066,0.00004761316,0.000028749031,0.00057716557,0.0016131238],"genre_scores_gemma":[0.89216894,0.000038963182,0.10558772,0.000037779937,0.000012736503,0.00004768436,0.000038097278,0.000095671385,0.0019723354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994259,0.0002102619,0.000025422205,0.00011152121,0.00013649826,0.000090385955],"domain_scores_gemma":[0.99757653,0.0015002162,0.00033769239,0.00028573096,0.00016964522,0.0001300663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019277664,0.0008250952,0.00068100594,0.00040751934,0.00046800074,0.0010802761,0.0019631397,0.00092710624,0.0020944702],"category_scores_gemma":[0.006417607,0.0005399555,0.0004394754,0.00017563434,0.001387703,0.0016968393,0.0012962822,0.0015629653,0.00034809715],"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.00045942987,0.00006054508,0.002068459,0.000053375483,0.000038081875,0.00025842857,0.0002603273,0.9339762,0.0076702717,0.026810165,0.00053457124,0.027810276],"study_design_scores_gemma":[0.000005164106,0.000018561293,0.000093216186,0.0000016405368,0.000002473718,0.00001438935,0.000007981621,0.99508166,0.0008619271,0.0037838724,0.00012436206,0.000004727394],"about_ca_topic_score_codex":0.0031507772,"about_ca_topic_score_gemma":0.003052079,"teacher_disagreement_score":0.0031507772,"about_ca_system_score_codex":0.00070113264,"about_ca_system_score_gemma":0.00074639916,"threshold_uncertainty_score":0.010195136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037736814,0.002082479,0.92864573,0.0012852461,0.00019960525,0.0001731269,0.000059202048,0.0010447273,0.028773094],"genre_scores_gemma":[0.4069565,0.0023447496,0.5819239,0.00033457394,0.00016492157,0.00042762104,0.00013822594,0.00029086854,0.0074185557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992404,0.0002826264,0.00006092403,0.000098488425,0.00021300804,0.00010465658],"domain_scores_gemma":[0.9985929,0.00084072415,0.000070934104,0.00024757328,0.00018182577,0.00006608974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011529805,0.00090378645,0.00078236073,0.0006986104,0.00093267247,0.002065203,0.001415773,0.00085814024,0.00512672],"category_scores_gemma":[0.004608168,0.00051499926,0.00076626247,0.0012472235,0.001390899,0.0031592832,0.0018006002,0.0019019517,0.0009631192],"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.00019797219,0.0001705288,0.0010003359,0.0003260242,0.000106807354,0.00008693809,0.0002996492,0.5021994,0.0043070465,0.32842717,0.004226894,0.15865125],"study_design_scores_gemma":[0.000056721758,0.00006368834,0.00012490855,0.000034593053,0.000027542663,0.00003815087,0.00005137463,0.8079299,0.0015058026,0.18136343,0.008792397,0.0000115833445],"about_ca_topic_score_codex":0.004635822,"about_ca_topic_score_gemma":0.0066795787,"teacher_disagreement_score":0.00512672,"about_ca_system_score_codex":0.001532398,"about_ca_system_score_gemma":0.0014249356,"threshold_uncertainty_score":0.01715058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01387717,0.00034670415,0.98383427,0.0002884628,0.000028996947,0.000054480926,0.0000283994,0.00019217453,0.0013493645],"genre_scores_gemma":[0.5848287,0.0005115361,0.41138777,0.00041896998,0.00014026725,0.00044473275,0.0001958524,0.00025532328,0.0018169277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.988617,0.008389299,0.00029450035,0.0008959198,0.0013894365,0.00041382507],"domain_scores_gemma":[0.9528853,0.040056262,0.0017718069,0.003242653,0.0016539659,0.00038998583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016666329,0.0011015303,0.001811993,0.0015053493,0.000908417,0.0020530196,0.002249877,0.0014559126,0.001544922],"category_scores_gemma":[0.08765162,0.0009295431,0.0011476005,0.0015095989,0.0031766423,0.0040108017,0.0022538407,0.0024743243,0.00027131962],"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.00019543488,0.00006195363,0.002502584,0.00009788247,0.00012753675,0.000086595675,0.00016251375,0.7128557,0.00059284567,0.2538358,0.0009982075,0.028482955],"study_design_scores_gemma":[0.00002900714,0.000030695053,0.0002547136,0.000024862615,0.000014161239,0.00002529365,0.000011707153,0.9197991,0.0005363528,0.07886335,0.00039695977,0.000013853605],"about_ca_topic_score_codex":0.00460735,"about_ca_topic_score_gemma":0.004513504,"teacher_disagreement_score":0.016666329,"about_ca_system_score_codex":0.002674407,"about_ca_system_score_gemma":0.0020706258,"threshold_uncertainty_score":0.088140965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099927,0.00025726523,0.8943013,0.0002458422,0.000058067217,0.00015097069,0.00006907619,0.0011706388,0.003819828],"genre_scores_gemma":[0.6685936,0.00015953234,0.3279487,0.0001439134,0.000023417477,0.00020875252,0.00016002421,0.00022531151,0.0025368647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.00020775235,0.000023605216,0.000110841305,0.00010706676,0.0000889506],"domain_scores_gemma":[0.999138,0.00049420027,0.000105868785,0.00007009554,0.000119575314,0.00007223322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012004297,0.0014092918,0.0012029307,0.0010378966,0.0005235553,0.0009837605,0.0015685136,0.0012641781,0.0023664809],"category_scores_gemma":[0.0026239804,0.0008463923,0.0006651839,0.0005597803,0.00104238,0.0010915898,0.00085682067,0.0008251415,0.00045367994],"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.000034633184,0.000039601135,0.0004086657,0.00002069109,0.000017777396,0.000028368022,0.000028592834,0.982335,0.00091139483,0.0012398008,0.00023667281,0.014698813],"study_design_scores_gemma":[0.0000151395425,0.000040530045,0.00008902349,0.0000039955553,0.0000071608656,0.000011833291,0.000025490044,0.9975733,0.00047814625,0.0014272251,0.00032452852,0.0000036617992],"about_ca_topic_score_codex":0.008624334,"about_ca_topic_score_gemma":0.010492106,"teacher_disagreement_score":0.008624334,"about_ca_system_score_codex":0.0013115972,"about_ca_system_score_gemma":0.0012653423,"threshold_uncertainty_score":0.017148316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022433471,0.0055845547,0.92646945,0.017556354,0.0007636975,0.000077087614,0.00015375698,0.00031007672,0.026651582],"genre_scores_gemma":[0.8337054,0.0068980586,0.13943581,0.00287698,0.0014842325,0.0004226502,0.00019565833,0.0003187773,0.014662393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970831,0.0017736487,0.00008559007,0.00039073447,0.0005245673,0.00014239928],"domain_scores_gemma":[0.98748463,0.010271867,0.00047493368,0.00095905486,0.000416016,0.00039337354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037749005,0.00092656707,0.0013756644,0.0006673409,0.0011830257,0.003359472,0.0020689082,0.0028603654,0.005473208],"category_scores_gemma":[0.029734612,0.0006831347,0.0011025575,0.0006351107,0.0059828334,0.0073534693,0.0036192583,0.004945359,0.00061935827],"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.00002306756,0.000013540805,0.00041075633,0.000079059195,0.000030518313,0.00013396287,0.00020726364,0.05273429,0.00014157408,0.9360915,0.0025475998,0.0075869877],"study_design_scores_gemma":[0.000012634556,0.000016889628,0.00010607201,0.00003344909,0.0000058156406,0.0000590441,0.000051904975,0.14793152,0.00012639347,0.84618425,0.0054586595,0.000013467411],"about_ca_topic_score_codex":0.0019829008,"about_ca_topic_score_gemma":0.00087444566,"teacher_disagreement_score":0.005473208,"about_ca_system_score_codex":0.0018995202,"about_ca_system_score_gemma":0.0010298162,"threshold_uncertainty_score":0.0199638},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026996024,0.00038010709,0.7044296,0.00031560767,0.00016914218,0.0005924307,0.010826819,0.2322688,0.048317842],"genre_scores_gemma":[0.041552886,0.0009865735,0.7933616,0.00062996947,0.00008473574,0.0036786841,0.030129835,0.070754305,0.058821358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995863,0.000066958986,0.00005013481,0.00006457372,0.00014808019,0.00008384998],"domain_scores_gemma":[0.9983032,0.0010629338,0.00006439385,0.00016311162,0.0003165495,0.000089806024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085911056,0.001702011,0.0009560351,0.0015931315,0.0005482344,0.0017292843,0.003182473,0.0012012441,0.111017235],"category_scores_gemma":[0.0065053445,0.0013135812,0.0016202781,0.0011366393,0.00044477877,0.002895368,0.0021747665,0.0024528822,0.04154586],"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.0005463853,0.0004042606,0.0018903175,0.0019480621,0.0001392761,0.00043508576,0.0006794203,0.01773692,0.007788504,0.07513537,0.48970503,0.40359133],"study_design_scores_gemma":[0.0006161555,0.00016716673,0.0021028223,0.0005750871,0.0001402661,0.00081860396,0.00012318663,0.13480677,0.01817665,0.099365205,0.742906,0.00020219518],"about_ca_topic_score_codex":0.005128488,"about_ca_topic_score_gemma":0.00735404,"teacher_disagreement_score":0.111017235,"about_ca_system_score_codex":0.0008246291,"about_ca_system_score_gemma":0.0018531079,"threshold_uncertainty_score":0.37138963},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003577259,0.05078476,0.0034961468,0.24086428,0.2871653,0.00046531614,0.0065689567,0.0007624691,0.4063155],"genre_scores_gemma":[0.027142772,0.024924727,0.0015733634,0.05845814,0.01628495,0.00040692746,0.00331239,0.00032063754,0.8675762],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99614054,0.0010084339,0.0004464355,0.00062543893,0.0013913177,0.00038801067],"domain_scores_gemma":[0.99145156,0.0013722754,0.00061492814,0.0008983772,0.0034568985,0.002205866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571722,0.00073483435,0.0012302551,0.0016980926,0.0030665202,0.0045640203,0.0022552256,0.0043335157,0.27427194],"category_scores_gemma":[0.025003696,0.00034629885,0.0012454215,0.0015356372,0.001427464,0.0040796045,0.005321498,0.0059398357,0.10219716],"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.0003695178,0.00005019122,0.0004070971,0.00095479935,0.000044177537,0.000115591894,0.00016075242,0.00006199922,0.0001784494,0.009852268,0.8914014,0.09640378],"study_design_scores_gemma":[0.00003102589,0.000076650795,0.0003930538,0.0010618087,0.000031429056,0.00008143227,0.0002460775,0.000024801686,0.00019173586,0.002732791,0.995116,0.000013195186],"about_ca_topic_score_codex":0.004241291,"about_ca_topic_score_gemma":0.0076932046,"teacher_disagreement_score":0.27427194,"about_ca_system_score_codex":0.0020393613,"about_ca_system_score_gemma":0.0059569166,"threshold_uncertainty_score":0.917531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10755531,0.0007288914,0.875699,0.00063011935,0.00010999048,0.00017219038,0.00028263402,0.0027340834,0.01208779],"genre_scores_gemma":[0.49517015,0.00023574315,0.50136364,0.00010190244,0.0000138973965,0.00018877031,0.00023418089,0.00027033756,0.0024214317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857867,0.0005443707,0.000108537206,0.00030119828,0.00028918535,0.00017809737],"domain_scores_gemma":[0.9953141,0.0031505967,0.00024133608,0.0007945129,0.00030556714,0.00019391603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020372227,0.00062780944,0.0011564145,0.0010120758,0.0012500832,0.0020174072,0.0019787964,0.0009912862,0.0056441696],"category_scores_gemma":[0.008322355,0.0006877807,0.0006128206,0.0015710255,0.0013316117,0.0037308873,0.0027711345,0.0012216932,0.000868575],"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.00062462484,0.00025679194,0.00312367,0.00020111889,0.000090616995,0.00014371154,0.0005465483,0.6514635,0.0035973212,0.058359936,0.0052379235,0.2763543],"study_design_scores_gemma":[0.0001522558,0.00014176907,0.00039577906,0.000024904142,0.000028918694,0.00007634582,0.00014949756,0.9468721,0.0028060442,0.044777613,0.0045484887,0.00002623047],"about_ca_topic_score_codex":0.0130507415,"about_ca_topic_score_gemma":0.018957762,"teacher_disagreement_score":0.0130507415,"about_ca_system_score_codex":0.0011611847,"about_ca_system_score_gemma":0.0026864493,"threshold_uncertainty_score":0.025949538},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026930742,0.0005802677,0.20905308,0.006494994,0.0008558585,0.0013059678,0.002161763,0.0025936528,0.7500237],"genre_scores_gemma":[0.5653583,0.0011717208,0.14269735,0.0068624727,0.0004353035,0.0029624389,0.007383237,0.0025208974,0.27060828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622077,0.00091710396,0.00038967546,0.0003800641,0.0016104957,0.00048193103],"domain_scores_gemma":[0.9942016,0.0012258632,0.00031411063,0.0009893558,0.002771418,0.0004977188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024431346,0.00094492786,0.00031653768,0.0005595016,0.0011243139,0.0029923893,0.0013105097,0.00164694,0.037380736],"category_scores_gemma":[0.014107557,0.00043004373,0.0005892091,0.00028053415,0.0012558379,0.0031872354,0.003443971,0.0017034432,0.016384156],"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.00044417087,0.00033370318,0.0046951766,0.0012974411,0.00005294306,0.001475773,0.006958614,0.0047512315,0.038985033,0.5514762,0.14746338,0.2420663],"study_design_scores_gemma":[0.0000557015,0.00017628093,0.004846984,0.00037294836,0.00003987783,0.0016916427,0.0023284978,0.0052867187,0.00800656,0.0977822,0.8793231,0.000089503505],"about_ca_topic_score_codex":0.0012922642,"about_ca_topic_score_gemma":0.0012329427,"teacher_disagreement_score":0.037380736,"about_ca_system_score_codex":0.000977018,"about_ca_system_score_gemma":0.0011939865,"threshold_uncertainty_score":0.12505096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07622784,0.00034741109,0.9136482,0.00015732466,0.00012709473,0.00016422577,0.00028406864,0.0039734757,0.0050704065],"genre_scores_gemma":[0.6560755,0.0002139322,0.33686146,0.00005882491,0.00004211073,0.00013206755,0.00053179695,0.00027396868,0.0058103995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00009957957,0.00005107482,0.000117920325,0.00022968212,0.00007525899],"domain_scores_gemma":[0.9973454,0.0013853564,0.00016273613,0.00048800829,0.00038193536,0.00023660137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611537,0.00063300354,0.00076157146,0.0008861025,0.000631374,0.0011989458,0.0018077606,0.00061428105,0.0070285387],"category_scores_gemma":[0.004340321,0.00042754767,0.00038753558,0.0009811635,0.0005738942,0.0029257273,0.0018935447,0.0013827974,0.0010394809],"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.002043406,0.0012467841,0.004478749,0.00033026727,0.0000807908,0.00019203019,0.00058911386,0.1652962,0.038125753,0.059746217,0.007342441,0.72052824],"study_design_scores_gemma":[0.00011345563,0.00022581535,0.0007935976,0.000025411182,0.000033538345,0.000067507855,0.00015349126,0.9516522,0.012826859,0.030237032,0.0038376094,0.000033515327],"about_ca_topic_score_codex":0.004581834,"about_ca_topic_score_gemma":0.009224737,"teacher_disagreement_score":0.0070285387,"about_ca_system_score_codex":0.0006416784,"about_ca_system_score_gemma":0.0016391167,"threshold_uncertainty_score":0.02351284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105995804,0.00034649507,0.8841573,0.00082717784,0.000060161765,0.00024120748,0.00022697993,0.00068432797,0.0074604317],"genre_scores_gemma":[0.9010215,0.00014479217,0.09570096,0.00028148608,0.000040744188,0.000370947,0.00027625522,0.00008460535,0.002078811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919043,0.0049975202,0.00036383278,0.0010041588,0.0012850482,0.00044509882],"domain_scores_gemma":[0.9572778,0.032184407,0.0038400353,0.0034691168,0.0021794229,0.0010492683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013290956,0.0017142083,0.0014267728,0.0026513063,0.00070746464,0.002165694,0.0023094038,0.0026315264,0.0028692235],"category_scores_gemma":[0.06473634,0.0005327787,0.001026476,0.0011695375,0.0024779637,0.004724103,0.0022603858,0.002818887,0.0007762326],"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.00048953877,0.0003527601,0.01654866,0.00018412451,0.0003084826,0.00012628615,0.00026853647,0.77821875,0.0029568793,0.103205696,0.0019825194,0.09535773],"study_design_scores_gemma":[0.000024718214,0.00015331995,0.0015413875,0.000025393474,0.000023953626,0.000052352574,0.000043983993,0.9466656,0.0012785804,0.049556,0.0006028874,0.000031820007],"about_ca_topic_score_codex":0.0014102249,"about_ca_topic_score_gemma":0.0012323604,"teacher_disagreement_score":0.013290956,"about_ca_system_score_codex":0.0018939422,"about_ca_system_score_gemma":0.0010357014,"threshold_uncertainty_score":0.07029015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057349964,0.06290361,0.6042692,0.008690018,0.0051980093,0.0005702571,0.0012006358,0.0025783721,0.30885482],"genre_scores_gemma":[0.17532556,0.08708658,0.45322934,0.006681821,0.0048676804,0.001113298,0.0021557717,0.0012915013,0.26824844],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998055,0.00007164542,0.000013635171,0.000028304537,0.00005875551,0.000022275126],"domain_scores_gemma":[0.99980706,0.00011748247,0.00001418658,0.000010629525,0.000024360268,0.000026315853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004175056,0.0014060804,0.0005104017,0.0006916994,0.00034354077,0.0012347825,0.00089589646,0.0012291161,0.026804537],"category_scores_gemma":[0.0011508852,0.0003714669,0.0004954313,0.00072982634,0.00088358414,0.0021534243,0.00075416773,0.0018479491,0.006920902],"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.00009538555,0.00030973728,0.00074586197,0.001393514,0.00006618654,0.0005197388,0.00056883844,0.0221961,0.0042894813,0.37202236,0.2156729,0.38211998],"study_design_scores_gemma":[0.000026086858,0.0001719501,0.0012728751,0.0004492569,0.000015050273,0.000775458,0.00014549276,0.03837908,0.0011759755,0.21333848,0.7441938,0.00005659313],"about_ca_topic_score_codex":0.0017378102,"about_ca_topic_score_gemma":0.0030212926,"teacher_disagreement_score":0.026804537,"about_ca_system_score_codex":0.0008145354,"about_ca_system_score_gemma":0.0005108061,"threshold_uncertainty_score":0.08967012},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027788144,0.0043818783,0.075730085,0.0040987325,0.0011010532,0.00008994469,0.00018269496,0.0002005645,0.8864268],"genre_scores_gemma":[0.50707257,0.0040213736,0.04042673,0.0006916712,0.00040784053,0.00021958143,0.0003516573,0.00022717784,0.44658142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961287,0.00016725888,0.000010056591,0.000048034537,0.00009026314,0.000071625334],"domain_scores_gemma":[0.9998042,0.00008751204,0.000010425203,0.000018992596,0.000021478823,0.000057451758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003664561,0.0013573497,0.00053282443,0.0004038502,0.0018431216,0.0032509458,0.0014252301,0.0015525091,0.021333402],"category_scores_gemma":[0.0014847853,0.00044960997,0.00044070985,0.00040459872,0.0032140682,0.002535689,0.0017145028,0.0018690118,0.0024929151],"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.000101820835,0.000027694072,0.000107212334,0.000089733076,0.000016846427,0.000075977965,0.00070195727,0.006856187,0.00046202287,0.9206927,0.03980881,0.031059101],"study_design_scores_gemma":[0.000033164462,0.000056120967,0.00051782303,0.0002942144,0.0000111436975,0.0002105989,0.001073686,0.024689524,0.0006661476,0.66150576,0.3109028,0.00003897345],"about_ca_topic_score_codex":0.006371236,"about_ca_topic_score_gemma":0.011215076,"teacher_disagreement_score":0.021333402,"about_ca_system_score_codex":0.0012221308,"about_ca_system_score_gemma":0.0012030161,"threshold_uncertainty_score":0.07136732},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30109695,0.001463113,0.31652772,0.003320108,0.0008514195,0.00096742396,0.0016097444,0.0006714715,0.37349206],"genre_scores_gemma":[0.89985484,0.00059927837,0.06938508,0.0007446229,0.0002613593,0.00085479824,0.0012262785,0.00020608684,0.026867678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474794,0.0010172674,0.00038562264,0.0010496961,0.0011271759,0.0016722967],"domain_scores_gemma":[0.99397767,0.0021142445,0.0010008314,0.0009468156,0.00068010687,0.0012803453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020018485,0.0010059011,0.0011542158,0.0028528827,0.0034877805,0.00549391,0.0020210566,0.0028564688,0.016743394],"category_scores_gemma":[0.010721473,0.00037957449,0.0020198019,0.0025212239,0.0051526106,0.005306041,0.003390426,0.004913813,0.0019690176],"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.00009128795,0.00006452526,0.0019950476,0.000063276144,0.000019688045,0.00011870739,0.00042133336,0.0012607562,0.0007968574,0.98053014,0.0017749881,0.012863239],"study_design_scores_gemma":[0.00007359222,0.00018170408,0.0025677898,0.00010230354,0.000029868605,0.0004290724,0.00062230893,0.018190555,0.00069918646,0.9601607,0.01689296,0.00004990262],"about_ca_topic_score_codex":0.00145034,"about_ca_topic_score_gemma":0.0014149306,"teacher_disagreement_score":0.016743394,"about_ca_system_score_codex":0.0022724723,"about_ca_system_score_gemma":0.0022910228,"threshold_uncertainty_score":0.056012213},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05988707,0.5260664,0.24236524,0.027308976,0.006546586,0.00034744892,0.0008379402,0.0011518546,0.13548848],"genre_scores_gemma":[0.48760465,0.20819506,0.23977178,0.004323195,0.0039972723,0.0003704994,0.0017419485,0.00067910604,0.05331661],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807763,0.00069530966,0.00013740735,0.00025556557,0.0006407986,0.00019318421],"domain_scores_gemma":[0.9924663,0.004899985,0.0002889664,0.0005236664,0.0012527219,0.00056842854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005781981,0.0009959656,0.001079557,0.0014747264,0.00084635476,0.003921268,0.0016476529,0.0016861551,0.007999074],"category_scores_gemma":[0.022954559,0.00071466656,0.00065329636,0.0022331306,0.0028151136,0.0072661685,0.0027772419,0.0026572936,0.002123918],"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.00053835945,0.00027546918,0.0018981696,0.0011355495,0.00010640093,0.00015848067,0.0004900818,0.013556066,0.00091700413,0.25942665,0.04893942,0.67255837],"study_design_scores_gemma":[0.00021404294,0.00071971247,0.0024605375,0.0014725674,0.000086530345,0.00055066036,0.00038499082,0.076365225,0.0026996026,0.2503486,0.66456896,0.00012862672],"about_ca_topic_score_codex":0.0039406423,"about_ca_topic_score_gemma":0.0049850387,"teacher_disagreement_score":0.007999074,"about_ca_system_score_codex":0.0033478576,"about_ca_system_score_gemma":0.002272017,"threshold_uncertainty_score":0.030578375},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012286908,0.0044145444,0.24867469,0.036793344,0.013900476,0.00006259394,0.0005672129,0.0045060483,0.6787942],"genre_scores_gemma":[0.29655623,0.003989194,0.06085393,0.024760064,0.0049532847,0.00017673787,0.0007300773,0.007841403,0.60013914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892277,0.000363222,0.000053445016,0.00022785674,0.0002672809,0.0001652918],"domain_scores_gemma":[0.9989692,0.00050535926,0.00008602704,0.00016435882,0.00018558852,0.00008958441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010697759,0.001072576,0.00040100425,0.0008448175,0.002314701,0.00624882,0.000740621,0.0018606925,0.03131324],"category_scores_gemma":[0.0030941688,0.0004909877,0.0010149233,0.0007078005,0.0043004085,0.00977538,0.0014645207,0.0047904723,0.008186454],"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.000050362778,0.000013747228,0.00015015401,0.000043374046,0.000004676402,0.00007842177,0.0017793035,0.00019769813,0.0013913881,0.94078773,0.038938057,0.016565071],"study_design_scores_gemma":[0.0000080377695,0.00003793214,0.00021560966,0.00006566599,0.0000064954975,0.00017094836,0.0005502069,0.0005768314,0.0012121944,0.15431786,0.8428096,0.000028557031],"about_ca_topic_score_codex":0.0047328747,"about_ca_topic_score_gemma":0.004785199,"teacher_disagreement_score":0.03131324,"about_ca_system_score_codex":0.001702396,"about_ca_system_score_gemma":0.0008905156,"threshold_uncertainty_score":0.104753196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041155783,0.0005288852,0.98992,0.000102663806,0.00015419278,0.000077286284,0.00012548534,0.0017825125,0.0031933573],"genre_scores_gemma":[0.062127274,0.00077231164,0.9270884,0.00014055506,0.00018537742,0.00010290351,0.00080144353,0.0007360557,0.008045746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983241,0.000103535785,0.000089962195,0.00033904982,0.00095997757,0.00018346058],"domain_scores_gemma":[0.9992393,0.00011561932,0.000056917666,0.00019357349,0.00033092825,0.000063705134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059208774,0.0012661953,0.0016196119,0.0029986098,0.0014918043,0.0022270787,0.0035522357,0.0015767073,0.005575069],"category_scores_gemma":[0.00153867,0.0006857874,0.0017505792,0.0018812158,0.0008611259,0.0027883905,0.0022120115,0.0018756024,0.0021136135],"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.00023370037,0.00007136811,0.0006353628,0.0002499511,0.00008802328,0.0002638761,0.0002553707,0.09465317,0.026626244,0.050513666,0.01883631,0.8075731],"study_design_scores_gemma":[0.00012388384,0.00010610778,0.0006315669,0.00008455044,0.0000887055,0.0007176199,0.00007762589,0.83540714,0.027738625,0.02340189,0.111466885,0.00015539509],"about_ca_topic_score_codex":0.007600944,"about_ca_topic_score_gemma":0.0055781133,"teacher_disagreement_score":0.007600944,"about_ca_system_score_codex":0.001206114,"about_ca_system_score_gemma":0.0010293954,"threshold_uncertainty_score":0.018650413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6030672,0.0009007857,0.3796929,0.0012356061,0.00013212557,0.00027219602,0.00028633515,0.0008758135,0.01353706],"genre_scores_gemma":[0.86146945,0.00031476695,0.13417742,0.00014206368,0.00002668132,0.00018195332,0.000355571,0.00009169646,0.003240302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924564,0.0003520468,0.00004480791,0.00015032172,0.00013023561,0.00007700443],"domain_scores_gemma":[0.9911911,0.0071592196,0.0007911923,0.00041721584,0.00027810887,0.00016309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014937026,0.00090394274,0.0005941081,0.00052835495,0.0003226219,0.0008603788,0.0014802022,0.0010714903,0.0043676957],"category_scores_gemma":[0.013885465,0.0003468184,0.0005164714,0.0005853419,0.00093722396,0.0018895863,0.00095783,0.0014946538,0.00046768365],"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.00032682958,0.00044834238,0.0033771005,0.00021938598,0.00008160874,0.00011555747,0.00014891686,0.9166353,0.0016673501,0.014410439,0.0017174382,0.060851764],"study_design_scores_gemma":[0.00005221783,0.000060675327,0.00022297962,0.000006884473,0.0000047169683,0.000015529084,0.000022436325,0.9907155,0.000654756,0.0077923527,0.00044772282,0.0000042008433],"about_ca_topic_score_codex":0.003981332,"about_ca_topic_score_gemma":0.004277646,"teacher_disagreement_score":0.0043676957,"about_ca_system_score_codex":0.000682091,"about_ca_system_score_gemma":0.000947124,"threshold_uncertainty_score":0.014611423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7320504,0.0016090936,0.18905938,0.014224261,0.00022568462,0.0008026734,0.005266107,0.00087456376,0.05588786],"genre_scores_gemma":[0.93592536,0.0011092641,0.04901518,0.00074007595,0.00025263184,0.00046935887,0.0027434635,0.0003968261,0.009347826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502265,0.002005196,0.000240898,0.00084739906,0.00081584597,0.0010679855],"domain_scores_gemma":[0.90318793,0.088431835,0.0030145203,0.0018890996,0.0011252286,0.0023513564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033568528,0.002013192,0.0026524614,0.0018208242,0.0023894247,0.006947857,0.0037968284,0.0038494423,0.015944982],"category_scores_gemma":[0.038844455,0.0012567592,0.0018808461,0.0026148206,0.0037545022,0.0124780005,0.004093521,0.005604796,0.0010120175],"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.0018539339,0.00089634396,0.008934513,0.0009297022,0.00037072174,0.0006488133,0.0012324156,0.73160166,0.002869502,0.19892195,0.01599332,0.035747163],"study_design_scores_gemma":[0.0002460409,0.000099683006,0.0014707025,0.00004875153,0.00008164096,0.0001690545,0.00042403536,0.7294267,0.00058385433,0.2659317,0.0014750542,0.00004289599],"about_ca_topic_score_codex":0.010080252,"about_ca_topic_score_gemma":0.01064826,"teacher_disagreement_score":0.015944982,"about_ca_system_score_codex":0.0052426206,"about_ca_system_score_gemma":0.0030978245,"threshold_uncertainty_score":0.05334127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010413792,0.00007853751,0.9872039,0.000077931305,0.000017811122,0.00009393159,0.00003082218,0.0011744641,0.0009087797],"genre_scores_gemma":[0.27497098,0.00007764023,0.7226542,0.00017237448,0.000031490436,0.00047517676,0.00021034393,0.00024033489,0.0011673573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824166,0.00076488906,0.0000959679,0.0002686314,0.00047308917,0.00015579801],"domain_scores_gemma":[0.9940612,0.0041864323,0.00045247437,0.0005830048,0.0005120289,0.00020488435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034228,0.0010827375,0.0015220512,0.0010750879,0.000579833,0.0008980916,0.0022997668,0.0011466842,0.0038536317],"category_scores_gemma":[0.014526162,0.00059316744,0.0007548652,0.00060986995,0.0011345525,0.001737543,0.001716953,0.0014343618,0.0010732076],"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.0005346703,0.0002014501,0.0026144462,0.00017687216,0.0001458257,0.00012781474,0.00020021247,0.7843134,0.0036016102,0.035004053,0.0023756372,0.17070399],"study_design_scores_gemma":[0.0000273534,0.000032135653,0.000078294586,0.0000056048643,0.000004749887,0.00001660584,0.000008158017,0.9935923,0.0005169353,0.0054030046,0.00031007457,0.000004871337],"about_ca_topic_score_codex":0.0041364897,"about_ca_topic_score_gemma":0.005065994,"teacher_disagreement_score":0.0041364897,"about_ca_system_score_codex":0.0010057148,"about_ca_system_score_gemma":0.0017613726,"threshold_uncertainty_score":0.018101692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538824,0.00086335157,0.58997214,0.0007066885,0.00022032268,0.0007697163,0.00022967398,0.001752684,0.051602993],"genre_scores_gemma":[0.9390927,0.0001399205,0.055250753,0.00008570684,0.000019584195,0.00016316779,0.000103736136,0.00005253994,0.0050919093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992531,0.0003096697,0.000031287942,0.00015695872,0.00018579765,0.00006312899],"domain_scores_gemma":[0.99877685,0.0005559994,0.00021872116,0.00010574607,0.00014431006,0.00019831247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078660605,0.00084124925,0.00023841938,0.00044767847,0.00045070963,0.0011959756,0.00086142827,0.0007302716,0.00385436],"category_scores_gemma":[0.0049076313,0.0002842861,0.00032804997,0.00017569381,0.0010151811,0.0017895765,0.0016714424,0.00063151546,0.00056918425],"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.0019155582,0.0017777581,0.050232377,0.001733568,0.00023023559,0.0024400319,0.018555129,0.16390656,0.0706158,0.23509614,0.014891681,0.43860516],"study_design_scores_gemma":[0.00015878864,0.0028246285,0.044202253,0.00032243767,0.0001422048,0.003039336,0.004055655,0.7423901,0.010583295,0.11378989,0.07830709,0.0001843128],"about_ca_topic_score_codex":0.0019282106,"about_ca_topic_score_gemma":0.002123339,"teacher_disagreement_score":0.00385436,"about_ca_system_score_codex":0.00062573334,"about_ca_system_score_gemma":0.00033005737,"threshold_uncertainty_score":0.012894154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036910456,0.007909447,0.92538226,0.001116876,0.0003924116,0.00018089474,0.00012500994,0.0013335793,0.026649049],"genre_scores_gemma":[0.4451853,0.005860028,0.54213643,0.00059764547,0.0004971513,0.00021478326,0.00033647937,0.000351971,0.004820095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979777,0.0006878077,0.0001411102,0.00039118945,0.00069827936,0.00010398117],"domain_scores_gemma":[0.991025,0.0050828103,0.00053778075,0.002010785,0.0011217708,0.00022196471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024919903,0.0010347491,0.00080517656,0.0015639843,0.0005692494,0.0018369132,0.0029784518,0.0011289928,0.0055164737],"category_scores_gemma":[0.016236113,0.00039010672,0.0007631574,0.0020129075,0.0013378704,0.003127608,0.0019471091,0.001306065,0.0011231952],"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.00025427528,0.0003503288,0.0020933724,0.0006200887,0.0001395316,0.00016352694,0.0002894746,0.19912374,0.005383295,0.09557189,0.0041877013,0.69182277],"study_design_scores_gemma":[0.000112426715,0.00035676535,0.000914018,0.00011490728,0.00009480552,0.00052160845,0.0001072593,0.8711261,0.00573838,0.08189742,0.038966794,0.00004943128],"about_ca_topic_score_codex":0.0032938386,"about_ca_topic_score_gemma":0.0026142234,"teacher_disagreement_score":0.0055164737,"about_ca_system_score_codex":0.000962826,"about_ca_system_score_gemma":0.0012671315,"threshold_uncertainty_score":0.018454432},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23700957,0.0037111884,0.28318766,0.0030623614,0.0011661218,0.0001382693,0.00058173266,0.0004773438,0.4706657],"genre_scores_gemma":[0.9055965,0.0012988644,0.04599929,0.000652476,0.00042166485,0.0001685393,0.00040179596,0.00017861719,0.04528226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985084,0.0004069042,0.00013248915,0.00022230628,0.00043206842,0.00029785282],"domain_scores_gemma":[0.9952029,0.0025841957,0.0004438523,0.00042818897,0.00048654148,0.0008543956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012311009,0.00083431357,0.0009766322,0.0029442175,0.002913491,0.0052010766,0.0014580279,0.001558631,0.014482195],"category_scores_gemma":[0.010038238,0.00064634404,0.00087659544,0.0020501085,0.004472614,0.009917929,0.0039205677,0.003099856,0.002025877],"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.0000244314,0.000011306251,0.00015981932,0.000034720513,0.000004354585,0.00003311071,0.00010661462,0.00058304897,0.00014870752,0.9938175,0.0010191904,0.0040573236],"study_design_scores_gemma":[0.000008447159,0.000007855738,0.00013551838,0.000023389688,0.0000051135858,0.00005878109,0.000052228166,0.0023174207,0.00010817892,0.9948183,0.0024570976,0.000007653908],"about_ca_topic_score_codex":0.0015619032,"about_ca_topic_score_gemma":0.0025926125,"teacher_disagreement_score":0.014482195,"about_ca_system_score_codex":0.0016583817,"about_ca_system_score_gemma":0.0007295072,"threshold_uncertainty_score":0.048447788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013533285,0.0002547289,0.98993987,0.00015177952,0.000052613417,0.000057150115,0.000041368567,0.00031695477,0.007832068],"genre_scores_gemma":[0.17822179,0.0013444014,0.79794234,0.0003822915,0.00016137086,0.00040326006,0.0002716948,0.00033158012,0.020941295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.00018189033,0.000027606433,0.00009225914,0.0002140965,0.000066021974],"domain_scores_gemma":[0.9994356,0.00035219418,0.000040580584,0.000080836544,0.00005123755,0.000039540104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000888038,0.0010213334,0.00068111625,0.00054805644,0.00047945714,0.0011793155,0.0016552946,0.0010160892,0.0060072527],"category_scores_gemma":[0.0024199397,0.0004384619,0.0009465903,0.0007094723,0.0015694988,0.0017930176,0.0024008832,0.0026621455,0.0015751865],"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.000038773727,0.000052161573,0.00016357464,0.00017370908,0.00006653224,0.00011901716,0.00013626982,0.43047202,0.004305888,0.4655174,0.008414563,0.0905401],"study_design_scores_gemma":[0.000014461101,0.000041001593,0.00006543749,0.000031539475,0.000011240985,0.00006223235,0.000016359,0.84366524,0.0010852568,0.14350215,0.011488353,0.0000167809],"about_ca_topic_score_codex":0.002427079,"about_ca_topic_score_gemma":0.0030507632,"teacher_disagreement_score":0.0060072527,"about_ca_system_score_codex":0.00095682335,"about_ca_system_score_gemma":0.0014012861,"threshold_uncertainty_score":0.020096242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08984966,0.00061053137,0.8150305,0.00257055,0.00009978107,0.0011844635,0.00030664905,0.000751574,0.0895963],"genre_scores_gemma":[0.39405093,0.00044512274,0.59903735,0.00014051536,0.000020817637,0.00035210396,0.00028902796,0.00005154105,0.005612711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487203,0.0029769475,0.00034754406,0.0004463088,0.0011162835,0.00024090955],"domain_scores_gemma":[0.9879149,0.010052431,0.00056058017,0.00080160756,0.00042040143,0.00025005272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067498726,0.0011727884,0.00069951813,0.0028930507,0.0017259676,0.006949937,0.0033970142,0.0021549053,0.007046862],"category_scores_gemma":[0.013077628,0.00080761785,0.0012683958,0.0011390217,0.0037655158,0.0057986053,0.0032855882,0.0016329056,0.0006836281],"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.00033837475,0.0013537972,0.0064188275,0.0005543884,0.0001917774,0.003684355,0.007368935,0.21220863,0.0031720577,0.60665005,0.0054272143,0.15263173],"study_design_scores_gemma":[0.0002532325,0.00023285036,0.0014263503,0.000646452,0.00013657038,0.0015010169,0.0041144597,0.68094826,0.005582749,0.2430402,0.061969955,0.00014783152],"about_ca_topic_score_codex":0.007189131,"about_ca_topic_score_gemma":0.014005075,"teacher_disagreement_score":0.007189131,"about_ca_system_score_codex":0.0026539455,"about_ca_system_score_gemma":0.0027682972,"threshold_uncertainty_score":0.035697162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8516074,0.00009820699,0.13738544,0.00012474663,0.00006617363,0.0005412265,0.00056179764,0.0054535875,0.0041614007],"genre_scores_gemma":[0.9635885,0.000024235223,0.033920363,0.00008701128,0.000006435084,0.00015606283,0.00055485696,0.00017548891,0.0014871282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685127,0.0009851548,0.0002750573,0.0008319147,0.00086468237,0.00019192281],"domain_scores_gemma":[0.986262,0.007475772,0.001799396,0.0013016576,0.002258339,0.00090282713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270947,0.001259627,0.0005515889,0.00088435906,0.00030000822,0.0007793479,0.0020658732,0.0007875815,0.0017921645],"category_scores_gemma":[0.019197049,0.00036718327,0.00030923597,0.00027757965,0.0006955681,0.0014505569,0.0008109435,0.0010809827,0.0007905738],"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.0037319385,0.0038639102,0.20595402,0.000878602,0.00046707617,0.0010501179,0.0024738484,0.2040694,0.19191793,0.0029405707,0.0043289717,0.37832364],"study_design_scores_gemma":[0.00012382564,0.0026706078,0.051195133,0.000055700493,0.00006122323,0.00046415153,0.0004260125,0.847611,0.09275561,0.0017905956,0.0027152987,0.00013080589],"about_ca_topic_score_codex":0.0032815977,"about_ca_topic_score_gemma":0.004293735,"teacher_disagreement_score":0.0032815977,"about_ca_system_score_codex":0.0006891257,"about_ca_system_score_gemma":0.0006782066,"threshold_uncertainty_score":0.011249304},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10814023,0.014557895,0.26413602,0.0125175305,0.005874166,0.000128196,0.0009678232,0.0005622525,0.5931159],"genre_scores_gemma":[0.8219108,0.008976077,0.08028306,0.0047665765,0.0052030687,0.00022235162,0.00058116374,0.0005847535,0.07747214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841344,0.00046211507,0.000100939935,0.00031166023,0.0004301567,0.00028171221],"domain_scores_gemma":[0.9940264,0.00388893,0.00029590173,0.00076959,0.00053240673,0.000486785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018876167,0.0011863207,0.0011838474,0.0022022445,0.002043666,0.0044686114,0.0014690945,0.0012775547,0.017632855],"category_scores_gemma":[0.010630301,0.0005142983,0.0013698824,0.0022569709,0.0039761467,0.0075707673,0.00349294,0.007243605,0.003170114],"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.00003572478,0.000013256384,0.00020990096,0.000059455993,0.000007901659,0.000109473905,0.00011658028,0.0005320133,0.0004446441,0.98754334,0.004117562,0.0068101403],"study_design_scores_gemma":[0.000013493503,0.000018905994,0.00023272353,0.000039492865,0.000009668806,0.00013808625,0.00004388102,0.0019752157,0.0002380682,0.9809823,0.016294979,0.000013190584],"about_ca_topic_score_codex":0.0010143772,"about_ca_topic_score_gemma":0.00138586,"teacher_disagreement_score":0.017632855,"about_ca_system_score_codex":0.0013461118,"about_ca_system_score_gemma":0.0005759562,"threshold_uncertainty_score":0.058987737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24070247,0.0015002362,0.39365822,0.037497,0.0018945663,0.00094838964,0.0066267676,0.005557371,0.31161496],"genre_scores_gemma":[0.714531,0.00082457974,0.1721417,0.0058262944,0.00026527364,0.00035341547,0.0038802752,0.0013770927,0.100800425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990337,0.0001541695,0.000048187016,0.00032779173,0.00018143875,0.0002547098],"domain_scores_gemma":[0.99858665,0.00061589957,0.00016367908,0.00029259064,0.00013145087,0.00020977983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197686,0.0008697171,0.00075286545,0.00028534894,0.0015228557,0.0020817511,0.0013891979,0.0014721538,0.026503026],"category_scores_gemma":[0.0037951227,0.00066165737,0.001620738,0.00038482915,0.0015863071,0.0055038086,0.0022561916,0.0032505672,0.0033830532],"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.0017080657,0.00042278256,0.0063745426,0.0018753645,0.00028208105,0.001887878,0.0023965447,0.037524678,0.028137157,0.6293534,0.13512373,0.1549138],"study_design_scores_gemma":[0.00015331151,0.00025192337,0.004949011,0.00037081528,0.0001261301,0.0013142668,0.0018558817,0.08091977,0.008518229,0.6739564,0.22745539,0.00012887073],"about_ca_topic_score_codex":0.006044473,"about_ca_topic_score_gemma":0.010471749,"teacher_disagreement_score":0.026503026,"about_ca_system_score_codex":0.0012563498,"about_ca_system_score_gemma":0.0010840369,"threshold_uncertainty_score":0.08866143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.467421,0.0003497156,0.47276816,0.0006580222,0.00053617253,0.0024361443,0.001437491,0.005003649,0.04938965],"genre_scores_gemma":[0.7067596,0.00018361882,0.2608363,0.00024454028,0.00003021739,0.0014694051,0.0012611996,0.00035643554,0.028858563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967134,0.00010618178,0.000024956074,0.000060228547,0.00008198116,0.00005540963],"domain_scores_gemma":[0.9993636,0.00032574657,0.000026856593,0.000043842665,0.00011291315,0.0001270854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062147574,0.00091166206,0.00063412846,0.0005233879,0.00037515274,0.0011437251,0.0011785631,0.00071996445,0.014247912],"category_scores_gemma":[0.0024038842,0.00018330889,0.0003649286,0.0002624234,0.00040735406,0.0009322353,0.0010158288,0.0006324376,0.001507414],"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.006573404,0.00514291,0.01612897,0.0020857935,0.00035364047,0.0029938908,0.003105727,0.25089738,0.08418479,0.060186822,0.03897115,0.52937555],"study_design_scores_gemma":[0.000600654,0.0030520589,0.0053964057,0.0001666788,0.000081742546,0.0010113041,0.00080090784,0.9032817,0.022679549,0.012019601,0.050785027,0.00012453202],"about_ca_topic_score_codex":0.0019209061,"about_ca_topic_score_gemma":0.00199648,"teacher_disagreement_score":0.014247912,"about_ca_system_score_codex":0.00034583663,"about_ca_system_score_gemma":0.0004607618,"threshold_uncertainty_score":0.047664046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14878564,0.00029118077,0.84318703,0.0005744833,0.00006379633,0.00011232637,0.00011337385,0.00032765963,0.0065444955],"genre_scores_gemma":[0.87710226,0.00018880454,0.12020757,0.00006738379,0.00002126469,0.00018093683,0.00010350865,0.000026969316,0.002101274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997061,0.00017099241,0.000013471764,0.000046186775,0.0000354256,0.00002780529],"domain_scores_gemma":[0.99892324,0.0007157961,0.000111991605,0.00007354605,0.000106062565,0.000069344125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089695124,0.0006212658,0.00044613032,0.0006442174,0.00050794124,0.0009604622,0.0006410085,0.0008427616,0.0024047226],"category_scores_gemma":[0.004205174,0.00036193285,0.0008162911,0.00026510135,0.000775282,0.00082154945,0.0009892847,0.00081831403,0.00031951172],"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.00006968914,0.000036693837,0.0028498308,0.00004488022,0.000057297064,0.00008298076,0.00030965285,0.95430356,0.00080968975,0.018537907,0.00044940508,0.022448348],"study_design_scores_gemma":[0.000004532558,0.000014682141,0.00020603824,0.0000050913313,0.0000041497838,0.000009101321,0.000027289318,0.9927972,0.000058204776,0.0066512497,0.00021908678,0.0000034135844],"about_ca_topic_score_codex":0.0106619485,"about_ca_topic_score_gemma":0.007323472,"teacher_disagreement_score":0.0106619485,"about_ca_system_score_codex":0.00085349043,"about_ca_system_score_gemma":0.00066712213,"threshold_uncertainty_score":0.021199822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7669726,0.0005575208,0.19973658,0.0009137626,0.00012200104,0.00017404507,0.00035042013,0.0009139783,0.030259112],"genre_scores_gemma":[0.9766568,0.000046342215,0.018715376,0.000047088695,0.000030643714,0.000035184825,0.0001336526,0.00004980478,0.0042852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981639,0.00080480654,0.0000637329,0.00030093707,0.00039609298,0.0002705159],"domain_scores_gemma":[0.9854177,0.010658452,0.00081970246,0.0017232754,0.00068149186,0.00069931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023319342,0.00048990594,0.0013834119,0.0013557574,0.0007818543,0.0012839467,0.002023549,0.001231268,0.011621831],"category_scores_gemma":[0.0282365,0.00029214335,0.00043378508,0.0014024022,0.0009993879,0.004248791,0.0019390602,0.0008667859,0.0009156674],"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.005539517,0.0016250032,0.034310553,0.00051010645,0.00027124304,0.00045219745,0.0005834951,0.2723821,0.0067095724,0.23698547,0.018042242,0.4225886],"study_design_scores_gemma":[0.00015166897,0.00042846645,0.0027991063,0.000025280016,0.000055357406,0.00015562281,0.00010519267,0.9009611,0.00079866056,0.09362088,0.0008738407,0.000024908317],"about_ca_topic_score_codex":0.0029493398,"about_ca_topic_score_gemma":0.005080136,"teacher_disagreement_score":0.011621831,"about_ca_system_score_codex":0.00087491353,"about_ca_system_score_gemma":0.0013395183,"threshold_uncertainty_score":0.038878918},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020760433,0.00028334084,0.0060379845,0.0012134694,0.0017141321,0.0002326583,0.012295547,0.016117984,0.9600288],"genre_scores_gemma":[0.0053234203,0.00013796923,0.0019567292,0.00016722178,0.000084232306,0.000062169755,0.0048287106,0.0039009943,0.9835386],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995821,0.00003848553,0.000011237031,0.00010716812,0.00012262302,0.00013839887],"domain_scores_gemma":[0.9983802,0.00008790278,0.000029860961,0.00022013232,0.0002589334,0.0010229248],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042844118,0.0014739254,0.0012172834,0.0009787747,0.0018980606,0.0047395034,0.0021599478,0.0011549384,0.92508847],"category_scores_gemma":[0.0014343604,0.0007399713,0.00073917414,0.0013621529,0.00052004715,0.0016397046,0.00348427,0.0010420692,0.8305443],"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.00031402658,0.00007147504,0.00016132023,0.00008713295,0.000012064175,0.000079132195,0.0000410966,0.00045497343,0.0020520063,0.0032887396,0.93601084,0.057427175],"study_design_scores_gemma":[0.000086259904,0.000026600052,0.00027116062,0.00001929486,0.0000073667015,0.000018139815,0.000053069445,0.0006683258,0.0005241471,0.00096925395,0.99734575,0.000010648929],"about_ca_topic_score_codex":0.042957462,"about_ca_topic_score_gemma":0.07043789,"teacher_disagreement_score":0.9570425,"about_ca_system_score_codex":0.0011913402,"about_ca_system_score_gemma":0.003276718,"threshold_uncertainty_score":0.10685223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21934187,0.00063119817,0.6818261,0.002817679,0.00040933405,0.0006463108,0.0004951634,0.0017623792,0.09206996],"genre_scores_gemma":[0.48750967,0.00035671637,0.48669252,0.00041539804,0.000076838194,0.00035954366,0.0004498723,0.00027876432,0.0238606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955882,0.0017747387,0.0004609461,0.00078073645,0.0009669786,0.00042839008],"domain_scores_gemma":[0.9938366,0.0029849673,0.00071190356,0.0010943899,0.0007352016,0.0006369169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027292753,0.0017438609,0.0015038949,0.0014018373,0.0024050681,0.0037389,0.001948037,0.002359717,0.01877491],"category_scores_gemma":[0.015063039,0.00066631584,0.0014258268,0.0016366909,0.0034699682,0.008575673,0.004724719,0.002472209,0.0040456327],"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.0009767802,0.00049384224,0.0034973768,0.00042371472,0.00013888333,0.00045839,0.0013984153,0.015553615,0.012794711,0.78567123,0.010290672,0.16830236],"study_design_scores_gemma":[0.00023194148,0.0007646044,0.001600903,0.00016683924,0.000121957586,0.0005618583,0.0012621274,0.10359447,0.010825988,0.8304565,0.050233703,0.00017919921],"about_ca_topic_score_codex":0.0011974227,"about_ca_topic_score_gemma":0.0015889057,"teacher_disagreement_score":0.01877491,"about_ca_system_score_codex":0.0015064103,"about_ca_system_score_gemma":0.0012437139,"threshold_uncertainty_score":0.062808275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031518914,0.00018620542,0.95983726,0.00048538216,0.00008376032,0.00020233178,0.00015944349,0.00087040866,0.0066563473],"genre_scores_gemma":[0.70410293,0.00051169837,0.27764064,0.0004428167,0.0001565867,0.00057889416,0.0009036808,0.0005096609,0.015153002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967631,0.0010460326,0.00019343606,0.0005899205,0.00077626016,0.0006312262],"domain_scores_gemma":[0.97962946,0.015436416,0.0008221554,0.0023397184,0.0007493828,0.0010229079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037635164,0.0020538198,0.0025234888,0.001154632,0.0014301158,0.0024102344,0.003978627,0.002729414,0.008532547],"category_scores_gemma":[0.019937484,0.0011560246,0.0013780332,0.0014985501,0.0034573148,0.0070557697,0.0074709575,0.006020302,0.0012515635],"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.0006107785,0.0003627101,0.001046283,0.00019537375,0.00007586238,0.00010639268,0.0003767792,0.6631682,0.0026852482,0.239325,0.0058607603,0.086186655],"study_design_scores_gemma":[0.000051953833,0.00009856237,0.00009671391,0.000022938817,0.000012550857,0.00001745952,0.000042244734,0.85882264,0.0006068362,0.13971037,0.00050218916,0.000015480498],"about_ca_topic_score_codex":0.0060948054,"about_ca_topic_score_gemma":0.008956098,"teacher_disagreement_score":0.008532547,"about_ca_system_score_codex":0.0020245365,"about_ca_system_score_gemma":0.0042109005,"threshold_uncertainty_score":0.028544247},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052705184,0.0011993042,0.9331498,0.0006439945,0.00016030925,0.00020606036,0.00005269113,0.0005912611,0.058725987],"genre_scores_gemma":[0.11517751,0.0018767338,0.84481627,0.00029266355,0.00005528126,0.00081201753,0.00019247583,0.0005189015,0.036258254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855167,0.0008297493,0.00006140263,0.00016635742,0.00029747793,0.00009336594],"domain_scores_gemma":[0.9987109,0.00080205774,0.000055389235,0.00021086363,0.00013874905,0.000082113474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020368155,0.0010092214,0.00030441297,0.0006142448,0.0006699066,0.0031998022,0.0020039426,0.00097159925,0.008293849],"category_scores_gemma":[0.0036657176,0.0007031669,0.0007917092,0.00036843508,0.002055431,0.0022019362,0.0021059157,0.0018008283,0.0022906393],"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.00006823855,0.00010940218,0.0005802902,0.0006358565,0.000053517855,0.00022458125,0.0035181632,0.027950305,0.007262592,0.76575464,0.011042361,0.18280016],"study_design_scores_gemma":[0.000088120796,0.00020358492,0.00043490925,0.00043145914,0.000044140957,0.0008281503,0.0012309173,0.11464655,0.0072893426,0.3086907,0.5660531,0.00005908364],"about_ca_topic_score_codex":0.0007844686,"about_ca_topic_score_gemma":0.001015329,"teacher_disagreement_score":0.008293849,"about_ca_system_score_codex":0.0008394119,"about_ca_system_score_gemma":0.00077231484,"threshold_uncertainty_score":0.027745664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064368226,0.00022816057,0.9291249,0.00061763654,0.000047951555,0.00014504467,0.000104652354,0.00045940102,0.0049038962],"genre_scores_gemma":[0.74948937,0.00017542951,0.24647225,0.0002424335,0.00005472942,0.00028589496,0.00021328653,0.00013883534,0.00292768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949824,0.003419753,0.00014311014,0.0005604999,0.0005716686,0.00032244527],"domain_scores_gemma":[0.9858169,0.011842076,0.00069922704,0.0008775585,0.00046853983,0.00029561573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073693935,0.0013958452,0.0015291199,0.00074785546,0.000667701,0.0020219993,0.002175788,0.0014623257,0.0028865356],"category_scores_gemma":[0.020365346,0.00070394756,0.0012200716,0.0006848387,0.0027238168,0.0027657356,0.0017662605,0.0022351427,0.00036197755],"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.00017650411,0.000072065886,0.00052148325,0.0000921589,0.00005122645,0.00008109782,0.00009991884,0.8489212,0.00045510853,0.12763779,0.0008912075,0.021000301],"study_design_scores_gemma":[0.000028896844,0.000027468002,0.00006871851,0.00000983703,0.00000826267,0.00001566144,0.000011756319,0.9142949,0.0004013849,0.08480925,0.0003170107,0.0000068101895],"about_ca_topic_score_codex":0.0043817186,"about_ca_topic_score_gemma":0.0038845115,"teacher_disagreement_score":0.0073693935,"about_ca_system_score_codex":0.002490181,"about_ca_system_score_gemma":0.0023978609,"threshold_uncertainty_score":0.03897357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08564052,0.00042787215,0.88181055,0.0016910152,0.00018811684,0.00019269402,0.0004419644,0.0011788287,0.028428504],"genre_scores_gemma":[0.6497253,0.00039341455,0.3172312,0.0003208764,0.00014463419,0.00034024048,0.00083573564,0.00063601066,0.03037251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976197,0.000818853,0.00018473643,0.00040384676,0.0006254895,0.00034733763],"domain_scores_gemma":[0.9834441,0.012446951,0.0005923461,0.0021401655,0.0007616716,0.0006146709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026617986,0.0010532762,0.0012657155,0.0007868741,0.0012016017,0.0034061668,0.0031859663,0.0023258287,0.012536199],"category_scores_gemma":[0.023377515,0.0006870299,0.00096874405,0.0014817648,0.0019569984,0.0064695245,0.004442513,0.004384505,0.0018268209],"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.0005716279,0.00028418333,0.00087919063,0.00029591395,0.00006944727,0.00018652811,0.0004900802,0.15004668,0.0020937377,0.71344256,0.013012525,0.11862751],"study_design_scores_gemma":[0.0000858716,0.00007916448,0.000065452834,0.000034988032,0.000021229105,0.000052575226,0.00012591254,0.40252787,0.0009289696,0.5928672,0.003191354,0.000019530069],"about_ca_topic_score_codex":0.0025877724,"about_ca_topic_score_gemma":0.003725191,"teacher_disagreement_score":0.012536199,"about_ca_system_score_codex":0.0013571836,"about_ca_system_score_gemma":0.002141182,"threshold_uncertainty_score":0.04193777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3510755,0.0011148109,0.4557128,0.0015991995,0.0003360944,0.00027634905,0.00069855625,0.00058383704,0.1886029],"genre_scores_gemma":[0.9469107,0.0003891403,0.031207291,0.00029655098,0.00008201723,0.00015358152,0.0004117872,0.00016889296,0.020379985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998248,0.00039583223,0.000104244486,0.00042974023,0.0005049458,0.00031736112],"domain_scores_gemma":[0.99822026,0.00055902766,0.00019775599,0.0002584178,0.00032918857,0.00043538777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064581697,0.00069273874,0.00068460574,0.0011878354,0.0017472443,0.005786481,0.00092197466,0.0010143602,0.008565888],"category_scores_gemma":[0.004129897,0.0005335608,0.0008535287,0.0008859214,0.0043740743,0.0073012053,0.0027493734,0.002382081,0.0009598164],"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.000011619506,0.000008273527,0.00021952162,0.000016343149,0.000004929881,0.00004108025,0.00021291543,0.00072009163,0.00050716643,0.99506664,0.00038686654,0.0028045105],"study_design_scores_gemma":[0.0000112437865,0.000012109503,0.00032328232,0.000011849942,0.000009345825,0.00012138543,0.00022759226,0.0067423973,0.000796313,0.9800598,0.01167183,0.000012789917],"about_ca_topic_score_codex":0.002716605,"about_ca_topic_score_gemma":0.0016215676,"teacher_disagreement_score":0.008565888,"about_ca_system_score_codex":0.0018774585,"about_ca_system_score_gemma":0.00088317634,"threshold_uncertainty_score":0.028655708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052986196,0.00019564149,0.9881224,0.00023664067,0.000017635244,0.0001126631,0.00012338001,0.0007435184,0.0051495335],"genre_scores_gemma":[0.25570837,0.00092588423,0.72967154,0.00016278491,0.0000564974,0.0004793288,0.0007106397,0.0004845139,0.011800436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984397,0.00081254775,0.00007731709,0.00031061535,0.0002836407,0.00007613387],"domain_scores_gemma":[0.99796814,0.001427677,0.00012166442,0.00023165486,0.0001548138,0.000096030766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016814548,0.0015049673,0.000762591,0.0011708501,0.0006755656,0.003182986,0.0036935266,0.001975821,0.0053055272],"category_scores_gemma":[0.0042861747,0.0011065919,0.0016876664,0.0006606936,0.0013258802,0.003565032,0.0020201392,0.002103194,0.0016020973],"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.0007547757,0.00059896853,0.005933704,0.0015056547,0.0005265889,0.0018516626,0.0142997885,0.35192466,0.039964754,0.32825515,0.007983641,0.24640058],"study_design_scores_gemma":[0.00005624402,0.00013269931,0.0005772127,0.00011722818,0.0001433026,0.0006499625,0.0006315545,0.89003414,0.00964172,0.047891255,0.050050322,0.000074371645],"about_ca_topic_score_codex":0.0031396272,"about_ca_topic_score_gemma":0.004417965,"teacher_disagreement_score":0.0053055272,"about_ca_system_score_codex":0.0009547758,"about_ca_system_score_gemma":0.0007804311,"threshold_uncertainty_score":0.017748773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057848528,0.00013637169,0.9328203,0.00017938256,0.000051606487,0.00018909984,0.000069890586,0.0008691718,0.007835583],"genre_scores_gemma":[0.57664824,0.00010234359,0.4180315,0.00012290697,0.000012169682,0.00042199442,0.000076022225,0.0001249772,0.0044597583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996106,0.00017808889,0.000017268187,0.00006304476,0.00009322291,0.000037858776],"domain_scores_gemma":[0.9981791,0.0012336624,0.00010003306,0.00016980841,0.00019011421,0.00012726507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013373513,0.00067957083,0.0006193544,0.00036828846,0.00048872305,0.0009229256,0.0014987598,0.0012799102,0.00460623],"category_scores_gemma":[0.0061807088,0.00046549205,0.00033679302,0.00026904707,0.0008215413,0.0010812897,0.000860589,0.0010924762,0.00055775937],"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.00019153736,0.00011414215,0.00071265956,0.00006291043,0.000040976596,0.000061460094,0.00009574891,0.93435514,0.0029540185,0.03636627,0.00080993463,0.024235174],"study_design_scores_gemma":[0.000017627048,0.000034405213,0.000028992188,0.000003464463,0.0000029588643,0.000008945117,0.000005246666,0.99583864,0.00042863292,0.0029697386,0.0006581171,0.000003342154],"about_ca_topic_score_codex":0.0037218889,"about_ca_topic_score_gemma":0.00573951,"teacher_disagreement_score":0.00460623,"about_ca_system_score_codex":0.0008368742,"about_ca_system_score_gemma":0.0013440747,"threshold_uncertainty_score":0.01540935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018557872,0.006505902,0.94670755,0.0008991331,0.00041241958,0.000043317305,0.00016450281,0.0005250392,0.042886324],"genre_scores_gemma":[0.19877015,0.011759151,0.70756626,0.0008565744,0.00097159104,0.00055024726,0.001119686,0.000969361,0.07743685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929345,0.0002824719,0.0000517957,0.00008844033,0.0002422522,0.000041447274],"domain_scores_gemma":[0.9991702,0.00050356216,0.000033264507,0.00017490066,0.0000925187,0.000025593305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089510245,0.00080086273,0.0007288161,0.00096036476,0.00044943302,0.0025690433,0.001241588,0.0014208299,0.016479587],"category_scores_gemma":[0.004620213,0.0004321107,0.00079535774,0.0015010315,0.0015966175,0.0035554252,0.001750476,0.0022635402,0.004192283],"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.000020822828,0.0000166282,0.00004556394,0.00018765959,0.00001590293,0.000014108253,0.00007529725,0.018077513,0.0005832245,0.84978014,0.008185952,0.12299719],"study_design_scores_gemma":[0.00001047412,0.000010995937,0.000030786945,0.00008669992,0.000008792178,0.000032453456,0.000022208147,0.07928764,0.00048722659,0.8840294,0.035984404,0.000008945902],"about_ca_topic_score_codex":0.0009806383,"about_ca_topic_score_gemma":0.00093607145,"teacher_disagreement_score":0.016479587,"about_ca_system_score_codex":0.001030295,"about_ca_system_score_gemma":0.0006748276,"threshold_uncertainty_score":0.055129707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018807985,0.0035284162,0.000044405602,0.10724953,0.88643634,0.000014819188,0.000024556874,0.000031563777,0.0026515266],"genre_scores_gemma":[0.0006316128,0.004386083,0.00013203024,0.21359564,0.73712903,0.00006364018,0.000043673357,0.0000865721,0.043931644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98392963,0.0032254467,0.0013275777,0.0014425386,0.008505392,0.0015693995],"domain_scores_gemma":[0.96125907,0.012545804,0.0019716267,0.0014346563,0.013768223,0.009020629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015157178,0.004135686,0.0041516363,0.0045210775,0.007410418,0.02020824,0.0050085494,0.04387494,0.03571397],"category_scores_gemma":[0.07311665,0.0013723773,0.0035645866,0.0021918183,0.00695584,0.009131908,0.005988161,0.049432863,0.02226432],"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.0000093958215,0.000005273962,0.000010907527,0.000050036284,0.000006436521,0.000028957013,0.000014430185,0.000005036031,0.000007834019,0.0004286822,0.99796164,0.001471328],"study_design_scores_gemma":[0.0000323806,0.000011795595,0.00009168289,0.0003315293,0.000021728134,0.000051547533,0.00010830014,0.000039637616,0.000027035354,0.0011038685,0.99816376,0.000016684613],"about_ca_topic_score_codex":0.008684956,"about_ca_topic_score_gemma":0.037907474,"teacher_disagreement_score":0.04387494,"about_ca_system_score_codex":0.008896269,"about_ca_system_score_gemma":0.012966406,"threshold_uncertainty_score":0.119475126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009557857,0.00043300068,0.7336956,0.001484378,0.0010970605,0.00038487357,0.002453275,0.006336213,0.24455772],"genre_scores_gemma":[0.12494081,0.0005736438,0.73238605,0.0012142673,0.00023379645,0.0004282287,0.006228564,0.003598356,0.13039622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.00014956143,0.000060088823,0.00020198332,0.0002677021,0.00012926056],"domain_scores_gemma":[0.9994294,0.00019906051,0.000025223251,0.0001906334,0.00012180273,0.000033821394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061885547,0.001465048,0.0009993732,0.0008837575,0.0009911285,0.0025534506,0.0020858035,0.0012906631,0.103510864],"category_scores_gemma":[0.0024599724,0.00072171097,0.0016426023,0.001328355,0.0008334705,0.0030132283,0.0036573347,0.0028236036,0.021316096],"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.00033403424,0.0002816935,0.00040661133,0.0007304981,0.00009292806,0.0003126181,0.00020406938,0.023529192,0.004292854,0.45364612,0.1138719,0.4022975],"study_design_scores_gemma":[0.00031284554,0.00008797812,0.00019083309,0.00021950055,0.00010765272,0.00040229433,0.0002375074,0.16466811,0.009608928,0.67251945,0.1516029,0.000042091364],"about_ca_topic_score_codex":0.0011630689,"about_ca_topic_score_gemma":0.0022452958,"teacher_disagreement_score":0.103510864,"about_ca_system_score_codex":0.0006692111,"about_ca_system_score_gemma":0.0015718418,"threshold_uncertainty_score":0.3462783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004513151,0.00009909483,0.9933206,0.0000847641,0.000032989155,0.000109088454,0.000045190016,0.0007273933,0.0010676497],"genre_scores_gemma":[0.37454596,0.00014154798,0.62200665,0.00020088385,0.0001248823,0.00074077345,0.00025783016,0.0003948518,0.0015866605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98584783,0.008332886,0.0006472133,0.0010281237,0.003549549,0.00059446675],"domain_scores_gemma":[0.9649253,0.025859393,0.002812914,0.002423545,0.003301822,0.0006771231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013421485,0.0018059759,0.0021737558,0.0024684302,0.0009010574,0.0022159806,0.0028110887,0.0016804144,0.0026694885],"category_scores_gemma":[0.05475974,0.00093418214,0.0016934348,0.0009835571,0.0019494346,0.002729362,0.0034128246,0.003636068,0.00061587495],"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.00056001765,0.00026566157,0.0065387837,0.00033581856,0.00043783063,0.00032056394,0.00058000314,0.62035215,0.0056298994,0.1027511,0.004773449,0.2574547],"study_design_scores_gemma":[0.000030038535,0.00009230574,0.00028477,0.000024413472,0.000018720939,0.000041704414,0.000022062757,0.9742405,0.0011956283,0.023366839,0.0006639767,0.000019047602],"about_ca_topic_score_codex":0.0025408186,"about_ca_topic_score_gemma":0.0026485024,"teacher_disagreement_score":0.013421485,"about_ca_system_score_codex":0.0016251318,"about_ca_system_score_gemma":0.0022883997,"threshold_uncertainty_score":0.07098049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079321034,0.00012628426,0.9093895,0.000114014794,0.00004159122,0.0003484854,0.000031719184,0.0007200616,0.009907322],"genre_scores_gemma":[0.3442852,0.00022771672,0.6503738,0.000091257236,0.0000136774215,0.00040240627,0.00012577594,0.00013853074,0.004341715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950266,0.00020226004,0.000023647213,0.00008007947,0.00014759424,0.00004377176],"domain_scores_gemma":[0.9994241,0.00035532273,0.000055587923,0.000051113973,0.00006765788,0.0000461978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007559309,0.00076699373,0.00039710404,0.0006677554,0.0003799215,0.0007923579,0.000960756,0.0006048051,0.0021639047],"category_scores_gemma":[0.0020094279,0.00027155923,0.00055273256,0.0003002022,0.00061613036,0.00057525915,0.0007892614,0.00064312754,0.0004032239],"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.00028243306,0.0006122442,0.0067396984,0.00047523784,0.00015986011,0.00070450397,0.0018247834,0.48350275,0.06820867,0.097646914,0.002194742,0.33764818],"study_design_scores_gemma":[0.0000861854,0.0005220462,0.0013821698,0.0000798263,0.00008553159,0.0005185253,0.00028497563,0.9424839,0.01663497,0.021357616,0.016502194,0.000062029845],"about_ca_topic_score_codex":0.0008243172,"about_ca_topic_score_gemma":0.00096726656,"teacher_disagreement_score":0.0021639047,"about_ca_system_score_codex":0.0003422393,"about_ca_system_score_gemma":0.00037751047,"threshold_uncertainty_score":0.0072390437},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08321086,0.00241644,0.20047875,0.0063032606,0.0005788521,0.0003043538,0.0040502152,0.0032896788,0.6993676],"genre_scores_gemma":[0.6734664,0.0024230154,0.089081764,0.0023201238,0.0005389364,0.0004459526,0.007841722,0.0011537906,0.22272827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948895,0.00008943497,0.00002942875,0.00011085786,0.00018292472,0.000098432254],"domain_scores_gemma":[0.999084,0.0005417813,0.00005978999,0.00010344576,0.00014609103,0.00006482662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004584582,0.0011809152,0.00101626,0.0008299047,0.001326242,0.0023135869,0.0012063059,0.001094116,0.02885432],"category_scores_gemma":[0.002489584,0.00048878527,0.0011683844,0.0013423586,0.0011682882,0.0036111872,0.0017862796,0.0034286182,0.0059650172],"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.0003805406,0.0001884019,0.0003815657,0.0014008074,0.000092844,0.0003356991,0.00040430858,0.026222061,0.0051402776,0.69732064,0.09211314,0.1760198],"study_design_scores_gemma":[0.000068671965,0.000033226344,0.00021632727,0.00007520119,0.000025917108,0.00018721369,0.00007444247,0.014698769,0.0025378105,0.9476778,0.034386795,0.000017790786],"about_ca_topic_score_codex":0.0013558517,"about_ca_topic_score_gemma":0.0020660264,"teacher_disagreement_score":0.02885432,"about_ca_system_score_codex":0.0013975286,"about_ca_system_score_gemma":0.0009999675,"threshold_uncertainty_score":0.09652728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051632125,0.00029527003,0.925361,0.00026105493,0.000060989158,0.00022293295,0.00009112489,0.0009984971,0.021076988],"genre_scores_gemma":[0.7650316,0.00030834237,0.23068431,0.00004780204,0.000030124942,0.00036529015,0.00008453505,0.00010959478,0.0033385449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990784,0.00046407137,0.000029119508,0.000084897634,0.00027025424,0.00007337685],"domain_scores_gemma":[0.9969503,0.002356221,0.000158368,0.00015954784,0.00020491684,0.00017057148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135457,0.001034417,0.00055520626,0.0013530222,0.0010068552,0.0017953654,0.0009854401,0.00076129317,0.0050629065],"category_scores_gemma":[0.0072084027,0.0004289878,0.00071357226,0.00078249123,0.0012943206,0.0023839953,0.0027308292,0.0008682313,0.0004706187],"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.00059701334,0.00036962278,0.0024411874,0.0004964172,0.00012168568,0.0010268519,0.0042178403,0.49539366,0.014336067,0.25504267,0.0032702696,0.2226867],"study_design_scores_gemma":[0.0000961493,0.00015431517,0.0010504314,0.000056580262,0.00006349556,0.00015121662,0.0005241085,0.88791215,0.0066603273,0.085245766,0.018015387,0.00007014456],"about_ca_topic_score_codex":0.0037106571,"about_ca_topic_score_gemma":0.004005457,"teacher_disagreement_score":0.0050629065,"about_ca_system_score_codex":0.0007835989,"about_ca_system_score_gemma":0.0008573029,"threshold_uncertainty_score":0.016937137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06569245,0.0005481931,0.93052214,0.00033579633,0.000032009273,0.000052480464,0.00007413647,0.0003441707,0.0023986588],"genre_scores_gemma":[0.80883527,0.00026707663,0.18831754,0.00013876052,0.000034130073,0.00017288503,0.00019403703,0.00010727635,0.0019329928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928397,0.0003506508,0.000035046192,0.00010635606,0.00014387189,0.0000800983],"domain_scores_gemma":[0.9935209,0.005526104,0.000327226,0.00017384064,0.00027145716,0.00018047042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020475043,0.00061573007,0.0012123152,0.00067344593,0.00046307276,0.0007626329,0.0010623048,0.001342961,0.0017689562],"category_scores_gemma":[0.008587288,0.0005909461,0.0006600482,0.00078839285,0.0014367234,0.0011826515,0.0009241236,0.0012595839,0.00021505868],"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.00003303061,0.000011230246,0.00032250828,0.000015760013,0.00001027455,0.000020488491,0.00001592606,0.9880079,0.0001163809,0.0067912806,0.0001355556,0.0045196647],"study_design_scores_gemma":[0.0000040399023,0.000004602573,0.000034602985,0.0000017218465,0.0000012617762,0.0000024224612,0.0000016793474,0.9972844,0.00003068319,0.0025807105,0.00005271592,0.0000011812283],"about_ca_topic_score_codex":0.014260924,"about_ca_topic_score_gemma":0.011639163,"teacher_disagreement_score":0.014260924,"about_ca_system_score_codex":0.0012718176,"about_ca_system_score_gemma":0.0018849103,"threshold_uncertainty_score":0.028355837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15808767,0.00078736624,0.82023597,0.00050718343,0.00008496588,0.00065386517,0.0002983031,0.00065984466,0.018684778],"genre_scores_gemma":[0.83519256,0.00021411,0.16189782,0.000075967066,0.0000145597705,0.00039467143,0.00021409019,0.00010659732,0.0018896674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99081403,0.004315899,0.00066196616,0.0007812002,0.0030964736,0.00033051104],"domain_scores_gemma":[0.9621646,0.0229872,0.007901736,0.0027245493,0.002948241,0.0012736735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073262597,0.0020792482,0.00069329416,0.0031900255,0.00079008803,0.0032031164,0.0015047551,0.0017833106,0.0041587017],"category_scores_gemma":[0.064322576,0.0006272634,0.0007231537,0.00093914854,0.0028429423,0.005890253,0.00397646,0.0013808721,0.00061062083],"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.0014179156,0.00076394,0.056033447,0.0017162866,0.0006042213,0.0005595323,0.005610661,0.40401947,0.027279362,0.23712245,0.0039242273,0.2609484],"study_design_scores_gemma":[0.00012163532,0.0025365658,0.020829594,0.00045558272,0.00023704281,0.00081695814,0.002029151,0.68196374,0.015192549,0.2634443,0.012073133,0.00029972993],"about_ca_topic_score_codex":0.0012037577,"about_ca_topic_score_gemma":0.0018317204,"teacher_disagreement_score":0.0073262597,"about_ca_system_score_codex":0.0020016113,"about_ca_system_score_gemma":0.0009414563,"threshold_uncertainty_score":0.038745403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07325454,0.0004564099,0.8913268,0.0033341148,0.00015618358,0.00017158288,0.00018342808,0.0022060892,0.028910965],"genre_scores_gemma":[0.7186656,0.00024870678,0.26659018,0.0010942377,0.00006645808,0.00019442663,0.00028113823,0.00027762077,0.012581562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864894,0.0005607888,0.00006139871,0.0002478775,0.00030652343,0.00017441527],"domain_scores_gemma":[0.9974306,0.0015519318,0.00017556877,0.0004582639,0.00020421491,0.00017942536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030782905,0.00075849507,0.00067679776,0.0006488551,0.0009963162,0.0023371154,0.0021159784,0.0017255349,0.0066990512],"category_scores_gemma":[0.01179067,0.0005157605,0.0005996628,0.00042096069,0.0031876187,0.0054320674,0.0043162555,0.0032096196,0.0012201761],"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.00039669266,0.00042384962,0.0064981193,0.00025863686,0.000116056355,0.00024700764,0.0009335325,0.22079125,0.0032344568,0.49485612,0.014968218,0.25727603],"study_design_scores_gemma":[0.000044453747,0.00006253626,0.0003605529,0.000043292737,0.0000136625285,0.00005753094,0.0001022701,0.6561475,0.0016486798,0.3350816,0.0064205662,0.000017386672],"about_ca_topic_score_codex":0.0023573986,"about_ca_topic_score_gemma":0.004449412,"teacher_disagreement_score":0.0066990512,"about_ca_system_score_codex":0.0013738889,"about_ca_system_score_gemma":0.0018225749,"threshold_uncertainty_score":0.022410572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010707745,0.0021044412,0.7574505,0.010495158,0.00043317268,0.00026122096,0.00056562806,0.0005712323,0.21741088],"genre_scores_gemma":[0.54663974,0.0013868761,0.42167276,0.0009718997,0.00032903175,0.0008034205,0.0011894866,0.0002978868,0.026708871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971928,0.0014011886,0.00022885646,0.0005085564,0.00042768352,0.00024093418],"domain_scores_gemma":[0.99449486,0.0027530172,0.0004594015,0.0009905905,0.0008029368,0.0004991259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030396034,0.00077057176,0.00052704295,0.0023649232,0.0040280735,0.007996414,0.0023552151,0.0029066522,0.017079577],"category_scores_gemma":[0.014509851,0.0007210957,0.0013684357,0.0015796662,0.009273641,0.017647142,0.005888531,0.003283757,0.0023811357],"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.0000041692265,0.000004386321,0.00004623762,0.0000188364,0.0000030751337,0.000043346052,0.0005601626,0.00022653538,0.00004681519,0.9955936,0.0010132797,0.0024395764],"study_design_scores_gemma":[0.0000064235487,0.0000038480675,0.000037963164,0.000025470572,0.0000044538388,0.00006582369,0.0003847576,0.0023040664,0.000080064245,0.9806507,0.016431846,0.000004526933],"about_ca_topic_score_codex":0.0032706733,"about_ca_topic_score_gemma":0.0042662327,"teacher_disagreement_score":0.017079577,"about_ca_system_score_codex":0.0025927003,"about_ca_system_score_gemma":0.0019729768,"threshold_uncertainty_score":0.057136834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038632948,0.000075922,0.9513368,0.00008288388,0.000039221948,0.00018512257,0.000060522903,0.0024646926,0.0071218363],"genre_scores_gemma":[0.50419873,0.000104129314,0.48727617,0.00010100532,0.00001179965,0.00036957453,0.00025380193,0.00060953404,0.0070752343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996424,0.00010051849,0.000015497895,0.00009072155,0.00011425835,0.000036604935],"domain_scores_gemma":[0.99921536,0.00042048073,0.00005718442,0.00015679975,0.00008099457,0.00006913709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066677766,0.00055768125,0.0003221744,0.00040814077,0.00041216798,0.0011696807,0.0012740648,0.0008871775,0.0038959512],"category_scores_gemma":[0.0033650948,0.00045557946,0.00062538125,0.00017312336,0.00090022787,0.0011556878,0.0018956916,0.0007547853,0.0009064521],"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.000341918,0.00042736877,0.0068905875,0.0004734063,0.00015180594,0.0008195353,0.0030242896,0.40557235,0.16079271,0.11217754,0.006586765,0.30274174],"study_design_scores_gemma":[0.00004092155,0.00016262953,0.00083854137,0.000030593343,0.000037167043,0.00028426351,0.00012829193,0.9261035,0.02745591,0.028313745,0.016564658,0.000039795512],"about_ca_topic_score_codex":0.00070899643,"about_ca_topic_score_gemma":0.0009805528,"teacher_disagreement_score":0.0038959512,"about_ca_system_score_codex":0.00044206233,"about_ca_system_score_gemma":0.00039518962,"threshold_uncertainty_score":0.013033211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43250826,0.0023810398,0.46529266,0.00079955737,0.0013165675,0.0013154404,0.008938185,0.020932637,0.066515565],"genre_scores_gemma":[0.6971183,0.0006994186,0.27156052,0.00018061565,0.00028197202,0.00034900344,0.012263249,0.0010036697,0.016543305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990852,0.00020679382,0.00008146536,0.00028698242,0.00027393302,0.00006557898],"domain_scores_gemma":[0.9969125,0.0011047538,0.00036721022,0.00051611895,0.000894732,0.00020462103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981538,0.000721841,0.00045185132,0.0049644043,0.00045173932,0.001467571,0.00058683613,0.0005837109,0.006736574],"category_scores_gemma":[0.0060475366,0.0002136929,0.00034800873,0.002511136,0.00042888004,0.0025123737,0.0009531798,0.0007000613,0.0066807587],"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.0004948052,0.00016468069,0.022321362,0.0005596194,0.00006130963,0.00029450018,0.0007931095,0.00077771593,0.08321591,0.0036747842,0.023518238,0.864124],"study_design_scores_gemma":[0.00019083706,0.0007523232,0.36345908,0.0003154235,0.000184215,0.0042502023,0.0061373995,0.26523992,0.13534138,0.03018576,0.19371827,0.00022512449],"about_ca_topic_score_codex":0.000477417,"about_ca_topic_score_gemma":0.0009876154,"teacher_disagreement_score":0.006736574,"about_ca_system_score_codex":0.00018901899,"about_ca_system_score_gemma":0.00026157586,"threshold_uncertainty_score":0.022536099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19160523,0.00028566513,0.76355106,0.0005901927,0.000083981715,0.0003708473,0.00011085375,0.00063066167,0.042771507],"genre_scores_gemma":[0.849351,0.00011331716,0.13961445,0.00010484922,0.000015294681,0.00015582076,0.00010954935,0.00008100837,0.010454704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993218,0.00028773423,0.000023196033,0.0001188171,0.00013639711,0.00011201182],"domain_scores_gemma":[0.9988952,0.00069906673,0.00010145402,0.00007541436,0.00008683832,0.00014204663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083055545,0.0010176963,0.00066445046,0.00052823086,0.0009891434,0.00126849,0.0011752801,0.001380055,0.008437034],"category_scores_gemma":[0.0041653616,0.00037344053,0.00056830875,0.000261614,0.0010892386,0.0021817882,0.0020018027,0.0011108922,0.0008570048],"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.001279532,0.000662191,0.00521579,0.0006352006,0.00013960268,0.0015089848,0.002625408,0.4652547,0.02104599,0.30355042,0.009218158,0.18886401],"study_design_scores_gemma":[0.000062936,0.0005050377,0.0007660574,0.000048207006,0.000034203353,0.000381353,0.0006059929,0.894206,0.0032474445,0.0933355,0.006782357,0.000024899064],"about_ca_topic_score_codex":0.0021000279,"about_ca_topic_score_gemma":0.0032187353,"teacher_disagreement_score":0.008437034,"about_ca_system_score_codex":0.0008407984,"about_ca_system_score_gemma":0.0007412526,"threshold_uncertainty_score":0.028224707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15356863,0.00008958029,0.8343697,0.000143912,0.000052139418,0.00047773097,0.00010984045,0.004167792,0.007020634],"genre_scores_gemma":[0.8597722,0.00006420667,0.13619833,0.000052283005,0.000013095893,0.00030421306,0.00022684317,0.0002440207,0.0031247698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993999,0.00018826067,0.00004536723,0.00016006178,0.00012532937,0.00008103781],"domain_scores_gemma":[0.99864715,0.00035495206,0.00016731686,0.00033573128,0.00021965886,0.0002752991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008938743,0.0006177665,0.0003044037,0.0004988848,0.0005470153,0.0009669293,0.0014766515,0.00035017123,0.0027548335],"category_scores_gemma":[0.002784744,0.0003777432,0.000373143,0.00032965737,0.0006769642,0.0010927827,0.0009367839,0.00062831916,0.00040865873],"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.0011648947,0.0011112365,0.019257767,0.00024212555,0.0001824436,0.00041363703,0.0015800355,0.6364445,0.05948221,0.06414898,0.0042863907,0.21168575],"study_design_scores_gemma":[0.000034905243,0.00014174922,0.0013106754,0.0000059440254,0.000026954369,0.000052258638,0.00005513562,0.9826215,0.003973596,0.008386983,0.0033655425,0.000024724271],"about_ca_topic_score_codex":0.009187553,"about_ca_topic_score_gemma":0.00875253,"teacher_disagreement_score":0.009187553,"about_ca_system_score_codex":0.0012583578,"about_ca_system_score_gemma":0.0018723942,"threshold_uncertainty_score":0.018268168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07670577,0.0004517545,0.9027705,0.00041906734,0.00013888633,0.00095663697,0.007044555,0.0032647848,0.008248048],"genre_scores_gemma":[0.3459571,0.00055813376,0.6201011,0.000108755776,0.00004164948,0.00071588915,0.019413145,0.00061301136,0.012491175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983972,0.000306857,0.000095660645,0.00057160464,0.0004750184,0.00015366977],"domain_scores_gemma":[0.99641824,0.0012748374,0.0003563556,0.0007231016,0.0010050096,0.0002224498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386584,0.0013277245,0.000691709,0.005889391,0.0010967724,0.0020322073,0.001653325,0.001310023,0.0063238502],"category_scores_gemma":[0.011041465,0.0004342648,0.0009674625,0.005118008,0.0006043876,0.0024505216,0.0019703647,0.0010216414,0.0033929779],"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.0007816678,0.0006352306,0.055467803,0.0010732847,0.00040308287,0.00037238267,0.0025109258,0.14344074,0.010501657,0.047011234,0.025542999,0.712259],"study_design_scores_gemma":[0.00006571461,0.00032233188,0.019806085,0.0002392137,0.00015246106,0.00086934294,0.0026986073,0.82011616,0.014281005,0.09405138,0.047272876,0.00012488756],"about_ca_topic_score_codex":0.0101033645,"about_ca_topic_score_gemma":0.018890094,"teacher_disagreement_score":0.0101033645,"about_ca_system_score_codex":0.0010481906,"about_ca_system_score_gemma":0.0018327346,"threshold_uncertainty_score":0.021155357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2414019,0.0013540249,0.60945976,0.0010655732,0.00023679188,0.00026788056,0.00008269756,0.0010387398,0.14509273],"genre_scores_gemma":[0.81654924,0.00048168426,0.15913914,0.00009796767,0.000025462996,0.00016465104,0.00006790702,0.00008577436,0.023388006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997305,0.000117033676,0.000011475094,0.000037017056,0.0000658268,0.000038224644],"domain_scores_gemma":[0.9997552,0.000055430133,0.000023402827,0.0000337047,0.000055672346,0.00007661806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035499432,0.00047927027,0.00012908119,0.0002500246,0.0005098809,0.0015863056,0.00068452716,0.00034910563,0.0032246981],"category_scores_gemma":[0.0011136079,0.00021995549,0.00030759728,0.00012426528,0.0008200653,0.0007417748,0.0012082614,0.00044051348,0.0005354977],"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.0002617153,0.0002900218,0.0074646324,0.0008644454,0.00014297213,0.00086263445,0.01324188,0.07273889,0.0788332,0.3128561,0.018325053,0.49411836],"study_design_scores_gemma":[0.00010623241,0.0006621065,0.019888835,0.000453808,0.00016723378,0.0023494286,0.007660016,0.41040313,0.022827303,0.2625049,0.2728065,0.00017057089],"about_ca_topic_score_codex":0.00079921837,"about_ca_topic_score_gemma":0.0012095775,"teacher_disagreement_score":0.0032246981,"about_ca_system_score_codex":0.00053599046,"about_ca_system_score_gemma":0.0003816694,"threshold_uncertainty_score":0.010787725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037392713,0.0018564167,0.5072965,0.0049962257,0.0005186576,0.0006160845,0.0013129918,0.0030416443,0.4429687],"genre_scores_gemma":[0.530341,0.0044779344,0.19446833,0.0027158014,0.00020671358,0.001312129,0.0036781884,0.00079637335,0.26200345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993407,0.00016061499,0.00003712326,0.00018949434,0.0002080702,0.00006385729],"domain_scores_gemma":[0.99917597,0.0002209177,0.0000641433,0.00024059443,0.00021509026,0.000083159655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069615734,0.00078313536,0.00032599227,0.00042419398,0.00048587268,0.0016445506,0.0013566389,0.0008786576,0.030952321],"category_scores_gemma":[0.0038059712,0.00026643366,0.0005443419,0.00026920388,0.0011383053,0.0017314184,0.0014513653,0.0015088358,0.009418078],"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.00012641506,0.000435183,0.006515058,0.0008668942,0.00017462637,0.00038035098,0.0011810309,0.036743842,0.014849869,0.4173416,0.040671326,0.48071387],"study_design_scores_gemma":[0.00008488397,0.00040658037,0.006667256,0.00050387555,0.00008246725,0.00095121533,0.0007509273,0.13551317,0.009220776,0.5046005,0.34111723,0.000101177815],"about_ca_topic_score_codex":0.0014012067,"about_ca_topic_score_gemma":0.0019189926,"teacher_disagreement_score":0.030952321,"about_ca_system_score_codex":0.0010091354,"about_ca_system_score_gemma":0.0012655708,"threshold_uncertainty_score":0.103545845},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3975472,0.00032291494,0.16714153,0.0034015712,0.0006770076,0.00026094672,0.00050979527,0.00041185145,0.42972717],"genre_scores_gemma":[0.9137693,0.00017461365,0.035958398,0.00045106997,0.00006778004,0.00027884613,0.00027403183,0.00018589017,0.048840065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867296,0.00034817864,0.0000917728,0.00021787944,0.0002331005,0.00043606383],"domain_scores_gemma":[0.99921787,0.00028584045,0.000082400365,0.000145148,0.000075923,0.00019285771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009534817,0.00094946177,0.0011907943,0.0007061003,0.0032311943,0.0037095712,0.0014117265,0.0025055334,0.023274936],"category_scores_gemma":[0.0027952073,0.00052324426,0.0012105238,0.0007583733,0.005129817,0.0085820565,0.0043722433,0.0040188576,0.002352738],"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.00014050832,0.000025445303,0.00018458816,0.00003657448,0.000008231281,0.00010365464,0.0003401263,0.0010351579,0.0006373027,0.99302846,0.0006248653,0.0038349915],"study_design_scores_gemma":[0.000054619515,0.00009201678,0.0003375302,0.000036538204,0.000021051836,0.00012821206,0.000479242,0.0076154596,0.00091252784,0.9791869,0.011087796,0.000048266225],"about_ca_topic_score_codex":0.0010398033,"about_ca_topic_score_gemma":0.0020948898,"teacher_disagreement_score":0.023274936,"about_ca_system_score_codex":0.0012420719,"about_ca_system_score_gemma":0.00096985966,"threshold_uncertainty_score":0.07786238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55076724,0.0010659395,0.39891177,0.0036254248,0.0002461877,0.00020432728,0.0001770136,0.00037961637,0.044622373],"genre_scores_gemma":[0.9344578,0.0003277039,0.056069225,0.00054560805,0.000068137844,0.00020123605,0.000120530334,0.00008008847,0.008129632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986811,0.00068737153,0.000042772135,0.00017840821,0.00022760489,0.00018272754],"domain_scores_gemma":[0.9937634,0.004765205,0.00049887015,0.00026720727,0.00034366245,0.0003616463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030243348,0.000854881,0.0010337604,0.0008323598,0.00090479065,0.0016885696,0.0014345851,0.0023314208,0.0039762845],"category_scores_gemma":[0.0135048125,0.00034415725,0.0007785165,0.00050786696,0.0030425075,0.0019950012,0.0023666068,0.002093715,0.00034882402],"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.0002556151,0.0002202774,0.0068880664,0.0001856996,0.00012576934,0.00035574796,0.0006798566,0.73258895,0.004170248,0.21655445,0.0016623805,0.036312923],"study_design_scores_gemma":[0.00006563816,0.00022333652,0.001002414,0.000032330285,0.000025948772,0.00010782652,0.00014516897,0.84629506,0.0005954303,0.14921786,0.0022546523,0.00003439467],"about_ca_topic_score_codex":0.0017463855,"about_ca_topic_score_gemma":0.0014880905,"teacher_disagreement_score":0.0039762845,"about_ca_system_score_codex":0.0012990667,"about_ca_system_score_gemma":0.0011359119,"threshold_uncertainty_score":0.01599443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90816134,0.00070857524,0.08349511,0.00033791436,0.00010689942,0.000112609545,0.0005563952,0.0014127844,0.0051084897],"genre_scores_gemma":[0.98654884,0.00008395293,0.012000607,0.000044846092,0.000008004326,0.000029899162,0.00045490844,0.00002624535,0.00080262613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992316,0.00024225037,0.0000609189,0.00015936424,0.000181783,0.00012413287],"domain_scores_gemma":[0.99763954,0.0014190224,0.00027876202,0.00013284002,0.00035843518,0.00017134799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121208,0.0013400313,0.000589932,0.0010533214,0.00024252517,0.0010875465,0.0009125955,0.0010780267,0.0015663443],"category_scores_gemma":[0.006470613,0.00031229382,0.00038879056,0.00054245867,0.00056347606,0.0015426361,0.00075471954,0.00089641946,0.00023945137],"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.0009090611,0.00036883552,0.015032016,0.00017297264,0.00023234075,0.00010828574,0.00009117591,0.836896,0.0044602808,0.0021850187,0.0018970289,0.13764694],"study_design_scores_gemma":[0.000009756432,0.000062662686,0.0010409247,0.0000060777656,0.000009193779,0.0000047489593,0.0000100743255,0.9967585,0.0014625726,0.0005467471,0.000083898725,0.0000047169615],"about_ca_topic_score_codex":0.018370347,"about_ca_topic_score_gemma":0.023321312,"teacher_disagreement_score":0.018370347,"about_ca_system_score_codex":0.0022385356,"about_ca_system_score_gemma":0.0007765449,"threshold_uncertainty_score":0.03652686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09431508,0.0008887785,0.8516678,0.0019835983,0.00012897505,0.0006744719,0.0003203868,0.0008852147,0.049135678],"genre_scores_gemma":[0.66773915,0.0005112397,0.32258943,0.00036882627,0.000024956893,0.00039123342,0.00017121153,0.00019129794,0.008012578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901116,0.00046292538,0.00005864163,0.0001481088,0.00014394952,0.00017523793],"domain_scores_gemma":[0.9971033,0.0019329513,0.0003139016,0.00027104354,0.00016685027,0.00021189247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013931752,0.0010623012,0.0005593152,0.0008779475,0.001166863,0.0020055987,0.001406272,0.0013423791,0.006704019],"category_scores_gemma":[0.006664021,0.00058150134,0.0006911679,0.00052640634,0.002828278,0.0030581497,0.0015813691,0.0013475547,0.00060137117],"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.00031242004,0.00023166217,0.0023525828,0.00038239665,0.00008782772,0.00022452697,0.0014112144,0.48691526,0.0027609244,0.45400143,0.0062862565,0.04503356],"study_design_scores_gemma":[0.00019191476,0.00031701592,0.0011174525,0.00012222507,0.00007609188,0.00021127221,0.0009613532,0.6807537,0.0017647572,0.29719573,0.017205985,0.00008249453],"about_ca_topic_score_codex":0.0065605254,"about_ca_topic_score_gemma":0.015610282,"teacher_disagreement_score":0.006704019,"about_ca_system_score_codex":0.0019060241,"about_ca_system_score_gemma":0.002501128,"threshold_uncertainty_score":0.022427201},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069206335,0.000121877936,0.90206176,0.00020005631,0.00017225977,0.00077014836,0.00055136054,0.01330284,0.013613328],"genre_scores_gemma":[0.43559587,0.00026384895,0.552931,0.00012222,0.000022319133,0.0010454494,0.001182927,0.0006244206,0.008211953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997472,0.00005568443,0.000017053782,0.000046302903,0.00010746187,0.000026262056],"domain_scores_gemma":[0.99955004,0.00016968639,0.000021365142,0.000050243554,0.00015475662,0.00005393504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005515153,0.0005911914,0.00039812387,0.0003952819,0.00043892398,0.00075228786,0.0019078791,0.00079412817,0.0053741788],"category_scores_gemma":[0.0017129944,0.00034888735,0.00051590754,0.00018386064,0.00033654622,0.00065197557,0.0008748765,0.00086204166,0.000988571],"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.0007255124,0.0006686185,0.007678055,0.00063093123,0.00031210895,0.0011476,0.0018554986,0.60023445,0.09171469,0.049251895,0.014555848,0.23122479],"study_design_scores_gemma":[0.000090896945,0.00016974499,0.0005833323,0.0000253668,0.000041860254,0.0001328901,0.00006732205,0.9511287,0.0150877405,0.00309224,0.02954758,0.000032271393],"about_ca_topic_score_codex":0.009804112,"about_ca_topic_score_gemma":0.008449285,"teacher_disagreement_score":0.009804112,"about_ca_system_score_codex":0.00061408937,"about_ca_system_score_gemma":0.0013509279,"threshold_uncertainty_score":0.019494057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055472977,0.0029100887,0.013190055,0.0014871048,0.00044155412,0.000023870462,0.000028891443,0.00005829801,0.9763129],"genre_scores_gemma":[0.26937658,0.0038693664,0.009465856,0.0008553947,0.00031409672,0.0001315738,0.00009109793,0.00021866766,0.7156773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996371,0.00013598004,0.000012065509,0.000051262057,0.0000870664,0.000076510594],"domain_scores_gemma":[0.9998379,0.0000801641,0.000012570918,0.000028349003,0.000016404829,0.000024678897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028192895,0.0010762229,0.0004449524,0.00086694246,0.0023533807,0.0037324508,0.0006392569,0.0011278812,0.029742874],"category_scores_gemma":[0.0013858989,0.00039404654,0.0003900803,0.0010578517,0.005245339,0.0041068057,0.0022141973,0.0026315765,0.003512433],"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.000007861725,0.0000075289095,0.00002811984,0.000021754731,0.0000029496655,0.000011927022,0.00025689587,0.00046614913,0.000040260078,0.976718,0.010284031,0.012154453],"study_design_scores_gemma":[0.000007955308,0.000006494556,0.00009583054,0.00008145522,0.0000033802712,0.00003394759,0.00019105748,0.0011793885,0.00009895591,0.88218695,0.116107784,0.0000068130294],"about_ca_topic_score_codex":0.0042404495,"about_ca_topic_score_gemma":0.008447189,"teacher_disagreement_score":0.029742874,"about_ca_system_score_codex":0.002257293,"about_ca_system_score_gemma":0.0010315984,"threshold_uncertainty_score":0.09949982},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124998316,0.0006973903,0.8641507,0.0012701155,0.00006738,0.00014391326,0.0004800532,0.0012934413,0.006898758],"genre_scores_gemma":[0.7922774,0.0003642915,0.20284963,0.0002774705,0.00003266567,0.0001487238,0.0009495778,0.00011295011,0.002987123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935955,0.00023618621,0.000040515006,0.00023638722,0.0000751082,0.000052292944],"domain_scores_gemma":[0.9953466,0.003469556,0.00046970497,0.00032547567,0.00023079944,0.00015784687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018634576,0.00096821244,0.0007014802,0.0007959609,0.00056373794,0.0021481202,0.0017211237,0.0012071489,0.0034500493],"category_scores_gemma":[0.012545823,0.00073448993,0.0011058731,0.0005004613,0.0008579828,0.0059465324,0.00207548,0.0026601132,0.00085376535],"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.000325944,0.00019699623,0.006126837,0.00018957106,0.000107040774,0.00016475371,0.00065078086,0.8540973,0.0018429382,0.027499974,0.0018406033,0.106957205],"study_design_scores_gemma":[0.000006721348,0.000015567197,0.00018835365,0.000012481651,0.000009539742,0.000016217407,0.000036378675,0.9860255,0.00035604843,0.012938396,0.00038880375,0.00000598614],"about_ca_topic_score_codex":0.011039534,"about_ca_topic_score_gemma":0.017456057,"teacher_disagreement_score":0.011039534,"about_ca_system_score_codex":0.0019113355,"about_ca_system_score_gemma":0.0013567178,"threshold_uncertainty_score":0.021950543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9438037,0.0018129274,0.038578734,0.00032352968,0.00064096367,0.0006982422,0.0028664055,0.0030831508,0.008192361],"genre_scores_gemma":[0.9308495,0.00032870867,0.05690152,0.00012192022,0.00014165319,0.0002894284,0.005556368,0.00023566786,0.0055751926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988844,0.00036365225,0.00008106803,0.00025544988,0.00030371375,0.000111655274],"domain_scores_gemma":[0.9925937,0.0053244266,0.00023149315,0.00080967747,0.000732564,0.00030817237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019250454,0.0010681322,0.0010366939,0.0008864855,0.0005493038,0.0010952485,0.0013251429,0.0010429437,0.009723681],"category_scores_gemma":[0.013549703,0.00026512358,0.00074337405,0.001009914,0.00034051214,0.0023264727,0.0010773245,0.001238861,0.0023503397],"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.023568053,0.010532919,0.025037635,0.0013447837,0.00071729254,0.00034186954,0.00059799803,0.038929515,0.022482494,0.0023217327,0.028799677,0.845326],"study_design_scores_gemma":[0.0024865714,0.0120575,0.04021418,0.0001957801,0.0014299196,0.00058949826,0.0007695872,0.9008081,0.020333676,0.005237102,0.015702762,0.00017534308],"about_ca_topic_score_codex":0.007868476,"about_ca_topic_score_gemma":0.006900403,"teacher_disagreement_score":0.009723681,"about_ca_system_score_codex":0.0005885257,"about_ca_system_score_gemma":0.0009226736,"threshold_uncertainty_score":0.032528996},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4392555,0.00483785,0.17592493,0.018778622,0.0009593182,0.0005398394,0.00012591943,0.00050187006,0.3590761],"genre_scores_gemma":[0.9584688,0.00088442257,0.03026885,0.00037650776,0.000065035376,0.00019799263,0.00004042651,0.00017440725,0.00952354],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.98075414,0.014891502,0.00059539656,0.0007131535,0.0024381115,0.00060762535],"domain_scores_gemma":[0.97544324,0.019852476,0.0013137473,0.0015070939,0.0010086468,0.00087484065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00888673,0.000600333,0.0004192714,0.0012957866,0.005227991,0.016575096,0.0009882824,0.0017161546,0.0034857208],"category_scores_gemma":[0.045718487,0.0005713149,0.0003869208,0.00085316075,0.013398124,0.011196778,0.0065311757,0.003343503,0.0006337515],"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.00023465179,0.00009541762,0.0038882412,0.0005699524,0.000039049075,0.0007338088,0.60336035,0.0019916645,0.0049735135,0.29734227,0.0043179635,0.082453184],"study_design_scores_gemma":[0.00009235844,0.00025877132,0.005253668,0.00153756,0.00009038741,0.0022486506,0.33725038,0.008615965,0.011341552,0.31327406,0.31985545,0.00018120944],"about_ca_topic_score_codex":0.0010722363,"about_ca_topic_score_gemma":0.00269805,"teacher_disagreement_score":0.016575096,"about_ca_system_score_codex":0.0024735054,"about_ca_system_score_gemma":0.0024580797,"threshold_uncertainty_score":0.046998084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031736925,0.00017541784,0.9370211,0.0002078376,0.00008310433,0.000058485137,0.00007160885,0.00054541475,0.030100178],"genre_scores_gemma":[0.83870447,0.00021724169,0.13869254,0.000059636044,0.00003184911,0.000099022,0.0001529984,0.00017010013,0.021872161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00011239089,0.000015400232,0.00006194308,0.000078391706,0.00003300167],"domain_scores_gemma":[0.9992267,0.00040671063,0.000056073924,0.0001388738,0.000105115156,0.00006657198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005784651,0.00071450655,0.0006152235,0.0007031719,0.0006169919,0.0019034568,0.0014667873,0.0011445034,0.011056039],"category_scores_gemma":[0.003058702,0.00044282377,0.00097618985,0.0003984092,0.0013010603,0.0019924385,0.0017065753,0.0010256525,0.0011613341],"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.00016196693,0.00006746046,0.00032610938,0.00011823193,0.000033505596,0.00019945239,0.00038697597,0.360507,0.006847512,0.5893374,0.0013617519,0.040652663],"study_design_scores_gemma":[0.000014390245,0.000024751736,0.000054315526,0.000010718356,0.000007577249,0.00004047404,0.000025410069,0.8961748,0.0010421397,0.100760005,0.0018351206,0.0000102931845],"about_ca_topic_score_codex":0.0017833742,"about_ca_topic_score_gemma":0.0014890728,"teacher_disagreement_score":0.011056039,"about_ca_system_score_codex":0.0005819208,"about_ca_system_score_gemma":0.00042436973,"threshold_uncertainty_score":0.036986113},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008763773,0.0020341396,0.030235866,0.013342776,0.0014061305,0.000111455214,0.0001895116,0.0005351779,0.9433813],"genre_scores_gemma":[0.6036875,0.002761058,0.018808763,0.013697036,0.00069917087,0.00042153924,0.00060059247,0.0010311871,0.35829318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99592316,0.001955829,0.0001479151,0.00043696043,0.0011833868,0.00035270103],"domain_scores_gemma":[0.9975712,0.0006175082,0.00022087125,0.00030349445,0.0006926516,0.0005942425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002161791,0.0010830201,0.0004836229,0.0009018729,0.0036019685,0.008305981,0.001242831,0.0024548324,0.03206946],"category_scores_gemma":[0.007198912,0.00039736537,0.0007804203,0.00046377385,0.0106888255,0.0070483307,0.005379483,0.0049702358,0.012981568],"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.00008105366,0.000055248496,0.0006668904,0.0002553566,0.000028577659,0.00036999295,0.017229334,0.00017481529,0.0012995607,0.9120239,0.043098886,0.024716431],"study_design_scores_gemma":[0.000040282044,0.00010161655,0.0007983726,0.0001940286,0.000022226774,0.001612118,0.005517165,0.0006018799,0.00068344385,0.30011517,0.6902527,0.000060905513],"about_ca_topic_score_codex":0.0011855768,"about_ca_topic_score_gemma":0.0012086551,"teacher_disagreement_score":0.03206946,"about_ca_system_score_codex":0.0027413655,"about_ca_system_score_gemma":0.0016921889,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37155846,0.0041301744,0.43752545,0.014459814,0.001406527,0.0003082863,0.00020120027,0.0007211301,0.16968891],"genre_scores_gemma":[0.9643395,0.00045680345,0.031464376,0.00034579894,0.00015790017,0.00006280584,0.000051359766,0.00010677399,0.0030146572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99331975,0.004432861,0.00028105496,0.00061291055,0.0010997338,0.0002537029],"domain_scores_gemma":[0.963815,0.029115265,0.00156682,0.0023460737,0.0017428373,0.0014139916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048001255,0.0007250112,0.0005729202,0.0011482736,0.0013459072,0.0066026985,0.0012557715,0.0026253175,0.0078035844],"category_scores_gemma":[0.07055691,0.0008807875,0.00043961342,0.00058621087,0.0032809305,0.016271843,0.0039480594,0.0029587382,0.0008609138],"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.0035144894,0.0007029931,0.012553907,0.0012522028,0.00032502474,0.00040263878,0.004567358,0.036831,0.019683803,0.6740492,0.004531432,0.2415859],"study_design_scores_gemma":[0.00027103373,0.00092309486,0.010374988,0.00036462184,0.00036743886,0.0006688041,0.0023610366,0.18231943,0.008860383,0.7703048,0.02303599,0.00014839304],"about_ca_topic_score_codex":0.00082211173,"about_ca_topic_score_gemma":0.0008054275,"teacher_disagreement_score":0.0078035844,"about_ca_system_score_codex":0.0006725986,"about_ca_system_score_gemma":0.00085849315,"threshold_uncertainty_score":0.026105583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21642156,0.00025549356,0.77105933,0.00012368783,0.000029677407,0.00021249343,0.001145142,0.0061141024,0.0046386393],"genre_scores_gemma":[0.77564675,0.00014422878,0.22119425,0.000033049935,0.000009853324,0.00025967692,0.0012774873,0.00028458826,0.0011500341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996506,0.00007792498,0.000019972482,0.00007533188,0.00013118333,0.000044893026],"domain_scores_gemma":[0.99703825,0.0020068372,0.0003379904,0.00018407687,0.00029781705,0.0001350269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090612745,0.0010154262,0.00060427433,0.0027459762,0.00039933377,0.0007301042,0.0007069683,0.00074792287,0.0023610091],"category_scores_gemma":[0.0071015777,0.0005019655,0.00067545683,0.0010980739,0.00048162194,0.0012695785,0.001365392,0.0007458172,0.00069531624],"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.00082202296,0.00039227592,0.102901004,0.00033345915,0.00020474476,0.0004896337,0.0010882653,0.5977486,0.021374302,0.008718523,0.0045094052,0.2614178],"study_design_scores_gemma":[0.000009237498,0.00009136049,0.0055614654,0.000016204493,0.000014243223,0.00012227694,0.00006274606,0.9888455,0.0018367359,0.00264896,0.000770285,0.000020984935],"about_ca_topic_score_codex":0.0031699452,"about_ca_topic_score_gemma":0.004027871,"teacher_disagreement_score":0.0031699452,"about_ca_system_score_codex":0.00032704693,"about_ca_system_score_gemma":0.0006288994,"threshold_uncertainty_score":0.007898331},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47355852,0.0018126388,0.18399607,0.003713879,0.0010551785,0.00031644534,0.0009975962,0.00038737507,0.33416227],"genre_scores_gemma":[0.92509544,0.0014312267,0.02313737,0.00031184856,0.00044352768,0.0004193661,0.0007161045,0.00030396762,0.04814122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.0003383658,0.000047498543,0.00022522616,0.00029000035,0.00028493092],"domain_scores_gemma":[0.9953608,0.0027287516,0.00043090872,0.00027722967,0.00028922549,0.0009129384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010042436,0.0014191355,0.0022209478,0.0018978943,0.0021876665,0.006091317,0.0032752142,0.0026026927,0.014900274],"category_scores_gemma":[0.0076606674,0.0008161515,0.0011894442,0.0019352159,0.0040694247,0.00687959,0.0021477481,0.0041200495,0.0015651657],"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.00023053406,0.00007510171,0.00032806737,0.00014538103,0.000027300972,0.000085071035,0.00021741659,0.01456586,0.0012755016,0.9651569,0.0061733634,0.011719578],"study_design_scores_gemma":[0.00004110767,0.000046232082,0.0003159284,0.000043647895,0.000020637517,0.00008289411,0.00008936199,0.03947881,0.0005374923,0.95652986,0.0027862233,0.00002794331],"about_ca_topic_score_codex":0.0016481251,"about_ca_topic_score_gemma":0.0013807182,"teacher_disagreement_score":0.014900274,"about_ca_system_score_codex":0.0023710693,"about_ca_system_score_gemma":0.001780415,"threshold_uncertainty_score":0.04984635},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032031316,0.00039879247,0.9563329,0.00042039854,0.00005644602,0.0003033017,0.00014304022,0.0006062087,0.009707488],"genre_scores_gemma":[0.31069615,0.00034631306,0.6796839,0.00028830953,0.000096707256,0.0005209649,0.00043287175,0.00042512032,0.0075097084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910283,0.00040585978,0.000041267813,0.00016083961,0.00017948705,0.00010980763],"domain_scores_gemma":[0.9961449,0.0031955934,0.00021593216,0.000096721065,0.0002572706,0.00008964708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022504625,0.0018448066,0.0020391683,0.0013405598,0.0005963578,0.0017163432,0.0012345063,0.0018052422,0.005596842],"category_scores_gemma":[0.0070832362,0.0011029977,0.0013054967,0.0010658401,0.0010258656,0.0016889371,0.0014798597,0.0020036765,0.0008862342],"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.00008239909,0.00015414951,0.00071740174,0.00016723755,0.000047942933,0.000042071573,0.00007548153,0.91871494,0.0010538106,0.010365836,0.0025033369,0.0660754],"study_design_scores_gemma":[0.000016058853,0.000030482255,0.00009254849,0.000011115879,0.0000049138707,0.000007502324,0.000010164661,0.99648064,0.00025338816,0.0027873376,0.00030195052,0.0000039507786],"about_ca_topic_score_codex":0.013893146,"about_ca_topic_score_gemma":0.013790792,"teacher_disagreement_score":0.013893146,"about_ca_system_score_codex":0.0016632314,"about_ca_system_score_gemma":0.0031428135,"threshold_uncertainty_score":0.027624607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004541024,0.0008334263,0.9707227,0.0008129264,0.00030357405,0.00034720913,0.00032994463,0.009265513,0.01284364],"genre_scores_gemma":[0.07973493,0.00074453856,0.9060145,0.0006168999,0.00021039684,0.0005547965,0.0005151885,0.0012664014,0.010342362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975846,0.0006870075,0.00020950078,0.00040476795,0.0007941336,0.00031998014],"domain_scores_gemma":[0.992184,0.0056734364,0.00034167655,0.0009183016,0.00072382647,0.00015875872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003898789,0.0016678737,0.0017360392,0.003909977,0.0012479668,0.0024702942,0.0027217774,0.0017535457,0.024038361],"category_scores_gemma":[0.01833704,0.00083069154,0.0018576204,0.0034383486,0.002104335,0.003614897,0.0034988932,0.002289125,0.007867255],"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.00078452873,0.00024513042,0.00072955666,0.001445145,0.00014464294,0.0005154859,0.0003025046,0.038607724,0.006769,0.200953,0.041248996,0.70825434],"study_design_scores_gemma":[0.00037036455,0.00035494112,0.00037116508,0.00024103253,0.00013186727,0.0007189234,0.000098094075,0.31558496,0.0106317615,0.61447275,0.056883942,0.00014014244],"about_ca_topic_score_codex":0.003752767,"about_ca_topic_score_gemma":0.0042912327,"teacher_disagreement_score":0.024038361,"about_ca_system_score_codex":0.0012445623,"about_ca_system_score_gemma":0.0031257817,"threshold_uncertainty_score":0.08041638},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018830566,0.00055010617,0.96512824,0.00029037005,0.00012065114,0.00029455987,0.0015897028,0.0040325597,0.0091633275],"genre_scores_gemma":[0.17408131,0.00044288492,0.8162345,0.0003084493,0.00005761308,0.00059136533,0.002542103,0.000775825,0.0049658124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979225,0.00065726903,0.00023492375,0.00023842943,0.0007682121,0.0001785972],"domain_scores_gemma":[0.99198544,0.0045661703,0.0005489855,0.0016335781,0.0009917687,0.0002740459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021988614,0.000978709,0.0009175136,0.0021780957,0.001039219,0.0027778125,0.0023305204,0.00097613916,0.010587888],"category_scores_gemma":[0.014755736,0.00064754824,0.0008366386,0.0023991503,0.00086853816,0.0048957323,0.0016202774,0.0020986123,0.0027631603],"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.00056457554,0.00031826698,0.002071173,0.0005443281,0.00008564533,0.0002765008,0.0004935693,0.116156295,0.0066490495,0.33625436,0.029882655,0.5067036],"study_design_scores_gemma":[0.00013909175,0.00018382537,0.0005276425,0.00018424113,0.000071154485,0.00025762693,0.00012494088,0.5120767,0.010588955,0.43567958,0.04008982,0.00007656363],"about_ca_topic_score_codex":0.001608373,"about_ca_topic_score_gemma":0.004213789,"teacher_disagreement_score":0.010587888,"about_ca_system_score_codex":0.0013796824,"about_ca_system_score_gemma":0.0020695028,"threshold_uncertainty_score":0.03542006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82880205,0.0068022637,0.11644106,0.0015611849,0.0007016049,0.00044687488,0.0037940468,0.004237998,0.03721296],"genre_scores_gemma":[0.96559614,0.00077463716,0.026784088,0.00018961064,0.000047437483,0.00011974491,0.0006905355,0.00021828254,0.0055794385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910516,0.00018080432,0.00008411302,0.00024730206,0.0002367527,0.00014590837],"domain_scores_gemma":[0.9977635,0.0007639312,0.0004597897,0.0003422708,0.00051422964,0.0001562536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013501182,0.0008595458,0.0002999982,0.0016678974,0.0003959883,0.0017328737,0.0011646854,0.0011929077,0.0107259],"category_scores_gemma":[0.0069321515,0.00039855752,0.0003353025,0.0005890527,0.00060650735,0.0015942248,0.00091198174,0.00066383585,0.0031599547],"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.0029277361,0.00049175404,0.37465048,0.0012597382,0.00021732795,0.012984871,0.0015462517,0.011044684,0.081469856,0.0035403895,0.012153096,0.4977138],"study_design_scores_gemma":[0.00025068308,0.0016986356,0.6162213,0.002183591,0.0005052669,0.10467455,0.0033127537,0.114079736,0.09364118,0.013113002,0.049920045,0.0003991958],"about_ca_topic_score_codex":0.0067254733,"about_ca_topic_score_gemma":0.006784169,"teacher_disagreement_score":0.0107259,"about_ca_system_score_codex":0.0008713744,"about_ca_system_score_gemma":0.0010810462,"threshold_uncertainty_score":0.03588164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4073458,0.000327923,0.5764654,0.00032354528,0.000028388813,0.0001222335,0.000105102794,0.00019749181,0.0150841],"genre_scores_gemma":[0.9542052,0.00012545839,0.04168647,0.000047602876,0.000012249086,0.000066887726,0.00005556908,0.00007848912,0.0037220516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938667,0.00013654002,0.000026049951,0.000083726896,0.0001585766,0.00020841481],"domain_scores_gemma":[0.9967885,0.0019327069,0.0005061102,0.00021979478,0.0001979271,0.00035497258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010536396,0.00084771035,0.0006960655,0.0009265896,0.0007098192,0.0018908944,0.0015345496,0.0014032037,0.0049405326],"category_scores_gemma":[0.0051192003,0.00062577415,0.0008977357,0.00041281682,0.0019589458,0.0022459454,0.00202614,0.0010085414,0.00046067152],"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.00020094172,0.00013071974,0.0035915512,0.00013683108,0.00004843351,0.00027113102,0.0004740922,0.88042516,0.0063156593,0.08998321,0.0006900811,0.017732294],"study_design_scores_gemma":[0.0000068584645,0.000075929565,0.0005669836,0.000011771495,0.000014654432,0.000051240386,0.0000888141,0.9874604,0.000430365,0.010943173,0.00033667253,0.00001320178],"about_ca_topic_score_codex":0.0052474416,"about_ca_topic_score_gemma":0.0030812158,"teacher_disagreement_score":0.0052474416,"about_ca_system_score_codex":0.0015591929,"about_ca_system_score_gemma":0.0008375029,"threshold_uncertainty_score":0.016527772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6234523,0.00028971813,0.3682691,0.00024454316,0.000030097759,0.000085779226,0.00008802051,0.00024417357,0.0072962423],"genre_scores_gemma":[0.9717401,0.0000712002,0.026235804,0.00003706058,0.0000072305193,0.0000571105,0.00005178206,0.000049464343,0.0017502441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955946,0.00012833848,0.000020867988,0.00008242972,0.00010473923,0.000104130086],"domain_scores_gemma":[0.9985429,0.0009247895,0.00022676897,0.00011705361,0.00007943497,0.00010905291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061200635,0.00085344573,0.0005568303,0.0006177424,0.0003981144,0.0010341716,0.00082836126,0.00091648445,0.0015492123],"category_scores_gemma":[0.0044327467,0.0004715383,0.0006449512,0.00021732964,0.0013654962,0.0013607556,0.0014421449,0.0009605968,0.00011674198],"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.00012752133,0.00008635637,0.0040754965,0.00006113757,0.0000434064,0.00019595318,0.00020167444,0.9422368,0.0038085724,0.039985288,0.00034204544,0.0088357935],"study_design_scores_gemma":[0.000013416184,0.000038092956,0.0005109741,0.000008570437,0.0000072905596,0.000029191928,0.000055802546,0.98198223,0.000548394,0.01644004,0.00035918242,0.0000068083605],"about_ca_topic_score_codex":0.00395247,"about_ca_topic_score_gemma":0.004029534,"teacher_disagreement_score":0.00395247,"about_ca_system_score_codex":0.00095118256,"about_ca_system_score_gemma":0.000663171,"threshold_uncertainty_score":0.007858932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84502184,0.00031432224,0.14598714,0.0002086958,0.000032225846,0.00022709694,0.000050436658,0.0015979811,0.0065602195],"genre_scores_gemma":[0.9577425,0.00009255327,0.04096642,0.000038658036,0.00000807674,0.000058804242,0.000048352234,0.000049149094,0.0009954458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923253,0.0003822884,0.0000405097,0.00012366107,0.00016764454,0.000053429583],"domain_scores_gemma":[0.9980034,0.0013050953,0.00024430908,0.00010865732,0.00010991046,0.00022855592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750148,0.0006397478,0.00028996673,0.00022424718,0.0003050757,0.001669421,0.0012427736,0.00066832453,0.001391684],"category_scores_gemma":[0.00547108,0.0003767483,0.00017483,0.00012043699,0.00091290596,0.0013598753,0.0013201784,0.00076284795,0.00033344753],"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.004454807,0.003464854,0.031289075,0.0009649607,0.00025263266,0.0011864018,0.009325099,0.43166566,0.15290445,0.014587887,0.0030556808,0.34684846],"study_design_scores_gemma":[0.00021775297,0.0032232867,0.012946918,0.00007194522,0.00016508916,0.00040238764,0.0010450159,0.9187503,0.049631532,0.0072206357,0.0062202425,0.00010492815],"about_ca_topic_score_codex":0.00083511573,"about_ca_topic_score_gemma":0.00091719115,"teacher_disagreement_score":0.001669421,"about_ca_system_score_codex":0.0004204682,"about_ca_system_score_gemma":0.00028142275,"threshold_uncertainty_score":0.006214142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013065341,0.00014093111,0.97838897,0.00013604508,0.000035018893,0.00016489469,0.00006907577,0.0039981445,0.0040016863],"genre_scores_gemma":[0.25754297,0.00019048258,0.7338096,0.00022181348,0.000027757202,0.0004093286,0.00034292915,0.00049409637,0.006961065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991197,0.00019175897,0.00007151671,0.00021242084,0.00031857958,0.00008609483],"domain_scores_gemma":[0.99926275,0.00024835177,0.00006299037,0.00018089458,0.00014716714,0.000097830656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014559383,0.00083396945,0.00078795984,0.0007744122,0.0005178664,0.0014714748,0.0030484363,0.0008897968,0.0062246835],"category_scores_gemma":[0.0040853955,0.0005104009,0.0009269022,0.0005857925,0.0007699277,0.0022027558,0.0030198568,0.0017101852,0.001806982],"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.00047242708,0.00035822048,0.002966982,0.00027943743,0.00017078638,0.00020778428,0.00047328143,0.28470108,0.02406137,0.035679907,0.00917539,0.6414534],"study_design_scores_gemma":[0.00004992841,0.00013085316,0.00024797276,0.000013150326,0.00001982654,0.000076118886,0.000038376147,0.9822918,0.004375315,0.008109612,0.004633952,0.000013129724],"about_ca_topic_score_codex":0.006250739,"about_ca_topic_score_gemma":0.007481236,"teacher_disagreement_score":0.006250739,"about_ca_system_score_codex":0.0010159285,"about_ca_system_score_gemma":0.0018797545,"threshold_uncertainty_score":0.020823658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32062793,0.00031302017,0.6695872,0.00055951165,0.000058139343,0.000104904124,0.00016117723,0.00074128585,0.007846822],"genre_scores_gemma":[0.9643475,0.00014259457,0.030913623,0.00013405975,0.00002193168,0.000082556144,0.00015058303,0.000055675406,0.0041515455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996879,0.000070228634,0.000020754396,0.0000677438,0.000094872106,0.000058587073],"domain_scores_gemma":[0.99731416,0.0018116499,0.0004006172,0.00010535774,0.00024342867,0.00012470693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011249562,0.0005148967,0.0009975481,0.00085866573,0.0006450059,0.0010468429,0.001457197,0.0009069869,0.0021500108],"category_scores_gemma":[0.0062821633,0.0006708519,0.00050751225,0.0003713267,0.0009926264,0.0015087884,0.00081776996,0.0012209662,0.0005267617],"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.00006261188,0.00003135074,0.0044944705,0.000022311584,0.000008731511,0.00008949632,0.00005480534,0.9773801,0.00048477825,0.0038419368,0.00039315005,0.013136152],"study_design_scores_gemma":[0.0000026241892,0.000008557021,0.00017556905,0.00000267411,0.0000011033818,0.00000582304,0.0000034232016,0.9988086,0.000091258175,0.0008303789,0.0000671208,0.0000028362888],"about_ca_topic_score_codex":0.016207805,"about_ca_topic_score_gemma":0.013950613,"teacher_disagreement_score":0.016207805,"about_ca_system_score_codex":0.0010524227,"about_ca_system_score_gemma":0.00094611786,"threshold_uncertainty_score":0.03222692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07653547,0.0003868991,0.9091507,0.0002381319,0.00005460001,0.00020037942,0.000079272715,0.00585881,0.007495855],"genre_scores_gemma":[0.76024806,0.00020926876,0.23500319,0.00021154784,0.000017826425,0.00020206625,0.00013092207,0.00043232995,0.0035448233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996111,0.00013752491,0.00002108504,0.00006493188,0.00011366421,0.000051672076],"domain_scores_gemma":[0.999113,0.00049939373,0.0000902069,0.00013670861,0.00007319725,0.00008745254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077453174,0.0006285458,0.00044830234,0.0003339209,0.00028437152,0.0005779793,0.0012280172,0.0008064144,0.0031464712],"category_scores_gemma":[0.0035444433,0.00027013125,0.00034715614,0.00022489189,0.000973888,0.0012494453,0.0012487682,0.0009175132,0.0005967515],"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.00032404755,0.00034090984,0.0030883744,0.00020530957,0.00006683223,0.0003539925,0.00042596506,0.7639509,0.026343236,0.035744686,0.003955246,0.16520044],"study_design_scores_gemma":[0.000018870902,0.00007142256,0.00016505591,0.000010744443,0.0000061942105,0.000056328707,0.000016117972,0.9876282,0.0027270624,0.0074559674,0.001836388,0.000007658259],"about_ca_topic_score_codex":0.0022965567,"about_ca_topic_score_gemma":0.0024871246,"teacher_disagreement_score":0.0031464712,"about_ca_system_score_codex":0.0004908031,"about_ca_system_score_gemma":0.00072545704,"threshold_uncertainty_score":0.010526001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029036943,0.00070209365,0.9619405,0.00029025515,0.00007193622,0.00025712533,0.000055651915,0.0022987637,0.0053468533],"genre_scores_gemma":[0.34460878,0.00024286527,0.6512476,0.00022852252,0.000057416997,0.00056023884,0.0002079632,0.00059623097,0.0022503636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99322754,0.004170327,0.0003076398,0.000724876,0.001127661,0.00044197228],"domain_scores_gemma":[0.9876073,0.00825423,0.0005511268,0.0020590716,0.0012370327,0.00029128493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063122287,0.0012483204,0.0015861515,0.0018018339,0.0009447878,0.0021464936,0.0024710358,0.0017693496,0.004509401],"category_scores_gemma":[0.022230675,0.0007210929,0.0008960108,0.0013981909,0.0014801677,0.0028322577,0.0018978646,0.0016395716,0.0016247273],"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.0010775898,0.0005591076,0.0037122592,0.00052551954,0.00015236643,0.00025680749,0.00045444223,0.3927693,0.010100091,0.047172166,0.0067464826,0.53647393],"study_design_scores_gemma":[0.00017558894,0.00022503639,0.0003923606,0.00003673054,0.0000455873,0.0001624623,0.000088741595,0.96322966,0.0063446625,0.024383416,0.0048824204,0.000033327706],"about_ca_topic_score_codex":0.0017085042,"about_ca_topic_score_gemma":0.0025167381,"teacher_disagreement_score":0.0063122287,"about_ca_system_score_codex":0.0011106838,"about_ca_system_score_gemma":0.0025390682,"threshold_uncertainty_score":0.033382714},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009323886,0.0031748756,0.015002345,0.039485767,0.057752047,0.0029256917,0.010703215,0.002767544,0.8588646],"genre_scores_gemma":[0.027852552,0.0015351876,0.008062489,0.005734556,0.0048568277,0.0020051377,0.011948108,0.0008466351,0.9371585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977673,0.00045000282,0.000065036744,0.00031428985,0.0009881428,0.0004152042],"domain_scores_gemma":[0.9932653,0.00033298353,0.00014577332,0.00028022195,0.001959905,0.004015863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067653153,0.0010430113,0.0006782228,0.0014062398,0.0018541497,0.005701024,0.001881371,0.0018287792,0.21920337],"category_scores_gemma":[0.004641403,0.0004100986,0.00082654465,0.00057643757,0.0004836289,0.0019072127,0.0055798357,0.002462194,0.13084345],"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.0002646869,0.00030385802,0.00026459934,0.000096100324,0.000008348691,0.00006735533,0.00009626166,0.0002424874,0.0007286971,0.0057844617,0.95660794,0.035535276],"study_design_scores_gemma":[0.000039863535,0.00007466078,0.00055208505,0.00006206028,0.0000038055778,0.00002902973,0.00012612971,0.00030528268,0.0005055143,0.0016123139,0.9966785,0.00001067829],"about_ca_topic_score_codex":0.002046764,"about_ca_topic_score_gemma":0.0067260372,"teacher_disagreement_score":0.21920337,"about_ca_system_score_codex":0.0025883582,"about_ca_system_score_gemma":0.0058773984,"threshold_uncertainty_score":0.7333083},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041703705,0.035855554,0.023322575,0.09127043,0.24563116,0.003073237,0.027336698,0.0027832247,0.52902335],"genre_scores_gemma":[0.04664149,0.021475809,0.012032275,0.0073555293,0.02010192,0.001281031,0.030974494,0.0011941525,0.85894334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969488,0.0004734546,0.00015026725,0.0003543256,0.001693801,0.00037941642],"domain_scores_gemma":[0.9886791,0.0012078111,0.00032590533,0.0005177183,0.005637577,0.0036318696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006736804,0.0012942798,0.00075441395,0.0037839722,0.0028623503,0.005874529,0.0014389992,0.0015391601,0.06120409],"category_scores_gemma":[0.009195175,0.0004622042,0.00081860455,0.0026942883,0.00056393543,0.0044047902,0.004060371,0.003550477,0.023811953],"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.00009353879,0.0002278804,0.000603145,0.00016218674,0.000013620207,0.000105000225,0.0003994821,0.0001204881,0.00067458494,0.0013406693,0.94594586,0.050313585],"study_design_scores_gemma":[0.00002452369,0.00007787394,0.0033884002,0.00018390823,0.000026358852,0.00008872804,0.0013125046,0.0005764597,0.0012093902,0.0012673117,0.99180037,0.00004418346],"about_ca_topic_score_codex":0.006052015,"about_ca_topic_score_gemma":0.02082019,"teacher_disagreement_score":0.06120409,"about_ca_system_score_codex":0.001820637,"about_ca_system_score_gemma":0.002777621,"threshold_uncertainty_score":0.2047481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008215317,0.043870695,0.946415,0.0010519952,0.00049315434,0.00007678882,0.0002363632,0.0004432558,0.006591326],"genre_scores_gemma":[0.037050657,0.11363285,0.83015364,0.0012959501,0.0018020469,0.0007629357,0.0011246612,0.0006494376,0.01352775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991749,0.00031159556,0.00009973183,0.00013256748,0.00023061888,0.00005068209],"domain_scores_gemma":[0.99824774,0.0013913101,0.000075419906,0.00009581924,0.00012459449,0.00006505665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022209266,0.0023221425,0.0021824816,0.0022614864,0.00056509144,0.0028556513,0.0025009804,0.0022982662,0.0067388588],"category_scores_gemma":[0.0037769615,0.0018045538,0.0035079361,0.0049143913,0.0015177181,0.0052079796,0.0014378267,0.0063066804,0.003289382],"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.00003747619,0.00017161868,0.0005681992,0.001468436,0.00020946145,0.00022284935,0.0006037033,0.06565244,0.0012394538,0.6421724,0.027682867,0.25997117],"study_design_scores_gemma":[0.000024377892,0.000060003847,0.0003980557,0.00062262,0.00008735723,0.00032111348,0.00007553853,0.15163666,0.00041733193,0.71753335,0.12876485,0.000058733156],"about_ca_topic_score_codex":0.003869742,"about_ca_topic_score_gemma":0.0043167677,"teacher_disagreement_score":0.0067388588,"about_ca_system_score_codex":0.0015669522,"about_ca_system_score_gemma":0.0010315203,"threshold_uncertainty_score":0.022543788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02554719,0.004302229,0.6179214,0.14536995,0.0011225792,0.00015846099,0.00032476272,0.0004958964,0.20475756],"genre_scores_gemma":[0.8073207,0.0021021669,0.16177852,0.008467173,0.0016840878,0.0006564005,0.00024068121,0.00067269563,0.017077569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98948926,0.006846386,0.00035030954,0.001305572,0.0013904826,0.00061792956],"domain_scores_gemma":[0.9855643,0.010299189,0.00047230057,0.0018608816,0.00084139494,0.0009619126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01531936,0.0008853513,0.0017699264,0.0015467877,0.006049704,0.012342696,0.003927285,0.0045856917,0.011687957],"category_scores_gemma":[0.026864942,0.0007678077,0.0017943119,0.0015599434,0.023178304,0.029035112,0.008126576,0.008915685,0.001102524],"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.0000069864805,0.0000033828258,0.000030192348,0.000013854462,0.0000028106892,0.0000121644935,0.00031621236,0.0002564138,0.000024579562,0.9964328,0.0010265285,0.0018741619],"study_design_scores_gemma":[0.000007545456,0.000005408141,0.000023965898,0.0000133704525,0.0000020905352,0.000016169379,0.0002024451,0.0015638897,0.000023475923,0.9872591,0.010877936,0.000004752741],"about_ca_topic_score_codex":0.0032931077,"about_ca_topic_score_gemma":0.0027570205,"teacher_disagreement_score":0.01531936,"about_ca_system_score_codex":0.0043012905,"about_ca_system_score_gemma":0.0036731563,"threshold_uncertainty_score":0.081017494},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07834611,0.015594961,0.21797523,0.010882763,0.00281368,0.00008209156,0.002460397,0.0005927694,0.6712521],"genre_scores_gemma":[0.75671893,0.007886416,0.040914495,0.0019232073,0.0013827858,0.00012526567,0.0020657633,0.0003438014,0.18863927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935406,0.00017805454,0.00003420092,0.00010310099,0.00021433915,0.00011632909],"domain_scores_gemma":[0.999278,0.00030165678,0.00004791744,0.00012158166,0.00020415985,0.000046701312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008096205,0.0006289686,0.0007300778,0.0006771078,0.0009982317,0.0016212796,0.00063574116,0.0007307192,0.019128758],"category_scores_gemma":[0.002820241,0.00027143577,0.0006862097,0.00095947855,0.0013536466,0.0025164078,0.0016695927,0.0033035022,0.0038574832],"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.000018124862,0.000013691504,0.00022414014,0.00008844837,0.000011563638,0.0000632437,0.00020340418,0.0018830857,0.00027219264,0.9675139,0.014470982,0.015237146],"study_design_scores_gemma":[0.00001571735,0.000015092843,0.0002542142,0.000036377514,0.00000663429,0.00008688505,0.00005926164,0.012026187,0.00027648296,0.95477647,0.032436106,0.0000105511635],"about_ca_topic_score_codex":0.0024463942,"about_ca_topic_score_gemma":0.0018800497,"teacher_disagreement_score":0.019128758,"about_ca_system_score_codex":0.0019354378,"about_ca_system_score_gemma":0.00096224784,"threshold_uncertainty_score":0.06399208},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066526555,0.003220007,0.8570561,0.0036269238,0.00022453335,0.00055960077,0.0019722495,0.00144838,0.06536568],"genre_scores_gemma":[0.5953389,0.0051629036,0.3573407,0.001563235,0.00035788864,0.00091896264,0.003416745,0.00091657933,0.034984104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963198,0.001361577,0.0001828919,0.0008659457,0.00077833096,0.00049153785],"domain_scores_gemma":[0.96833926,0.022928195,0.00316743,0.0026076515,0.0014600548,0.0014974141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037225415,0.001984331,0.0016415329,0.0019966243,0.0017778584,0.0035052234,0.0029008149,0.0025272775,0.015160679],"category_scores_gemma":[0.024657646,0.0014027,0.0017230412,0.0031654448,0.0028281221,0.013739614,0.0036459577,0.0033440161,0.0026508737],"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.00041620206,0.00022209788,0.002534029,0.00083993655,0.00013647632,0.0005159089,0.00067049655,0.16079599,0.002199763,0.74840796,0.01503385,0.06822726],"study_design_scores_gemma":[0.000071328024,0.00020067896,0.0004766555,0.00012627993,0.00009140689,0.00069802714,0.00017765137,0.2330483,0.0013747186,0.73762274,0.026076455,0.000035837296],"about_ca_topic_score_codex":0.0037781638,"about_ca_topic_score_gemma":0.005717408,"teacher_disagreement_score":0.015160679,"about_ca_system_score_codex":0.0023215339,"about_ca_system_score_gemma":0.0018881721,"threshold_uncertainty_score":0.050717533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109178506,0.0004600426,0.87926286,0.00046067784,0.000055510805,0.0001362686,0.00021146756,0.0012426546,0.008991979],"genre_scores_gemma":[0.77845055,0.00021140728,0.21671137,0.00017430451,0.000016674872,0.00015450419,0.00026210927,0.000114592636,0.003904471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996258,0.000077969285,0.000026872403,0.00010352002,0.000085361804,0.00008048097],"domain_scores_gemma":[0.9990933,0.0005722503,0.00009594468,0.00008882983,0.000087794506,0.00006184465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070619356,0.00080406794,0.0008816557,0.0006873898,0.00039874416,0.0008487166,0.0011769375,0.00087165757,0.0043069758],"category_scores_gemma":[0.0039894693,0.00042757762,0.00060708425,0.00048117136,0.00095543324,0.00203856,0.0011057494,0.0011198198,0.00038724145],"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.00028068517,0.0001058285,0.0021879242,0.00019382373,0.000047388377,0.00012946485,0.00011782133,0.75228673,0.0042524063,0.057405215,0.0022497876,0.18074282],"study_design_scores_gemma":[0.00001210296,0.000028441185,0.00012034908,0.000010185544,0.0000048142206,0.000016718228,0.000008849895,0.9801199,0.00078792503,0.018471686,0.00041377224,0.0000052736987],"about_ca_topic_score_codex":0.009157443,"about_ca_topic_score_gemma":0.014991247,"teacher_disagreement_score":0.009157443,"about_ca_system_score_codex":0.0018874122,"about_ca_system_score_gemma":0.0019349986,"threshold_uncertainty_score":0.018208265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032630697,0.0005163667,0.959867,0.00027355642,0.0001078628,0.00015232999,0.00016049056,0.003864478,0.002427178],"genre_scores_gemma":[0.50897914,0.00045957044,0.48160815,0.00024643823,0.0001346263,0.00023409374,0.000620542,0.00043536242,0.007282116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669844,0.0007387366,0.0002149065,0.00087077654,0.0011664679,0.00031064192],"domain_scores_gemma":[0.99136,0.004402717,0.00042202498,0.0015038082,0.0018185274,0.00049289473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002336546,0.0015237319,0.0019249355,0.0022841806,0.0013142326,0.0035696202,0.002879676,0.0022999276,0.0054116924],"category_scores_gemma":[0.01010511,0.00084823754,0.0012461287,0.0010082787,0.001078226,0.0038243658,0.0021548786,0.0025087008,0.0020836142],"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.0023681428,0.0010931094,0.008093979,0.0007235626,0.0003918562,0.0011336346,0.001083823,0.18012692,0.05697484,0.038600888,0.0069514527,0.7024578],"study_design_scores_gemma":[0.00009001336,0.00027209095,0.0012310516,0.0001162968,0.000118992495,0.00045291893,0.00026755984,0.939013,0.024714416,0.02598723,0.0076670805,0.00006926541],"about_ca_topic_score_codex":0.0055075684,"about_ca_topic_score_gemma":0.007163938,"teacher_disagreement_score":0.0055075684,"about_ca_system_score_codex":0.00086800545,"about_ca_system_score_gemma":0.0025137188,"threshold_uncertainty_score":0.018103898},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011800723,0.0037237557,0.018845381,0.0133946575,0.0018340123,0.000046477373,0.000059061655,0.00022495049,0.950071],"genre_scores_gemma":[0.19587693,0.0042433254,0.015134821,0.0045421156,0.000616505,0.00018945073,0.00023228487,0.00017864964,0.77898586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994709,0.00019133835,0.000011345155,0.000090731686,0.00014863098,0.0000871585],"domain_scores_gemma":[0.99909604,0.00017644839,0.00005427433,0.00010293213,0.00012934934,0.00044091046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083802815,0.00071523077,0.00030565416,0.0004639434,0.0020947792,0.0032597077,0.00077803934,0.0010000112,0.03987443],"category_scores_gemma":[0.002121844,0.00020363383,0.00041002943,0.00026558532,0.0031564059,0.00467711,0.003320952,0.0035810033,0.0106904395],"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.00004376636,0.00027959587,0.0011632775,0.0001753662,0.000019100915,0.00013360573,0.008957215,0.0003500449,0.0010025239,0.500086,0.20610873,0.28168073],"study_design_scores_gemma":[0.000011481965,0.0000771369,0.00096160016,0.00029844005,0.000007985649,0.0002713694,0.003181764,0.00032699844,0.0005138247,0.27131045,0.72302175,0.000017222259],"about_ca_topic_score_codex":0.00038893684,"about_ca_topic_score_gemma":0.0015091765,"teacher_disagreement_score":0.03987443,"about_ca_system_score_codex":0.000688888,"about_ca_system_score_gemma":0.0008972723,"threshold_uncertainty_score":0.13339329},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024307168,0.03187619,0.24911669,0.1949214,0.29771006,0.0013456685,0.0005180576,0.0024665194,0.2196147],"genre_scores_gemma":[0.08854182,0.04109821,0.3258148,0.10755502,0.06695661,0.004143768,0.0010006321,0.0026494255,0.36223963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99217564,0.0037551702,0.0010717979,0.0005613335,0.0021541156,0.00028187677],"domain_scores_gemma":[0.9808071,0.013834721,0.00059062877,0.0004518459,0.0031670243,0.00114858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009983481,0.001953112,0.00043351145,0.0024366109,0.0027210396,0.0054112487,0.0023516358,0.0061144386,0.007812736],"category_scores_gemma":[0.032557454,0.0005752381,0.00094045093,0.00068622635,0.0063965674,0.004535815,0.0024060544,0.010914108,0.0050412915],"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.00006241293,0.00006216889,0.00015481048,0.0010507146,0.000024816349,0.00035670455,0.0017356918,0.0010689774,0.0005313291,0.25238416,0.6698141,0.072754085],"study_design_scores_gemma":[0.000019651037,0.000022995368,0.00008280832,0.00046647253,0.0000099953695,0.00013549301,0.0002171475,0.0007206848,0.00020705645,0.022511471,0.97558016,0.000026153264],"about_ca_topic_score_codex":0.002523034,"about_ca_topic_score_gemma":0.008172265,"teacher_disagreement_score":0.009983481,"about_ca_system_score_codex":0.0030166055,"about_ca_system_score_gemma":0.0022188956,"threshold_uncertainty_score":0.05279833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20147748,0.00033560387,0.789135,0.0001219344,0.000037615268,0.00009677639,0.000112865135,0.0012545403,0.007428207],"genre_scores_gemma":[0.899184,0.00011627173,0.09791679,0.000030055931,0.0000059449567,0.00009252018,0.000087099696,0.00009354884,0.0024739068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995634,0.00015314734,0.000018118168,0.000068402886,0.00011446624,0.00008244419],"domain_scores_gemma":[0.99912244,0.0005561843,0.000058068243,0.000083964595,0.00006155255,0.000117662064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048564374,0.00065212935,0.00070773374,0.00045558138,0.0005961228,0.0010159023,0.00097362767,0.00050476566,0.0024452214],"category_scores_gemma":[0.0017648805,0.0004709135,0.0004248741,0.00037617,0.0008748048,0.0015640693,0.0023190558,0.0004902084,0.0002960889],"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.00039589673,0.0000917529,0.0017190536,0.00010542844,0.00005173258,0.00024638278,0.0003316202,0.92555666,0.00899218,0.015801556,0.00070300105,0.046004787],"study_design_scores_gemma":[0.000014521693,0.000055478136,0.0002667495,0.0000057847597,0.0000068026766,0.000053677744,0.000059226608,0.9896606,0.0016697918,0.0073013506,0.00089452806,0.000011419107],"about_ca_topic_score_codex":0.00485205,"about_ca_topic_score_gemma":0.0060686683,"teacher_disagreement_score":0.00485205,"about_ca_system_score_codex":0.00048209066,"about_ca_system_score_gemma":0.000555665,"threshold_uncertainty_score":0.009647608},"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":"methods","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0226384,0.00090480474,0.94355875,0.009530804,0.000414702,0.0009384098,0.0006010251,0.004081619,0.017331548],"genre_scores_gemma":[0.27907112,0.0005345293,0.70796525,0.0023155762,0.00023088715,0.002501197,0.0008710578,0.0015404877,0.004969928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.85086155,0.11935372,0.005649713,0.0068768966,0.015631622,0.0016265175],"domain_scores_gemma":[0.7420573,0.1925093,0.0065828827,0.028892618,0.026182925,0.0037749142],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.10923592,0.0015761099,0.0020311747,0.0024305335,0.0019751743,0.008701421,0.0051527256,0.0040629786,0.008125558],"category_scores_gemma":[0.3080233,0.0011850151,0.0012572375,0.0021368524,0.0062460788,0.015336964,0.01014672,0.0097046085,0.0024858876],"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.001562071,0.0007472308,0.0047251303,0.0011170008,0.00043644273,0.00018145624,0.0025967346,0.13082339,0.0014671118,0.5359082,0.03554575,0.28488958],"study_design_scores_gemma":[0.000585775,0.0006794519,0.0008370691,0.00060340256,0.00010919046,0.00012476926,0.0007289476,0.5693612,0.0039512413,0.3831101,0.03976535,0.00014363785],"about_ca_topic_score_codex":0.0058226613,"about_ca_topic_score_gemma":0.0065632327,"teacher_disagreement_score":0.89076406,"about_ca_system_score_codex":0.005616248,"about_ca_system_score_gemma":0.00810021,"threshold_uncertainty_score":0.5777017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71840024,0.00069960835,0.26177502,0.000900988,0.00017068829,0.00039469957,0.00048546956,0.0026446087,0.014528698],"genre_scores_gemma":[0.92913234,0.00015423936,0.060423445,0.00023387716,0.00003897744,0.00013610173,0.0010955367,0.000073893985,0.008711645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996201,0.00012537015,0.000016652992,0.00013258633,0.000053855554,0.000051356797],"domain_scores_gemma":[0.999252,0.00046177008,0.000048212074,0.00004894959,0.0001026438,0.00008631259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007109268,0.0012938837,0.00056866044,0.0004792164,0.00042499864,0.0010853352,0.00095764425,0.0009111363,0.0030391118],"category_scores_gemma":[0.002333347,0.00032052738,0.00045521307,0.00018981604,0.0005088062,0.0011829761,0.0007694726,0.0012478016,0.00070945406],"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.0008397556,0.00086135213,0.021100096,0.00018187959,0.00013230609,0.0002562858,0.00025258222,0.6514866,0.0054131304,0.008066441,0.0070808753,0.3043288],"study_design_scores_gemma":[0.000021475045,0.00011075178,0.0011847331,0.000011825314,0.000006399081,0.000021648471,0.00006650898,0.9924964,0.0012117416,0.0037671716,0.0010947041,0.0000067993897],"about_ca_topic_score_codex":0.0059896028,"about_ca_topic_score_gemma":0.008812133,"teacher_disagreement_score":0.0059896028,"about_ca_system_score_codex":0.00079630944,"about_ca_system_score_gemma":0.0006025901,"threshold_uncertainty_score":0.011909485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07046213,0.0021367967,0.91303164,0.0012956212,0.00025471378,0.00038171356,0.00038193076,0.004153459,0.007901998],"genre_scores_gemma":[0.62964827,0.00056722184,0.36255696,0.00083065574,0.00013276342,0.0006497292,0.0010604728,0.00031214344,0.0042417655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971961,0.0009877137,0.00023402895,0.00050713413,0.00069933466,0.00037568263],"domain_scores_gemma":[0.9919071,0.0052080224,0.0004926908,0.0008439454,0.0012681076,0.00028010606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004657711,0.0015708162,0.001482273,0.0016200668,0.0007085284,0.0020936043,0.0028012788,0.002168245,0.003926686],"category_scores_gemma":[0.018742535,0.000721503,0.0010352737,0.0014268449,0.0010338239,0.0025213545,0.0014029519,0.003645088,0.001470775],"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.00032377974,0.00052279205,0.0051311473,0.00024053342,0.00012675299,0.000099339006,0.000086810185,0.5252887,0.0021783554,0.012588329,0.009423392,0.44399014],"study_design_scores_gemma":[0.000020963023,0.000048661812,0.00014680182,0.000015966942,0.000009545677,0.000014595482,0.00001010982,0.9928877,0.00079928496,0.005179925,0.00086136383,0.000005091873],"about_ca_topic_score_codex":0.0066527054,"about_ca_topic_score_gemma":0.00870208,"teacher_disagreement_score":0.0066527054,"about_ca_system_score_codex":0.002860632,"about_ca_system_score_gemma":0.0030128518,"threshold_uncertainty_score":0.024632633},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24051063,0.0020736044,0.30599317,0.0057008592,0.0038733839,0.0061397394,0.01959041,0.0063378774,0.4097804],"genre_scores_gemma":[0.603722,0.0011877947,0.27759346,0.0010934019,0.0012643612,0.0031156766,0.01374357,0.0014255911,0.09685418],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99314636,0.0032168026,0.00024787808,0.0009263962,0.0022244847,0.00023800015],"domain_scores_gemma":[0.98040956,0.009794525,0.0006812458,0.005759027,0.0025987928,0.0007567961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005189157,0.0007796212,0.00051747146,0.0047278823,0.0026441868,0.004675729,0.0018562955,0.0011525836,0.017993437],"category_scores_gemma":[0.023967901,0.00031685352,0.0006627211,0.0033085241,0.0019852293,0.0040162513,0.0073729344,0.0013373533,0.007076107],"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.00086019986,0.001068514,0.0085791955,0.0025029832,0.00022754511,0.001585614,0.036549993,0.008336549,0.026156342,0.068478845,0.1042823,0.7413719],"study_design_scores_gemma":[0.0002467402,0.00037980935,0.009923021,0.0005926835,0.00006955347,0.0009846837,0.029344475,0.027967615,0.02376482,0.11047746,0.7960168,0.0002323314],"about_ca_topic_score_codex":0.0012310412,"about_ca_topic_score_gemma":0.0034800873,"teacher_disagreement_score":0.017993437,"about_ca_system_score_codex":0.0008915136,"about_ca_system_score_gemma":0.0013295922,"threshold_uncertainty_score":0.060194075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88482535,0.0012767483,0.10724294,0.00064129237,0.00018402917,0.00015542173,0.00014905183,0.0017345138,0.0037906573],"genre_scores_gemma":[0.97235495,0.00017216991,0.026331883,0.00013321578,0.000027731223,0.000069895956,0.00013442023,0.00015268633,0.0006229926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918611,0.0032714342,0.00081943057,0.0014068191,0.0019782167,0.00066296535],"domain_scores_gemma":[0.86061877,0.10590955,0.009434152,0.01629343,0.006153574,0.0015904957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010701555,0.0012438365,0.0012847901,0.0011234222,0.0008607883,0.0023051177,0.0021345883,0.002206705,0.0012965156],"category_scores_gemma":[0.1350123,0.00061969185,0.0005412241,0.0010667208,0.0021551114,0.0032196518,0.0016478694,0.0024150398,0.0004078623],"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.00303291,0.0009886241,0.0073860977,0.00031131797,0.0002845812,0.00016158159,0.00033789797,0.8819895,0.010240788,0.0035846375,0.0009960637,0.09068612],"study_design_scores_gemma":[0.0001567724,0.0006664784,0.0015536158,0.00004233797,0.000058908183,0.000113459624,0.00009739457,0.9827236,0.011268624,0.0028920602,0.00039581777,0.00003102639],"about_ca_topic_score_codex":0.00400802,"about_ca_topic_score_gemma":0.0021796913,"teacher_disagreement_score":0.010701555,"about_ca_system_score_codex":0.0017282334,"about_ca_system_score_gemma":0.0021246306,"threshold_uncertainty_score":0.05659592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20098257,0.00039180435,0.7517911,0.0011417968,0.00016103926,0.0002411124,0.00018083525,0.00017434645,0.044935342],"genre_scores_gemma":[0.7401903,0.00048025313,0.23395152,0.0002472348,0.00006923019,0.00038722306,0.0002403471,0.00009680544,0.024337031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993267,0.00023230008,0.000036296628,0.000117578085,0.000118722084,0.00016834943],"domain_scores_gemma":[0.99922705,0.00047519794,0.00006888123,0.000044589764,0.00008456229,0.000099702986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094671757,0.00055457687,0.00079413765,0.0006638169,0.0009975276,0.00090967247,0.0010314416,0.00090292527,0.005540425],"category_scores_gemma":[0.0033930405,0.00023480672,0.00094027485,0.0006311595,0.0020224026,0.0017349446,0.0015580656,0.0015085837,0.00044125275],"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.00010401896,0.000059916783,0.00060166576,0.00013603437,0.00002194374,0.00013701752,0.0004340051,0.08370939,0.0013994472,0.89230305,0.0020995014,0.018994104],"study_design_scores_gemma":[0.000047736303,0.00010354814,0.00024340258,0.00003767544,0.000019141222,0.000050800445,0.00014827581,0.4170226,0.0011062645,0.5773071,0.0038800093,0.00003338209],"about_ca_topic_score_codex":0.004117032,"about_ca_topic_score_gemma":0.0035174298,"teacher_disagreement_score":0.005540425,"about_ca_system_score_codex":0.0014072466,"about_ca_system_score_gemma":0.0018176257,"threshold_uncertainty_score":0.0185346},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014985901,0.08134137,0.025416637,0.18601122,0.18263112,0.0011709059,0.0037792781,0.0019398035,0.50272375],"genre_scores_gemma":[0.040918972,0.022987917,0.01752989,0.008730633,0.0241768,0.00052277674,0.0038661691,0.0012598276,0.8800071],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979233,0.00075715285,0.00011294112,0.00038383395,0.00051682006,0.0003061103],"domain_scores_gemma":[0.9941776,0.0010451407,0.0001503768,0.00046530456,0.0014637905,0.002697823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049845916,0.001284047,0.0012531911,0.0027182512,0.0028078957,0.009003573,0.002319175,0.0029878675,0.111437306],"category_scores_gemma":[0.0045391144,0.0005175775,0.0020012495,0.0016581495,0.0014779973,0.004990773,0.0059725796,0.0050961226,0.03464162],"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.00021931165,0.00016280163,0.00018490221,0.00027698907,0.00001997559,0.00023004034,0.0011691803,0.00019424081,0.0010766963,0.0136591345,0.9066888,0.076117925],"study_design_scores_gemma":[0.000013575794,0.000046122477,0.0004377312,0.0002844366,0.00000745424,0.00009244887,0.00076956174,0.00014565418,0.00022985837,0.0029052126,0.9950578,0.000010119094],"about_ca_topic_score_codex":0.0026460183,"about_ca_topic_score_gemma":0.006147463,"teacher_disagreement_score":0.111437306,"about_ca_system_score_codex":0.0028991646,"about_ca_system_score_gemma":0.0043370808,"threshold_uncertainty_score":0.37279493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72086567,0.00020074827,0.2018038,0.0024470168,0.00020680451,0.00025481117,0.0003538735,0.0023203136,0.07154689],"genre_scores_gemma":[0.9509468,0.00005217067,0.03883078,0.0002692678,0.000022653576,0.000064014974,0.00027315755,0.00008043908,0.009460738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.00043827298,0.00006725937,0.0003100441,0.00029782148,0.0002870925],"domain_scores_gemma":[0.99519354,0.003312015,0.0002404055,0.0006399406,0.0002226273,0.00039140895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002021552,0.000611762,0.00096799486,0.0003288629,0.0010598716,0.0017026042,0.0014963925,0.001327801,0.00736256],"category_scores_gemma":[0.008776093,0.00022862371,0.00065630657,0.0002905883,0.0018254208,0.0023664345,0.0024234164,0.0020725776,0.0008407083],"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.0035727597,0.0013125848,0.0136519335,0.0006425851,0.00023348677,0.000976699,0.0014824538,0.22171879,0.016672157,0.52573854,0.022494478,0.19150352],"study_design_scores_gemma":[0.00018045212,0.00053933915,0.0011141468,0.000032287015,0.00003561492,0.00027430968,0.00047911366,0.73008204,0.013454017,0.24696098,0.0068145576,0.000033144217],"about_ca_topic_score_codex":0.002365191,"about_ca_topic_score_gemma":0.0033401183,"teacher_disagreement_score":0.00736256,"about_ca_system_score_codex":0.0007924889,"about_ca_system_score_gemma":0.0020199846,"threshold_uncertainty_score":0.024630249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0817315,0.0006316942,0.83960295,0.0022959965,0.00017233347,0.00023607862,0.00027520143,0.00086433557,0.07418997],"genre_scores_gemma":[0.751756,0.0006001198,0.22689264,0.0007721876,0.0002025309,0.00028111125,0.0005752345,0.00032336457,0.018596793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972506,0.0009248395,0.00012431118,0.0006400139,0.00071433006,0.0003457636],"domain_scores_gemma":[0.9950871,0.002483467,0.00033917773,0.0011753488,0.0005457977,0.0003691605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019258766,0.0008207369,0.0010066289,0.001192772,0.0015006663,0.003034785,0.0016759998,0.0013501002,0.006147964],"category_scores_gemma":[0.013148746,0.0003789441,0.00090830924,0.0010446829,0.00432584,0.005220856,0.00232751,0.0026907376,0.0012689529],"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.00022812115,0.000120019635,0.0036188967,0.00013406498,0.00006323765,0.00009331446,0.00049839733,0.03207994,0.0012150385,0.83605564,0.007160224,0.11873311],"study_design_scores_gemma":[0.000025969233,0.00009728489,0.0016187837,0.000031541156,0.000016316495,0.00008975167,0.00012314781,0.12389812,0.00073633407,0.86124,0.012102152,0.000020531053],"about_ca_topic_score_codex":0.00646142,"about_ca_topic_score_gemma":0.009011712,"teacher_disagreement_score":0.00646142,"about_ca_system_score_codex":0.0017243976,"about_ca_system_score_gemma":0.0014858149,"threshold_uncertainty_score":0.02056694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12939402,0.00057816115,0.84880686,0.0010159574,0.00014552695,0.00028587758,0.00017664385,0.003844736,0.015752109],"genre_scores_gemma":[0.8177584,0.00025985227,0.17517816,0.00050433667,0.000047235142,0.00018001159,0.00030260417,0.00022555956,0.0055438853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.00019564356,0.000027153132,0.00016216698,0.00014636685,0.000104573744],"domain_scores_gemma":[0.9974138,0.0018265716,0.00015116586,0.00024309316,0.0001644791,0.00020103874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031844,0.0010072974,0.00093913503,0.0005636839,0.0005762532,0.0012429476,0.0017757575,0.0014806379,0.005104504],"category_scores_gemma":[0.008092452,0.0005078858,0.0005564857,0.00034509835,0.0013751404,0.0026945022,0.0020872024,0.002697247,0.0007138644],"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.00028060537,0.00025942572,0.0029852502,0.00011150804,0.00007233264,0.00009257152,0.00020257772,0.85640645,0.00284044,0.024388546,0.00321066,0.10914963],"study_design_scores_gemma":[0.00002239518,0.00005045301,0.00012552168,0.0000068884738,0.000006843216,0.000011808332,0.00001594606,0.99077433,0.00049251213,0.007827696,0.00066067016,0.000004894779],"about_ca_topic_score_codex":0.0062454776,"about_ca_topic_score_gemma":0.01097483,"teacher_disagreement_score":0.0062454776,"about_ca_system_score_codex":0.0011757857,"about_ca_system_score_gemma":0.0015831414,"threshold_uncertainty_score":0.017076313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31989086,0.0003068116,0.6704678,0.00018825369,0.0000294391,0.00015405446,0.00010184545,0.00055163394,0.008309411],"genre_scores_gemma":[0.8905516,0.000096510004,0.10599921,0.000039048384,0.000005795412,0.00012671588,0.00008199419,0.00006874499,0.003030342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999231,0.00029407255,0.000029587642,0.00014674105,0.0001446127,0.00015404471],"domain_scores_gemma":[0.99729353,0.0019183821,0.0002125016,0.00023756082,0.00010643351,0.00023169328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009779382,0.0007200849,0.00082506606,0.00056205544,0.0006926249,0.0011734187,0.0011999221,0.0007454221,0.0027838885],"category_scores_gemma":[0.004428851,0.00046188117,0.00045059877,0.0004251885,0.0013910533,0.0023383442,0.002828429,0.00074238086,0.0002781354],"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.0006637189,0.00015179368,0.0027446782,0.00015327803,0.000060782615,0.0003061958,0.0005056791,0.8919952,0.006468675,0.04378923,0.00094172667,0.05221908],"study_design_scores_gemma":[0.000024761477,0.000108173896,0.00042628517,0.00001219381,0.0000087394665,0.00010591008,0.00011674178,0.9700024,0.0016165618,0.026379349,0.0011843768,0.0000145546755],"about_ca_topic_score_codex":0.0020004315,"about_ca_topic_score_gemma":0.0026937004,"teacher_disagreement_score":0.0027838885,"about_ca_system_score_codex":0.00072075083,"about_ca_system_score_gemma":0.00070584036,"threshold_uncertainty_score":0.009313047},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011901697,0.0009924207,0.1077128,0.033183128,0.022271551,0.0004585079,0.086810686,0.06657906,0.68080163],"genre_scores_gemma":[0.011657236,0.0017748965,0.09278366,0.008334449,0.0046960004,0.0006256129,0.07110972,0.06673005,0.7422883],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00020834956,0.00009623155,0.00012586488,0.00043622346,0.000096656666],"domain_scores_gemma":[0.9936473,0.002535955,0.0001729616,0.00078558543,0.0024595733,0.00039865178],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014437181,0.0012279178,0.00095989555,0.002135774,0.0014923376,0.0034676737,0.002188269,0.0012508103,0.6778054],"category_scores_gemma":[0.011387286,0.0009439596,0.0010731892,0.003157039,0.0006198224,0.0069624935,0.0019286292,0.0030039414,0.44028872],"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.000020837633,0.000012451266,0.000029420713,0.000044715835,0.0000012259624,0.000012391563,0.00002910739,0.00006820237,0.00014671535,0.008390276,0.98273635,0.008508377],"study_design_scores_gemma":[0.000012967302,0.000009100712,0.00017021537,0.000046828784,0.0000016567116,0.000042092543,0.000031362666,0.00031082402,0.0004675783,0.0073873242,0.99150366,0.000016379798],"about_ca_topic_score_codex":0.010011764,"about_ca_topic_score_gemma":0.018211927,"teacher_disagreement_score":0.6778054,"about_ca_system_score_codex":0.0020181148,"about_ca_system_score_gemma":0.001590857,"threshold_uncertainty_score":0.45957142},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09040394,0.001302879,0.36653578,0.0025299783,0.00041343257,0.00009824419,0.0008894888,0.0020317414,0.53579444],"genre_scores_gemma":[0.7619387,0.0011572813,0.111043535,0.0007434643,0.00012257308,0.00015667532,0.0019196472,0.00105722,0.121860914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997484,0.000056596153,0.000008670499,0.000069174625,0.00005723823,0.000059868446],"domain_scores_gemma":[0.9996265,0.00019465407,0.000024390387,0.00007240899,0.000038724713,0.00004326725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023486874,0.0005738947,0.0006766449,0.00093500625,0.0016400495,0.0020853758,0.0011105187,0.001236538,0.05794675],"category_scores_gemma":[0.002431941,0.00035486234,0.00079265423,0.0012353332,0.0017719336,0.0035972735,0.002825555,0.0019544684,0.005394079],"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.000033283675,0.000016777776,0.0001229721,0.00006176877,0.0000070909714,0.0000490495,0.0001537018,0.0044845524,0.00035125864,0.97382826,0.0031506626,0.017740557],"study_design_scores_gemma":[0.000008725635,0.00001401247,0.000064539905,0.000038366772,0.0000068670834,0.000042491763,0.00017908016,0.02150312,0.0002258821,0.965881,0.012026992,0.000008781282],"about_ca_topic_score_codex":0.0027606268,"about_ca_topic_score_gemma":0.005024169,"teacher_disagreement_score":0.05794675,"about_ca_system_score_codex":0.0008312739,"about_ca_system_score_gemma":0.00060409756,"threshold_uncertainty_score":0.19385117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32721415,0.0019286779,0.58077806,0.00314675,0.0009778478,0.0003129049,0.0060663116,0.022193238,0.05738207],"genre_scores_gemma":[0.8170922,0.0003933594,0.13597928,0.00043614805,0.00007029774,0.00022219529,0.005939184,0.00057320413,0.039294116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997476,0.00004087961,0.000010155448,0.00008410059,0.00006751403,0.00004986217],"domain_scores_gemma":[0.9997582,0.000067749854,0.000019304085,0.000053199536,0.00007950783,0.000022044527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039959134,0.00075010775,0.0003426325,0.00030190652,0.0002893131,0.00096945034,0.001002109,0.0007524238,0.011519384],"category_scores_gemma":[0.001704634,0.00046345365,0.00039568683,0.0002781256,0.00035462392,0.0013702256,0.0007707065,0.0013780528,0.001851863],"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.0005216386,0.0003009199,0.00550404,0.00019104191,0.00013800012,0.00020859904,0.000098502045,0.57735324,0.016759086,0.024229912,0.042672727,0.3320222],"study_design_scores_gemma":[0.000015127333,0.000039654613,0.0010390426,0.000016743952,0.000007751807,0.00001520271,0.000011454767,0.98272854,0.0061750277,0.0057065873,0.004233952,0.000010946437],"about_ca_topic_score_codex":0.022267492,"about_ca_topic_score_gemma":0.03720561,"teacher_disagreement_score":0.022267492,"about_ca_system_score_codex":0.0011814135,"about_ca_system_score_gemma":0.0006550961,"threshold_uncertainty_score":0.04427576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028565312,0.000048302485,0.9470518,0.0003233378,0.000059298334,0.0005443278,0.0011821872,0.01175155,0.010473862],"genre_scores_gemma":[0.19720432,0.00010161668,0.7937197,0.00009673795,0.00001191284,0.0010735529,0.0017070925,0.00076471124,0.0053202757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994429,0.00026292383,0.000073430776,0.00010300882,0.000091654816,0.000026125033],"domain_scores_gemma":[0.9961972,0.0029564376,0.00012285997,0.00033108506,0.00024934218,0.00014294354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014820003,0.00078682345,0.0004703664,0.0009033826,0.0012121692,0.0028104484,0.0021430054,0.001357329,0.025377832],"category_scores_gemma":[0.008443271,0.0006179225,0.00089102995,0.0005185691,0.00091955543,0.002389543,0.0028510643,0.0011086969,0.002246624],"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.00080027303,0.0009377369,0.0075203227,0.0010092583,0.00023794657,0.0009807975,0.008390278,0.50485116,0.010874093,0.2923565,0.015193345,0.15684828],"study_design_scores_gemma":[0.00008075349,0.000041040388,0.00015583095,0.000060983028,0.00003571855,0.00007601731,0.00031520627,0.9465789,0.0035476112,0.028151521,0.020930104,0.000026206946],"about_ca_topic_score_codex":0.005303052,"about_ca_topic_score_gemma":0.0073848404,"teacher_disagreement_score":0.025377832,"about_ca_system_score_codex":0.0011674355,"about_ca_system_score_gemma":0.0017055909,"threshold_uncertainty_score":0.08489734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18985052,0.0051668505,0.64315844,0.013042057,0.0002662626,0.00064230047,0.00027417627,0.00029664586,0.14730276],"genre_scores_gemma":[0.87650657,0.0021543496,0.112359494,0.00038480974,0.000054112785,0.00065682584,0.0001578637,0.0000745918,0.007651374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815035,0.0014483351,0.000058759757,0.00012374528,0.00011709099,0.000101731384],"domain_scores_gemma":[0.99704957,0.002181942,0.0002492111,0.00016664044,0.0001530264,0.00019956977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019686702,0.0009568393,0.00031394672,0.00080211187,0.0012040776,0.0072388267,0.0014388012,0.0012779782,0.003933772],"category_scores_gemma":[0.0054457583,0.0005251414,0.00047764435,0.00043502348,0.0048538297,0.0060065812,0.0026665016,0.0015608885,0.00052261696],"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.00009914912,0.0001517794,0.0027614776,0.00058213965,0.000036772253,0.0003933694,0.049960595,0.0052313954,0.0042896215,0.9075489,0.0018854579,0.0270594],"study_design_scores_gemma":[0.00014674032,0.0005285423,0.0041312394,0.0012023959,0.00016030278,0.0018277694,0.10788572,0.07578789,0.009789505,0.52016205,0.27825993,0.000117975294],"about_ca_topic_score_codex":0.0006626444,"about_ca_topic_score_gemma":0.0008586236,"teacher_disagreement_score":0.0072388267,"about_ca_system_score_codex":0.0013837235,"about_ca_system_score_gemma":0.00084808486,"threshold_uncertainty_score":0.013159752},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015617831,0.11084415,0.020873262,0.047323544,0.054506414,0.00038046582,0.0015251017,0.0017858086,0.7611996],"genre_scores_gemma":[0.012504055,0.09279015,0.011501657,0.01989948,0.031944074,0.00048549369,0.0019058634,0.00121263,0.8277566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999257,0.00014261017,0.00004832081,0.00013205898,0.00033875098,0.00008118324],"domain_scores_gemma":[0.9982495,0.0005898628,0.00006870433,0.00010769896,0.00052390934,0.00046034958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091352983,0.0012886187,0.00064194784,0.0017985249,0.0017020953,0.0070109023,0.0013122477,0.002924765,0.13026054],"category_scores_gemma":[0.0025330924,0.0005300779,0.00051887933,0.0018138455,0.0016053,0.005522981,0.0030249532,0.0054095984,0.050207667],"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.000019859595,0.00005299702,0.00018148268,0.00019231599,0.0000031147479,0.000033925982,0.00027530815,0.00010240764,0.00031614184,0.03393456,0.8416501,0.12323774],"study_design_scores_gemma":[0.0000017681115,0.000013775538,0.00026087844,0.0002055808,8.990818e-7,0.00005942511,0.00007438518,0.00005700221,0.000034696128,0.0043444764,0.99494064,0.00000651166],"about_ca_topic_score_codex":0.00342687,"about_ca_topic_score_gemma":0.009381518,"teacher_disagreement_score":0.13026054,"about_ca_system_score_codex":0.0015949925,"about_ca_system_score_gemma":0.0015198165,"threshold_uncertainty_score":0.4357649},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086708464,0.0027895863,0.7960458,0.002948877,0.0003194786,0.005389788,0.017665297,0.03599452,0.05213818],"genre_scores_gemma":[0.1271484,0.0007800446,0.83585006,0.00047644463,0.00012538717,0.0059103332,0.019636143,0.0060795173,0.0039936276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9796749,0.011593145,0.001507127,0.0040090866,0.0027638886,0.00045193656],"domain_scores_gemma":[0.8912486,0.07528624,0.004861362,0.019343894,0.0071108956,0.0021491032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01853662,0.0020203276,0.0014504644,0.015624959,0.0033451794,0.014198178,0.003541625,0.0019618669,0.012204488],"category_scores_gemma":[0.121551536,0.0021764091,0.0018969822,0.009764423,0.0038340986,0.02648929,0.0147924805,0.0042933417,0.0054828017],"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.00082705583,0.0011750597,0.02688691,0.006032225,0.00046595468,0.0025056538,0.18179119,0.005743047,0.045540676,0.13135883,0.09103962,0.5066337],"study_design_scores_gemma":[0.00035599535,0.0003863762,0.036239438,0.002889317,0.00028825752,0.0018895738,0.05100964,0.09901377,0.024889328,0.18843734,0.5941484,0.00045253278],"about_ca_topic_score_codex":0.006219518,"about_ca_topic_score_gemma":0.012417777,"teacher_disagreement_score":0.01853662,"about_ca_system_score_codex":0.0022852905,"about_ca_system_score_gemma":0.004226465,"threshold_uncertainty_score":0.09803218},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06279859,0.001119018,0.92899793,0.00044738804,0.000109759356,0.00010320282,0.0001415734,0.00079985574,0.0054826476],"genre_scores_gemma":[0.8070399,0.00032875667,0.18957707,0.00030760918,0.00006566858,0.00022371234,0.00022864174,0.00013110822,0.0020973694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857605,0.0007346165,0.00006588662,0.00018594289,0.00029900717,0.00013854097],"domain_scores_gemma":[0.99236155,0.0058145765,0.00037386824,0.0007203032,0.000515335,0.00021444759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021844287,0.0008068467,0.0018200089,0.0006486894,0.00059986394,0.0010260112,0.0025047066,0.0015389405,0.003104119],"category_scores_gemma":[0.016295215,0.00060658454,0.00070685137,0.0010164842,0.0013281108,0.0027400048,0.0016509049,0.0014531929,0.0004246429],"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.00020313647,0.000049166436,0.00087964477,0.0000658246,0.000052768315,0.00006492768,0.000059215847,0.942423,0.00035932037,0.026843486,0.00085130654,0.028148197],"study_design_scores_gemma":[0.000013923527,0.000019344752,0.000036003083,0.00000528356,0.000005524306,0.000008742561,0.0000028596355,0.9915331,0.00008632853,0.008091552,0.00019377536,0.0000035618416],"about_ca_topic_score_codex":0.0066313082,"about_ca_topic_score_gemma":0.0071802665,"teacher_disagreement_score":0.0066313082,"about_ca_system_score_codex":0.0011220777,"about_ca_system_score_gemma":0.0018458201,"threshold_uncertainty_score":0.0131854415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014303599,0.00001476098,0.99566203,0.00014440034,0.000013662055,0.00023169666,0.000078921235,0.0011151703,0.0013089613],"genre_scores_gemma":[0.037433986,0.000048971175,0.9602633,0.00007666793,0.000015235619,0.00046909388,0.0002130697,0.00025680874,0.001222815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886115,0.006648252,0.0009505102,0.0010043717,0.0024885265,0.0002968515],"domain_scores_gemma":[0.9503815,0.036089372,0.002751191,0.005196852,0.005110243,0.0004707884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022398323,0.0009419965,0.0005633665,0.002633224,0.0012783939,0.00577743,0.0027303023,0.001039943,0.008687595],"category_scores_gemma":[0.042477224,0.00084281777,0.0011998306,0.0010804666,0.003897734,0.0043912563,0.0041047214,0.0017490723,0.0016061853],"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.0003011767,0.00039269312,0.0027615398,0.0015387986,0.00012609648,0.0009961972,0.01794805,0.0836623,0.027085122,0.53716016,0.007215166,0.32081267],"study_design_scores_gemma":[0.0002051885,0.00027038276,0.0011508727,0.0006649636,0.000104750565,0.0007917786,0.0034094513,0.47376627,0.037203077,0.3734858,0.10873766,0.00020980554],"about_ca_topic_score_codex":0.0019270538,"about_ca_topic_score_gemma":0.0023921542,"teacher_disagreement_score":0.022398323,"about_ca_system_score_codex":0.0020023277,"about_ca_system_score_gemma":0.004069788,"threshold_uncertainty_score":0.11845505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15849207,0.0004167055,0.8314051,0.0002560646,0.00006290202,0.00022963862,0.000126339,0.0013142711,0.007696876],"genre_scores_gemma":[0.8426703,0.00017173609,0.15418383,0.00013498771,0.000011830875,0.00020366973,0.00015777629,0.00010702794,0.0023588033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991273,0.00039688047,0.000046725545,0.00013588814,0.00020470045,0.00008853497],"domain_scores_gemma":[0.9977368,0.001582666,0.00017888032,0.00021167497,0.00014120415,0.00014883043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101749,0.0007320672,0.00081627007,0.0004205327,0.00041270212,0.0007568936,0.0010928301,0.0009806154,0.0029769412],"category_scores_gemma":[0.006100499,0.0003280381,0.00051486015,0.00034499756,0.0011611427,0.0015790218,0.0010363079,0.0012455893,0.00037805864],"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.00026282467,0.0001581093,0.0013164879,0.0001301424,0.000054824483,0.00017840957,0.00023202028,0.90749276,0.005008535,0.046641625,0.0010265479,0.037497636],"study_design_scores_gemma":[0.00001956096,0.000058208912,0.00009932975,0.0000074493687,0.000005392732,0.000031698833,0.000011897565,0.9877687,0.0007876728,0.010630268,0.0005747734,0.0000050889985],"about_ca_topic_score_codex":0.0038821453,"about_ca_topic_score_gemma":0.0036637797,"teacher_disagreement_score":0.0038821453,"about_ca_system_score_codex":0.0008655517,"about_ca_system_score_gemma":0.0011728358,"threshold_uncertainty_score":0.009958923},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028710987,0.011956656,0.026332265,0.114217475,0.09587154,0.00058922527,0.0067134816,0.0026507615,0.7129576],"genre_scores_gemma":[0.1560384,0.0041541513,0.016426668,0.015061684,0.013512156,0.00069760944,0.01118775,0.0023172924,0.78060424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99109143,0.0017860181,0.00023810122,0.0007698655,0.0048523913,0.0012621743],"domain_scores_gemma":[0.98772764,0.0019176891,0.00021869953,0.0007534035,0.004617236,0.004765416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009256239,0.0016554381,0.0016463695,0.0020777332,0.003479697,0.011997505,0.002514344,0.0035669585,0.07449325],"category_scores_gemma":[0.0177547,0.0005311116,0.0015557611,0.0013259206,0.0021238623,0.0045426176,0.0055867904,0.005550054,0.025437968],"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.0004584423,0.00016184368,0.0002953373,0.00014823764,0.00006127079,0.00015492103,0.00016675725,0.0021743034,0.0007922117,0.050015513,0.89543164,0.0501395],"study_design_scores_gemma":[0.00008642306,0.000149225,0.00085861026,0.00008320019,0.00001437194,0.000054256157,0.00013626437,0.0029339038,0.00062981294,0.015819445,0.97919995,0.000034516233],"about_ca_topic_score_codex":0.012077357,"about_ca_topic_score_gemma":0.021860193,"teacher_disagreement_score":0.07449325,"about_ca_system_score_codex":0.007152487,"about_ca_system_score_gemma":0.0082713,"threshold_uncertainty_score":0.24920475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16082524,0.0010549817,0.775863,0.004220422,0.00021383193,0.0001454754,0.00024118334,0.00030953126,0.05712634],"genre_scores_gemma":[0.9364475,0.00035768352,0.05758857,0.000273849,0.000048525195,0.00010968306,0.00013121535,0.00008735677,0.004955592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843615,0.0007227089,0.0001070079,0.00029975295,0.00022025763,0.0002140255],"domain_scores_gemma":[0.9930809,0.004465847,0.00066341617,0.00091480295,0.00051022664,0.00036476983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018546265,0.0007262252,0.0005922847,0.00075117603,0.0011534947,0.0023737429,0.002021856,0.0016646152,0.005944123],"category_scores_gemma":[0.018203663,0.0006473011,0.0013692335,0.00067292876,0.005876359,0.009031266,0.0035981627,0.0032180455,0.00031906637],"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.00003021697,0.00004206661,0.0010329296,0.000063861495,0.00003487192,0.00010586382,0.0003863724,0.02780338,0.00038492976,0.9598925,0.0008245198,0.0093984455],"study_design_scores_gemma":[0.000017403414,0.000024870777,0.00041149295,0.00005076784,0.000019696989,0.000052075113,0.0001809392,0.119215176,0.0002514901,0.87731785,0.002445895,0.00001226181],"about_ca_topic_score_codex":0.0073221996,"about_ca_topic_score_gemma":0.008649426,"teacher_disagreement_score":0.0073221996,"about_ca_system_score_codex":0.0021868027,"about_ca_system_score_gemma":0.0014015089,"threshold_uncertainty_score":0.019885123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35742527,0.002131802,0.6301971,0.0008443997,0.0003962006,0.00014968897,0.002248576,0.0030237269,0.0035832098],"genre_scores_gemma":[0.92306286,0.00029233884,0.07307997,0.00015080207,0.00018594455,0.00009437024,0.0015217186,0.00013270354,0.0014792366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00010777105,0.00003077623,0.00011187772,0.000072925366,0.00006425926],"domain_scores_gemma":[0.9950907,0.0036735318,0.00022030545,0.00021116674,0.00052016444,0.00028405487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017218614,0.0011541013,0.0016594866,0.0017140759,0.0006079386,0.0013867875,0.0020586946,0.0018948574,0.0031139941],"category_scores_gemma":[0.0063606375,0.0006275621,0.0011224498,0.0012759684,0.00056664075,0.0018513948,0.0012833416,0.0016023048,0.0008351181],"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.0002716062,0.00015150038,0.009453702,0.00007833717,0.000120657925,0.00008686297,0.000034494187,0.9361144,0.00073813705,0.0020830322,0.0019564002,0.048910916],"study_design_scores_gemma":[0.0000022502652,0.0000042439533,0.0001580936,0.0000017452431,0.0000032855273,0.0000021693406,0.000001915017,0.9992211,0.000030438965,0.00054911413,0.00002401712,0.0000016273383],"about_ca_topic_score_codex":0.04905923,"about_ca_topic_score_gemma":0.041367933,"teacher_disagreement_score":0.04905923,"about_ca_system_score_codex":0.00095757167,"about_ca_system_score_gemma":0.0013533991,"threshold_uncertainty_score":0.09754735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59664905,0.0002878545,0.35154226,0.0009575725,0.00029242632,0.0056791515,0.0008390428,0.0031033752,0.040649287],"genre_scores_gemma":[0.8256483,0.0001041617,0.15092546,0.0006517151,0.00007824501,0.0077275042,0.0007695025,0.00055681285,0.01353828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97636265,0.016982673,0.0010859646,0.0023077375,0.002648797,0.0006122201],"domain_scores_gemma":[0.915917,0.03758701,0.0032135856,0.030696185,0.009398542,0.0031877488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023174522,0.0011438357,0.0012505221,0.0011260395,0.0010456154,0.0031418186,0.00231192,0.0012623264,0.015936522],"category_scores_gemma":[0.063343406,0.0006044708,0.0006473307,0.00055735366,0.0018227225,0.00300004,0.0032089164,0.0012023179,0.0059021204],"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.0066623306,0.0076362076,0.06453877,0.0011559913,0.0003713289,0.0007268922,0.024285749,0.011114405,0.06258913,0.018069448,0.019863706,0.78298604],"study_design_scores_gemma":[0.0031327475,0.03332846,0.11515283,0.0013237773,0.0006492383,0.002917635,0.017732142,0.15628222,0.13184226,0.07209188,0.4645979,0.00094886066],"about_ca_topic_score_codex":0.00077763054,"about_ca_topic_score_gemma":0.0014198453,"teacher_disagreement_score":0.023174522,"about_ca_system_score_codex":0.00088038185,"about_ca_system_score_gemma":0.0011719018,"threshold_uncertainty_score":0.122560084},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007196057,0.0017204828,0.9469853,0.010090113,0.0003647304,0.00016208137,0.00016726594,0.001657864,0.03165609],"genre_scores_gemma":[0.1963253,0.0014405078,0.78746,0.0025464173,0.0002674861,0.00045237291,0.00043972116,0.00063855096,0.010429657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977319,0.0012757174,0.00010251513,0.00040497349,0.0004147134,0.00007011469],"domain_scores_gemma":[0.99495834,0.0032587245,0.0002890355,0.00085552677,0.00030216394,0.00033617843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029175333,0.00096589583,0.00045077963,0.0005940022,0.0006967268,0.0051680226,0.0021405832,0.002475717,0.0073086466],"category_scores_gemma":[0.009623162,0.00082926796,0.0013778743,0.00035995155,0.004107744,0.008463928,0.002524495,0.0035903275,0.0022899832],"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.0003003404,0.00029613462,0.002732501,0.0013610331,0.0001543063,0.0006136728,0.011854838,0.026089378,0.01816097,0.7114583,0.020978343,0.20600013],"study_design_scores_gemma":[0.00007732416,0.00017125299,0.001360274,0.00051186443,0.00012294092,0.00084872125,0.0020434111,0.16689995,0.0060792505,0.57611483,0.24565856,0.00011156831],"about_ca_topic_score_codex":0.0008706416,"about_ca_topic_score_gemma":0.0015087452,"teacher_disagreement_score":0.0073086466,"about_ca_system_score_codex":0.0010834514,"about_ca_system_score_gemma":0.0007450603,"threshold_uncertainty_score":0.024449825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011301134,0.0013531712,0.9582797,0.003292736,0.00025541693,0.000060606006,0.0000638878,0.00011235865,0.025281029],"genre_scores_gemma":[0.5004554,0.005928842,0.4536156,0.0018822387,0.0012078946,0.000553145,0.00025268638,0.00040100675,0.035703182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984433,0.000909879,0.000056994053,0.00018612006,0.0002723098,0.00013136986],"domain_scores_gemma":[0.99342465,0.005416318,0.00027631226,0.00039890697,0.00022551866,0.0002583755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029775838,0.0014834406,0.0020289912,0.0007275323,0.001168714,0.0029673201,0.0027818587,0.0030458868,0.005569592],"category_scores_gemma":[0.011699128,0.00081159093,0.0014336365,0.0010141515,0.004026595,0.007526379,0.0034842305,0.004927787,0.0007184935],"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.000012355575,0.000018426474,0.00007258022,0.00007080518,0.000020994341,0.000023007517,0.00008333617,0.056303445,0.00016379212,0.9340886,0.002084882,0.0070577585],"study_design_scores_gemma":[0.000009901492,0.000014625198,0.000034221564,0.000021232023,0.000006565429,0.0000141304845,0.000024050087,0.21503168,0.00006453266,0.7821191,0.0026499084,0.000010035516],"about_ca_topic_score_codex":0.0024775253,"about_ca_topic_score_gemma":0.0025825496,"teacher_disagreement_score":0.005569592,"about_ca_system_score_codex":0.0015577934,"about_ca_system_score_gemma":0.0018837568,"threshold_uncertainty_score":0.018632174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5834994,0.00040537308,0.32803586,0.0025197563,0.00018421418,0.0004454282,0.0009071439,0.00021807101,0.08378477],"genre_scores_gemma":[0.90839213,0.0005499536,0.06799212,0.0002935705,0.00005888423,0.00024308368,0.0005928059,0.000049871276,0.021827603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988877,0.00041676793,0.00007145504,0.00025772006,0.0001377926,0.00022853405],"domain_scores_gemma":[0.99771416,0.0013012215,0.00016759249,0.00013470084,0.00010349069,0.0005789064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007564736,0.00087840605,0.0010164852,0.0004888654,0.0010887914,0.0017967869,0.0010758569,0.0011983532,0.006268771],"category_scores_gemma":[0.004694311,0.00040926127,0.00064909447,0.0005370585,0.0019803143,0.0030700746,0.0016595656,0.0014935568,0.00047943683],"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.00039464247,0.00016275789,0.0015698901,0.00020523612,0.000065590146,0.00046622555,0.0006947851,0.084596835,0.0041362597,0.8875914,0.004350695,0.015765756],"study_design_scores_gemma":[0.0001980304,0.00022598145,0.0011882322,0.00006112912,0.0000536113,0.0003381337,0.0008552923,0.31959543,0.0019807194,0.65835714,0.017093929,0.00005251118],"about_ca_topic_score_codex":0.0036191759,"about_ca_topic_score_gemma":0.004304993,"teacher_disagreement_score":0.006268771,"about_ca_system_score_codex":0.0021613282,"about_ca_system_score_gemma":0.0012665283,"threshold_uncertainty_score":0.02097112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025241186,0.017484328,0.06832523,0.022532672,0.019530296,0.00022633027,0.0004418663,0.010020727,0.8589145],"genre_scores_gemma":[0.0063158297,0.0032229503,0.012895442,0.0042141946,0.0005451803,0.000051356583,0.0002080761,0.0014675873,0.9710793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991768,0.00010054529,0.000028592893,0.000070201764,0.0005259231,0.00009798918],"domain_scores_gemma":[0.9989631,0.00023134045,0.000046130623,0.00014244618,0.0004412156,0.00017579962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966989,0.0011665312,0.00054714124,0.0010956445,0.0024321503,0.005897411,0.0010572099,0.0020902965,0.09359816],"category_scores_gemma":[0.0035265556,0.0005483248,0.0006066351,0.0005117596,0.001283816,0.0048718215,0.0027311032,0.004540729,0.1001202],"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.000031237072,0.00002698928,0.0000662636,0.00017013155,0.0000067749043,0.00022840057,0.0007027022,0.0002490051,0.0012078611,0.032056108,0.7993048,0.16594975],"study_design_scores_gemma":[0.0000045992024,0.000013430403,0.00004755351,0.00010797958,0.0000021261212,0.0002333952,0.0001509401,0.0002595134,0.00041323423,0.0035400717,0.9952187,0.000008393838],"about_ca_topic_score_codex":0.0026508083,"about_ca_topic_score_gemma":0.0061196135,"teacher_disagreement_score":0.09359816,"about_ca_system_score_codex":0.0009341184,"about_ca_system_score_gemma":0.0012446394,"threshold_uncertainty_score":0.31311703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056952566,0.0005132635,0.9296304,0.0005018361,0.0001636629,0.00011662489,0.00028516355,0.0039899633,0.007846577],"genre_scores_gemma":[0.7310915,0.00021008706,0.25750774,0.00043037132,0.000048541253,0.0002789289,0.0006494203,0.00021515322,0.009568246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997795,0.00004669001,0.000014825259,0.00006146974,0.000053143067,0.000044385928],"domain_scores_gemma":[0.9995096,0.00018112919,0.0000332023,0.000089832945,0.0001382245,0.00004796046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071342196,0.0007889058,0.00072649965,0.0003937371,0.00039331228,0.00077117124,0.0021329476,0.0014687596,0.005504041],"category_scores_gemma":[0.0022535631,0.00045474424,0.0006088217,0.00048605408,0.0006351637,0.0013129001,0.001057215,0.002265917,0.0013370971],"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.0002204033,0.00012855788,0.001273289,0.00007923191,0.000076720484,0.00008019119,0.000049483147,0.839176,0.0035726728,0.014352678,0.0036048095,0.13738587],"study_design_scores_gemma":[0.0000051723896,0.000015088363,0.00005278958,0.000003478312,0.0000046965793,0.000006774952,0.0000020240307,0.99712473,0.0005943683,0.0019263697,0.0002616392,0.0000028274055],"about_ca_topic_score_codex":0.010045187,"about_ca_topic_score_gemma":0.020433752,"teacher_disagreement_score":0.010045187,"about_ca_system_score_codex":0.0013649429,"about_ca_system_score_gemma":0.0014089671,"threshold_uncertainty_score":0.019973457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29175353,0.0042928727,0.59056294,0.003933627,0.002084774,0.002072958,0.02580128,0.037895698,0.041602347],"genre_scores_gemma":[0.5547139,0.0014755839,0.37645862,0.0010496153,0.0004103951,0.00058286416,0.021982128,0.00050075544,0.042826045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989466,0.00014473253,0.00009510584,0.0003648367,0.00034607464,0.000102663624],"domain_scores_gemma":[0.997092,0.00067446183,0.00019452325,0.0004701415,0.0013865493,0.00018225612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012945067,0.0011401626,0.0014762572,0.0016474193,0.00072675996,0.0014320981,0.0018050022,0.0014755685,0.008736827],"category_scores_gemma":[0.0060832277,0.00051179377,0.0012014307,0.0012127513,0.00014882046,0.0014018794,0.0006206077,0.0016161975,0.009971987],"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.0016739996,0.0012311474,0.08625923,0.0009638684,0.0009403433,0.0015598399,0.0006009216,0.036687467,0.035203125,0.00414085,0.19785662,0.6328826],"study_design_scores_gemma":[0.00017052832,0.00076406536,0.06478293,0.00019768882,0.00046806483,0.0016854105,0.00040358334,0.8388566,0.018043125,0.0026028475,0.071729444,0.00029575388],"about_ca_topic_score_codex":0.033968516,"about_ca_topic_score_gemma":0.061839446,"teacher_disagreement_score":0.033968516,"about_ca_system_score_codex":0.0005209632,"about_ca_system_score_gemma":0.00070257735,"threshold_uncertainty_score":0.0675416},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006364346,0.061387703,0.052366998,0.06510371,0.11863831,0.00064384914,0.005269957,0.00520046,0.6850247],"genre_scores_gemma":[0.018817907,0.03242509,0.024403049,0.005529134,0.011976165,0.0003121367,0.00904566,0.0009863697,0.8965044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982607,0.00033165351,0.00013222848,0.00027821452,0.0008372182,0.00016012682],"domain_scores_gemma":[0.9972262,0.00043724955,0.000088030734,0.00036545223,0.0011056354,0.0007773699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002908383,0.0011802353,0.0011400285,0.0014366967,0.0011273448,0.007222287,0.0019019226,0.0020381962,0.14660741],"category_scores_gemma":[0.0050783264,0.00039490845,0.0008452184,0.0013173687,0.0010141095,0.006490507,0.0032464927,0.0043634344,0.069094636],"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.00007198432,0.00010081239,0.00042220793,0.0001492725,0.000027932158,0.000067892724,0.00008870534,0.00013601985,0.0005965083,0.007665691,0.87153727,0.11913571],"study_design_scores_gemma":[0.000007900508,0.000012817163,0.0003472385,0.000081290054,0.000012484984,0.000060600923,0.000048714508,0.00051582826,0.00017389623,0.0021660062,0.99656445,0.0000088355],"about_ca_topic_score_codex":0.0034471408,"about_ca_topic_score_gemma":0.006606008,"teacher_disagreement_score":0.14660741,"about_ca_system_score_codex":0.0013413394,"about_ca_system_score_gemma":0.0023238456,"threshold_uncertainty_score":0.49045068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6872758,0.0018688712,0.2119611,0.016056255,0.00030585667,0.0007276375,0.006907774,0.0028535824,0.07204314],"genre_scores_gemma":[0.9099886,0.0012271004,0.06618581,0.001067762,0.00021285933,0.00046706558,0.004057404,0.00077889266,0.016014438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697304,0.0008341197,0.0001698862,0.00066672993,0.000561573,0.0007947537],"domain_scores_gemma":[0.9874965,0.009958595,0.0006982255,0.0007689496,0.00039398423,0.0006837901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015888738,0.001617074,0.0019952755,0.00073309033,0.0014484146,0.005302313,0.0031471397,0.0028050428,0.017101051],"category_scores_gemma":[0.016205251,0.0010484423,0.0020020744,0.0013172087,0.0018404908,0.0076430566,0.003120228,0.0040430017,0.0016644836],"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.0019971582,0.0007565076,0.0067500263,0.0013320548,0.00035383325,0.0008047623,0.0010290514,0.6930922,0.008356074,0.16123132,0.0335672,0.09072985],"study_design_scores_gemma":[0.00027116077,0.00012259517,0.0014080273,0.00006885451,0.000106292326,0.0002229778,0.00027768142,0.7496882,0.0016535787,0.2420833,0.004054283,0.000042932676],"about_ca_topic_score_codex":0.011676919,"about_ca_topic_score_gemma":0.007962277,"teacher_disagreement_score":0.017101051,"about_ca_system_score_codex":0.0033893725,"about_ca_system_score_gemma":0.0026566465,"threshold_uncertainty_score":0.057208717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56391203,0.00204139,0.39640254,0.00226179,0.00019970194,0.0002312901,0.0004726122,0.00081430306,0.033664405],"genre_scores_gemma":[0.95646924,0.00033738132,0.037974574,0.00022499039,0.00005614925,0.00022287978,0.0004144826,0.000304694,0.0039957054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978556,0.0012831591,0.000058697267,0.00020040195,0.00029170496,0.00031055088],"domain_scores_gemma":[0.9443758,0.0513603,0.0010884951,0.0012238383,0.00091529445,0.0010362203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044280607,0.0010486151,0.0017289033,0.001685822,0.0013134761,0.0019933083,0.0028582038,0.0030156733,0.008284947],"category_scores_gemma":[0.043687284,0.0009702334,0.0013511465,0.0015181272,0.002989588,0.0036951867,0.0017525019,0.0033471545,0.00048816254],"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.00013299436,0.00010998525,0.0017592128,0.000058950078,0.00005494385,0.0000422547,0.0001188834,0.8854066,0.00018394101,0.108272254,0.0010476217,0.0028123993],"study_design_scores_gemma":[0.00001192655,0.000010085623,0.000115071256,0.000008172083,0.00000490256,0.0000053250237,0.000019806535,0.97248197,0.00003885372,0.02719947,0.00009978161,0.000004702343],"about_ca_topic_score_codex":0.018352848,"about_ca_topic_score_gemma":0.015990153,"teacher_disagreement_score":0.018352848,"about_ca_system_score_codex":0.0028474838,"about_ca_system_score_gemma":0.0024295824,"threshold_uncertainty_score":0.03649205},"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":"methods","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017977318,0.00026011426,0.96064955,0.0051709036,0.00016235102,0.00087880413,0.0002196033,0.0020933056,0.012588019],"genre_scores_gemma":[0.26959142,0.00023189193,0.7198464,0.0012556042,0.00010498483,0.0020686053,0.0004093458,0.0008929393,0.00559878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.867625,0.10547496,0.0057211304,0.0055137468,0.013727447,0.00193773],"domain_scores_gemma":[0.7344986,0.20441379,0.0068516186,0.022709176,0.026994321,0.004532545],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.1102686,0.0011946794,0.001758741,0.0021818173,0.0022296612,0.009888913,0.0048483396,0.0037761594,0.010068771],"category_scores_gemma":[0.2646483,0.0013199822,0.0014198986,0.0015816317,0.007846815,0.018239567,0.012683804,0.007836442,0.0019868966],"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.0011474186,0.0006114301,0.0024676004,0.00063121936,0.00020666755,0.0001978582,0.003520165,0.07667667,0.0012601345,0.71014017,0.015669046,0.18747167],"study_design_scores_gemma":[0.00050278986,0.0005561191,0.00050657697,0.0004980379,0.00008065524,0.00013542695,0.0010889159,0.44332293,0.0047313306,0.5103078,0.038127504,0.0001418924],"about_ca_topic_score_codex":0.005085829,"about_ca_topic_score_gemma":0.0049566706,"teacher_disagreement_score":0.8897314,"about_ca_system_score_codex":0.005433915,"about_ca_system_score_gemma":0.0075106774,"threshold_uncertainty_score":0.583163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07459552,0.0009818181,0.5005829,0.03382641,0.0013019722,0.00021208444,0.0009834839,0.0040428205,0.38347298],"genre_scores_gemma":[0.6207063,0.0005938056,0.17223774,0.002403324,0.00014041892,0.000119358876,0.0007945342,0.0009731337,0.20203133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975926,0.00010892117,0.0000050069875,0.00003752602,0.000061565705,0.00002771601],"domain_scores_gemma":[0.9996649,0.00018794209,0.000007481001,0.000053935888,0.000052324838,0.00003334881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051461166,0.0003739699,0.00022468998,0.00020618249,0.0012916711,0.0018873258,0.0005650295,0.0013768033,0.019972425],"category_scores_gemma":[0.003093457,0.00024169874,0.00022619376,0.0003418061,0.0013831261,0.002799911,0.0010215002,0.001773785,0.0021961555],"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.00028046936,0.00010616958,0.0009929782,0.000086811975,0.00001955136,0.0005650019,0.0024257747,0.0119260205,0.0042897905,0.7476992,0.10646848,0.12513974],"study_design_scores_gemma":[0.000078894314,0.00006914874,0.0006745759,0.0000703705,0.000020546022,0.0005936645,0.0014765827,0.13127902,0.009067856,0.519554,0.33707353,0.0000418673],"about_ca_topic_score_codex":0.008282906,"about_ca_topic_score_gemma":0.012032612,"teacher_disagreement_score":0.019972425,"about_ca_system_score_codex":0.0006202053,"about_ca_system_score_gemma":0.0004686916,"threshold_uncertainty_score":0.06681436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27635255,0.00069238705,0.6727447,0.0022894898,0.00021987373,0.0015109588,0.010042447,0.016669877,0.019477675],"genre_scores_gemma":[0.4893019,0.00025723194,0.4948524,0.00039442247,0.000043755856,0.00057283806,0.0077411323,0.00031345378,0.006522878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905163,0.00021263173,0.000056741686,0.0002850588,0.00027482497,0.00011913121],"domain_scores_gemma":[0.9983058,0.0008345898,0.00015719367,0.00019943988,0.00024276519,0.00026020972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007441453,0.0012364502,0.0007095902,0.002440158,0.0008998608,0.001618727,0.0014304509,0.0009047545,0.00440414],"category_scores_gemma":[0.005352027,0.00034135798,0.0008113365,0.001481839,0.00072106376,0.0017519223,0.0022566703,0.0011059464,0.0013115522],"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.0035015438,0.00149254,0.09811616,0.0014442829,0.0005631828,0.0041829194,0.005065577,0.1358547,0.038199537,0.09230294,0.050662607,0.568614],"study_design_scores_gemma":[0.000098045755,0.00023048303,0.015587347,0.00006539382,0.000043058975,0.0005736096,0.0014555701,0.9014501,0.0068728696,0.049178813,0.02437038,0.00007435094],"about_ca_topic_score_codex":0.010576913,"about_ca_topic_score_gemma":0.028295204,"teacher_disagreement_score":0.010576913,"about_ca_system_score_codex":0.00069130823,"about_ca_system_score_gemma":0.0009968076,"threshold_uncertainty_score":0.021030664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037022624,0.00025206248,0.95543593,0.0007557348,0.000036414694,0.00012546491,0.00019468038,0.00037993648,0.0057971864],"genre_scores_gemma":[0.62029654,0.00035568877,0.37025917,0.0003837515,0.00010573335,0.00052731426,0.00055836583,0.00017821118,0.0073351967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848014,0.00076105556,0.000076387354,0.00033702183,0.0002117341,0.00013356615],"domain_scores_gemma":[0.9879483,0.010800896,0.0003692807,0.0004438093,0.00023085118,0.00020674587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030394674,0.0014104358,0.0014323224,0.0004659047,0.00060454657,0.0019252397,0.0013990446,0.0017642464,0.0041043847],"category_scores_gemma":[0.012549576,0.0008992703,0.0008738688,0.0007659895,0.0012897894,0.0026718494,0.002062565,0.0025492157,0.00046029998],"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.000048480364,0.00008003984,0.00046364925,0.00008567283,0.00004326201,0.00013123636,0.000084864776,0.9374775,0.0003547236,0.042209566,0.001263001,0.017757978],"study_design_scores_gemma":[0.00002216249,0.000014589273,0.00005330461,0.000008003904,0.000006076681,0.00001670411,0.00002302298,0.94855,0.00019936162,0.05058771,0.0005141736,0.000004917509],"about_ca_topic_score_codex":0.0038283751,"about_ca_topic_score_gemma":0.0059835366,"teacher_disagreement_score":0.0041043847,"about_ca_system_score_codex":0.0011490346,"about_ca_system_score_gemma":0.0019034377,"threshold_uncertainty_score":0.016074419},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46970874,0.00027088472,0.4202817,0.0024881153,0.0002221875,0.00028792824,0.0010326876,0.00079243764,0.10491527],"genre_scores_gemma":[0.92778194,0.0001804708,0.060172,0.0006913526,0.00014141048,0.00022379731,0.00048426367,0.00017446048,0.010150258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674475,0.0007583769,0.00023232363,0.000963311,0.0007079969,0.000593137],"domain_scores_gemma":[0.9835882,0.010883352,0.0015232286,0.0018207454,0.0008683972,0.0013160494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019036208,0.0005953645,0.0011897575,0.0010614379,0.0018396762,0.0032699285,0.0019420793,0.002136945,0.010844566],"category_scores_gemma":[0.014280349,0.0005778339,0.0013478692,0.0010685638,0.004896982,0.0061721145,0.0024669268,0.0034267204,0.00078434637],"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.0001423236,0.00007820742,0.0008080131,0.00006930756,0.000016667655,0.00021152325,0.00026633247,0.007943978,0.003644396,0.9791419,0.0013597629,0.0063176495],"study_design_scores_gemma":[0.000055354056,0.00008252601,0.00039929544,0.000016628324,0.000014067341,0.0003381108,0.00008546897,0.026610274,0.0016992136,0.96764296,0.003021226,0.000034992467],"about_ca_topic_score_codex":0.0011127854,"about_ca_topic_score_gemma":0.00079972995,"teacher_disagreement_score":0.010844566,"about_ca_system_score_codex":0.001211371,"about_ca_system_score_gemma":0.001064024,"threshold_uncertainty_score":0.036278665},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93087685,0.0015521152,0.010877428,0.0018828802,0.00045402537,0.00017011483,0.0039658737,0.0020222445,0.04819842],"genre_scores_gemma":[0.97364646,0.0003312524,0.012818458,0.00030281892,0.00005574154,0.00013181286,0.009124649,0.00032651858,0.0032623454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995154,0.0015807896,0.0002799375,0.00095958315,0.0011187723,0.00090685213],"domain_scores_gemma":[0.98886967,0.0066458574,0.00060829736,0.0012088915,0.0013706821,0.0012965271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007297532,0.0011973133,0.0009855654,0.0017292282,0.001131337,0.002583896,0.0016142642,0.0014052457,0.004526457],"category_scores_gemma":[0.025483537,0.00056524796,0.0010254126,0.0019142522,0.001653791,0.0020608725,0.0023692448,0.0021676507,0.000926083],"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.0025287028,0.000731581,0.019492552,0.0003905089,0.0004114629,0.00015094437,0.00029297738,0.86488,0.0016338379,0.011304396,0.029734515,0.068448424],"study_design_scores_gemma":[0.0007575862,0.0018011341,0.024351584,0.00014025783,0.00015462033,0.00016366476,0.001127056,0.928846,0.0046359217,0.018432096,0.019486735,0.00010337782],"about_ca_topic_score_codex":0.026040511,"about_ca_topic_score_gemma":0.030990446,"teacher_disagreement_score":0.026040511,"about_ca_system_score_codex":0.0034619572,"about_ca_system_score_gemma":0.0047671255,"threshold_uncertainty_score":0.0517779},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61887145,0.00037125425,0.35003003,0.000613357,0.00016158633,0.00033514225,0.00041470793,0.0009421828,0.028260255],"genre_scores_gemma":[0.7411237,0.00021405276,0.24563627,0.00017392893,0.000024448147,0.00033899007,0.0008164922,0.00023737655,0.011434693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977654,0.00007018973,0.000015826936,0.00006374206,0.000043052445,0.00003064181],"domain_scores_gemma":[0.9991763,0.00049823156,0.0000677758,0.00008764034,0.000097128715,0.00007298593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046508733,0.0006901858,0.00052532717,0.00058761885,0.00048284538,0.0008084741,0.0011618503,0.0009521192,0.0057877763],"category_scores_gemma":[0.004024557,0.00034375573,0.0007840475,0.00032749312,0.00065043545,0.0012799961,0.0013618636,0.0007650778,0.00047376673],"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.00040385773,0.0004799784,0.007258432,0.0004126735,0.00014992317,0.0013162355,0.0019484302,0.65630907,0.033483267,0.14617077,0.0063871155,0.14568025],"study_design_scores_gemma":[0.00007935117,0.00019476548,0.0010266666,0.00003163381,0.000041122425,0.00025629727,0.00025430566,0.93738,0.0041337707,0.046898134,0.009672499,0.000031414645],"about_ca_topic_score_codex":0.001167371,"about_ca_topic_score_gemma":0.0013158,"teacher_disagreement_score":0.0057877763,"about_ca_system_score_codex":0.00063634705,"about_ca_system_score_gemma":0.0003748612,"threshold_uncertainty_score":0.019362092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032476176,0.00042324507,0.91335505,0.0021994624,0.00010341054,0.00033957782,0.00007231974,0.00075392105,0.050276864],"genre_scores_gemma":[0.20841078,0.0008746827,0.77239573,0.0006340663,0.00007191434,0.00048897904,0.00023044083,0.00015185523,0.016741382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985662,0.00059407525,0.000088980545,0.0002589673,0.00038208955,0.000109688175],"domain_scores_gemma":[0.9974009,0.00094713987,0.00018932538,0.0005079455,0.00065346755,0.00030124898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026023448,0.0007904111,0.0005209737,0.00053182564,0.0007890858,0.0027393901,0.0018649057,0.0015796783,0.004321679],"category_scores_gemma":[0.0071182935,0.0006205234,0.00091071834,0.0003882687,0.0029865725,0.0032881282,0.0034943162,0.003995203,0.0018019336],"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.000037486574,0.00013080833,0.0010697147,0.00017831476,0.000020636038,0.00010092536,0.0016717544,0.030170575,0.0047989865,0.92969817,0.002866468,0.029256247],"study_design_scores_gemma":[0.00006023284,0.00015308571,0.00055302476,0.00013364322,0.000029143397,0.00016835172,0.0005210715,0.23682432,0.004703968,0.6678439,0.088971466,0.000037817],"about_ca_topic_score_codex":0.0016047521,"about_ca_topic_score_gemma":0.0018815347,"teacher_disagreement_score":0.004321679,"about_ca_system_score_codex":0.0011574769,"about_ca_system_score_gemma":0.0015281622,"threshold_uncertainty_score":0.014457405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18736427,0.0012859792,0.79950273,0.00090586045,0.000093680945,0.00013870811,0.000045111665,0.0011558399,0.009507852],"genre_scores_gemma":[0.9089766,0.00036139935,0.08860002,0.00015483474,0.00005100447,0.00011857595,0.000044637287,0.000051383377,0.0016413908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876714,0.0005706773,0.000070875074,0.00020424863,0.00025023994,0.0001368312],"domain_scores_gemma":[0.99219394,0.005729101,0.0007159209,0.00061366794,0.00042490897,0.00032252408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021485004,0.0007332115,0.0005930747,0.0005800151,0.0004161712,0.0017705593,0.0012910671,0.0009955206,0.0021900088],"category_scores_gemma":[0.016003717,0.0004858683,0.0004336166,0.0004499931,0.0017932064,0.0022798846,0.0014696723,0.001654658,0.00028633603],"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.00064691534,0.00061499403,0.005803294,0.00045896933,0.00016094322,0.00024774668,0.0010287584,0.6561577,0.009487971,0.10200827,0.0017500821,0.22163437],"study_design_scores_gemma":[0.00007875739,0.00021800931,0.00080137956,0.000023241044,0.000041090596,0.000076006596,0.000058375736,0.948455,0.0017454664,0.047289662,0.0011873468,0.000025765634],"about_ca_topic_score_codex":0.0019589346,"about_ca_topic_score_gemma":0.0018873878,"teacher_disagreement_score":0.0021900088,"about_ca_system_score_codex":0.0010819894,"about_ca_system_score_gemma":0.0009658014,"threshold_uncertainty_score":0.011362433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20234695,0.0027453161,0.53382266,0.0023971188,0.0005033224,0.00024346693,0.00036633268,0.0019227951,0.255652],"genre_scores_gemma":[0.71764714,0.0017133014,0.11835131,0.0002705431,0.00010209922,0.00016031641,0.00031948712,0.0010422958,0.16039352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987457,0.00018386882,0.000055395023,0.00033381392,0.00052876223,0.00015254124],"domain_scores_gemma":[0.9981359,0.0004628393,0.00014240398,0.0006836193,0.0004156058,0.00015950346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017697152,0.0010456917,0.0006629381,0.0014185754,0.003423293,0.00591508,0.0016259877,0.0013006873,0.021280082],"category_scores_gemma":[0.0039526336,0.000767601,0.0011848097,0.0011915909,0.0053868815,0.0046194326,0.004549754,0.0015020531,0.0039576716],"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.0003487525,0.00008256136,0.008750233,0.0008021189,0.00008491254,0.0012767047,0.029227186,0.017248847,0.077833295,0.5344251,0.0067943283,0.32312596],"study_design_scores_gemma":[0.000061950755,0.00063723646,0.02357953,0.000777699,0.00021356437,0.001912044,0.024144663,0.040351447,0.060161103,0.17521916,0.67267704,0.0002645831],"about_ca_topic_score_codex":0.012384917,"about_ca_topic_score_gemma":0.01754309,"teacher_disagreement_score":0.021280082,"about_ca_system_score_codex":0.0023192863,"about_ca_system_score_gemma":0.0030149608,"threshold_uncertainty_score":0.07118899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091894336,0.00016312576,0.8536667,0.00052470557,0.000049626913,0.00010422271,0.00042156814,0.0008152994,0.052360363],"genre_scores_gemma":[0.8768815,0.00009964912,0.1089921,0.00007780526,0.000035559868,0.00011387886,0.00046267197,0.00027130276,0.013065662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.00018456901,0.000033495875,0.000102460624,0.00022197847,0.000077728575],"domain_scores_gemma":[0.9987386,0.0007717351,0.00007312279,0.00017826183,0.00016401122,0.00007421483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064852,0.00034374933,0.00040223973,0.0007943148,0.0008609056,0.0021990896,0.0011758013,0.00073701545,0.010407371],"category_scores_gemma":[0.0036114065,0.00033915802,0.0008263919,0.0004496074,0.0017813246,0.0030534314,0.002488979,0.0013600076,0.0008484045],"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.00006291496,0.00003018356,0.0003455523,0.0000624914,0.000018610543,0.00027495538,0.0011345999,0.025510812,0.003830559,0.9541207,0.0011486378,0.013460159],"study_design_scores_gemma":[0.00002097669,0.000024818168,0.00020490249,0.000022940581,0.0000172816,0.00013122402,0.00036485025,0.3616684,0.002393695,0.6300704,0.005063481,0.000017075621],"about_ca_topic_score_codex":0.0011868277,"about_ca_topic_score_gemma":0.0010126618,"teacher_disagreement_score":0.010407371,"about_ca_system_score_codex":0.0007239559,"about_ca_system_score_gemma":0.00036465417,"threshold_uncertainty_score":0.034816086},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15306918,0.00012897764,0.8324677,0.00025555896,0.000018397455,0.00019617102,0.0011569594,0.0009512733,0.011755869],"genre_scores_gemma":[0.8529372,0.00016903349,0.1418854,0.00004220702,0.0000052279274,0.00017787979,0.001082466,0.00013543999,0.003565137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993266,0.00022125295,0.00004300845,0.00019945257,0.00014172902,0.000067972505],"domain_scores_gemma":[0.99749917,0.0016449845,0.00023616577,0.00028899507,0.0002288818,0.00010174678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170845,0.00080616854,0.00030123375,0.0007823391,0.00028912834,0.001972027,0.0011779867,0.0012188926,0.004828118],"category_scores_gemma":[0.007066244,0.0006282709,0.00076165097,0.00045075963,0.0007911047,0.0038301887,0.0014931323,0.001368173,0.00063346885],"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.00060581154,0.00023044724,0.026026836,0.00078288605,0.00016164845,0.0010222904,0.00929796,0.7418862,0.01781719,0.09306204,0.0022046366,0.10690207],"study_design_scores_gemma":[0.000018227105,0.00008331272,0.002936281,0.000051208037,0.000036239973,0.0001234551,0.000449691,0.97156894,0.0021438985,0.018334012,0.0042264606,0.000028187247],"about_ca_topic_score_codex":0.008568978,"about_ca_topic_score_gemma":0.012925563,"teacher_disagreement_score":0.008568978,"about_ca_system_score_codex":0.000765711,"about_ca_system_score_gemma":0.00092376536,"threshold_uncertainty_score":0.017038167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028959496,0.0052266265,0.80375713,0.020611377,0.00045984003,0.00013719284,0.00018641807,0.0005327827,0.14012915],"genre_scores_gemma":[0.69803363,0.003949705,0.28262267,0.002197538,0.00052621664,0.00043453425,0.00033406552,0.00026540467,0.011636251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973341,0.0014696948,0.00016232031,0.00047987446,0.0003005513,0.00025351788],"domain_scores_gemma":[0.997872,0.00072276045,0.00028603428,0.00049808633,0.00031942737,0.00030166676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032944414,0.0011066815,0.00067935546,0.0026193075,0.0021993022,0.013181908,0.0031164112,0.0032495123,0.00449781],"category_scores_gemma":[0.0040489,0.000600553,0.0010857318,0.0016072684,0.015493686,0.021828098,0.005323366,0.005936199,0.0007852722],"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.0000071403,0.000009952846,0.00012501841,0.000038894425,0.000004445664,0.000029127881,0.0044287913,0.00090457813,0.00015164222,0.98949707,0.0005336912,0.004269605],"study_design_scores_gemma":[0.000013560276,0.000030743377,0.00035066123,0.00016808952,0.00001682134,0.00012664816,0.005546058,0.013299874,0.00033905313,0.9264029,0.053676926,0.000028767177],"about_ca_topic_score_codex":0.004234538,"about_ca_topic_score_gemma":0.00232095,"teacher_disagreement_score":0.013181908,"about_ca_system_score_codex":0.0036453358,"about_ca_system_score_gemma":0.0021783393,"threshold_uncertainty_score":0.026448846},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022469038,0.00045435256,0.97301203,0.00020122874,0.000047529382,0.000091056594,0.00008992865,0.000578837,0.0030560931],"genre_scores_gemma":[0.5866585,0.00050793815,0.40843242,0.00025664538,0.000060909573,0.0005835965,0.00036901218,0.00016027484,0.0029707851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982286,0.00094996934,0.00009658144,0.00022852683,0.00033955803,0.00015675189],"domain_scores_gemma":[0.99627966,0.002636592,0.00034252452,0.00034750233,0.00019414042,0.00019952067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024635133,0.0010994112,0.0014211155,0.0010926443,0.00072657823,0.0016036074,0.0015961104,0.0013799288,0.0038602233],"category_scores_gemma":[0.00922346,0.0006086413,0.0011574295,0.0012746837,0.0014773498,0.0022021385,0.002235831,0.002837979,0.0007090718],"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.00012762724,0.00008629484,0.00064478396,0.00009247592,0.000043198368,0.000036470603,0.00008301014,0.8911077,0.0006173619,0.06858443,0.00089917,0.037677556],"study_design_scores_gemma":[0.0000147619585,0.000026851048,0.000039184535,0.000009380265,0.000005732696,0.0000069650737,0.000007792609,0.9702764,0.000116446805,0.029061357,0.00043114813,0.000003977377],"about_ca_topic_score_codex":0.0033171142,"about_ca_topic_score_gemma":0.003942863,"teacher_disagreement_score":0.0038602233,"about_ca_system_score_codex":0.0015820196,"about_ca_system_score_gemma":0.0018630339,"threshold_uncertainty_score":0.013028502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37044358,0.0012691678,0.6178836,0.0007618293,0.00010154623,0.0002005734,0.00022056869,0.0035196408,0.0055995234],"genre_scores_gemma":[0.9311836,0.000102622005,0.06679631,0.00023073552,0.000040459814,0.000075765056,0.00026955016,0.000101028214,0.0011999612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867153,0.00063904026,0.00008169034,0.0002669017,0.00021382743,0.0001270284],"domain_scores_gemma":[0.9928981,0.0049968134,0.00043250737,0.0008400262,0.0005425256,0.0002899312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027374378,0.0010198263,0.0017717023,0.000825551,0.00059784146,0.001189114,0.002325832,0.0017717658,0.0017439905],"category_scores_gemma":[0.014462729,0.00058231474,0.00057149027,0.00056212314,0.0013804651,0.0032234585,0.0018701053,0.0019338928,0.0005016895],"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.0006063032,0.00063543,0.0073474934,0.00016682898,0.000107615546,0.00009853335,0.00017537197,0.8096103,0.002141433,0.010525571,0.002820676,0.16576448],"study_design_scores_gemma":[0.000019489113,0.000042277534,0.00018438141,0.000004865471,0.000004088317,0.000007722247,0.000007734149,0.9961565,0.00029094314,0.0031954693,0.000083162544,0.0000033123956],"about_ca_topic_score_codex":0.005961385,"about_ca_topic_score_gemma":0.008217532,"teacher_disagreement_score":0.005961385,"about_ca_system_score_codex":0.0012785462,"about_ca_system_score_gemma":0.0013625356,"threshold_uncertainty_score":0.014477074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002442513,0.022094795,0.0011379059,0.051984668,0.90746534,0.00004269895,0.00033445648,0.00026062652,0.016435191],"genre_scores_gemma":[0.0025851147,0.019119205,0.00043113463,0.016909378,0.9092926,0.000057892084,0.0002737294,0.00017759585,0.051153336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864286,0.00017103094,0.000110224915,0.00031130138,0.0005701904,0.0001943172],"domain_scores_gemma":[0.99639195,0.0012414501,0.0002327274,0.0001618399,0.0010452433,0.0009268471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014327324,0.0019789916,0.0015984747,0.0015205455,0.0012827055,0.0057495157,0.0022025984,0.0064715752,0.0954713],"category_scores_gemma":[0.0068893447,0.00055019924,0.0013547796,0.0006380168,0.0013348166,0.00374863,0.0020417336,0.00877501,0.027954737],"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.000040933006,0.000018057448,0.00006327747,0.0002125413,0.000012584833,0.00007799311,0.000013384902,0.00009714456,0.00011002358,0.0025276374,0.9802515,0.016574768],"study_design_scores_gemma":[0.000023381408,0.000023969553,0.00014093038,0.0002238893,0.000013374621,0.00012899596,0.000021418697,0.00025786736,0.0001301068,0.0031463427,0.99588025,0.00000953633],"about_ca_topic_score_codex":0.0009827099,"about_ca_topic_score_gemma":0.0018171992,"teacher_disagreement_score":0.0954713,"about_ca_system_score_codex":0.0018407519,"about_ca_system_score_gemma":0.0013654922,"threshold_uncertainty_score":0.31938326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88088214,0.00027266456,0.11682855,0.0002580933,0.000022153808,0.000043919415,0.00016990135,0.00034644175,0.0011761244],"genre_scores_gemma":[0.99003196,0.00003786671,0.009365806,0.000019970363,0.0000062083036,0.0000096376425,0.00013323057,0.000011384914,0.00038391596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992792,0.00025037248,0.000048401023,0.00020645953,0.00012211564,0.000093459814],"domain_scores_gemma":[0.9954856,0.003110978,0.00056542765,0.00024636384,0.00032254128,0.0002690596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018963848,0.00067033264,0.0010177438,0.0008122478,0.00036857996,0.00085475313,0.0010349472,0.0007200282,0.00062339753],"category_scores_gemma":[0.009197087,0.000534661,0.00025878937,0.0004211068,0.00081831246,0.0015218548,0.0011432312,0.0010369315,0.00019218316],"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.0007371457,0.0001895801,0.029903928,0.000071358256,0.000088460816,0.00017898827,0.00020580784,0.9137165,0.0015453706,0.0023859688,0.000730433,0.05024652],"study_design_scores_gemma":[0.0000067456454,0.00002552329,0.0022818095,0.0000038220014,0.0000034140633,0.00001130652,0.000016083679,0.99577373,0.00035115168,0.0014668141,0.000054854554,0.000004782996],"about_ca_topic_score_codex":0.015183273,"about_ca_topic_score_gemma":0.012580174,"teacher_disagreement_score":0.015183273,"about_ca_system_score_codex":0.00080844667,"about_ca_system_score_gemma":0.00071150693,"threshold_uncertainty_score":0.030189812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2450215,0.00086566684,0.6165301,0.005433858,0.0006741743,0.00074321235,0.00075240206,0.002480557,0.12749861],"genre_scores_gemma":[0.6376697,0.0004846628,0.33208612,0.00072363287,0.000120175326,0.0002520659,0.00089929637,0.00039222548,0.027372058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972319,0.00086061284,0.00015440125,0.00072718336,0.0005512605,0.00047469346],"domain_scores_gemma":[0.99450594,0.003629749,0.00042840786,0.000576747,0.0004613694,0.00039768397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020396265,0.001262956,0.0010333458,0.0008678359,0.0021706903,0.0031459208,0.0018786455,0.002410403,0.014696961],"category_scores_gemma":[0.013114061,0.00075170276,0.0016330602,0.00059257186,0.0037749938,0.004153038,0.004323009,0.002632515,0.0013928536],"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.00053532067,0.0004099188,0.0063374513,0.00072641246,0.00021846082,0.000568452,0.0014030532,0.10950278,0.007732676,0.7197859,0.022521188,0.1302584],"study_design_scores_gemma":[0.00028022027,0.00033968798,0.0015705156,0.00020505517,0.00012443883,0.0005982683,0.0012349075,0.3179394,0.008702919,0.61245716,0.056454822,0.00009262468],"about_ca_topic_score_codex":0.0049314853,"about_ca_topic_score_gemma":0.006482091,"teacher_disagreement_score":0.014696961,"about_ca_system_score_codex":0.0017526178,"about_ca_system_score_gemma":0.003029354,"threshold_uncertainty_score":0.049166203},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019364499,0.001066162,0.23584619,0.0007089208,0.00043105424,0.00016647602,0.0014792958,0.0029817522,0.73795563],"genre_scores_gemma":[0.37519187,0.0014923343,0.13240866,0.00028361595,0.00018952916,0.00023248844,0.004441525,0.0012687545,0.48449123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997347,0.000040061503,0.000017193699,0.00008337034,0.00008741662,0.000037366826],"domain_scores_gemma":[0.99971014,0.00008289681,0.000015842981,0.000097767086,0.000054721782,0.000038621947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019920402,0.0010413805,0.0006013053,0.0006564129,0.00075659214,0.0020254652,0.0011018799,0.0006787058,0.11059418],"category_scores_gemma":[0.0014780697,0.00044476686,0.0005590855,0.00087384426,0.00072643737,0.0022729414,0.0012486011,0.0014690176,0.020191172],"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.0001941289,0.0001000436,0.0003649326,0.0002366268,0.000033349985,0.00009168251,0.00011804826,0.02124395,0.0031583929,0.62293273,0.06731104,0.28421512],"study_design_scores_gemma":[0.000076893455,0.000079245234,0.00079622306,0.00011587026,0.000026916001,0.00022036197,0.00008061216,0.051838428,0.003091141,0.71310425,0.23053698,0.00003313005],"about_ca_topic_score_codex":0.0011879824,"about_ca_topic_score_gemma":0.001940371,"teacher_disagreement_score":0.11059418,"about_ca_system_score_codex":0.00090345537,"about_ca_system_score_gemma":0.00065085466,"threshold_uncertainty_score":0.36997437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42668495,0.00088139577,0.41103947,0.010953616,0.0005983131,0.000641093,0.0011809331,0.0005098049,0.1475105],"genre_scores_gemma":[0.9119033,0.00044103296,0.042597614,0.00079222233,0.0002596492,0.00027339085,0.00062261435,0.00020722492,0.04290285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828976,0.00086806586,0.00006658876,0.00026008842,0.00017631355,0.00033910866],"domain_scores_gemma":[0.9922903,0.005895806,0.00030422307,0.0003057562,0.00022969833,0.00097414217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021776739,0.001650648,0.0029937937,0.00086553145,0.0024578855,0.00453207,0.0040062196,0.008717724,0.026659794],"category_scores_gemma":[0.013508364,0.0009802819,0.0018923753,0.0011562416,0.0034877919,0.0056277,0.0040064994,0.0057560806,0.0009462928],"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.0009414443,0.00043034795,0.00080144004,0.0002661751,0.00015057062,0.00088816165,0.0005484069,0.123225465,0.0009759679,0.8416569,0.01675494,0.0133601185],"study_design_scores_gemma":[0.00034062567,0.00014291465,0.00036228204,0.000041315863,0.000050807652,0.00012173196,0.00040515602,0.3824544,0.00022936727,0.6127242,0.0030701486,0.000057114557],"about_ca_topic_score_codex":0.009139488,"about_ca_topic_score_gemma":0.006597624,"teacher_disagreement_score":0.026659794,"about_ca_system_score_codex":0.0024524375,"about_ca_system_score_gemma":0.0023000524,"threshold_uncertainty_score":0.08918589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3440039,0.0012686714,0.64296424,0.0009997995,0.0001643168,0.00007028698,0.00009865032,0.0019518028,0.008478317],"genre_scores_gemma":[0.93446726,0.00021828382,0.063169524,0.00016324507,0.000019077412,0.000024680661,0.00007471196,0.000031900367,0.0018313258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.00008016339,0.000017020664,0.00006706447,0.00007209466,0.00006823],"domain_scores_gemma":[0.99968576,0.00014486781,0.000029970466,0.00004066765,0.000068831134,0.000029974239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064671005,0.00062288705,0.0004744498,0.00049192907,0.00031493508,0.00088280486,0.000652208,0.000781464,0.000826525],"category_scores_gemma":[0.001945553,0.00032080067,0.00038511635,0.0005792395,0.0006409232,0.0016198532,0.0008632923,0.0010480897,0.00018841244],"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.00032074313,0.00023773404,0.0056761173,0.0001127144,0.00012493705,0.00025312777,0.00018506,0.6034319,0.021297975,0.01808459,0.0017179985,0.3485571],"study_design_scores_gemma":[0.0000029304501,0.000019240504,0.0006236683,0.0000044099556,0.000007198612,0.000013162079,0.0000086849805,0.9931837,0.0023856224,0.0034260731,0.000319332,0.0000059946055],"about_ca_topic_score_codex":0.010895547,"about_ca_topic_score_gemma":0.010269731,"teacher_disagreement_score":0.010895547,"about_ca_system_score_codex":0.0010083123,"about_ca_system_score_gemma":0.0007532473,"threshold_uncertainty_score":0.021664262},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001314481,0.000624793,0.02381379,0.0013624458,0.0006425429,0.00013148565,0.0021991895,0.0072348705,0.9626764],"genre_scores_gemma":[0.011538598,0.0008247797,0.007244145,0.00076789624,0.00021983587,0.00015210996,0.0046996237,0.0009721516,0.97358096],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995572,0.000076169956,0.000014554074,0.00009901868,0.00019684856,0.000056270837],"domain_scores_gemma":[0.9993068,0.00011395441,0.000019622868,0.0003090694,0.00014795239,0.00010258093],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004095456,0.0009992488,0.00051723747,0.0015002163,0.00097261573,0.0029686296,0.0011182427,0.0012297865,0.51863205],"category_scores_gemma":[0.0019628922,0.00031904448,0.00045754111,0.0011327788,0.000654559,0.0029500409,0.0025978386,0.0012701971,0.40462914],"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.00007865615,0.00009576046,0.00036737206,0.00014098916,0.000014033874,0.00011143241,0.00014365425,0.00054074876,0.0028247454,0.05510069,0.6009902,0.33959168],"study_design_scores_gemma":[0.000011887381,0.000010437716,0.00021957258,0.00003497249,0.0000047696058,0.000062858155,0.000035659985,0.0007749159,0.00055384176,0.009115872,0.98916954,0.000005698321],"about_ca_topic_score_codex":0.0024703247,"about_ca_topic_score_gemma":0.002946013,"teacher_disagreement_score":0.51863205,"about_ca_system_score_codex":0.0005422578,"about_ca_system_score_gemma":0.0008102356,"threshold_uncertainty_score":0.68661296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050005622,0.010786059,0.73183984,0.06432147,0.0025343809,0.00058853417,0.00073965616,0.0016931132,0.13749138],"genre_scores_gemma":[0.42623398,0.0065269843,0.5133267,0.007562194,0.0014386575,0.0009657363,0.0014355944,0.0006643805,0.041845806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975441,0.0013409936,0.000069503636,0.00037777825,0.00051197846,0.00015568886],"domain_scores_gemma":[0.9937477,0.0041374196,0.00019851244,0.00062781444,0.00054154545,0.0007469786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003772688,0.0009807901,0.0011781843,0.0007808294,0.0028716405,0.00466689,0.003438527,0.0019612284,0.014254276],"category_scores_gemma":[0.013759588,0.0005203729,0.00063302286,0.0009469746,0.0038931707,0.0089870505,0.004964871,0.0059094722,0.0027834743],"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.00044234993,0.0002923063,0.002027617,0.0006542672,0.000070559916,0.00011133627,0.0014819531,0.01693523,0.0014659594,0.67695814,0.050381105,0.24917912],"study_design_scores_gemma":[0.000079409256,0.00013358198,0.0007534909,0.0002309847,0.000017484286,0.00010686763,0.0011540262,0.095329925,0.0016595663,0.7796156,0.120844565,0.00007461296],"about_ca_topic_score_codex":0.008076472,"about_ca_topic_score_gemma":0.010180045,"teacher_disagreement_score":0.014254276,"about_ca_system_score_codex":0.0019574855,"about_ca_system_score_gemma":0.0047609373,"threshold_uncertainty_score":0.047685266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017636046,0.00036704403,0.95985144,0.00013486708,0.000089518755,0.00020239112,0.00013536356,0.0013911764,0.020192271],"genre_scores_gemma":[0.37174147,0.00073686393,0.60603046,0.00017403784,0.000042561314,0.00039729528,0.0006452498,0.00020978121,0.020022316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994006,0.000084618936,0.00003265712,0.00023674686,0.00017115385,0.0000741943],"domain_scores_gemma":[0.9990408,0.00031601122,0.0001037901,0.00023853141,0.00021221656,0.0000886477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004652419,0.0011119547,0.00070680963,0.0009389437,0.0013269167,0.0013258291,0.0019836437,0.0013958133,0.007836998],"category_scores_gemma":[0.0022324603,0.00039442576,0.000765533,0.0010250849,0.0010459906,0.0019203394,0.0024076195,0.0008442617,0.0019021573],"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.00024508094,0.00027250947,0.002000317,0.00045401158,0.00011890584,0.000323323,0.00065685395,0.25248536,0.01984926,0.12992825,0.018124726,0.57554144],"study_design_scores_gemma":[0.00011983656,0.0003957461,0.0010672084,0.00007027898,0.000089434725,0.0008910276,0.0004463403,0.8083749,0.012958411,0.10093248,0.07457102,0.0000833245],"about_ca_topic_score_codex":0.0066711144,"about_ca_topic_score_gemma":0.0073728887,"teacher_disagreement_score":0.007836998,"about_ca_system_score_codex":0.0007096508,"about_ca_system_score_gemma":0.0017002521,"threshold_uncertainty_score":0.026217341},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015441193,0.0035454829,0.019272825,0.018925622,0.025144463,0.0010605418,0.015557907,0.008797804,0.8922542],"genre_scores_gemma":[0.043591753,0.0017820598,0.0128248315,0.0032313499,0.0024830378,0.0005804718,0.04182868,0.0019761173,0.8917017],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790925,0.00020534194,0.00005212302,0.00028251836,0.001068374,0.0004823537],"domain_scores_gemma":[0.9964994,0.00013382509,0.00005892992,0.00013592448,0.0008609584,0.002310895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034330508,0.0015857228,0.0011623297,0.001551163,0.003689395,0.007940732,0.002506983,0.002616073,0.17161198],"category_scores_gemma":[0.002856067,0.00055672525,0.0010728376,0.0009049446,0.0008726831,0.0027847083,0.004720674,0.003864597,0.09826668],"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.00042507314,0.00022213429,0.00027621078,0.00008044602,0.000016355,0.00007264533,0.00005049253,0.0004923698,0.0007043173,0.00541177,0.96439004,0.027858138],"study_design_scores_gemma":[0.00009656873,0.0001299774,0.00079787854,0.00003831667,0.000007060225,0.000060953476,0.000100740064,0.0016810666,0.00074033265,0.003047838,0.99327725,0.000021966971],"about_ca_topic_score_codex":0.01130516,"about_ca_topic_score_gemma":0.037644282,"teacher_disagreement_score":0.17161198,"about_ca_system_score_codex":0.0028830941,"about_ca_system_score_gemma":0.0050689224,"threshold_uncertainty_score":0.5740993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32152328,0.0030107726,0.54456586,0.002472304,0.00011255226,0.0005683344,0.000645983,0.0005125467,0.12658842],"genre_scores_gemma":[0.8377794,0.0006848239,0.1532768,0.000075504075,0.000017366432,0.00020347488,0.00046218472,0.0001123935,0.007388079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889886,0.0007899257,0.00003748736,0.000104705636,0.00012369303,0.000045241854],"domain_scores_gemma":[0.99682176,0.002395071,0.00024686844,0.00019113775,0.00015807974,0.00018717875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174879,0.00054756406,0.0002292504,0.0010508231,0.0011043987,0.00548469,0.0006451953,0.0005508654,0.0053043603],"category_scores_gemma":[0.0078495955,0.00039152318,0.00056685245,0.00067044416,0.0022171987,0.005059348,0.0020414537,0.00097621174,0.00054186024],"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.0002833521,0.0001666797,0.005712557,0.00072323007,0.000048002104,0.00043496472,0.054469462,0.013750185,0.007845506,0.8181617,0.0031974057,0.09520695],"study_design_scores_gemma":[0.000095358184,0.00030042682,0.007809925,0.0008269783,0.00008832565,0.00087196124,0.035216454,0.14327759,0.009454153,0.64350224,0.15847848,0.00007802819],"about_ca_topic_score_codex":0.000981269,"about_ca_topic_score_gemma":0.0022511745,"teacher_disagreement_score":0.00548469,"about_ca_system_score_codex":0.001274642,"about_ca_system_score_gemma":0.000754981,"threshold_uncertainty_score":0.017744899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19961524,0.0010653002,0.7620644,0.0010348473,0.00038574755,0.0003083971,0.0006585007,0.011644876,0.023222672],"genre_scores_gemma":[0.7021211,0.00026861683,0.27465,0.0009823637,0.00005600434,0.00024931144,0.0012589128,0.00017663628,0.02023708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997243,0.00003186944,0.0000103508355,0.000057536487,0.00011496728,0.000060905248],"domain_scores_gemma":[0.9998017,0.00003572587,0.000011071095,0.000027376775,0.00008997067,0.00003411692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037922166,0.0008029596,0.0006311941,0.0006265855,0.00037796586,0.00072920026,0.0019680676,0.0010006222,0.0043427674],"category_scores_gemma":[0.00067778275,0.0003584252,0.00052277814,0.0005993419,0.00033461308,0.0015032522,0.0014218303,0.0012884457,0.0009955098],"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.0004939799,0.0007780119,0.0038446018,0.00020356376,0.000303637,0.00031971323,0.000096105,0.36890197,0.028856887,0.013611517,0.018918011,0.56367207],"study_design_scores_gemma":[0.000010760341,0.000039694354,0.0002589066,0.0000057345587,0.000009734823,0.000020249989,0.0000048315765,0.99532807,0.002044148,0.0011994909,0.0010712285,0.0000071881745],"about_ca_topic_score_codex":0.008190299,"about_ca_topic_score_gemma":0.014023953,"teacher_disagreement_score":0.008190299,"about_ca_system_score_codex":0.00092404033,"about_ca_system_score_gemma":0.00084853504,"threshold_uncertainty_score":0.01628524},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037697155,0.0015332615,0.92956907,0.000266042,0.00049964385,0.00007718194,0.00011886828,0.0041561676,0.06001003],"genre_scores_gemma":[0.06944708,0.0019725002,0.7842994,0.000723821,0.00039046656,0.00013150208,0.00051195483,0.0026543334,0.13986894],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923086,0.00008763519,0.000026628939,0.00012967139,0.00046263743,0.000062481435],"domain_scores_gemma":[0.9995623,0.0001046867,0.000029558556,0.00010043398,0.00017655296,0.000026392518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068619166,0.0012611252,0.0004581576,0.0008456821,0.00054713077,0.0018181639,0.0012801582,0.00131425,0.022181358],"category_scores_gemma":[0.0010311853,0.0005322372,0.00067638635,0.00052994926,0.00092697993,0.0013752012,0.0012273331,0.0013502679,0.010964406],"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.00022987611,0.000059682072,0.00035982326,0.00046155692,0.000077610675,0.00035638217,0.0005089903,0.015531805,0.08577786,0.14363295,0.037628096,0.7153754],"study_design_scores_gemma":[0.00007888083,0.00022375085,0.00062399724,0.0002832757,0.00009659945,0.00212779,0.00018781165,0.10373129,0.12472462,0.04879799,0.718992,0.00013207193],"about_ca_topic_score_codex":0.001174425,"about_ca_topic_score_gemma":0.0021088677,"teacher_disagreement_score":0.022181358,"about_ca_system_score_codex":0.0004691102,"about_ca_system_score_gemma":0.0006410705,"threshold_uncertainty_score":0.07420403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007096462,0.0042977002,0.0014753086,0.011602939,0.008082058,0.000033176322,0.0010016649,0.0005862462,0.97221136],"genre_scores_gemma":[0.0049047237,0.0023311507,0.0004598924,0.0026262472,0.00083481515,0.000028292972,0.00076106493,0.00032464002,0.9877292],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994299,0.00008436517,0.000018544679,0.000058492187,0.00032394865,0.00008468842],"domain_scores_gemma":[0.9994491,0.00010938008,0.00001484333,0.00007092651,0.00020058917,0.00015503168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037926162,0.0006120568,0.00037629067,0.00081607833,0.0031063214,0.010376257,0.0010089567,0.0021712035,0.29251164],"category_scores_gemma":[0.0017879928,0.00034056243,0.0004150085,0.0013804204,0.0013393289,0.006331879,0.003912645,0.0027785152,0.14119697],"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.0000123659465,0.00000799095,0.0000376899,0.000044944354,9.0619505e-7,0.00005849669,0.00024911706,0.000033875604,0.000079595346,0.025139352,0.9462365,0.028099302],"study_design_scores_gemma":[7.9216494e-7,0.0000015439472,0.000029353296,0.000023608227,3.5690485e-7,0.0000427022,0.00011982525,0.000012742728,0.000033540167,0.0009901642,0.99874395,0.0000014978898],"about_ca_topic_score_codex":0.0046034832,"about_ca_topic_score_gemma":0.0077446057,"teacher_disagreement_score":0.29251164,"about_ca_system_score_codex":0.0023298785,"about_ca_system_score_gemma":0.0015199606,"threshold_uncertainty_score":0.97854894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013196078,0.000506704,0.9837316,0.00022785398,0.000038467235,0.000069802125,0.00008342166,0.0005931076,0.0015529225],"genre_scores_gemma":[0.51656127,0.0005979082,0.47722408,0.00048003686,0.000112198766,0.00039002477,0.0007839735,0.0003350502,0.0035154712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.00044853578,0.000045554818,0.00020896901,0.00018832275,0.00011964839],"domain_scores_gemma":[0.9941843,0.0044787214,0.00030463695,0.00031144213,0.00051501876,0.00020587914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021307059,0.0011616594,0.002290659,0.001534641,0.0007589155,0.0011508683,0.0017971309,0.0017120595,0.004424837],"category_scores_gemma":[0.009852847,0.0009804608,0.0012120295,0.0016329956,0.0009959575,0.0019721612,0.0015806705,0.0025290705,0.0008025835],"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.000063393076,0.000065010805,0.0010700459,0.00006372597,0.000066034954,0.000050527917,0.00004250201,0.92174757,0.00036080918,0.015116756,0.0025500443,0.058803566],"study_design_scores_gemma":[0.0000050491576,0.0000051397114,0.00002917599,0.0000026011417,0.00000249818,0.000004366737,0.0000019659105,0.9969777,0.00004764383,0.002794228,0.00012797904,0.0000017021166],"about_ca_topic_score_codex":0.011261257,"about_ca_topic_score_gemma":0.013784619,"teacher_disagreement_score":0.011261257,"about_ca_system_score_codex":0.0012693125,"about_ca_system_score_gemma":0.00269041,"threshold_uncertainty_score":0.022391438},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04756237,0.0011912191,0.93227285,0.00081382657,0.00013683515,0.0002132972,0.00031388528,0.00046075223,0.017034931],"genre_scores_gemma":[0.58727425,0.0007702765,0.40078837,0.00048569246,0.00011364657,0.0010511106,0.0008270137,0.00043768281,0.008251931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988919,0.00058046373,0.000047451536,0.00012162511,0.00022979603,0.00012878409],"domain_scores_gemma":[0.98775804,0.0109637845,0.00028685926,0.000248301,0.00042770468,0.00031545068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028636695,0.0009791665,0.0027247418,0.0019510763,0.0011166168,0.0016280403,0.0019089582,0.003974525,0.009205437],"category_scores_gemma":[0.018387824,0.0015112349,0.0012617331,0.0019729366,0.0019139351,0.002384584,0.0023208638,0.0024901358,0.00084026216],"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.00006334906,0.000035182376,0.00019935748,0.00006800207,0.00002326092,0.000031482763,0.00003399949,0.9650455,0.00008381884,0.026412541,0.00076415227,0.007239404],"study_design_scores_gemma":[0.00001774699,0.000008956905,0.000023568682,0.000012704847,0.000004138691,0.000004172078,0.0000047513636,0.9854473,0.000029785819,0.014239622,0.00020440388,0.0000029636028],"about_ca_topic_score_codex":0.010759649,"about_ca_topic_score_gemma":0.01149081,"teacher_disagreement_score":0.010759649,"about_ca_system_score_codex":0.001971647,"about_ca_system_score_gemma":0.0035380812,"threshold_uncertainty_score":0.030795217},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2777145,0.0021346435,0.27721056,0.0025219922,0.00072083523,0.003961639,0.001098221,0.0026024892,0.4320352],"genre_scores_gemma":[0.83276737,0.001169657,0.10306422,0.0015778125,0.000116499745,0.0050537735,0.0010973187,0.00045723902,0.05469612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959174,0.0016646066,0.00027374236,0.00075194665,0.0011589853,0.00023329725],"domain_scores_gemma":[0.99190885,0.004316335,0.00043142674,0.0019978213,0.0008643891,0.00048111644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036277696,0.0010489183,0.00047311705,0.0012347014,0.0009991203,0.002340433,0.0018286427,0.00095587166,0.020690555],"category_scores_gemma":[0.015907034,0.0003671173,0.0006674172,0.00049015466,0.0030559,0.0015936125,0.003502007,0.0013537458,0.0028775174],"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.0013236114,0.0038200142,0.03047909,0.0041027647,0.0002773193,0.00078597927,0.03097037,0.0061534247,0.08404421,0.19723664,0.026475478,0.6143311],"study_design_scores_gemma":[0.0006420529,0.0053065005,0.07226395,0.0019080896,0.00029534532,0.0032549454,0.0077886777,0.025189895,0.033750612,0.15484552,0.69446456,0.00028994566],"about_ca_topic_score_codex":0.0007519775,"about_ca_topic_score_gemma":0.0015634975,"teacher_disagreement_score":0.020690555,"about_ca_system_score_codex":0.00086067844,"about_ca_system_score_gemma":0.0007396688,"threshold_uncertainty_score":0.06921685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8887161,0.00077017024,0.02369829,0.0031950201,0.0005865629,0.00009720931,0.0003797746,0.0005003549,0.08205656],"genre_scores_gemma":[0.9752552,0.0004144136,0.008121871,0.0002120531,0.00007791207,0.000028681277,0.0002904421,0.00012724067,0.015472198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993092,0.00008177198,0.00003674093,0.000119509954,0.00025637553,0.00019646331],"domain_scores_gemma":[0.9981178,0.000505426,0.00028130805,0.00013137037,0.00028690966,0.0006772451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076156855,0.00040395473,0.0005331572,0.00046168285,0.00096231344,0.0020899752,0.0009006814,0.001288761,0.017343657],"category_scores_gemma":[0.0054263566,0.00025468157,0.00032553793,0.0002673561,0.0006452903,0.0027886715,0.0008878655,0.0006413287,0.0078000524],"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.004050288,0.0016721481,0.21274947,0.002052266,0.0006044129,0.004063783,0.0038139317,0.020268794,0.11393695,0.030225735,0.028225373,0.5783369],"study_design_scores_gemma":[0.00037064168,0.006527195,0.54977506,0.00083379546,0.00057426206,0.0073459423,0.030548487,0.11382316,0.057088383,0.04949241,0.18287887,0.0007416882],"about_ca_topic_score_codex":0.003323355,"about_ca_topic_score_gemma":0.005526373,"teacher_disagreement_score":0.017343657,"about_ca_system_score_codex":0.00039394308,"about_ca_system_score_gemma":0.00043313697,"threshold_uncertainty_score":0.058020353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024699004,0.00028703897,0.9664668,0.00047968377,0.00006575894,0.00005214601,0.000022378004,0.000062682484,0.007864493],"genre_scores_gemma":[0.83039254,0.00071839703,0.16129471,0.00014578483,0.0001334392,0.00022294007,0.00005084017,0.000060455037,0.006980835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983728,0.0009732779,0.000086557164,0.00015185373,0.0002893199,0.0001261835],"domain_scores_gemma":[0.9907601,0.0077618714,0.00046939802,0.00027563213,0.00043454632,0.0002985762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028998165,0.0010213946,0.00092567847,0.0010882663,0.00071979396,0.0014607434,0.0011293627,0.0010635812,0.0046206517],"category_scores_gemma":[0.014575611,0.0006544661,0.0012965588,0.00089251355,0.0019389004,0.0016731515,0.0018766258,0.0018322582,0.0002344602],"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.000037853642,0.0000728241,0.00058233977,0.000068829824,0.000057670502,0.000057207846,0.00015998789,0.4469394,0.0006316002,0.5310567,0.00052862335,0.019806983],"study_design_scores_gemma":[0.000019136247,0.000031447333,0.00009832021,0.000010900167,0.000010901946,0.00001325155,0.000018438968,0.7030055,0.00014238432,0.2958471,0.0007944503,0.000008181767],"about_ca_topic_score_codex":0.0036869873,"about_ca_topic_score_gemma":0.0036629566,"teacher_disagreement_score":0.0046206517,"about_ca_system_score_codex":0.0015075383,"about_ca_system_score_gemma":0.0015684061,"threshold_uncertainty_score":0.015457571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10692012,0.00023214339,0.8851336,0.0007838513,0.00004985547,0.00015135636,0.00029383117,0.0013077726,0.005127403],"genre_scores_gemma":[0.8517635,0.00013154466,0.14538282,0.00023241242,0.0000323378,0.00011685762,0.00029541232,0.00014102094,0.001904113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645776,0.0019008125,0.00020456962,0.0005531176,0.000534944,0.00034881296],"domain_scores_gemma":[0.9855078,0.012357564,0.00053303095,0.00084486516,0.0004107933,0.0003459541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047662887,0.0007239546,0.0016504577,0.0008311131,0.0009738698,0.001985615,0.002053686,0.0016595656,0.002758749],"category_scores_gemma":[0.026735358,0.00063928403,0.0007033384,0.00075432047,0.002222597,0.0035691576,0.002242548,0.0029229175,0.0004509769],"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.0008350388,0.00027627326,0.004875476,0.00022635596,0.00011306088,0.00024265001,0.0007103412,0.76405823,0.0019690965,0.14265648,0.0025150303,0.08152203],"study_design_scores_gemma":[0.00003920889,0.000025007732,0.00020960555,0.000010226261,0.000009280107,0.00001899437,0.000037584792,0.9413453,0.00080393907,0.05707865,0.0004105463,0.000011673424],"about_ca_topic_score_codex":0.009331248,"about_ca_topic_score_gemma":0.008411244,"teacher_disagreement_score":0.009331248,"about_ca_system_score_codex":0.0019885595,"about_ca_system_score_gemma":0.0034002652,"threshold_uncertainty_score":0.025206804},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039321952,0.0052623833,0.0017972711,0.007835075,0.027513035,0.00041289182,0.021075716,0.002121148,0.9335893],"genre_scores_gemma":[0.002090717,0.0050231623,0.001168754,0.00062451715,0.002764394,0.00026081761,0.00981019,0.0020482491,0.97620904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970126,0.00031039686,0.00022189855,0.00032494645,0.0018672033,0.00026293442],"domain_scores_gemma":[0.98551,0.0010803923,0.0005367286,0.00092232606,0.010029577,0.0019209353],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022013152,0.001498488,0.002429996,0.016937638,0.004838193,0.020385839,0.0018852915,0.0023087347,0.6272565],"category_scores_gemma":[0.020275254,0.0006946387,0.00086394657,0.028953863,0.0014660353,0.0041175657,0.004111235,0.0030399617,0.597727],"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.000006763427,0.000011117409,0.000031486423,0.00016234934,0.000001242586,0.0000059976096,0.000040451196,0.000026921905,0.000029151886,0.002153546,0.9756186,0.021912381],"study_design_scores_gemma":[0.000005097935,0.0000054456364,0.00027018337,0.00047755538,0.000002841653,0.000011706351,0.00013161321,0.00004031862,0.00007316282,0.0014817175,0.9974942,0.0000061402006],"about_ca_topic_score_codex":0.032352854,"about_ca_topic_score_gemma":0.054984085,"teacher_disagreement_score":0.6272565,"about_ca_system_score_codex":0.007261107,"about_ca_system_score_gemma":0.015852792,"threshold_uncertainty_score":0.5316733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07590533,0.0021153982,0.7548569,0.005943328,0.00032840195,0.000105985484,0.00068504334,0.00013190082,0.15992776],"genre_scores_gemma":[0.92195624,0.0019015973,0.04573366,0.00039429317,0.0002818569,0.0001879553,0.0002684582,0.00006875588,0.02920714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994199,0.0002490322,0.000014776404,0.00011802148,0.00011496779,0.0000832548],"domain_scores_gemma":[0.99852425,0.0009341223,0.00014489917,0.00010658833,0.00016756517,0.00012256665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087062706,0.00058725884,0.00048223155,0.0007250185,0.00073976786,0.0020265211,0.0011167593,0.0009478751,0.012586525],"category_scores_gemma":[0.0028180573,0.00025997145,0.0008542023,0.00056078506,0.0025202935,0.0026778688,0.00077532564,0.0020618122,0.0008630842],"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.00001005609,0.000008875569,0.00026988718,0.000016172717,0.0000076126644,0.000045127363,0.00011590755,0.018695528,0.00018418278,0.97887063,0.0006012365,0.0011747718],"study_design_scores_gemma":[0.00001376194,0.000030509495,0.0003861443,0.000035686087,0.000015158821,0.000057350386,0.000108499655,0.2211915,0.00018877455,0.7729935,0.0049586846,0.000020416212],"about_ca_topic_score_codex":0.013114185,"about_ca_topic_score_gemma":0.00724016,"teacher_disagreement_score":0.013114185,"about_ca_system_score_codex":0.0025267906,"about_ca_system_score_gemma":0.0014550401,"threshold_uncertainty_score":0.04210615},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10754289,0.0056818286,0.25696182,0.06878436,0.0025847054,0.00013623408,0.00047414747,0.0022426276,0.55559134],"genre_scores_gemma":[0.8007986,0.0017560668,0.075026475,0.003918847,0.00015061366,0.00014622415,0.00029572338,0.0015226812,0.11638474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984635,0.00082055567,0.000040867188,0.0002344614,0.00026837998,0.00017230998],"domain_scores_gemma":[0.9986156,0.00066386984,0.000067214416,0.0002849961,0.00016833044,0.00019986265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126507,0.0007251826,0.00054279406,0.0006486638,0.0032279014,0.0058627455,0.0009817745,0.0020380935,0.018848432],"category_scores_gemma":[0.008849162,0.0004695222,0.00064976106,0.00046011945,0.007470908,0.008799547,0.004686235,0.0033672175,0.003919931],"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.000084635285,0.000016899105,0.0002372268,0.00008228888,0.000014045942,0.000093367606,0.0025748343,0.0021591014,0.00044796022,0.9409184,0.027981948,0.025389286],"study_design_scores_gemma":[0.000030733518,0.000049376566,0.00018110214,0.00016716783,0.000012837001,0.00041357634,0.00257215,0.007072631,0.0013495018,0.7099629,0.27814627,0.000041704247],"about_ca_topic_score_codex":0.0033548719,"about_ca_topic_score_gemma":0.0051689153,"teacher_disagreement_score":0.018848432,"about_ca_system_score_codex":0.0018618256,"about_ca_system_score_gemma":0.0011571744,"threshold_uncertainty_score":0.06305426},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046624755,0.5851274,0.011524533,0.11132999,0.009851009,0.000052971154,0.00014049665,0.0003886239,0.27692258],"genre_scores_gemma":[0.13648199,0.58977306,0.010816362,0.052237995,0.0035263703,0.00023691225,0.0001464292,0.00025646607,0.20652442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831104,0.00059950654,0.00011504423,0.00023654808,0.0005201678,0.00021767174],"domain_scores_gemma":[0.99819547,0.0007693964,0.00012288554,0.00010400873,0.0005860082,0.00022219634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014645011,0.00107703,0.0008163004,0.002615385,0.0021020463,0.005178138,0.00190094,0.003326093,0.010598183],"category_scores_gemma":[0.0053880345,0.00036331653,0.00032270036,0.0015422212,0.010569626,0.005353108,0.002293649,0.0050733606,0.003286844],"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.00006921481,0.000045218232,0.00032049627,0.001175227,0.00003191784,0.00007444328,0.0009345012,0.00045347444,0.00031142583,0.61203504,0.16791444,0.21663462],"study_design_scores_gemma":[0.000011948782,0.000026787151,0.0005114659,0.00083584135,0.000017505563,0.00014858332,0.00045492817,0.00016826887,0.0002666869,0.03482582,0.9627071,0.000025131081],"about_ca_topic_score_codex":0.030420277,"about_ca_topic_score_gemma":0.043413844,"teacher_disagreement_score":0.030420277,"about_ca_system_score_codex":0.006739395,"about_ca_system_score_gemma":0.007380151,"threshold_uncertainty_score":0.060486436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01288427,0.0003063316,0.97396445,0.0018219769,0.0000651122,0.000040989296,0.00007659394,0.00013234181,0.010707867],"genre_scores_gemma":[0.7836615,0.0007294652,0.19426128,0.0009979212,0.0002457337,0.00026897708,0.00018268397,0.00020595615,0.019446503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708027,0.0016824701,0.00007801743,0.00040738535,0.00052167056,0.00023025462],"domain_scores_gemma":[0.99091196,0.00782791,0.0003760727,0.00042975118,0.0002418501,0.00021238728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061552753,0.0009669481,0.0013278503,0.0008311048,0.001143875,0.0024634697,0.0023745222,0.0030682525,0.0065294276],"category_scores_gemma":[0.023128947,0.00094081566,0.0010825895,0.0007112446,0.0044381325,0.004734991,0.0028393366,0.00468517,0.0009717094],"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.000085491374,0.000027500364,0.0008712623,0.00007105771,0.000038870225,0.0001721061,0.00048262667,0.18897085,0.00039416034,0.79233587,0.0016384443,0.01491181],"study_design_scores_gemma":[0.0000142959925,0.000011538206,0.00011321671,0.000019571224,0.0000075257603,0.000044060802,0.000036020276,0.4691331,0.0001575965,0.52914333,0.0013054293,0.000014396621],"about_ca_topic_score_codex":0.0050607785,"about_ca_topic_score_gemma":0.0049703675,"teacher_disagreement_score":0.0065294276,"about_ca_system_score_codex":0.0019535925,"about_ca_system_score_gemma":0.0014256713,"threshold_uncertainty_score":0.03255266},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014020234,0.00353002,0.17926176,0.003326877,0.0029431873,0.0005311804,0.0018634764,0.0066720163,0.7878513],"genre_scores_gemma":[0.120591976,0.004509192,0.08572887,0.001066622,0.00037603072,0.00096042454,0.0023646753,0.002147349,0.7822549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953747,0.00009188659,0.000037784266,0.000082241415,0.00018232784,0.000068366164],"domain_scores_gemma":[0.99951184,0.00008090232,0.000028423068,0.00014377094,0.00014423237,0.00009078188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529823,0.0007648202,0.00040189977,0.00077390095,0.0011511561,0.0017997896,0.0010073718,0.0010027636,0.1548589],"category_scores_gemma":[0.0017220106,0.00027433355,0.00038193984,0.00074016344,0.0005882476,0.0022595602,0.0036243189,0.0009207333,0.07807535],"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.00023352623,0.00015601484,0.0007945231,0.0008555568,0.000025592775,0.0005802833,0.00072741194,0.0018931652,0.025239937,0.17969099,0.16286139,0.6269416],"study_design_scores_gemma":[0.000016032911,0.0000436566,0.0005633495,0.00013046611,0.000011165526,0.0004687879,0.00020995195,0.0037397728,0.0046395957,0.022914845,0.9672387,0.000023629937],"about_ca_topic_score_codex":0.0005043898,"about_ca_topic_score_gemma":0.0009964795,"teacher_disagreement_score":0.1548589,"about_ca_system_score_codex":0.00059211144,"about_ca_system_score_gemma":0.00071979495,"threshold_uncertainty_score":0.5180546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016928557,0.00011647004,0.9741141,0.0003249723,0.000036584566,0.00021521309,0.00012111937,0.000293431,0.0078494875],"genre_scores_gemma":[0.3195216,0.00041942945,0.67226386,0.0002803245,0.00007651931,0.0007153409,0.00044672517,0.0001990454,0.0060771857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704534,0.001294108,0.00017887792,0.00052207167,0.00052897626,0.00043063232],"domain_scores_gemma":[0.99491173,0.0037847746,0.0002905095,0.00049164897,0.00025715193,0.00026426002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713407,0.0017495279,0.0018403832,0.001129529,0.0009220032,0.0024809428,0.001421912,0.0012032962,0.0045544486],"category_scores_gemma":[0.008843525,0.0008758966,0.0023460502,0.0009905915,0.0024312078,0.0032679632,0.003091868,0.0032411304,0.0007021931],"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.00022265033,0.00019430617,0.00074419624,0.0003485035,0.00014082923,0.0001560304,0.0004315181,0.6203633,0.003455648,0.3113088,0.0038686956,0.0587655],"study_design_scores_gemma":[0.00004978132,0.00004924045,0.00010161191,0.00003490399,0.000025403486,0.000041058174,0.00006761084,0.74093014,0.0012696839,0.2554671,0.0019446433,0.000018835755],"about_ca_topic_score_codex":0.004231459,"about_ca_topic_score_gemma":0.0038458563,"teacher_disagreement_score":0.0045544486,"about_ca_system_score_codex":0.0023946885,"about_ca_system_score_gemma":0.0034935873,"threshold_uncertainty_score":0.017374754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21135129,0.00077492854,0.44171733,0.0024906928,0.00056955195,0.0006012464,0.0011653497,0.00097461295,0.3403549],"genre_scores_gemma":[0.8594311,0.00037620505,0.0701401,0.0009815848,0.00016324631,0.0004529062,0.0008141334,0.00015871946,0.067481995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986083,0.00037250706,0.00007711275,0.0003054144,0.00029826156,0.00033847522],"domain_scores_gemma":[0.9978612,0.00071876554,0.00023784864,0.0003745731,0.00030873477,0.0004990133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085588923,0.0007032389,0.00090938254,0.0006855583,0.0023539,0.0027523206,0.0021944477,0.001841901,0.017601248],"category_scores_gemma":[0.004797887,0.0004075329,0.0006271857,0.0008235329,0.0026700331,0.003345876,0.0028240588,0.0015889549,0.0020446894],"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.00024711894,0.00006889038,0.00035216982,0.00008403053,0.000014592001,0.00016117384,0.00022290254,0.0060290257,0.0018735483,0.97553307,0.004514272,0.010899247],"study_design_scores_gemma":[0.00011090067,0.00012318823,0.00044623972,0.000052463805,0.00002591916,0.00030313365,0.00029592752,0.10285735,0.002369732,0.85252905,0.040835697,0.000050432016],"about_ca_topic_score_codex":0.002474887,"about_ca_topic_score_gemma":0.002757465,"teacher_disagreement_score":0.017601248,"about_ca_system_score_codex":0.0016532022,"about_ca_system_score_gemma":0.0012099947,"threshold_uncertainty_score":0.058882058},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.264264,0.005077846,0.21215063,0.011691039,0.0017406249,0.0019299602,0.019477824,0.0047206287,0.47894752],"genre_scores_gemma":[0.73826253,0.002836837,0.06847258,0.0038985123,0.00084079395,0.0011368099,0.022978479,0.001010428,0.16056289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832445,0.00026025999,0.00008303373,0.000590953,0.0003175734,0.00042376533],"domain_scores_gemma":[0.99573827,0.0030639113,0.00034042372,0.00024434784,0.00022042084,0.00039265424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069468404,0.0024283945,0.0019266604,0.00079801976,0.0030932173,0.0062230583,0.0029185016,0.0029138636,0.054409232],"category_scores_gemma":[0.006169854,0.0013176196,0.0019300799,0.0012671093,0.0018556223,0.008661336,0.003988647,0.004692398,0.009800321],"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.002883828,0.0014933044,0.0073304516,0.003893508,0.0003765709,0.0028705534,0.0011083218,0.100940354,0.005331802,0.39149812,0.25913963,0.2231336],"study_design_scores_gemma":[0.00047950677,0.00035933164,0.0032924241,0.00038697405,0.000093734845,0.0017191131,0.0010035443,0.11125049,0.003547528,0.78366154,0.09411922,0.00008666279],"about_ca_topic_score_codex":0.0038429142,"about_ca_topic_score_gemma":0.005376866,"teacher_disagreement_score":0.054409232,"about_ca_system_score_codex":0.0017659192,"about_ca_system_score_gemma":0.0014154284,"threshold_uncertainty_score":0.18201703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13136055,0.00046631694,0.5754165,0.0011024082,0.00014683673,0.00042219847,0.0006786797,0.0005423788,0.28986412],"genre_scores_gemma":[0.8897389,0.00054727175,0.072500795,0.00037687924,0.00015259229,0.0005585796,0.0007058811,0.00014823853,0.035270818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536514,0.0016447904,0.00033130328,0.0008084705,0.001117436,0.0007329586],"domain_scores_gemma":[0.9949077,0.0027453229,0.0004051358,0.0007930426,0.00043528088,0.0007135794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00217977,0.0013170149,0.0010594472,0.0010996468,0.0017618472,0.004028114,0.0026786025,0.0014673406,0.0136204455],"category_scores_gemma":[0.006728539,0.00062626763,0.0014154562,0.0012143169,0.0037912487,0.0074945744,0.0042006834,0.0038132512,0.0013279748],"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.00009583239,0.00008554127,0.00032526362,0.000073838586,0.000031143358,0.00009958835,0.00038779964,0.006834823,0.00080150797,0.9780271,0.0013356371,0.011901888],"study_design_scores_gemma":[0.000049484803,0.00006698768,0.0002638909,0.00003673028,0.000033920584,0.00013395831,0.00020851672,0.046065077,0.001066388,0.940724,0.01131629,0.00003475441],"about_ca_topic_score_codex":0.0020639924,"about_ca_topic_score_gemma":0.0020086132,"teacher_disagreement_score":0.0136204455,"about_ca_system_score_codex":0.0016931035,"about_ca_system_score_gemma":0.001105869,"threshold_uncertainty_score":0.04556489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82719314,0.00006088895,0.16089565,0.00020001536,0.00005486194,0.00015276897,0.00006718217,0.00053630944,0.01083921],"genre_scores_gemma":[0.9400737,0.00003205872,0.054056864,0.000066958804,0.000003884371,0.00011848878,0.000070388385,0.000046710644,0.00553091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986947,0.000024535117,0.000004472039,0.000028551192,0.000029604318,0.00004331497],"domain_scores_gemma":[0.9994686,0.0002858525,0.00005848804,0.000046875957,0.000055054472,0.000085079635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039415003,0.00049615605,0.00045579358,0.00037969011,0.00031745067,0.0008095703,0.0008963558,0.0006786324,0.0025342288],"category_scores_gemma":[0.0014967354,0.00027044435,0.00035510585,0.00015248673,0.00071016734,0.00046487793,0.001016908,0.00063007313,0.0002164588],"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.0002446211,0.00024473126,0.0041324785,0.000051294595,0.000048364385,0.00039045914,0.00022816879,0.9347328,0.0135584185,0.015622395,0.00075429096,0.029992018],"study_design_scores_gemma":[0.000015532443,0.00007540695,0.00020505789,0.000003890591,0.0000056418703,0.000020308496,0.00003373488,0.99655545,0.0011007363,0.0014909398,0.0004883513,0.0000049343857],"about_ca_topic_score_codex":0.0044899806,"about_ca_topic_score_gemma":0.0040579997,"teacher_disagreement_score":0.0044899806,"about_ca_system_score_codex":0.00090494927,"about_ca_system_score_gemma":0.0006973908,"threshold_uncertainty_score":0.008927703},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826225,0.003730284,0.06089293,0.0025716766,0.00013895122,0.0000781547,0.00047903872,0.00052072434,0.048965674],"genre_scores_gemma":[0.98728836,0.00038497173,0.009144212,0.00014050379,0.00003796702,0.000032235257,0.00023268224,0.00012213516,0.0026169515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978625,0.0012900865,0.00004524486,0.00013716827,0.0003697325,0.00029531753],"domain_scores_gemma":[0.91369367,0.0816685,0.0009599801,0.0015310274,0.0012270262,0.0009197507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041484768,0.00041001377,0.00096477964,0.0015779171,0.00085864856,0.0017566895,0.0015987927,0.001672266,0.0071092304],"category_scores_gemma":[0.052404035,0.00032917937,0.00056660746,0.0022599334,0.0016107912,0.0039787972,0.0013249625,0.002346222,0.00030533233],"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.0006811843,0.0003526015,0.005770181,0.00016026001,0.00011099998,0.00006538135,0.00018834829,0.85391855,0.0005836898,0.11415919,0.0030884757,0.020921059],"study_design_scores_gemma":[0.000026694872,0.000052982672,0.0007487979,0.000016427517,0.00003263841,0.000014321448,0.000070141185,0.9671882,0.0001983801,0.03134603,0.00029718928,0.000008144558],"about_ca_topic_score_codex":0.018145546,"about_ca_topic_score_gemma":0.023881076,"teacher_disagreement_score":0.018145546,"about_ca_system_score_codex":0.0024373783,"about_ca_system_score_gemma":0.0021309268,"threshold_uncertainty_score":0.036079884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015066143,0.00031080103,0.980478,0.000370587,0.00003987376,0.000071987946,0.00013390758,0.000318681,0.003209995],"genre_scores_gemma":[0.60067713,0.00053494785,0.3918372,0.00038295184,0.00011693036,0.0004924698,0.0005043345,0.0003387476,0.005115241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949763,0.0027650301,0.00018867361,0.0008433657,0.00085878256,0.0003678676],"domain_scores_gemma":[0.9807587,0.014427462,0.0011402529,0.002031211,0.0010596623,0.00058272644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008084529,0.0014758046,0.0019656518,0.0015507546,0.0010372121,0.0027300161,0.0031737806,0.002398471,0.00457022],"category_scores_gemma":[0.04861745,0.000787431,0.0010112195,0.0015414623,0.0026687966,0.006166662,0.003040307,0.004616951,0.0007285581],"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.0002221702,0.00016149883,0.0013433135,0.00014625477,0.000073198375,0.0001122396,0.00019194324,0.5522112,0.001297596,0.39323664,0.002751245,0.048252665],"study_design_scores_gemma":[0.00002072248,0.00005640792,0.00018477814,0.000040245504,0.000009966792,0.000025813582,0.000019740404,0.78905255,0.0005096539,0.20917073,0.0008905776,0.000018757088],"about_ca_topic_score_codex":0.0018587055,"about_ca_topic_score_gemma":0.0027625298,"teacher_disagreement_score":0.008084529,"about_ca_system_score_codex":0.0025272137,"about_ca_system_score_gemma":0.0020507446,"threshold_uncertainty_score":0.042755604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17634587,0.00043378572,0.81128466,0.0005236241,0.00006715408,0.00013733548,0.000061834915,0.0013320172,0.0098137725],"genre_scores_gemma":[0.9295703,0.0001249545,0.06792489,0.0001491004,0.000017128557,0.00007035163,0.00008109494,0.000049070375,0.0020130319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.00009050631,0.000021198879,0.00009290859,0.00008533744,0.00007215758],"domain_scores_gemma":[0.99937385,0.00032201989,0.000073918156,0.00007062588,0.000078944926,0.00008063221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079420995,0.0010609946,0.0006699606,0.00050567655,0.00030525317,0.0008683834,0.0012015485,0.0007978529,0.0014061875],"category_scores_gemma":[0.0025804108,0.00042639519,0.0004739761,0.0003147742,0.0010497071,0.0019290624,0.0014678898,0.0012224732,0.00026839864],"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.00014028116,0.00019159172,0.0018970693,0.000070147704,0.00006898638,0.0000897362,0.00012735161,0.85371274,0.0054388763,0.0112134265,0.00067838025,0.12637138],"study_design_scores_gemma":[0.000008108189,0.00004208465,0.00015876298,0.0000044474527,0.0000070517763,0.000009632781,0.000007287554,0.9929765,0.0009732425,0.0055688974,0.00023963192,0.0000043161926],"about_ca_topic_score_codex":0.006364599,"about_ca_topic_score_gemma":0.010195557,"teacher_disagreement_score":0.006364599,"about_ca_system_score_codex":0.0011792795,"about_ca_system_score_gemma":0.001208373,"threshold_uncertainty_score":0.012655079},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2004363,0.0051100384,0.35896516,0.002987798,0.0010852251,0.00012292562,0.00067470194,0.0005773575,0.43004054],"genre_scores_gemma":[0.8809562,0.0012669354,0.056576658,0.000744593,0.00033123788,0.00013280552,0.00039058033,0.00014991498,0.059451167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989077,0.00030977206,0.00006913504,0.00023878686,0.00032085556,0.00015375567],"domain_scores_gemma":[0.9989851,0.00029855425,0.00008720292,0.00012510328,0.00030066783,0.00020329752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010679826,0.00056124735,0.0005265144,0.0023635007,0.0028638588,0.0046153627,0.0006679899,0.00080567243,0.004968806],"category_scores_gemma":[0.002520223,0.00036058537,0.0005896206,0.00094442203,0.005918215,0.007452329,0.002074686,0.0019238759,0.0011708284],"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.000009951583,0.0000031271845,0.0000792231,0.000008461471,0.0000010217423,0.000019848696,0.00024703576,0.00009942528,0.00015076085,0.9968802,0.00034586963,0.002155154],"study_design_scores_gemma":[0.000005004765,0.000009667512,0.00013116162,0.000017319782,0.0000035483615,0.00006964739,0.00017565413,0.0011343668,0.0004531342,0.9789932,0.018996125,0.000011114447],"about_ca_topic_score_codex":0.0023860512,"about_ca_topic_score_gemma":0.0027447806,"teacher_disagreement_score":0.004968806,"about_ca_system_score_codex":0.0020528769,"about_ca_system_score_gemma":0.0009984662,"threshold_uncertainty_score":0.016622245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99660975,0.000050967796,0.0025599273,0.00005630903,0.000006273354,0.000016896189,0.00021156878,0.000021241294,0.00046701665],"genre_scores_gemma":[0.9973974,0.000023942233,0.0016722219,0.000016630313,0.000005563804,0.00001004129,0.0005507155,0.000006782947,0.00031657127],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962175,0.00012419606,0.000023871326,0.00007832206,0.0000886809,0.00006319415],"domain_scores_gemma":[0.9944259,0.003556836,0.0010765762,0.00015672138,0.0003179796,0.00046598396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000766023,0.0005094077,0.00028860781,0.0014772888,0.00033735138,0.00080747163,0.00047782745,0.0006680733,0.0014211716],"category_scores_gemma":[0.005864065,0.00017591777,0.00032966177,0.0005896543,0.00041800598,0.001011301,0.00036380018,0.0008663854,0.0004506353],"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.0011220531,0.0006755125,0.8868262,0.00007632505,0.00018524335,0.00034350646,0.00040042642,0.07122235,0.0030580417,0.0013477133,0.0019920883,0.03275062],"study_design_scores_gemma":[0.000045074194,0.00030789257,0.41838443,0.000029961011,0.000049563267,0.00023904217,0.0006660517,0.5734579,0.0020467665,0.0033559396,0.0013793932,0.000037969236],"about_ca_topic_score_codex":0.006548981,"about_ca_topic_score_gemma":0.011685216,"teacher_disagreement_score":0.006548981,"about_ca_system_score_codex":0.00041661123,"about_ca_system_score_gemma":0.00022026441,"threshold_uncertainty_score":0.013021708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63737875,0.00058937795,0.31747854,0.0065740114,0.00014733255,0.00042219073,0.0015075648,0.00091352314,0.034988593],"genre_scores_gemma":[0.90274954,0.000328339,0.088324726,0.00052819785,0.00018685308,0.0003759478,0.0013079058,0.00024464753,0.005953895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979481,0.0006626989,0.000085021034,0.00047815626,0.00038492394,0.0004410747],"domain_scores_gemma":[0.9779034,0.019435067,0.0009253742,0.00085989403,0.00044634333,0.00042993372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015128786,0.0010093984,0.001034623,0.0008938807,0.0019556892,0.003070282,0.0017671654,0.0015438293,0.008765956],"category_scores_gemma":[0.014355344,0.00058858015,0.00216494,0.00090430805,0.0037952035,0.0050746077,0.0020933193,0.0036294986,0.0005238104],"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.0011523464,0.0007663796,0.009693518,0.0010532831,0.0003947814,0.0008472506,0.002044518,0.4350052,0.007653516,0.48483133,0.01437456,0.04218335],"study_design_scores_gemma":[0.00020756686,0.000101804566,0.001127615,0.000039524934,0.0000821569,0.00017398455,0.00034444328,0.49764106,0.0023100318,0.49489626,0.0030412802,0.000034258737],"about_ca_topic_score_codex":0.004837153,"about_ca_topic_score_gemma":0.006136254,"teacher_disagreement_score":0.008765956,"about_ca_system_score_codex":0.0018088225,"about_ca_system_score_gemma":0.002396431,"threshold_uncertainty_score":0.029325068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71660554,0.0048837517,0.23600428,0.0010738369,0.0009826726,0.0013971735,0.006661596,0.017262954,0.015128212],"genre_scores_gemma":[0.82156515,0.00029655013,0.16612566,0.00018397611,0.000062131774,0.00024104549,0.0067177815,0.00026236477,0.0045453785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987472,0.00044541777,0.00006071304,0.0003000821,0.0003054525,0.00014106368],"domain_scores_gemma":[0.99657863,0.0020910837,0.0001484259,0.000489944,0.00044663972,0.0002452388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022175638,0.0013666527,0.0012095298,0.0014448417,0.0006162578,0.00080669066,0.0017641061,0.0014907732,0.0059664845],"category_scores_gemma":[0.011206766,0.0003011057,0.00080580486,0.001386411,0.00034253646,0.0018246962,0.00093826576,0.0013039067,0.0016905046],"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.0048488057,0.003945291,0.02191384,0.0007039261,0.00056052476,0.00044364994,0.00021293013,0.24091502,0.008125221,0.0035602152,0.039502975,0.6752676],"study_design_scores_gemma":[0.0001382603,0.00041055123,0.0021901508,0.000016573167,0.00006909248,0.000067054025,0.00004886507,0.9914709,0.002163481,0.0013730254,0.002036338,0.000015738202],"about_ca_topic_score_codex":0.031406928,"about_ca_topic_score_gemma":0.039779548,"teacher_disagreement_score":0.031406928,"about_ca_system_score_codex":0.0012070833,"about_ca_system_score_gemma":0.0015171545,"threshold_uncertainty_score":0.062448263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15038961,0.00008967287,0.8436482,0.00021307392,0.000021125845,0.00012371421,0.00009399769,0.00034598145,0.005074632],"genre_scores_gemma":[0.688577,0.00008732397,0.30924416,0.00004614174,0.0000095383275,0.00015058702,0.00013850545,0.00010620594,0.0016405232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994406,0.00027830785,0.00002301268,0.000115115,0.00009695559,0.000046016077],"domain_scores_gemma":[0.99829584,0.0012129893,0.00011455977,0.0002608225,0.00007085811,0.00004499808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008453038,0.00050381053,0.00048357542,0.0008023037,0.0003713235,0.0014577862,0.0012226717,0.0009117051,0.002791195],"category_scores_gemma":[0.005606829,0.0004828267,0.0011283681,0.00066404435,0.0022808793,0.0015684838,0.0014680023,0.0008189326,0.00017767753],"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.00016140695,0.000135237,0.003326643,0.00019541215,0.000059105805,0.0004348346,0.0016673253,0.74263954,0.017285902,0.17663567,0.0004778883,0.05698106],"study_design_scores_gemma":[0.0000213232,0.00006589792,0.00049445505,0.000015354277,0.000010983584,0.000100981764,0.00012321254,0.9580406,0.0018186127,0.037676603,0.0016148349,0.000017222219],"about_ca_topic_score_codex":0.0026135237,"about_ca_topic_score_gemma":0.0023590703,"teacher_disagreement_score":0.002791195,"about_ca_system_score_codex":0.00074277434,"about_ca_system_score_gemma":0.00055954,"threshold_uncertainty_score":0.009337485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035537552,0.0004780292,0.9539565,0.00056218164,0.0001582253,0.00006980332,0.00014095857,0.0008715356,0.008225167],"genre_scores_gemma":[0.88324267,0.00026003897,0.111623496,0.00025726322,0.00014707832,0.00021011375,0.00018943567,0.0004863366,0.0035835055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921193,0.003199634,0.00026451692,0.0013135354,0.001982672,0.0011202279],"domain_scores_gemma":[0.94177705,0.04664777,0.0019835925,0.0042641005,0.0030656364,0.0022618514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054641077,0.002081249,0.0023921167,0.002095109,0.0013709553,0.0042109406,0.004066285,0.0019682935,0.006028857],"category_scores_gemma":[0.062297422,0.0011305489,0.0013025407,0.0013443852,0.0034440886,0.007822989,0.0064910087,0.006534385,0.00087188225],"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.00094131945,0.00018018305,0.002343592,0.00019913865,0.00010181779,0.000099899604,0.00045039662,0.5740392,0.0048437393,0.3675863,0.0040007755,0.04521351],"study_design_scores_gemma":[0.000015985315,0.000025962321,0.0001537273,0.000018277231,0.000011693322,0.000016494349,0.000019732264,0.8731347,0.0009835747,0.12512916,0.00047448502,0.000016123233],"about_ca_topic_score_codex":0.00404638,"about_ca_topic_score_gemma":0.0027385056,"teacher_disagreement_score":0.006028857,"about_ca_system_score_codex":0.0034188922,"about_ca_system_score_gemma":0.0021602744,"threshold_uncertainty_score":0.028897285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44411954,0.0046928143,0.44199365,0.0028321447,0.0003109979,0.00014117669,0.0025531305,0.0012664081,0.10209012],"genre_scores_gemma":[0.88367397,0.0026019672,0.09098008,0.0004532816,0.0004167801,0.00027999337,0.0019470735,0.00079986494,0.018847043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859315,0.0002504379,0.000070364134,0.00038604945,0.00031037285,0.00038959895],"domain_scores_gemma":[0.9784792,0.014762403,0.0011286621,0.0016679296,0.0013877591,0.002574066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015564404,0.0012625812,0.0012220884,0.0022194637,0.0015091863,0.003070746,0.002819887,0.0012686248,0.013287986],"category_scores_gemma":[0.01578851,0.0006768484,0.0011611466,0.0021749444,0.002062669,0.0075398586,0.0024279384,0.0032952419,0.0011888195],"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.0006245236,0.00022851804,0.007072951,0.00056885544,0.00012305095,0.00038327882,0.0012783512,0.049860876,0.012659636,0.8636508,0.008682498,0.054866645],"study_design_scores_gemma":[0.000041425534,0.0002487275,0.003412938,0.00015529341,0.00013202199,0.0005429603,0.00045475844,0.16227636,0.0074101784,0.81228036,0.012966796,0.00007813574],"about_ca_topic_score_codex":0.0017058516,"about_ca_topic_score_gemma":0.0022284226,"teacher_disagreement_score":0.013287986,"about_ca_system_score_codex":0.0018680034,"about_ca_system_score_gemma":0.0007925829,"threshold_uncertainty_score":0.044452786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22891955,0.0007118169,0.76204187,0.0003271023,0.00009218525,0.00009213796,0.00033995518,0.001980468,0.0054949163],"genre_scores_gemma":[0.895306,0.00015357004,0.09793658,0.00010899378,0.00001795776,0.000071776056,0.00063115906,0.0001055407,0.0056684315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998319,0.000049891492,0.000007881982,0.000047847258,0.000031333064,0.00003115194],"domain_scores_gemma":[0.999616,0.00021403028,0.000035967536,0.00004214265,0.00006763365,0.000024058047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047159786,0.0006317,0.00036697803,0.00023261031,0.00016165721,0.00037011498,0.0007127482,0.00057727244,0.0012445872],"category_scores_gemma":[0.0014837726,0.00031124902,0.0004932755,0.00018387643,0.00040054866,0.00041914816,0.0004442169,0.001157784,0.00035793555],"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.000109840345,0.000121225596,0.002682046,0.000051683517,0.00007064986,0.000051298382,0.00007902176,0.87057775,0.009604066,0.004678622,0.0014868097,0.11048693],"study_design_scores_gemma":[0.0000013411935,0.0000067691226,0.00021584822,0.0000020055627,0.0000017009468,0.000002973327,0.0000030551505,0.9985145,0.0006361487,0.00050932844,0.000104688115,0.0000016628759],"about_ca_topic_score_codex":0.008499448,"about_ca_topic_score_gemma":0.010886769,"teacher_disagreement_score":0.008499448,"about_ca_system_score_codex":0.0007514743,"about_ca_system_score_gemma":0.00054387515,"threshold_uncertainty_score":0.016899943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837337,0.000107530635,0.21208967,0.00016745356,0.00003218857,0.00010029287,0.00003331417,0.0001938008,0.003541937],"genre_scores_gemma":[0.9506946,0.0000629395,0.046460837,0.00009548924,0.000009949837,0.00009724222,0.000055106517,0.00003932453,0.0024844732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976355,0.00009693467,0.000009114516,0.00005000755,0.000042797554,0.000037666374],"domain_scores_gemma":[0.99861586,0.0008341407,0.00016816473,0.00011433995,0.0001446744,0.00012274306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020706,0.00042807986,0.0003941354,0.00035702018,0.00032573787,0.0006259961,0.0009073033,0.00067077135,0.0015985348],"category_scores_gemma":[0.0047889925,0.00026325716,0.00026916538,0.00016899435,0.0006032018,0.0007915677,0.00077365985,0.00053383986,0.00030113786],"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.00031840234,0.0005503055,0.02559156,0.00020039687,0.00015031909,0.0005238702,0.00097005087,0.7227221,0.06893471,0.032848194,0.001277848,0.14591226],"study_design_scores_gemma":[0.00003329084,0.00020337797,0.0018542154,0.000011137654,0.000025299323,0.000118899574,0.00013206861,0.9842478,0.0059251483,0.0065742345,0.00086060894,0.000014006687],"about_ca_topic_score_codex":0.0006506035,"about_ca_topic_score_gemma":0.0009938726,"teacher_disagreement_score":0.0015985348,"about_ca_system_score_codex":0.00036790175,"about_ca_system_score_gemma":0.00029616823,"threshold_uncertainty_score":0.005398035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08233232,0.000116199575,0.90765584,0.0002756882,0.000053091535,0.00018306686,0.000056084926,0.0013599321,0.007967863],"genre_scores_gemma":[0.59424824,0.0001134897,0.3995207,0.00018686698,0.000015510968,0.000252032,0.0001569365,0.00053467514,0.0049715755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996475,0.00014714026,0.00001582755,0.0000688474,0.00007811663,0.000042467225],"domain_scores_gemma":[0.9994511,0.00026304764,0.000058312296,0.00008777948,0.00009210913,0.00004768816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006851929,0.00048703334,0.0002539263,0.00030531574,0.00036067513,0.0010559225,0.0011719882,0.0008637597,0.0016148038],"category_scores_gemma":[0.0023811324,0.00036934554,0.000521035,0.00014536342,0.0012874735,0.0011936038,0.0013127308,0.0011318803,0.00042340942],"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.00018558178,0.00037191526,0.0033713789,0.00025223743,0.00007315007,0.0006283209,0.002927542,0.50356555,0.08952301,0.24864146,0.0031972155,0.1472627],"study_design_scores_gemma":[0.000026034331,0.00008538242,0.00032362435,0.000025049127,0.000015270196,0.000101126636,0.00016545896,0.93927133,0.01240498,0.040506,0.0070583164,0.00001738435],"about_ca_topic_score_codex":0.001146947,"about_ca_topic_score_gemma":0.0015840341,"teacher_disagreement_score":0.0016148038,"about_ca_system_score_codex":0.00066515215,"about_ca_system_score_gemma":0.0005483912,"threshold_uncertainty_score":0.005402088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53598243,0.00021708259,0.4357588,0.0003423391,0.0001454151,0.00026609184,0.00007855367,0.00066236313,0.026546827],"genre_scores_gemma":[0.83071685,0.00008203936,0.16193071,0.00009014816,0.000022945564,0.00015333388,0.00006511918,0.000060395418,0.0068783206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.00018154489,0.000019624002,0.00008067392,0.000109774825,0.00006276292],"domain_scores_gemma":[0.99916553,0.0005528885,0.000049937567,0.00007499034,0.000084826686,0.00007187883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258182,0.0006651021,0.0005532686,0.0003152956,0.0003656599,0.0009640731,0.001062767,0.0011144701,0.0031727552],"category_scores_gemma":[0.0030452178,0.00022135329,0.00053321006,0.00020651992,0.0008740757,0.00077826064,0.00075340236,0.0007917586,0.000324758],"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.0004326174,0.000367987,0.0023174426,0.000110914996,0.00013334802,0.0002148567,0.00021824353,0.9043197,0.008060654,0.020581199,0.0009715265,0.062271483],"study_design_scores_gemma":[0.00006507777,0.00030648196,0.00040963857,0.0000118875405,0.00001869076,0.000039442915,0.00004367061,0.9919459,0.0025084466,0.0033544758,0.0012832998,0.000012922385],"about_ca_topic_score_codex":0.0030808891,"about_ca_topic_score_gemma":0.002354384,"teacher_disagreement_score":0.0031727552,"about_ca_system_score_codex":0.00045439217,"about_ca_system_score_gemma":0.0006040481,"threshold_uncertainty_score":0.010613918},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011509799,0.010372387,0.0039561084,0.012515335,0.011702129,0.00028817527,0.010462401,0.0031237043,0.93606997],"genre_scores_gemma":[0.038813505,0.0024066218,0.0021697439,0.00073975354,0.0006191143,0.00011194713,0.0045597893,0.0007365414,0.94984305],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991769,0.00012074322,0.000041199928,0.00019651357,0.00028313042,0.00018143069],"domain_scores_gemma":[0.9987594,0.00016918777,0.00008073017,0.00017005383,0.00038784975,0.00043275877],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010277702,0.0014168371,0.0016166908,0.0011758192,0.0014638116,0.0030044387,0.0013662375,0.0018901232,0.68443716],"category_scores_gemma":[0.002517477,0.00031053383,0.000663735,0.0009958844,0.00053505355,0.0017656502,0.0032618945,0.0017949697,0.43165833],"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.0029979406,0.00033396936,0.0015445016,0.00097290037,0.00007859912,0.0014373517,0.00032304565,0.0004739921,0.0061370474,0.033034578,0.56068176,0.39198428],"study_design_scores_gemma":[0.00009696884,0.000115188275,0.0015904974,0.00017774139,0.000015874992,0.000555141,0.00015961225,0.00028473858,0.0015347039,0.0017836815,0.99367297,0.000012925196],"about_ca_topic_score_codex":0.003018764,"about_ca_topic_score_gemma":0.002600452,"teacher_disagreement_score":0.68443716,"about_ca_system_score_codex":0.0015301198,"about_ca_system_score_gemma":0.0014656018,"threshold_uncertainty_score":0.4501121},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026031721,0.00021414252,0.9638649,0.00028087123,0.000036333247,0.00013867902,0.00007149662,0.00073513883,0.00862671],"genre_scores_gemma":[0.55229807,0.00041576536,0.4374141,0.00021620883,0.00001764673,0.00020107883,0.00022201937,0.00026618844,0.008948927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973494,0.00009160417,0.000008746005,0.000053438354,0.00008197902,0.000029297753],"domain_scores_gemma":[0.99938464,0.00039122388,0.00003496139,0.000067089924,0.0000849473,0.000037150672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007440694,0.0007027013,0.00027726727,0.00040511315,0.00018362518,0.0008702464,0.00092785957,0.00056640315,0.0036909485],"category_scores_gemma":[0.0027706125,0.0003728454,0.00045520588,0.00018670812,0.00073360954,0.0012485208,0.0011766517,0.0013901283,0.0006263595],"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.00008948427,0.00017256638,0.0015169912,0.00017170355,0.00007407647,0.00019308372,0.00029544486,0.7363627,0.017548246,0.07753606,0.0024645226,0.16357517],"study_design_scores_gemma":[0.0000074477302,0.00004320653,0.00013741305,0.000017818498,0.0000073262045,0.000042995423,0.00002796965,0.973318,0.0050139055,0.018459119,0.0029179605,0.000006911377],"about_ca_topic_score_codex":0.0016436973,"about_ca_topic_score_gemma":0.0032591545,"teacher_disagreement_score":0.0036909485,"about_ca_system_score_codex":0.0006615042,"about_ca_system_score_gemma":0.0004608367,"threshold_uncertainty_score":0.01234746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020241136,0.0001440711,0.96223724,0.0004197547,0.00007701076,0.00019622971,0.00009815917,0.004707248,0.011879158],"genre_scores_gemma":[0.3882546,0.00017127497,0.5959622,0.00034555135,0.00003349938,0.00072816334,0.0002695072,0.00064793846,0.013587201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.00012477956,0.000012802552,0.000069643815,0.00009205012,0.000031395328],"domain_scores_gemma":[0.9993012,0.00047309973,0.00003834219,0.00007751786,0.00005613338,0.00005367227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079554,0.0006163962,0.00028810278,0.00022167304,0.00045261238,0.0007533797,0.0012604449,0.00067133794,0.007632647],"category_scores_gemma":[0.0028390153,0.0003344287,0.0004610324,0.00011401828,0.0010908154,0.0012885107,0.0016832598,0.0015826186,0.0011455963],"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.0010750298,0.00074969063,0.002835901,0.00056713336,0.00014689384,0.0003853832,0.0016084395,0.20666952,0.04405994,0.18998645,0.028408155,0.52350754],"study_design_scores_gemma":[0.000050268856,0.0001381498,0.00036100706,0.000027026823,0.000011039653,0.00007007892,0.000055079796,0.9373842,0.007666336,0.037367065,0.016848963,0.000020658352],"about_ca_topic_score_codex":0.0017356129,"about_ca_topic_score_gemma":0.0038164947,"teacher_disagreement_score":0.007632647,"about_ca_system_score_codex":0.0005045441,"about_ca_system_score_gemma":0.00046665405,"threshold_uncertainty_score":0.025533736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05949019,0.00040986654,0.92935705,0.0003914877,0.000039336886,0.00006873802,0.00011229529,0.0002864942,0.009844502],"genre_scores_gemma":[0.5896496,0.0006770304,0.40361455,0.000057673562,0.000035344252,0.00013479588,0.0002505359,0.00014528295,0.005435205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990121,0.0002847196,0.000054115964,0.00016794627,0.00033450156,0.00014657465],"domain_scores_gemma":[0.9969374,0.0016097764,0.00030322844,0.0007215971,0.0002736806,0.00015436449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073783734,0.0008289021,0.0009028087,0.0011320884,0.00082383625,0.0019791385,0.0015805878,0.00081992307,0.0049787485],"category_scores_gemma":[0.0074220193,0.0006227428,0.0010371015,0.0013069336,0.0015621582,0.0058239503,0.003733158,0.0019130736,0.00036517726],"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.00028102542,0.00007504997,0.0024844,0.00029277962,0.00010252843,0.00032022342,0.0008974342,0.45609066,0.0046676933,0.41529056,0.00210938,0.11738828],"study_design_scores_gemma":[0.000069509755,0.00013729751,0.0021194103,0.000083790736,0.00009762275,0.0004838443,0.00041969348,0.6316539,0.003080441,0.3469685,0.014819626,0.000066242974],"about_ca_topic_score_codex":0.006717709,"about_ca_topic_score_gemma":0.008857869,"teacher_disagreement_score":0.006717709,"about_ca_system_score_codex":0.0011830814,"about_ca_system_score_gemma":0.0011330805,"threshold_uncertainty_score":0.016655564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68610483,0.00085944723,0.15812597,0.002348607,0.0004199617,0.00006334499,0.00084609375,0.0004767309,0.15075493],"genre_scores_gemma":[0.926953,0.00041340533,0.033315945,0.0004114933,0.00017258157,0.00006994125,0.00088170974,0.00019368647,0.037588112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985738,0.0004381305,0.000072271505,0.00033408002,0.00031872027,0.00026305876],"domain_scores_gemma":[0.9977849,0.0010782696,0.00022166417,0.00020521143,0.0003957699,0.00031414584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203921,0.00077022344,0.0010698971,0.0020662202,0.0029201172,0.006298742,0.00074237806,0.0020797856,0.011319654],"category_scores_gemma":[0.0051008053,0.0006889248,0.0016306962,0.001718141,0.0044851005,0.0043663606,0.0016479628,0.004394078,0.0015924983],"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.00023090738,0.000033928838,0.0012683071,0.000058391102,0.0000406383,0.00024434496,0.00062276336,0.0016615671,0.0031707967,0.9839702,0.0016591263,0.0070390883],"study_design_scores_gemma":[0.00013479526,0.000090443675,0.0032082994,0.00005674126,0.000048242422,0.0007525284,0.0008602377,0.015540206,0.0037711884,0.96045434,0.015002046,0.00008088645],"about_ca_topic_score_codex":0.012994021,"about_ca_topic_score_gemma":0.014087634,"teacher_disagreement_score":0.012994021,"about_ca_system_score_codex":0.002824823,"about_ca_system_score_gemma":0.0014087362,"threshold_uncertainty_score":0.037868083},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048295897,0.002265139,0.04860375,0.019043602,0.003704511,0.00017217279,0.00037311672,0.0033290721,0.87421274],"genre_scores_gemma":[0.48277467,0.0017406632,0.067841664,0.007741639,0.0012007422,0.00048286366,0.0006436681,0.0008467772,0.43672732],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927205,0.00031792518,0.000019920815,0.00008060224,0.00018391258,0.00012564543],"domain_scores_gemma":[0.99772495,0.0005277412,0.000087666995,0.00021017087,0.00031934836,0.0011300857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000805403,0.0006543906,0.00022106244,0.0007101125,0.0018912067,0.0025128962,0.0007639283,0.0007958088,0.061455384],"category_scores_gemma":[0.0066586733,0.00014566116,0.0004140486,0.00024890553,0.0009948142,0.0022292444,0.002786425,0.0014969369,0.009165889],"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.00030592878,0.00070576766,0.0070192954,0.0002950445,0.000058014157,0.00032671096,0.0044482797,0.0010996021,0.0016677463,0.1716636,0.35074407,0.46166596],"study_design_scores_gemma":[0.00007631598,0.00021005448,0.003685472,0.0002849071,0.000029978655,0.0006444005,0.0014960507,0.0022554854,0.0008793903,0.100618474,0.889778,0.000041451425],"about_ca_topic_score_codex":0.0029733754,"about_ca_topic_score_gemma":0.011057989,"teacher_disagreement_score":0.061455384,"about_ca_system_score_codex":0.0008626875,"about_ca_system_score_gemma":0.0011009654,"threshold_uncertainty_score":0.20558876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013517591,0.00021729936,0.98031235,0.00041972598,0.00006925251,0.00012454756,0.000036009093,0.0007465945,0.0045565907],"genre_scores_gemma":[0.56917864,0.0002481538,0.4246893,0.0002930435,0.000101548845,0.00045411187,0.00014537448,0.00018317933,0.0047066784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883825,0.0004127648,0.00006722549,0.00024244477,0.00030961997,0.0001296788],"domain_scores_gemma":[0.9970818,0.0018694327,0.00018900329,0.00034768827,0.00035355953,0.00015840308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025704487,0.001166819,0.0009732336,0.0005380926,0.00061474723,0.0010891015,0.0021981217,0.0015301468,0.0062196767],"category_scores_gemma":[0.009751167,0.00053999975,0.00063623366,0.0004134769,0.0013729556,0.0016126581,0.0025592356,0.002979898,0.0008392288],"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.00014015632,0.00023251493,0.0010489763,0.0001270736,0.00004420944,0.00006518346,0.00010938718,0.81168586,0.0022943432,0.04914522,0.001997116,0.13310996],"study_design_scores_gemma":[0.000020760806,0.000037033304,0.000046645935,0.000006809697,0.0000042541064,0.00000793398,0.000005155713,0.9884821,0.0003189949,0.010487483,0.0005796918,0.0000031852976],"about_ca_topic_score_codex":0.0054432154,"about_ca_topic_score_gemma":0.0069605685,"teacher_disagreement_score":0.0062196767,"about_ca_system_score_codex":0.0019099313,"about_ca_system_score_gemma":0.0023909041,"threshold_uncertainty_score":0.020806909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001986157,0.00078346673,0.97936773,0.0004168002,0.00018189944,0.000049943978,0.0000395357,0.00019865084,0.016975714],"genre_scores_gemma":[0.18318377,0.00220614,0.78184825,0.00075575034,0.00050498376,0.00057043385,0.00014216239,0.00030223053,0.030486304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988777,0.00038164892,0.000077814846,0.00019408838,0.0003962697,0.000072474366],"domain_scores_gemma":[0.9991835,0.0005120047,0.00004985952,0.000093443814,0.00008737142,0.00007376606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013959928,0.00127251,0.0009887791,0.0006362413,0.0007885863,0.0027925477,0.00315081,0.001591313,0.008469284],"category_scores_gemma":[0.0028165341,0.0005582048,0.0012460967,0.0008574108,0.0018417159,0.0038295302,0.0030688143,0.005219556,0.0012789328],"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.00007942992,0.000054315064,0.00008985658,0.00023608176,0.00005811472,0.00008492008,0.0001770062,0.043320756,0.0030228726,0.8856336,0.0055440078,0.06169908],"study_design_scores_gemma":[0.000039007282,0.00007749643,0.00004922394,0.000058702135,0.00002535596,0.00012745541,0.000029998304,0.3473206,0.0015231004,0.6317335,0.018996665,0.000018964005],"about_ca_topic_score_codex":0.00062470924,"about_ca_topic_score_gemma":0.0011110923,"teacher_disagreement_score":0.008469284,"about_ca_system_score_codex":0.00091811793,"about_ca_system_score_gemma":0.00097168394,"threshold_uncertainty_score":0.028332591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093493156,0.00037869584,0.8912587,0.00038403683,0.00010998817,0.000375053,0.000050601335,0.00087663165,0.013073107],"genre_scores_gemma":[0.66506404,0.00036640244,0.32946518,0.0002101401,0.000025477526,0.00047659472,0.00007581634,0.00011899997,0.0041973786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.00012993118,0.00001669832,0.00004589611,0.000093854964,0.000016883301],"domain_scores_gemma":[0.99918383,0.0004969237,0.00008683525,0.00007083921,0.00011002116,0.000051559484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008921794,0.0007115307,0.0002565567,0.00034783673,0.00030123434,0.00089832826,0.0010627249,0.0005880469,0.0019284391],"category_scores_gemma":[0.0033837415,0.0001561115,0.00024066328,0.00018637587,0.0010840151,0.0010901558,0.0007970603,0.0006317737,0.00034960354],"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.0007200875,0.0007826729,0.008824847,0.00091016915,0.00016953409,0.00026211506,0.0016253621,0.37179464,0.08167049,0.16384411,0.0049799914,0.36441603],"study_design_scores_gemma":[0.00011113818,0.0008234978,0.0022627118,0.00009753176,0.000052803996,0.00032165184,0.00025380385,0.9241982,0.015668496,0.039414458,0.01674624,0.000049453],"about_ca_topic_score_codex":0.0012375225,"about_ca_topic_score_gemma":0.0012894223,"teacher_disagreement_score":0.0019284391,"about_ca_system_score_codex":0.00045470285,"about_ca_system_score_gemma":0.00031244804,"threshold_uncertainty_score":0.0064513087},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96136594,0.00018552683,0.028385755,0.0011048159,0.00001675035,0.0001612151,0.00025682963,0.000071901406,0.008451286],"genre_scores_gemma":[0.9898935,0.000084280306,0.008926546,0.0000656442,0.000009140765,0.00006810363,0.00007730316,0.00001353263,0.00086207193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948644,0.003703433,0.00020359842,0.0002896765,0.0005763821,0.00036249473],"domain_scores_gemma":[0.8838526,0.104651265,0.0028391145,0.0051098703,0.0023967975,0.0011503663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011337141,0.0006335917,0.000836023,0.0014587174,0.0014659711,0.0021445844,0.0018882747,0.002481866,0.0037033625],"category_scores_gemma":[0.03804282,0.0004440446,0.0010048882,0.0025888165,0.0026198507,0.0021927913,0.0018101585,0.0025880926,0.00034598552],"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.0011909003,0.0029765125,0.15503196,0.00026708897,0.00036718676,0.0045352625,0.003610806,0.6585423,0.0014038219,0.1350443,0.0030654348,0.033964496],"study_design_scores_gemma":[0.0002492599,0.0013314346,0.027711142,0.00008926582,0.00008499482,0.00092126266,0.0030591805,0.9091784,0.0025359902,0.050413728,0.004310455,0.000114887494],"about_ca_topic_score_codex":0.011916616,"about_ca_topic_score_gemma":0.014826062,"teacher_disagreement_score":0.011916616,"about_ca_system_score_codex":0.0025853638,"about_ca_system_score_gemma":0.0013066399,"threshold_uncertainty_score":0.059957266},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02115201,0.0026695544,0.005832153,0.1617333,0.015535919,0.00012567439,0.00019249068,0.0002325422,0.79252636],"genre_scores_gemma":[0.29658985,0.001589176,0.0056541413,0.13227391,0.0012356602,0.00017487272,0.00027930006,0.00033789736,0.5618652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9900885,0.003720573,0.00030874397,0.0010827134,0.0024806077,0.002318907],"domain_scores_gemma":[0.9906577,0.00068783783,0.00047410463,0.0009310756,0.0023424053,0.004906758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005343654,0.00093274924,0.0010297843,0.0013599149,0.009959195,0.013066007,0.0017700056,0.0046192855,0.08187936],"category_scores_gemma":[0.014945142,0.00036622194,0.0015777677,0.00076673104,0.012579173,0.0097912885,0.010552057,0.014832011,0.02659433],"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.00024920015,0.00035886528,0.005172061,0.00016272352,0.00014348418,0.0007594585,0.022320664,0.0001616094,0.0008200521,0.6481282,0.24627517,0.075448446],"study_design_scores_gemma":[0.00005831042,0.000109418186,0.0016293923,0.0002644023,0.000048834936,0.0010488866,0.022252256,0.00014654387,0.0002957629,0.11174291,0.8623173,0.00008594567],"about_ca_topic_score_codex":0.006698604,"about_ca_topic_score_gemma":0.014923802,"teacher_disagreement_score":0.08187936,"about_ca_system_score_codex":0.0053972006,"about_ca_system_score_gemma":0.006596902,"threshold_uncertainty_score":0.27391374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022683712,0.00068409694,0.97162694,0.00028917153,0.00007123245,0.00008673946,0.00007659783,0.00074251473,0.0037390718],"genre_scores_gemma":[0.596566,0.0003262006,0.3987561,0.00033128628,0.00006895074,0.0003187642,0.00027654888,0.0002693459,0.003086622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992181,0.00031790775,0.0000431679,0.00014708172,0.00018927369,0.00008444299],"domain_scores_gemma":[0.9964414,0.002809064,0.00016967859,0.00018147884,0.00023983186,0.00015852781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001799693,0.0009936558,0.0016958282,0.00073153124,0.0005911086,0.00093839364,0.0016737818,0.0015542752,0.0028393017],"category_scores_gemma":[0.007162802,0.0007497347,0.00074976723,0.0010315375,0.0014875606,0.0016808521,0.0012720803,0.0018658557,0.0004882677],"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.00007600476,0.000034436784,0.00049216766,0.00005654387,0.00002446983,0.000049312985,0.0000432975,0.9549979,0.00030225876,0.016687319,0.0010356016,0.026200743],"study_design_scores_gemma":[0.000010019502,0.000009992354,0.000026727388,0.000004774362,0.0000026422313,0.0000062095373,0.0000027595709,0.99446183,0.00008616153,0.00515009,0.00023668689,0.0000020457442],"about_ca_topic_score_codex":0.012280613,"about_ca_topic_score_gemma":0.012345563,"teacher_disagreement_score":0.012280613,"about_ca_system_score_codex":0.0013238569,"about_ca_system_score_gemma":0.0024020337,"threshold_uncertainty_score":0.024418235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007743878,0.0001383548,0.98379785,0.0002524175,0.000049629776,0.00012953253,0.00017658928,0.0021850194,0.0055266474],"genre_scores_gemma":[0.32946426,0.0002115639,0.6624735,0.00033165806,0.000052392163,0.00030045875,0.0011018261,0.00042779266,0.0056365733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.000548858,0.00013853193,0.0007711136,0.0005299763,0.00024220147],"domain_scores_gemma":[0.9956927,0.0017811912,0.0005844246,0.0010201376,0.0006888996,0.00023259844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022047604,0.001308559,0.00091553916,0.0011964781,0.0008550953,0.002425497,0.0030739068,0.0017863835,0.0061395266],"category_scores_gemma":[0.008199077,0.0006013597,0.001929607,0.0005887827,0.0018235928,0.0040457863,0.0034293025,0.0023989254,0.001946985],"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.0009170325,0.00047899797,0.0072733294,0.00088307343,0.0002326784,0.0007460407,0.0024215255,0.0824545,0.029165205,0.34521204,0.02040853,0.50980693],"study_design_scores_gemma":[0.00007659608,0.00024637883,0.0020070355,0.00017328023,0.000121975085,0.00043350208,0.00053013104,0.57405037,0.03379563,0.36191085,0.026534956,0.000119296434],"about_ca_topic_score_codex":0.002826743,"about_ca_topic_score_gemma":0.0034431855,"teacher_disagreement_score":0.0061395266,"about_ca_system_score_codex":0.0009455348,"about_ca_system_score_gemma":0.0018496757,"threshold_uncertainty_score":0.020538747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015355561,0.00022401883,0.97826666,0.00041984473,0.00007030683,0.00012693802,0.00003543175,0.00076746615,0.0047337404],"genre_scores_gemma":[0.5950165,0.000233103,0.39930955,0.00027779158,0.00009195268,0.00041275032,0.00013362548,0.00016344366,0.0043612965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.00037240193,0.000060717943,0.00021956163,0.0002835359,0.0001225734],"domain_scores_gemma":[0.9972433,0.0017741754,0.00018328188,0.00030800264,0.00034081243,0.00015037558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452252,0.0011402012,0.0009240765,0.00051834004,0.0005916187,0.0010236538,0.0020718814,0.0014487257,0.0059447875],"category_scores_gemma":[0.009233575,0.00050762546,0.0005949201,0.00038131425,0.0012970207,0.0015020916,0.0023160165,0.002824365,0.0007875579],"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.00013248909,0.00022878751,0.0010419723,0.000121041325,0.00004186956,0.00006149604,0.00010297303,0.8239015,0.0022449666,0.042616673,0.0018553919,0.12765086],"study_design_scores_gemma":[0.000019415831,0.0000378685,0.00004739507,0.0000064978167,0.0000040945433,0.0000076247925,0.0000050008516,0.990431,0.00031323105,0.00859781,0.0005269374,0.0000030278231],"about_ca_topic_score_codex":0.005507503,"about_ca_topic_score_gemma":0.0072849514,"teacher_disagreement_score":0.0059447875,"about_ca_system_score_codex":0.0018234227,"about_ca_system_score_gemma":0.0023490083,"threshold_uncertainty_score":0.019887328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08363299,0.000251109,0.708931,0.0007109149,0.0008941703,0.00042139643,0.00051579287,0.0026963765,0.20194627],"genre_scores_gemma":[0.7465114,0.00010944566,0.20342635,0.0002780522,0.00007322281,0.0003038268,0.00034707438,0.00023751016,0.04871315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990544,0.00023156578,0.000068808265,0.00020801634,0.0002649234,0.00017232074],"domain_scores_gemma":[0.99933225,0.000170278,0.000030812185,0.00021984814,0.00012128102,0.00012550986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981401,0.0004677115,0.0012005972,0.00046827248,0.001480286,0.0021591564,0.002092942,0.0012407079,0.015475536],"category_scores_gemma":[0.002696993,0.00020971305,0.00084431615,0.00034644364,0.0010412501,0.0016657843,0.002610942,0.001257625,0.0027458444],"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.0013950889,0.00058261654,0.001524098,0.0003240131,0.00012684312,0.00081168255,0.00024578604,0.05048213,0.009640683,0.7480549,0.01924072,0.16757144],"study_design_scores_gemma":[0.0003734582,0.0003385727,0.00050225976,0.00005915834,0.0000709888,0.0005121438,0.00014939987,0.46925902,0.010022506,0.47997898,0.038651977,0.00008148225],"about_ca_topic_score_codex":0.0012371389,"about_ca_topic_score_gemma":0.002081654,"teacher_disagreement_score":0.015475536,"about_ca_system_score_codex":0.00056587567,"about_ca_system_score_gemma":0.0011758758,"threshold_uncertainty_score":0.051770866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39197648,0.0016762196,0.5878076,0.0011506786,0.0003822021,0.00028003348,0.0012591397,0.009845533,0.00562218],"genre_scores_gemma":[0.83910424,0.0003321683,0.14570633,0.00048501018,0.00011443342,0.00017285426,0.0045992243,0.0002370078,0.0092487065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.00017999878,0.00005024222,0.0003475948,0.000100500874,0.00016989511],"domain_scores_gemma":[0.99872416,0.00060566084,0.000113501635,0.0001502444,0.00031533558,0.00009107684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019493215,0.0013666071,0.0012824886,0.0011983794,0.0007829115,0.0010021572,0.0017065776,0.0015089178,0.0019988252],"category_scores_gemma":[0.0037394718,0.0005279304,0.0008823684,0.0011815942,0.0004878118,0.0015959372,0.001069333,0.0021606167,0.00126826],"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.00089767505,0.00078672427,0.010378459,0.00015338002,0.0001695432,0.00038244156,0.00018420069,0.21415247,0.019153867,0.0016396928,0.0118103605,0.7402912],"study_design_scores_gemma":[0.000010566894,0.000041556556,0.001370171,0.0000048999805,0.000017070008,0.000025840878,0.000022181152,0.9946149,0.0028178494,0.0006270439,0.00043924298,0.000008643434],"about_ca_topic_score_codex":0.017640166,"about_ca_topic_score_gemma":0.02309327,"teacher_disagreement_score":0.017640166,"about_ca_system_score_codex":0.001219295,"about_ca_system_score_gemma":0.000988127,"threshold_uncertainty_score":0.03507501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15378751,0.0002786684,0.8308026,0.0006988259,0.000068320005,0.00042038763,0.00012560557,0.0016100841,0.012208117],"genre_scores_gemma":[0.6012887,0.00019213013,0.3943402,0.00021245217,0.000029732239,0.00037697394,0.00017715037,0.00011132605,0.0032713418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798274,0.0007849389,0.00013600575,0.0003223405,0.000601314,0.00017265345],"domain_scores_gemma":[0.9916339,0.006062585,0.0005746603,0.0008533808,0.00047405294,0.0004014734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388534,0.0008258251,0.0005489581,0.00080787146,0.0005449441,0.0019226924,0.0019966727,0.000999585,0.0033017022],"category_scores_gemma":[0.013383326,0.00035670615,0.0006579336,0.0005669632,0.0014429925,0.003378134,0.0025916116,0.0016280783,0.000671578],"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.0010921168,0.0017208384,0.007823448,0.0008481511,0.00020770807,0.0004121142,0.0026323241,0.24157304,0.06001849,0.2784913,0.0046157506,0.40056476],"study_design_scores_gemma":[0.00013798467,0.00040339012,0.0009748592,0.000041485542,0.00004243603,0.00017942389,0.00024933284,0.90614945,0.010026821,0.07517913,0.006581597,0.000034089917],"about_ca_topic_score_codex":0.0013209475,"about_ca_topic_score_gemma":0.0018888741,"teacher_disagreement_score":0.0033017022,"about_ca_system_score_codex":0.00080764404,"about_ca_system_score_gemma":0.0011431968,"threshold_uncertainty_score":0.012631953},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07958559,0.0023097168,0.012738388,0.104984574,0.013620235,0.00020957414,0.0004061778,0.001356238,0.78478944],"genre_scores_gemma":[0.45074075,0.0013721049,0.009796904,0.03508034,0.0009944657,0.0001377854,0.00036087044,0.0006725614,0.50084424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977812,0.00068184105,0.000048237715,0.00027100934,0.000522172,0.00069547584],"domain_scores_gemma":[0.99606943,0.0003465314,0.00024903665,0.00021303022,0.0007236765,0.0023982525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001710458,0.0013109397,0.0007920634,0.00091187534,0.008044994,0.0059805824,0.0013675686,0.0034180018,0.070889466],"category_scores_gemma":[0.007181963,0.00037571214,0.00091977365,0.00064145797,0.005638015,0.004940364,0.0073791556,0.0064300336,0.024519283],"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.00058774336,0.00022982998,0.007977077,0.00031010588,0.00013827627,0.0017605382,0.02156401,0.00071365066,0.0034770726,0.11799715,0.759296,0.08594857],"study_design_scores_gemma":[0.000069457594,0.0002811748,0.004286948,0.0004773933,0.00004970073,0.0013736142,0.04192688,0.0011270855,0.00073443854,0.038297947,0.91126853,0.00010684575],"about_ca_topic_score_codex":0.008976202,"about_ca_topic_score_gemma":0.02846108,"teacher_disagreement_score":0.070889466,"about_ca_system_score_codex":0.0019945332,"about_ca_system_score_gemma":0.0027200202,"threshold_uncertainty_score":0.23714894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105235256,0.0039659436,0.6652762,0.010320569,0.00064491626,0.0001310728,0.00052990555,0.00021320712,0.2136829],"genre_scores_gemma":[0.87137157,0.0029001858,0.095096424,0.00092203706,0.0014448864,0.00030562893,0.0006811999,0.00023056203,0.027047466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952495,0.0025839286,0.00019796463,0.00044190884,0.0010487936,0.00047786182],"domain_scores_gemma":[0.9838524,0.012003465,0.0009789751,0.0009485741,0.00094904646,0.0012675215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040636924,0.0016178855,0.0021823663,0.0033974196,0.0026514512,0.008328918,0.0027557951,0.0036853186,0.008818434],"category_scores_gemma":[0.017948365,0.0013194946,0.0018867278,0.0032581866,0.008206635,0.015026812,0.0055578253,0.008311752,0.0010561504],"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.000008635567,0.000013833842,0.00004685613,0.000022417056,0.000004329318,0.00004032481,0.000065546265,0.0023228675,0.00004165893,0.9959675,0.00048280644,0.000983193],"study_design_scores_gemma":[0.0000057069224,0.000002931965,0.00001465907,0.00000971219,0.0000016469168,0.00002130926,0.000021049176,0.010747602,0.000013898492,0.9886749,0.00048230405,0.000004265296],"about_ca_topic_score_codex":0.0033045716,"about_ca_topic_score_gemma":0.0025137651,"teacher_disagreement_score":0.008818434,"about_ca_system_score_codex":0.003141281,"about_ca_system_score_gemma":0.00168052,"threshold_uncertainty_score":0.029500663},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014860225,0.0017111811,0.016402945,0.019281391,0.11850276,0.0020532862,0.016139247,0.010540045,0.8138831],"genre_scores_gemma":[0.007678777,0.00067847094,0.0025541303,0.0013141594,0.0060550165,0.00046399506,0.0036534972,0.0034459622,0.97415596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986981,0.0002420534,0.000108531036,0.0002314214,0.00057634606,0.00014347686],"domain_scores_gemma":[0.98882115,0.0022224805,0.00026536264,0.0023398786,0.0039543086,0.0023968045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029348806,0.0012907148,0.0011942203,0.0012190068,0.0021267252,0.006531702,0.0017078536,0.0017544683,0.8920695],"category_scores_gemma":[0.025756622,0.00042548164,0.0012661134,0.0009815916,0.0006173974,0.0032490026,0.0033139356,0.0026162148,0.8102263],"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.00010137399,0.000026137666,0.0000451904,0.00014789903,0.0000039456177,0.000026536694,0.00005829641,0.000051888233,0.00043314885,0.0011159384,0.95840144,0.039588187],"study_design_scores_gemma":[0.000032278294,0.000028419661,0.00018375495,0.00007995204,0.0000045505426,0.00004459415,0.000081233644,0.00016563965,0.00054237916,0.001329404,0.99749917,0.0000087001035],"about_ca_topic_score_codex":0.0009967245,"about_ca_topic_score_gemma":0.0021038044,"teacher_disagreement_score":0.8920695,"about_ca_system_score_codex":0.0011112584,"about_ca_system_score_gemma":0.0024302665,"threshold_uncertainty_score":0.15394974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04516791,0.0016518524,0.49389198,0.0043601166,0.00039223503,0.0003089409,0.000118712276,0.00038083346,0.45372736],"genre_scores_gemma":[0.7130963,0.0009108192,0.2095005,0.00072221475,0.00011944425,0.0007317406,0.00016699315,0.00029365902,0.07445824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830365,0.0007782124,0.00010148409,0.000367345,0.00025665056,0.00019259252],"domain_scores_gemma":[0.99868935,0.000500962,0.00011666932,0.00022333625,0.00031338373,0.00015636756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014678045,0.0008178748,0.00025038983,0.00086004473,0.0020653317,0.005610856,0.0011618336,0.0019680855,0.011768468],"category_scores_gemma":[0.003893528,0.00074482244,0.0007974477,0.00034408327,0.0077260057,0.004317237,0.002545237,0.0022145356,0.0022054047],"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.000007860874,0.000014005158,0.0001988141,0.000038526843,0.0000041709545,0.000053536125,0.0012127219,0.0009264317,0.0005667129,0.9906652,0.0006831691,0.005628835],"study_design_scores_gemma":[0.000037568032,0.00006174812,0.000357876,0.000084658124,0.000018728306,0.00024242853,0.0009131327,0.012724419,0.0013330067,0.88538736,0.09881748,0.000021531658],"about_ca_topic_score_codex":0.0013677145,"about_ca_topic_score_gemma":0.0010976802,"teacher_disagreement_score":0.011768468,"about_ca_system_score_codex":0.002624194,"about_ca_system_score_gemma":0.0008348937,"threshold_uncertainty_score":0.039369404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016148478,0.00036027638,0.9520923,0.00042389362,0.00006107596,0.00007355051,0.0002262596,0.00020364382,0.030410532],"genre_scores_gemma":[0.72088224,0.00063624326,0.26150945,0.0001227791,0.00013997592,0.00043663997,0.00065694866,0.00029721984,0.015318482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991591,0.00036773516,0.00005373521,0.00013887831,0.00019689406,0.00008370511],"domain_scores_gemma":[0.99744415,0.0016156198,0.00024460707,0.00022948378,0.00034212714,0.00012408373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015785835,0.00063232967,0.0003723923,0.002258119,0.0010941905,0.002639808,0.0007913596,0.00071372965,0.012734722],"category_scores_gemma":[0.008403352,0.00023893254,0.0008585238,0.0013047892,0.0025092342,0.004641427,0.0022594056,0.0015709245,0.0009487536],"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.00002154531,0.000014352025,0.00033159053,0.000053217755,0.000010129565,0.00007873765,0.0006353567,0.014090703,0.0006224739,0.9694158,0.0010917186,0.013634378],"study_design_scores_gemma":[0.0000079624915,0.0000100487105,0.00018930189,0.000028533852,0.000006170301,0.000044528646,0.00038183623,0.15961401,0.0004571969,0.8293415,0.009908116,0.000010845339],"about_ca_topic_score_codex":0.0012808334,"about_ca_topic_score_gemma":0.0007083403,"teacher_disagreement_score":0.012734722,"about_ca_system_score_codex":0.0012814112,"about_ca_system_score_gemma":0.0006251468,"threshold_uncertainty_score":0.042601824},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013448123,0.00029282083,0.17186289,0.006921544,0.0011169203,0.00053063396,0.11541119,0.060796626,0.6417226],"genre_scores_gemma":[0.027230188,0.0014299804,0.11347071,0.0031172773,0.0007309917,0.0010655497,0.22471185,0.057758264,0.5704851],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885654,0.0002504466,0.0001480281,0.0001966723,0.00043171152,0.00011655228],"domain_scores_gemma":[0.99709666,0.00082754524,0.00017723504,0.00077608455,0.000866873,0.0002556077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015133707,0.0017198274,0.0010597631,0.0017266481,0.001144891,0.006942414,0.0032026889,0.0027180356,0.48641184],"category_scores_gemma":[0.005507054,0.00122183,0.0011297895,0.0030483569,0.0008916814,0.006310369,0.0025874095,0.0032849,0.44905433],"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.00008957056,0.00005400949,0.00011601875,0.00024390123,0.000009733476,0.000061231,0.00014830565,0.0005365482,0.0015636879,0.056978013,0.902669,0.037529998],"study_design_scores_gemma":[0.00003701106,0.000013190987,0.00025038794,0.000040699513,0.000005203569,0.00007190913,0.000051726376,0.0017332886,0.002198235,0.017167317,0.9784037,0.000027432401],"about_ca_topic_score_codex":0.015061717,"about_ca_topic_score_gemma":0.019123478,"teacher_disagreement_score":0.48641184,"about_ca_system_score_codex":0.0028086316,"about_ca_system_score_gemma":0.0019717284,"threshold_uncertainty_score":0.7325711},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10161143,0.00037766888,0.8806758,0.0004435065,0.000071985385,0.00009078708,0.00008598417,0.0015722523,0.015070515],"genre_scores_gemma":[0.7355997,0.00015144939,0.2595221,0.00017660038,0.000019373712,0.00022574376,0.00010805717,0.00016546635,0.0040316046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941444,0.0002584828,0.000025030837,0.00010248275,0.000111818124,0.000087766464],"domain_scores_gemma":[0.99777824,0.0017536904,0.00009701131,0.00011842672,0.00016075265,0.00009193768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014306831,0.00046912383,0.0008035164,0.00058780285,0.0005176599,0.0006831484,0.0012720404,0.00094756664,0.005210878],"category_scores_gemma":[0.005902319,0.00035382158,0.0004533354,0.0006542348,0.001334561,0.0015073244,0.0012101802,0.0010708541,0.0004509842],"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.00013207919,0.00004792016,0.0004641891,0.000042549753,0.000015762595,0.000042860785,0.000056138048,0.9341494,0.0004484367,0.039955515,0.0006888099,0.023956282],"study_design_scores_gemma":[0.000019102547,0.000015963804,0.000038381975,0.0000029298642,0.0000021834096,0.000005492081,0.0000065518816,0.9853873,0.000169387,0.013922663,0.0004275345,0.0000026488688],"about_ca_topic_score_codex":0.012461472,"about_ca_topic_score_gemma":0.009759002,"teacher_disagreement_score":0.012461472,"about_ca_system_score_codex":0.001512937,"about_ca_system_score_gemma":0.0016333028,"threshold_uncertainty_score":0.02477789},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21423337,0.0014446643,0.30751,0.0014315789,0.0004417655,0.00012897383,0.00052052597,0.00024688378,0.47404224],"genre_scores_gemma":[0.9133765,0.00075857044,0.054735582,0.00043187223,0.00035491044,0.0001381748,0.0003713787,0.000084359424,0.029748514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990545,0.00022141747,0.00006156792,0.0001922069,0.00034143517,0.00012880431],"domain_scores_gemma":[0.9990783,0.0003335791,0.000092578404,0.00012614184,0.0002538678,0.00011556916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006339245,0.00052036374,0.00048402415,0.0020776875,0.0016019768,0.0025347327,0.0005065877,0.0007555244,0.006074061],"category_scores_gemma":[0.002237345,0.00024997216,0.0005951787,0.0010161705,0.003058554,0.002286107,0.0021349976,0.001811547,0.0010347058],"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.0000059658264,0.0000030918202,0.000050707782,0.000010496265,0.000001889199,0.000022635573,0.00010282708,0.00012389752,0.00045191176,0.997592,0.00017627922,0.0014584447],"study_design_scores_gemma":[0.0000058299424,0.000009989757,0.00013169055,0.000009989386,0.000004432129,0.000103937644,0.00009202264,0.001094925,0.0008537757,0.985953,0.011730469,0.000010027555],"about_ca_topic_score_codex":0.0005131429,"about_ca_topic_score_gemma":0.0004308899,"teacher_disagreement_score":0.006074061,"about_ca_system_score_codex":0.00074987224,"about_ca_system_score_gemma":0.0004307872,"threshold_uncertainty_score":0.02031982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021753075,0.00029484654,0.97038156,0.00034170295,0.00008676702,0.000084961895,0.000057702473,0.0008755519,0.006123861],"genre_scores_gemma":[0.61035466,0.00019335285,0.38325152,0.0003527694,0.000078962694,0.0004606699,0.00019888702,0.00030052903,0.0048087332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942434,0.00023531432,0.00002862497,0.000095944444,0.00014298366,0.000072832285],"domain_scores_gemma":[0.996283,0.002917303,0.0001908487,0.00019772751,0.00024141806,0.0001697131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015815098,0.0010246529,0.0015938014,0.0007959044,0.0005129488,0.0009662612,0.0014681561,0.0017381103,0.004024198],"category_scores_gemma":[0.0063897646,0.00064548466,0.000672923,0.0008708448,0.0012914379,0.0012420471,0.0012149655,0.0017080577,0.00074213854],"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.000047956048,0.00004320136,0.00042931462,0.000035619254,0.000028701235,0.000034067638,0.000028134886,0.9666432,0.00027061815,0.012575436,0.0010652515,0.018798497],"study_design_scores_gemma":[0.000007520121,0.000005802239,0.000013201319,0.0000025846894,0.0000016960345,0.0000034281236,0.0000018849152,0.9972939,0.00005372582,0.0024884192,0.00012660032,0.0000011716066],"about_ca_topic_score_codex":0.007248133,"about_ca_topic_score_gemma":0.009143168,"teacher_disagreement_score":0.007248133,"about_ca_system_score_codex":0.0013346525,"about_ca_system_score_gemma":0.0025193023,"threshold_uncertainty_score":0.014411867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018640481,0.00043637783,0.97737586,0.0003701771,0.000025834925,0.000053056152,0.00010637639,0.00042908627,0.002562713],"genre_scores_gemma":[0.7648377,0.0006338664,0.22924621,0.00018772854,0.000058867823,0.00036419055,0.00031358036,0.000279749,0.004078023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891055,0.00059046515,0.00004043313,0.00017485721,0.00020868814,0.00007485589],"domain_scores_gemma":[0.9955915,0.0036276088,0.00021878739,0.00022774778,0.00017250887,0.00016186603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002506356,0.0009800727,0.0009946381,0.0007977057,0.00034864846,0.0010807727,0.0010721172,0.0007954275,0.0030555339],"category_scores_gemma":[0.010532514,0.00052586774,0.00069083046,0.0006733961,0.0019909362,0.001840737,0.0012226345,0.0018435322,0.0004105825],"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.000064962696,0.000037540485,0.0005019957,0.00007430699,0.000025800853,0.000029034945,0.000053110885,0.930358,0.00042497242,0.0507293,0.0005909545,0.017110055],"study_design_scores_gemma":[0.0000083071545,0.000021652506,0.00006790135,0.0000094887155,0.0000041163503,0.0000064666337,0.0000040392124,0.96364754,0.00020392051,0.035726737,0.0002957043,0.000004032823],"about_ca_topic_score_codex":0.0043006334,"about_ca_topic_score_gemma":0.0036534392,"teacher_disagreement_score":0.0043006334,"about_ca_system_score_codex":0.0024327429,"about_ca_system_score_gemma":0.0018478772,"threshold_uncertainty_score":0.017650902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26084983,0.00070902606,0.4311884,0.0024755066,0.0003412749,0.0001650499,0.00048676672,0.0022018913,0.30158222],"genre_scores_gemma":[0.9353905,0.00014645934,0.03732661,0.0000982287,0.00008744977,0.00007090237,0.00044078965,0.00034370922,0.026095323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.00036470877,0.000024004758,0.000103553546,0.00011283022,0.00003083748],"domain_scores_gemma":[0.99701715,0.0020991575,0.00011893579,0.00037081333,0.0002973652,0.00009651796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198293,0.00028463762,0.00017176355,0.0006852735,0.00051602506,0.0021329934,0.0005707026,0.00046545634,0.011104945],"category_scores_gemma":[0.0071193753,0.0002994804,0.00033081847,0.000539982,0.0010749359,0.0025187188,0.0011472463,0.0008147427,0.0017472468],"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.00015221322,0.00018012304,0.00485402,0.0002217752,0.000037971055,0.0008053654,0.0048220786,0.0074743954,0.007651143,0.7763009,0.012044826,0.18545525],"study_design_scores_gemma":[0.000047739522,0.00013228819,0.00500304,0.00009296185,0.000038421662,0.0011911026,0.0016915965,0.120372064,0.007302402,0.8316217,0.032464437,0.000042277854],"about_ca_topic_score_codex":0.0002285145,"about_ca_topic_score_gemma":0.0002655876,"teacher_disagreement_score":0.011104945,"about_ca_system_score_codex":0.00042834377,"about_ca_system_score_gemma":0.0002302809,"threshold_uncertainty_score":0.037149727},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1407683,0.18572228,0.047726247,0.062561415,0.0048897928,0.00045852238,0.0021209687,0.003079626,0.5526729],"genre_scores_gemma":[0.6833428,0.10453179,0.039940763,0.022883072,0.003295358,0.0005664694,0.007264298,0.0010427714,0.13713264],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99784315,0.0002826743,0.00007989979,0.0003889067,0.0009912723,0.00041413476],"domain_scores_gemma":[0.9941012,0.001275,0.0004918211,0.0002029142,0.0012942723,0.0026347525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002909268,0.00045453946,0.0005191074,0.0018803773,0.0019809655,0.0069312924,0.0020595766,0.0015883611,0.01818243],"category_scores_gemma":[0.0050581717,0.00037260572,0.00037776178,0.0025938682,0.0021902577,0.005965713,0.0020311766,0.0018191517,0.0050427676],"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.0004793194,0.00054419745,0.005435794,0.001202572,0.000035195302,0.00014106532,0.0008194395,0.002570766,0.0014429998,0.16077933,0.20251334,0.62403595],"study_design_scores_gemma":[0.00003804639,0.00019831974,0.004176196,0.0005554805,0.000014723772,0.0002091141,0.0012866552,0.003519189,0.0005203415,0.028652411,0.96077764,0.000051888364],"about_ca_topic_score_codex":0.009464764,"about_ca_topic_score_gemma":0.014462573,"teacher_disagreement_score":0.01818243,"about_ca_system_score_codex":0.0025156562,"about_ca_system_score_gemma":0.0032747064,"threshold_uncertainty_score":0.0608263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9632209,0.000106288455,0.015922885,0.00043859656,0.000022378075,0.00006944716,0.000042170104,0.00022886932,0.019948525],"genre_scores_gemma":[0.99560577,0.000035959165,0.0032629615,0.00012672012,0.0000033337876,0.00002926645,0.000022269052,0.00004663889,0.00086712884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847776,0.0007650298,0.00007047553,0.00026204294,0.00032574128,0.00009888799],"domain_scores_gemma":[0.97591543,0.01753546,0.0025258563,0.00266806,0.0005780356,0.0007770956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015071615,0.00041983457,0.00027470992,0.00026478435,0.00033064757,0.0014410355,0.00081633887,0.00096297835,0.004012711],"category_scores_gemma":[0.025262788,0.0002794706,0.00021214088,0.000106866064,0.0015883272,0.0015868616,0.0011466078,0.0012701948,0.0003040565],"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.00512288,0.007080572,0.14308932,0.0016947573,0.0010885429,0.0020691114,0.018853776,0.113829166,0.28292292,0.074006595,0.0037516267,0.34649083],"study_design_scores_gemma":[0.00089646305,0.010439382,0.37540406,0.00052560837,0.0011375136,0.0020801846,0.012742263,0.2659986,0.15095843,0.15253729,0.026776686,0.000503471],"about_ca_topic_score_codex":0.0012974921,"about_ca_topic_score_gemma":0.0011598443,"teacher_disagreement_score":0.004012711,"about_ca_system_score_codex":0.00069908495,"about_ca_system_score_gemma":0.00042017008,"threshold_uncertainty_score":0.01342386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84553254,0.0003767316,0.12138642,0.0015835034,0.000121231096,0.00014210666,0.0001293147,0.0010087491,0.029719371],"genre_scores_gemma":[0.9726061,0.00008185837,0.021568554,0.00033155043,0.00001680933,0.00002460043,0.00015830477,0.00012254457,0.005089738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993228,0.00030756652,0.000017116427,0.0001272102,0.00014313351,0.00008213715],"domain_scores_gemma":[0.9979144,0.0011636514,0.00023317992,0.00011768309,0.000328314,0.00024282535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009599421,0.000760825,0.00042788754,0.0004376683,0.0005646728,0.0017938116,0.0006480613,0.0009471451,0.0034573756],"category_scores_gemma":[0.008474482,0.0003612648,0.00029120396,0.00013793292,0.00092064164,0.0014671443,0.0011161604,0.0011275364,0.0008966825],"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.0025562441,0.0013558933,0.22498803,0.0009588334,0.00047506523,0.0034133203,0.005416332,0.12970017,0.14724682,0.06427595,0.02308118,0.39653218],"study_design_scores_gemma":[0.000070983464,0.00040600344,0.022233946,0.0000996084,0.000090197645,0.0010545028,0.0017851626,0.89650357,0.028622868,0.03929531,0.009793561,0.000044317792],"about_ca_topic_score_codex":0.0015958612,"about_ca_topic_score_gemma":0.004171217,"teacher_disagreement_score":0.0034573756,"about_ca_system_score_codex":0.0006022519,"about_ca_system_score_gemma":0.0003028752,"threshold_uncertainty_score":0.011566043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22429317,0.0019056179,0.7436648,0.0008710799,0.00009071538,0.00023050414,0.00017347373,0.0007383185,0.028032329],"genre_scores_gemma":[0.93565446,0.00036905223,0.06184394,0.00011320423,0.000025255185,0.00010122519,0.00011154072,0.00008512212,0.0016962962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934715,0.00029382695,0.000020629337,0.000060094288,0.00017154586,0.00010671199],"domain_scores_gemma":[0.9965485,0.0026268288,0.0002661515,0.00019171051,0.00023268205,0.00013419463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018212898,0.0008183074,0.00085110037,0.0008372631,0.00040313802,0.0007971226,0.0012793794,0.000967385,0.0025909473],"category_scores_gemma":[0.008616485,0.0004428844,0.0005704981,0.00055280945,0.0006440188,0.0012164738,0.00093976577,0.0009884867,0.00021362361],"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.000035851725,0.000030397352,0.00043465753,0.000033573015,0.000019202476,0.000016296697,0.000018040813,0.98481524,0.00021462717,0.0055201408,0.00029196002,0.0085699735],"study_design_scores_gemma":[0.00000495957,0.000023397955,0.00007307801,0.000004754413,0.0000034177674,0.0000062941904,0.0000044657445,0.9985611,0.00006405018,0.0011376522,0.00011541716,0.0000014678706],"about_ca_topic_score_codex":0.0068495916,"about_ca_topic_score_gemma":0.005034699,"teacher_disagreement_score":0.0068495916,"about_ca_system_score_codex":0.0013190273,"about_ca_system_score_gemma":0.0016148739,"threshold_uncertainty_score":0.013619423},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08727931,0.00021906396,0.88605803,0.00073900993,0.000059693175,0.00010943347,0.00009910042,0.0002989416,0.025137434],"genre_scores_gemma":[0.7791355,0.00028210596,0.20720154,0.0001143489,0.000032501906,0.00016035102,0.00020879655,0.000119531294,0.012745228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823844,0.00070674904,0.00012678008,0.00028069908,0.00036481005,0.00028250812],"domain_scores_gemma":[0.9973591,0.0015825308,0.00017155304,0.0004369268,0.00017950337,0.0002703068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121577,0.00082611514,0.0008691289,0.0009890114,0.0014348044,0.0024322036,0.0018358417,0.0013844491,0.006126009],"category_scores_gemma":[0.008796122,0.00075971114,0.0015614132,0.0010570815,0.005069362,0.007594896,0.0058751088,0.0025275405,0.00042188625],"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.000076997305,0.000021478456,0.0004316522,0.00005590162,0.000022166576,0.00011755185,0.0011536073,0.05535916,0.0009255424,0.9303589,0.000595928,0.010881114],"study_design_scores_gemma":[0.00004134181,0.00003447672,0.0001829548,0.000020528252,0.000018164716,0.000051106876,0.00036806535,0.15004827,0.0005106958,0.8436989,0.005006555,0.000018908106],"about_ca_topic_score_codex":0.014180937,"about_ca_topic_score_gemma":0.013616314,"teacher_disagreement_score":0.014180937,"about_ca_system_score_codex":0.0016636051,"about_ca_system_score_gemma":0.001115341,"threshold_uncertainty_score":0.028196752},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33697316,0.0010002865,0.23795633,0.0067701857,0.0003298721,0.00047499134,0.00011517834,0.0010868224,0.41529313],"genre_scores_gemma":[0.8340273,0.00042308075,0.10995212,0.0009660073,0.00004402057,0.00025204202,0.00014036,0.00017718191,0.054017987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971764,0.0015520328,0.00010381221,0.00039254504,0.00045937256,0.0003158694],"domain_scores_gemma":[0.99668604,0.0011696634,0.00023991156,0.0008126172,0.00039384593,0.0006979205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037007753,0.0006215794,0.00015266494,0.00072935043,0.0029883063,0.003675438,0.00094844913,0.0009800222,0.009730856],"category_scores_gemma":[0.0062834257,0.00036394814,0.00045558222,0.00043009932,0.0037331495,0.004219365,0.0053846133,0.0020758682,0.0020239055],"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.00019096199,0.0007867018,0.028674489,0.00071214687,0.000107392356,0.0016241593,0.10278675,0.0047979555,0.017433202,0.5436426,0.017188428,0.28205532],"study_design_scores_gemma":[0.000080345446,0.00066469307,0.01484422,0.00027187774,0.00010186726,0.0029376075,0.036434233,0.01760626,0.00957614,0.14953513,0.76783764,0.00010997023],"about_ca_topic_score_codex":0.0014163562,"about_ca_topic_score_gemma":0.0035481502,"teacher_disagreement_score":0.009730856,"about_ca_system_score_codex":0.0018960753,"about_ca_system_score_gemma":0.0012807082,"threshold_uncertainty_score":0.032552898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05473722,0.0009661329,0.92147356,0.00046684127,0.0001507033,0.00022045839,0.00023599056,0.0014025121,0.020346548],"genre_scores_gemma":[0.57693833,0.0006091762,0.41134313,0.0003277639,0.00006390156,0.00056357373,0.0005012763,0.00037113996,0.009281655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973637,0.00008779172,0.000012520733,0.000031508112,0.0000946162,0.00003719811],"domain_scores_gemma":[0.999666,0.00021896286,0.000030942225,0.000018955212,0.000046077446,0.000019028077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006144315,0.0009427651,0.00085225026,0.0005326663,0.0003585118,0.0006804318,0.00083841593,0.0008899744,0.0027349438],"category_scores_gemma":[0.0011159574,0.00029166575,0.0006402783,0.00044803962,0.00062223885,0.00056335924,0.0009205056,0.00082961767,0.00025547587],"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.00011212345,0.000079359634,0.0009953781,0.00015567912,0.000070084214,0.0000723833,0.00005080983,0.9254842,0.0012388013,0.014177748,0.002820577,0.05474296],"study_design_scores_gemma":[0.000024648063,0.000048185488,0.0002166372,0.000009601138,0.000008653852,0.000016390815,0.000013457,0.9935777,0.00046350382,0.0036558982,0.0019598242,0.0000053994195],"about_ca_topic_score_codex":0.0058783568,"about_ca_topic_score_gemma":0.004016948,"teacher_disagreement_score":0.0058783568,"about_ca_system_score_codex":0.0005402412,"about_ca_system_score_gemma":0.0009404778,"threshold_uncertainty_score":0.011688292},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007241038,0.00021343703,0.8194221,0.00033267713,0.00015643783,0.0005936603,0.0027520326,0.15780774,0.011480864],"genre_scores_gemma":[0.1881802,0.0005698748,0.7495592,0.000993346,0.00007656151,0.0034360345,0.007051523,0.03287803,0.0172553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989994,0.00030239607,0.000097381584,0.00018045118,0.0002646427,0.00015571005],"domain_scores_gemma":[0.9983903,0.00086102204,0.00010378209,0.00026464634,0.000181613,0.00019860339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017523984,0.0013359371,0.00074267737,0.0008036324,0.00039620674,0.001526928,0.0038123818,0.0011424712,0.041424673],"category_scores_gemma":[0.006383976,0.0010391779,0.0013241426,0.00038746488,0.0009843066,0.0025168029,0.003239541,0.0029360948,0.009884624],"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.0025125225,0.0017148603,0.0058669085,0.0029104096,0.00034697054,0.0013090599,0.0011927758,0.17653339,0.03413911,0.18621275,0.20525613,0.3820051],"study_design_scores_gemma":[0.00077958225,0.0003104165,0.0015339798,0.00025423788,0.000061266684,0.0004061755,0.000062695784,0.7370664,0.021253426,0.07685681,0.16121578,0.00019926997],"about_ca_topic_score_codex":0.0024629368,"about_ca_topic_score_gemma":0.0029185058,"teacher_disagreement_score":0.041424673,"about_ca_system_score_codex":0.00081112783,"about_ca_system_score_gemma":0.0014760625,"threshold_uncertainty_score":0.13857931},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31663403,0.0008665895,0.25708586,0.0043872516,0.0005529937,0.0001784249,0.00036820638,0.00023243422,0.41969427],"genre_scores_gemma":[0.93537086,0.00038053855,0.026604392,0.00030775188,0.00012617026,0.00016154605,0.00021316638,0.00008745444,0.036748014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987218,0.00055860355,0.000063197855,0.00013653639,0.00030534365,0.00021450978],"domain_scores_gemma":[0.9984091,0.00077073066,0.00013447674,0.00017097036,0.00019158475,0.0003230772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009674338,0.00068331516,0.00077594275,0.0011216582,0.0024410703,0.004181241,0.0016688529,0.0016453828,0.016610024],"category_scores_gemma":[0.0052808304,0.0005388622,0.0005962626,0.0014777045,0.0039416854,0.0052382876,0.0027107538,0.0023943037,0.0012782138],"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.000026293392,0.000010684279,0.00008251358,0.000015395326,0.0000049902815,0.000020887863,0.0000813223,0.0012362256,0.00015613576,0.99551755,0.00069033273,0.0021576511],"study_design_scores_gemma":[0.000009501233,0.0000058452,0.00005321915,0.0000049850005,0.0000033613826,0.000016545622,0.00006525921,0.003445871,0.00005855743,0.9942061,0.0021265028,0.0000042506936],"about_ca_topic_score_codex":0.0031421965,"about_ca_topic_score_gemma":0.0026432388,"teacher_disagreement_score":0.016610024,"about_ca_system_score_codex":0.0014671562,"about_ca_system_score_gemma":0.00086925185,"threshold_uncertainty_score":0.055566072},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002978393,0.13418217,0.034068882,0.0021620558,0.0027327335,0.00005697382,0.00015093818,0.00063496456,0.8230328],"genre_scores_gemma":[0.047383286,0.072147705,0.021799123,0.00090344524,0.0015335189,0.00012340967,0.00045575816,0.00030105293,0.8553527],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978083,0.000034177694,0.000010027938,0.000036271864,0.000110424095,0.000028216893],"domain_scores_gemma":[0.99989796,0.00003608042,0.0000063517346,0.000018780607,0.000019678604,0.00002121182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021095143,0.00087534013,0.00048741532,0.0010622937,0.0005215881,0.0032940675,0.00070095423,0.0009971766,0.037999377],"category_scores_gemma":[0.00033649505,0.0002437164,0.00033752783,0.0011100073,0.00081970944,0.0029183046,0.0019676043,0.0014903162,0.0135263],"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.00004688852,0.00008202458,0.00014991553,0.00069331715,0.00002822953,0.00014176768,0.0007022059,0.00074805453,0.0048432853,0.34039345,0.15044025,0.5017306],"study_design_scores_gemma":[0.000005766571,0.000023079288,0.00034374092,0.00027176924,0.000010578195,0.00025601772,0.00014160569,0.00077094825,0.000842995,0.051804587,0.94552034,0.000008580546],"about_ca_topic_score_codex":0.00034960487,"about_ca_topic_score_gemma":0.0007517235,"teacher_disagreement_score":0.037999377,"about_ca_system_score_codex":0.0005020093,"about_ca_system_score_gemma":0.00031340064,"threshold_uncertainty_score":0.12712055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028212136,0.0006388959,0.9928098,0.0002608667,0.00004527097,0.000061762454,0.000036198126,0.00013777816,0.0031883058],"genre_scores_gemma":[0.1264832,0.0021531924,0.86607575,0.00029094206,0.00016911926,0.00027498533,0.00021203126,0.00014452422,0.004196132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729306,0.0007059275,0.00026263317,0.0006462109,0.0008183442,0.00027392476],"domain_scores_gemma":[0.9944563,0.004153985,0.00022563015,0.0005463977,0.00048400767,0.00013367202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030704748,0.0013649643,0.0015011537,0.001093557,0.00090736686,0.0027589984,0.003703116,0.0014722996,0.003972068],"category_scores_gemma":[0.009401134,0.0009517351,0.0018309165,0.0019346101,0.0030115286,0.0070811207,0.002372929,0.0042772316,0.0007629407],"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.00004796567,0.000063319385,0.0003530918,0.0004248109,0.00004447515,0.00005182053,0.00020563239,0.18089798,0.0006551989,0.73102105,0.0019057457,0.0843289],"study_design_scores_gemma":[0.000030926243,0.000040221305,0.00008611105,0.000070573085,0.000025291458,0.000072150484,0.000058593465,0.4378086,0.0011230495,0.55367476,0.0069855195,0.000024325525],"about_ca_topic_score_codex":0.0050342646,"about_ca_topic_score_gemma":0.0044699013,"teacher_disagreement_score":0.0050342646,"about_ca_system_score_codex":0.00309877,"about_ca_system_score_gemma":0.0031152351,"threshold_uncertainty_score":0.02248329},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10989555,0.023886569,0.0030028797,0.1539164,0.008422989,0.00009298722,0.0021628735,0.00024472145,0.69837505],"genre_scores_gemma":[0.7779198,0.0144187175,0.0045913463,0.028637478,0.0030174572,0.00023638224,0.0026615737,0.00039154832,0.16812573],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9990073,0.00029830675,0.000028528422,0.00015162687,0.00032271908,0.00019154219],"domain_scores_gemma":[0.99692875,0.001344758,0.00018208608,0.000138595,0.0005057672,0.0009000223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018785067,0.00031146986,0.00026141404,0.0009370548,0.005295157,0.0041633607,0.00046444737,0.0015282086,0.018750787],"category_scores_gemma":[0.0073845293,0.00027616104,0.00017861245,0.0017473941,0.004001848,0.004274958,0.0016825622,0.0036127456,0.002751284],"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.00041926678,0.00013020697,0.0035829076,0.00017472407,0.000017541654,0.00017664446,0.0055158827,0.00021524522,0.00058528193,0.27412963,0.63319635,0.08185633],"study_design_scores_gemma":[0.000053643,0.000116752155,0.020082146,0.000498387,0.000013694582,0.000100213154,0.0047219777,0.00017109308,0.0009631098,0.040518887,0.9327089,0.000051072166],"about_ca_topic_score_codex":0.030119713,"about_ca_topic_score_gemma":0.10095085,"teacher_disagreement_score":0.030119713,"about_ca_system_score_codex":0.0046667545,"about_ca_system_score_gemma":0.0030508384,"threshold_uncertainty_score":0.06272763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98991334,0.00038054195,0.0002069243,0.00014060111,0.000024971845,0.000019366804,0.0017148108,0.00001894876,0.007580441],"genre_scores_gemma":[0.9951297,0.00015340923,0.00015793623,0.000018717341,0.00001873906,0.000013049152,0.0021591627,0.000009880216,0.0023394804],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982407,0.00036770388,0.0001833744,0.00022606325,0.000700492,0.0002816232],"domain_scores_gemma":[0.9880676,0.002953346,0.0039558276,0.00026755556,0.0031667543,0.0015889081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016310386,0.00029448562,0.00029501197,0.0049633565,0.00054225937,0.0013140172,0.00050609803,0.00039293582,0.003186784],"category_scores_gemma":[0.010881569,0.00014428834,0.00031699098,0.0042198757,0.00032515303,0.0007005722,0.0005804825,0.0004627736,0.0009823875],"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.00037943537,0.00015943739,0.960272,0.000102670405,0.00024119642,0.00022072595,0.0018366328,0.00088641274,0.0008471238,0.00046676424,0.0034019635,0.03118568],"study_design_scores_gemma":[0.0000014988785,0.000074272444,0.997554,0.000008544659,0.000009560898,0.00006096476,0.000677342,0.00023462523,0.0001095796,0.000029442786,0.0012322445,0.0000079517395],"about_ca_topic_score_codex":0.013141329,"about_ca_topic_score_gemma":0.04167837,"teacher_disagreement_score":0.013141329,"about_ca_system_score_codex":0.0006445254,"about_ca_system_score_gemma":0.00033474932,"threshold_uncertainty_score":0.026129663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99721503,0.000021564083,0.00019830056,0.000038695005,0.0000015947137,0.000009952277,0.00012125616,0.0000053585436,0.0023882245],"genre_scores_gemma":[0.99833566,0.00002034982,0.00027065098,0.000012300945,0.0000018930881,0.000007445973,0.00020977811,0.000006044026,0.001135821],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99942636,0.00014280448,0.000051326377,0.000085753265,0.00021566349,0.0000780957],"domain_scores_gemma":[0.9814175,0.007215007,0.007218073,0.00084752456,0.0019492132,0.0013526436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008346357,0.0001391634,0.00014727483,0.0025073981,0.00071978674,0.0011565958,0.00046052603,0.00038443645,0.0049176477],"category_scores_gemma":[0.015149087,0.00017783279,0.00010146376,0.0023023272,0.00071430847,0.0013126231,0.00066853315,0.000515586,0.0008807451],"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.00014939299,0.00021359981,0.9761461,0.000031969506,0.000020960539,0.00009097813,0.0032894912,0.0001621653,0.0008884499,0.0021817256,0.0008249088,0.016000168],"study_design_scores_gemma":[0.000008415122,0.00009534905,0.9869876,0.00001655994,0.000008067276,0.00024720788,0.006821299,0.0018309235,0.00033874204,0.0005796934,0.0030557823,0.000010302382],"about_ca_topic_score_codex":0.0035001321,"about_ca_topic_score_gemma":0.0082433615,"teacher_disagreement_score":0.0049176477,"about_ca_system_score_codex":0.0005196376,"about_ca_system_score_gemma":0.0004083418,"threshold_uncertainty_score":0.01645118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036208656,0.0013673692,0.9435249,0.00041066066,0.00014930716,0.00017293888,0.00013376711,0.0004089286,0.017623588],"genre_scores_gemma":[0.72948635,0.0013801613,0.25966972,0.00022441873,0.00008588827,0.0002662602,0.00022716807,0.00011141458,0.008548586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981827,0.00006689174,0.00000911977,0.000033986584,0.00004521225,0.000026567026],"domain_scores_gemma":[0.999838,0.000093388546,0.000016324986,0.000007644766,0.00003213699,0.000012423339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035300825,0.0008462177,0.0007378243,0.0005117791,0.00045425832,0.00065807125,0.00054640067,0.00081791996,0.0033547094],"category_scores_gemma":[0.0007541159,0.00024450378,0.0005177497,0.00068386726,0.00027480422,0.00043845165,0.0005780939,0.00067808735,0.000254925],"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.00005711335,0.0000655502,0.0010060614,0.00015700908,0.000040739567,0.00011593165,0.00003159261,0.93252563,0.001884703,0.0068445294,0.001376479,0.055894613],"study_design_scores_gemma":[0.000008198607,0.00003311117,0.00023077293,0.00000900732,0.0000068141026,0.000026548316,0.000011554801,0.99596906,0.00044396828,0.0018608985,0.0013961832,0.0000039123793],"about_ca_topic_score_codex":0.009874688,"about_ca_topic_score_gemma":0.0060803024,"teacher_disagreement_score":0.009874688,"about_ca_system_score_codex":0.0004109357,"about_ca_system_score_gemma":0.00056445115,"threshold_uncertainty_score":0.019634426},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2046985,0.003975699,0.006522092,0.03383955,0.002566247,0.00006233697,0.00046754733,0.0010447191,0.74682343],"genre_scores_gemma":[0.7648711,0.0013803858,0.0013329388,0.005109192,0.0003703946,0.000035462195,0.0004022049,0.00035890532,0.22613935],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893886,0.0001870784,0.000029898021,0.00017721452,0.00034630473,0.00032067407],"domain_scores_gemma":[0.9987337,0.0004698361,0.00015127023,0.00012172281,0.00020508614,0.00031827614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005987244,0.00043426338,0.00034966535,0.0011121766,0.0045099147,0.0042603584,0.00096116436,0.0018577061,0.04584837],"category_scores_gemma":[0.0062723537,0.00020864942,0.00029713692,0.0007284276,0.0033361127,0.0044214395,0.0037551941,0.0023522926,0.006249492],"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.0007827053,0.0002433575,0.015019067,0.00019247849,0.000059443606,0.0062156618,0.018755147,0.0015342957,0.0011859223,0.34029603,0.5053206,0.11039531],"study_design_scores_gemma":[0.000044656048,0.00013988241,0.011482587,0.00023075471,0.000028976636,0.0056076124,0.015303803,0.0021263887,0.0011934276,0.0642501,0.8995352,0.00005666245],"about_ca_topic_score_codex":0.011156548,"about_ca_topic_score_gemma":0.018183937,"teacher_disagreement_score":0.04584837,"about_ca_system_score_codex":0.0025312582,"about_ca_system_score_gemma":0.0007025078,"threshold_uncertainty_score":0.15337807},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09927807,0.18142366,0.003805795,0.07874762,0.013817538,0.00011755088,0.0019123429,0.00031352628,0.62058383],"genre_scores_gemma":[0.55303025,0.070310324,0.0020769506,0.011871402,0.0059904866,0.00008606915,0.0020771252,0.00026099998,0.35429642],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894255,0.00027951077,0.000062676736,0.00015575434,0.0003458934,0.00021361577],"domain_scores_gemma":[0.9963977,0.00079486106,0.00027354446,0.00039926465,0.0010476224,0.0010870801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227212,0.0006274631,0.00047346536,0.0028762822,0.0019235554,0.0048378804,0.0006593789,0.0010584313,0.046715274],"category_scores_gemma":[0.009807427,0.0003372589,0.00037209474,0.002223408,0.0030108416,0.0036216339,0.003571924,0.0024207192,0.00895526],"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.00045522445,0.00024337239,0.009848128,0.00050204084,0.00008638761,0.00025190762,0.003231778,0.0013234925,0.00047250517,0.27347726,0.28211856,0.42798924],"study_design_scores_gemma":[0.00001163809,0.000089939604,0.012814671,0.0005137739,0.000009754536,0.00013790259,0.0013672462,0.00023606385,0.00013602134,0.015626652,0.96903807,0.000018194212],"about_ca_topic_score_codex":0.0071734986,"about_ca_topic_score_gemma":0.017804347,"teacher_disagreement_score":0.046715274,"about_ca_system_score_codex":0.0029101726,"about_ca_system_score_gemma":0.0017821463,"threshold_uncertainty_score":0.1562782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966708,0.00005014739,0.0010684122,0.000033121385,0.00001883724,0.00003610418,0.000070250244,0.000078037985,0.001974221],"genre_scores_gemma":[0.99731964,0.000032258387,0.0015779998,0.000023918234,0.0000073499123,0.00008161376,0.00011022656,0.00003994914,0.0008070152],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827075,0.0007568366,0.00015264955,0.00028211394,0.0003415609,0.00019611657],"domain_scores_gemma":[0.9614144,0.030908076,0.0026551916,0.0009220466,0.00091604807,0.0031842296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016242478,0.0009239581,0.00053008593,0.000564425,0.00029026737,0.0016822937,0.000494047,0.0006032271,0.0050186347],"category_scores_gemma":[0.028141547,0.0002177177,0.00032037613,0.0002482793,0.00051872357,0.00066759373,0.0007085932,0.0010783693,0.00046086725],"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.043032624,0.03225141,0.4121277,0.0026312666,0.0015672285,0.0014978364,0.0054772696,0.0614436,0.20078762,0.004805849,0.0052733244,0.22910434],"study_design_scores_gemma":[0.0009903732,0.035070084,0.86850804,0.00018123834,0.0007239461,0.0003187473,0.0025048663,0.058246914,0.026280485,0.0028114065,0.004062616,0.0003013022],"about_ca_topic_score_codex":0.00074266887,"about_ca_topic_score_gemma":0.0008429109,"teacher_disagreement_score":0.0050186347,"about_ca_system_score_codex":0.0003398761,"about_ca_system_score_gemma":0.00028503573,"threshold_uncertainty_score":0.01678896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026764283,0.00035612998,0.9486124,0.0008072875,0.000051295454,0.0007233318,0.0033728853,0.010722554,0.008589815],"genre_scores_gemma":[0.11058981,0.00023348432,0.88248664,0.00012816906,0.000023033355,0.00050203246,0.0028863011,0.000866497,0.002284009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871516,0.00054111896,0.00009745884,0.0002532494,0.00030410106,0.00008893901],"domain_scores_gemma":[0.9938939,0.004173583,0.00037070498,0.00080483017,0.00038883206,0.00036809265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026778039,0.0012498796,0.0005491059,0.008075349,0.00070243306,0.0058930265,0.0017319922,0.0010001075,0.005913418],"category_scores_gemma":[0.009779613,0.000593498,0.0014706049,0.0034335358,0.0014838199,0.0043010726,0.0039096116,0.0018390354,0.0015446476],"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.0011718242,0.0007937841,0.015477612,0.0026248416,0.00029471272,0.001583994,0.038166173,0.021290386,0.045324836,0.118433066,0.034875195,0.71996367],"study_design_scores_gemma":[0.00031303454,0.0005434262,0.015605174,0.0010768977,0.00015585421,0.0015779525,0.01602793,0.37529257,0.030359063,0.33770153,0.22098057,0.00036591443],"about_ca_topic_score_codex":0.0023026613,"about_ca_topic_score_gemma":0.0062239077,"teacher_disagreement_score":0.008075349,"about_ca_system_score_codex":0.00080140866,"about_ca_system_score_gemma":0.0010815823,"threshold_uncertainty_score":0.019782305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77303886,0.000972973,0.06121129,0.01443187,0.00039811886,0.00019755054,0.0012062696,0.0006663842,0.14787674],"genre_scores_gemma":[0.96624213,0.00037016833,0.017783731,0.0010724831,0.00015281295,0.00016644769,0.00085994106,0.00007402395,0.013278311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907863,0.00030062627,0.000034406723,0.00021371049,0.00017270283,0.00019993854],"domain_scores_gemma":[0.9926479,0.005536816,0.00042408195,0.00050753256,0.00021514457,0.00066854904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008832024,0.00083346415,0.0009121964,0.00052270264,0.001449589,0.0032753057,0.0015501273,0.001758033,0.009170078],"category_scores_gemma":[0.012172028,0.0005252871,0.0012684519,0.00064949825,0.0026883178,0.005246314,0.0030534994,0.005009184,0.0007613389],"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.0008167612,0.00037888446,0.006159942,0.00037413102,0.0001268251,0.00053733785,0.000700375,0.05300369,0.00297527,0.84089553,0.045790013,0.04824127],"study_design_scores_gemma":[0.00030043515,0.00021784911,0.005381481,0.00009113506,0.00006223448,0.00047247912,0.000571103,0.15830597,0.0031195208,0.8125288,0.018879263,0.00006976921],"about_ca_topic_score_codex":0.0036288833,"about_ca_topic_score_gemma":0.0044071455,"teacher_disagreement_score":0.009170078,"about_ca_system_score_codex":0.0018608448,"about_ca_system_score_gemma":0.0011733377,"threshold_uncertainty_score":0.03067702},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035879046,0.00019232427,0.97237104,0.00010791079,0.00009646998,0.00019067168,0.0010743275,0.016903033,0.005476377],"genre_scores_gemma":[0.073400885,0.0005393193,0.9066701,0.0001017811,0.00004325131,0.00074054324,0.002363697,0.0039896825,0.012150811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940777,0.00016833164,0.000056691046,0.00012349278,0.00020769895,0.00003604437],"domain_scores_gemma":[0.99655116,0.002408793,0.00012707192,0.00039955284,0.00029837014,0.00021493767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012787599,0.0014991073,0.00054900645,0.0014504422,0.00062256504,0.0033154418,0.0018810307,0.0011301775,0.04263733],"category_scores_gemma":[0.0075605423,0.00069062214,0.0008838481,0.00079941674,0.0010135527,0.003291565,0.0028686651,0.0013817456,0.006343149],"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.0008791884,0.00026546748,0.002285089,0.0041021607,0.00019454716,0.0025617252,0.010863882,0.0643132,0.08070565,0.16514952,0.0803667,0.58831286],"study_design_scores_gemma":[0.00035831184,0.0002026093,0.00090572954,0.0005922351,0.00011437539,0.0018335771,0.0015812115,0.24460597,0.044523995,0.089288555,0.61574703,0.00024642845],"about_ca_topic_score_codex":0.00070847565,"about_ca_topic_score_gemma":0.001342656,"teacher_disagreement_score":0.04263733,"about_ca_system_score_codex":0.0004929735,"about_ca_system_score_gemma":0.00064548344,"threshold_uncertainty_score":0.14263606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07209203,0.00036289875,0.91564804,0.00024325213,0.00007507044,0.00024145973,0.000051842562,0.0017515841,0.009533797],"genre_scores_gemma":[0.78446496,0.000210989,0.21255563,0.00012689758,0.000049540733,0.00026515548,0.00009555593,0.00018633765,0.0020449134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.0003184316,0.000047481768,0.00012948184,0.0003073559,0.00012727894],"domain_scores_gemma":[0.99737906,0.0018299768,0.00016965986,0.00019241104,0.00026781068,0.00016109893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126319,0.0015087452,0.0012238486,0.0016657781,0.0006550037,0.0012409898,0.0016017038,0.0013051194,0.001903464],"category_scores_gemma":[0.006969176,0.00072313857,0.000932843,0.0007803444,0.0014540206,0.0014812929,0.0016965437,0.00093235256,0.0003810686],"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.00011798779,0.000114255425,0.0011584902,0.0001027088,0.00008139523,0.00018502453,0.00017660856,0.9206145,0.0026633677,0.011456821,0.00063529477,0.06269365],"study_design_scores_gemma":[0.0000144581945,0.000033497614,0.0000698031,0.0000037594534,0.000013123458,0.00001463687,0.000013273988,0.9947797,0.00068585604,0.003986893,0.00037826932,0.0000066844923],"about_ca_topic_score_codex":0.0075989733,"about_ca_topic_score_gemma":0.008877063,"teacher_disagreement_score":0.0075989733,"about_ca_system_score_codex":0.0010506811,"about_ca_system_score_gemma":0.0011722456,"threshold_uncertainty_score":0.015109479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5344991,0.000461158,0.43683574,0.0013231874,0.00021214713,0.0004343795,0.00033043174,0.0032261095,0.02267769],"genre_scores_gemma":[0.8795056,0.00017012544,0.11582364,0.00030835482,0.00003331833,0.0001872667,0.00022941006,0.0005401952,0.003202114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961939,0.001254362,0.00015200487,0.00054177066,0.0015382254,0.00031968375],"domain_scores_gemma":[0.97756416,0.0132757,0.0014490365,0.0055970605,0.0018330592,0.00028105406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002650367,0.0007993459,0.00024438236,0.00073667313,0.000623145,0.0013793448,0.0015000998,0.0011798666,0.0028974793],"category_scores_gemma":[0.030563558,0.00069369236,0.0006660631,0.0004666932,0.0015665076,0.0022938978,0.0013793258,0.00194623,0.0004246174],"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.00090945035,0.00072143524,0.03720488,0.0011175891,0.00026409712,0.0040733134,0.008352901,0.21909916,0.12837297,0.17962028,0.009950354,0.4103136],"study_design_scores_gemma":[0.00027733392,0.0020030963,0.029174088,0.00028390312,0.00048712624,0.0033896999,0.0036712843,0.52210987,0.08457665,0.24211618,0.11166524,0.00024555242],"about_ca_topic_score_codex":0.0011539282,"about_ca_topic_score_gemma":0.0019864268,"teacher_disagreement_score":0.0028974793,"about_ca_system_score_codex":0.000861824,"about_ca_system_score_gemma":0.00067347893,"threshold_uncertainty_score":0.014016628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020195859,0.00009616348,0.9493798,0.0006139507,0.000102959486,0.00031246265,0.00017944486,0.0064551746,0.02266407],"genre_scores_gemma":[0.48423907,0.00021203877,0.48908466,0.000450199,0.00008796774,0.0006200668,0.001048241,0.0023217674,0.021935903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998007,0.00095808925,0.00007976223,0.00030099656,0.0005074173,0.00014678412],"domain_scores_gemma":[0.9951139,0.0025107923,0.000174233,0.001442586,0.0005160982,0.00024238673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019906056,0.0008203967,0.00038877837,0.0006828376,0.0007055925,0.0029674342,0.0020731576,0.0012767792,0.013618068],"category_scores_gemma":[0.010230064,0.0004727812,0.000707699,0.00039930234,0.0010194383,0.004015744,0.003862481,0.0015513181,0.0032460778],"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.0010036889,0.0012376251,0.0027387552,0.00056460005,0.00011117412,0.0012910059,0.00750707,0.06223366,0.082151026,0.37458837,0.028354991,0.43821803],"study_design_scores_gemma":[0.00025242122,0.00036417288,0.0008846191,0.00014113872,0.0001122616,0.0008357764,0.0011892855,0.56355095,0.077885695,0.15338242,0.20126821,0.00013304024],"about_ca_topic_score_codex":0.0005742148,"about_ca_topic_score_gemma":0.0010021916,"teacher_disagreement_score":0.013618068,"about_ca_system_score_codex":0.00072259567,"about_ca_system_score_gemma":0.00056485046,"threshold_uncertainty_score":0.045557022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017569192,0.00007329358,0.95815754,0.00014641734,0.00010614294,0.000284385,0.00028683527,0.016345896,0.007030285],"genre_scores_gemma":[0.3196414,0.00010415786,0.6626944,0.00019696196,0.00003841651,0.00031647683,0.0010561936,0.0042091487,0.011742762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.00013953002,0.000048885246,0.00019474278,0.0003580495,0.0000881674],"domain_scores_gemma":[0.99721473,0.0010350983,0.00017230453,0.0010857177,0.0003671969,0.00012501577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094890373,0.00086126867,0.00052583416,0.0007935608,0.00044518724,0.0013638618,0.0023548275,0.0012840084,0.018284373],"category_scores_gemma":[0.0069262036,0.0004919947,0.0008168451,0.00033806273,0.0009891071,0.0014451853,0.0027913195,0.0010114165,0.005093339],"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.0008920469,0.0005481068,0.0036914703,0.00073656684,0.00008183787,0.0010306827,0.0017090989,0.10070714,0.1100712,0.051632755,0.030013183,0.6988859],"study_design_scores_gemma":[0.00011659611,0.0003232258,0.0014711627,0.00008021738,0.00004844641,0.00073762727,0.00025234767,0.77116805,0.14424752,0.028661165,0.0528,0.00009359402],"about_ca_topic_score_codex":0.0013084324,"about_ca_topic_score_gemma":0.0011816375,"teacher_disagreement_score":0.018284373,"about_ca_system_score_codex":0.00051082706,"about_ca_system_score_gemma":0.00047635462,"threshold_uncertainty_score":0.06116736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43113437,0.0013415013,0.55156904,0.00035173673,0.00007795568,0.00025708808,0.00008832407,0.00026158828,0.0149185],"genre_scores_gemma":[0.9424213,0.00026199146,0.0557393,0.000070764916,0.0000121200455,0.00016664645,0.000052095293,0.000027597715,0.0012481635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.0015830536,0.00006270752,0.00011809894,0.00030102453,0.00014366962],"domain_scores_gemma":[0.9930247,0.0059598605,0.00038017397,0.00014465407,0.00029313256,0.00019741006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002791074,0.00057792256,0.0008859328,0.0008245222,0.00053641264,0.001164098,0.0009770739,0.0013024309,0.0014384313],"category_scores_gemma":[0.01009263,0.00032997306,0.0005023171,0.00065116055,0.0009971458,0.0013888573,0.0007049278,0.0005925724,0.00018319795],"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.00014700243,0.00006620436,0.0012298524,0.000048641345,0.00004426299,0.00005616291,0.00008886182,0.962873,0.00037690156,0.02667251,0.0002142576,0.008182311],"study_design_scores_gemma":[0.000016423714,0.000066180495,0.00010917314,0.000006374189,0.000005663614,0.000017060198,0.0000122568445,0.9929254,0.00010706532,0.0065217777,0.00020683605,0.000005786958],"about_ca_topic_score_codex":0.004118555,"about_ca_topic_score_gemma":0.0032559312,"teacher_disagreement_score":0.004118555,"about_ca_system_score_codex":0.0009972488,"about_ca_system_score_gemma":0.0011258519,"threshold_uncertainty_score":0.014760792},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025009762,0.000090613394,0.948395,0.0001738932,0.000058143087,0.00096772535,0.00018781908,0.022862427,0.0022545997],"genre_scores_gemma":[0.08466204,0.00008055169,0.9111458,0.00007702902,0.000010704312,0.00075180636,0.000379974,0.0016416669,0.001250425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99185705,0.0038774349,0.0008611934,0.0008117762,0.0022957996,0.0002966525],"domain_scores_gemma":[0.9680062,0.022898482,0.0017431821,0.0037969188,0.0029199168,0.0006353084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008450915,0.0016046667,0.0007042942,0.002001118,0.0005455735,0.0024128638,0.002921324,0.0013904269,0.003904586],"category_scores_gemma":[0.045038436,0.0012036356,0.000985959,0.00062899286,0.0015409412,0.0036094529,0.0023976716,0.0016499024,0.001723344],"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.0008206593,0.0017826771,0.015576348,0.001445287,0.00020720961,0.0014045765,0.008956021,0.0506617,0.062336687,0.02084287,0.0133361425,0.82262975],"study_design_scores_gemma":[0.0006664837,0.001973872,0.0066811065,0.00097289233,0.0001953596,0.0021670982,0.0015004696,0.7516429,0.09914666,0.020518295,0.11423373,0.00030125954],"about_ca_topic_score_codex":0.0016954925,"about_ca_topic_score_gemma":0.001590283,"teacher_disagreement_score":0.008450915,"about_ca_system_score_codex":0.0009060782,"about_ca_system_score_gemma":0.0026450534,"threshold_uncertainty_score":0.04469323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44378278,0.0001512304,0.5483213,0.0005607176,0.000054140564,0.0001719414,0.000030363906,0.00023679784,0.0066907424],"genre_scores_gemma":[0.98931396,0.000013254644,0.0101427045,0.000033996734,0.000005630468,0.000031840966,0.000004537387,0.0000049579266,0.00044899408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989556,0.0005876503,0.00003770185,0.00014416683,0.00015031964,0.0001244736],"domain_scores_gemma":[0.9968045,0.0019907104,0.00046647087,0.00015124318,0.00030117822,0.00028581603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021457288,0.0007642942,0.00077431404,0.00041858954,0.00033711892,0.0008803638,0.0010760188,0.0008512184,0.0015789444],"category_scores_gemma":[0.007533781,0.00027358677,0.00036042352,0.00016887514,0.0011683071,0.0010059399,0.000959709,0.00092573935,0.00014459327],"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.00025899996,0.00029300997,0.0033804006,0.0000681549,0.000076590775,0.00013478323,0.0001449473,0.9444882,0.0053192554,0.020990634,0.0002974347,0.024547543],"study_design_scores_gemma":[0.000009791808,0.00007263159,0.00017985015,0.0000019552376,0.0000043306964,0.000007160596,0.000005169156,0.9964405,0.0001972218,0.0030169587,0.000059803897,0.000004657183],"about_ca_topic_score_codex":0.0033507321,"about_ca_topic_score_gemma":0.0026397402,"teacher_disagreement_score":0.0033507321,"about_ca_system_score_codex":0.001333591,"about_ca_system_score_gemma":0.0006666048,"threshold_uncertainty_score":0.01134783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1254405,0.0016268063,0.86163145,0.0012136605,0.00017492977,0.00008984138,0.00017861913,0.0019169616,0.007727231],"genre_scores_gemma":[0.9476058,0.00027528874,0.04841177,0.00022486913,0.000034454915,0.00008101282,0.00016415559,0.00005494377,0.003147681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996693,0.00013105586,0.000013582105,0.000062980915,0.00005505954,0.0000680662],"domain_scores_gemma":[0.9990558,0.0006195145,0.00007959592,0.000040444334,0.00013272827,0.00007197396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007799813,0.0008413987,0.00077348226,0.00034403094,0.0002818658,0.00069717417,0.0010287444,0.0010064427,0.0019493947],"category_scores_gemma":[0.003897334,0.00036105444,0.0003352245,0.0002565753,0.00081974186,0.0010699108,0.0008345466,0.0016146917,0.0003678276],"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.00011094112,0.00011143534,0.0013846891,0.000074565134,0.000033930388,0.000042964857,0.000052011634,0.93822694,0.0009549956,0.0072114863,0.0017512869,0.0500448],"study_design_scores_gemma":[0.000005663327,0.000013722498,0.00007300196,0.0000038636417,0.0000018751897,0.000002410093,0.0000039681186,0.9962774,0.00017032294,0.0032679338,0.00017784476,0.000001992559],"about_ca_topic_score_codex":0.013160216,"about_ca_topic_score_gemma":0.011540779,"teacher_disagreement_score":0.013160216,"about_ca_system_score_codex":0.0013083391,"about_ca_system_score_gemma":0.0011161561,"threshold_uncertainty_score":0.026167274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005958973,0.0003234025,0.9677283,0.0008053837,0.00012330212,0.000075967415,0.00005177979,0.00015707972,0.024775742],"genre_scores_gemma":[0.61635,0.0008853661,0.35864058,0.00063333305,0.00018993714,0.0005745514,0.00014224846,0.00031400897,0.022269987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880195,0.0005203576,0.000053239102,0.00020238364,0.00030863943,0.00011340444],"domain_scores_gemma":[0.99844736,0.00091618946,0.00013793044,0.00016291547,0.00022150588,0.000114150826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020420814,0.00079098216,0.0008843952,0.0012502939,0.0012599102,0.0021128433,0.0017477277,0.0013373991,0.011974541],"category_scores_gemma":[0.0063741445,0.00042059083,0.0011263769,0.0008430314,0.0030498726,0.003995503,0.002283254,0.0022858537,0.0009218714],"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.000021908156,0.000019649753,0.00030439693,0.000043648717,0.000020977344,0.00006984072,0.00013785127,0.076098844,0.0005164616,0.9108357,0.00076019194,0.011170518],"study_design_scores_gemma":[0.000012142614,0.000058199897,0.00016866319,0.000034580567,0.000018553685,0.000057651403,0.00005665966,0.35283366,0.0003240142,0.6412586,0.0051441872,0.000033118922],"about_ca_topic_score_codex":0.0048054657,"about_ca_topic_score_gemma":0.0054321913,"teacher_disagreement_score":0.011974541,"about_ca_system_score_codex":0.0021458615,"about_ca_system_score_gemma":0.0015164699,"threshold_uncertainty_score":0.04005885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11958078,0.0004017293,0.7608591,0.0012191855,0.00043124385,0.00079023646,0.0015868486,0.055393778,0.059737127],"genre_scores_gemma":[0.3678706,0.00022078921,0.59496105,0.00040980446,0.000025908914,0.00047584437,0.0013088778,0.004802026,0.029925134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996107,0.00011112202,0.00002090268,0.00006641349,0.0001388918,0.000052027983],"domain_scores_gemma":[0.9989994,0.00057963276,0.000030118452,0.00014461298,0.00007733594,0.00016890033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008583798,0.0007091387,0.0002684319,0.00047832372,0.00052594667,0.00093840127,0.0017731324,0.0016881315,0.018543623],"category_scores_gemma":[0.0023810861,0.00037980344,0.00052983867,0.00019877314,0.00084475224,0.001418855,0.002610777,0.0012908168,0.003946807],"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.0021195677,0.0014192029,0.007890409,0.002023614,0.00017941662,0.008452239,0.010099137,0.03466765,0.34919947,0.09047417,0.09610753,0.3973677],"study_design_scores_gemma":[0.0008152677,0.0019174797,0.007165477,0.00051685295,0.00012218111,0.0052432953,0.0016729373,0.3121088,0.1299168,0.025974853,0.5142985,0.00024751032],"about_ca_topic_score_codex":0.0012619711,"about_ca_topic_score_gemma":0.0019164344,"teacher_disagreement_score":0.018543623,"about_ca_system_score_codex":0.00029538263,"about_ca_system_score_gemma":0.0005108826,"threshold_uncertainty_score":0.062034607},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050450318,0.04079497,0.009395334,0.07294928,0.0017360213,0.000043659224,0.00021000701,0.00011991325,0.82430047],"genre_scores_gemma":[0.9082301,0.034814864,0.010921651,0.012864432,0.0026102113,0.00007933222,0.0002031846,0.00016103727,0.030115243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9970548,0.0014300861,0.00008332324,0.00026447012,0.0009425427,0.00022471415],"domain_scores_gemma":[0.9920712,0.0051232246,0.000572834,0.0004766148,0.0009934811,0.00076253706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022617627,0.0005022886,0.00031534338,0.0019837834,0.0015949893,0.006206431,0.00063641625,0.0015089564,0.011264815],"category_scores_gemma":[0.011264214,0.00023646587,0.0004023174,0.0013706987,0.006983797,0.0059611565,0.002871904,0.0026439354,0.0015758789],"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.00014457139,0.000117505,0.007067942,0.00041862772,0.00006901718,0.0003575964,0.0016865679,0.0029547065,0.000974877,0.7517066,0.031812202,0.20268972],"study_design_scores_gemma":[0.000026860816,0.00011338448,0.020601053,0.00086308114,0.000030303685,0.00051404786,0.0025283254,0.004499924,0.0008374592,0.5411029,0.4288,0.000082684295],"about_ca_topic_score_codex":0.0045049484,"about_ca_topic_score_gemma":0.004133915,"teacher_disagreement_score":0.011264815,"about_ca_system_score_codex":0.002727656,"about_ca_system_score_gemma":0.0010813886,"threshold_uncertainty_score":0.0376845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23298119,0.00036194755,0.7028697,0.0033258107,0.0000666169,0.00023891855,0.00013504666,0.0003118999,0.05970877],"genre_scores_gemma":[0.9595006,0.00011226793,0.037058588,0.00024385145,0.000027684835,0.00014149751,0.000045581415,0.000040198003,0.0028296304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856711,0.007752326,0.0007552203,0.0021769593,0.0024099639,0.0012345015],"domain_scores_gemma":[0.96682346,0.020542713,0.0038382679,0.004986405,0.0028122482,0.0009968807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013337291,0.00062567845,0.0009470725,0.00089494005,0.0010560619,0.0039881165,0.001599701,0.0015637461,0.0031237197],"category_scores_gemma":[0.04827412,0.00041092004,0.0011228534,0.0005952649,0.008502314,0.0038380981,0.002866233,0.0027189497,0.00043288126],"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.00011655092,0.000052541833,0.0032096775,0.000051281306,0.00005800917,0.00009885711,0.00064606825,0.03217167,0.0007164792,0.94820154,0.00060374464,0.014073616],"study_design_scores_gemma":[0.000048579477,0.000052271087,0.001009362,0.00002943986,0.000020690648,0.000069274494,0.00013580981,0.08211793,0.0007380546,0.9143433,0.0014103156,0.000024862802],"about_ca_topic_score_codex":0.0039560255,"about_ca_topic_score_gemma":0.0029516106,"teacher_disagreement_score":0.013337291,"about_ca_system_score_codex":0.0025149563,"about_ca_system_score_gemma":0.0033784376,"threshold_uncertainty_score":0.07053512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1525436,0.0014929754,0.6618083,0.0031152682,0.00042310244,0.00088691193,0.00078262767,0.0013085477,0.17763855],"genre_scores_gemma":[0.56784135,0.0005868548,0.4038825,0.00030245335,0.00008746218,0.00048187765,0.0006216739,0.00016497858,0.026030969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993592,0.0002219614,0.00004473333,0.00013596557,0.00019634933,0.00004189718],"domain_scores_gemma":[0.998563,0.0008057955,0.00016866818,0.00028013106,0.00011512343,0.00006732108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041910878,0.0008998758,0.00039459293,0.0009498395,0.00076939195,0.001456776,0.000823343,0.0014176362,0.019298049],"category_scores_gemma":[0.005925224,0.000268792,0.00080438406,0.0007298792,0.0020899463,0.0022487906,0.0016361753,0.0015685636,0.0019852247],"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.0004390299,0.00030748002,0.0031337955,0.00073387375,0.00004452231,0.00053057604,0.00162674,0.042964898,0.011166008,0.6751865,0.01063022,0.25323632],"study_design_scores_gemma":[0.00021912206,0.0009795714,0.012384606,0.0005834276,0.00006246098,0.003183867,0.0014699879,0.2544946,0.009296768,0.53758085,0.17957449,0.00017021083],"about_ca_topic_score_codex":0.00096521596,"about_ca_topic_score_gemma":0.0012727015,"teacher_disagreement_score":0.019298049,"about_ca_system_score_codex":0.00069022895,"about_ca_system_score_gemma":0.0008684824,"threshold_uncertainty_score":0.06455839},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03281741,0.00006107379,0.94504416,0.00006442907,0.000077726814,0.00035014196,0.00053051003,0.007094613,0.013959881],"genre_scores_gemma":[0.32149664,0.00015361828,0.659581,0.00011145112,0.000015270936,0.0006866511,0.002535519,0.003153752,0.012266084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977165,0.00004144204,0.000016479524,0.00003825156,0.000102459075,0.000029736782],"domain_scores_gemma":[0.9994435,0.0002468944,0.000027916845,0.000109554654,0.00011530222,0.00005691073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034254268,0.0009045325,0.00046751916,0.00068911945,0.00034343783,0.0012423185,0.0011605865,0.000748305,0.010521826],"category_scores_gemma":[0.0018040326,0.00052675715,0.0010174192,0.00033401034,0.00057555095,0.0005969828,0.0018570474,0.0006557698,0.0022581867],"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.0004885276,0.00049645314,0.004161541,0.0009498407,0.00017199927,0.0015278627,0.0022706927,0.4227875,0.15967506,0.08500964,0.029110927,0.2933499],"study_design_scores_gemma":[0.00015165577,0.000140748,0.0009676056,0.000075486125,0.00006185962,0.00031746406,0.00019273761,0.8779458,0.043039553,0.020913592,0.056122728,0.000070769835],"about_ca_topic_score_codex":0.0010139584,"about_ca_topic_score_gemma":0.0017491258,"teacher_disagreement_score":0.010521826,"about_ca_system_score_codex":0.00046199697,"about_ca_system_score_gemma":0.00044245124,"threshold_uncertainty_score":0.035199046},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029734133,0.0016994558,0.49541375,0.0013943313,0.00029881598,0.00013725525,0.0002583865,0.0003043666,0.47075948],"genre_scores_gemma":[0.67609763,0.0027376325,0.20850843,0.0008329742,0.0004943132,0.00038419355,0.0006941931,0.00023498747,0.11001575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844044,0.00044199315,0.00012129245,0.0002705617,0.0005567366,0.00016892095],"domain_scores_gemma":[0.9991941,0.00038909857,0.000055640037,0.00016405691,0.000134118,0.00006303184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012099181,0.00080367265,0.0005587941,0.001198193,0.0013960951,0.0033715472,0.001446945,0.0008385162,0.005589347],"category_scores_gemma":[0.0022244959,0.00041793945,0.0012822174,0.0011933658,0.005354944,0.0051665152,0.001895771,0.003548582,0.0015657381],"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.0000028470818,0.0000030742665,0.000014020311,0.000008878691,0.0000015701067,0.000011774577,0.00004857664,0.00032692798,0.0000838589,0.9967681,0.00035728683,0.002373056],"study_design_scores_gemma":[0.000003202231,0.0000055493624,0.000039356633,0.000010668781,0.0000039300203,0.000036926962,0.000025872198,0.0025574681,0.00030044877,0.98423845,0.012772788,0.00000533302],"about_ca_topic_score_codex":0.0024753204,"about_ca_topic_score_gemma":0.0023876738,"teacher_disagreement_score":0.005589347,"about_ca_system_score_codex":0.0022347972,"about_ca_system_score_gemma":0.0008403563,"threshold_uncertainty_score":0.018698215},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013896077,0.014437497,0.8391468,0.0027342832,0.0012562028,0.00012014284,0.00034539154,0.00081137614,0.12725224],"genre_scores_gemma":[0.17921557,0.021602789,0.7408776,0.0010381214,0.0026423063,0.00024878883,0.0017577022,0.0008309395,0.051786046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998235,0.00037383093,0.000090551155,0.00044114975,0.00072209554,0.00013735118],"domain_scores_gemma":[0.99763155,0.0014839239,0.00008085895,0.0003436143,0.00031326144,0.00014672875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018591593,0.001564114,0.0015131076,0.0029257038,0.001219259,0.0043110265,0.001904827,0.00091228855,0.008536595],"category_scores_gemma":[0.006741531,0.0009781249,0.0020786982,0.0031886916,0.0038464374,0.010658975,0.0032591904,0.0064558354,0.0044719744],"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.000034696055,0.0000816796,0.00045073577,0.00036218518,0.000025248346,0.00006463126,0.00025767388,0.008920059,0.00076739787,0.8461661,0.013202677,0.12966686],"study_design_scores_gemma":[0.000008366487,0.00003086575,0.0002206121,0.000077749086,0.000012358817,0.000117680545,0.000066122746,0.030692697,0.00062821974,0.9276588,0.040465295,0.000021172229],"about_ca_topic_score_codex":0.0017989461,"about_ca_topic_score_gemma":0.0017657762,"teacher_disagreement_score":0.008536595,"about_ca_system_score_codex":0.002323168,"about_ca_system_score_gemma":0.0011654494,"threshold_uncertainty_score":0.028557777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013956781,0.002084042,0.003035426,0.00054398004,0.00036626167,0.00020525783,0.9565526,0.0144711975,0.008784309],"genre_scores_gemma":[0.012886304,0.00028805967,0.005582726,0.00011427731,0.000030127865,0.00012158424,0.9784816,0.00018631425,0.0023089992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930453,0.00013771263,0.00009514436,0.00019869712,0.00016526115,0.00009869295],"domain_scores_gemma":[0.99833626,0.00058915565,0.000120289165,0.00038829894,0.00041945663,0.00014649463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009490105,0.002106599,0.00091512885,0.0059727556,0.0006967411,0.0017201689,0.0023211385,0.0018403139,0.024066748],"category_scores_gemma":[0.0062268516,0.00036541492,0.0012228988,0.0041233124,0.0003293875,0.0018944644,0.0017474039,0.0012377247,0.024522226],"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.0009895616,0.00025548134,0.0067100823,0.0023741778,0.00016043821,0.00019593646,0.00014768622,0.0041727847,0.0012343017,0.0026118173,0.927027,0.05412085],"study_design_scores_gemma":[0.0013658692,0.00040199104,0.024396807,0.0010415048,0.00031592592,0.0007200322,0.0010384006,0.08998823,0.0068160044,0.011749509,0.86199856,0.00016718611],"about_ca_topic_score_codex":0.030015262,"about_ca_topic_score_gemma":0.07878796,"teacher_disagreement_score":0.030015262,"about_ca_system_score_codex":0.0012961384,"about_ca_system_score_gemma":0.0016926377,"threshold_uncertainty_score":0.08051127},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07520693,0.0018333714,0.3458089,0.012371915,0.001884961,0.0003920921,0.0014137201,0.0003553612,0.5607328],"genre_scores_gemma":[0.84585416,0.0015605327,0.05257042,0.0013057593,0.00032053477,0.00036948256,0.0006486383,0.00016198578,0.097208366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986858,0.000701079,0.000060137732,0.00014797755,0.00021882118,0.00018628319],"domain_scores_gemma":[0.9985763,0.0009728758,0.00005686135,0.00013307562,0.00009317495,0.00016768917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013012151,0.00082939677,0.00089837576,0.000451591,0.001556044,0.0029667867,0.0013755609,0.00243882,0.031736188],"category_scores_gemma":[0.0071280664,0.00041039917,0.00083187653,0.0008339909,0.0019281685,0.004889009,0.0019239059,0.0022373197,0.0029782194],"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.0001598214,0.000026088534,0.00012117269,0.000101245605,0.00002517776,0.00009311176,0.00014398823,0.0085034575,0.0005243507,0.96404195,0.015529093,0.010730567],"study_design_scores_gemma":[0.000054805267,0.000030667037,0.00010616622,0.000037132115,0.000012232371,0.00005659002,0.00006349015,0.022356637,0.00035296928,0.9607359,0.016177103,0.000016260137],"about_ca_topic_score_codex":0.002784605,"about_ca_topic_score_gemma":0.0023567786,"teacher_disagreement_score":0.031736188,"about_ca_system_score_codex":0.0010866532,"about_ca_system_score_gemma":0.0009675523,"threshold_uncertainty_score":0.10616815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9566932,0.0002984141,0.028800378,0.00016878398,0.00010616746,0.00027527296,0.00061861915,0.0017394865,0.011299658],"genre_scores_gemma":[0.98471457,0.000049380385,0.011520523,0.00003967882,0.000018381761,0.000079559104,0.00083093083,0.00007664137,0.0026703775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976514,0.0007318066,0.00015829795,0.00038978315,0.000848866,0.00021978877],"domain_scores_gemma":[0.99702954,0.0011542719,0.0002876031,0.0001953135,0.00085809006,0.00047513066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021295534,0.0008711108,0.00081864937,0.0021275796,0.00055020605,0.0016438586,0.00077195605,0.00049192604,0.003999797],"category_scores_gemma":[0.009324814,0.00023257948,0.000280779,0.0008699131,0.00028944275,0.0016740025,0.0014087503,0.00046170465,0.0009546339],"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.01089676,0.005181541,0.120963864,0.0006653269,0.00048315333,0.00051097636,0.0022451915,0.06312709,0.044619612,0.0056834584,0.01667603,0.72894704],"study_design_scores_gemma":[0.0004547324,0.004759582,0.16676089,0.000087894,0.00018547048,0.00041741805,0.0013728176,0.781177,0.02403614,0.0071589276,0.013412656,0.00017658132],"about_ca_topic_score_codex":0.0038009696,"about_ca_topic_score_gemma":0.0034536796,"teacher_disagreement_score":0.003999797,"about_ca_system_score_codex":0.0007879588,"about_ca_system_score_gemma":0.00028247834,"threshold_uncertainty_score":0.013380647},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031972196,0.00045357266,0.95570546,0.00070647843,0.00007399683,0.0001127136,0.000091891314,0.0013188147,0.009564936],"genre_scores_gemma":[0.6772691,0.0005350187,0.31624523,0.00044475112,0.00008081519,0.00035907706,0.00028641146,0.00033338668,0.0044462304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977284,0.00083802,0.0001340901,0.00032476106,0.0006678125,0.00030695254],"domain_scores_gemma":[0.98901063,0.007901855,0.00073369103,0.0013109653,0.0007146278,0.00032830253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029557534,0.0012980736,0.0014133144,0.00083302945,0.0006578884,0.0015878562,0.0015898538,0.0020369473,0.0037748304],"category_scores_gemma":[0.018609706,0.0006742297,0.00079697144,0.0009266011,0.001961401,0.0024789139,0.0022208854,0.0028294714,0.0008684451],"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.00019271925,0.00009877487,0.0007272753,0.00012896894,0.000040782503,0.0000603877,0.0000861032,0.88004154,0.0015387882,0.06883226,0.0023552487,0.04589716],"study_design_scores_gemma":[0.000039396564,0.000044677636,0.00005535566,0.000016332076,0.0000064383025,0.00001934583,0.000012370981,0.973224,0.0005146245,0.025253208,0.000808684,0.0000056034382],"about_ca_topic_score_codex":0.0032696102,"about_ca_topic_score_gemma":0.0031064793,"teacher_disagreement_score":0.0037748304,"about_ca_system_score_codex":0.0018198184,"about_ca_system_score_gemma":0.0045040143,"threshold_uncertainty_score":0.015631676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6657829,0.00019682913,0.2788879,0.001337499,0.000074565985,0.00025336407,0.00074018945,0.0003888669,0.052337777],"genre_scores_gemma":[0.94644874,0.00013974283,0.04549858,0.00017228033,0.000025274407,0.00015754785,0.0005364122,0.00007427725,0.0069472557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984407,0.0005957877,0.00007847274,0.00029587044,0.0002367203,0.00035252154],"domain_scores_gemma":[0.99729496,0.0017718698,0.0002400357,0.00019065378,0.00011850738,0.00038393718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007782124,0.00086337863,0.0008345632,0.0005478112,0.0012405555,0.0031681617,0.0014260713,0.0011937165,0.0074338033],"category_scores_gemma":[0.005125769,0.00046545413,0.00093528465,0.00051042356,0.002305348,0.003627346,0.001906865,0.0020067987,0.0004856085],"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.0009845232,0.00026706612,0.0036682512,0.00028616973,0.00011101503,0.0006381977,0.0009425616,0.15615562,0.008199671,0.7984959,0.0042873337,0.025963666],"study_design_scores_gemma":[0.0000926911,0.00017329119,0.0008300307,0.000036035533,0.00003346086,0.00022640135,0.0006292907,0.35124117,0.0029374417,0.6390447,0.004711925,0.000043516382],"about_ca_topic_score_codex":0.0026983735,"about_ca_topic_score_gemma":0.0029454988,"teacher_disagreement_score":0.0074338033,"about_ca_system_score_codex":0.0019660194,"about_ca_system_score_gemma":0.0010209578,"threshold_uncertainty_score":0.024868548},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012992985,0.005482911,0.93197894,0.0028799886,0.00028705873,0.00005789614,0.00007535052,0.00013447962,0.046110444],"genre_scores_gemma":[0.56768006,0.012533888,0.39518863,0.0022034813,0.001294325,0.00040329946,0.00024576066,0.00031437885,0.020136165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976646,0.0012270118,0.00010918125,0.00036333982,0.00045272155,0.00018318034],"domain_scores_gemma":[0.9893825,0.008656451,0.00069146504,0.00071721827,0.00035998988,0.00019237031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003902085,0.0010067415,0.001103293,0.0015894526,0.0009992127,0.0027491527,0.0018749492,0.0021140904,0.0060931826],"category_scores_gemma":[0.014691626,0.00046584496,0.000914398,0.0024364567,0.0063496404,0.007127392,0.00354709,0.0036167467,0.0008629362],"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.000014512546,0.000013779069,0.00010911151,0.00007411934,0.000009817601,0.000020017536,0.000048308768,0.019020405,0.00014067283,0.96469826,0.00075460103,0.015096391],"study_design_scores_gemma":[0.000007566456,0.000022362085,0.000054406268,0.000037854046,0.000004708827,0.000028329154,0.000019387648,0.04666194,0.00014391232,0.9486027,0.0044079795,0.000008856694],"about_ca_topic_score_codex":0.0014033581,"about_ca_topic_score_gemma":0.00086746673,"teacher_disagreement_score":0.0060931826,"about_ca_system_score_codex":0.0016596531,"about_ca_system_score_gemma":0.0011390623,"threshold_uncertainty_score":0.02063638},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08485036,0.048572667,0.60220516,0.041847367,0.0021337932,0.00024769237,0.00042806237,0.00056306197,0.21915182],"genre_scores_gemma":[0.8426395,0.012235661,0.106054604,0.0028992067,0.0013654507,0.0004357119,0.00024208732,0.00017114221,0.033956684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965146,0.0021476422,0.00009639795,0.000511503,0.0004696016,0.00026035067],"domain_scores_gemma":[0.9926898,0.0056834025,0.0003566286,0.00048488373,0.00030037097,0.00048494225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00345365,0.0011034523,0.00091654074,0.000766295,0.0013759112,0.0057425527,0.0018285086,0.0029616838,0.009691469],"category_scores_gemma":[0.01197603,0.000597901,0.0008052982,0.0006816598,0.0052540866,0.0070245927,0.0033466155,0.0046889116,0.0010446745],"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.00017796393,0.00008128651,0.0011008806,0.0002676528,0.00005837948,0.0000937146,0.00086230424,0.03564722,0.00037262947,0.90067935,0.005344252,0.055314247],"study_design_scores_gemma":[0.000053645617,0.000082113846,0.0007117739,0.00022917047,0.000019225723,0.000076642966,0.000408744,0.100781426,0.00024426146,0.8493036,0.04805268,0.000036756835],"about_ca_topic_score_codex":0.0025709965,"about_ca_topic_score_gemma":0.0036334137,"teacher_disagreement_score":0.009691469,"about_ca_system_score_codex":0.002814906,"about_ca_system_score_gemma":0.001737926,"threshold_uncertainty_score":0.03242123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012421964,0.00030005487,0.9708943,0.00022944545,0.00009634267,0.000047743277,0.000025454654,0.0005181582,0.015466632],"genre_scores_gemma":[0.58988774,0.00039842958,0.38427743,0.0002891234,0.00008505032,0.00021794904,0.00010121961,0.00032627105,0.024416791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979085,0.000065764885,0.0000074777986,0.00003533015,0.00007562623,0.00002487143],"domain_scores_gemma":[0.9996427,0.00018391992,0.00001878638,0.00004877745,0.0000858314,0.00001989099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045228738,0.00048840174,0.0007397696,0.000590528,0.0004970168,0.0008881497,0.0018927598,0.0013554604,0.003485575],"category_scores_gemma":[0.0014719133,0.0003465163,0.00048060704,0.00073011086,0.00069663353,0.0008427804,0.00071859756,0.0013106539,0.0005669227],"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.00002637541,0.000048757902,0.00021893912,0.000027267286,0.0000363582,0.000033426204,0.000051131334,0.9194273,0.00207305,0.023912182,0.0019679281,0.05217731],"study_design_scores_gemma":[0.0000033537724,0.000010353386,0.000026405967,0.0000021967912,0.0000038551507,0.000006550244,0.0000042777056,0.9955603,0.00017745171,0.0037304482,0.00047263177,0.0000022384916],"about_ca_topic_score_codex":0.0077636247,"about_ca_topic_score_gemma":0.009348808,"teacher_disagreement_score":0.0077636247,"about_ca_system_score_codex":0.0008751629,"about_ca_system_score_gemma":0.00080852106,"threshold_uncertainty_score":0.015436888},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015301584,0.0145210195,0.03388067,0.039925177,0.003171758,0.0002295868,0.0006779888,0.00081252423,0.8914797],"genre_scores_gemma":[0.43062153,0.028016163,0.051850796,0.012847534,0.0016914291,0.0008159315,0.0012599776,0.0005796099,0.4723169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914837,0.00036589097,0.000031401356,0.00010753893,0.0002187512,0.00012795738],"domain_scores_gemma":[0.99947494,0.00016700182,0.00005188684,0.00007256128,0.00008600725,0.0001476435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004899512,0.0010847072,0.00028325396,0.00068618095,0.0019994169,0.005954351,0.0010263255,0.0014055242,0.02698023],"category_scores_gemma":[0.003202188,0.00034468755,0.00030277128,0.0007418805,0.003876538,0.005629654,0.0025678447,0.0019410186,0.00949483],"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.00007093178,0.000053004245,0.0010052598,0.00026979225,0.000024143312,0.00013499039,0.0026293076,0.0011191037,0.00052737544,0.65248597,0.21069594,0.13098429],"study_design_scores_gemma":[0.00001803313,0.000031851792,0.00057490665,0.00016647403,0.00000766704,0.0001408144,0.0016776825,0.0008494175,0.0003270547,0.19091494,0.8052762,0.000014886495],"about_ca_topic_score_codex":0.004722563,"about_ca_topic_score_gemma":0.006405396,"teacher_disagreement_score":0.02698023,"about_ca_system_score_codex":0.0011755292,"about_ca_system_score_gemma":0.0011834325,"threshold_uncertainty_score":0.09025782},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020435646,0.0012605079,0.017206563,0.009184393,0.00085047685,0.000060578765,0.00017941398,0.00015465893,0.9506678],"genre_scores_gemma":[0.5570544,0.001662108,0.010634595,0.0016395134,0.00029591165,0.000138018,0.00030228487,0.00019873666,0.42807445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966455,0.00013587723,0.000007877942,0.000050027258,0.00008404662,0.00005771555],"domain_scores_gemma":[0.99960333,0.00017445929,0.000016974293,0.00003280898,0.000052968462,0.00011947869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040689105,0.00042663142,0.00035821664,0.0002676785,0.0019621956,0.0031875141,0.0008859158,0.0012720472,0.06279186],"category_scores_gemma":[0.0020031198,0.00013407323,0.0002790651,0.000443701,0.002156324,0.0029716457,0.0014574406,0.0011693097,0.0044376715],"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.00009513772,0.000030030347,0.00020955176,0.000103111786,0.0000093025055,0.00013145505,0.0014347836,0.0025461307,0.0007431508,0.8876333,0.08256551,0.02449857],"study_design_scores_gemma":[0.000023763889,0.000042361607,0.0004469755,0.00012482895,0.0000063568627,0.00007655431,0.0025873065,0.007926624,0.00032841536,0.3644255,0.6239964,0.000014914536],"about_ca_topic_score_codex":0.008669386,"about_ca_topic_score_gemma":0.018693257,"teacher_disagreement_score":0.06279186,"about_ca_system_score_codex":0.0013789284,"about_ca_system_score_gemma":0.0010713066,"threshold_uncertainty_score":0.2100597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961075,0.00001723937,0.0019385159,0.00011629648,0.000009222327,0.000034768575,0.000014585727,0.00002073121,0.0017409937],"genre_scores_gemma":[0.9986572,0.0000075860476,0.0009548488,0.00004584463,0.0000021836756,0.000035779503,0.000014016506,0.0000064160126,0.00027624893],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99648607,0.0022860083,0.00014750959,0.0002915603,0.0005316601,0.00025711462],"domain_scores_gemma":[0.9765822,0.018046893,0.0023654436,0.000996431,0.00049501983,0.0015139712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031887433,0.00059170014,0.00054335,0.00028068532,0.0008023339,0.0023618697,0.00062183157,0.0012229146,0.0028179379],"category_scores_gemma":[0.031457454,0.00034937894,0.00027892995,0.00011858878,0.0020301987,0.0019454539,0.0019712164,0.0018271217,0.00024611666],"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.027599875,0.016616032,0.31271574,0.0022906344,0.00096678303,0.0072493004,0.268811,0.047118526,0.16029052,0.040255267,0.006416341,0.109669946],"study_design_scores_gemma":[0.0025402694,0.027482454,0.4206751,0.0004995018,0.00062828185,0.0025618393,0.11053677,0.33550802,0.02546371,0.05645049,0.016445985,0.0012076128],"about_ca_topic_score_codex":0.0025029965,"about_ca_topic_score_gemma":0.002043212,"teacher_disagreement_score":0.0031887433,"about_ca_system_score_codex":0.00090368564,"about_ca_system_score_gemma":0.00038649756,"threshold_uncertainty_score":0.016863883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18468593,0.00042383862,0.8055442,0.0004879141,0.000032479107,0.00012662922,0.000027967357,0.00010227411,0.008568788],"genre_scores_gemma":[0.90952855,0.00014166349,0.08855607,0.000091077745,0.000020597912,0.00009711332,0.000024223242,0.000051632058,0.0014891234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810827,0.0012044943,0.000055209355,0.00017775613,0.00023502574,0.00021932415],"domain_scores_gemma":[0.99258024,0.0061087846,0.00040085637,0.00021603575,0.00036181218,0.00033223003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035903428,0.0010489094,0.0011286427,0.00088142016,0.0006107114,0.0012605841,0.0013665649,0.0011330983,0.001793348],"category_scores_gemma":[0.0155488,0.00079820264,0.00068672164,0.00048326203,0.0011574086,0.0021825442,0.0017306472,0.0014286294,0.0001692088],"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.00028273504,0.0001822613,0.0021900537,0.00012393916,0.00010833429,0.00007637214,0.0002759309,0.88363063,0.0024435485,0.06850517,0.00068794144,0.041493166],"study_design_scores_gemma":[0.000039819162,0.00014415778,0.00019815647,0.000019687399,0.000025162275,0.000021496218,0.000055662487,0.94806,0.00054094783,0.050483774,0.00040340467,0.000007768208],"about_ca_topic_score_codex":0.0011949838,"about_ca_topic_score_gemma":0.0021420002,"teacher_disagreement_score":0.0035903428,"about_ca_system_score_codex":0.0012368219,"about_ca_system_score_gemma":0.00127655,"threshold_uncertainty_score":0.018987775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.277831,0.0013801287,0.6930957,0.0013170762,0.0002484799,0.00035109438,0.0025664747,0.013451739,0.009758325],"genre_scores_gemma":[0.79390913,0.00012955024,0.19871604,0.00034876572,0.000069036294,0.00021100357,0.0028351734,0.00044540438,0.0033359248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873656,0.00056387915,0.000047027468,0.00030988915,0.00015860939,0.00018409839],"domain_scores_gemma":[0.996662,0.0023324045,0.00021277615,0.0003795128,0.00026056432,0.00015268518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029960575,0.0012887936,0.0008464604,0.0011837679,0.000801841,0.0010534328,0.0016573463,0.0015406323,0.003740618],"category_scores_gemma":[0.008837383,0.00056217995,0.00090209674,0.00055343634,0.0006910392,0.0015094631,0.0011441065,0.0022156853,0.0013279717],"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.0010281341,0.0005282974,0.012290589,0.00017491452,0.00016442436,0.00022558364,0.00023945449,0.78943396,0.0039486075,0.012238657,0.013414944,0.16631244],"study_design_scores_gemma":[0.000024317193,0.000029105231,0.00050651643,0.000009234264,0.0000057244083,0.000019277602,0.000015192559,0.99036205,0.00073105807,0.007694814,0.0005950655,0.000007617081],"about_ca_topic_score_codex":0.012727128,"about_ca_topic_score_gemma":0.024459762,"teacher_disagreement_score":0.012727128,"about_ca_system_score_codex":0.0011833721,"about_ca_system_score_gemma":0.0010507196,"threshold_uncertainty_score":0.025306106},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021437913,0.0000883714,0.9682571,0.00017679617,0.000026491909,0.00016685174,0.00008985316,0.002540695,0.0072160494],"genre_scores_gemma":[0.26983672,0.00015973598,0.7241328,0.000115230425,0.000013023309,0.000374791,0.0002392747,0.0005438028,0.004584599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993389,0.00023048632,0.00008518046,0.00010043317,0.00019635414,0.000048578353],"domain_scores_gemma":[0.9987985,0.0007913682,0.000100837875,0.00011356011,0.00014193552,0.000053739488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086641556,0.0006538654,0.00027651884,0.00047844616,0.00034147844,0.0012286806,0.0008997302,0.00052981067,0.0059814923],"category_scores_gemma":[0.0052462644,0.00032710776,0.0005379897,0.0002472602,0.0012832572,0.0011480865,0.0008648632,0.00094557396,0.0007058498],"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.00018944088,0.00022716651,0.0013204998,0.00067697396,0.00003864459,0.00025241362,0.0014349414,0.15090723,0.029209694,0.6371563,0.0036818634,0.17490482],"study_design_scores_gemma":[0.00013458308,0.00020919196,0.0003628393,0.00013684644,0.000045616896,0.00025239983,0.00024259367,0.70489305,0.031326234,0.20759663,0.05475943,0.00004062036],"about_ca_topic_score_codex":0.0016937687,"about_ca_topic_score_gemma":0.0024803728,"teacher_disagreement_score":0.0059814923,"about_ca_system_score_codex":0.0009847536,"about_ca_system_score_gemma":0.0011088591,"threshold_uncertainty_score":0.020010114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1485063,0.0059944727,0.6486768,0.017063288,0.0016283665,0.0001267823,0.00020808828,0.00044686865,0.17734912],"genre_scores_gemma":[0.8842451,0.002691362,0.09502269,0.0025643236,0.0013047889,0.00019312782,0.00012146987,0.00046607255,0.01339111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966365,0.0014113043,0.000093678726,0.00080069917,0.00071498204,0.00034288334],"domain_scores_gemma":[0.9867764,0.009864657,0.0006932321,0.0010918935,0.00056891295,0.0010049292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002645154,0.0010163008,0.001610493,0.0011171896,0.0022214097,0.0031004602,0.0031851153,0.0021767323,0.0068292185],"category_scores_gemma":[0.016421976,0.00074682035,0.001205073,0.0010576975,0.008330258,0.014288689,0.00520009,0.0052041044,0.00074309536],"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.000054503882,0.000016417664,0.00032358192,0.00006656959,0.000017068902,0.00013930761,0.00022958175,0.008199925,0.00069824833,0.98329747,0.0031211567,0.0038362318],"study_design_scores_gemma":[0.00003466089,0.00008947421,0.00043034132,0.00006806683,0.000023367827,0.00025362356,0.00022119816,0.06142046,0.0011393551,0.9185586,0.017701589,0.000059350885],"about_ca_topic_score_codex":0.002043174,"about_ca_topic_score_gemma":0.0014452945,"teacher_disagreement_score":0.0068292185,"about_ca_system_score_codex":0.0018493464,"about_ca_system_score_gemma":0.00061032,"threshold_uncertainty_score":0.022846043},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025524686,0.00013594767,0.96369827,0.00015319609,0.000103250975,0.00013964753,0.00017717751,0.028221825,0.0048182723],"genre_scores_gemma":[0.108704686,0.00038466605,0.86375445,0.0005774059,0.000107551845,0.0009440714,0.0012059638,0.014966982,0.009354275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781215,0.00040642277,0.00025791337,0.0003207902,0.0009552958,0.00024750805],"domain_scores_gemma":[0.99761814,0.0008855748,0.00012884663,0.00078102225,0.00043642407,0.00015001763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034086008,0.0008848913,0.0008620384,0.0010698375,0.0007744421,0.0032031226,0.0053055924,0.0019063387,0.011434843],"category_scores_gemma":[0.012841404,0.0014369915,0.0016518302,0.00084945565,0.001681225,0.0038365743,0.0033499585,0.0038909249,0.0045819324],"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.0008910346,0.0005526946,0.005554113,0.001095649,0.00023781552,0.00058205356,0.0012260744,0.1269118,0.029419556,0.34253883,0.065276176,0.42571428],"study_design_scores_gemma":[0.00023685579,0.00013022813,0.00067896344,0.0002692036,0.00008832307,0.00032852698,0.00007564008,0.70751315,0.023334531,0.09792347,0.16927487,0.00014618224],"about_ca_topic_score_codex":0.0036116624,"about_ca_topic_score_gemma":0.0032304572,"teacher_disagreement_score":0.011434843,"about_ca_system_score_codex":0.0015799513,"about_ca_system_score_gemma":0.0027874715,"threshold_uncertainty_score":0.038253367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03318481,0.000081969956,0.9608225,0.00016230748,0.000031417872,0.00011071217,0.000034428733,0.0012047156,0.004367124],"genre_scores_gemma":[0.6658637,0.000086973945,0.325351,0.00017239377,0.000023930774,0.00028351418,0.00019894737,0.0003016738,0.007717897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993666,0.00024849057,0.000019948213,0.00016833737,0.00012998754,0.00006672724],"domain_scores_gemma":[0.99827945,0.0009848361,0.000099712415,0.00035479295,0.00017461498,0.00010658852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014923605,0.0008245886,0.0006718737,0.0006148545,0.00049328466,0.0012388456,0.0019058953,0.00117947,0.0052874624],"category_scores_gemma":[0.005635885,0.00047829407,0.0007458573,0.00039597115,0.0014304285,0.0020103278,0.0034128306,0.0015418674,0.00095629523],"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.0002128038,0.0003775318,0.0022107414,0.00016170899,0.00007979679,0.00022118073,0.0008734975,0.6237001,0.013385543,0.04606914,0.0031624583,0.3095456],"study_design_scores_gemma":[0.000019407356,0.000031525382,0.000121352794,0.000007313968,0.0000038511444,0.000022687704,0.000046046098,0.97931343,0.0020166002,0.017542772,0.00086736615,0.00000765522],"about_ca_topic_score_codex":0.0016128324,"about_ca_topic_score_gemma":0.0019759312,"teacher_disagreement_score":0.0052874624,"about_ca_system_score_codex":0.0008105167,"about_ca_system_score_gemma":0.00048570463,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05434894,0.00077504496,0.93494034,0.000507569,0.00013935962,0.00030950143,0.00040613944,0.0034193848,0.00515376],"genre_scores_gemma":[0.7136191,0.0002684915,0.2769256,0.000257964,0.0000748839,0.00029552518,0.0011138484,0.0001579172,0.007286571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913055,0.00032761315,0.00004330141,0.0001596662,0.00022780507,0.00011095536],"domain_scores_gemma":[0.9980903,0.0012316437,0.000109334775,0.00018177707,0.0003077816,0.00007913227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021659064,0.0007523736,0.00087818137,0.0012638554,0.0005225602,0.0007814822,0.0011953709,0.0011950446,0.0031848429],"category_scores_gemma":[0.0043319915,0.0002956052,0.0007560015,0.00065827696,0.0004283148,0.00095014,0.00047917434,0.0015992953,0.0013725313],"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.0002753943,0.00034988142,0.0021815505,0.000086929605,0.000079611265,0.00010345241,0.000047814312,0.64100635,0.0042499085,0.008118827,0.008908555,0.3345916],"study_design_scores_gemma":[0.0000051028933,0.000015562731,0.00010463575,0.0000030969509,0.0000026084963,0.000009052546,0.0000026646971,0.9974936,0.00041355932,0.0016123657,0.00033522278,0.0000025869037],"about_ca_topic_score_codex":0.008496427,"about_ca_topic_score_gemma":0.011848061,"teacher_disagreement_score":0.008496427,"about_ca_system_score_codex":0.0010811104,"about_ca_system_score_gemma":0.00092155964,"threshold_uncertainty_score":0.016893983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038082924,0.0002946902,0.959056,0.00019808392,0.000042844204,0.00006468018,0.00011658242,0.0007649662,0.0013791365],"genre_scores_gemma":[0.7754038,0.000228678,0.22045338,0.00020922127,0.00008138818,0.00022868322,0.00069885526,0.0002141397,0.0024820252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878174,0.0005224803,0.00005091032,0.00027881647,0.00025487712,0.000111149806],"domain_scores_gemma":[0.99247783,0.0054841223,0.00032205533,0.00081387314,0.0006588708,0.0002433119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032074004,0.0007029015,0.0012647773,0.0011100527,0.00067784317,0.0011395785,0.0016515991,0.0012224434,0.0025717253],"category_scores_gemma":[0.010136879,0.00062909035,0.0008675886,0.0007943991,0.0007617318,0.0019541448,0.0016546383,0.002410364,0.00055379304],"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.00009139143,0.00009637516,0.0017948758,0.000039044095,0.00007957706,0.000040838564,0.00010155828,0.8736732,0.00111852,0.0143230995,0.0014001102,0.10724149],"study_design_scores_gemma":[0.0000023871007,0.000008864487,0.00006283865,0.0000023594343,0.00000237713,0.0000031150296,0.0000029700075,0.99602145,0.00017160177,0.003601692,0.000118009586,0.000002267179],"about_ca_topic_score_codex":0.0040114135,"about_ca_topic_score_gemma":0.0072227796,"teacher_disagreement_score":0.0040114135,"about_ca_system_score_codex":0.0012326327,"about_ca_system_score_gemma":0.0009438894,"threshold_uncertainty_score":0.016962528},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36253452,0.00090932875,0.60668343,0.0021479593,0.000074155025,0.00010023744,0.00022714624,0.0004913153,0.026831962],"genre_scores_gemma":[0.95888317,0.00026135758,0.036685094,0.000067614244,0.000015514404,0.00007255859,0.00007695493,0.000028839637,0.0039088954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967134,0.00014090806,0.0000173094,0.00008745653,0.000044253826,0.000038873794],"domain_scores_gemma":[0.9988288,0.00072492036,0.00016955181,0.000110545276,0.0000889013,0.00007723761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057727465,0.00040485393,0.0004007255,0.0003769064,0.00031423566,0.0011828352,0.00084151817,0.0012909552,0.0025905715],"category_scores_gemma":[0.004695394,0.00043382932,0.00058063655,0.00036143273,0.0017509275,0.0019314592,0.0008837504,0.0011484748,0.00042463478],"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.000058872098,0.000051458184,0.0026772365,0.00005979133,0.000028746857,0.00014925805,0.00038483748,0.8948479,0.0019544275,0.0862271,0.000399162,0.013161077],"study_design_scores_gemma":[0.000011142855,0.000023416478,0.00054639403,0.000006934802,0.0000064852734,0.000033159802,0.0000281909,0.9321956,0.0002818309,0.066313036,0.000543722,0.00001020772],"about_ca_topic_score_codex":0.01361066,"about_ca_topic_score_gemma":0.008330364,"teacher_disagreement_score":0.01361066,"about_ca_system_score_codex":0.0010440408,"about_ca_system_score_gemma":0.0009850078,"threshold_uncertainty_score":0.027062893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075747296,0.00015051244,0.9144205,0.00021228896,0.00009201204,0.00012427258,0.00054577645,0.0048388266,0.0038685864],"genre_scores_gemma":[0.66236645,0.00014067326,0.32947904,0.00019555727,0.000020409081,0.00030362786,0.0016706423,0.0006634838,0.005160227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981123,0.00003199802,0.0000075165394,0.00008847458,0.000035915495,0.00002490241],"domain_scores_gemma":[0.99968004,0.00016945244,0.000027020858,0.00003988065,0.000054944365,0.000028669781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002941318,0.000974034,0.000334711,0.0004982494,0.00017266654,0.0006456754,0.00084127404,0.0006853179,0.0040088575],"category_scores_gemma":[0.0021934102,0.0004265267,0.00053996115,0.00025834166,0.00043088006,0.0012055937,0.0010979599,0.001247887,0.00096296694],"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.00031235977,0.00022897929,0.0030696022,0.00028032903,0.00012606269,0.00026562292,0.000450801,0.47195318,0.05029556,0.0145630995,0.007292913,0.45116153],"study_design_scores_gemma":[0.000020585421,0.00006063978,0.00041319922,0.000016631042,0.000012757763,0.000026721751,0.000045135057,0.97878635,0.007608766,0.011711068,0.0012881672,0.000010137665],"about_ca_topic_score_codex":0.0018314011,"about_ca_topic_score_gemma":0.0046460954,"teacher_disagreement_score":0.0040088575,"about_ca_system_score_codex":0.0005751772,"about_ca_system_score_gemma":0.00043124965,"threshold_uncertainty_score":0.0134109855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46930557,0.001851275,0.29567498,0.005041931,0.0005618129,0.0001229092,0.0003922763,0.00046837862,0.2265809],"genre_scores_gemma":[0.92766714,0.00067732064,0.021273421,0.00028621554,0.00018961764,0.000047252077,0.00019091011,0.0002351578,0.049432985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.00013259592,0.000022993181,0.00012886898,0.00011715741,0.00019961045],"domain_scores_gemma":[0.9976088,0.001272878,0.00022115064,0.0002463333,0.00019125745,0.00045957265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470359,0.0006106339,0.0016032441,0.0012039618,0.0026890875,0.0027131115,0.0015370124,0.002573595,0.012732474],"category_scores_gemma":[0.005686484,0.00077228906,0.0010156798,0.0011151943,0.0029395756,0.006134146,0.0030939248,0.0027852207,0.000915192],"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.000055545013,0.00002348172,0.00017214306,0.00004130945,0.000010142053,0.00012888727,0.0002788546,0.0054449467,0.00029143807,0.9874483,0.0023389808,0.0037661158],"study_design_scores_gemma":[0.000015482601,0.000012281714,0.00015988087,0.000012374193,0.000008153049,0.000072169314,0.000109220666,0.01820716,0.00010478396,0.97913945,0.002150261,0.000008831755],"about_ca_topic_score_codex":0.0046257228,"about_ca_topic_score_gemma":0.0045741834,"teacher_disagreement_score":0.012732474,"about_ca_system_score_codex":0.000949711,"about_ca_system_score_gemma":0.0007783863,"threshold_uncertainty_score":0.042594373},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16293417,0.009423585,0.7873333,0.0038403408,0.0006142957,0.00045547515,0.00048361084,0.011525225,0.02338991],"genre_scores_gemma":[0.6320138,0.0013736454,0.35549477,0.0015813472,0.00018436348,0.000536999,0.00084631273,0.0015254222,0.006443383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966461,0.0019891404,0.00012387359,0.0004167279,0.00055731554,0.00026673864],"domain_scores_gemma":[0.9889852,0.008120019,0.00046162243,0.0011671248,0.0007643286,0.00050178025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008242547,0.002324811,0.0017282079,0.0017809336,0.0009830339,0.0017773854,0.003060622,0.002534799,0.0048311977],"category_scores_gemma":[0.02260445,0.000835035,0.0011291363,0.00097476103,0.0022236884,0.0040950994,0.0037691342,0.005314826,0.0013999682],"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.0013528011,0.00050043047,0.005606747,0.00048247018,0.0002560229,0.000095135474,0.00032195213,0.7092276,0.0017479296,0.031532086,0.012017056,0.2368597],"study_design_scores_gemma":[0.000117976284,0.00023986046,0.00033034044,0.00008426385,0.000025354579,0.00005083687,0.000047664453,0.9766188,0.00082620996,0.018895568,0.0027374816,0.000025646968],"about_ca_topic_score_codex":0.006078199,"about_ca_topic_score_gemma":0.009698923,"teacher_disagreement_score":0.008242547,"about_ca_system_score_codex":0.0016471635,"about_ca_system_score_gemma":0.0024353699,"threshold_uncertainty_score":0.04359126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019070532,0.0031431967,0.7231767,0.0025712454,0.0004036572,0.00017206666,0.0007761835,0.0010516755,0.24963468],"genre_scores_gemma":[0.56912196,0.0037940207,0.31237394,0.0007399365,0.00052907964,0.0005107522,0.0024805826,0.00061737397,0.1098323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986621,0.0004247441,0.0000907523,0.00019294077,0.00042276309,0.00020675574],"domain_scores_gemma":[0.99902344,0.0006371315,0.00005239179,0.00009888156,0.00012541318,0.00006271613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481717,0.0012902097,0.0010892312,0.0011078413,0.0013610162,0.003666158,0.0023981598,0.00092238665,0.016834145],"category_scores_gemma":[0.003985865,0.0006212703,0.0014246304,0.0022439002,0.0024566068,0.005354418,0.0023831779,0.004398421,0.0021736699],"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.000018718645,0.00003627697,0.00005043129,0.00014308207,0.000013004626,0.000019799583,0.0001332347,0.004187878,0.00036277526,0.9596546,0.0048273606,0.030552832],"study_design_scores_gemma":[0.000013028651,0.00000769865,0.00007211231,0.000041758773,0.000013708983,0.000016637143,0.000044125994,0.013433133,0.00035997643,0.9776123,0.008374956,0.000010441136],"about_ca_topic_score_codex":0.0052379845,"about_ca_topic_score_gemma":0.006305488,"teacher_disagreement_score":0.016834145,"about_ca_system_score_codex":0.0037782893,"about_ca_system_score_gemma":0.00146766,"threshold_uncertainty_score":0.05631578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110580094,0.0030579825,0.5514331,0.015653964,0.0017940111,0.0007357195,0.00070626853,0.002901885,0.31313697],"genre_scores_gemma":[0.65326875,0.0017935453,0.28998375,0.0013572843,0.00043222526,0.0006549701,0.000806268,0.00092065526,0.05078254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970462,0.0019830065,0.000100947924,0.00030599558,0.00039395667,0.00016989818],"domain_scores_gemma":[0.99179584,0.0051339134,0.00033478785,0.0013156919,0.00053705677,0.00088271167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030343581,0.0013426655,0.0005005617,0.0028586402,0.0046134177,0.010592285,0.0022722818,0.0017146318,0.015456316],"category_scores_gemma":[0.010351124,0.00062563166,0.00086217595,0.0016499134,0.007814525,0.011885295,0.009869035,0.0035718647,0.0026598133],"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.0003329106,0.00022030967,0.0025137071,0.0008810488,0.000087970075,0.002159317,0.21869603,0.0070325006,0.008139852,0.56072164,0.039024744,0.16018996],"study_design_scores_gemma":[0.00009633986,0.00025202907,0.0012793089,0.00087399886,0.00005674574,0.001438666,0.04708519,0.01615785,0.004538988,0.3372574,0.59082204,0.00014137402],"about_ca_topic_score_codex":0.0010661392,"about_ca_topic_score_gemma":0.0019994378,"teacher_disagreement_score":0.015456316,"about_ca_system_score_codex":0.0014324753,"about_ca_system_score_gemma":0.0009674121,"threshold_uncertainty_score":0.051706553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18149488,0.00032567672,0.80400217,0.00066424493,0.0000749671,0.00016205577,0.00005653678,0.00018282943,0.013036627],"genre_scores_gemma":[0.97055954,0.00010258954,0.025182236,0.000059801267,0.000019209205,0.00010128928,0.000023739145,0.000011459057,0.0039401804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999469,0.00023175578,0.000025394755,0.000071419825,0.000112577196,0.000089941335],"domain_scores_gemma":[0.9981421,0.0013240199,0.0001399462,0.00006824833,0.00015448708,0.00017119871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013517354,0.00065834285,0.0009636469,0.00041845368,0.00037738544,0.0009155767,0.0010702896,0.00090918544,0.0025241901],"category_scores_gemma":[0.0041474802,0.00032532663,0.00045846344,0.00027167474,0.0009080873,0.001027872,0.0012199611,0.0012995154,0.00019543883],"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.00017714448,0.0001848219,0.0010333145,0.000062502884,0.000055921373,0.00008233286,0.000102324375,0.93714666,0.0010002576,0.030226193,0.00058316434,0.029345382],"study_design_scores_gemma":[0.000019074774,0.000041529096,0.000050335344,0.0000031144118,0.000003552475,0.000004560628,0.000004776294,0.99455786,0.000093848335,0.0051181093,0.0001008486,0.0000024578426],"about_ca_topic_score_codex":0.0054300916,"about_ca_topic_score_gemma":0.004579858,"teacher_disagreement_score":0.0054300916,"about_ca_system_score_codex":0.0012422932,"about_ca_system_score_gemma":0.0010975474,"threshold_uncertainty_score":0.010796964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040995474,0.0024626013,0.92741686,0.0063205194,0.0011274084,0.0010019634,0.0012397626,0.020493777,0.035837546],"genre_scores_gemma":[0.08137351,0.0027201904,0.8832743,0.0026159582,0.0011929969,0.0022883192,0.0028904837,0.011274156,0.012370129],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.92803514,0.049738213,0.004432627,0.0050276793,0.011925277,0.0008410452],"domain_scores_gemma":[0.87208724,0.08383344,0.0049020294,0.022133684,0.013932936,0.003110617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0508668,0.0019502754,0.0016844791,0.0037417447,0.0012156664,0.012483326,0.004237613,0.0024661853,0.023455715],"category_scores_gemma":[0.108923584,0.0009437636,0.0018265924,0.0040053157,0.004887272,0.013231381,0.0101256985,0.004519078,0.012563209],"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.000898988,0.00036644877,0.0027207322,0.0030040287,0.00021895673,0.00016613532,0.002992777,0.0042696144,0.0039547607,0.20598403,0.08298451,0.69243896],"study_design_scores_gemma":[0.00030452505,0.000605822,0.0021698007,0.0019707344,0.00012332236,0.0005462013,0.0010326783,0.03508319,0.0038748006,0.43892688,0.5151963,0.00016579051],"about_ca_topic_score_codex":0.0011776132,"about_ca_topic_score_gemma":0.0013884485,"teacher_disagreement_score":0.0508668,"about_ca_system_score_codex":0.0018523778,"about_ca_system_score_gemma":0.004304034,"threshold_uncertainty_score":0.26901257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045657903,0.00015026175,0.9446501,0.00013833311,0.000041417698,0.0005595502,0.0000833913,0.0047591096,0.0039598495],"genre_scores_gemma":[0.49397734,0.00013168615,0.50100833,0.0002264367,0.000023443967,0.00071046356,0.00017550375,0.00031170537,0.0034350909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.00019492426,0.000026019143,0.00013111054,0.00015498669,0.00003756882],"domain_scores_gemma":[0.99880075,0.0007470686,0.00011869039,0.00017767736,0.00008805243,0.00006761936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081670424,0.00060218247,0.00035991843,0.00039349325,0.00016078465,0.00051912054,0.0012986603,0.0006818501,0.0031913286],"category_scores_gemma":[0.002793375,0.0002569055,0.0003914359,0.00014534485,0.00048602535,0.00057839294,0.0011943039,0.00068412116,0.00081085967],"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.0004882369,0.0016874281,0.0038878655,0.0005889447,0.00010416987,0.00042828397,0.0007342582,0.15031783,0.059522614,0.005045908,0.0040295897,0.773165],"study_design_scores_gemma":[0.00020474187,0.0007395714,0.002262905,0.000072319854,0.00005105661,0.0006267034,0.00008247018,0.94493055,0.033682205,0.007201651,0.010078742,0.00006700834],"about_ca_topic_score_codex":0.0006758235,"about_ca_topic_score_gemma":0.0011948774,"teacher_disagreement_score":0.0031913286,"about_ca_system_score_codex":0.0003625925,"about_ca_system_score_gemma":0.00046848346,"threshold_uncertainty_score":0.010676026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03227741,0.00025647294,0.9651652,0.00014778019,0.000038716604,0.000061298626,0.00009487816,0.0007043579,0.0012538923],"genre_scores_gemma":[0.75585985,0.00023185778,0.24015614,0.0001878157,0.00007189828,0.00023448121,0.00062882225,0.00020813548,0.002420955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988433,0.00047465367,0.000048729704,0.00025656584,0.00026852355,0.00010820131],"domain_scores_gemma":[0.9933094,0.0047212904,0.00030341942,0.00077470444,0.00066820363,0.00022309636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003043306,0.00065969856,0.0012359087,0.0011090196,0.00064381503,0.0010584021,0.0016453782,0.001161062,0.0025952775],"category_scores_gemma":[0.009380362,0.0005819671,0.0008333641,0.0007879325,0.0007029243,0.0019114172,0.0016111833,0.0022030345,0.00055083336],"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.00008387779,0.000084312625,0.0015975788,0.000036094454,0.00007353892,0.00004171072,0.000092628004,0.87451994,0.0012235395,0.012323724,0.0011541604,0.10876893],"study_design_scores_gemma":[0.00000230683,0.000010014987,0.000068654765,0.0000023523821,0.00000244088,0.0000036587267,0.000002989562,0.9965148,0.0001906644,0.003070074,0.00012955889,0.0000023893128],"about_ca_topic_score_codex":0.0037934752,"about_ca_topic_score_gemma":0.006635142,"teacher_disagreement_score":0.0037934752,"about_ca_system_score_codex":0.0011314922,"about_ca_system_score_gemma":0.00093448925,"threshold_uncertainty_score":0.016094744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049077077,0.00015947907,0.9705719,0.00015777825,0.00011008196,0.0002750665,0.000110411056,0.011079748,0.01262795],"genre_scores_gemma":[0.1056701,0.00044640552,0.87013495,0.00032937058,0.00003757681,0.0007420782,0.0006420504,0.0022779722,0.019719454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990164,0.00016286087,0.00014058604,0.00020546549,0.0003266925,0.00014803105],"domain_scores_gemma":[0.99950397,0.000104660416,0.000041317548,0.00010130269,0.00018021635,0.00006847943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001161448,0.00058567413,0.00048079286,0.00057564065,0.000524126,0.0022494711,0.0019325,0.0006446633,0.00866137],"category_scores_gemma":[0.0016607083,0.0006215124,0.0010106541,0.00041201676,0.00074929005,0.0015950325,0.0009658125,0.0014299693,0.0029364158],"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.00091949356,0.0010277191,0.006339029,0.0016067281,0.00027654992,0.0011554605,0.0014629202,0.035987053,0.0756857,0.27317563,0.037171666,0.56519204],"study_design_scores_gemma":[0.0006449493,0.000667867,0.003685947,0.00041878253,0.00028512892,0.0020718868,0.0002368824,0.3627691,0.07797756,0.07322852,0.47773597,0.00027745604],"about_ca_topic_score_codex":0.0031267325,"about_ca_topic_score_gemma":0.0025060591,"teacher_disagreement_score":0.00866137,"about_ca_system_score_codex":0.00055511977,"about_ca_system_score_gemma":0.0014451838,"threshold_uncertainty_score":0.02897513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70542973,0.0024623452,0.20770463,0.0031886955,0.00013849072,0.00013183105,0.0004478985,0.0003022698,0.08019413],"genre_scores_gemma":[0.9611798,0.0013728227,0.024698386,0.00021775467,0.00016169874,0.00010923287,0.00025075674,0.000075861004,0.011933742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990858,0.0003448356,0.000047865295,0.0001891705,0.00016662649,0.00016565113],"domain_scores_gemma":[0.99679226,0.0020568378,0.00044253372,0.00020850674,0.00012336238,0.0003765278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073875766,0.00071405154,0.0007005512,0.0018005513,0.0011340621,0.003145118,0.0007638151,0.001277228,0.0043439553],"category_scores_gemma":[0.005509313,0.0005062777,0.0005454411,0.001641214,0.0037396848,0.005651729,0.0017466506,0.0017272761,0.0003421277],"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.000041627518,0.000019900262,0.00074738526,0.000059825976,0.000010582384,0.000078981364,0.00038700947,0.011352251,0.000793619,0.9781532,0.0012716433,0.007083917],"study_design_scores_gemma":[0.000011537118,0.000019706356,0.00071844476,0.000022030328,0.0000072850276,0.00007459177,0.00022391912,0.029177453,0.0003798969,0.96645755,0.002894024,0.00001360768],"about_ca_topic_score_codex":0.0030371998,"about_ca_topic_score_gemma":0.0025630838,"teacher_disagreement_score":0.0043439553,"about_ca_system_score_codex":0.0018577672,"about_ca_system_score_gemma":0.0004980512,"threshold_uncertainty_score":0.01453197},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011425799,0.22226243,0.06907926,0.23510492,0.15090224,0.00158124,0.0009014034,0.002643673,0.3060991],"genre_scores_gemma":[0.07261344,0.23151883,0.06246505,0.10450927,0.041270286,0.0016359094,0.0011464914,0.0012194552,0.48362127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876535,0.00055390963,0.000092585695,0.00013638176,0.00029175155,0.00016007613],"domain_scores_gemma":[0.9979589,0.0011476142,0.00007752937,0.00007333168,0.00036336298,0.00037923077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019948047,0.0016200976,0.00056752394,0.001123862,0.0023181592,0.003444187,0.0013234409,0.0046409713,0.038163688],"category_scores_gemma":[0.0044133742,0.0004918583,0.0007521506,0.0006107847,0.0022333867,0.005930766,0.003506353,0.0057074493,0.013632545],"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.00018929891,0.00024426111,0.00016430648,0.0012250163,0.000014440497,0.0005564691,0.0028145106,0.00034728838,0.0033288824,0.029265877,0.67807275,0.2837769],"study_design_scores_gemma":[0.000012623129,0.00012419446,0.00018302277,0.00053910917,0.000004254202,0.0003436757,0.0009469243,0.00007734668,0.0003550765,0.004211703,0.99318165,0.000020351714],"about_ca_topic_score_codex":0.0027823932,"about_ca_topic_score_gemma":0.008180172,"teacher_disagreement_score":0.038163688,"about_ca_system_score_codex":0.0020346176,"about_ca_system_score_gemma":0.0013909262,"threshold_uncertainty_score":0.12767029},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018890025,0.003517009,0.08844602,0.02139908,0.0012489022,0.00007812576,0.0002333784,0.00035608053,0.86583143],"genre_scores_gemma":[0.7513983,0.004475756,0.05642655,0.0051259995,0.00086352177,0.00028716022,0.00035681302,0.00038321322,0.18068267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993278,0.0002496946,0.00004058066,0.00013604925,0.0001522815,0.00009363448],"domain_scores_gemma":[0.99910754,0.0005022355,0.000060423263,0.00009956735,0.00014104783,0.00008920871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007736083,0.0006430586,0.00063673506,0.0010096182,0.0015816017,0.0034581365,0.001039629,0.0019626776,0.01594143],"category_scores_gemma":[0.003367214,0.0004980891,0.0005535856,0.00078893395,0.005315913,0.008677811,0.001160754,0.0027964078,0.0030024424],"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.000010762839,0.000012518114,0.00007792405,0.000048750742,0.0000053309454,0.000019258698,0.00013119714,0.00033200352,0.0001443937,0.9855487,0.0049396586,0.008729561],"study_design_scores_gemma":[0.00000747606,0.000011369784,0.00014739962,0.000083593826,0.0000065834147,0.0000782335,0.00021114001,0.0013922139,0.0002263772,0.9516574,0.046169687,0.000008477377],"about_ca_topic_score_codex":0.0016968312,"about_ca_topic_score_gemma":0.0024094642,"teacher_disagreement_score":0.01594143,"about_ca_system_score_codex":0.001178163,"about_ca_system_score_gemma":0.0011698963,"threshold_uncertainty_score":0.05332941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10346738,0.009866821,0.6752095,0.01041806,0.0020402144,0.00048741582,0.0008511764,0.0007408574,0.19691852],"genre_scores_gemma":[0.71933466,0.0026817475,0.25797737,0.0014751519,0.0005442479,0.00045363817,0.0017031779,0.00053009175,0.015299948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904398,0.0050891894,0.0011074496,0.0013249281,0.0014224785,0.00061608007],"domain_scores_gemma":[0.98007476,0.011682026,0.002078461,0.0022259005,0.0030180032,0.0009208108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073942207,0.001655639,0.00079451187,0.0073613194,0.00398603,0.011011275,0.0017554123,0.0030932408,0.0070675486],"category_scores_gemma":[0.032136403,0.0007436919,0.0015381441,0.00460101,0.010109032,0.02148824,0.0063033192,0.0043813586,0.0021931443],"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.000055647444,0.000041095172,0.003149071,0.0002462787,0.000018957246,0.00020103366,0.005334897,0.0008897216,0.0005641845,0.9626037,0.0027518233,0.024143605],"study_design_scores_gemma":[0.000032536907,0.00009925605,0.0030990727,0.0007721522,0.00005091281,0.0011461083,0.010304523,0.014971485,0.0010522909,0.79496914,0.17339341,0.00010914188],"about_ca_topic_score_codex":0.0019792223,"about_ca_topic_score_gemma":0.0021725635,"teacher_disagreement_score":0.011011275,"about_ca_system_score_codex":0.0027893053,"about_ca_system_score_gemma":0.002329669,"threshold_uncertainty_score":0.03910488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07422934,0.000111724825,0.91807747,0.00021231067,0.000058199814,0.00015371147,0.000040735627,0.001623914,0.005492635],"genre_scores_gemma":[0.84578526,0.00005200593,0.15083809,0.0001463874,0.000016299411,0.00014311203,0.00008325422,0.00014429666,0.0027912427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996131,0.00009827376,0.000019275478,0.000090562964,0.00011680708,0.00006195873],"domain_scores_gemma":[0.998933,0.00053860457,0.00013383653,0.00014487321,0.00014254503,0.00010709505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008775807,0.0008284433,0.0004902091,0.00038445566,0.00027779434,0.00089269213,0.0014856799,0.0007878848,0.0026004557],"category_scores_gemma":[0.004087804,0.0003471139,0.00037462398,0.00018635845,0.0007813199,0.001094448,0.0011020274,0.0013930929,0.0004986174],"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.00019052552,0.00034023006,0.0021808236,0.000070518865,0.000049189082,0.00012270882,0.0001478843,0.8404246,0.014391324,0.013109824,0.0012687441,0.1277036],"study_design_scores_gemma":[0.000013879585,0.000055321143,0.00010314062,0.0000045665156,0.000004464073,0.000012304348,0.0000068130616,0.99503374,0.0018304375,0.0025299888,0.00039938278,0.0000059313998],"about_ca_topic_score_codex":0.002981621,"about_ca_topic_score_gemma":0.0041216486,"teacher_disagreement_score":0.002981621,"about_ca_system_score_codex":0.00075887865,"about_ca_system_score_gemma":0.0009257778,"threshold_uncertainty_score":0.008699417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020466164,0.00017866777,0.9731525,0.00023458709,0.00007209089,0.0001365977,0.000119420205,0.0008269704,0.0048130676],"genre_scores_gemma":[0.41652215,0.00013932379,0.57772547,0.0002889109,0.000058434143,0.00064574357,0.00047269158,0.00036311336,0.0037840868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988865,0.00047611774,0.00005773353,0.00017685053,0.0002680812,0.00013472594],"domain_scores_gemma":[0.9932916,0.0053067342,0.00020539691,0.00049403834,0.0005162193,0.00018585783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026734676,0.0008382414,0.0018974881,0.0016206261,0.0011167554,0.001337145,0.0022789985,0.0031368006,0.008190567],"category_scores_gemma":[0.014138242,0.0013299438,0.0015049988,0.0015169566,0.0015937954,0.0025315133,0.0022319686,0.0031940797,0.0011245582],"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.00016243671,0.00007514949,0.0005855554,0.000054083463,0.000050760846,0.00007943828,0.000082502906,0.9345802,0.00048023692,0.030096635,0.0013967037,0.032356266],"study_design_scores_gemma":[0.00001503322,0.000009031496,0.000024204666,0.000005880977,0.000006012178,0.000005885134,0.0000038658163,0.99287426,0.00009936214,0.0067914105,0.00016184937,0.0000032541584],"about_ca_topic_score_codex":0.010544602,"about_ca_topic_score_gemma":0.015873367,"teacher_disagreement_score":0.010544602,"about_ca_system_score_codex":0.00146055,"about_ca_system_score_gemma":0.003440946,"threshold_uncertainty_score":0.027400196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13811745,0.0011130056,0.8145498,0.0003732851,0.00019839451,0.00013609954,0.000070219634,0.000649128,0.04479261],"genre_scores_gemma":[0.96048886,0.00014457664,0.0258015,0.000034401655,0.00003121136,0.00006246801,0.000031291143,0.000053507294,0.0133522265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959546,0.00010340676,0.000020455755,0.00008943674,0.00010887436,0.00008231453],"domain_scores_gemma":[0.99932075,0.00029385672,0.00006435481,0.00013093234,0.00013211502,0.00005808985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005999305,0.00035862686,0.00048711916,0.0002519834,0.0003616333,0.0015275017,0.0012466718,0.00057204446,0.0031366914],"category_scores_gemma":[0.0021832772,0.00035095582,0.00028505037,0.00023436498,0.0009870162,0.0011758152,0.0011374993,0.0009944717,0.00036001694],"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.0008766126,0.00015738067,0.00044684947,0.000106899555,0.00005760982,0.00015623428,0.00041299238,0.71312815,0.02433146,0.1591863,0.0028748172,0.09826469],"study_design_scores_gemma":[0.000029302722,0.00006362322,0.00027691387,0.0000054704847,0.000006843664,0.000026212214,0.000029005589,0.9707234,0.0026747384,0.024904031,0.0012494067,0.0000111265035],"about_ca_topic_score_codex":0.0039985855,"about_ca_topic_score_gemma":0.0042908047,"teacher_disagreement_score":0.0039985855,"about_ca_system_score_codex":0.0009273271,"about_ca_system_score_gemma":0.000793088,"threshold_uncertainty_score":0.0104932785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26867303,0.000441365,0.58643574,0.0012239871,0.00022561774,0.00037415745,0.0012059548,0.0008573846,0.14056289],"genre_scores_gemma":[0.911622,0.00052589097,0.06640183,0.00045612705,0.00018596764,0.00043844816,0.0012214639,0.00021739975,0.018930988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830174,0.0003603844,0.00012836697,0.0003878917,0.00047519844,0.00034638168],"domain_scores_gemma":[0.99848664,0.0006425433,0.00016471869,0.0002481887,0.0002764766,0.0001813906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008952517,0.0010271863,0.000706975,0.00091974693,0.001474143,0.0038499632,0.0008615244,0.0009178944,0.0069209314],"category_scores_gemma":[0.0028474974,0.0006022321,0.001832915,0.000758184,0.0032420824,0.0063295155,0.0017152816,0.0033950745,0.0007226773],"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.000040376166,0.00003567669,0.0002167074,0.000040810868,0.000021935231,0.00009666434,0.00024773818,0.0027152142,0.001289143,0.9894084,0.0007666348,0.005120646],"study_design_scores_gemma":[0.000019338304,0.000019519366,0.00022373314,0.000009661497,0.000013350767,0.00006632797,0.00006891909,0.00836005,0.0009553811,0.9863153,0.003937797,0.000010600448],"about_ca_topic_score_codex":0.0032492634,"about_ca_topic_score_gemma":0.002794264,"teacher_disagreement_score":0.0069209314,"about_ca_system_score_codex":0.0016170056,"about_ca_system_score_gemma":0.001038679,"threshold_uncertainty_score":0.023152828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021831946,0.00479666,0.75014865,0.0011040616,0.00027405372,0.00019379055,0.00017096885,0.0013111087,0.22016868],"genre_scores_gemma":[0.48378184,0.0045326264,0.42725232,0.00052480446,0.00015955034,0.000393679,0.0003961288,0.0004306783,0.08252829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926144,0.000270675,0.000037953945,0.000106583844,0.00022910802,0.000094200135],"domain_scores_gemma":[0.9994721,0.00029980828,0.000025966081,0.00011355891,0.00004597182,0.000042560478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075600436,0.0009887335,0.00057783944,0.0006643621,0.0008570849,0.0028240737,0.001316055,0.0006610847,0.006841062],"category_scores_gemma":[0.002039281,0.0004891397,0.0010790516,0.00087920483,0.002651029,0.003873315,0.0028897803,0.0024194184,0.0015359268],"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.00006686306,0.00004035719,0.0002320888,0.00021122015,0.000021827263,0.00012272914,0.00086794636,0.013991528,0.0013936415,0.88711655,0.006283765,0.08965146],"study_design_scores_gemma":[0.000033566303,0.000057669204,0.0002575593,0.00011749134,0.000027976803,0.0002492587,0.00015773952,0.04175537,0.0015884022,0.8543514,0.10137304,0.00003056241],"about_ca_topic_score_codex":0.0024555684,"about_ca_topic_score_gemma":0.0021829864,"teacher_disagreement_score":0.006841062,"about_ca_system_score_codex":0.0014370059,"about_ca_system_score_gemma":0.0007596854,"threshold_uncertainty_score":0.02288562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1058572,0.00041554373,0.811269,0.00022145791,0.0002581526,0.0002664552,0.000298177,0.06873475,0.012679359],"genre_scores_gemma":[0.53683114,0.0001299599,0.4517295,0.00018165921,0.00006023132,0.0002615758,0.0009849508,0.005754245,0.0040667295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.0002859726,0.00010647177,0.00039592615,0.00034593645,0.00012371453],"domain_scores_gemma":[0.9936668,0.0029902025,0.00050475023,0.001544534,0.0010444619,0.00024932984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808023,0.0015354158,0.00089332013,0.00160195,0.00067285186,0.0016076977,0.002018498,0.0010683043,0.00895251],"category_scores_gemma":[0.012199441,0.0008297402,0.0005812717,0.0008075136,0.00051729515,0.0027040937,0.0012699722,0.001171804,0.0027770624],"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.0010253709,0.0004125081,0.010109149,0.0003049221,0.0001253945,0.00020078574,0.00038321214,0.08255087,0.044622503,0.005294358,0.018071828,0.8368991],"study_design_scores_gemma":[0.000059620786,0.0001376752,0.0014899769,0.000033458968,0.000030994725,0.000107931504,0.00006383099,0.9581464,0.026931655,0.006101667,0.006859167,0.000037631704],"about_ca_topic_score_codex":0.0013851257,"about_ca_topic_score_gemma":0.0019422929,"teacher_disagreement_score":0.00895251,"about_ca_system_score_codex":0.00075939693,"about_ca_system_score_gemma":0.0007653372,"threshold_uncertainty_score":0.029949069},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387684,0.0000781426,0.595532,0.00050620065,0.00008370487,0.00053728983,0.00061757263,0.016625173,0.047251437],"genre_scores_gemma":[0.8071941,0.000055975863,0.17802127,0.00012099933,0.0000067271903,0.00045255735,0.0003337948,0.0008052291,0.013009386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967504,0.00013779104,0.000017277864,0.000044033473,0.00008579719,0.000040120474],"domain_scores_gemma":[0.9993961,0.000273201,0.000033916647,0.0001456455,0.0000468152,0.000104315324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856983,0.00045893434,0.00013766749,0.00015344647,0.00027703051,0.00042740727,0.00077908835,0.0004978549,0.0067486996],"category_scores_gemma":[0.0015395728,0.00019491458,0.00030045334,0.00006490389,0.0006388239,0.00065587694,0.0010726986,0.000609811,0.0008697688],"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.0012790908,0.0023253367,0.017331937,0.0010656691,0.00012151078,0.0052681873,0.016606156,0.08243839,0.40602857,0.19842255,0.023392143,0.2457205],"study_design_scores_gemma":[0.00028595288,0.0017224282,0.010348505,0.00021426255,0.00005761807,0.00273746,0.0015031619,0.5699593,0.18758544,0.037621863,0.1878325,0.00013149196],"about_ca_topic_score_codex":0.00090995774,"about_ca_topic_score_gemma":0.001518989,"teacher_disagreement_score":0.0067486996,"about_ca_system_score_codex":0.00022593749,"about_ca_system_score_gemma":0.00026628005,"threshold_uncertainty_score":0.02257669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3283447,0.00030900678,0.6339039,0.000431804,0.00014771802,0.00026262907,0.0003916124,0.0291922,0.0070164716],"genre_scores_gemma":[0.8701602,0.00007005314,0.12610704,0.00008757403,0.000026136064,0.0000709554,0.0002592304,0.0009902328,0.0022285434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779046,0.0005005379,0.00014654249,0.000613342,0.00064860086,0.00030052284],"domain_scores_gemma":[0.9930006,0.0043107425,0.00044683059,0.0013130108,0.0005322963,0.00039639507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024825495,0.0011898816,0.00083312596,0.00094499934,0.00076408044,0.0025316891,0.0023848077,0.0008691132,0.0029909755],"category_scores_gemma":[0.009134135,0.0009177055,0.0009389056,0.00041928142,0.0014073411,0.0031774822,0.0022699318,0.0020133387,0.000561646],"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.0065124957,0.00197868,0.02132384,0.00082732295,0.00043706148,0.0033983327,0.0035622376,0.17544104,0.2541156,0.12718664,0.011110836,0.39410585],"study_design_scores_gemma":[0.00015760814,0.00022290926,0.001435855,0.000040093815,0.00011917089,0.00023003759,0.00013064603,0.90612125,0.049061865,0.03877544,0.0036500543,0.000055040848],"about_ca_topic_score_codex":0.004817647,"about_ca_topic_score_gemma":0.006476198,"teacher_disagreement_score":0.004817647,"about_ca_system_score_codex":0.0010455512,"about_ca_system_score_gemma":0.0015754551,"threshold_uncertainty_score":0.013129115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03689752,0.0009778873,0.7296323,0.0010433588,0.00037538103,0.00035873667,0.0004297305,0.004800888,0.22548419],"genre_scores_gemma":[0.37221056,0.0010445283,0.38823378,0.0004929993,0.000068101144,0.0004933142,0.0007511626,0.0009593178,0.23574632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.000074797485,0.000010048265,0.000045249137,0.00006441604,0.000021580476],"domain_scores_gemma":[0.9996973,0.00015672074,0.000017357326,0.000054343982,0.000031190582,0.000042988482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003304418,0.00070036866,0.00029158933,0.00027431236,0.0006156781,0.0023983857,0.0014543335,0.0011500579,0.044155985],"category_scores_gemma":[0.0015774777,0.00030594223,0.00041212124,0.00022882914,0.0008717157,0.0027699617,0.0032934428,0.0010652092,0.0051755914],"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.0006518581,0.00029167233,0.0008536305,0.0014887104,0.00006766032,0.0012869422,0.0146467015,0.0115544405,0.061086126,0.3377129,0.05256682,0.51779264],"study_design_scores_gemma":[0.0002578062,0.0010137768,0.001908474,0.00089411356,0.000116554416,0.0029004877,0.007213305,0.1091551,0.030574284,0.15473111,0.69102997,0.00020510418],"about_ca_topic_score_codex":0.00044712998,"about_ca_topic_score_gemma":0.00096104766,"teacher_disagreement_score":0.044155985,"about_ca_system_score_codex":0.00027772257,"about_ca_system_score_gemma":0.000368571,"threshold_uncertainty_score":0.14771646},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33351764,0.012060311,0.54598016,0.012151409,0.0002407429,0.00013908767,0.0002644732,0.0013010245,0.09434513],"genre_scores_gemma":[0.8482538,0.0045136507,0.12644374,0.0007871672,0.00007138517,0.00011054348,0.00023358621,0.00016648056,0.019419659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989489,0.00041290288,0.000043954096,0.00018187132,0.00033474076,0.00007773709],"domain_scores_gemma":[0.992463,0.005599923,0.00069530145,0.00054742733,0.00044181762,0.00025258012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014192119,0.0007998084,0.00043965367,0.0013106277,0.0011465023,0.0027839246,0.0013078039,0.0016004241,0.0038464025],"category_scores_gemma":[0.009679984,0.00039670488,0.0004270096,0.0013643379,0.005664625,0.006031095,0.001973157,0.0021142967,0.00088202336],"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.00025955937,0.00017975766,0.017334921,0.0005639523,0.000060203518,0.0019080736,0.014007236,0.06917385,0.0065908665,0.4881637,0.022356492,0.37940136],"study_design_scores_gemma":[0.00002677863,0.00019384784,0.0073854523,0.00034674272,0.00004274653,0.0047734044,0.0059697777,0.10472721,0.0061160377,0.82114804,0.04917346,0.00009642454],"about_ca_topic_score_codex":0.0017445475,"about_ca_topic_score_gemma":0.0017987997,"teacher_disagreement_score":0.0038464025,"about_ca_system_score_codex":0.0013709448,"about_ca_system_score_gemma":0.0014152405,"threshold_uncertainty_score":0.01286751},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3380323,0.00012328381,0.5619215,0.0004913961,0.00014070419,0.00061475235,0.00086390134,0.036216386,0.061595745],"genre_scores_gemma":[0.7360207,0.00008583551,0.24075413,0.00016472804,0.000012362205,0.00038458282,0.00066512433,0.0021729574,0.019739594],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999683,0.00010630522,0.00001960859,0.000045775447,0.000101688696,0.000043637898],"domain_scores_gemma":[0.9992519,0.0003719815,0.000029087563,0.00013933898,0.00007775333,0.000129914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034418333,0.0005455977,0.00014798656,0.00018339684,0.000264501,0.00045936808,0.0008865019,0.0005680277,0.008101857],"category_scores_gemma":[0.0018023546,0.00027159083,0.00033913122,0.000081938,0.00048634928,0.0005665638,0.00086340425,0.00070004835,0.0012734169],"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.0019477637,0.0028615368,0.016517306,0.0011016269,0.00012157234,0.006572116,0.013918664,0.06378313,0.39313206,0.07140744,0.046802655,0.38183412],"study_design_scores_gemma":[0.00043781736,0.0020001116,0.012793222,0.00020024074,0.00006959159,0.0035494654,0.0008732205,0.5181621,0.23793691,0.0124288695,0.21139981,0.00014862312],"about_ca_topic_score_codex":0.0015748461,"about_ca_topic_score_gemma":0.002081107,"teacher_disagreement_score":0.008101857,"about_ca_system_score_codex":0.00022178466,"about_ca_system_score_gemma":0.00025936886,"threshold_uncertainty_score":0.027103364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6577436,0.0005344309,0.22567101,0.005597469,0.0002489596,0.00022208411,0.00032840882,0.00033201362,0.10932201],"genre_scores_gemma":[0.95529056,0.00022118835,0.033440508,0.00025326473,0.000097018594,0.00010570683,0.00019359829,0.000043872777,0.010354302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.00018172471,0.000043163112,0.0001296253,0.00012076026,0.000105702],"domain_scores_gemma":[0.99871385,0.0007868305,0.00017906674,0.00018189238,0.00007501207,0.00006341591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059437484,0.0003283134,0.00048706884,0.0003760149,0.001407114,0.0015230139,0.00065119937,0.0015735114,0.0073920614],"category_scores_gemma":[0.0038259157,0.00022269202,0.00087892177,0.00037932527,0.0023110458,0.0036012104,0.0021525698,0.0017306736,0.0004432567],"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.00005662437,0.000032921092,0.00045591692,0.000115036484,0.000020062194,0.00057168305,0.00072040054,0.0061294953,0.0015813936,0.98040843,0.0021185675,0.007789491],"study_design_scores_gemma":[0.000040530264,0.00004308109,0.00018247172,0.000016343258,0.000010357897,0.00045233135,0.0004183337,0.017565833,0.0011542746,0.9741047,0.005996255,0.000015487656],"about_ca_topic_score_codex":0.00055336906,"about_ca_topic_score_gemma":0.00052927743,"teacher_disagreement_score":0.0073920614,"about_ca_system_score_codex":0.0005699342,"about_ca_system_score_gemma":0.00068404485,"threshold_uncertainty_score":0.024728894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01165343,0.00022074288,0.9814493,0.00016983216,0.00004521592,0.00011454513,0.00016412418,0.0017876091,0.0043952186],"genre_scores_gemma":[0.36052114,0.00032292938,0.6292434,0.00017542388,0.00005591937,0.00048277812,0.0007237888,0.00058627286,0.007888494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989396,0.00035873835,0.00006124134,0.00030608615,0.0002631014,0.00007136675],"domain_scores_gemma":[0.9979867,0.0011224074,0.00010986838,0.00040831804,0.0002592293,0.00011345071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012029604,0.0011947043,0.0009948142,0.0016005656,0.0008648735,0.0013956166,0.0023617945,0.0015444461,0.010912375],"category_scores_gemma":[0.008963664,0.0004955423,0.0009587712,0.0011525556,0.0014505618,0.0037812702,0.0029988564,0.002109154,0.0025713218],"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.00018768122,0.0002992027,0.0016620889,0.0002773151,0.000057427744,0.00014540924,0.00042755358,0.45646492,0.0027625463,0.10770399,0.0061462848,0.42386565],"study_design_scores_gemma":[0.000012888761,0.00004122005,0.00024899372,0.000014329365,0.0000038876788,0.000046737932,0.000055388136,0.89107615,0.00076624955,0.10486993,0.002852988,0.000011158113],"about_ca_topic_score_codex":0.0062006074,"about_ca_topic_score_gemma":0.004330114,"teacher_disagreement_score":0.010912375,"about_ca_system_score_codex":0.0015442079,"about_ca_system_score_gemma":0.0013472794,"threshold_uncertainty_score":0.03650558},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012549102,0.0004936091,0.42378286,0.0019983326,0.0007333291,0.00039914885,0.0005191332,0.0063555744,0.5531689],"genre_scores_gemma":[0.32508492,0.001067831,0.37817338,0.0019097684,0.00031572126,0.001228665,0.0028006625,0.002750611,0.28666845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987276,0.00039986908,0.0000474746,0.00030572806,0.00035273348,0.00016647305],"domain_scores_gemma":[0.9988337,0.0002683438,0.00003923503,0.00050297094,0.00020513858,0.00015057417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012241697,0.00087344635,0.00066363,0.0009903659,0.0022116913,0.0031267605,0.001989347,0.0013156289,0.071515694],"category_scores_gemma":[0.004306436,0.0005216977,0.0009851003,0.00058459694,0.0019683628,0.0060310606,0.005796989,0.002172727,0.021515107],"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.000044761324,0.00011497155,0.00046639857,0.0001983912,0.00002574126,0.00012781021,0.00058481883,0.0031760335,0.0024791725,0.84748375,0.027717907,0.11758029],"study_design_scores_gemma":[0.00003163282,0.00006689895,0.0003415735,0.00018275305,0.000035805115,0.00019628037,0.00046391616,0.020650597,0.0036187123,0.5746798,0.399705,0.000027109028],"about_ca_topic_score_codex":0.0009957283,"about_ca_topic_score_gemma":0.0025968084,"teacher_disagreement_score":0.071515694,"about_ca_system_score_codex":0.00094155996,"about_ca_system_score_gemma":0.0017327747,"threshold_uncertainty_score":0.2392438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038129825,0.0004627574,0.9431447,0.00021198097,0.0000900682,0.00029232708,0.00072471116,0.003730634,0.013212939],"genre_scores_gemma":[0.23468149,0.0003889496,0.7598561,0.00011182909,0.000017741799,0.0004215289,0.0011591377,0.0009840988,0.002379028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992041,0.00019665483,0.000062221516,0.00013835182,0.00030433584,0.000094407966],"domain_scores_gemma":[0.9979387,0.0013588741,0.00012438865,0.00018521381,0.00034277697,0.000050077193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188057,0.0013442251,0.000661437,0.001123092,0.0004806577,0.0014971715,0.0012242023,0.0008969001,0.0062870593],"category_scores_gemma":[0.006179276,0.0004802228,0.0012748392,0.0007671049,0.0010311224,0.0012877021,0.0012380672,0.0011620899,0.0011914683],"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.00023797946,0.00024262181,0.0018592492,0.0014736655,0.00008091896,0.00042402034,0.00055393076,0.5435436,0.031695127,0.10605847,0.0077697164,0.30606073],"study_design_scores_gemma":[0.00007484932,0.00019784707,0.00032916243,0.00013453951,0.000069393056,0.0001507832,0.00026323053,0.9148004,0.021880135,0.04383487,0.018232983,0.000031861207],"about_ca_topic_score_codex":0.0031136598,"about_ca_topic_score_gemma":0.005794596,"teacher_disagreement_score":0.0062870593,"about_ca_system_score_codex":0.0013973409,"about_ca_system_score_gemma":0.0018933491,"threshold_uncertainty_score":0.021032333},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008561079,0.0035014397,0.0014395872,0.11007503,0.034107946,0.00028289334,0.0008404553,0.00036130127,0.84083027],"genre_scores_gemma":[0.14477691,0.0033705202,0.0007498013,0.1224349,0.0047971867,0.0007346463,0.0007991777,0.0003608124,0.72197604],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99574417,0.001390361,0.00023638015,0.00045438082,0.0013689502,0.0008057942],"domain_scores_gemma":[0.9848103,0.0038445748,0.001076241,0.0018418565,0.0051174466,0.0033096713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038637673,0.0005274163,0.00045087803,0.0009110781,0.008489457,0.0039251717,0.0014045975,0.0048173824,0.1944893],"category_scores_gemma":[0.04800708,0.0002915465,0.00045109517,0.00060414424,0.002070146,0.004014844,0.004940765,0.005579936,0.05056797],"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.000083190775,0.000021357784,0.00051624095,0.00013531506,0.000008506096,0.0006521253,0.0019527354,0.0000117802865,0.00019338119,0.014595983,0.9573723,0.02445713],"study_design_scores_gemma":[0.000008222036,0.000009549106,0.00039101165,0.00025433933,0.0000040066266,0.00043888306,0.0028629145,0.000017802296,0.00014402167,0.0025840953,0.9932783,0.00000679042],"about_ca_topic_score_codex":0.006036139,"about_ca_topic_score_gemma":0.010611878,"teacher_disagreement_score":0.1944893,"about_ca_system_score_codex":0.002105014,"about_ca_system_score_gemma":0.0050414233,"threshold_uncertainty_score":0.65063155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23988777,0.00076846493,0.7489535,0.00036474643,0.00016909148,0.0001986863,0.002094249,0.004037109,0.003526393],"genre_scores_gemma":[0.68022656,0.00032141383,0.31079093,0.000065084816,0.000030356487,0.0001601232,0.0032832457,0.00031451372,0.0048076976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994949,0.00015785305,0.000031264964,0.00017835379,0.00009839981,0.00003927928],"domain_scores_gemma":[0.99869424,0.0007075163,0.00012655946,0.00017365039,0.0002519402,0.00004609077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259935,0.0008593504,0.0003323811,0.0009983724,0.00025784044,0.0007538494,0.00050248037,0.00037824627,0.0025445446],"category_scores_gemma":[0.0037567322,0.0002663039,0.00049989705,0.0009640088,0.00039796752,0.0015996691,0.00060141995,0.0010617044,0.0010595007],"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.0006319208,0.000435875,0.017228415,0.000347215,0.00017537265,0.00013173757,0.0011665088,0.17029735,0.021699509,0.011442067,0.00826858,0.76817536],"study_design_scores_gemma":[0.000022789036,0.00017971214,0.0076085916,0.000026370277,0.000021042551,0.00010373342,0.00026402273,0.97068644,0.0072856164,0.008742615,0.0050239745,0.00003502003],"about_ca_topic_score_codex":0.009590656,"about_ca_topic_score_gemma":0.016228918,"teacher_disagreement_score":0.009590656,"about_ca_system_score_codex":0.0006857396,"about_ca_system_score_gemma":0.00035859644,"threshold_uncertainty_score":0.019069672},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09819268,0.00022370958,0.89100266,0.00012365685,0.000054127497,0.0002089321,0.000111392204,0.0046793595,0.0054034228],"genre_scores_gemma":[0.7320897,0.00010065272,0.26506743,0.00007303497,0.000020238898,0.00011939123,0.00019573243,0.0002198294,0.0021139688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947304,0.00013044762,0.000025561441,0.00011590793,0.00018773745,0.00006725141],"domain_scores_gemma":[0.9991128,0.00045626643,0.00009630977,0.00008490574,0.000163785,0.00008586317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071883353,0.0012266238,0.0010854226,0.0014031563,0.0005767731,0.0011767296,0.0013087247,0.00091087545,0.0019772123],"category_scores_gemma":[0.002556063,0.0005769908,0.0008340802,0.0006078957,0.0007602775,0.001213763,0.001271083,0.00058693904,0.00035636182],"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.0002243293,0.00010672711,0.0022933483,0.000095544645,0.00011474973,0.0002210522,0.00021196557,0.8571147,0.0047766566,0.005523389,0.0013054948,0.12801202],"study_design_scores_gemma":[0.000010953451,0.000032529428,0.00015150466,0.0000030715362,0.000008237444,0.000017386908,0.00001881571,0.99706995,0.000933699,0.0013605921,0.00038752914,0.000005739732],"about_ca_topic_score_codex":0.013193419,"about_ca_topic_score_gemma":0.015057351,"teacher_disagreement_score":0.013193419,"about_ca_system_score_codex":0.0010199347,"about_ca_system_score_gemma":0.00086305547,"threshold_uncertainty_score":0.026233256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058023058,0.00019409608,0.9323204,0.00014252416,0.000050666655,0.00010113303,0.000052869604,0.0013014477,0.007813755],"genre_scores_gemma":[0.712916,0.00010129699,0.28033587,0.00009051628,0.000023887595,0.00013950444,0.0001571458,0.00013957443,0.006096233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995802,0.00011240027,0.000021918651,0.000100482815,0.00013454874,0.00005040614],"domain_scores_gemma":[0.9992828,0.00028056244,0.000097753065,0.00009930988,0.00013775405,0.00010181873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091131206,0.00075451884,0.0009812542,0.0009960762,0.0005405402,0.00072763255,0.0018376582,0.0010195485,0.004018102],"category_scores_gemma":[0.0019734867,0.00042124809,0.0005104683,0.0005372106,0.0007289734,0.0010546589,0.0016486533,0.0005912385,0.0007567068],"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.00017413663,0.00010466593,0.0009538566,0.000061605024,0.000049258786,0.00011935922,0.000120143566,0.9064037,0.0058215326,0.01104264,0.0011620258,0.07398699],"study_design_scores_gemma":[0.000008690046,0.00001804088,0.000054511023,0.0000016070479,0.0000023052348,0.000013070947,0.000004410807,0.9982388,0.00023973986,0.001203197,0.00021336922,0.0000022735162],"about_ca_topic_score_codex":0.0034682539,"about_ca_topic_score_gemma":0.0040098075,"teacher_disagreement_score":0.004018102,"about_ca_system_score_codex":0.000604332,"about_ca_system_score_gemma":0.00077717454,"threshold_uncertainty_score":0.013441861},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021056358,0.0014624469,0.6782884,0.0024112363,0.00029259818,0.000083637526,0.000118407654,0.00037395975,0.29591295],"genre_scores_gemma":[0.76764756,0.00090127595,0.19918521,0.0004428004,0.00020724109,0.0002244838,0.00022415265,0.0004364958,0.030730654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985915,0.00077164825,0.000080089674,0.00022140185,0.00023361624,0.0001017547],"domain_scores_gemma":[0.9978537,0.0013712506,0.00007546559,0.0004433841,0.00020052929,0.00005568518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616073,0.00053742825,0.0005469306,0.0010876507,0.0018414292,0.004593953,0.0012482372,0.0017505243,0.008155461],"category_scores_gemma":[0.0067611635,0.00057427416,0.0012257326,0.0007495696,0.012540455,0.007984119,0.002473369,0.0030949442,0.0014756108],"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.0000038597254,0.0000021060669,0.000014240886,0.000008939077,0.0000010494929,0.000009589827,0.00025091632,0.00034303288,0.00008045698,0.9968616,0.00016405588,0.002260103],"study_design_scores_gemma":[0.0000042875395,0.0000039960564,0.000015127992,0.000009153505,0.0000013876593,0.000021340014,0.00007222126,0.0018956523,0.00014005452,0.99330395,0.0045292727,0.0000035652165],"about_ca_topic_score_codex":0.0016950227,"about_ca_topic_score_gemma":0.001267874,"teacher_disagreement_score":0.008155461,"about_ca_system_score_codex":0.0018065495,"about_ca_system_score_gemma":0.0009951787,"threshold_uncertainty_score":0.027282774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042666975,0.00013455322,0.93158954,0.00034254754,0.000050592284,0.00013628272,0.000111296715,0.004796557,0.020171776],"genre_scores_gemma":[0.46182996,0.0001550585,0.5309565,0.0001253937,0.00001883157,0.000120142606,0.00043393567,0.00040984259,0.005950395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.000117221345,0.000018475048,0.000084440304,0.000088210494,0.000030695126],"domain_scores_gemma":[0.99924964,0.00040679154,0.000053977223,0.00016437894,0.00008357016,0.00004152759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064930454,0.00048234875,0.00020879647,0.0004716797,0.00037050206,0.0012885813,0.00097461714,0.000587753,0.005500117],"category_scores_gemma":[0.002277893,0.0002896661,0.0005777494,0.00030466585,0.001081075,0.0020071398,0.001305779,0.0010148305,0.0011759166],"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.00046931143,0.00038166504,0.0059223697,0.00038029818,0.00008420117,0.0005809106,0.0031206212,0.1472276,0.056976706,0.24075389,0.008212839,0.53588957],"study_design_scores_gemma":[0.00008058304,0.00016146184,0.001600051,0.000068110705,0.000056755347,0.0003068992,0.00032165932,0.79700005,0.04417546,0.11684108,0.03933918,0.000048642745],"about_ca_topic_score_codex":0.0015882576,"about_ca_topic_score_gemma":0.00201152,"teacher_disagreement_score":0.005500117,"about_ca_system_score_codex":0.00051885855,"about_ca_system_score_gemma":0.00070968835,"threshold_uncertainty_score":0.018399715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005725356,0.00008083576,0.99186873,0.00005898558,0.00001690752,0.00003297797,0.000012495711,0.00021069589,0.0019929716],"genre_scores_gemma":[0.21130802,0.00020254965,0.7863781,0.00010289789,0.000032265314,0.00022128083,0.00009557108,0.00023355738,0.0014258496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.0003557797,0.00003647997,0.00007210997,0.0002785125,0.000035922076],"domain_scores_gemma":[0.9981908,0.0012154399,0.00013731628,0.00024333847,0.00016110524,0.00005197058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013633955,0.0005961745,0.00070070976,0.00049018126,0.00030882438,0.00083461264,0.0015590851,0.001100731,0.0021973157],"category_scores_gemma":[0.005192838,0.00036655166,0.0007364749,0.0006401101,0.00092627277,0.0012689735,0.0011329672,0.0014980792,0.0004812112],"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.000053746975,0.00006634942,0.0005422724,0.00010727394,0.00002996598,0.00006417622,0.00010366743,0.8198236,0.0038291018,0.107535705,0.0005968539,0.06724723],"study_design_scores_gemma":[0.000006296728,0.00001999034,0.000031537038,0.0000048627744,0.0000019860204,0.000012936333,0.0000045616976,0.99247885,0.00039148127,0.00633333,0.0007103059,0.0000037438429],"about_ca_topic_score_codex":0.0024203819,"about_ca_topic_score_gemma":0.002367431,"teacher_disagreement_score":0.0024203819,"about_ca_system_score_codex":0.00052682223,"about_ca_system_score_gemma":0.00091467856,"threshold_uncertainty_score":0.0073508024},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006826114,0.020499973,0.015199245,0.0423141,0.13442154,0.0025468506,0.03924043,0.0073684,0.7315834],"genre_scores_gemma":[0.018304119,0.008604673,0.005606511,0.006153307,0.012092702,0.0016816774,0.056381337,0.0023442646,0.88883156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717736,0.00047685832,0.00014129316,0.0003147787,0.0013612383,0.0005284848],"domain_scores_gemma":[0.9929824,0.00048446565,0.00016669382,0.0002359985,0.0032259342,0.0029045772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006028734,0.002481415,0.0008272799,0.0027672667,0.0016922784,0.008437337,0.0023984895,0.0030176425,0.23082863],"category_scores_gemma":[0.0056349523,0.0006316391,0.0014529777,0.0017238295,0.0003462718,0.0026599956,0.0049598278,0.0036046836,0.18767507],"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.00013492147,0.00008805299,0.000071365175,0.00019321003,0.0000065753557,0.000044103337,0.00003142334,0.00031548933,0.00031049593,0.0009898965,0.97011775,0.027696723],"study_design_scores_gemma":[0.0000285387,0.00006544976,0.00045950475,0.00015124063,0.0000049786686,0.000026457716,0.00007160192,0.00017690053,0.00029891435,0.000641569,0.99805945,0.000015368292],"about_ca_topic_score_codex":0.0065472997,"about_ca_topic_score_gemma":0.013192209,"teacher_disagreement_score":0.23082863,"about_ca_system_score_codex":0.002227546,"about_ca_system_score_gemma":0.004648023,"threshold_uncertainty_score":0.7721987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010510761,0.00016098114,0.97256756,0.0003743791,0.000059817994,0.00014374312,0.000053985008,0.00066955964,0.01545912],"genre_scores_gemma":[0.12547962,0.00027645254,0.8629394,0.00023712472,0.000059352456,0.00022798277,0.00019103687,0.00019727479,0.010391811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999428,0.00015683459,0.00003325793,0.00013358858,0.0001667971,0.00008153086],"domain_scores_gemma":[0.999647,0.00017130777,0.00003108123,0.00005119358,0.000054402124,0.000044901473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068524905,0.0012257133,0.000528599,0.0007163205,0.0007183974,0.0012014934,0.0019761897,0.00096386176,0.007325472],"category_scores_gemma":[0.0021033578,0.0004419258,0.001115018,0.0005489515,0.0015991887,0.0019506216,0.0022941532,0.002494603,0.0013975651],"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.00017054698,0.00024113999,0.0012618469,0.0006346601,0.00007515537,0.00017462052,0.00082068756,0.20049807,0.0133567825,0.4509308,0.011823688,0.32001197],"study_design_scores_gemma":[0.00016032105,0.00043706724,0.0005409639,0.00010354601,0.000066578694,0.00028661767,0.00030547354,0.7082902,0.007764048,0.2183085,0.06369359,0.000043151555],"about_ca_topic_score_codex":0.002576533,"about_ca_topic_score_gemma":0.0040973406,"teacher_disagreement_score":0.007325472,"about_ca_system_score_codex":0.0007813057,"about_ca_system_score_gemma":0.0013759761,"threshold_uncertainty_score":0.024506152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98754245,0.00033958245,0.00615883,0.0003189942,0.000034089124,0.00040162686,0.00056236197,0.00034236387,0.0042996136],"genre_scores_gemma":[0.9792575,0.00033536766,0.012624872,0.0002541049,0.000028734676,0.00043123704,0.0021435248,0.00011797688,0.004806704],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9949591,0.0029934845,0.00043257454,0.00065113156,0.00073373644,0.00022997722],"domain_scores_gemma":[0.9303154,0.05479906,0.0027661435,0.0065318816,0.0031017975,0.002485739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007960914,0.0008555313,0.0008446291,0.0013750376,0.0010229148,0.0015828868,0.0016220602,0.001666246,0.0063110203],"category_scores_gemma":[0.067397445,0.000505745,0.00055399654,0.0008774641,0.0015755832,0.003717816,0.0021515368,0.0023694378,0.0019770975],"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.0051671425,0.02852463,0.23517905,0.0037097596,0.0005697123,0.0021193982,0.06045556,0.029231189,0.0120118465,0.009760953,0.06460122,0.5486695],"study_design_scores_gemma":[0.0028912602,0.04372328,0.4154945,0.0013014748,0.0004026532,0.0053223725,0.056930095,0.1831465,0.029691359,0.022792375,0.23769511,0.00060899736],"about_ca_topic_score_codex":0.0018924654,"about_ca_topic_score_gemma":0.0035738358,"teacher_disagreement_score":0.007960914,"about_ca_system_score_codex":0.000750516,"about_ca_system_score_gemma":0.0005753614,"threshold_uncertainty_score":0.04210186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050407364,0.00039616125,0.99072266,0.00011147674,0.000027478776,0.000025641533,0.000008635266,0.000088093235,0.0035791672],"genre_scores_gemma":[0.25349408,0.0008616642,0.7385125,0.00009637392,0.000045811474,0.00016978779,0.000055078934,0.00005006059,0.006714671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968994,0.00011709022,0.000015360829,0.000044130575,0.000112174326,0.000021298309],"domain_scores_gemma":[0.9996669,0.00019550885,0.000036047804,0.000031232077,0.000061142564,0.000009246856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064931664,0.0004424972,0.00039765713,0.00056668447,0.00042197618,0.0005416268,0.0006274431,0.0011383871,0.0019071165],"category_scores_gemma":[0.0023047107,0.00024102474,0.0003890312,0.0005574251,0.0008262029,0.00080182415,0.000532432,0.00061243784,0.00026836948],"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.000026633992,0.000022911468,0.00027299958,0.00006917998,0.000028370265,0.00010885344,0.000107615844,0.72496206,0.0037926813,0.14144635,0.0009108678,0.12825139],"study_design_scores_gemma":[0.000010698582,0.000025037356,0.00011040185,0.000022450748,0.0000067815854,0.000069002774,0.000015551119,0.9481661,0.0013012196,0.045056276,0.0052050524,0.000011421035],"about_ca_topic_score_codex":0.0025770343,"about_ca_topic_score_gemma":0.0017443291,"teacher_disagreement_score":0.0025770343,"about_ca_system_score_codex":0.00045577466,"about_ca_system_score_gemma":0.0005188109,"threshold_uncertainty_score":0.0063799024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015696066,0.0004237573,0.8451749,0.0049814642,0.0028120996,0.0004407455,0.00088285684,0.0048541985,0.12473387],"genre_scores_gemma":[0.1512637,0.0006089455,0.77128583,0.0025093218,0.0009319826,0.0005693727,0.0011476314,0.0017729406,0.069910266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99636805,0.0011558852,0.00022809306,0.00062549557,0.0010923134,0.0005302579],"domain_scores_gemma":[0.9976197,0.0010366199,0.00013071083,0.00048055736,0.0004885787,0.00024392907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001773578,0.000892085,0.00042429974,0.00072783325,0.0019324467,0.0033778115,0.0018779929,0.0012860653,0.022734422],"category_scores_gemma":[0.007839849,0.000648951,0.00060896215,0.00092535623,0.0019385841,0.0051031485,0.0038924909,0.003274403,0.0054938006],"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.00022265158,0.0002556677,0.00040522486,0.00029359502,0.000013399721,0.0005178172,0.0012050311,0.002647208,0.0041871653,0.76374704,0.04331892,0.18318625],"study_design_scores_gemma":[0.00016671375,0.00010380972,0.00026728172,0.0001247431,0.00003568398,0.0010599175,0.0005000659,0.021473486,0.0078075086,0.27136534,0.6970161,0.000079341764],"about_ca_topic_score_codex":0.00083287194,"about_ca_topic_score_gemma":0.0015321778,"teacher_disagreement_score":0.022734422,"about_ca_system_score_codex":0.0013135462,"about_ca_system_score_gemma":0.0017507117,"threshold_uncertainty_score":0.076054275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001353686,0.0011037326,0.026421493,0.0019826293,0.0013581264,0.000072707364,0.0018673865,0.017434293,0.948406],"genre_scores_gemma":[0.009394033,0.001148572,0.009885383,0.00094189134,0.00033081678,0.000083640516,0.004448711,0.0072379243,0.966529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992324,0.00013503889,0.000032510558,0.00013475947,0.00033607607,0.0001292629],"domain_scores_gemma":[0.9986098,0.00025300254,0.000055376604,0.00047775582,0.00028518258,0.0003187962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008383412,0.000880587,0.000636217,0.0022664669,0.001783943,0.006175857,0.0016517565,0.0015484572,0.44954014],"category_scores_gemma":[0.0033902973,0.000554782,0.0006841942,0.0023405321,0.00077254296,0.0072378535,0.004847521,0.0019919977,0.3165196],"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.000079033984,0.00007704129,0.0002144561,0.00014215554,0.0000073461824,0.00006944982,0.00032664964,0.00014601753,0.00074931886,0.08424963,0.6943037,0.2196352],"study_design_scores_gemma":[0.0000040227205,0.000005831556,0.000078163815,0.000046701083,0.0000025898162,0.000054756365,0.000059528804,0.0001234202,0.00018420082,0.010173777,0.98926103,0.0000059820322],"about_ca_topic_score_codex":0.0021104068,"about_ca_topic_score_gemma":0.004096578,"teacher_disagreement_score":0.44954014,"about_ca_system_score_codex":0.0007949046,"about_ca_system_score_gemma":0.0011619654,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28275695,0.0011770579,0.5462598,0.0016559609,0.0002586864,0.00045931077,0.0013834778,0.0008691319,0.16517961],"genre_scores_gemma":[0.8578274,0.0006899133,0.10980156,0.0003965751,0.00008588439,0.00030625932,0.001133773,0.00023641634,0.02952227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827826,0.00035021827,0.000114166105,0.00053485495,0.00038657937,0.00033602808],"domain_scores_gemma":[0.99757284,0.0009468425,0.00034757162,0.00049113954,0.00021679798,0.00042477107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054730295,0.0008480291,0.0008764802,0.0009368423,0.001610132,0.0030713358,0.0017980259,0.0013115262,0.008427198],"category_scores_gemma":[0.0053204508,0.0006288832,0.00079317077,0.0010489443,0.0033436266,0.0046900557,0.0018598284,0.0021979462,0.0007886224],"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.00015059434,0.000059259193,0.0010360128,0.00014062796,0.000039315913,0.00019302573,0.00028642776,0.03665065,0.00240685,0.9305976,0.0057481523,0.022691483],"study_design_scores_gemma":[0.000057902234,0.00010091329,0.0015196884,0.000078933874,0.000043014184,0.0004086108,0.00031828845,0.096186,0.0030594969,0.8672334,0.030929334,0.00006446894],"about_ca_topic_score_codex":0.008181345,"about_ca_topic_score_gemma":0.010094789,"teacher_disagreement_score":0.008427198,"about_ca_system_score_codex":0.0015623389,"about_ca_system_score_gemma":0.001160407,"threshold_uncertainty_score":0.028191805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58241165,0.004595667,0.09401528,0.0025219275,0.00060390186,0.00018882446,0.00030949066,0.0011948183,0.3141584],"genre_scores_gemma":[0.96896094,0.0011167463,0.009484195,0.00034279923,0.00014395127,0.00015768818,0.00010197302,0.00015567426,0.0195359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994149,0.00026166558,0.000018971301,0.000067262954,0.0001491995,0.000088083885],"domain_scores_gemma":[0.99935,0.000404955,0.000045144814,0.00005456051,0.00005343882,0.000091779686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040249614,0.0005151446,0.0001898095,0.00043872616,0.00052035385,0.0043762345,0.00040232716,0.0005327782,0.011348765],"category_scores_gemma":[0.002573503,0.00019545411,0.00039243308,0.00020427948,0.0011238401,0.002379767,0.0041714823,0.00061205565,0.0009812134],"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.002086258,0.00054834556,0.00762658,0.002412472,0.00035555704,0.0021000637,0.083319984,0.004522389,0.24845819,0.20419455,0.021381497,0.42299405],"study_design_scores_gemma":[0.0005371784,0.0025002828,0.049235974,0.0015718476,0.0005466821,0.0060822126,0.0384091,0.01927314,0.07765688,0.17555054,0.62827456,0.00036163215],"about_ca_topic_score_codex":0.00023238284,"about_ca_topic_score_gemma":0.0001976068,"teacher_disagreement_score":0.011348765,"about_ca_system_score_codex":0.00030890654,"about_ca_system_score_gemma":0.00013474342,"threshold_uncertainty_score":0.037965357},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58241165,0.004595667,0.09401528,0.0025219275,0.00060390186,0.00018882446,0.00030949066,0.0011948183,0.3141584],"genre_scores_gemma":[0.96896094,0.0011167463,0.009484195,0.00034279923,0.00014395127,0.00015768818,0.00010197302,0.00015567426,0.0195359],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994149,0.00026166558,0.000018971301,0.000067262954,0.0001491995,0.000088083885],"domain_scores_gemma":[0.99935,0.000404955,0.000045144814,0.00005456051,0.00005343882,0.000091779686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040249614,0.0005151446,0.0001898095,0.00043872616,0.00052035385,0.0043762345,0.00040232716,0.0005327782,0.011348765],"category_scores_gemma":[0.002573503,0.00019545411,0.00039243308,0.00020427948,0.0011238401,0.002379767,0.0041714823,0.00061205565,0.0009812134],"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.002086258,0.00054834556,0.00762658,0.002412472,0.00035555704,0.0021000637,0.083319984,0.004522389,0.24845819,0.20419455,0.021381497,0.42299405],"study_design_scores_gemma":[0.0005371784,0.0025002828,0.049235974,0.0015718476,0.0005466821,0.0060822126,0.0384091,0.01927314,0.07765688,0.17555054,0.62827456,0.00036163215],"about_ca_topic_score_codex":0.00023238284,"about_ca_topic_score_gemma":0.0001976068,"teacher_disagreement_score":0.011348765,"about_ca_system_score_codex":0.00030890654,"about_ca_system_score_gemma":0.00013474342,"threshold_uncertainty_score":0.037965357},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002249277,0.0008824157,0.0023912212,0.00034064797,0.000282604,0.000037114292,0.0011809204,0.001426163,0.993234],"genre_scores_gemma":[0.001121082,0.00082759873,0.0008945246,0.00024089077,0.00007809779,0.000031057098,0.0016156303,0.000328241,0.99486285],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971014,0.000027328699,0.00000998467,0.00007053358,0.00014267115,0.00003932928],"domain_scores_gemma":[0.99966705,0.00004813739,0.000012900423,0.00009464781,0.000097463955,0.00007976867],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023856081,0.0013063648,0.0006744122,0.0021020654,0.00091155653,0.0036483314,0.001043639,0.0011418278,0.7354428],"category_scores_gemma":[0.001014741,0.00033042324,0.00042165667,0.0019434949,0.00043971965,0.0032422105,0.0026335109,0.0012389943,0.7161605],"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.000026019592,0.000043793163,0.00013357912,0.00015746389,0.000004909251,0.00005274002,0.00007443105,0.0001443945,0.000946904,0.020337595,0.65186703,0.3262112],"study_design_scores_gemma":[0.000002742284,0.000004629726,0.00013621368,0.000047597754,0.0000014761523,0.000039686667,0.0000166535,0.00006535255,0.00012174745,0.0022054806,0.9973557,0.0000027373196],"about_ca_topic_score_codex":0.0023082276,"about_ca_topic_score_gemma":0.005468616,"teacher_disagreement_score":0.7354428,"about_ca_system_score_codex":0.0006538707,"about_ca_system_score_gemma":0.0008636436,"threshold_uncertainty_score":0.37735868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022625292,0.00064570614,0.9555664,0.00048952264,0.000061343795,0.00022327265,0.00013169232,0.0006571248,0.019599564],"genre_scores_gemma":[0.6053847,0.0007726018,0.38066268,0.00010711164,0.000050971004,0.0007306951,0.00033444757,0.0001726891,0.011784082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960166,0.00014702552,0.000032579195,0.00007455334,0.000099684825,0.00004449092],"domain_scores_gemma":[0.9990355,0.0006810023,0.00007163067,0.000062861436,0.00008110628,0.000068027264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091156526,0.0008139748,0.00055840274,0.00053585536,0.0008688324,0.0016534274,0.001166154,0.00097037904,0.005296958],"category_scores_gemma":[0.0026461869,0.00053438154,0.0008055012,0.00039768824,0.0011893009,0.0011518241,0.0020874864,0.0011296032,0.00049632683],"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.00006279247,0.00004999482,0.0004934799,0.00015650036,0.00005606122,0.00028177837,0.00031169085,0.85094535,0.0015979032,0.12513907,0.0013357609,0.01956963],"study_design_scores_gemma":[0.000023041397,0.00001595226,0.00004698253,0.000013288138,0.000009330257,0.000022241285,0.00004781488,0.9575092,0.00044354028,0.038018662,0.0038438332,0.0000061301994],"about_ca_topic_score_codex":0.0066812397,"about_ca_topic_score_gemma":0.007687298,"teacher_disagreement_score":0.0066812397,"about_ca_system_score_codex":0.0016293491,"about_ca_system_score_gemma":0.0015803085,"threshold_uncertainty_score":0.017720044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70542973,0.0024623452,0.20770463,0.0031886955,0.00013849072,0.00013183105,0.0004478985,0.0003022698,0.08019413],"genre_scores_gemma":[0.9611798,0.0013728227,0.024698386,0.00021775467,0.00016169874,0.00010923287,0.00025075674,0.000075861004,0.011933742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990858,0.0003448356,0.000047865295,0.0001891705,0.00016662649,0.00016565113],"domain_scores_gemma":[0.99679226,0.0020568378,0.00044253372,0.00020850674,0.00012336238,0.0003765278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073875766,0.00071405154,0.0007005512,0.0018005513,0.0011340621,0.003145118,0.0007638151,0.001277228,0.0043439553],"category_scores_gemma":[0.005509313,0.0005062777,0.0005454411,0.001641214,0.0037396848,0.005651729,0.0017466506,0.0017272761,0.0003421277],"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.000041627518,0.000019900262,0.00074738526,0.000059825976,0.000010582384,0.000078981364,0.00038700947,0.011352251,0.000793619,0.9781532,0.0012716433,0.007083917],"study_design_scores_gemma":[0.000011537118,0.000019706356,0.00071844476,0.000022030328,0.0000072850276,0.00007459177,0.00022391912,0.029177453,0.0003798969,0.96645755,0.002894024,0.00001360768],"about_ca_topic_score_codex":0.0030371998,"about_ca_topic_score_gemma":0.0025630838,"teacher_disagreement_score":0.0043439553,"about_ca_system_score_codex":0.0018577672,"about_ca_system_score_gemma":0.0004980512,"threshold_uncertainty_score":0.01453197},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08783562,0.00083483045,0.2664851,0.022997282,0.0045433836,0.0028827644,0.00022638476,0.004071276,0.6101234],"genre_scores_gemma":[0.3447476,0.0007191889,0.27585122,0.0017280182,0.00069550524,0.0027725364,0.00073444867,0.0008179322,0.37193352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933234,0.0044020647,0.00016994704,0.0004776339,0.0009796164,0.000647326],"domain_scores_gemma":[0.98203295,0.0016685366,0.0004150334,0.0024500426,0.0015737118,0.011859751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111372955,0.0005298743,0.0004725059,0.0010461076,0.005642711,0.008298827,0.0018036745,0.0017384307,0.04924562],"category_scores_gemma":[0.014373126,0.0004406317,0.00040616575,0.00079841,0.002325948,0.006729947,0.009569584,0.0035514932,0.014703289],"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.0006461221,0.0025837931,0.0031542764,0.00026767826,0.000031238327,0.00047609714,0.011818398,0.0022594393,0.0031394556,0.40593964,0.24391069,0.32577324],"study_design_scores_gemma":[0.00013441555,0.00084470457,0.0016042546,0.00013447684,0.000009274266,0.00042497306,0.005801845,0.0047905617,0.001557699,0.08503753,0.8996137,0.000046574314],"about_ca_topic_score_codex":0.00041062813,"about_ca_topic_score_gemma":0.001730994,"teacher_disagreement_score":0.04924562,"about_ca_system_score_codex":0.0012740296,"about_ca_system_score_gemma":0.004112866,"threshold_uncertainty_score":0.164743},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16861224,0.024553357,0.034654126,0.04873047,0.0044597313,0.00017723099,0.00042167952,0.002548738,0.7158425],"genre_scores_gemma":[0.75614154,0.011174049,0.03768089,0.01130189,0.00079910195,0.00020648871,0.00044990875,0.0013324369,0.18091364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00015539459,0.000039593528,0.00016350011,0.00026758976,0.00012536536],"domain_scores_gemma":[0.9990854,0.00027307417,0.000046447865,0.00011825696,0.0002501073,0.00022669557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008123178,0.00055524096,0.00020720692,0.0010446328,0.003581803,0.004844515,0.0008936253,0.0010975322,0.010196736],"category_scores_gemma":[0.00396821,0.0003617728,0.00029443536,0.00085649174,0.0048333877,0.006602189,0.003210616,0.002126878,0.0019355217],"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.00063091045,0.00019439016,0.004094982,0.00043109,0.000052673357,0.0005123492,0.015386711,0.0011372444,0.008979917,0.5163832,0.13251083,0.31968573],"study_design_scores_gemma":[0.00004860082,0.00012517371,0.003034413,0.0003586159,0.000029227294,0.00037414685,0.0032701525,0.0022574512,0.0035849055,0.092899345,0.8939351,0.00008286633],"about_ca_topic_score_codex":0.017139703,"about_ca_topic_score_gemma":0.028297853,"teacher_disagreement_score":0.017139703,"about_ca_system_score_codex":0.0026479142,"about_ca_system_score_gemma":0.002002993,"threshold_uncertainty_score":0.0341115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008313016,0.00010215389,0.99563843,0.00013808468,0.000026045946,0.00027572268,0.00006503032,0.0009833834,0.0019397608],"genre_scores_gemma":[0.02336595,0.00011668541,0.97380686,0.00009817597,0.000022468515,0.0004131072,0.00018188352,0.00019125613,0.0018035943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426174,0.0026136239,0.0005635497,0.0008502533,0.0015175802,0.0001932495],"domain_scores_gemma":[0.99271387,0.002954014,0.00044326272,0.0024373871,0.0011192873,0.000332174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006364626,0.0019019281,0.00091262854,0.004459609,0.0012370694,0.0036711104,0.0032706498,0.0022057898,0.0042557144],"category_scores_gemma":[0.015230702,0.001465357,0.002308803,0.0018663035,0.0029386436,0.004560259,0.0028958307,0.0043581324,0.001859294],"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.00012799547,0.00058475183,0.0016702411,0.0011186403,0.00013875001,0.00030047115,0.0024731762,0.042414535,0.013935432,0.6076322,0.0075654765,0.32203826],"study_design_scores_gemma":[0.00009751597,0.00023992073,0.0007842881,0.00047861048,0.00013851954,0.0009791483,0.00039357785,0.48685026,0.00748917,0.39054307,0.111863635,0.00014236107],"about_ca_topic_score_codex":0.0031416262,"about_ca_topic_score_gemma":0.0059588,"teacher_disagreement_score":0.006364626,"about_ca_system_score_codex":0.0018979902,"about_ca_system_score_gemma":0.0024331328,"threshold_uncertainty_score":0.033659756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066567417,0.11566785,0.1919045,0.03444964,0.017424159,0.00024583258,0.00093800866,0.0004006107,0.6323127],"genre_scores_gemma":[0.18251424,0.12186173,0.21472616,0.012523896,0.022385731,0.0014334472,0.004045924,0.0009979432,0.4395109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970099,0.000986739,0.00020621103,0.00057499437,0.0009760405,0.00024609623],"domain_scores_gemma":[0.99681634,0.001967193,0.00015073293,0.00038499225,0.00050704443,0.00017377638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022417873,0.001557275,0.0013877559,0.0020516738,0.0022003108,0.006450981,0.002239146,0.0026264687,0.027465189],"category_scores_gemma":[0.00860335,0.000717298,0.0015577088,0.0028734077,0.006394101,0.01075564,0.0029332554,0.009273137,0.0073027643],"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.000011401029,0.000018624818,0.00004656336,0.00022136731,0.00001320565,0.00003939822,0.00020770404,0.0010343358,0.00008074119,0.90918154,0.047472548,0.041672453],"study_design_scores_gemma":[0.0000075026674,0.000012668197,0.000069436086,0.00016689306,0.000006178085,0.00014362295,0.00009638362,0.0019398321,0.00010906592,0.79316145,0.20427488,0.0000121392095],"about_ca_topic_score_codex":0.0013092478,"about_ca_topic_score_gemma":0.0012664481,"teacher_disagreement_score":0.027465189,"about_ca_system_score_codex":0.0033517755,"about_ca_system_score_gemma":0.0018371772,"threshold_uncertainty_score":0.0918802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872203,0.00017840107,0.0034828829,0.00007601499,0.00003623456,0.00012644439,0.00051839795,0.00036298804,0.007998325],"genre_scores_gemma":[0.9700209,0.00024325345,0.015823249,0.000065771164,0.000014205821,0.00014071974,0.0035400982,0.000079719015,0.010071937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995067,0.00006750743,0.000028781833,0.00013111654,0.00019490659,0.000070953465],"domain_scores_gemma":[0.99912757,0.00030039594,0.000052299103,0.00015018316,0.00017406404,0.00019551425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004432102,0.00082942087,0.0005324041,0.00048448247,0.0005423542,0.0007709868,0.0010405186,0.00045450756,0.00701604],"category_scores_gemma":[0.0018877301,0.00021977708,0.00035837188,0.0005502252,0.00075698557,0.00096654287,0.0010997065,0.0009172168,0.0010288768],"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.019256702,0.0074269245,0.053261083,0.0021241968,0.00071258395,0.0011216288,0.003915101,0.053471953,0.17235768,0.006065186,0.009547539,0.67073935],"study_design_scores_gemma":[0.002576852,0.060628016,0.3784184,0.0004453414,0.000458828,0.0025608337,0.003073814,0.13338834,0.30228359,0.0067260507,0.10909855,0.00034128004],"about_ca_topic_score_codex":0.009622403,"about_ca_topic_score_gemma":0.017929465,"teacher_disagreement_score":0.009622403,"about_ca_system_score_codex":0.0007485407,"about_ca_system_score_gemma":0.0006755119,"threshold_uncertainty_score":0.023470998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002807698,0.0016240631,0.04506784,0.00063658814,0.00037744088,0.00003947868,0.00008293689,0.00020552443,0.94915843],"genre_scores_gemma":[0.10338267,0.0036462815,0.020089379,0.0003710757,0.00022507415,0.00012970905,0.00028120697,0.00017981514,0.87169474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996941,0.0000658185,0.000012027135,0.00004936569,0.00013289924,0.000045759192],"domain_scores_gemma":[0.9998647,0.00004811514,0.000008205165,0.000022775526,0.00003004773,0.000026121857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025031847,0.0013196579,0.00042276757,0.00050509465,0.0008873994,0.0024799365,0.0012938208,0.000764265,0.040311188],"category_scores_gemma":[0.0008861366,0.0003630053,0.00047170935,0.0005967905,0.0014359095,0.0025774303,0.0013908797,0.0016288714,0.011199587],"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.000019090652,0.000024499912,0.000046795725,0.00007119984,0.000007780277,0.00002279137,0.00015029428,0.001827722,0.0002902936,0.89559984,0.03803163,0.06390811],"study_design_scores_gemma":[0.000013354545,0.000022920489,0.00013576362,0.00012862412,0.000006954945,0.00009197526,0.000103454346,0.007842109,0.0004750987,0.65575856,0.3354104,0.00001077687],"about_ca_topic_score_codex":0.0011156305,"about_ca_topic_score_gemma":0.0023412013,"teacher_disagreement_score":0.040311188,"about_ca_system_score_codex":0.0013283405,"about_ca_system_score_gemma":0.000853364,"threshold_uncertainty_score":0.13485438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015430676,0.0039402787,0.019924087,0.0010138899,0.00048516179,0.00002986517,0.00015024522,0.00012041338,0.972793],"genre_scores_gemma":[0.10518815,0.011210406,0.01870411,0.0012270598,0.0009428564,0.00021495832,0.00079035066,0.0003346019,0.86138755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999648,0.00008903593,0.000011927869,0.000056170535,0.00016279111,0.00003216406],"domain_scores_gemma":[0.9998492,0.000055925462,0.000008883589,0.000026207937,0.000037042217,0.000022615483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025150768,0.0011032845,0.00055841287,0.00088820135,0.0008158502,0.0034052623,0.00085559086,0.00070380437,0.048924554],"category_scores_gemma":[0.0010754035,0.0003256332,0.00046620658,0.0011182997,0.0014181654,0.0023799457,0.00096856034,0.0021977287,0.011916672],"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.0000078511985,0.000023545948,0.00003698025,0.000079022524,0.000007198318,0.000017419376,0.00008612635,0.00091243366,0.00019305291,0.9012994,0.058839563,0.038497347],"study_design_scores_gemma":[0.000008942386,0.000008109789,0.00012600406,0.000092956005,0.0000053292874,0.00006887596,0.000047483256,0.0019098897,0.00018762145,0.67079616,0.32674193,0.0000067194433],"about_ca_topic_score_codex":0.0014211296,"about_ca_topic_score_gemma":0.002430086,"teacher_disagreement_score":0.048924554,"about_ca_system_score_codex":0.0018737752,"about_ca_system_score_gemma":0.0011373254,"threshold_uncertainty_score":0.16366893},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029118643,0.0008707064,0.004765307,0.006655012,0.0073163146,0.000158036,0.0050732815,0.0073747695,0.96487457],"genre_scores_gemma":[0.013638009,0.00054725946,0.0016151462,0.001958106,0.00082484394,0.00009488012,0.0029714098,0.002100866,0.97624946],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999137,0.00015243446,0.000046982925,0.00015640841,0.00031375932,0.00019352246],"domain_scores_gemma":[0.99873084,0.00019524939,0.000064047876,0.000242983,0.00044680675,0.00032008428],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008273263,0.0009071883,0.00052015495,0.0015437036,0.0024054777,0.00497003,0.0010828886,0.0012957557,0.6154583],"category_scores_gemma":[0.0037824828,0.00036036133,0.00066057465,0.0010549644,0.00071156694,0.0043154545,0.0037190893,0.0022883965,0.34725434],"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.00014856402,0.00003424463,0.00026973273,0.00010345628,0.0000051456395,0.00013316292,0.00017538358,0.00011050507,0.0002068724,0.013564618,0.91145015,0.073798105],"study_design_scores_gemma":[0.0000082550505,0.000013356555,0.00020864059,0.000040853327,0.0000023762148,0.000056790617,0.00008083415,0.000086050946,0.0001498014,0.0012792705,0.9980659,0.000007976225],"about_ca_topic_score_codex":0.0044542644,"about_ca_topic_score_gemma":0.007661447,"teacher_disagreement_score":0.6154583,"about_ca_system_score_codex":0.0017478183,"about_ca_system_score_gemma":0.0011265305,"threshold_uncertainty_score":0.548502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076356016,0.00033347073,0.9152833,0.0011390895,0.00006665567,0.0001232949,0.0001345306,0.00090034615,0.0056632473],"genre_scores_gemma":[0.9102951,0.00015040378,0.08596006,0.00037212585,0.000045478104,0.00021715082,0.00016735574,0.00015803694,0.002634248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659926,0.0015881935,0.00014384487,0.0007115098,0.00055118295,0.00040602262],"domain_scores_gemma":[0.98708564,0.009275021,0.0010797116,0.0013888808,0.0006821349,0.00048858934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004515212,0.001274276,0.0015664824,0.0008262006,0.0007199606,0.0014794194,0.0023095817,0.0020585565,0.003630368],"category_scores_gemma":[0.028769579,0.0007097049,0.00083236257,0.00065242656,0.0026280605,0.0034304094,0.0029132403,0.0032704696,0.0006234412],"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.00033516536,0.00013476431,0.0019662771,0.00009348882,0.00008739592,0.00010534744,0.00018445164,0.9172845,0.001585653,0.03992362,0.0024192762,0.035880115],"study_design_scores_gemma":[0.000021241882,0.00006111879,0.0001105185,0.000012428174,0.000008558197,0.000022888535,0.000023052327,0.9644516,0.00042002814,0.034516748,0.0003443053,0.0000074232903],"about_ca_topic_score_codex":0.0029902617,"about_ca_topic_score_gemma":0.0029550872,"teacher_disagreement_score":0.004515212,"about_ca_system_score_codex":0.0019792232,"about_ca_system_score_gemma":0.0018062528,"threshold_uncertainty_score":0.023879051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08307689,0.0019407686,0.90179074,0.0025735798,0.00020041205,0.00014473128,0.00021850938,0.0017398248,0.008314485],"genre_scores_gemma":[0.5618934,0.0014827054,0.42778128,0.0006672893,0.000094673705,0.000254089,0.00039997307,0.0003810983,0.007045584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989826,0.00035453466,0.00006983565,0.0002695779,0.00024404438,0.00007940381],"domain_scores_gemma":[0.99416983,0.004001196,0.00026997027,0.0010190068,0.00031626812,0.00022370608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022545883,0.0011772016,0.00077570917,0.00057042175,0.00043101743,0.0015702619,0.0013059065,0.0011970003,0.0050539766],"category_scores_gemma":[0.020907352,0.0007410569,0.0009975643,0.00022806502,0.002086394,0.006101887,0.0019417013,0.0024037687,0.0011932122],"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.00041933983,0.00022214165,0.0069752666,0.0015754703,0.0003370419,0.000348631,0.0013101202,0.23398598,0.020435663,0.25627884,0.0059832362,0.47212827],"study_design_scores_gemma":[0.00011539811,0.0004464552,0.00087138516,0.0003341146,0.00013592967,0.00030292606,0.0003465516,0.5277596,0.015143406,0.43059194,0.023865223,0.00008705915],"about_ca_topic_score_codex":0.0006625083,"about_ca_topic_score_gemma":0.0011602875,"teacher_disagreement_score":0.0050539766,"about_ca_system_score_codex":0.0005996673,"about_ca_system_score_gemma":0.0006078436,"threshold_uncertainty_score":0.016907215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029673502,0.00025420077,0.95714563,0.00024055429,0.00004347304,0.00030287183,0.00005955317,0.001254665,0.011025485],"genre_scores_gemma":[0.2611406,0.0002516961,0.734345,0.00011394993,0.000016033533,0.0003668641,0.00022551758,0.00024525292,0.0032951126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.0004983354,0.000045952416,0.00016766493,0.00038655076,0.00008765134],"domain_scores_gemma":[0.9975987,0.0014048866,0.00016878691,0.00043281273,0.0002741543,0.000120707475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523346,0.0013055371,0.0005572399,0.0012275242,0.00065235037,0.0014301764,0.0021504683,0.00087368855,0.0048809918],"category_scores_gemma":[0.005332127,0.00081615575,0.0008616606,0.000717675,0.0014010452,0.001982178,0.001771807,0.0015260886,0.0008624791],"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.00007177816,0.00022989787,0.0013310538,0.00027287588,0.000082295315,0.00012468126,0.00033504696,0.8249776,0.0044348133,0.06240891,0.0015483566,0.104182675],"study_design_scores_gemma":[0.00003744954,0.00012826339,0.0003147914,0.000025121486,0.000034077453,0.00009011488,0.00012089089,0.95202,0.0028256634,0.034046687,0.010342428,0.000014630973],"about_ca_topic_score_codex":0.004785181,"about_ca_topic_score_gemma":0.005921605,"teacher_disagreement_score":0.0048809918,"about_ca_system_score_codex":0.0011735499,"about_ca_system_score_gemma":0.0011655827,"threshold_uncertainty_score":0.016328573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020045687,0.001197629,0.018150818,0.00049515115,0.00034340995,0.00002070713,0.00005761539,0.00031192004,0.97741824],"genre_scores_gemma":[0.05966452,0.0021253477,0.009271944,0.00031877248,0.0001480274,0.00005826933,0.00021061861,0.00033386625,0.92786866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997552,0.00004050895,0.0000054024545,0.000034067543,0.00011701715,0.0000478216],"domain_scores_gemma":[0.9998536,0.000045325232,0.000009373223,0.000028798277,0.000027677313,0.00003518784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019849358,0.0013862619,0.000468886,0.0007735592,0.0014885142,0.002940564,0.0012629487,0.00097516,0.09225552],"category_scores_gemma":[0.0008625753,0.00042678314,0.00040999617,0.0004835844,0.001180024,0.0030476106,0.002303666,0.0017521874,0.018137725],"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.00006261383,0.00009262005,0.00006881173,0.00014194843,0.000013532695,0.00007742785,0.00038826608,0.0030554798,0.0010441727,0.7257309,0.1469352,0.122389086],"study_design_scores_gemma":[0.000015412554,0.00003378565,0.00024834517,0.00021741103,0.000010272537,0.00017450917,0.00023859562,0.006903463,0.0010500995,0.24220452,0.7488853,0.000018277742],"about_ca_topic_score_codex":0.0023416746,"about_ca_topic_score_gemma":0.0073736985,"teacher_disagreement_score":0.09225552,"about_ca_system_score_codex":0.0011959118,"about_ca_system_score_gemma":0.00071938144,"threshold_uncertainty_score":0.30862546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008791649,0.014903191,0.021656007,0.019187788,0.007359867,0.000094718955,0.00046389707,0.00041420138,0.9350412],"genre_scores_gemma":[0.005928408,0.0069116806,0.0063631805,0.0050105355,0.0029051364,0.00017921937,0.00036704718,0.0003081914,0.9720267],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999814,0.000031242747,0.0000046853424,0.000026426618,0.00010425628,0.000019400286],"domain_scores_gemma":[0.999684,0.00019800046,0.000010008088,0.00001689726,0.000058360438,0.00003278473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002168302,0.0013209796,0.00076190464,0.0012845222,0.0010882538,0.0020053391,0.00092473836,0.0014856594,0.058264483],"category_scores_gemma":[0.0010663068,0.00053210225,0.0008447478,0.0021774482,0.0015311175,0.0038124996,0.0012108502,0.0037722134,0.02260563],"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.000010311427,0.000047394944,0.000033429995,0.0000804573,0.0000059939084,0.00004310645,0.000092705544,0.00084885804,0.00017436201,0.161726,0.79806834,0.03886909],"study_design_scores_gemma":[0.000009400881,0.000018298759,0.0001286382,0.00007367063,0.0000037226175,0.000076011136,0.00005252835,0.00096166285,0.00010428939,0.18543522,0.8131268,0.000009826994],"about_ca_topic_score_codex":0.0022308251,"about_ca_topic_score_gemma":0.0058052945,"teacher_disagreement_score":0.058264483,"about_ca_system_score_codex":0.0014377882,"about_ca_system_score_gemma":0.00063196884,"threshold_uncertainty_score":0.1949141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3899657,0.0012539569,0.29164365,0.0016180368,0.00072748284,0.00014626229,0.00083866547,0.00054676045,0.31325945],"genre_scores_gemma":[0.905679,0.00045319452,0.026651965,0.00044095944,0.0002265803,0.00010355376,0.00043090858,0.0001733336,0.06584048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.00025427956,0.00007252124,0.0002003665,0.0002771959,0.00018637389],"domain_scores_gemma":[0.99878496,0.00047694225,0.00010517917,0.00017187565,0.0002678056,0.0001933532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007254471,0.0006132053,0.00067579746,0.0016510818,0.0019151013,0.0031730072,0.0009148617,0.0010366915,0.011537989],"category_scores_gemma":[0.0028395825,0.0004742334,0.00074645894,0.0008144167,0.0025835559,0.0034771285,0.0018923808,0.0019939572,0.0020760747],"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.00004137648,0.000014891455,0.000097916316,0.00002239753,0.000005518037,0.000059663435,0.0003082086,0.00033217476,0.00081680506,0.99337524,0.00048921217,0.0044365707],"study_design_scores_gemma":[0.000013628997,0.000020518737,0.00012974079,0.000013670015,0.0000055760574,0.00008362814,0.00011671077,0.0013667708,0.0009197236,0.99151343,0.0058010006,0.00001547393],"about_ca_topic_score_codex":0.00090269215,"about_ca_topic_score_gemma":0.00088562304,"teacher_disagreement_score":0.011537989,"about_ca_system_score_codex":0.0007960969,"about_ca_system_score_gemma":0.0007492129,"threshold_uncertainty_score":0.038598478},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12990604,0.0034861295,0.23731941,0.008257426,0.0017232053,0.00058415515,0.0080943005,0.0017862648,0.6088431],"genre_scores_gemma":[0.605765,0.00524694,0.09124238,0.0025180038,0.0008394783,0.0009962256,0.010713019,0.0009855408,0.28169346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945635,0.000052683714,0.000030219222,0.00013596143,0.00016860235,0.00015614984],"domain_scores_gemma":[0.9981426,0.0013301256,0.00010056659,0.00011088689,0.0002162536,0.000099662626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055602,0.0010663499,0.0018125759,0.0007999932,0.0021934563,0.0034743438,0.001250322,0.0017336955,0.029317971],"category_scores_gemma":[0.0021276553,0.00068542635,0.0014023689,0.0014673197,0.001645241,0.0060612406,0.0016203352,0.004383895,0.005269241],"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.00074553146,0.00031641545,0.0007851451,0.0013844112,0.000096643555,0.0006556399,0.00033629496,0.022831475,0.0063095647,0.75185883,0.09190533,0.122774765],"study_design_scores_gemma":[0.00012857666,0.000063518055,0.00036203288,0.00013918451,0.000051030158,0.00045260758,0.00024133132,0.022873875,0.0035612704,0.9161189,0.055976685,0.00003095481],"about_ca_topic_score_codex":0.0026698604,"about_ca_topic_score_gemma":0.0031980781,"teacher_disagreement_score":0.029317971,"about_ca_system_score_codex":0.0012781213,"about_ca_system_score_gemma":0.001559648,"threshold_uncertainty_score":0.09807837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8393385,0.003345561,0.042988326,0.0037307641,0.0008409071,0.000214499,0.002369432,0.0030642443,0.10410788],"genre_scores_gemma":[0.9714267,0.00015127644,0.015028232,0.00020690766,0.00004670669,0.000032069278,0.0018604659,0.00017515503,0.011072525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978611,0.0009243278,0.00012966589,0.00032524997,0.00059438427,0.00016530897],"domain_scores_gemma":[0.9906908,0.0068435147,0.00035498556,0.00064777397,0.0009501179,0.00051279116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036200255,0.0007501006,0.0008556442,0.00091597415,0.00063748646,0.003248907,0.0012193873,0.001267449,0.015443819],"category_scores_gemma":[0.025782367,0.0002735015,0.0002641079,0.00044961876,0.00070956326,0.0038121138,0.0016429604,0.0014824126,0.0020518955],"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.009217362,0.0011008767,0.043849144,0.00083744456,0.000434521,0.00023069646,0.00078763353,0.12555756,0.0074534994,0.060601577,0.122615315,0.6273143],"study_design_scores_gemma":[0.000625287,0.0027673268,0.023682885,0.00033562275,0.0001788026,0.00022396672,0.001358969,0.8699946,0.010437101,0.05749062,0.032817107,0.000087697175],"about_ca_topic_score_codex":0.009765313,"about_ca_topic_score_gemma":0.019900197,"teacher_disagreement_score":0.015443819,"about_ca_system_score_codex":0.0012623708,"about_ca_system_score_gemma":0.0011068227,"threshold_uncertainty_score":0.05166477},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04037049,0.00041396325,0.09307586,0.0026116716,0.0012546565,0.0005703455,0.0043126997,0.000896861,0.85649353],"genre_scores_gemma":[0.4220746,0.00068112725,0.05215383,0.0020285724,0.00034397934,0.0011141121,0.0061527174,0.0011287677,0.51432234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992385,0.00016614686,0.0000300004,0.00011526923,0.00017905458,0.00027107538],"domain_scores_gemma":[0.9993456,0.00015292122,0.00005069848,0.00009608393,0.00018843579,0.00016611825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060747407,0.0010768715,0.0008720459,0.001437652,0.00255987,0.0030572005,0.0017541386,0.0019474252,0.11487033],"category_scores_gemma":[0.0017653074,0.0002934207,0.00079483836,0.0011844734,0.0013816752,0.0037469137,0.0022284354,0.0026079288,0.019481098],"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.00011004875,0.000047374593,0.00009512633,0.000092710376,0.000012162417,0.000077755816,0.00006117196,0.00071966025,0.00064636074,0.9494472,0.038502827,0.010187489],"study_design_scores_gemma":[0.000080460115,0.000023326655,0.00022641562,0.00003030147,0.000010551253,0.000104589286,0.00009208282,0.0049206363,0.000949434,0.910987,0.08255044,0.000024728628],"about_ca_topic_score_codex":0.004560612,"about_ca_topic_score_gemma":0.0069835884,"teacher_disagreement_score":0.11487033,"about_ca_system_score_codex":0.0020895763,"about_ca_system_score_gemma":0.0015790842,"threshold_uncertainty_score":0.38427955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53413266,0.001118688,0.43901795,0.0012505839,0.00041383624,0.0004564719,0.0075146,0.0034584503,0.012636806],"genre_scores_gemma":[0.93977994,0.00023602323,0.044854905,0.00015452322,0.000057401907,0.0002706882,0.005403159,0.000048661575,0.009194656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996705,0.000053078726,0.000019524598,0.000111882946,0.000072574716,0.00007236552],"domain_scores_gemma":[0.999653,0.000108910324,0.000056061857,0.000023834355,0.00010466624,0.000053637228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000647876,0.0012262769,0.00066014985,0.0011811019,0.00030268266,0.0006585675,0.0014332925,0.0005924953,0.003333705],"category_scores_gemma":[0.0015128462,0.00034320593,0.0005881125,0.00075289566,0.00022990552,0.0010177231,0.0007703868,0.0013216931,0.0009542306],"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.00082500733,0.0013770384,0.047411256,0.00016377926,0.000353621,0.00021732692,0.0001122019,0.6309523,0.0039206985,0.005346369,0.013048403,0.29627204],"study_design_scores_gemma":[0.000010008934,0.00007717664,0.0026065968,0.000006690183,0.0000123079,0.000014156258,0.000011320114,0.9948559,0.0004350974,0.0014700434,0.00049341563,0.000007286677],"about_ca_topic_score_codex":0.020060936,"about_ca_topic_score_gemma":0.041885618,"teacher_disagreement_score":0.020060936,"about_ca_system_score_codex":0.0008988416,"about_ca_system_score_gemma":0.001063328,"threshold_uncertainty_score":0.039888322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07511655,0.00044181268,0.91614157,0.0007159526,0.00010919383,0.0001684653,0.00055058306,0.0008708619,0.0058849985],"genre_scores_gemma":[0.8471246,0.00032126965,0.13725795,0.00023581083,0.00008006641,0.0002980198,0.0010902275,0.00013007692,0.013461941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990264,0.0003094796,0.000038969312,0.0002908426,0.00015738502,0.00017682351],"domain_scores_gemma":[0.9983064,0.0009637361,0.0002138306,0.00011329867,0.00023747278,0.00016528119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013767758,0.0012300847,0.0014611371,0.0012868384,0.00082523236,0.0010903977,0.0022227776,0.001427345,0.0074806237],"category_scores_gemma":[0.0050353347,0.00038744858,0.0010050888,0.0010146507,0.0009216285,0.0028933273,0.0009692241,0.0019498263,0.0011916709],"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.00032563854,0.00025791238,0.008407276,0.00018285448,0.000115632356,0.0002446406,0.0003316161,0.79484564,0.0017815091,0.07105072,0.0067115095,0.11574503],"study_design_scores_gemma":[0.000007658809,0.000034525125,0.0003993175,0.0000053728763,0.000008325651,0.000016481785,0.000019010498,0.9871492,0.00009765038,0.011844071,0.0004078799,0.000010475962],"about_ca_topic_score_codex":0.026552541,"about_ca_topic_score_gemma":0.035083625,"teacher_disagreement_score":0.026552541,"about_ca_system_score_codex":0.0015932331,"about_ca_system_score_gemma":0.0014968066,"threshold_uncertainty_score":0.052795947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19965029,0.0016240504,0.6225355,0.0016394899,0.00041182234,0.0004269784,0.001014494,0.00089930324,0.1717981],"genre_scores_gemma":[0.89648074,0.00033450985,0.09131575,0.00043307312,0.00019151438,0.00029963788,0.0007062975,0.00016262886,0.010075812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918349,0.0033933346,0.00047800867,0.0017183592,0.0018968061,0.0006785391],"domain_scores_gemma":[0.97778535,0.017143572,0.001018098,0.0013534528,0.0019425498,0.0007570319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004378845,0.00084769534,0.0014129471,0.003689493,0.0022745575,0.0039114817,0.0019883192,0.0014240491,0.006639908],"category_scores_gemma":[0.025391594,0.00059862086,0.001954727,0.0023931558,0.009039241,0.010621529,0.003522282,0.0042681796,0.0007387404],"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.000054497123,0.000018771927,0.000701026,0.000051592855,0.000015228638,0.0000583019,0.0003160548,0.0012051248,0.00035802138,0.9855262,0.00062657794,0.0110686],"study_design_scores_gemma":[0.000015103668,0.000055279703,0.00054328603,0.00002973676,0.000016282609,0.00009397011,0.0001745075,0.005898687,0.001033284,0.9882438,0.0038720092,0.000024101919],"about_ca_topic_score_codex":0.0013752196,"about_ca_topic_score_gemma":0.0013291644,"teacher_disagreement_score":0.006639908,"about_ca_system_score_codex":0.0035166764,"about_ca_system_score_gemma":0.0012130926,"threshold_uncertainty_score":0.025515378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017355315,0.0007182428,0.96843576,0.00044143014,0.0002978926,0.0001754972,0.00028183416,0.0040008705,0.008293203],"genre_scores_gemma":[0.26274234,0.0006707626,0.7208931,0.0006818989,0.00024350634,0.0005137364,0.0011475942,0.0013443114,0.011762746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769706,0.0006892096,0.00013075964,0.00043992625,0.00077686895,0.00026618803],"domain_scores_gemma":[0.99605393,0.002054738,0.00025625227,0.00071381114,0.00065620977,0.00026509704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022691793,0.0014419237,0.0021834956,0.001571853,0.001145695,0.0019642052,0.0038334087,0.0019545094,0.009464282],"category_scores_gemma":[0.011887322,0.00086909457,0.0019780707,0.0019264732,0.0016587299,0.003875115,0.004135242,0.00289433,0.003375764],"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.00073140685,0.00037941107,0.002240454,0.00041938786,0.0001671325,0.00016280766,0.00024111249,0.49191594,0.0048585692,0.10914815,0.027181841,0.36255378],"study_design_scores_gemma":[0.00010400434,0.00008382366,0.00011065906,0.00001863792,0.000028424854,0.00007055073,0.000022757,0.9601638,0.0011936148,0.03264536,0.0055411384,0.000017145512],"about_ca_topic_score_codex":0.0059508607,"about_ca_topic_score_gemma":0.0059917127,"teacher_disagreement_score":0.009464282,"about_ca_system_score_codex":0.0018410147,"about_ca_system_score_gemma":0.0041756737,"threshold_uncertainty_score":0.031661212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10758403,0.000092621995,0.88904583,0.00011427194,0.000014155726,0.00004070006,0.000018782714,0.00027154147,0.0028180738],"genre_scores_gemma":[0.90021574,0.00009208783,0.0978443,0.000047317208,0.000008783257,0.000067965244,0.00004082376,0.000060412312,0.00162256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904805,0.00032858262,0.000031832005,0.00021158338,0.00026403012,0.000115893345],"domain_scores_gemma":[0.99412435,0.0039765136,0.0007535698,0.00059169217,0.0003380257,0.00021582651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016623788,0.00076077064,0.0007918978,0.00046997424,0.0005576467,0.0007958733,0.0008873719,0.00078281644,0.0014202056],"category_scores_gemma":[0.009012687,0.00057996984,0.000464173,0.00026923057,0.0014893393,0.0018815983,0.0024559188,0.0009909752,0.00019758985],"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.00018756975,0.000034837234,0.0013065134,0.00004828283,0.000043639124,0.00011746628,0.00034182306,0.9382206,0.006938741,0.014911335,0.00032833483,0.03752076],"study_design_scores_gemma":[0.000011330394,0.00010940363,0.00027340336,0.000010395093,0.000009162481,0.000054616357,0.000043472297,0.98941517,0.0017346913,0.007863616,0.0004644642,0.000010220053],"about_ca_topic_score_codex":0.0028511456,"about_ca_topic_score_gemma":0.0032759677,"teacher_disagreement_score":0.0028511456,"about_ca_system_score_codex":0.0006894561,"about_ca_system_score_gemma":0.0010299261,"threshold_uncertainty_score":0.008791566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22789858,0.00014903447,0.7546049,0.00023901057,0.00007583164,0.0004160015,0.00028857603,0.011420219,0.0049078725],"genre_scores_gemma":[0.8707729,0.000034906945,0.12643874,0.000082112056,0.000011094053,0.0002592601,0.00033148393,0.00031698137,0.0017525435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.00036689907,0.000056983296,0.0002526836,0.00022202358,0.0000847856],"domain_scores_gemma":[0.9970847,0.0015879399,0.00029301387,0.00045125073,0.0004025538,0.00018059791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014501108,0.0010711923,0.00064580434,0.0005447514,0.00021720411,0.00083330536,0.0014770742,0.00065365393,0.002164399],"category_scores_gemma":[0.00684116,0.00042034374,0.00035288124,0.00018175312,0.00076689874,0.0007659796,0.0011502742,0.0007757701,0.0007838846],"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.0009029608,0.000779865,0.014769104,0.00023416083,0.00014623019,0.00031434433,0.0006894618,0.6063916,0.044966344,0.004319507,0.003286481,0.3232],"study_design_scores_gemma":[0.00003831933,0.00010786721,0.00081485213,0.0000084623925,0.000007057551,0.000027653205,0.0000244323,0.99159896,0.005046689,0.0017378372,0.0005741567,0.000013742921],"about_ca_topic_score_codex":0.002480195,"about_ca_topic_score_gemma":0.0023113086,"teacher_disagreement_score":0.002480195,"about_ca_system_score_codex":0.0005473846,"about_ca_system_score_gemma":0.0006042018,"threshold_uncertainty_score":0.007668972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59465027,0.0008701223,0.2094529,0.0031750565,0.0014962747,0.008185776,0.013187751,0.037575703,0.13140611],"genre_scores_gemma":[0.67609507,0.00047664743,0.24899897,0.0016876763,0.00014258013,0.0049836,0.013992623,0.0025079676,0.051114876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983765,0.0006682246,0.00009632777,0.00024158576,0.00040593,0.00021148368],"domain_scores_gemma":[0.99542445,0.0026862682,0.00010889185,0.00039927868,0.00063854316,0.00074250536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026084376,0.0011239868,0.00058865646,0.0010473296,0.00057589496,0.001651004,0.0026728269,0.0016125937,0.023293069],"category_scores_gemma":[0.007937521,0.00045285988,0.0006066542,0.00041243192,0.0009286193,0.0021213496,0.002007562,0.0017517513,0.0067009395],"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.008100927,0.015466498,0.016835306,0.0024166622,0.00049686,0.004132327,0.0054062284,0.06804586,0.078316204,0.03276524,0.32669562,0.44132227],"study_design_scores_gemma":[0.0042977473,0.019152198,0.029697651,0.00052355847,0.00015786978,0.0019696506,0.0037203531,0.5185663,0.06825646,0.022599839,0.330595,0.00046338202],"about_ca_topic_score_codex":0.0049534566,"about_ca_topic_score_gemma":0.009504984,"teacher_disagreement_score":0.023293069,"about_ca_system_score_codex":0.0008096525,"about_ca_system_score_gemma":0.00092039513,"threshold_uncertainty_score":0.07792312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7476225,0.00039587368,0.043370582,0.0025130482,0.0003925505,0.00064707425,0.00025350574,0.0024934595,0.20231134],"genre_scores_gemma":[0.9097338,0.00015931977,0.043165255,0.0006663543,0.00004521311,0.000212344,0.00033382024,0.00020405973,0.04547982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980691,0.00090560556,0.00006636802,0.00030038608,0.00039658792,0.00026191922],"domain_scores_gemma":[0.99126524,0.003998463,0.0006175351,0.00087130925,0.0008513678,0.002396031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026034724,0.0005027527,0.00027694626,0.00037115588,0.0011793318,0.0022431817,0.0011453284,0.00067709974,0.008935354],"category_scores_gemma":[0.012407951,0.00031292686,0.00036277558,0.00015357132,0.0010932711,0.0024593028,0.0025445737,0.0018335913,0.0017803786],"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.0039512734,0.0072509176,0.14107317,0.0019364926,0.00027970778,0.0037055418,0.074805275,0.0062817205,0.06968525,0.05197539,0.080063954,0.5589914],"study_design_scores_gemma":[0.00029573424,0.0039079683,0.09681466,0.00040320127,0.00016856391,0.00267273,0.023076432,0.028253008,0.035923738,0.009392788,0.79879904,0.0002921177],"about_ca_topic_score_codex":0.0024168706,"about_ca_topic_score_gemma":0.0103594465,"teacher_disagreement_score":0.008935354,"about_ca_system_score_codex":0.0011175133,"about_ca_system_score_gemma":0.0007415974,"threshold_uncertainty_score":0.029891789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049079947,0.00019699757,0.9461004,0.00020576136,0.000027606968,0.00013006137,0.000080423306,0.0003813126,0.0037975027],"genre_scores_gemma":[0.69310987,0.00023413813,0.3041637,0.000115242154,0.000019146035,0.00028178204,0.0001905166,0.000068767135,0.0018168542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841166,0.00065077853,0.00009965755,0.00019101548,0.0004588792,0.00018812403],"domain_scores_gemma":[0.9968252,0.0019550242,0.00034791982,0.00043009958,0.0002044923,0.00023718423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021990174,0.00085838477,0.0009301915,0.00073082506,0.0005689421,0.0014552522,0.0013218662,0.0007252103,0.0024935056],"category_scores_gemma":[0.0071714544,0.00039538534,0.0009708248,0.00081202143,0.0016851496,0.0027416055,0.001979093,0.0024265538,0.00025461818],"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.00017836592,0.0001010253,0.00086183636,0.00008782648,0.00003649415,0.0000640289,0.00021872512,0.8355477,0.0017795857,0.12014717,0.00059472694,0.040382467],"study_design_scores_gemma":[0.000031086318,0.0000611204,0.00013023222,0.000015604164,0.000011271783,0.000019466535,0.000026780812,0.9230773,0.0009215691,0.07483321,0.00086332567,0.000009069699],"about_ca_topic_score_codex":0.004192201,"about_ca_topic_score_gemma":0.0046876767,"teacher_disagreement_score":0.004192201,"about_ca_system_score_codex":0.0020397506,"about_ca_system_score_gemma":0.0025102547,"threshold_uncertainty_score":0.014799476},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02066751,0.0007914095,0.4933101,0.0018184469,0.0020034474,0.0009199397,0.014583364,0.24499603,0.22090985],"genre_scores_gemma":[0.13494752,0.0008609187,0.6422886,0.0018069957,0.0003821942,0.00082399265,0.02259272,0.01715917,0.1791379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999332,0.00009135607,0.00004801225,0.00014554508,0.00029576258,0.000087230794],"domain_scores_gemma":[0.99790525,0.00040499037,0.000066947636,0.0008772905,0.0005639403,0.0001815381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075747655,0.000897761,0.00041538308,0.0005711069,0.00048063384,0.0015015253,0.0027600073,0.0008568917,0.10335883],"category_scores_gemma":[0.0044501475,0.0006516768,0.00084255764,0.00065985357,0.00030048512,0.0031310753,0.002943886,0.001791825,0.043654405],"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.0011033762,0.00031231123,0.001909193,0.0004958918,0.00006774737,0.0004059392,0.00027663592,0.004018181,0.015818229,0.031705707,0.34817237,0.5957144],"study_design_scores_gemma":[0.00025729815,0.00027010916,0.0024098342,0.00007337907,0.00006115652,0.0007463418,0.00012567654,0.037529405,0.020903451,0.019614343,0.9179256,0.00008334072],"about_ca_topic_score_codex":0.0046192133,"about_ca_topic_score_gemma":0.0059455708,"teacher_disagreement_score":0.10335883,"about_ca_system_score_codex":0.0004149143,"about_ca_system_score_gemma":0.0007794121,"threshold_uncertainty_score":0.34576976},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16977014,0.00038079327,0.27882504,0.0023135236,0.00034491505,0.00015244534,0.00028665655,0.0009034366,0.54702306],"genre_scores_gemma":[0.95676833,0.00006782496,0.02448913,0.00005158385,0.0000385659,0.000060027618,0.00015736501,0.00009530471,0.01827183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992213,0.00032754077,0.00005915657,0.00014889486,0.00013114976,0.00011190714],"domain_scores_gemma":[0.9972458,0.001601789,0.00016598037,0.00041181425,0.00030457767,0.0002701246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082739454,0.000363479,0.00027912844,0.00076394243,0.002507818,0.0033666715,0.0007643448,0.0011859377,0.027793277],"category_scores_gemma":[0.008613056,0.0003630499,0.00038686028,0.00048498128,0.002762339,0.00618649,0.0030075253,0.001533723,0.0013825544],"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.00003546879,0.000018916833,0.00037906945,0.00003707871,0.0000040006644,0.00022564684,0.0018339109,0.0014900862,0.000597441,0.9846705,0.002288547,0.008419376],"study_design_scores_gemma":[0.000021420823,0.000027389291,0.00033788718,0.000027225251,0.0000064612686,0.0003567306,0.0014614562,0.025265912,0.00078403077,0.95613813,0.015558366,0.000014968313],"about_ca_topic_score_codex":0.00052684505,"about_ca_topic_score_gemma":0.0007723899,"teacher_disagreement_score":0.027793277,"about_ca_system_score_codex":0.0010347718,"about_ca_system_score_gemma":0.0004790111,"threshold_uncertainty_score":0.09297782},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020182866,0.018073896,0.015253134,0.063903816,0.33377805,0.0006749154,0.016361075,0.0029303748,0.5470064],"genre_scores_gemma":[0.011235339,0.009937522,0.0053121354,0.0120482305,0.06536433,0.00047668745,0.014805917,0.0017758213,0.879044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988845,0.00015829752,0.000097993325,0.00021178288,0.0005541089,0.000093307324],"domain_scores_gemma":[0.99223846,0.0011865163,0.0003062728,0.0006120075,0.0044453917,0.0012114649],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017247449,0.0010346713,0.0008578786,0.002634424,0.0022236619,0.0045647332,0.0014549855,0.001438721,0.42832845],"category_scores_gemma":[0.015510506,0.00035925204,0.0005958865,0.001992464,0.0006639134,0.0033991314,0.0022425342,0.0037009884,0.31179735],"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.000028000335,0.000017123839,0.000087331035,0.00008754283,0.0000020355035,0.000036127196,0.00006685119,0.000077730954,0.00013580019,0.003906934,0.963122,0.032432526],"study_design_scores_gemma":[0.0000047501394,0.000017612188,0.00024005273,0.00012482726,0.0000016361182,0.000057496505,0.000061449886,0.00004139451,0.000077179364,0.0032011077,0.996167,0.000005532099],"about_ca_topic_score_codex":0.0021575121,"about_ca_topic_score_gemma":0.002333398,"teacher_disagreement_score":0.57167155,"about_ca_system_score_codex":0.0019708916,"about_ca_system_score_gemma":0.0016148753,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37962326,0.0012682859,0.5973633,0.00046242756,0.00007484657,0.00009617338,0.0004073226,0.0008767082,0.019827675],"genre_scores_gemma":[0.9374685,0.00028369226,0.058848664,0.00003801531,0.000020875377,0.000031145715,0.00025176036,0.0001223381,0.0029349942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974805,0.000060015227,0.00001296902,0.00005171579,0.000094735864,0.00003245885],"domain_scores_gemma":[0.9987526,0.0006797811,0.00011062775,0.00019793637,0.00020691729,0.000052145635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038476754,0.00032876004,0.00038680682,0.00075273064,0.00022415334,0.00068084104,0.00070867426,0.00033419352,0.003627589],"category_scores_gemma":[0.0042360867,0.00024562274,0.00043343828,0.00086837594,0.00035753413,0.0014290533,0.0005466697,0.00053301343,0.0003396651],"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.00033946478,0.000119183,0.00793737,0.00022265635,0.000044283945,0.00014901016,0.00019932614,0.70708895,0.0132306395,0.07206699,0.0024264029,0.1961757],"study_design_scores_gemma":[0.0000063923735,0.000029961382,0.001076939,0.0000063026027,0.000007035448,0.000040310293,0.000021801112,0.9925687,0.0016674121,0.0036973315,0.00087272667,0.0000050523972],"about_ca_topic_score_codex":0.0061195,"about_ca_topic_score_gemma":0.0043293205,"teacher_disagreement_score":0.0061195,"about_ca_system_score_codex":0.00056267105,"about_ca_system_score_gemma":0.000476014,"threshold_uncertainty_score":0.012167752},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15143093,0.00024252901,0.8334966,0.0002769066,0.00009675866,0.00027479045,0.00049174065,0.0027169178,0.010972871],"genre_scores_gemma":[0.5759999,0.00020396296,0.4202773,0.000103187056,0.000015956542,0.00037713887,0.000649805,0.0005368758,0.0018358242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883693,0.00038461076,0.000081886246,0.00020969337,0.00038404047,0.0001028191],"domain_scores_gemma":[0.9946439,0.0037993817,0.00022946278,0.00077002624,0.00049940404,0.00005787249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011591696,0.00077848573,0.0004955277,0.00068205973,0.00034427881,0.0016056112,0.0012581534,0.00082257757,0.004684803],"category_scores_gemma":[0.013496975,0.0003738418,0.00079392357,0.00050615973,0.0007815184,0.0012718914,0.00072302343,0.00083355117,0.0004351715],"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.00019563564,0.00017829891,0.0017280558,0.0003629484,0.00006105381,0.00023404609,0.000318665,0.7853362,0.014021663,0.047010582,0.0012786827,0.14927423],"study_design_scores_gemma":[0.00006918501,0.00013356404,0.0002561942,0.00004021633,0.00003803472,0.00006182871,0.00008942137,0.9667965,0.00935784,0.019461013,0.0036822846,0.000013939954],"about_ca_topic_score_codex":0.002798693,"about_ca_topic_score_gemma":0.0032006754,"teacher_disagreement_score":0.004684803,"about_ca_system_score_codex":0.0012363461,"about_ca_system_score_gemma":0.0016817253,"threshold_uncertainty_score":0.015672266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002693077,0.000026927983,0.9941181,0.000032248252,0.000027409904,0.000046907197,0.0000409473,0.0023312743,0.0006831159],"genre_scores_gemma":[0.092251144,0.000065991975,0.9026059,0.00009997702,0.00001864075,0.00019978065,0.00025447743,0.0008361889,0.0036678365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977916,0.00004203789,0.000013509906,0.00006932456,0.00007758054,0.000018421335],"domain_scores_gemma":[0.99960846,0.00023040804,0.000026640271,0.000047637484,0.00006110424,0.000025752835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086611015,0.00081895915,0.00045307275,0.00051463296,0.00033564278,0.00074719975,0.0012010536,0.0013307825,0.010380974],"category_scores_gemma":[0.0027588948,0.0006550998,0.00082896615,0.00027181025,0.00057091203,0.000790578,0.0011398243,0.0012640379,0.0019780847],"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.00028433814,0.00011926954,0.00088895176,0.0003328742,0.0001625026,0.0004247334,0.00039975694,0.34636682,0.11182518,0.022132302,0.008277885,0.5087854],"study_design_scores_gemma":[0.000017813862,0.000025854779,0.0001166748,0.0000110822075,0.0000072737134,0.00006471958,0.000015686684,0.98299164,0.010920956,0.0028295766,0.0029872437,0.000011385974],"about_ca_topic_score_codex":0.0025014314,"about_ca_topic_score_gemma":0.005497217,"teacher_disagreement_score":0.010380974,"about_ca_system_score_codex":0.00045888493,"about_ca_system_score_gemma":0.0004807443,"threshold_uncertainty_score":0.03472787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95995975,0.0002208106,0.035781126,0.00012840779,0.00006531731,0.000178644,0.00008049168,0.0005222608,0.00306316],"genre_scores_gemma":[0.9854236,0.00005206453,0.0139212655,0.00007548935,0.000007469106,0.0000878809,0.00003870104,0.00006751068,0.00032587568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985544,0.00074773247,0.00011291731,0.00025178073,0.0002150715,0.00011798564],"domain_scores_gemma":[0.9765619,0.019052166,0.0018539282,0.0014240042,0.0006038682,0.0005042369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014101524,0.0010921125,0.00035257588,0.00038049268,0.00027478876,0.0009686005,0.0009945637,0.00080717856,0.0017889191],"category_scores_gemma":[0.026582545,0.0003268961,0.00024009537,0.000270708,0.0008991135,0.00077680324,0.00064698316,0.0010237868,0.00021353769],"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.008117657,0.0050467886,0.013699594,0.0008202668,0.00047358588,0.0004886161,0.0009418551,0.63365644,0.17627965,0.004912658,0.0012573599,0.15430552],"study_design_scores_gemma":[0.0012642172,0.013859251,0.02408314,0.00016803038,0.00042787963,0.00059175555,0.0006334963,0.8138162,0.1306409,0.009608796,0.0046222997,0.00028407463],"about_ca_topic_score_codex":0.001918149,"about_ca_topic_score_gemma":0.0019515872,"teacher_disagreement_score":0.001918149,"about_ca_system_score_codex":0.00070727593,"about_ca_system_score_gemma":0.00045893085,"threshold_uncertainty_score":0.007457733},"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":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017822742,0.0018070872,0.0083315065,0.0005796389,0.0005821617,0.00070454745,0.87558144,0.063665435,0.030925408],"genre_scores_gemma":[0.01948606,0.0005155839,0.008342281,0.00041454297,0.00013043999,0.00035423264,0.9573605,0.002110081,0.01128625],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913555,0.00008490152,0.00007052976,0.00031841942,0.0002310721,0.00015957368],"domain_scores_gemma":[0.9990103,0.00016651797,0.0000956048,0.00026212522,0.00021264282,0.0002526863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042689545,0.00338338,0.0008619213,0.0025159507,0.00076963875,0.001909388,0.0017016473,0.0015319261,0.062241524],"category_scores_gemma":[0.0026315402,0.00085459877,0.0012296009,0.0023349493,0.0004557245,0.002934653,0.003209261,0.0015337514,0.07573424],"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.0008227838,0.00022253978,0.0059317965,0.0019193678,0.00009230991,0.00031361237,0.00030964788,0.0007471447,0.0061839693,0.0013804815,0.909361,0.07271535],"study_design_scores_gemma":[0.00019798275,0.00032348646,0.03440088,0.00019953365,0.00006165009,0.000995404,0.0005281177,0.0102898525,0.009159128,0.0021260835,0.9415889,0.00012900466],"about_ca_topic_score_codex":0.02163184,"about_ca_topic_score_gemma":0.04275647,"teacher_disagreement_score":0.062241524,"about_ca_system_score_codex":0.0011267188,"about_ca_system_score_gemma":0.0009198472,"threshold_uncertainty_score":0.20821863},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002398181,0.016291138,0.004956912,0.06084788,0.6296603,0.0013764136,0.0076073087,0.0015647465,0.2752971],"genre_scores_gemma":[0.008347029,0.007286091,0.0018375342,0.014586091,0.09820992,0.0012159366,0.0059023215,0.0010229686,0.8615921],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963967,0.00069724896,0.00017285136,0.0005947291,0.0014934329,0.0006450922],"domain_scores_gemma":[0.9899545,0.0008051976,0.00025405502,0.00031644353,0.0039715352,0.004698228],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043009943,0.0022619674,0.0013382293,0.0024478387,0.004728591,0.008028196,0.0022347325,0.0048261774,0.4239881],"category_scores_gemma":[0.011745258,0.0005755855,0.0017232808,0.0014014161,0.00065345207,0.0032005126,0.0065861614,0.006242466,0.30383116],"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.00017330765,0.000045884044,0.00006366081,0.00017585579,0.000009003622,0.000110859786,0.0000967329,0.000042335232,0.0005396245,0.0013622189,0.9820754,0.015305056],"study_design_scores_gemma":[0.00002568724,0.000037009315,0.0001924347,0.000092480106,0.000009584387,0.000062935396,0.0001947025,0.00003241376,0.00018338727,0.0011156938,0.9980422,0.000011547887],"about_ca_topic_score_codex":0.0011103717,"about_ca_topic_score_gemma":0.002569862,"teacher_disagreement_score":0.4239881,"about_ca_system_score_codex":0.0022777664,"about_ca_system_score_gemma":0.0032253636,"threshold_uncertainty_score":0.82161105},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17880052,0.00050162105,0.63404775,0.0023571088,0.0015338861,0.0012721319,0.0023037957,0.062038165,0.11714496],"genre_scores_gemma":[0.41886172,0.0003068223,0.5238138,0.0006462874,0.00013127495,0.0006701066,0.0015424163,0.0037087637,0.050318904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957734,0.000114626244,0.000027693399,0.000063341446,0.00016134903,0.00005570025],"domain_scores_gemma":[0.998502,0.00086799666,0.000042479933,0.0001276302,0.00016278448,0.00029706798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080330746,0.0006536284,0.00028036142,0.00041249522,0.00047110682,0.0012506257,0.0016630848,0.0010547643,0.014863077],"category_scores_gemma":[0.0027444374,0.00024830867,0.0004379713,0.00019573796,0.0004568053,0.001486546,0.0016319148,0.001193235,0.0033707975],"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.003430372,0.0027257123,0.005936616,0.0019629141,0.00014433276,0.011295904,0.010239213,0.015309763,0.27596807,0.04191738,0.16033445,0.47073528],"study_design_scores_gemma":[0.0012267141,0.0021336174,0.007327686,0.0003160292,0.00010170671,0.0047551063,0.0018150447,0.24335565,0.13513014,0.0108231185,0.5927434,0.00027165588],"about_ca_topic_score_codex":0.00083747413,"about_ca_topic_score_gemma":0.0014280961,"teacher_disagreement_score":0.014863077,"about_ca_system_score_codex":0.00017633676,"about_ca_system_score_gemma":0.0004399241,"threshold_uncertainty_score":0.049721956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71100193,0.0008503837,0.24749099,0.002289811,0.00016356121,0.00051752414,0.00017488198,0.0045646657,0.03294621],"genre_scores_gemma":[0.8967533,0.0001405387,0.09999269,0.00018977077,0.00001864327,0.00020322808,0.00010404146,0.00064084487,0.0019568917],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.97642887,0.018351305,0.0007617496,0.0017070395,0.0022354065,0.0005155888],"domain_scores_gemma":[0.8800605,0.09902094,0.0051429314,0.009885805,0.0042225863,0.0016672778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021272881,0.0015488119,0.0006107547,0.0021271696,0.001260876,0.008172582,0.0013808485,0.001719505,0.0058874562],"category_scores_gemma":[0.12191905,0.0007694491,0.00052948203,0.0009033302,0.002369908,0.006566644,0.00463176,0.0013113531,0.000914398],"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.0032784522,0.001436045,0.07618671,0.0023813122,0.00016758201,0.0012070487,0.12927045,0.027686443,0.045403842,0.059029024,0.008406223,0.64554685],"study_design_scores_gemma":[0.002533546,0.010566315,0.07554808,0.0032745164,0.0009509826,0.0033116087,0.11380607,0.24237749,0.085731216,0.2046855,0.25620338,0.0010113204],"about_ca_topic_score_codex":0.00082602893,"about_ca_topic_score_gemma":0.0014842991,"teacher_disagreement_score":0.021272881,"about_ca_system_score_codex":0.0014260291,"about_ca_system_score_gemma":0.0014406526,"threshold_uncertainty_score":0.11250311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005552338,0.00015707802,0.98961556,0.00009624265,0.000046981022,0.000057070512,0.00084502035,0.0019984099,0.0016312866],"genre_scores_gemma":[0.2735647,0.00054203504,0.70795876,0.00027226188,0.00008465094,0.00062312244,0.0074898372,0.001292588,0.008172114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996393,0.000069919624,0.000025643883,0.00016052055,0.00006905226,0.000035681594],"domain_scores_gemma":[0.9996166,0.00012852551,0.000039441504,0.00012494097,0.000064208565,0.000026182208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041334645,0.0010245475,0.00056014856,0.00103514,0.00027323567,0.001193185,0.0013629295,0.0009890143,0.0074911],"category_scores_gemma":[0.0021702915,0.00043875875,0.0012223817,0.0009059647,0.00079480384,0.0017744901,0.0015172897,0.0013217642,0.0022510814],"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.000375152,0.00016370918,0.0027572562,0.00047850018,0.00009420961,0.0002701029,0.00040547168,0.33407632,0.02534182,0.08576851,0.017824106,0.53244483],"study_design_scores_gemma":[0.000017705548,0.00006208718,0.00056819513,0.000056075372,0.000017172004,0.000114814764,0.000048453763,0.93775785,0.0054252916,0.042870402,0.013036423,0.000025496036],"about_ca_topic_score_codex":0.002903921,"about_ca_topic_score_gemma":0.0041702245,"teacher_disagreement_score":0.0074911,"about_ca_system_score_codex":0.00059038453,"about_ca_system_score_gemma":0.0004989478,"threshold_uncertainty_score":0.025060236},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027239116,0.0002533713,0.9090151,0.0009352055,0.00011068763,0.00013073247,0.00033540363,0.0002528842,0.061727412],"genre_scores_gemma":[0.68880767,0.0007342087,0.26277,0.0002453789,0.00012560045,0.00071669574,0.0004357867,0.00015246737,0.046012077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999686,0.00008286991,0.000021558983,0.00007416391,0.00009570806,0.000039671042],"domain_scores_gemma":[0.9996623,0.00011224634,0.00005635146,0.000053608062,0.00006531132,0.000050167844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039625473,0.00057110336,0.0002755832,0.0006197146,0.0009155898,0.0020354348,0.0010739199,0.0013182868,0.0051255915],"category_scores_gemma":[0.0013229708,0.00033789035,0.00078236376,0.00037169448,0.0014413347,0.0028964723,0.0013710924,0.00096931594,0.0008017859],"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.000021141988,0.000019517987,0.00031177356,0.000045470784,0.000011938629,0.00022723363,0.000800863,0.12670651,0.0020890138,0.8630223,0.0007601113,0.005984029],"study_design_scores_gemma":[0.00004292435,0.000056099398,0.00033351942,0.000037982543,0.000018986426,0.00023692792,0.0002968667,0.64040047,0.00085795246,0.31156632,0.046122387,0.000029524326],"about_ca_topic_score_codex":0.0063475654,"about_ca_topic_score_gemma":0.00364567,"teacher_disagreement_score":0.0063475654,"about_ca_system_score_codex":0.00090906466,"about_ca_system_score_gemma":0.0009099256,"threshold_uncertainty_score":0.017146766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8064103,0.000322307,0.18207651,0.00035824216,0.000030621948,0.00016176519,0.00006286033,0.00054069,0.010036655],"genre_scores_gemma":[0.95306,0.00013536231,0.04479875,0.000038658654,0.0000057148313,0.000041748142,0.0000692753,0.000024747838,0.0018257905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878055,0.0006506192,0.000057483594,0.00024330606,0.00015624065,0.00011186332],"domain_scores_gemma":[0.99765754,0.0011909502,0.00033090927,0.00020389489,0.00023486673,0.0003817983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001522299,0.0006455447,0.00042542449,0.00043791847,0.00053248653,0.0015563514,0.00070263864,0.0008194552,0.0026548896],"category_scores_gemma":[0.007239704,0.00026848,0.0003313715,0.00026155115,0.00067011704,0.0014485429,0.0013945869,0.0006757076,0.0005133736],"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.0020987482,0.004545777,0.11458984,0.0012578513,0.0002815813,0.0009365166,0.011982068,0.083280705,0.083196536,0.018494828,0.0032066242,0.67612886],"study_design_scores_gemma":[0.00019994115,0.0045910175,0.16700648,0.00028636123,0.0002724558,0.001154301,0.009518816,0.71322435,0.03266994,0.050439786,0.020424768,0.00021175084],"about_ca_topic_score_codex":0.0021153651,"about_ca_topic_score_gemma":0.0032578148,"teacher_disagreement_score":0.0026548896,"about_ca_system_score_codex":0.00048070462,"about_ca_system_score_gemma":0.00058789,"threshold_uncertainty_score":0.00888145},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032678773,0.0052787038,0.047852032,0.0032858483,0.00048765028,0.000036254838,0.00007098799,0.000302376,0.9394182],"genre_scores_gemma":[0.098969616,0.010038411,0.05174988,0.0014355745,0.0003024767,0.00014342573,0.00039371877,0.00038529912,0.8365815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994766,0.00019864833,0.000023157096,0.00007491374,0.00017537695,0.000051368086],"domain_scores_gemma":[0.99956495,0.00021473694,0.00002333028,0.000081071295,0.000060748087,0.000055154527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730386,0.0006809582,0.00023651346,0.00085055636,0.00152705,0.007809484,0.00097382895,0.0013876475,0.042461004],"category_scores_gemma":[0.0019854608,0.00031687858,0.0002982378,0.00071554095,0.0023478009,0.011487072,0.0029932158,0.0017553094,0.0108258445],"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.000010026641,0.000030352652,0.000115271454,0.00013914566,0.0000065752924,0.00010615548,0.0049082376,0.00025371296,0.0007119313,0.81617814,0.05065227,0.12688814],"study_design_scores_gemma":[0.0000028408892,0.000007734225,0.00008471923,0.00016492153,0.000004278567,0.00018147477,0.0018586621,0.00041244953,0.0006180386,0.12481569,0.8718432,0.000006018781],"about_ca_topic_score_codex":0.0006508581,"about_ca_topic_score_gemma":0.0012609228,"teacher_disagreement_score":0.042461004,"about_ca_system_score_codex":0.0009398212,"about_ca_system_score_gemma":0.00086026266,"threshold_uncertainty_score":0.14204621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6633191,0.00069517456,0.25153598,0.00084222085,0.0000709427,0.00043526525,0.0072277104,0.0006696719,0.07520393],"genre_scores_gemma":[0.96384645,0.0001243917,0.029752826,0.000020332507,0.000012805417,0.00025327964,0.0015430014,0.0000661541,0.004380816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864143,0.00053652114,0.000058387264,0.00019864179,0.0004724336,0.00009268436],"domain_scores_gemma":[0.98493445,0.0113837,0.00093850214,0.0008864129,0.0015545797,0.00030242003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016873225,0.00017582971,0.00017546311,0.002965361,0.00058975746,0.0021426233,0.0004818148,0.0002320377,0.008584759],"category_scores_gemma":[0.016260305,0.00013365508,0.0002651461,0.0022797869,0.0013316789,0.0021289082,0.0008879932,0.0006123413,0.0005986833],"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.00031757695,0.00018252012,0.034553908,0.00071737694,0.00007001861,0.00025095968,0.014668149,0.0090911295,0.01273136,0.79269946,0.0056979586,0.12901957],"study_design_scores_gemma":[0.000046433648,0.00019018668,0.10722482,0.00031704205,0.00006947122,0.00053743727,0.027278597,0.23318447,0.022542104,0.5579329,0.050581697,0.000094983254],"about_ca_topic_score_codex":0.001988889,"about_ca_topic_score_gemma":0.0017568952,"teacher_disagreement_score":0.008584759,"about_ca_system_score_codex":0.0014365928,"about_ca_system_score_gemma":0.000946907,"threshold_uncertainty_score":0.028718889},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061686356,0.022329716,0.33596808,0.031144593,0.0067738625,0.0028464424,0.008186855,0.003636101,0.52742803],"genre_scores_gemma":[0.42315054,0.025995295,0.25912097,0.006323597,0.0037364967,0.009857221,0.019211408,0.0040137004,0.24859089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940289,0.0034989964,0.00026596233,0.00065423304,0.0012329958,0.00031899143],"domain_scores_gemma":[0.99669635,0.0016358017,0.0001561219,0.000475333,0.00040206482,0.00063436053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059462986,0.0005698275,0.0004670744,0.0016013926,0.0023863646,0.00630951,0.0014620048,0.0020527989,0.028010413],"category_scores_gemma":[0.008705251,0.0004607453,0.0005399807,0.0024442493,0.003469843,0.0049204556,0.008342857,0.0026561134,0.0064859465],"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.00019132857,0.00028777958,0.0032801926,0.0012413595,0.00003492936,0.00038604494,0.023058897,0.0037517538,0.0026130038,0.5764989,0.10694399,0.28171182],"study_design_scores_gemma":[0.000011425459,0.000072789706,0.0010730304,0.0002987134,0.000003188831,0.0001620362,0.002742678,0.00077755237,0.0008061301,0.028388942,0.9656424,0.000021160378],"about_ca_topic_score_codex":0.0022368801,"about_ca_topic_score_gemma":0.0015948154,"teacher_disagreement_score":0.028010413,"about_ca_system_score_codex":0.0023385421,"about_ca_system_score_gemma":0.0022799096,"threshold_uncertainty_score":0.093704104},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046084184,0.036840245,0.18344714,0.18849356,0.004700725,0.00014119473,0.00043404504,0.0015497206,0.53830904],"genre_scores_gemma":[0.68032765,0.025336267,0.13332653,0.020255959,0.0032236555,0.00029772316,0.00070155336,0.0015023865,0.13502839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980136,0.0007870733,0.00005472502,0.00030462706,0.00056942337,0.00027050925],"domain_scores_gemma":[0.9969277,0.0015684582,0.00008617606,0.00039706237,0.00055934006,0.00046127717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022383407,0.00060012523,0.0005309742,0.0008786664,0.0023380439,0.0052002897,0.001477428,0.0027415403,0.014759147],"category_scores_gemma":[0.010844284,0.00024508682,0.00043268967,0.00089413545,0.0064145825,0.008954646,0.00411369,0.0045521557,0.0034361929],"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.000068471476,0.000028413422,0.00028592843,0.000107642096,0.000012580777,0.0000453618,0.00042366795,0.0028453404,0.00036414573,0.87889713,0.045887575,0.071033776],"study_design_scores_gemma":[0.000021213265,0.000043832377,0.0003659351,0.00021862875,0.000009040286,0.00017385115,0.00061471283,0.00969094,0.0006510264,0.59603006,0.39214805,0.00003265473],"about_ca_topic_score_codex":0.0049973195,"about_ca_topic_score_gemma":0.0047145886,"teacher_disagreement_score":0.014759147,"about_ca_system_score_codex":0.002292123,"about_ca_system_score_gemma":0.0024405746,"threshold_uncertainty_score":0.049374282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21088234,0.0028264856,0.59976846,0.0009000271,0.000890628,0.003133204,0.0888568,0.07263263,0.020109393],"genre_scores_gemma":[0.23492125,0.0011118584,0.56375676,0.0003318182,0.00012184253,0.0011324228,0.188622,0.0027594916,0.0072425595],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942183,0.000054988664,0.000033046275,0.00024889997,0.00014088204,0.00010044735],"domain_scores_gemma":[0.9992199,0.00021065304,0.00006752946,0.00012080474,0.0002939773,0.00008715806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003879444,0.002686296,0.0013294264,0.0060727457,0.00079283677,0.0014369293,0.001957031,0.0019144745,0.0061464724],"category_scores_gemma":[0.0019873334,0.0011919809,0.001959812,0.002983351,0.00045415873,0.001060211,0.0013701975,0.0015517488,0.0045780647],"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.0011647784,0.0012697956,0.007303247,0.0013426264,0.00046530965,0.00113665,0.0003351407,0.0471887,0.09331807,0.0052730944,0.17409055,0.66711205],"study_design_scores_gemma":[0.00018809052,0.0004232255,0.01778306,0.0002916742,0.00020367364,0.0010046856,0.0006238455,0.8346731,0.083674334,0.011782962,0.049227454,0.00012385825],"about_ca_topic_score_codex":0.018452875,"about_ca_topic_score_gemma":0.04599595,"teacher_disagreement_score":0.018452875,"about_ca_system_score_codex":0.0013219846,"about_ca_system_score_gemma":0.0015351452,"threshold_uncertainty_score":0.03669095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37037137,0.00026050082,0.61510694,0.00018164124,0.000074332595,0.0005615643,0.00015353104,0.005893144,0.0073969364],"genre_scores_gemma":[0.79232776,0.00008534949,0.19948754,0.00007467389,0.00002377774,0.00028679433,0.0002182144,0.00042119247,0.0070745754],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994778,0.0002502635,0.000023245364,0.00013462556,0.00006514799,0.000048945665],"domain_scores_gemma":[0.99847716,0.0009467979,0.00010547467,0.00011200726,0.00018162359,0.00017696882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086997193,0.0009859632,0.00043943434,0.00037933013,0.00048368788,0.0008873368,0.0009383717,0.0004989635,0.004944421],"category_scores_gemma":[0.003562626,0.00034258352,0.00025865517,0.00012666527,0.00038480788,0.0009451052,0.001217281,0.0004646925,0.0011204217],"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.0029053346,0.0013888913,0.013169973,0.0011935586,0.00013453556,0.0016440991,0.018471478,0.026902325,0.46866685,0.00874131,0.0075711193,0.4492105],"study_design_scores_gemma":[0.00047585805,0.002642185,0.0224398,0.00019131896,0.00025642503,0.0013224368,0.0063423715,0.70912015,0.19641724,0.009471631,0.051073425,0.00024719487],"about_ca_topic_score_codex":0.0006101182,"about_ca_topic_score_gemma":0.0014891877,"teacher_disagreement_score":0.004944421,"about_ca_system_score_codex":0.00024186174,"about_ca_system_score_gemma":0.00019107189,"threshold_uncertainty_score":0.016540706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7406395,0.0007562389,0.21673656,0.0019771953,0.00010774574,0.00014332647,0.00035194712,0.00024102794,0.039046463],"genre_scores_gemma":[0.96641815,0.000506136,0.023604017,0.0002612954,0.000054586526,0.00013661521,0.00023532595,0.00006328646,0.008720565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999215,0.0003480694,0.000023062319,0.00013484403,0.00011640112,0.00016253836],"domain_scores_gemma":[0.9949713,0.0032633506,0.0007297791,0.00021944012,0.00022702207,0.0005890968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006638071,0.0009621933,0.00085480406,0.0009831154,0.0010829516,0.0017253179,0.0010343288,0.0010905967,0.003937331],"category_scores_gemma":[0.0063778902,0.00037140615,0.00050003955,0.0009288445,0.0020683224,0.0026247208,0.0018753873,0.0012088664,0.0004976288],"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.0005150163,0.00012884485,0.0022516923,0.0002225853,0.00009201288,0.000555068,0.00065511337,0.28249145,0.009116908,0.6782788,0.0047704848,0.02092192],"study_design_scores_gemma":[0.00006603798,0.000117301584,0.00051851134,0.00003085089,0.000016135315,0.0001604938,0.00028956393,0.7039879,0.001629331,0.29027563,0.0028805651,0.000027674872],"about_ca_topic_score_codex":0.0019500157,"about_ca_topic_score_gemma":0.0015847945,"teacher_disagreement_score":0.003937331,"about_ca_system_score_codex":0.0014982339,"about_ca_system_score_gemma":0.00058483524,"threshold_uncertainty_score":0.013171673},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03547413,0.022908783,0.16883072,0.011215454,0.0008051911,0.00010890937,0.0009090285,0.000620929,0.7591269],"genre_scores_gemma":[0.577396,0.028467689,0.10010411,0.0015588723,0.00043646374,0.00027190935,0.0014014338,0.0005208073,0.28984272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999754,0.00008219641,0.000007973785,0.00004631497,0.00007882589,0.000030667932],"domain_scores_gemma":[0.99884844,0.0009415864,0.000048586382,0.00003863535,0.000059157115,0.00006354765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365774,0.0008070855,0.00028340932,0.001154357,0.00061176403,0.0051941657,0.0008286586,0.0007836549,0.014026413],"category_scores_gemma":[0.002545668,0.00031689127,0.00026537676,0.0012465483,0.0018104238,0.0060516046,0.0011521297,0.0016935597,0.0019795876],"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.000042123193,0.00008358348,0.0024197288,0.0002801297,0.000024384053,0.000079244004,0.0057223598,0.0029701428,0.00056645524,0.76029646,0.039046884,0.18846855],"study_design_scores_gemma":[0.000005574873,0.00002058477,0.0028250844,0.00045919052,0.000011060767,0.00013824068,0.0063492125,0.011826664,0.00052268594,0.7709172,0.20690276,0.00002181113],"about_ca_topic_score_codex":0.0038273095,"about_ca_topic_score_gemma":0.0066442313,"teacher_disagreement_score":0.014026413,"about_ca_system_score_codex":0.0010869913,"about_ca_system_score_gemma":0.00082310487,"threshold_uncertainty_score":0.04692298},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026102664,0.0032550443,0.0032988142,0.06058171,0.06621328,0.0008900494,0.006572534,0.0010357674,0.8320503],"genre_scores_gemma":[0.06508354,0.00079194916,0.0024050192,0.018789597,0.0037652252,0.00061438745,0.006909516,0.00029272767,0.901348],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974841,0.00017460535,0.000042342515,0.00020977815,0.0011760896,0.00091300317],"domain_scores_gemma":[0.99654984,0.000085274776,0.00006234167,0.00008572315,0.0012387024,0.001978035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025446946,0.0011064769,0.00037580045,0.0014506136,0.0033531634,0.005189824,0.0010155438,0.0028955347,0.061226312],"category_scores_gemma":[0.0043895408,0.0004407787,0.00041538544,0.0007272651,0.0006744473,0.0014987435,0.003596508,0.0042299726,0.030783756],"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.00013516663,0.000095111216,0.0015698838,0.000037548667,0.000008308316,0.00013148437,0.00012078843,0.000108612854,0.00052456645,0.014380013,0.9381061,0.044782314],"study_design_scores_gemma":[0.000029843515,0.0000615147,0.003620699,0.00003452558,0.000002820658,0.00004379828,0.00012731102,0.00014125036,0.00028810318,0.0012280544,0.99440753,0.0000146195525],"about_ca_topic_score_codex":0.019704616,"about_ca_topic_score_gemma":0.048221666,"teacher_disagreement_score":0.061226312,"about_ca_system_score_codex":0.0027153133,"about_ca_system_score_gemma":0.010729032,"threshold_uncertainty_score":0.20482242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1125542,0.0012306622,0.83658385,0.00089325925,0.0002558418,0.00011886793,0.00032489697,0.010367312,0.03767112],"genre_scores_gemma":[0.79149073,0.00038297297,0.19039834,0.0004405426,0.00008115393,0.00010153001,0.00060986716,0.001179902,0.01531504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988663,0.00022375384,0.000052591087,0.00017590768,0.00039147603,0.00028988282],"domain_scores_gemma":[0.99673873,0.001756937,0.00013714778,0.00091431156,0.00029700043,0.00015581498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011512904,0.0011383579,0.0012789347,0.0011471497,0.0009462084,0.0013928933,0.0024418277,0.0013685648,0.010335339],"category_scores_gemma":[0.0063314354,0.00046499938,0.0011887165,0.0011351964,0.0019567301,0.0044337823,0.004025907,0.0028321757,0.0016957216],"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.0015724124,0.00052950927,0.0023593938,0.00070463435,0.00014485685,0.00025135276,0.0005403326,0.33664164,0.027132783,0.26504815,0.014929514,0.3501454],"study_design_scores_gemma":[0.00008788061,0.00020296032,0.00031903022,0.00007280842,0.000085217835,0.00007100891,0.00011314363,0.7565279,0.0073424033,0.23060146,0.0045543103,0.000021863556],"about_ca_topic_score_codex":0.0035740954,"about_ca_topic_score_gemma":0.0055518094,"teacher_disagreement_score":0.010335339,"about_ca_system_score_codex":0.00092607236,"about_ca_system_score_gemma":0.0016144596,"threshold_uncertainty_score":0.034575105},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019806359,0.00054150284,0.7289085,0.00071383204,0.0007408309,0.0005257427,0.0034601276,0.18373819,0.061564993],"genre_scores_gemma":[0.20826758,0.0003071861,0.6794887,0.0008863373,0.00018472492,0.0007927351,0.0064456034,0.01633276,0.08729442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842167,0.00026196527,0.00013251479,0.00025152887,0.0006018893,0.0003305011],"domain_scores_gemma":[0.99801195,0.0005521035,0.000083906554,0.00067417626,0.00056259026,0.000115195166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092472247,0.0019645465,0.0013053244,0.0017880762,0.0013971825,0.0033005914,0.004245881,0.0015852691,0.09662348],"category_scores_gemma":[0.0046817046,0.0014551565,0.0013427027,0.0029074524,0.000882804,0.0039591608,0.002641629,0.0019600387,0.02708145],"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.0014877514,0.00038040004,0.0012036889,0.00048374367,0.00008974112,0.000301903,0.00029714478,0.0058972943,0.017810274,0.07908479,0.1934218,0.6995415],"study_design_scores_gemma":[0.0013947969,0.0006229021,0.0022867424,0.00039388117,0.00037629413,0.00076762243,0.00042214026,0.31021827,0.17765944,0.14381813,0.3616297,0.0004101106],"about_ca_topic_score_codex":0.011819272,"about_ca_topic_score_gemma":0.019735426,"teacher_disagreement_score":0.09662348,"about_ca_system_score_codex":0.0018880122,"about_ca_system_score_gemma":0.0033644424,"threshold_uncertainty_score":0.32323772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24903388,0.0004792069,0.71575314,0.0012804896,0.00032717866,0.0007171362,0.0003791247,0.0005012442,0.03152867],"genre_scores_gemma":[0.8529885,0.0003170593,0.12554188,0.0003830578,0.00007349034,0.0011905236,0.00023808189,0.000071576076,0.019195816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632734,0.0016941082,0.00019915077,0.00055796735,0.00083217636,0.00038911516],"domain_scores_gemma":[0.9853349,0.011077602,0.0010075032,0.0008801195,0.0009224462,0.0007775525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047929464,0.00075861294,0.0015097851,0.00091868883,0.00091432175,0.0020325873,0.0025110214,0.0021766121,0.01214344],"category_scores_gemma":[0.024126913,0.0006333276,0.0006528178,0.0012467175,0.0018291518,0.002628852,0.0014276264,0.0016308118,0.0018354275],"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.0015407314,0.00034196945,0.007247697,0.00031314068,0.0001945044,0.0013482933,0.0007603704,0.4119837,0.0065204706,0.5190016,0.003483873,0.04726365],"study_design_scores_gemma":[0.00021146385,0.0002692432,0.00086691784,0.00004695839,0.00003408225,0.00026822116,0.00010633445,0.779407,0.0010905983,0.21609968,0.0015392454,0.000060271446],"about_ca_topic_score_codex":0.0018110349,"about_ca_topic_score_gemma":0.0028537037,"teacher_disagreement_score":0.01214344,"about_ca_system_score_codex":0.0012265717,"about_ca_system_score_gemma":0.0011934692,"threshold_uncertainty_score":0.040623844},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19076174,0.0007922924,0.26454228,0.0071935356,0.0004003897,0.00025066454,0.0002226656,0.00042327668,0.5354132],"genre_scores_gemma":[0.9243165,0.00027344545,0.015312963,0.00042826452,0.00006358364,0.00013524467,0.00012277486,0.000038136597,0.059308946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00037290313,0.000023824445,0.00008036833,0.00015552626,0.00009956148],"domain_scores_gemma":[0.99771845,0.0014225364,0.00016527192,0.00026044878,0.0002004222,0.00023288037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000666012,0.0005577979,0.0005064568,0.00031484535,0.001000911,0.0016594866,0.0008323784,0.0014703905,0.01120451],"category_scores_gemma":[0.005068744,0.00018299489,0.00034700523,0.00028473587,0.0016952867,0.0019317431,0.0011621192,0.0021407339,0.00082608836],"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.00010593662,0.00007631129,0.00043967983,0.000045926037,0.000024024599,0.00010210917,0.00035711032,0.009144967,0.0010714311,0.97136194,0.0059351316,0.011335292],"study_design_scores_gemma":[0.00007489907,0.00013943447,0.0007063066,0.000032538315,0.000026408066,0.0001694473,0.0003223964,0.10058593,0.0006511559,0.8757008,0.021571297,0.000019478273],"about_ca_topic_score_codex":0.0013741506,"about_ca_topic_score_gemma":0.0016757798,"teacher_disagreement_score":0.01120451,"about_ca_system_score_codex":0.00083069346,"about_ca_system_score_gemma":0.00066890084,"threshold_uncertainty_score":0.037482798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0393364,0.00050273596,0.9489499,0.00045824426,0.00006829633,0.000114752635,0.00007647236,0.0011653712,0.009327856],"genre_scores_gemma":[0.41121036,0.00040004717,0.5813571,0.00025744695,0.000024498451,0.00043974,0.00017888451,0.00039603026,0.005735881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940467,0.00020426715,0.00004431558,0.00012531946,0.00014824473,0.000073183284],"domain_scores_gemma":[0.99897826,0.00066867325,0.00008086608,0.00009089468,0.000115366536,0.00006598472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012637061,0.0010535552,0.00070924003,0.0007160334,0.00060805824,0.0014121722,0.00092653435,0.0011314928,0.0058222776],"category_scores_gemma":[0.006119442,0.00050804537,0.00080910645,0.00047373888,0.0015646546,0.0015970911,0.0015533905,0.0015355905,0.0009438643],"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.00023004119,0.0001383472,0.0021793346,0.00040679603,0.0000854595,0.0002296235,0.00049113965,0.6393704,0.008331365,0.1628347,0.003162985,0.18253988],"study_design_scores_gemma":[0.000046188277,0.00010488524,0.00010012974,0.000060103714,0.000022639973,0.00006100156,0.00008442584,0.9318534,0.0023990984,0.059642572,0.005610514,0.000015042704],"about_ca_topic_score_codex":0.0020854988,"about_ca_topic_score_gemma":0.0027134612,"teacher_disagreement_score":0.0058222776,"about_ca_system_score_codex":0.0008648253,"about_ca_system_score_gemma":0.0012233742,"threshold_uncertainty_score":0.019477427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016638147,0.0018424488,0.9687895,0.00020411803,0.00014742212,0.00015295843,0.0005279036,0.005696145,0.00600136],"genre_scores_gemma":[0.20374183,0.0022325546,0.7760848,0.0003310669,0.00016764547,0.00028672774,0.0044683227,0.00075638754,0.0119306855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999534,0.000083531864,0.000057745394,0.00016512799,0.00011343194,0.000046137622],"domain_scores_gemma":[0.9985821,0.0008718509,0.00007498373,0.00021005374,0.00023584453,0.000025177173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078452274,0.0013613072,0.0012501767,0.0015351322,0.00036727817,0.0017546294,0.0016110413,0.0012778164,0.0037832987],"category_scores_gemma":[0.003649968,0.0008185351,0.0014242899,0.0016078057,0.0004878127,0.0017058841,0.00090989395,0.001975633,0.0027783278],"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.000073574425,0.00007227877,0.00094618683,0.00020061112,0.00010982314,0.00019934365,0.00008110951,0.061952185,0.007895164,0.004402213,0.0054888823,0.91857874],"study_design_scores_gemma":[0.000018794566,0.00003820772,0.0010328578,0.00011854948,0.00010660263,0.00016393389,0.000056447752,0.95249474,0.008553869,0.029682154,0.007713775,0.000019952922],"about_ca_topic_score_codex":0.0046655675,"about_ca_topic_score_gemma":0.005785033,"teacher_disagreement_score":0.0046655675,"about_ca_system_score_codex":0.00042844078,"about_ca_system_score_gemma":0.00062458485,"threshold_uncertainty_score":0.012656331},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053667367,0.00031501774,0.9331062,0.001178316,0.000064080385,0.00019461941,0.00008691037,0.0019785725,0.009408937],"genre_scores_gemma":[0.51203936,0.00018459969,0.4798546,0.00077625486,0.000037679834,0.00040123845,0.00018041409,0.0005434003,0.0059824395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985814,0.0007036944,0.000058397567,0.00029733565,0.00022933999,0.00012975777],"domain_scores_gemma":[0.99576914,0.0029814425,0.00027774202,0.0003690026,0.0003807674,0.00022184932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031146945,0.001149005,0.00094243954,0.0006997485,0.0006487373,0.0014300308,0.0017719108,0.0014906874,0.006233958],"category_scores_gemma":[0.017122611,0.0005396072,0.0005140912,0.00031802017,0.0015452266,0.0030054885,0.0015160165,0.0018688339,0.0020283426],"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.00062926323,0.00049637316,0.009850748,0.00041282419,0.00013146899,0.00027130014,0.0014633223,0.35766473,0.0093491245,0.14147161,0.009228992,0.46903014],"study_design_scores_gemma":[0.000120270226,0.00018728478,0.00020317205,0.00007444532,0.000025380466,0.00008641979,0.00018233097,0.9286429,0.0036733719,0.062007442,0.004768237,0.000028693592],"about_ca_topic_score_codex":0.0016621486,"about_ca_topic_score_gemma":0.0026483347,"teacher_disagreement_score":0.006233958,"about_ca_system_score_codex":0.0008184957,"about_ca_system_score_gemma":0.0016766925,"threshold_uncertainty_score":0.020854652},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97374976,0.00006749342,0.022082157,0.000044397362,0.000015242801,0.00034713605,0.00007517259,0.00023249736,0.0033861236],"genre_scores_gemma":[0.97556007,0.00004884398,0.02296311,0.000027632981,0.0000061661453,0.00021189537,0.00017759937,0.000028261718,0.0009763761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971179,0.0010720383,0.00025560605,0.00040160547,0.0009845262,0.00016836578],"domain_scores_gemma":[0.9909861,0.0041166185,0.0013911149,0.00050059624,0.002188343,0.0008172017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002777996,0.0008876235,0.0004988674,0.0019922631,0.00042366155,0.0017961875,0.000834788,0.00069643307,0.0013929862],"category_scores_gemma":[0.017422866,0.0003371048,0.00028621047,0.00051859923,0.00047552874,0.0016980255,0.00125352,0.000453445,0.00044557464],"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.003960103,0.005296906,0.3720885,0.0007598521,0.00062750635,0.0005662186,0.007313018,0.045337163,0.13352333,0.00468471,0.0023761,0.42346653],"study_design_scores_gemma":[0.00054349436,0.014931307,0.4375321,0.00022929665,0.00041290323,0.00077077205,0.0052203326,0.45771557,0.065438494,0.0071576457,0.009775918,0.0002721942],"about_ca_topic_score_codex":0.0030778283,"about_ca_topic_score_gemma":0.0033499857,"teacher_disagreement_score":0.0030778283,"about_ca_system_score_codex":0.0006786841,"about_ca_system_score_gemma":0.0004396151,"threshold_uncertainty_score":0.014691591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013722418,0.0002607663,0.9655757,0.00071449595,0.00015057737,0.00020970133,0.00026371263,0.00958874,0.00951397],"genre_scores_gemma":[0.23016037,0.0003159033,0.75854486,0.0005073682,0.00005730969,0.000500023,0.0007651494,0.00068425195,0.008464725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951744,0.00015765906,0.000025516398,0.00014411673,0.00011137953,0.000043921187],"domain_scores_gemma":[0.9989643,0.0005839685,0.00010393757,0.00017246862,0.000098033765,0.000077339784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147793,0.0013598729,0.0005836608,0.00045451775,0.00035976837,0.0010204153,0.0021231964,0.0013096269,0.007090279],"category_scores_gemma":[0.004164136,0.00064359943,0.00081347825,0.00024507163,0.0010516088,0.0017596261,0.001364844,0.0023832538,0.0018929527],"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.00042511703,0.00040418113,0.003077534,0.00040830718,0.00020223102,0.00022530033,0.00036834786,0.5148565,0.007558876,0.063662015,0.027245725,0.38156578],"study_design_scores_gemma":[0.000087380125,0.00008985252,0.00015648079,0.000031160238,0.000021434405,0.000046744906,0.000025148347,0.9641645,0.0024581817,0.026269129,0.0066343257,0.000015754702],"about_ca_topic_score_codex":0.0048462697,"about_ca_topic_score_gemma":0.006388778,"teacher_disagreement_score":0.007090279,"about_ca_system_score_codex":0.0006878459,"about_ca_system_score_gemma":0.0016433009,"threshold_uncertainty_score":0.02371931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08643745,0.00025600017,0.88245654,0.0009798527,0.00014498716,0.00022167947,0.0004658741,0.0077947984,0.021242814],"genre_scores_gemma":[0.70294964,0.00020417012,0.2878901,0.00037306512,0.000027925795,0.000119722936,0.00066085864,0.0017730279,0.0060015377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980757,0.0007731084,0.00010094872,0.00037293867,0.0005338461,0.0001434542],"domain_scores_gemma":[0.99238914,0.0042471504,0.00036023482,0.0018912017,0.0008090895,0.00030322967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021062244,0.0008492501,0.00044197403,0.00052374025,0.00073661486,0.002674902,0.0013493327,0.0010565103,0.005702078],"category_scores_gemma":[0.022094542,0.0005490878,0.00082792336,0.00030920884,0.003126508,0.0064304536,0.002014437,0.0014917111,0.0024899265],"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.00080001,0.0002145293,0.012041414,0.0010801185,0.00008281129,0.0016311831,0.0054572616,0.096446194,0.036345053,0.532323,0.016622853,0.2969556],"study_design_scores_gemma":[0.00008059593,0.00037594803,0.0011450879,0.00016775605,0.000070750124,0.0012174423,0.0015598908,0.5308075,0.053511217,0.35064647,0.060326718,0.00009063684],"about_ca_topic_score_codex":0.0021166762,"about_ca_topic_score_gemma":0.0031420682,"teacher_disagreement_score":0.005702078,"about_ca_system_score_codex":0.0006384097,"about_ca_system_score_gemma":0.0009958053,"threshold_uncertainty_score":0.019075334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44715166,0.0014610756,0.45514396,0.0006216844,0.00052016083,0.001521137,0.021016674,0.048661005,0.02390259],"genre_scores_gemma":[0.7006698,0.0003679378,0.24183683,0.00038561356,0.00010312594,0.0005830904,0.041247986,0.0012433508,0.0135622425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999408,0.0001761979,0.000041809817,0.00024537658,0.00009524518,0.000033415938],"domain_scores_gemma":[0.99884206,0.00051842147,0.00008932018,0.00026955514,0.00020485779,0.000075911244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005866446,0.0014251175,0.00042100082,0.00076706504,0.00028297433,0.0009343628,0.0011581342,0.0006252814,0.0030281432],"category_scores_gemma":[0.0039503383,0.000319168,0.0008764351,0.00054472836,0.00031431208,0.0011011945,0.00064671005,0.00078899827,0.00288486],"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.0012239196,0.0009767062,0.019877471,0.00096265663,0.00023603202,0.0012420617,0.00080602133,0.110010736,0.04291848,0.0057219337,0.059385106,0.7566388],"study_design_scores_gemma":[0.00012398823,0.00033175116,0.0049291886,0.000058881116,0.00006466702,0.0005465663,0.00023680915,0.91356266,0.04827089,0.007858239,0.023951791,0.00006456553],"about_ca_topic_score_codex":0.002807123,"about_ca_topic_score_gemma":0.007130082,"teacher_disagreement_score":0.0030281432,"about_ca_system_score_codex":0.00056093367,"about_ca_system_score_gemma":0.000482312,"threshold_uncertainty_score":0.010130167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053293858,0.00031622153,0.93376744,0.0010974619,0.000060490234,0.00019609269,0.000080282945,0.0019974574,0.009190715],"genre_scores_gemma":[0.49946228,0.0001823259,0.49277157,0.000724759,0.000034388577,0.00039456165,0.00016814165,0.0005069844,0.005754998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987274,0.0006110663,0.000053700827,0.00027374562,0.00021417676,0.00011985983],"domain_scores_gemma":[0.99626225,0.002574347,0.00026006417,0.00032711192,0.00036967383,0.00020644152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029173156,0.001132591,0.00090644177,0.0006859815,0.0006223776,0.0013646758,0.0017167036,0.0014458515,0.0060661496],"category_scores_gemma":[0.015944421,0.0005262932,0.00048295007,0.00030520983,0.0014576669,0.0028962395,0.0014431071,0.0017378408,0.0019653863],"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.0005750977,0.00046833407,0.009880652,0.00039665654,0.000124171,0.00027482546,0.0014016062,0.3540959,0.009567294,0.12943296,0.008560869,0.48522165],"study_design_scores_gemma":[0.000116452786,0.00018329175,0.00020558872,0.00007376623,0.000025210706,0.000088336135,0.0001802889,0.9367085,0.0037533708,0.053903755,0.004733289,0.00002812503],"about_ca_topic_score_codex":0.0017454015,"about_ca_topic_score_gemma":0.0027922317,"teacher_disagreement_score":0.0060661496,"about_ca_system_score_codex":0.00078213523,"about_ca_system_score_gemma":0.001667099,"threshold_uncertainty_score":0.020293295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07593065,0.00014776543,0.88040537,0.0010660298,0.00008958034,0.00056929677,0.00056727044,0.0005166357,0.040707402],"genre_scores_gemma":[0.7237177,0.00020781426,0.26472756,0.00025434874,0.000019488254,0.0006582297,0.00034128045,0.00011810968,0.009955603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980008,0.001198449,0.00009143324,0.00022743856,0.00027679838,0.0002049214],"domain_scores_gemma":[0.9983889,0.0011438939,0.00010882832,0.00010016809,0.00016043767,0.000097863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015482827,0.0010660574,0.0010437499,0.0008242163,0.0009199353,0.0022794725,0.0018433199,0.0019359473,0.009723731],"category_scores_gemma":[0.006329126,0.0005220994,0.0012741941,0.00061736215,0.0018889641,0.0030718865,0.001198024,0.0018234522,0.0010969015],"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.00017076469,0.0001290377,0.0015221091,0.00014423515,0.0000664712,0.00013106749,0.00031705888,0.6071651,0.0016961078,0.36973774,0.0031084963,0.015811816],"study_design_scores_gemma":[0.00006328615,0.000080050406,0.00019108811,0.000026563437,0.000017099004,0.00004298189,0.000085830616,0.872578,0.00057220005,0.12405725,0.0022617446,0.000023942379],"about_ca_topic_score_codex":0.010184236,"about_ca_topic_score_gemma":0.008651,"teacher_disagreement_score":0.010184236,"about_ca_system_score_codex":0.002724327,"about_ca_system_score_gemma":0.0023036979,"threshold_uncertainty_score":0.032529116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02861152,0.00027611808,0.92594165,0.00022842974,0.000112619324,0.00036180043,0.00044209533,0.037364405,0.0066614305],"genre_scores_gemma":[0.33911014,0.00014193682,0.6539168,0.00024757456,0.00003448285,0.00053360563,0.0005619468,0.0020356695,0.0034178044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848324,0.0006191512,0.00009890117,0.00030402004,0.0003920229,0.00010259086],"domain_scores_gemma":[0.99407935,0.004503491,0.0003253485,0.00056969683,0.00036107848,0.00016113168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040553682,0.0010409981,0.00082413334,0.00092862995,0.00031622188,0.0014099482,0.0028097522,0.0016481417,0.009339888],"category_scores_gemma":[0.0148994755,0.0006957766,0.00052064133,0.00039016956,0.0010637084,0.0015234222,0.001721726,0.002014043,0.0019410085],"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.0010834513,0.0007382262,0.006246232,0.0009899666,0.00019525515,0.0002955112,0.00037715014,0.5533003,0.0121837435,0.05426043,0.01751126,0.3528185],"study_design_scores_gemma":[0.000065227665,0.00006331784,0.00017950281,0.00001758075,0.00000967642,0.000034084103,0.000007557192,0.98624045,0.00439421,0.00695644,0.0020217288,0.000010286213],"about_ca_topic_score_codex":0.0018746145,"about_ca_topic_score_gemma":0.0031314327,"teacher_disagreement_score":0.009339888,"about_ca_system_score_codex":0.0008610812,"about_ca_system_score_gemma":0.0014834886,"threshold_uncertainty_score":0.031245053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005023146,0.000048339196,0.9923746,0.0000698423,0.000011734152,0.000069861824,0.00008806399,0.00075404585,0.0015603682],"genre_scores_gemma":[0.14920792,0.000081235165,0.8455239,0.00011247355,0.0000228263,0.00025105663,0.0008124873,0.00060914876,0.0033790113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985145,0.00038593845,0.00007423655,0.0003059906,0.000589208,0.00013011499],"domain_scores_gemma":[0.9969849,0.0015341245,0.00018450394,0.000732939,0.00043319556,0.00013032966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013237131,0.00090599625,0.0007387034,0.0015636814,0.00061768846,0.001408892,0.0024350723,0.0012241101,0.0054660416],"category_scores_gemma":[0.0062263706,0.0006627151,0.0012278476,0.0010991902,0.0012922364,0.0023325635,0.0026192002,0.0018327623,0.001632499],"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.0002699999,0.00028290728,0.002987867,0.00031162106,0.000082956416,0.00036479498,0.0012162208,0.30296758,0.029109865,0.12204113,0.009568353,0.53079665],"study_design_scores_gemma":[0.000030273066,0.00007710882,0.0003048117,0.000024414312,0.00002218262,0.000119194214,0.000098903816,0.9361366,0.0060283374,0.049831044,0.0073081004,0.000019038382],"about_ca_topic_score_codex":0.002458621,"about_ca_topic_score_gemma":0.0045368467,"teacher_disagreement_score":0.0054660416,"about_ca_system_score_codex":0.001015674,"about_ca_system_score_gemma":0.0010594331,"threshold_uncertainty_score":0.018285751},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30781576,0.0003114836,0.68072414,0.00069599226,0.00006435028,0.00008311811,0.000063016625,0.00071216264,0.009529925],"genre_scores_gemma":[0.9701046,0.000051643656,0.026963085,0.00011479225,0.000007825162,0.00003847843,0.000030361709,0.000021865673,0.0026673076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999686,0.0001263543,0.000012196111,0.00006309402,0.000044841854,0.00006755277],"domain_scores_gemma":[0.9992042,0.00048395942,0.00008529098,0.000057892506,0.00007223449,0.000096536794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578204,0.00059823674,0.000583678,0.00026679997,0.00030495616,0.0008031027,0.00095709006,0.0007059981,0.0015729159],"category_scores_gemma":[0.0027415075,0.00035555114,0.0003077554,0.0001839257,0.0014122032,0.0011086013,0.0009618688,0.0012444764,0.00015954382],"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.000102460304,0.00007846111,0.0014462661,0.000032592154,0.000039178045,0.000058838963,0.000091221824,0.95296276,0.0012481227,0.018734833,0.00047370454,0.024731575],"study_design_scores_gemma":[0.00000682408,0.000019482124,0.000066986,0.0000030985857,0.0000026017517,0.00000490163,0.0000065276117,0.9935928,0.00021248676,0.005943575,0.0001380954,0.000002606115],"about_ca_topic_score_codex":0.0065590865,"about_ca_topic_score_gemma":0.0075457194,"teacher_disagreement_score":0.0065590865,"about_ca_system_score_codex":0.0012513573,"about_ca_system_score_gemma":0.0010145527,"threshold_uncertainty_score":0.013041794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048084,0.00004666992,0.9926851,0.000067896304,0.000011061602,0.00006672572,0.00008125597,0.00079852645,0.0014343597],"genre_scores_gemma":[0.13723038,0.00007882158,0.85789305,0.00011055734,0.000022260994,0.00022816744,0.0007804372,0.00058141985,0.0030749363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986066,0.00034296094,0.0000696677,0.00028709127,0.0005694542,0.00012424646],"domain_scores_gemma":[0.99730396,0.001336713,0.00016410911,0.00065426895,0.00042689353,0.000114037386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012700375,0.00086207694,0.0007261086,0.0015715925,0.00062874507,0.0013647836,0.0024387955,0.0011749751,0.0051307],"category_scores_gemma":[0.0055216295,0.0006620258,0.0012287742,0.0011136571,0.001194866,0.0022838514,0.0024560087,0.0017281339,0.0015062733],"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.00026345075,0.00026960982,0.0029072287,0.00028313595,0.00007903259,0.00034719662,0.0011989671,0.28494835,0.031559892,0.09846014,0.009309934,0.5703732],"study_design_scores_gemma":[0.000029637333,0.00007662183,0.00031560802,0.000021168731,0.000022440452,0.00012602877,0.00009775681,0.94821125,0.0065364665,0.037158668,0.0073846756,0.000019594929],"about_ca_topic_score_codex":0.0027360572,"about_ca_topic_score_gemma":0.00493138,"teacher_disagreement_score":0.0051307,"about_ca_system_score_codex":0.0010017735,"about_ca_system_score_gemma":0.0010562022,"threshold_uncertainty_score":0.017163932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7401671,0.00069529266,0.23812515,0.00025368578,0.00009568831,0.00029306012,0.0021377178,0.0006312035,0.01760125],"genre_scores_gemma":[0.97061163,0.00015946051,0.02617997,0.000032486805,0.000039145885,0.000119707605,0.0015155944,0.000074100535,0.0012678859],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969394,0.0006895504,0.00032077933,0.00043435165,0.001416756,0.00019920319],"domain_scores_gemma":[0.97922426,0.014069502,0.00291445,0.0017088488,0.001218553,0.0008643155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024299256,0.0010171792,0.0008211084,0.0053908513,0.0003892712,0.0017948245,0.0007657632,0.000905862,0.0035945298],"category_scores_gemma":[0.029994704,0.00036862039,0.00076860713,0.0022396413,0.0015562049,0.0030930159,0.00210926,0.0010367794,0.0005139401],"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.0016137847,0.0010276308,0.37352574,0.0012908918,0.001071789,0.0007725027,0.003050457,0.2023591,0.059618667,0.06628767,0.0065202834,0.28286153],"study_design_scores_gemma":[0.000113850685,0.0014370783,0.40098912,0.00016568352,0.00020940325,0.00086967787,0.0011517003,0.47769544,0.020948905,0.08990231,0.006196381,0.00032053475],"about_ca_topic_score_codex":0.0009222469,"about_ca_topic_score_gemma":0.0010955929,"teacher_disagreement_score":0.0053908513,"about_ca_system_score_codex":0.0007059634,"about_ca_system_score_gemma":0.00034858534,"threshold_uncertainty_score":0.012850881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9986388,0.000012104997,0.00080223166,0.000007820145,0.0000011251094,0.000014754664,0.00001441987,0.00001676385,0.0004919713],"genre_scores_gemma":[0.9986155,0.000016182305,0.00096122205,0.000007460508,0.0000015574374,0.000020724126,0.000027035981,0.000009647261,0.00034061648],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99900657,0.0004673788,0.000050490245,0.0001670411,0.00019415433,0.00011438404],"domain_scores_gemma":[0.990342,0.0076715886,0.0007963348,0.00023040656,0.00042943066,0.00053023815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015919063,0.0004437763,0.0002900754,0.00040832078,0.0002965098,0.00146511,0.0003703107,0.00032201534,0.0015530606],"category_scores_gemma":[0.0129395705,0.0002631703,0.00023510825,0.000115541596,0.0005075916,0.00077133917,0.00095860136,0.00044204883,0.00018468927],"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.0041293167,0.0021928723,0.45958972,0.0010409231,0.00033478372,0.0015959245,0.12768927,0.0044024205,0.31359974,0.00083551387,0.00051055,0.08407896],"study_design_scores_gemma":[0.00007103704,0.0048585883,0.91774523,0.00008188713,0.00021030405,0.00059739855,0.027564196,0.01649439,0.029715043,0.00047524052,0.0020443923,0.00014227415],"about_ca_topic_score_codex":0.0015122425,"about_ca_topic_score_gemma":0.0022329076,"teacher_disagreement_score":0.0015919063,"about_ca_system_score_codex":0.00027557192,"about_ca_system_score_gemma":0.00017661307,"threshold_uncertainty_score":0.008418918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07955612,0.0001623708,0.9121182,0.00038004247,0.00004270325,0.00009018303,0.000043942313,0.0008922128,0.0067142067],"genre_scores_gemma":[0.8916488,0.00008091924,0.10402036,0.000111762296,0.000013628074,0.000112851965,0.00005823477,0.000064941305,0.0038886287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996716,0.000108472734,0.000014187998,0.000090218084,0.000053940155,0.00006155743],"domain_scores_gemma":[0.99870646,0.00080569455,0.0001652073,0.000098861026,0.00011448018,0.000109193374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386047,0.0008602959,0.0007906552,0.00046991985,0.0005215836,0.00078608526,0.0013003931,0.0010191251,0.0023889998],"category_scores_gemma":[0.0026414015,0.0005767978,0.0005571019,0.00025860782,0.0014153207,0.0010341298,0.0016829411,0.0013774781,0.00041627896],"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.000045765843,0.000022890921,0.00021219406,0.0000152448465,0.000011468028,0.000048951744,0.00004456278,0.98670954,0.0006572638,0.0056894138,0.00019996315,0.006342776],"study_design_scores_gemma":[0.0000057399316,0.000016149872,0.000017030228,0.0000018532392,0.0000020052364,0.0000048309907,0.000005595674,0.99825114,0.00012944904,0.0014449384,0.00011913298,0.0000020885727],"about_ca_topic_score_codex":0.008365567,"about_ca_topic_score_gemma":0.008455795,"teacher_disagreement_score":0.008365567,"about_ca_system_score_codex":0.0009039548,"about_ca_system_score_gemma":0.0017987953,"threshold_uncertainty_score":0.016633749},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0394063,0.00028605637,0.90682155,0.00021635584,0.00011265261,0.00048469842,0.00051007007,0.04500706,0.0071553397],"genre_scores_gemma":[0.36377022,0.00012682239,0.6296507,0.00023119863,0.000026788108,0.0005829648,0.0005638704,0.0017447472,0.0033026887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861217,0.00055427325,0.000091478076,0.00027500186,0.0003634469,0.00010372381],"domain_scores_gemma":[0.994293,0.0043485127,0.00031328475,0.0004993664,0.00039029712,0.0001555305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040651946,0.0010694187,0.00082748994,0.000986825,0.0003180447,0.0013529886,0.0028499665,0.0015470696,0.009095776],"category_scores_gemma":[0.014061472,0.0007083133,0.00049533806,0.0003754323,0.00094538805,0.001470756,0.0015140646,0.0018610194,0.0018026317],"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.0012037071,0.00078735745,0.00680699,0.0009583547,0.00019498439,0.00028850825,0.00036778397,0.54468185,0.012986444,0.0352772,0.015766291,0.3806805],"study_design_scores_gemma":[0.00006147015,0.00007047332,0.00018457627,0.000015401107,0.000009482195,0.000029866644,0.000007808445,0.9897029,0.0045718215,0.003715325,0.0016204359,0.0000104247865],"about_ca_topic_score_codex":0.0024876406,"about_ca_topic_score_gemma":0.0040607336,"teacher_disagreement_score":0.009095776,"about_ca_system_score_codex":0.0009321203,"about_ca_system_score_gemma":0.0015998784,"threshold_uncertainty_score":0.03042847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02345207,0.089257084,0.37658808,0.14448783,0.0029398699,0.00014019791,0.00010278122,0.00046842446,0.3625637],"genre_scores_gemma":[0.830666,0.036028203,0.10345162,0.0111888,0.0023599498,0.00035914395,0.00009032594,0.00038575675,0.015470193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898968,0.0072291307,0.00031516262,0.0008045654,0.0013896693,0.00036476098],"domain_scores_gemma":[0.9697468,0.024743518,0.0006945974,0.0023403927,0.0013928858,0.0010818404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012552052,0.0007567317,0.0011009203,0.0026124525,0.0032474126,0.010295227,0.0024620276,0.0034427864,0.0048809336],"category_scores_gemma":[0.023247208,0.0007233439,0.0008316308,0.0020282306,0.031825162,0.015255611,0.004316362,0.009198308,0.001092726],"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.000003891922,0.000008102347,0.000082853694,0.00004305934,0.0000038029914,0.00001059102,0.0005964508,0.0005271519,0.000025416619,0.9938805,0.00072920957,0.004088972],"study_design_scores_gemma":[0.0000061941055,0.0000116585925,0.00007331545,0.00012007181,0.0000035382627,0.000027309456,0.00037698605,0.002722897,0.00008621684,0.9724743,0.024086205,0.000011234993],"about_ca_topic_score_codex":0.004543387,"about_ca_topic_score_gemma":0.0034523504,"teacher_disagreement_score":0.012552052,"about_ca_system_score_codex":0.005645328,"about_ca_system_score_gemma":0.003122654,"threshold_uncertainty_score":0.06638241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043767758,0.0042354297,0.8752887,0.0073382305,0.0007093226,0.00015384825,0.00079382234,0.0052685793,0.06244428],"genre_scores_gemma":[0.16597728,0.0013667735,0.7912766,0.0012848077,0.0002473648,0.0001366752,0.0010687949,0.0014457491,0.037195895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952173,0.00011929826,0.000031239397,0.00018015201,0.000100252386,0.00004744081],"domain_scores_gemma":[0.9988952,0.00072182727,0.000043599804,0.00017493326,0.0000874952,0.0000769394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009536967,0.0012484607,0.0012030756,0.0010184359,0.0013321679,0.0026631157,0.0030660422,0.0021383893,0.031520523],"category_scores_gemma":[0.0056552114,0.00088646053,0.0012335341,0.0017428899,0.0020827616,0.00802738,0.0022912975,0.0026539112,0.0054876423],"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.00047453176,0.00021869499,0.0021569193,0.00050963165,0.00021529067,0.00021213693,0.0009505994,0.02851329,0.0038157182,0.14531173,0.10472555,0.71289593],"study_design_scores_gemma":[0.00021713783,0.00027475823,0.0008915081,0.0002122654,0.00017878535,0.0006422774,0.0010315528,0.29644412,0.004836822,0.61757064,0.077605255,0.000094895244],"about_ca_topic_score_codex":0.002828628,"about_ca_topic_score_gemma":0.0055115656,"teacher_disagreement_score":0.031520523,"about_ca_system_score_codex":0.0007690456,"about_ca_system_score_gemma":0.0011858993,"threshold_uncertainty_score":0.10544664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06013033,0.0012672002,0.7865361,0.037941825,0.003203509,0.0003502264,0.00080198504,0.0040717563,0.10569707],"genre_scores_gemma":[0.7647734,0.0013507163,0.19386281,0.00660847,0.0012125411,0.00070848817,0.0007365004,0.0008600935,0.029886948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602604,0.0011076668,0.00018504863,0.00086135784,0.001304374,0.0005155591],"domain_scores_gemma":[0.97869074,0.0146935675,0.00060243934,0.003635226,0.0018726081,0.00050533254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038819811,0.0010261061,0.001324806,0.000903133,0.0020127592,0.0025599198,0.002951796,0.0023648401,0.020451836],"category_scores_gemma":[0.034381233,0.0010297681,0.0029728017,0.0009813341,0.005954893,0.007459221,0.0061058267,0.007971763,0.0031646953],"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.00009779405,0.0000976537,0.00047226908,0.0002265075,0.000051551637,0.00027009222,0.0005028997,0.009001134,0.0019599253,0.95414954,0.018692793,0.014477807],"study_design_scores_gemma":[0.000120284276,0.00007004467,0.00027782074,0.00010314376,0.00005532504,0.00016904874,0.0001032146,0.04863548,0.00320811,0.93029916,0.016905874,0.000052495514],"about_ca_topic_score_codex":0.0029483163,"about_ca_topic_score_gemma":0.0027662236,"teacher_disagreement_score":0.020451836,"about_ca_system_score_codex":0.0020295156,"about_ca_system_score_gemma":0.0030104376,"threshold_uncertainty_score":0.068418205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04413112,0.0005792379,0.8612684,0.0021950477,0.00008870778,0.00027232064,0.0002607048,0.000980185,0.0902243],"genre_scores_gemma":[0.6667603,0.00057431223,0.3175403,0.0002641762,0.000039801238,0.00034504858,0.00045364126,0.0001709607,0.013851425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988217,0.00076277484,0.000049434122,0.00015640394,0.00015872686,0.000050963896],"domain_scores_gemma":[0.9983,0.0010093863,0.0001573564,0.00027414042,0.00014343418,0.00011578714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011105821,0.00073983375,0.00022938378,0.00046619165,0.0009171557,0.0028746293,0.0011931913,0.0012089447,0.007341311],"category_scores_gemma":[0.0040609185,0.00036515217,0.00065403647,0.0003890831,0.0045879516,0.004421267,0.0018760953,0.0013247789,0.0007996579],"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.00007819334,0.000046750993,0.0006032338,0.0002071618,0.000022662542,0.00029873374,0.007777523,0.021882921,0.004247169,0.93010235,0.0029914419,0.03174181],"study_design_scores_gemma":[0.00006539671,0.0001654853,0.00088646053,0.00016863177,0.000041386123,0.0006631164,0.0026932135,0.122826196,0.0051527605,0.73436195,0.13290232,0.00007304336],"about_ca_topic_score_codex":0.0017644472,"about_ca_topic_score_gemma":0.0017073441,"teacher_disagreement_score":0.007341311,"about_ca_system_score_codex":0.001121997,"about_ca_system_score_gemma":0.00059044163,"threshold_uncertainty_score":0.0245592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006736045,0.00009190247,0.9863723,0.00032875684,0.000053605618,0.00017696124,0.00006217086,0.0009898762,0.0051884037],"genre_scores_gemma":[0.12863065,0.00014348565,0.8647894,0.00031363516,0.000076302684,0.0005200529,0.0002445925,0.00039056558,0.0048912605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998409,0.0005545676,0.000103797494,0.00030115855,0.0004452113,0.00018627277],"domain_scores_gemma":[0.99739134,0.001517981,0.00016036224,0.00043660126,0.00029096648,0.00020269696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628958,0.0013990593,0.0013790354,0.0010518563,0.0011025098,0.002525379,0.0035421802,0.0021759474,0.004697057],"category_scores_gemma":[0.011299313,0.0006510737,0.0014786855,0.0007635116,0.0024357894,0.0041407524,0.0046857325,0.0031607375,0.0014061976],"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.00018652211,0.0002421864,0.0017625218,0.00016624953,0.0001022126,0.00009204324,0.0003842787,0.22243287,0.0014173428,0.593035,0.013475116,0.16670366],"study_design_scores_gemma":[0.00005849193,0.00007415739,0.00006994995,0.000032640688,0.000019282394,0.000047361296,0.000037968253,0.8018518,0.0007275708,0.1914076,0.005656552,0.000016712429],"about_ca_topic_score_codex":0.0033335371,"about_ca_topic_score_gemma":0.0055746282,"teacher_disagreement_score":0.004697057,"about_ca_system_score_codex":0.0019815397,"about_ca_system_score_gemma":0.0035694642,"threshold_uncertainty_score":0.015713215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.415913,0.00089592906,0.57675904,0.001061693,0.000108429806,0.00016158796,0.000136503,0.00090148713,0.0040624184],"genre_scores_gemma":[0.92363334,0.00016772978,0.07316375,0.00024222267,0.000043293032,0.000056871053,0.00017241493,0.00003660515,0.0024838538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999159,0.00030518355,0.000059004644,0.00022360861,0.00016116635,0.000092104776],"domain_scores_gemma":[0.996985,0.0018181637,0.0002319136,0.00022546989,0.0006069554,0.00013256235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028804303,0.00090036565,0.00095620006,0.0010605312,0.00048585556,0.0012011004,0.0012510874,0.0011937415,0.0011707564],"category_scores_gemma":[0.007948985,0.0005466616,0.00047411566,0.0005803898,0.0012796614,0.0021031587,0.0011639467,0.0021929804,0.00017942683],"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.00017530518,0.00016952977,0.002024506,0.000038065253,0.00007890275,0.00005957472,0.000090099806,0.9029784,0.001596458,0.00496613,0.00048485523,0.08733823],"study_design_scores_gemma":[0.00000507903,0.000027742508,0.00021714282,0.0000028719599,0.0000057008215,0.00000506323,0.000005983938,0.9967451,0.0004059123,0.0024799895,0.00009361713,0.0000057294137],"about_ca_topic_score_codex":0.017216109,"about_ca_topic_score_gemma":0.018990828,"teacher_disagreement_score":0.017216109,"about_ca_system_score_codex":0.0014732048,"about_ca_system_score_gemma":0.0010800847,"threshold_uncertainty_score":0.03423184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13886829,0.0006623625,0.82644063,0.0003286524,0.00020898288,0.001014802,0.0008774493,0.01295238,0.018646458],"genre_scores_gemma":[0.34879023,0.00022433227,0.64317197,0.00022882414,0.000027959128,0.0010593918,0.0016602655,0.0011100922,0.0037269043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987387,0.0004057196,0.000107168424,0.00035226624,0.00025176522,0.00014439375],"domain_scores_gemma":[0.99633175,0.0022556384,0.00021133616,0.0005752596,0.0004907672,0.00013529306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015133201,0.0018459116,0.0011310768,0.001328052,0.00047173162,0.0019616997,0.002410488,0.0013282266,0.008078799],"category_scores_gemma":[0.009565121,0.0006979832,0.0010495451,0.0011273839,0.0006433774,0.0015500432,0.001672654,0.0014064099,0.0021355017],"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.0007864034,0.0010704444,0.0052247485,0.0010359377,0.00025604956,0.00036342457,0.00056410144,0.36241335,0.019721014,0.016857084,0.010762932,0.5809445],"study_design_scores_gemma":[0.00019658003,0.00039447966,0.0006377654,0.00005611214,0.00009270785,0.00011872122,0.00021150506,0.9686808,0.009163988,0.01231817,0.008095668,0.000033668875],"about_ca_topic_score_codex":0.0034362485,"about_ca_topic_score_gemma":0.0057264855,"teacher_disagreement_score":0.008078799,"about_ca_system_score_codex":0.0011453463,"about_ca_system_score_gemma":0.0023516528,"threshold_uncertainty_score":0.027026236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028030328,0.000057021247,0.9663099,0.00011996137,0.0000618016,0.00029289428,0.0012020908,0.022481725,0.006671557],"genre_scores_gemma":[0.073703945,0.00011994456,0.90235066,0.00019298689,0.000026392458,0.0007628733,0.0043641357,0.010182005,0.0082970895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988669,0.00022872814,0.000082789935,0.00020839226,0.0005109281,0.000102244485],"domain_scores_gemma":[0.99744797,0.0014531061,0.00011064921,0.00046926033,0.00041366465,0.000105272935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381203,0.0015999632,0.00058901875,0.0012041775,0.0006166038,0.0019045868,0.0029635176,0.0016176808,0.04291039],"category_scores_gemma":[0.008826209,0.000975825,0.0013703698,0.0007039775,0.0010262785,0.0019147444,0.0034381463,0.0017959166,0.007973053],"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.00073509425,0.00036313845,0.00348403,0.0014785466,0.00021553584,0.0011455452,0.0013595846,0.19863024,0.029933307,0.15453759,0.1392992,0.4688182],"study_design_scores_gemma":[0.00018850285,0.00012424015,0.00044335428,0.0001505699,0.000057505364,0.0003737165,0.00015021765,0.77448684,0.031210348,0.08132518,0.11140741,0.00008209642],"about_ca_topic_score_codex":0.0023439273,"about_ca_topic_score_gemma":0.005303522,"teacher_disagreement_score":0.04291039,"about_ca_system_score_codex":0.00068736455,"about_ca_system_score_gemma":0.0012806357,"threshold_uncertainty_score":0.14354956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65136224,0.0025650682,0.046084017,0.0020654113,0.0014419113,0.00090733,0.2190824,0.021511223,0.054980427],"genre_scores_gemma":[0.6038385,0.00044607255,0.05670687,0.00051167863,0.00006490317,0.00036357954,0.31289837,0.0005872125,0.024582656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930227,0.000094998984,0.00003599124,0.00021386273,0.0002392528,0.00011368361],"domain_scores_gemma":[0.9989378,0.00025475386,0.00006250428,0.00023583496,0.0003551742,0.00015383247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733513,0.0012019909,0.0005571523,0.0016931922,0.000652517,0.00087201106,0.0015995061,0.0014723093,0.007286624],"category_scores_gemma":[0.0047672046,0.00035525265,0.0008155594,0.0013065191,0.0006512797,0.0010525429,0.0015588225,0.0022963807,0.0057043657],"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.002470801,0.0030785247,0.05139793,0.000860757,0.00041147057,0.0014879308,0.0003849578,0.21216182,0.009098145,0.008084253,0.33781427,0.3727491],"study_design_scores_gemma":[0.00048640417,0.0011150602,0.065224305,0.0003198765,0.000067240675,0.0006547869,0.00073697435,0.7773293,0.016900834,0.011566188,0.1254495,0.00014947916],"about_ca_topic_score_codex":0.03022126,"about_ca_topic_score_gemma":0.06859848,"teacher_disagreement_score":0.03022126,"about_ca_system_score_codex":0.0010156421,"about_ca_system_score_gemma":0.0010012324,"threshold_uncertainty_score":0.06009072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033024814,0.000110734574,0.9573123,0.00008044618,0.000062571475,0.00018250638,0.0003610831,0.005428456,0.0034371316],"genre_scores_gemma":[0.3936383,0.00016858481,0.5967907,0.00013332088,0.000019510455,0.0003054963,0.0018472034,0.0007729008,0.0063239993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994791,0.0000843119,0.000028145068,0.00022061601,0.00013455012,0.0000533679],"domain_scores_gemma":[0.99955875,0.0001240716,0.000057379348,0.0001301063,0.00008040017,0.000049245267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039267575,0.0012078988,0.0006851227,0.0013330703,0.00028922153,0.0014540704,0.0010229469,0.0007541735,0.005402817],"category_scores_gemma":[0.0024135124,0.00043668746,0.0010537504,0.0008239355,0.00058859924,0.0020408623,0.0019708907,0.0011697509,0.0015642331],"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.00066899264,0.0005072749,0.005337672,0.00033004253,0.00014761274,0.00027083728,0.0007225469,0.16937724,0.06611123,0.02000678,0.008865676,0.7276541],"study_design_scores_gemma":[0.00003663853,0.00016948563,0.0012315147,0.000030996092,0.00003309321,0.00012297706,0.00018669093,0.96613866,0.013969024,0.011903499,0.0061438973,0.000033495024],"about_ca_topic_score_codex":0.0023135364,"about_ca_topic_score_gemma":0.0042892075,"teacher_disagreement_score":0.005402817,"about_ca_system_score_codex":0.0007166417,"about_ca_system_score_gemma":0.00047019022,"threshold_uncertainty_score":0.018074155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9394905,0.0005118744,0.048057884,0.00063233485,0.000093927614,0.00024176949,0.0050646747,0.0020714845,0.0038355154],"genre_scores_gemma":[0.9175605,0.00022421106,0.07065443,0.0001120997,0.000025139234,0.00009780372,0.007753946,0.00015525862,0.0034166186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990876,0.00039531518,0.00006248683,0.00022091565,0.00017433018,0.000059338206],"domain_scores_gemma":[0.9970975,0.0018775972,0.00018408816,0.0003977264,0.00030869976,0.00013441258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008434002,0.00076701096,0.00041617025,0.001179679,0.0003678323,0.0009454105,0.00076513295,0.0007435934,0.00093128014],"category_scores_gemma":[0.0051504383,0.00021922686,0.0004390828,0.001418664,0.0005049615,0.001489416,0.0006529077,0.000906786,0.0005366328],"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.0023223914,0.0035968786,0.195363,0.0016370651,0.0005201785,0.0037267443,0.0061907703,0.22955392,0.02809373,0.010034963,0.029477177,0.4894833],"study_design_scores_gemma":[0.00009181436,0.0007269049,0.058967493,0.00007048586,0.00006334571,0.0010534155,0.0020615356,0.90254396,0.010616948,0.006616812,0.017103972,0.00008338699],"about_ca_topic_score_codex":0.01938119,"about_ca_topic_score_gemma":0.038046014,"teacher_disagreement_score":0.01938119,"about_ca_system_score_codex":0.00073239335,"about_ca_system_score_gemma":0.00039765256,"threshold_uncertainty_score":0.038536787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45520964,0.0005228286,0.35817227,0.0016741641,0.00034306652,0.00029172277,0.0006977776,0.0005368001,0.18255176],"genre_scores_gemma":[0.91189444,0.00027367228,0.03742851,0.00013250962,0.000054455377,0.00014232432,0.00044869087,0.000132632,0.049492728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970716,0.00006789432,0.000008399303,0.0000682795,0.000057036057,0.000091252245],"domain_scores_gemma":[0.99960893,0.00014662501,0.00003507511,0.000045786463,0.000042274016,0.00012134225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020571396,0.00070600887,0.0009701396,0.0005430715,0.0013666637,0.0012603501,0.0015876937,0.0015825363,0.011090574],"category_scores_gemma":[0.0010966711,0.00032412607,0.0007076581,0.0004097899,0.001153158,0.002198374,0.0016364566,0.0013187691,0.0005055893],"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.00036858887,0.00016830419,0.0005637282,0.00018766559,0.00004379817,0.00043873882,0.0003316098,0.09269735,0.0041094306,0.86648065,0.013710074,0.020900067],"study_design_scores_gemma":[0.000068637295,0.00011825558,0.00061610277,0.000035284313,0.000030384506,0.00017173887,0.00024591957,0.41987586,0.0009903666,0.57183254,0.005981535,0.00003345651],"about_ca_topic_score_codex":0.0052409167,"about_ca_topic_score_gemma":0.0053986674,"teacher_disagreement_score":0.011090574,"about_ca_system_score_codex":0.0008897823,"about_ca_system_score_gemma":0.00085738994,"threshold_uncertainty_score":0.037101686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.901096,0.0005542907,0.082755655,0.00026531774,0.00011152821,0.00085719,0.00024677019,0.0007561963,0.013357043],"genre_scores_gemma":[0.93047106,0.00034065588,0.06514504,0.000058533926,0.000022825145,0.0009835486,0.00025482517,0.00013514045,0.0025883822],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99740845,0.0014808251,0.0001529058,0.00024343011,0.0005924212,0.00012192726],"domain_scores_gemma":[0.9582358,0.037206884,0.0013973713,0.0010465444,0.001253177,0.0008601573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002756672,0.0006883545,0.00035647277,0.00082866603,0.00019510646,0.0013474367,0.00068299513,0.00047672985,0.004346274],"category_scores_gemma":[0.03114717,0.00025229904,0.00034685343,0.00051367853,0.0005523136,0.0016217722,0.001042378,0.00085553696,0.00042689525],"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.021399293,0.0055786488,0.030272573,0.004493561,0.0005041502,0.00026093752,0.012981662,0.05570282,0.044977825,0.005888621,0.0031574813,0.8147824],"study_design_scores_gemma":[0.0037060883,0.061498187,0.2673915,0.0011194288,0.0015653726,0.000840335,0.019893546,0.54006183,0.046707947,0.019214451,0.03728558,0.00071577844],"about_ca_topic_score_codex":0.0017151077,"about_ca_topic_score_gemma":0.0022607548,"teacher_disagreement_score":0.004346274,"about_ca_system_score_codex":0.00058686914,"about_ca_system_score_gemma":0.0005506494,"threshold_uncertainty_score":0.014578819},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030623391,0.0024730824,0.0025646018,0.035726685,0.09146993,0.0009850686,0.013508845,0.0014894966,0.8211588],"genre_scores_gemma":[0.07700579,0.0012003742,0.002185705,0.010474983,0.0053811045,0.0005472093,0.01721621,0.00047784482,0.88551086],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920964,0.0000748616,0.00001708419,0.000078668105,0.00029869797,0.00032096967],"domain_scores_gemma":[0.99865997,0.00001842897,0.000029514104,0.00002402422,0.00029237696,0.00097569847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518915,0.0009409909,0.00033674197,0.0005792729,0.0031367063,0.0036819358,0.0006740913,0.0017441987,0.09103775],"category_scores_gemma":[0.001181084,0.00020390566,0.00045212486,0.00048851,0.00042608724,0.00084551005,0.00299292,0.0028561591,0.044956185],"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.00014248067,0.000086284825,0.0008146577,0.00004472088,0.0000064187784,0.00009156583,0.00005124918,0.00006239104,0.00021579488,0.0013341592,0.9853005,0.011849815],"study_design_scores_gemma":[0.000028760052,0.00009800193,0.009353721,0.00006772088,0.0000036965762,0.000052725587,0.00031109832,0.00014325317,0.00024406724,0.0005217954,0.9891633,0.000011985841],"about_ca_topic_score_codex":0.024228513,"about_ca_topic_score_gemma":0.10790906,"teacher_disagreement_score":0.09103775,"about_ca_system_score_codex":0.002213832,"about_ca_system_score_gemma":0.003705513,"threshold_uncertainty_score":0.3045516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021202471,0.0006664798,0.0022157605,0.00033111518,0.00024135939,0.000040795912,0.0015264753,0.001674871,0.993091],"genre_scores_gemma":[0.0008302896,0.0005898276,0.0008249215,0.00022414121,0.000060550083,0.000031203486,0.0017363838,0.00033887496,0.99536383],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971205,0.00002919912,0.000009756882,0.000069545575,0.00013917997,0.000040205156],"domain_scores_gemma":[0.9996138,0.00005839704,0.000014541622,0.00011087361,0.000111537505,0.00009088774],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025288088,0.001426313,0.0007406454,0.002172973,0.0009312411,0.0035628933,0.0010591127,0.0012016332,0.7803939],"category_scores_gemma":[0.0010425946,0.00037991986,0.0004518371,0.0020743841,0.00042818274,0.0029043327,0.0024498457,0.0012489074,0.7775475],"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.000027818289,0.000046321806,0.0001506307,0.00013307053,0.000004752649,0.00005326414,0.00005984748,0.00013082492,0.00092047406,0.014907564,0.71463704,0.26892835],"study_design_scores_gemma":[0.0000036356178,0.000005514138,0.00015837538,0.00004316759,0.0000017021105,0.000043196498,0.000016733957,0.00007782603,0.00012495674,0.0018781993,0.99764365,0.0000028711215],"about_ca_topic_score_codex":0.002840637,"about_ca_topic_score_gemma":0.006209408,"teacher_disagreement_score":0.7803939,"about_ca_system_score_codex":0.00063727656,"about_ca_system_score_gemma":0.0008504956,"threshold_uncertainty_score":0.31324142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6416067,0.0010045292,0.33866122,0.002192185,0.0003104689,0.0040371935,0.00037369388,0.0012418015,0.010572213],"genre_scores_gemma":[0.8039454,0.00015297663,0.19169961,0.0002770189,0.0000347517,0.0026193068,0.00021350275,0.00016263884,0.0008947496],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9198491,0.059738267,0.005062949,0.0044337627,0.009895992,0.0010199015],"domain_scores_gemma":[0.7615726,0.17870612,0.013446886,0.018693294,0.025360698,0.0022204127],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.07141942,0.0011127993,0.000649484,0.0014367446,0.0008575448,0.004055553,0.0019131529,0.002677077,0.0021117427],"category_scores_gemma":[0.25700614,0.00045493626,0.0007838644,0.0007128745,0.0015092482,0.004163705,0.0024312378,0.0017711215,0.0006552069],"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.009445536,0.0058447463,0.15739155,0.0056227725,0.0020630474,0.00065714936,0.014964561,0.04089994,0.042933628,0.029753538,0.007533385,0.6828902],"study_design_scores_gemma":[0.0026569294,0.017425902,0.13422288,0.0030792567,0.0013639728,0.0016873563,0.0095270015,0.6634924,0.11219406,0.026254201,0.027413959,0.0006820495],"about_ca_topic_score_codex":0.0013494459,"about_ca_topic_score_gemma":0.0014239969,"teacher_disagreement_score":0.9285806,"about_ca_system_score_codex":0.001900523,"about_ca_system_score_gemma":0.0014355471,"threshold_uncertainty_score":0.37770647},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018527271,0.00014796798,0.9771119,0.000085879044,0.000010677749,0.00018832092,0.00028317512,0.0008441677,0.0028006856],"genre_scores_gemma":[0.48599824,0.0004214887,0.5066485,0.00008808835,0.000035187335,0.0009011597,0.0010391929,0.00024991136,0.004618245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876595,0.00027087636,0.000100163685,0.00028497484,0.0004731418,0.000104995874],"domain_scores_gemma":[0.99747604,0.0013429483,0.00034552018,0.00022794896,0.0005116526,0.00009584428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012300934,0.001253233,0.0010253994,0.0025956563,0.00046170596,0.0024241058,0.0017994633,0.0011872567,0.0029557943],"category_scores_gemma":[0.005684441,0.00071029563,0.0017026805,0.0010225435,0.0009096417,0.0020037165,0.0012803595,0.0011269759,0.0006940723],"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.000042250405,0.00011072009,0.0023352872,0.000117272844,0.000056271885,0.0001466284,0.00017507015,0.93891066,0.0022158837,0.019356186,0.00076074165,0.03577306],"study_design_scores_gemma":[0.0000044626263,0.000019997146,0.0003112134,0.000012799308,0.000012599178,0.000028812565,0.000012254906,0.9925488,0.0002612754,0.0061329086,0.0006458846,0.000008918297],"about_ca_topic_score_codex":0.009627867,"about_ca_topic_score_gemma":0.009637388,"teacher_disagreement_score":0.009627867,"about_ca_system_score_codex":0.0017619109,"about_ca_system_score_gemma":0.0017936741,"threshold_uncertainty_score":0.0191437},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16740933,0.00040604753,0.7361317,0.0026578098,0.0006976649,0.003037968,0.0015538562,0.012564906,0.075540744],"genre_scores_gemma":[0.33321822,0.0003892211,0.623925,0.0017616997,0.00013525214,0.0019177977,0.0012742416,0.0007762075,0.036602397],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993543,0.0002766641,0.000041891784,0.00010027872,0.00012944078,0.000097298725],"domain_scores_gemma":[0.99664414,0.002189969,0.00017250361,0.00020007773,0.00029305706,0.0005001798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705771,0.0017292252,0.0004178687,0.00061135925,0.00041653716,0.0011462971,0.0016560102,0.0014495937,0.01717357],"category_scores_gemma":[0.005849176,0.00045654736,0.00052828976,0.00020053938,0.00063127506,0.0024035207,0.0018007271,0.0017320012,0.004333748],"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.003846507,0.008744714,0.022743685,0.002059483,0.0002142037,0.0025082987,0.014681906,0.057862505,0.086080186,0.15996228,0.16229776,0.47899857],"study_design_scores_gemma":[0.0013316427,0.004944672,0.010428835,0.0005687839,0.00013409936,0.002724402,0.0020123827,0.30982402,0.039707858,0.072401956,0.5555496,0.0003717879],"about_ca_topic_score_codex":0.0009710042,"about_ca_topic_score_gemma":0.0015218453,"teacher_disagreement_score":0.01717357,"about_ca_system_score_codex":0.0004403384,"about_ca_system_score_gemma":0.0005908042,"threshold_uncertainty_score":0.05745125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31637767,0.0004816831,0.46026683,0.0009953596,0.0006223754,0.00037173624,0.00059284153,0.0024973059,0.21779418],"genre_scores_gemma":[0.6177923,0.00044139766,0.28428337,0.00023859557,0.000077154386,0.00034322226,0.0009642482,0.00081231224,0.0950473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975735,0.000054719614,0.000012020144,0.00006548631,0.00003630171,0.00007411094],"domain_scores_gemma":[0.9991584,0.0006350085,0.000034520464,0.000065434724,0.00003337034,0.00007323353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032664623,0.0011139032,0.0010318451,0.00021321094,0.0010963723,0.001100059,0.0017079267,0.0012612976,0.03905235],"category_scores_gemma":[0.0018019257,0.0006003713,0.0009353769,0.00038653627,0.0007463518,0.0022566197,0.0018433663,0.0018797133,0.0028936656],"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.0022920955,0.0005298379,0.0016827089,0.0011886399,0.00016716677,0.0010019026,0.0009396448,0.36593774,0.02536715,0.26424995,0.03383578,0.30280742],"study_design_scores_gemma":[0.0005765584,0.0005183224,0.0008248428,0.00016161276,0.000110168716,0.00019207207,0.0009673094,0.56363535,0.0085177235,0.38898596,0.035458628,0.000051458068],"about_ca_topic_score_codex":0.0038110747,"about_ca_topic_score_gemma":0.009918529,"teacher_disagreement_score":0.03905235,"about_ca_system_score_codex":0.00041793825,"about_ca_system_score_gemma":0.0007511976,"threshold_uncertainty_score":0.13064307},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.362641,0.016811745,0.039613716,0.0037062922,0.002087973,0.0007345926,0.009835083,0.0071480656,0.5574214],"genre_scores_gemma":[0.838999,0.0047243265,0.040401727,0.0008804703,0.000198197,0.00032839063,0.011381068,0.0021100566,0.1009767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979978,0.00049953826,0.00010594966,0.00024631518,0.0009728975,0.00017738879],"domain_scores_gemma":[0.99256235,0.004666783,0.00024125117,0.001195396,0.00079164753,0.0005425664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021962298,0.00068410026,0.0013583985,0.0022306312,0.0010124539,0.0039476915,0.0025797824,0.0012136162,0.09782733],"category_scores_gemma":[0.016426235,0.00027281942,0.0005446281,0.0018529191,0.0009472142,0.0074471748,0.0026703568,0.0012645484,0.010095541],"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.015757596,0.0015432084,0.004776,0.002169421,0.00021597558,0.00008155907,0.0006490149,0.015621314,0.0015484493,0.11226193,0.086101055,0.75927454],"study_design_scores_gemma":[0.006478232,0.016149372,0.032895822,0.0025109947,0.0010996554,0.00094124326,0.0069222073,0.18193877,0.010997726,0.21573138,0.52398854,0.000346097],"about_ca_topic_score_codex":0.0074518775,"about_ca_topic_score_gemma":0.011389428,"teacher_disagreement_score":0.09782733,"about_ca_system_score_codex":0.0014022293,"about_ca_system_score_gemma":0.0015462177,"threshold_uncertainty_score":0.32726502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5793961,0.0019016659,0.3915528,0.0006756899,0.00042815003,0.00070070126,0.0026025695,0.011566143,0.011176089],"genre_scores_gemma":[0.92185646,0.0002555647,0.07069524,0.00023799746,0.000045587345,0.00017278246,0.0017665415,0.00006782066,0.0049019014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.00012780112,0.000027756792,0.00017323116,0.00017443986,0.00010758003],"domain_scores_gemma":[0.99907625,0.00035094607,0.00015873097,0.000093567454,0.00022853815,0.000091928494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008917115,0.001021655,0.00073456974,0.0013350396,0.00031584708,0.00067385746,0.0014188976,0.00082702684,0.0012093569],"category_scores_gemma":[0.0026555993,0.0002555119,0.00038030252,0.0003967669,0.00041675285,0.0008591953,0.0011429987,0.0007735529,0.00052480266],"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.001992241,0.0012622213,0.032032147,0.0005176625,0.0003445031,0.0008252161,0.0003848493,0.10035558,0.046499796,0.0034552133,0.019740554,0.79259],"study_design_scores_gemma":[0.00003808224,0.00051018776,0.011693973,0.000045455887,0.00006295902,0.00034482402,0.0001032359,0.95954114,0.022018215,0.001956621,0.0036433546,0.000041896856],"about_ca_topic_score_codex":0.007353014,"about_ca_topic_score_gemma":0.011741507,"teacher_disagreement_score":0.007353014,"about_ca_system_score_codex":0.0010187367,"about_ca_system_score_gemma":0.0005398379,"threshold_uncertainty_score":0.014620423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060457096,0.00011349469,0.9234203,0.0004032989,0.000114113114,0.0003777853,0.00007251962,0.00042551523,0.014615822],"genre_scores_gemma":[0.6273531,0.00011767895,0.36472803,0.00016729029,0.00006156261,0.00039003193,0.00012397695,0.000085534826,0.006972843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975859,0.00088352413,0.00011755407,0.00039792992,0.00062066835,0.00039435265],"domain_scores_gemma":[0.9985415,0.00049688306,0.0001699211,0.0001782168,0.0003039215,0.00030971225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025756864,0.0011807999,0.000871923,0.0009126216,0.00142143,0.0017693427,0.0019026452,0.001229301,0.0040537757],"category_scores_gemma":[0.005748802,0.00028739418,0.00077990734,0.0005523249,0.0009128381,0.001814912,0.003686264,0.0014602544,0.0006765414],"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.000905455,0.001221036,0.0064155166,0.00044152577,0.0002227267,0.0004812574,0.0020041878,0.38463458,0.015743118,0.21853887,0.0077207237,0.361671],"study_design_scores_gemma":[0.000101720565,0.000416536,0.0015997628,0.00006584971,0.000068935115,0.0002177699,0.000536256,0.87143415,0.0043931366,0.11329533,0.007818673,0.000051979652],"about_ca_topic_score_codex":0.0034954636,"about_ca_topic_score_gemma":0.0033033846,"teacher_disagreement_score":0.0040537757,"about_ca_system_score_codex":0.0011147854,"about_ca_system_score_gemma":0.0020290243,"threshold_uncertainty_score":0.013621688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11052766,0.0002608606,0.8718169,0.0018173158,0.00010402009,0.00017980054,0.00014181541,0.00023044787,0.014921143],"genre_scores_gemma":[0.9164537,0.00026671094,0.07407507,0.0004171319,0.00011406383,0.0003491925,0.000066973895,0.000056225337,0.008200983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99438393,0.0027325822,0.0002099869,0.00078171125,0.0010702383,0.00082151394],"domain_scores_gemma":[0.9763648,0.018196445,0.0022182022,0.0015071674,0.0008473508,0.00086603255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048338445,0.001506267,0.0016067857,0.00093753653,0.0008978443,0.002279184,0.0028457823,0.002576304,0.0038615398],"category_scores_gemma":[0.026109979,0.00056281185,0.0010508302,0.0008781729,0.004889232,0.004795472,0.002336616,0.0037219666,0.00047283305],"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.00018903003,0.00007561219,0.0005596237,0.00009765071,0.000051405917,0.0001644028,0.00026942688,0.28566706,0.0015572902,0.70255,0.0008134971,0.008004963],"study_design_scores_gemma":[0.00004297406,0.0000637056,0.000087438886,0.000012187635,0.000010378867,0.000030514324,0.000030788866,0.714064,0.00056153076,0.28438833,0.0006901152,0.00001805333],"about_ca_topic_score_codex":0.0026836186,"about_ca_topic_score_gemma":0.0019751356,"teacher_disagreement_score":0.0048338445,"about_ca_system_score_codex":0.0028165155,"about_ca_system_score_gemma":0.0016768936,"threshold_uncertainty_score":0.025564134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019234983,0.00016501077,0.953444,0.00027305516,0.00012488423,0.000199577,0.00031893497,0.016439268,0.009800383],"genre_scores_gemma":[0.411937,0.00019063012,0.57409924,0.0004580198,0.00003303717,0.00056255463,0.0008894238,0.0014584977,0.010371599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997011,0.00007440377,0.000016883214,0.000057229077,0.00010448467,0.00004583079],"domain_scores_gemma":[0.99964094,0.00016106841,0.000021439831,0.000050276598,0.00007415576,0.000052086896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089803006,0.0005592254,0.00040889785,0.0002710923,0.00026010582,0.000658223,0.0017112829,0.00059487385,0.005691382],"category_scores_gemma":[0.0021901398,0.0003051941,0.00050550833,0.00017560655,0.0006201371,0.0008618815,0.0012078132,0.0012561058,0.0011047849],"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.0003345949,0.00033289066,0.002659931,0.00027901572,0.00010437864,0.00028792393,0.00021914025,0.77752197,0.00943228,0.055082668,0.017671267,0.136074],"study_design_scores_gemma":[0.000026135389,0.00003772296,0.0001230185,0.000007504178,0.0000053021863,0.00002068359,0.0000067449837,0.98719305,0.0020386355,0.005181415,0.0053514456,0.000008252211],"about_ca_topic_score_codex":0.0065161525,"about_ca_topic_score_gemma":0.008766342,"teacher_disagreement_score":0.0065161525,"about_ca_system_score_codex":0.00080548815,"about_ca_system_score_gemma":0.001426209,"threshold_uncertainty_score":0.019039571},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05369968,0.004792932,0.63505244,0.09092477,0.001564377,0.000650613,0.0017362772,0.021787636,0.1897913],"genre_scores_gemma":[0.365889,0.0022873885,0.5648307,0.003172405,0.00026284982,0.0001939145,0.0016974299,0.0018187923,0.059847627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989484,0.00049921835,0.00005298937,0.0002026563,0.00021422008,0.000082484585],"domain_scores_gemma":[0.99723464,0.0015919774,0.00013944373,0.0003807945,0.0003306706,0.000322404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017283066,0.00055521476,0.00033057603,0.0008035662,0.0015961227,0.0034716984,0.0012788323,0.0016587678,0.019363254],"category_scores_gemma":[0.0102138305,0.00045719036,0.0005058947,0.00047031397,0.001859338,0.005407849,0.0020835467,0.0015824257,0.007241153],"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.0007626999,0.00027026358,0.0042949957,0.0005758625,0.0000711902,0.0012171208,0.0072602755,0.017373893,0.0069754096,0.21233727,0.16636817,0.5824929],"study_design_scores_gemma":[0.00014471235,0.00020936046,0.0020752081,0.0003236672,0.000061109684,0.0010151783,0.0045228307,0.1421752,0.007898514,0.26417613,0.5772456,0.00015258398],"about_ca_topic_score_codex":0.011082649,"about_ca_topic_score_gemma":0.015406033,"teacher_disagreement_score":0.019363254,"about_ca_system_score_codex":0.0012482319,"about_ca_system_score_gemma":0.0013841143,"threshold_uncertainty_score":0.06477654},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017571704,0.15394045,0.021338971,0.408267,0.20812617,0.0004683989,0.0036390289,0.0019473666,0.2005155],"genre_scores_gemma":[0.019063972,0.21831763,0.028909003,0.23829952,0.27017602,0.0008133259,0.0071711894,0.0016796667,0.21556973],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99033207,0.0034808773,0.0017203538,0.0006658644,0.0034352648,0.00036557447],"domain_scores_gemma":[0.9649806,0.021361442,0.002429847,0.0020454573,0.0078041037,0.0013785957],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010495938,0.00075305137,0.0007532573,0.0056784553,0.001579533,0.005164886,0.0015857266,0.004319396,0.059266884],"category_scores_gemma":[0.06489272,0.0006541191,0.0006055029,0.005947829,0.0021342624,0.008564252,0.0029598651,0.004437528,0.057101887],"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.00006098626,0.000025588994,0.0001475663,0.00095681974,0.0000130574435,0.00022390761,0.00023674045,0.00011679111,0.00084644323,0.020900154,0.8538969,0.12257491],"study_design_scores_gemma":[0.0000053984436,0.000025891579,0.00019538074,0.00040617073,0.0000035527612,0.0003258419,0.000051848958,0.000052809606,0.00022487476,0.0040959227,0.99460196,0.000010412264],"about_ca_topic_score_codex":0.0014357892,"about_ca_topic_score_gemma":0.002060591,"teacher_disagreement_score":0.99483514,"about_ca_system_score_codex":0.002229045,"about_ca_system_score_gemma":0.0031251663,"threshold_uncertainty_score":0.19826746},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018031737,0.009529877,0.002428864,0.079740636,0.05516444,0.00021527737,0.0062923203,0.00067998836,0.8279169],"genre_scores_gemma":[0.06683368,0.003398491,0.0023645896,0.01619296,0.003872599,0.00021334566,0.0073751383,0.00041473543,0.8993345],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988889,0.00009028339,0.000019580366,0.00006568952,0.0005113347,0.00042430204],"domain_scores_gemma":[0.9980621,0.000070644855,0.00007615793,0.00003728887,0.00068145595,0.0010723388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013585369,0.00064096664,0.00024336648,0.0012222718,0.0023756474,0.005228187,0.00072722323,0.0018102067,0.09340662],"category_scores_gemma":[0.0035692626,0.00022333565,0.00024933045,0.0009690892,0.00079995627,0.0013498367,0.002372694,0.0020878033,0.03299372],"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.00013420692,0.000048628823,0.0011961224,0.000053571755,0.0000056922377,0.00009471686,0.00006520886,0.00014714336,0.00025064495,0.015972767,0.9253441,0.056687254],"study_design_scores_gemma":[0.000010425176,0.00002064553,0.0027635747,0.000040254257,0.0000014210109,0.000026962127,0.00007991633,0.00006371795,0.0001316054,0.00095983624,0.9958961,0.0000055679147],"about_ca_topic_score_codex":0.030401092,"about_ca_topic_score_gemma":0.056919485,"teacher_disagreement_score":0.09340662,"about_ca_system_score_codex":0.00425763,"about_ca_system_score_gemma":0.0064125857,"threshold_uncertainty_score":0.31247628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053586587,0.0001598429,0.00043289884,0.00010110396,0.0000761465,0.000039376024,0.9893188,0.0006816182,0.003831497],"genre_scores_gemma":[0.004827176,0.000064068445,0.0006000595,0.00003706,0.000011158002,0.000058099693,0.9921651,0.00004234993,0.0021950677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954385,0.00005120343,0.000041178362,0.00013470303,0.00015837362,0.00007057964],"domain_scores_gemma":[0.99933136,0.00010258413,0.00007460692,0.00013850859,0.00022440993,0.00012859548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003927087,0.0012695863,0.0007101758,0.0014935639,0.0003876976,0.0008833653,0.0011545847,0.0011851591,0.01892062],"category_scores_gemma":[0.0016976778,0.00024070597,0.00052132487,0.0021440366,0.0002263012,0.00071016874,0.00080136704,0.0007678252,0.028537976],"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.0002631706,0.00017010572,0.006775844,0.00040526,0.000040364444,0.000103946855,0.000058325866,0.0026968066,0.00051181804,0.0010232535,0.97404814,0.013902969],"study_design_scores_gemma":[0.00017768319,0.00012447564,0.046518996,0.0001801855,0.000035251047,0.00028394992,0.00027488006,0.008410828,0.001380863,0.0014488401,0.9411,0.00006398175],"about_ca_topic_score_codex":0.017946484,"about_ca_topic_score_gemma":0.037524115,"teacher_disagreement_score":0.01892062,"about_ca_system_score_codex":0.00076338794,"about_ca_system_score_gemma":0.00084949774,"threshold_uncertainty_score":0.06329584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053586587,0.0001598429,0.00043289884,0.00010110396,0.0000761465,0.000039376024,0.9893188,0.0006816182,0.003831497],"genre_scores_gemma":[0.004827176,0.000064068445,0.0006000595,0.00003706,0.000011158002,0.000058099693,0.9921651,0.00004234993,0.0021950677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954385,0.00005120343,0.000041178362,0.00013470303,0.00015837362,0.00007057964],"domain_scores_gemma":[0.99933136,0.00010258413,0.00007460692,0.00013850859,0.00022440993,0.00012859548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003927087,0.0012695863,0.0007101758,0.0014935639,0.0003876976,0.0008833653,0.0011545847,0.0011851591,0.01892062],"category_scores_gemma":[0.0016976778,0.00024070597,0.00052132487,0.0021440366,0.0002263012,0.00071016874,0.00080136704,0.0007678252,0.028537976],"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.0002631706,0.00017010572,0.006775844,0.00040526,0.000040364444,0.000103946855,0.000058325866,0.0026968066,0.00051181804,0.0010232535,0.97404814,0.013902969],"study_design_scores_gemma":[0.00017768319,0.00012447564,0.046518996,0.0001801855,0.000035251047,0.00028394992,0.00027488006,0.008410828,0.001380863,0.0014488401,0.9411,0.00006398175],"about_ca_topic_score_codex":0.017946484,"about_ca_topic_score_gemma":0.037524115,"teacher_disagreement_score":0.01892062,"about_ca_system_score_codex":0.00076338794,"about_ca_system_score_gemma":0.00084949774,"threshold_uncertainty_score":0.06329584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33624038,0.0044817445,0.4079625,0.020821813,0.00025562465,0.0001676987,0.00023730165,0.0002042185,0.22962879],"genre_scores_gemma":[0.98726535,0.00038555101,0.009986403,0.00018267821,0.00003066629,0.000058176032,0.000014179686,0.000022940627,0.0020540622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856514,0.00094330445,0.000042224034,0.00012888495,0.00019069172,0.0001297121],"domain_scores_gemma":[0.9952474,0.003730777,0.0003403057,0.00029944748,0.0001651495,0.0002169841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023272387,0.00032585682,0.0004235949,0.0008527178,0.0011285277,0.005442508,0.0010193615,0.001577682,0.004901971],"category_scores_gemma":[0.008272427,0.00028902333,0.0005665986,0.0007005362,0.012572434,0.0076392996,0.002834831,0.0015211565,0.00030425627],"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.000045916106,0.000012832859,0.0009714782,0.000059673926,0.000013608833,0.00009614342,0.0041671037,0.004009391,0.000543547,0.98645186,0.00044796226,0.0031805402],"study_design_scores_gemma":[0.00003407848,0.000043665546,0.00096596574,0.00008834101,0.000012087534,0.00017629669,0.00388616,0.033776637,0.0002735734,0.95362335,0.0070918743,0.000027911003],"about_ca_topic_score_codex":0.0014330702,"about_ca_topic_score_gemma":0.0009802375,"teacher_disagreement_score":0.005442508,"about_ca_system_score_codex":0.0009818195,"about_ca_system_score_gemma":0.0009364742,"threshold_uncertainty_score":0.016398728},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063090146,0.0021736638,0.029196383,0.007324329,0.0019481253,0.00017013603,0.0010670184,0.0011058737,0.8939244],"genre_scores_gemma":[0.5187908,0.0019099864,0.037448727,0.0032595731,0.00029423265,0.0003013964,0.0010690404,0.0004621343,0.43646416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995419,0.00006201077,0.000011664019,0.00009890203,0.00014316694,0.00014238783],"domain_scores_gemma":[0.99973243,0.00007062225,0.00003494715,0.000022047534,0.000055698107,0.00008433906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031769896,0.0007924772,0.0003941867,0.0003048916,0.0021701853,0.002004969,0.0006979962,0.0010128485,0.04192317],"category_scores_gemma":[0.0013640163,0.00016252535,0.00045498507,0.00040690886,0.001438182,0.0015084019,0.0015652551,0.001959455,0.008239787],"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.00059374224,0.00016142549,0.0013879498,0.00022718901,0.00003134504,0.00064169645,0.00061938196,0.0036850458,0.0036103725,0.63366765,0.24250974,0.11286444],"study_design_scores_gemma":[0.00019442366,0.00028803258,0.003820897,0.00021753601,0.000028144927,0.0006347837,0.0007529381,0.010095195,0.0059374897,0.3047828,0.6731726,0.00007525999],"about_ca_topic_score_codex":0.010540135,"about_ca_topic_score_gemma":0.016633961,"teacher_disagreement_score":0.04192317,"about_ca_system_score_codex":0.0017798499,"about_ca_system_score_gemma":0.0018117427,"threshold_uncertainty_score":0.14024699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00833031,0.00010039543,0.98963284,0.000050541537,0.00001180294,0.000053471926,0.000029294357,0.0010691597,0.00072226935],"genre_scores_gemma":[0.14743,0.000111893205,0.84977883,0.00016289654,0.000016769749,0.00019474495,0.00022825079,0.0007680219,0.0013085316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979449,0.00041575974,0.00012215883,0.00049633544,0.00073697144,0.0002838537],"domain_scores_gemma":[0.9970655,0.0014434108,0.0003002469,0.000667766,0.00034347104,0.00017965754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002484645,0.0020219493,0.0020751306,0.0016232067,0.0009477757,0.0018335589,0.0027021142,0.0026111868,0.0031896483],"category_scores_gemma":[0.0074797943,0.0014068512,0.0021501777,0.0011286772,0.0022784285,0.0027485343,0.004424331,0.0022115977,0.0012474984],"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.00035041044,0.00014096788,0.0020821518,0.00024506514,0.00013190124,0.0003421313,0.0007754625,0.67210835,0.027466845,0.03204509,0.003884452,0.2604272],"study_design_scores_gemma":[0.000015962458,0.000035119505,0.00013114887,0.00002081375,0.000015258554,0.000073538875,0.00003082648,0.98507315,0.0058768243,0.0075681596,0.0011419605,0.0000171791],"about_ca_topic_score_codex":0.0061504296,"about_ca_topic_score_gemma":0.0072000027,"teacher_disagreement_score":0.0061504296,"about_ca_system_score_codex":0.0012610478,"about_ca_system_score_gemma":0.0025338673,"threshold_uncertainty_score":0.013140261},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65726894,0.00033352326,0.2131676,0.00070404453,0.00021949847,0.00034931678,0.0018043126,0.0011212612,0.12503147],"genre_scores_gemma":[0.9580812,0.00012968054,0.0298644,0.00017668756,0.000026691252,0.00014540798,0.0005060943,0.00008885459,0.01098096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.00020404605,0.00008459712,0.00026556946,0.00020630643,0.00029667327],"domain_scores_gemma":[0.99845994,0.00053157826,0.00028356205,0.0003551349,0.00008692374,0.00028293484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044158997,0.0010219037,0.0005227069,0.00044047585,0.0011312304,0.0020728093,0.0012761471,0.0010813562,0.012182719],"category_scores_gemma":[0.0035981094,0.00036617965,0.000607312,0.00054346706,0.0030531497,0.0026581087,0.0022613993,0.0011085464,0.0011768787],"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.0025416568,0.0005127413,0.010212844,0.000840046,0.00019091462,0.0016478027,0.00093043246,0.05267009,0.02622599,0.78786856,0.016201323,0.100157596],"study_design_scores_gemma":[0.00039545045,0.00092492584,0.010445261,0.00018671966,0.000107446,0.0021235563,0.00073842925,0.12741363,0.015986899,0.8047274,0.036734294,0.00021595218],"about_ca_topic_score_codex":0.0019163915,"about_ca_topic_score_gemma":0.0033090226,"teacher_disagreement_score":0.012182719,"about_ca_system_score_codex":0.00071676465,"about_ca_system_score_gemma":0.00067057955,"threshold_uncertainty_score":0.040755212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016460072,0.0033387817,0.86775774,0.015115894,0.0025095143,0.0008492253,0.0012356733,0.019237528,0.07349561],"genre_scores_gemma":[0.06316939,0.0015401649,0.8847069,0.0018789307,0.0009957376,0.0010082992,0.0025698342,0.003102919,0.041027717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97252154,0.012476751,0.0030163992,0.0027095422,0.008578392,0.0006974652],"domain_scores_gemma":[0.94455713,0.019121442,0.0022865606,0.010112379,0.017448112,0.006474357],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.03430735,0.0014270132,0.002249345,0.020537363,0.005516636,0.029992804,0.009994723,0.005279518,0.01808389],"category_scores_gemma":[0.07337939,0.0013133748,0.0022083689,0.011405476,0.008119826,0.03046796,0.014967431,0.004946899,0.012042252],"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.0002791879,0.00073242374,0.0032196925,0.0008259298,0.00009732527,0.0004896525,0.008896348,0.0038507471,0.0068188678,0.6415532,0.049720198,0.2835164],"study_design_scores_gemma":[0.00011357943,0.00025444615,0.00085144775,0.00054345996,0.00008289608,0.00034197228,0.0026467917,0.02087142,0.0063979407,0.32695028,0.6407608,0.0001850181],"about_ca_topic_score_codex":0.005145622,"about_ca_topic_score_gemma":0.0054650353,"teacher_disagreement_score":0.9794626,"about_ca_system_score_codex":0.0040031173,"about_ca_system_score_gemma":0.0073283995,"threshold_uncertainty_score":0.18143678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114229955,0.000040602717,0.985196,0.000050261806,0.000018574678,0.0000854669,0.00001942965,0.0010143404,0.0021523428],"genre_scores_gemma":[0.2961361,0.000086251704,0.6998407,0.000088885055,0.000015115122,0.00022702986,0.00011881721,0.00057628675,0.002910818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.00015249703,0.000027527127,0.00012562092,0.00019846446,0.000059247523],"domain_scores_gemma":[0.99917704,0.00044601056,0.000059036614,0.00015448185,0.00011653009,0.000046887675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073613523,0.00093267864,0.0005201644,0.00071459747,0.0004321478,0.0012887237,0.0016255172,0.0009593309,0.0034805983],"category_scores_gemma":[0.002656433,0.0005283127,0.00072731567,0.00029171555,0.0011714324,0.0009509623,0.0024248785,0.0010716033,0.00090919936],"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.00036907088,0.00042075562,0.0031663643,0.00035740834,0.00008504118,0.0005190797,0.0020143671,0.48280102,0.10466981,0.05510167,0.0041454937,0.3463499],"study_design_scores_gemma":[0.00003865326,0.00014138277,0.00033993094,0.000031705495,0.000025578645,0.00017391371,0.000111953195,0.96481,0.0151083,0.013074784,0.00611442,0.000029348723],"about_ca_topic_score_codex":0.0010492561,"about_ca_topic_score_gemma":0.0020764403,"teacher_disagreement_score":0.0034805983,"about_ca_system_score_codex":0.00039365288,"about_ca_system_score_gemma":0.0004944189,"threshold_uncertainty_score":0.011643708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1468761,0.0010077403,0.8250356,0.0010004045,0.00031230293,0.00015224602,0.00032855768,0.011832884,0.013454066],"genre_scores_gemma":[0.82335836,0.0003203339,0.17020458,0.00042853766,0.00005238177,0.00014806024,0.0004984416,0.00055239425,0.004436818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993807,0.00017730186,0.000032281616,0.00012066815,0.00015247863,0.00013653244],"domain_scores_gemma":[0.9984314,0.00075270515,0.000102089245,0.00047308637,0.00015734484,0.00008333378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094624044,0.001118768,0.00079923973,0.00033716395,0.00040992777,0.0007427216,0.0012499611,0.000820543,0.0051213573],"category_scores_gemma":[0.004461015,0.0004159378,0.00061636086,0.00031961105,0.00077696535,0.0015863156,0.0016696753,0.0023613046,0.0012795068],"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.00040502416,0.00012627179,0.0021979313,0.00012246246,0.000071849514,0.00015047562,0.00009068262,0.868486,0.011361411,0.012344356,0.0075277397,0.09711577],"study_design_scores_gemma":[0.000010713309,0.000026458883,0.00011029352,0.0000054937627,0.0000039341685,0.00002210693,0.000006025621,0.99415153,0.002158347,0.00273868,0.00076294586,0.0000034462564],"about_ca_topic_score_codex":0.0032540483,"about_ca_topic_score_gemma":0.004896483,"teacher_disagreement_score":0.0051213573,"about_ca_system_score_codex":0.0007405434,"about_ca_system_score_gemma":0.0009454664,"threshold_uncertainty_score":0.01713264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23727326,0.0028171816,0.7064768,0.006213883,0.0018249871,0.00025876367,0.00037909916,0.0040438036,0.040712275],"genre_scores_gemma":[0.6814801,0.0012747766,0.27272195,0.001703661,0.0006101053,0.00012578665,0.000340213,0.0009364758,0.040806845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996063,0.000051124458,0.000013668306,0.00007552543,0.00022565862,0.00002770847],"domain_scores_gemma":[0.9995809,0.00016441086,0.000026897143,0.00007505737,0.00007674744,0.00007599319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718002,0.00027834182,0.0002728673,0.0002841902,0.0004096272,0.0007714321,0.00050593907,0.0008279691,0.0122889215],"category_scores_gemma":[0.0029244022,0.00019377292,0.00023438464,0.00010204012,0.0004766224,0.00072031,0.0010414167,0.00052405935,0.0021311257],"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.0006220151,0.00012869162,0.0034881888,0.00050260604,0.000039555427,0.0012526363,0.0017166267,0.0032437644,0.22052352,0.011608782,0.02504838,0.73182523],"study_design_scores_gemma":[0.00039382698,0.001356548,0.027694628,0.00044207514,0.00025961205,0.02326088,0.0029637334,0.16820596,0.2877998,0.03344827,0.45391575,0.00025901262],"about_ca_topic_score_codex":0.0005080323,"about_ca_topic_score_gemma":0.0016391183,"teacher_disagreement_score":0.0122889215,"about_ca_system_score_codex":0.00019618789,"about_ca_system_score_gemma":0.0004400667,"threshold_uncertainty_score":0.041110575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25807106,0.0024207693,0.67071736,0.0010970648,0.00023877977,0.0005784732,0.00088482426,0.05831316,0.007678519],"genre_scores_gemma":[0.70894563,0.0005212927,0.28419366,0.0003121436,0.00003667866,0.00015923566,0.0013699436,0.00189112,0.0025702175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996333,0.00087536295,0.00030981336,0.00075654837,0.0015085763,0.00021682608],"domain_scores_gemma":[0.9806919,0.010577495,0.0024715632,0.002567547,0.0033458571,0.0003455701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030272608,0.002042999,0.0010034279,0.0040524746,0.0005512462,0.002323924,0.0019663994,0.0010066921,0.002507174],"category_scores_gemma":[0.032588527,0.0009104064,0.0010547352,0.0012073807,0.0009360536,0.0034619458,0.0017568836,0.0016507636,0.0011782696],"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.00072861696,0.00093481445,0.039256316,0.0006742256,0.00026506925,0.0003473883,0.0007094798,0.06050779,0.0518887,0.004870848,0.009719568,0.8300972],"study_design_scores_gemma":[0.000119113836,0.0005907547,0.009932147,0.00012399897,0.00025870063,0.00036405338,0.00022919166,0.9330266,0.039523296,0.010965388,0.0047435192,0.0001232495],"about_ca_topic_score_codex":0.0052368147,"about_ca_topic_score_gemma":0.007572796,"teacher_disagreement_score":0.0052368147,"about_ca_system_score_codex":0.0009295452,"about_ca_system_score_gemma":0.0015962936,"threshold_uncertainty_score":0.016009867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10974729,0.0006454565,0.7296592,0.00032071795,0.00027259323,0.0030566705,0.0021178026,0.117010996,0.037169218],"genre_scores_gemma":[0.37770665,0.0005810071,0.55117565,0.00053056027,0.00009629206,0.0025706463,0.005499031,0.0058352374,0.056004904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999757,0.00005021161,0.000014697358,0.00005990854,0.00006685091,0.00005132539],"domain_scores_gemma":[0.9994629,0.0002030064,0.00004112558,0.000075719756,0.000066569555,0.00015066803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043641988,0.001033685,0.00029671087,0.00043340545,0.00016657064,0.0006928015,0.0017872637,0.0005978844,0.01718423],"category_scores_gemma":[0.002501203,0.00029326964,0.00037017322,0.000118558135,0.00018278249,0.001046797,0.0014556624,0.00074780383,0.0040678517],"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.0018722784,0.0019023068,0.0041367416,0.0015094975,0.00013083461,0.0010458463,0.001262316,0.013206628,0.13544348,0.01193021,0.09293056,0.7346294],"study_design_scores_gemma":[0.00082994485,0.003785664,0.021849304,0.00046428596,0.00016327888,0.0040413258,0.00037264786,0.26500964,0.10357554,0.010153644,0.589437,0.00031769197],"about_ca_topic_score_codex":0.0006246378,"about_ca_topic_score_gemma":0.0015102869,"teacher_disagreement_score":0.01718423,"about_ca_system_score_codex":0.00024246598,"about_ca_system_score_gemma":0.00043637725,"threshold_uncertainty_score":0.05748695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69251674,0.0020150135,0.29107943,0.000495149,0.00006827288,0.00034078752,0.0003026704,0.0018877416,0.0112940855],"genre_scores_gemma":[0.87945116,0.0003209865,0.11893577,0.000066038105,0.000010259154,0.00010173207,0.00018255679,0.00008696677,0.0008444319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861395,0.0006640422,0.00008596594,0.0002333189,0.00022402844,0.00017865263],"domain_scores_gemma":[0.9882478,0.01003469,0.0005010352,0.0005771832,0.00042560566,0.00021368859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021667061,0.0006904194,0.0008060325,0.0011652374,0.0005936111,0.0017313634,0.0015974089,0.0010457031,0.002538178],"category_scores_gemma":[0.020020138,0.0004881914,0.00037142792,0.0014382243,0.0012057475,0.0030653935,0.00092926767,0.0009318037,0.00027703604],"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.0013050933,0.0005719551,0.007387458,0.0005825111,0.00013116046,0.00013545294,0.0007753279,0.59423846,0.0045685666,0.029467896,0.0020731278,0.35876307],"study_design_scores_gemma":[0.00014499496,0.00050800276,0.0020820883,0.000046934634,0.000062652514,0.00007528885,0.0002638889,0.96990305,0.0036583545,0.02177251,0.0014391518,0.000043159773],"about_ca_topic_score_codex":0.026374973,"about_ca_topic_score_gemma":0.02139756,"teacher_disagreement_score":0.026374973,"about_ca_system_score_codex":0.0022914622,"about_ca_system_score_gemma":0.0024269947,"threshold_uncertainty_score":0.05244291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10824536,0.0026261758,0.45679623,0.0009385343,0.0020811327,0.0018288267,0.122683875,0.033667248,0.2711326],"genre_scores_gemma":[0.41947147,0.0023296124,0.30575925,0.000762512,0.0006066904,0.002912518,0.10653384,0.0099491365,0.15167494],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990988,0.00019333097,0.00011874505,0.00019549167,0.00031149012,0.0000822348],"domain_scores_gemma":[0.996718,0.0016509023,0.00019766261,0.0007440008,0.0005482735,0.00014111445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078639924,0.0006639969,0.00034962784,0.002479946,0.000706418,0.0019572582,0.000646857,0.00078030425,0.052076396],"category_scores_gemma":[0.00917061,0.00029989012,0.00025608382,0.001984146,0.0006521145,0.0028727632,0.0019155972,0.00072755484,0.01588711],"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.0011637355,0.00010944597,0.008828609,0.0016795814,0.00003365698,0.0014370778,0.0060819355,0.004254852,0.019492133,0.042850263,0.18674085,0.7273279],"study_design_scores_gemma":[0.00005554884,0.00014030711,0.012278983,0.0007759639,0.000022379383,0.0014871816,0.0021612162,0.008803134,0.025149867,0.01870505,0.9302647,0.00015565335],"about_ca_topic_score_codex":0.0020513155,"about_ca_topic_score_gemma":0.0033482367,"teacher_disagreement_score":0.052076396,"about_ca_system_score_codex":0.00040285834,"about_ca_system_score_gemma":0.00065410195,"threshold_uncertainty_score":0.17421293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2503966,0.00039803833,0.73634624,0.0007940875,0.0001237306,0.0001700308,0.0011857295,0.0020306879,0.0085548],"genre_scores_gemma":[0.88546205,0.00014355342,0.107646614,0.0002599999,0.00002521942,0.00012819724,0.0016320575,0.00012058887,0.0045817276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.00021023933,0.000028888824,0.00019536116,0.000074401134,0.00007727379],"domain_scores_gemma":[0.9975799,0.001554758,0.00018785457,0.00039821377,0.0001406126,0.00013868645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008394627,0.0011808937,0.0007366735,0.00062540866,0.00029750174,0.0019093562,0.001708352,0.0014024862,0.0050619985],"category_scores_gemma":[0.0065557105,0.0004696303,0.0010060947,0.00057261833,0.0010770664,0.003963488,0.0014050986,0.0027517604,0.0008799076],"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.0005832073,0.00032659195,0.0085773235,0.00021498746,0.00013673179,0.00023357419,0.00035897223,0.77120167,0.0037273385,0.054484442,0.0053852974,0.15476984],"study_design_scores_gemma":[0.000016903577,0.00004272286,0.00044400798,0.000018628423,0.0000103434895,0.00002275239,0.000027976552,0.970586,0.00053481484,0.027598824,0.000685189,0.0000118370735],"about_ca_topic_score_codex":0.0048671584,"about_ca_topic_score_gemma":0.009260791,"teacher_disagreement_score":0.0050619985,"about_ca_system_score_codex":0.0011123325,"about_ca_system_score_gemma":0.00068390375,"threshold_uncertainty_score":0.016934037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021200065,0.00021824554,0.9697352,0.0002702114,0.000040256335,0.00017710947,0.000050278733,0.0010065513,0.0073020253],"genre_scores_gemma":[0.6266279,0.00025585864,0.3687488,0.00022716328,0.000060418497,0.00036982624,0.00016061617,0.00022447713,0.003324815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812573,0.00065477745,0.000122295,0.00039521907,0.0005202895,0.00018163085],"domain_scores_gemma":[0.9925011,0.005465149,0.00048077287,0.0009778392,0.00035203455,0.00022323838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023244105,0.0009265066,0.0009264378,0.0010588166,0.00074689183,0.001629408,0.0018035372,0.0015747598,0.0046152202],"category_scores_gemma":[0.020728275,0.00053013244,0.00097497785,0.00067475776,0.00261967,0.0025776238,0.0025150294,0.0022195766,0.0007535301],"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.00028124324,0.00031571128,0.0014510591,0.00031171576,0.00008420585,0.00030443622,0.00061890366,0.62345487,0.0051052324,0.18403071,0.0022692073,0.18177268],"study_design_scores_gemma":[0.000026983613,0.00004751583,0.00019704195,0.00002334193,0.000012542001,0.000049193117,0.000033731158,0.8839871,0.0013277609,0.11283488,0.0014465102,0.000013394686],"about_ca_topic_score_codex":0.0030030408,"about_ca_topic_score_gemma":0.0020998109,"teacher_disagreement_score":0.0046152202,"about_ca_system_score_codex":0.0018365434,"about_ca_system_score_gemma":0.0013720478,"threshold_uncertainty_score":0.015439451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101734914,0.0008994798,0.88682115,0.0011140457,0.00014372988,0.00018483182,0.00025123873,0.0010537098,0.0077968645],"genre_scores_gemma":[0.8166174,0.00040128283,0.17317525,0.0003700914,0.000140649,0.00044168587,0.00048687862,0.0002082094,0.008158436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925345,0.00027210018,0.000047752306,0.0001683824,0.00012378367,0.0001345553],"domain_scores_gemma":[0.99185354,0.0071374937,0.00027669367,0.00030199418,0.00028137089,0.00014888219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018778131,0.0015699756,0.002008638,0.0008177201,0.00056804856,0.0013810121,0.002348042,0.0025853822,0.003974993],"category_scores_gemma":[0.012358749,0.0014636172,0.00084538275,0.0007897471,0.0013815765,0.0031784773,0.0023183036,0.003355647,0.00055974344],"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.00013024641,0.000078664874,0.0004315979,0.000068377885,0.00004211896,0.0000307997,0.00003686101,0.95365244,0.00046651662,0.0122639425,0.0011370688,0.03166148],"study_design_scores_gemma":[0.00000781569,0.000010033439,0.000019474886,0.0000045551797,0.0000028297486,0.000002859841,0.000003030569,0.9926536,0.0000923474,0.0071551963,0.000046694706,0.0000016272055],"about_ca_topic_score_codex":0.0073733805,"about_ca_topic_score_gemma":0.012623308,"teacher_disagreement_score":0.0073733805,"about_ca_system_score_codex":0.002041171,"about_ca_system_score_gemma":0.0016061906,"threshold_uncertainty_score":0.014809847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07280083,0.0012064253,0.8675808,0.009386054,0.0009282521,0.0006540363,0.0026777943,0.004828514,0.039937265],"genre_scores_gemma":[0.70842546,0.0005349796,0.27742395,0.0005624261,0.00025641063,0.00027889572,0.002562597,0.00023250202,0.009722802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968913,0.00144486,0.0002120516,0.0003649343,0.0009253094,0.00016159288],"domain_scores_gemma":[0.96414596,0.029496973,0.00090343686,0.0022812798,0.0027258804,0.0004464981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029188583,0.0010047656,0.0005778196,0.002407686,0.0010520302,0.0025612863,0.0020398672,0.0037089211,0.03248779],"category_scores_gemma":[0.05097871,0.00066054816,0.00087339635,0.0011764595,0.00075704005,0.0056620208,0.0019546926,0.0030568298,0.0029151484],"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.001752732,0.0008387161,0.009020448,0.0012642985,0.00034316053,0.0013670775,0.0032431297,0.07647894,0.0035058064,0.4388486,0.06872587,0.39461118],"study_design_scores_gemma":[0.00042204975,0.00016260703,0.0012479974,0.0003099128,0.00026671274,0.00037777636,0.0006992927,0.5814744,0.0029671246,0.38636878,0.02563532,0.00006805518],"about_ca_topic_score_codex":0.004607864,"about_ca_topic_score_gemma":0.0077905743,"teacher_disagreement_score":0.03248779,"about_ca_system_score_codex":0.00089924503,"about_ca_system_score_gemma":0.001524835,"threshold_uncertainty_score":0.10868245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7701105,0.00043581045,0.18846096,0.0015400122,0.00034850225,0.00035704227,0.00052745466,0.0003415526,0.037878163],"genre_scores_gemma":[0.9335968,0.00027780386,0.05654012,0.00027744906,0.000083120576,0.0004097406,0.0005160432,0.00007513717,0.008223803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569356,0.0013741545,0.0004533313,0.00073172164,0.001168224,0.000578983],"domain_scores_gemma":[0.9862248,0.009782529,0.0010552545,0.000855597,0.0008470568,0.0012347145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033911092,0.00083795394,0.0018685298,0.0017758649,0.0024281023,0.0039342074,0.0028056283,0.0024602097,0.004767587],"category_scores_gemma":[0.022563154,0.000560144,0.0008207948,0.00141831,0.0023288922,0.0060905553,0.0023308971,0.0015025695,0.00069272023],"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.0017337583,0.00043768034,0.012353309,0.00053875893,0.0002450209,0.00068194617,0.000920911,0.02639692,0.016044496,0.8542978,0.0059172986,0.0804321],"study_design_scores_gemma":[0.00019749702,0.00029733832,0.0036434531,0.000073014824,0.00015129472,0.0009192969,0.0003146102,0.18319407,0.008864249,0.79703844,0.005152752,0.00015407024],"about_ca_topic_score_codex":0.00085875654,"about_ca_topic_score_gemma":0.000918145,"teacher_disagreement_score":0.004767587,"about_ca_system_score_codex":0.0015448227,"about_ca_system_score_gemma":0.0010606303,"threshold_uncertainty_score":0.017934084},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030532612,0.01858824,0.7600184,0.0060508884,0.001308237,0.00022835529,0.0005335324,0.003164557,0.20705454],"genre_scores_gemma":[0.05299487,0.016477056,0.7358415,0.0032521866,0.0004737358,0.00065687636,0.0011357109,0.0021457626,0.18702228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926513,0.00019069188,0.000044770346,0.00014889301,0.00028398403,0.000066472516],"domain_scores_gemma":[0.9993303,0.00035972332,0.000035653964,0.0000943431,0.00013494617,0.000045114568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081410754,0.0009308733,0.00069528574,0.0008829795,0.0007177134,0.0036026065,0.0016007317,0.0015582779,0.03799455],"category_scores_gemma":[0.004772952,0.0005819194,0.00056582794,0.0016724581,0.0016765281,0.006279872,0.001990725,0.0027667643,0.018573517],"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.00007160494,0.00004941167,0.00018060944,0.0005482918,0.000020944557,0.000053452033,0.0003652881,0.0096717,0.0012862642,0.4360025,0.1392821,0.4124678],"study_design_scores_gemma":[0.000042958247,0.00007365052,0.00030760793,0.0006916784,0.000019435876,0.00029628896,0.00020598731,0.031553756,0.002145777,0.45151457,0.5131026,0.000045629924],"about_ca_topic_score_codex":0.0014808289,"about_ca_topic_score_gemma":0.0020279007,"teacher_disagreement_score":0.03799455,"about_ca_system_score_codex":0.0012243476,"about_ca_system_score_gemma":0.001305774,"threshold_uncertainty_score":0.1271044},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016013782,0.005142497,0.7936457,0.0016358992,0.0006729983,0.00017765554,0.00044437972,0.0036676698,0.19301178],"genre_scores_gemma":[0.042560607,0.006448121,0.6660324,0.0019715629,0.00025101285,0.0005463276,0.0013788576,0.0022895734,0.27852157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00015132938,0.000051890453,0.00015178119,0.0002850129,0.000062235296],"domain_scores_gemma":[0.9994759,0.0002449763,0.00002346538,0.000111939175,0.00012302157,0.00002065245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007952183,0.0010634379,0.00054407347,0.0007428638,0.0007104973,0.0025328586,0.0014704564,0.0011788432,0.041488055],"category_scores_gemma":[0.0031591754,0.0006282781,0.00090984494,0.0011615,0.0012998669,0.003989361,0.0016954272,0.0025373152,0.021832252],"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.000027576341,0.00003250474,0.00017199665,0.0004229284,0.000024850076,0.00008867826,0.00050727476,0.0066299876,0.0013969573,0.56856155,0.088392705,0.3337431],"study_design_scores_gemma":[0.000019679086,0.000027400689,0.00016082425,0.00036220622,0.000017572618,0.00026860504,0.00010404459,0.014613786,0.0020273682,0.3721405,0.6102321,0.00002596686],"about_ca_topic_score_codex":0.0018401202,"about_ca_topic_score_gemma":0.003015583,"teacher_disagreement_score":0.041488055,"about_ca_system_score_codex":0.0012748471,"about_ca_system_score_gemma":0.0012602997,"threshold_uncertainty_score":0.13879138},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10768053,0.0033793678,0.6851753,0.0029227603,0.0005840661,0.00041229124,0.0015102526,0.0004906297,0.19784485],"genre_scores_gemma":[0.7451127,0.0041492134,0.1846313,0.0013081523,0.0011316447,0.0007933917,0.0024450144,0.00019518012,0.06023337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764293,0.0006041861,0.00016696572,0.00061537884,0.000705042,0.00026551264],"domain_scores_gemma":[0.99849486,0.0007677853,0.00016416927,0.00019980037,0.00018149504,0.00019186726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661663,0.0013691449,0.0010114902,0.001243801,0.0013253809,0.0034610825,0.0019327299,0.0010883585,0.007100979],"category_scores_gemma":[0.003980092,0.00047601876,0.0010091239,0.0017940685,0.0035945366,0.0061832247,0.0024282767,0.0037864374,0.0015086095],"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.000021069607,0.000034156063,0.00010198751,0.000046802066,0.000010392948,0.000114238675,0.0001307631,0.00275549,0.00064589345,0.9852181,0.001518449,0.00940263],"study_design_scores_gemma":[0.00001222334,0.000013362277,0.000058354177,0.0000123466125,0.000004737698,0.00009396119,0.000033791686,0.0066484474,0.00027765485,0.9841689,0.008667642,0.000008531443],"about_ca_topic_score_codex":0.00088917254,"about_ca_topic_score_gemma":0.00079461234,"teacher_disagreement_score":0.007100979,"about_ca_system_score_codex":0.0016666434,"about_ca_system_score_gemma":0.00096037664,"threshold_uncertainty_score":0.023755133},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071368136,0.0012199507,0.8830219,0.0017825224,0.00055915373,0.00036803135,0.0041305544,0.016089082,0.021460654],"genre_scores_gemma":[0.72488403,0.000523033,0.23958448,0.00094782683,0.00028589685,0.0011440347,0.005079127,0.00084671046,0.026704924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995958,0.00007954618,0.000017990738,0.0001777898,0.000068467365,0.000060351984],"domain_scores_gemma":[0.99944407,0.00024041858,0.000047790032,0.000077021774,0.00012513738,0.00006560479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010590213,0.0011836906,0.00073972164,0.0006724557,0.00054308,0.00172978,0.0028672132,0.0014694346,0.009002072],"category_scores_gemma":[0.0033166616,0.0007220299,0.0010499876,0.0004949579,0.0006441449,0.0016238776,0.0014978189,0.0023975587,0.0035566015],"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.0003155759,0.00017360324,0.0055819657,0.00010380391,0.0001439765,0.00010585509,0.00011121293,0.87467545,0.002281172,0.014438916,0.014922824,0.087145664],"study_design_scores_gemma":[0.000007865836,0.000020386244,0.00028006756,0.000005257917,0.000007038192,0.000010622267,0.000003932676,0.9944114,0.00026537897,0.0039432724,0.0010397435,0.000005027826],"about_ca_topic_score_codex":0.017562397,"about_ca_topic_score_gemma":0.025416391,"teacher_disagreement_score":0.017562397,"about_ca_system_score_codex":0.0014762889,"about_ca_system_score_gemma":0.0015611605,"threshold_uncertainty_score":0.034920335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9227818,0.00015242635,0.043226957,0.0006839123,0.00009940095,0.0009521769,0.0012356364,0.0002547935,0.030612832],"genre_scores_gemma":[0.97491145,0.000053422256,0.021735135,0.000103668164,0.00002349751,0.0005560381,0.0011346866,0.000031029376,0.0014511506],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99638075,0.0016458313,0.00039034418,0.00045838772,0.00092532556,0.0001994768],"domain_scores_gemma":[0.93507236,0.050666567,0.0048334366,0.003217694,0.004112264,0.0020977817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034876477,0.000759096,0.0004426628,0.0023405254,0.0006186388,0.001684888,0.0010959102,0.0012639831,0.0075213513],"category_scores_gemma":[0.059284493,0.00017111964,0.00084311736,0.0010669099,0.0016322396,0.0035234606,0.0013577556,0.0016102062,0.00061135046],"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.006980687,0.009128994,0.4952403,0.0013616496,0.0006216963,0.00022695611,0.0049722213,0.019947972,0.017004432,0.109827735,0.009638214,0.32504922],"study_design_scores_gemma":[0.0009829279,0.008638028,0.44687364,0.00039796752,0.00034666384,0.00044927784,0.0065430417,0.39389843,0.01236374,0.12016677,0.009159876,0.00017966941],"about_ca_topic_score_codex":0.0027078642,"about_ca_topic_score_gemma":0.0021577566,"teacher_disagreement_score":0.0075213513,"about_ca_system_score_codex":0.00085199013,"about_ca_system_score_gemma":0.0010312771,"threshold_uncertainty_score":0.025161445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60946465,0.00020084412,0.17445153,0.001732099,0.00066496985,0.0004021555,0.0017011877,0.0013548953,0.21002756],"genre_scores_gemma":[0.9373413,0.000080439706,0.0369782,0.00023477427,0.000027842549,0.00015686943,0.00059160986,0.0001381037,0.024450887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00031265419,0.00004618806,0.000144949,0.00016760489,0.00019046316],"domain_scores_gemma":[0.99897695,0.0004996342,0.00006256184,0.00014119504,0.00009627564,0.00022353335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047975045,0.0006353323,0.0006598416,0.00026940284,0.00084572315,0.0014819736,0.0010068753,0.0009209487,0.018877378],"category_scores_gemma":[0.0033899427,0.00022445188,0.00046233446,0.0003642739,0.0010820775,0.0016010785,0.0015371185,0.000726427,0.0011629697],"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.004155146,0.00032756286,0.0026567294,0.00036290335,0.00013437435,0.0013507801,0.0008219245,0.21880297,0.014294801,0.68922615,0.02244788,0.045418806],"study_design_scores_gemma":[0.00032475623,0.00035684713,0.00072840834,0.000058335474,0.000026970718,0.00027376862,0.0004867341,0.6401079,0.0053307917,0.33001876,0.022235561,0.000051092375],"about_ca_topic_score_codex":0.004597111,"about_ca_topic_score_gemma":0.0055821296,"teacher_disagreement_score":0.018877378,"about_ca_system_score_codex":0.0011700123,"about_ca_system_score_gemma":0.0006609843,"threshold_uncertainty_score":0.06315112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05424356,0.00006465877,0.9338735,0.00018127327,0.000020459787,0.00019950788,0.00011179345,0.005202725,0.0061025745],"genre_scores_gemma":[0.5954486,0.000047986465,0.3996734,0.00011855477,0.000010948021,0.00032112066,0.00020112972,0.0003691578,0.0038091424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971265,0.0016849077,0.0001670038,0.000426853,0.00045970437,0.00013511757],"domain_scores_gemma":[0.9960846,0.0024284483,0.00043221866,0.000537934,0.0003212874,0.00019553337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023227932,0.00084811874,0.00045114543,0.0008251117,0.0007281746,0.0024095008,0.0010198754,0.0009904621,0.0028846804],"category_scores_gemma":[0.00834608,0.00056190515,0.0005671708,0.00034884413,0.0015138944,0.0026997237,0.002236097,0.0009469476,0.0008546628],"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.0010802073,0.00071105565,0.012715202,0.00085876655,0.000145776,0.0012572436,0.027322544,0.16744718,0.16271822,0.28952083,0.008407498,0.32781544],"study_design_scores_gemma":[0.000075770506,0.00035649317,0.0033609034,0.00012557629,0.00006184002,0.00035588138,0.0018338879,0.84956294,0.03199135,0.07990968,0.032247998,0.0001178143],"about_ca_topic_score_codex":0.001911127,"about_ca_topic_score_gemma":0.0034059368,"teacher_disagreement_score":0.0028846804,"about_ca_system_score_codex":0.0010815483,"about_ca_system_score_gemma":0.0010466734,"threshold_uncertainty_score":0.012284279},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02912989,0.0001219693,0.9646332,0.00010824715,0.000014386628,0.0001876167,0.00028034765,0.00092750293,0.0045967717],"genre_scores_gemma":[0.5219134,0.00030754396,0.47239074,0.00006392494,0.000020295502,0.00061540183,0.00059374,0.00025466058,0.0038402912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.00036762687,0.00012419428,0.00037505338,0.0005030559,0.00014395994],"domain_scores_gemma":[0.99698144,0.0017111971,0.00040751812,0.000333877,0.00044274202,0.00012320072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013312186,0.0010987326,0.00076359714,0.0018907315,0.00048656165,0.003078898,0.0018618142,0.0011813601,0.003655155],"category_scores_gemma":[0.007622895,0.0007947243,0.0014277337,0.00080507685,0.0015424951,0.002841545,0.0010962485,0.0011571556,0.0007586173],"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.00008259688,0.00012639185,0.0037213925,0.0001843129,0.000056867113,0.00014000379,0.00039978573,0.8977385,0.004282137,0.060071964,0.00071203883,0.03248407],"study_design_scores_gemma":[0.000014012,0.000052329044,0.00088396895,0.000029751855,0.000019479634,0.000058411013,0.000026184702,0.97894627,0.00089752907,0.017622678,0.001428854,0.00002050183],"about_ca_topic_score_codex":0.010546428,"about_ca_topic_score_gemma":0.008597605,"teacher_disagreement_score":0.010546428,"about_ca_system_score_codex":0.0018554635,"about_ca_system_score_gemma":0.001820813,"threshold_uncertainty_score":0.020970047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046011347,0.00028392012,0.86150414,0.0035534534,0.0005278826,0.0006248361,0.0016257247,0.0005925679,0.0852761],"genre_scores_gemma":[0.1534838,0.00043972794,0.80543494,0.00063658925,0.0002716031,0.0008278665,0.0023182963,0.00036788714,0.036219258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895823,0.00015793373,0.000068391986,0.00027638228,0.0002909548,0.0002481066],"domain_scores_gemma":[0.998965,0.00054085813,0.0000642549,0.00012765726,0.00021094305,0.000091234084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084826583,0.001288952,0.0011012255,0.0009140979,0.002014762,0.0021528157,0.0018885263,0.0031098952,0.022215884],"category_scores_gemma":[0.004868263,0.00058382686,0.0024979915,0.0010379332,0.0015359159,0.0026310096,0.0031659475,0.0036777803,0.003143105],"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.000096554744,0.0002657709,0.00044113563,0.00045832412,0.00006471125,0.0006775113,0.00036706217,0.06269399,0.0034844244,0.8361922,0.025511527,0.069746785],"study_design_scores_gemma":[0.0001244768,0.000076267825,0.00016911821,0.00007880509,0.00005275864,0.00029687653,0.00028434227,0.09682648,0.0020042637,0.8741067,0.02594345,0.000036429912],"about_ca_topic_score_codex":0.0017091727,"about_ca_topic_score_gemma":0.002844105,"teacher_disagreement_score":0.022215884,"about_ca_system_score_codex":0.00092733547,"about_ca_system_score_gemma":0.0029723197,"threshold_uncertainty_score":0.07431948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021302521,0.0010947314,0.9597476,0.00032101574,0.00011311889,0.0000695982,0.000029400006,0.00032743852,0.01699453],"genre_scores_gemma":[0.58668846,0.0010748571,0.39386237,0.0002677079,0.00009683165,0.00033049422,0.00009258131,0.00018262648,0.017404072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998573,0.000044980865,0.000005756113,0.000025824724,0.000043518776,0.000022663859],"domain_scores_gemma":[0.9996873,0.00022401936,0.000020621566,0.00001662439,0.000032923952,0.000018606488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042352828,0.0006592275,0.0006423827,0.0003393099,0.00045415093,0.0007762371,0.0017620139,0.0012231283,0.0034999875],"category_scores_gemma":[0.0015844045,0.0002954395,0.00043269395,0.00035200344,0.00077391684,0.00068169064,0.001006576,0.0011346007,0.0004317385],"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.000035534016,0.00006581679,0.00037684315,0.00008465465,0.00003353207,0.000046770718,0.00014357718,0.8272094,0.0027291426,0.07684921,0.0026051546,0.0898204],"study_design_scores_gemma":[0.000005566502,0.000010256306,0.00004945247,0.0000060672733,0.0000034067573,0.000012644826,0.000012766407,0.983042,0.00020400847,0.01588962,0.0007613964,0.0000027387198],"about_ca_topic_score_codex":0.003346525,"about_ca_topic_score_gemma":0.0036282865,"teacher_disagreement_score":0.0034999875,"about_ca_system_score_codex":0.00091950287,"about_ca_system_score_gemma":0.00056682085,"threshold_uncertainty_score":0.011708617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9245501,0.0006310793,0.04531498,0.0018346997,0.00004208152,0.00017233049,0.0018679199,0.0001599104,0.025426762],"genre_scores_gemma":[0.97597367,0.00025683185,0.016636698,0.00011144074,0.00005526622,0.000092975766,0.0015013643,0.000047615158,0.005324121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984946,0.00039790178,0.000084596904,0.00032914247,0.0003628822,0.00033079233],"domain_scores_gemma":[0.99105257,0.00723379,0.00052543246,0.00032835346,0.00030864874,0.0005511744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093994703,0.0006270108,0.00094002625,0.0010677299,0.0009613549,0.003394347,0.0014561233,0.0011979967,0.007271209],"category_scores_gemma":[0.008042796,0.00044963122,0.0010082124,0.0012537494,0.0015551153,0.0027087566,0.0014503249,0.001387417,0.00019306585],"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.00089990266,0.0004152925,0.018463777,0.00083434087,0.00034951197,0.0007557836,0.001044116,0.626042,0.006750219,0.2941831,0.012429859,0.037832055],"study_design_scores_gemma":[0.00022480685,0.000079822465,0.0051249266,0.000044740238,0.00004908517,0.00038965466,0.00039154533,0.6617996,0.0019974078,0.32558027,0.0042794724,0.0000386801],"about_ca_topic_score_codex":0.0054862406,"about_ca_topic_score_gemma":0.00492412,"teacher_disagreement_score":0.007271209,"about_ca_system_score_codex":0.002596165,"about_ca_system_score_gemma":0.0011177644,"threshold_uncertainty_score":0.024324596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929703,0.00044769284,0.0016977577,0.00026997336,0.00010038129,0.0001253202,0.00063092133,0.00008715491,0.003670498],"genre_scores_gemma":[0.99692446,0.00013734942,0.0013829331,0.00009106231,0.000034376506,0.00008678137,0.0006004576,0.00003909835,0.00070358143],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98259866,0.0076743956,0.0019067262,0.0016437931,0.0040740063,0.0021024775],"domain_scores_gemma":[0.6924922,0.24875732,0.025179103,0.010708306,0.010924768,0.011938336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020517062,0.00050976494,0.00056625094,0.0017675591,0.0007884916,0.0025223,0.0009871117,0.0007744801,0.0030301502],"category_scores_gemma":[0.14352629,0.00026803015,0.00066865043,0.0022115991,0.00087162235,0.0021499977,0.001272604,0.0018804149,0.00047189463],"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.02983587,0.008203328,0.5297475,0.0014918261,0.0012889077,0.00045609867,0.002646496,0.118833214,0.014421474,0.0057758833,0.00984328,0.27745607],"study_design_scores_gemma":[0.0016111374,0.021852378,0.8471642,0.0002775382,0.00067112735,0.00038473794,0.008087513,0.08155614,0.014679958,0.007405319,0.01599118,0.00031889114],"about_ca_topic_score_codex":0.0051017273,"about_ca_topic_score_gemma":0.0057647843,"teacher_disagreement_score":0.020517062,"about_ca_system_score_codex":0.0016167099,"about_ca_system_score_gemma":0.002556423,"threshold_uncertainty_score":0.108505905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08612234,0.0013926622,0.7500433,0.003869694,0.0006582668,0.0008915893,0.0009830116,0.0002837314,0.15575542],"genre_scores_gemma":[0.7958242,0.0016281115,0.15615205,0.0017659421,0.0004873001,0.0011645013,0.0009438238,0.00013787308,0.041896142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970824,0.0011751945,0.00013583252,0.00046802772,0.00057366793,0.00056485855],"domain_scores_gemma":[0.9961738,0.002461794,0.00023685682,0.00029094238,0.00039636783,0.00044012716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015960186,0.0015488192,0.0012255417,0.00072556286,0.0021068999,0.0031229462,0.0022664906,0.0019839457,0.0075430456],"category_scores_gemma":[0.0063046603,0.0004928373,0.0012097774,0.0011403537,0.0031652672,0.004068758,0.002596038,0.0032113225,0.0007700953],"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.000092053466,0.000073958494,0.00022510115,0.00007371901,0.000028991859,0.00006978697,0.00022038423,0.023455273,0.0005224501,0.960975,0.004155749,0.01010756],"study_design_scores_gemma":[0.00011265645,0.00006930233,0.0001545457,0.000032709104,0.000027516393,0.00010646192,0.00013366388,0.1306317,0.0005953048,0.8470516,0.021055633,0.000028931305],"about_ca_topic_score_codex":0.004706212,"about_ca_topic_score_gemma":0.0038473967,"teacher_disagreement_score":0.0075430456,"about_ca_system_score_codex":0.0033784616,"about_ca_system_score_gemma":0.0022220553,"threshold_uncertainty_score":0.025234044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64745164,0.004448902,0.082946636,0.0052633677,0.00100698,0.00065010984,0.0015134028,0.0009461479,0.2557728],"genre_scores_gemma":[0.9763155,0.00034116764,0.014685822,0.00039109858,0.00008413893,0.00023668699,0.0006779525,0.00035486245,0.0069128238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98830485,0.007584037,0.00050468737,0.00084203685,0.0022070636,0.0005573071],"domain_scores_gemma":[0.8750946,0.11342503,0.0023907274,0.0044379975,0.0034841667,0.0011675473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011390733,0.0012590477,0.0012597907,0.0022999605,0.0019901963,0.004014434,0.0026890836,0.0022867718,0.021538353],"category_scores_gemma":[0.08608143,0.0003610663,0.00094551634,0.0017565407,0.0062227077,0.010213729,0.0042854357,0.0028987676,0.0016002989],"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.021134209,0.0011947904,0.0115689095,0.0037251788,0.00057055167,0.00022261874,0.008575481,0.035025153,0.003202967,0.71256524,0.025451416,0.17676346],"study_design_scores_gemma":[0.0035798314,0.008876144,0.029911673,0.0017905226,0.0015843678,0.0006670806,0.02360728,0.20907134,0.008155243,0.6273921,0.085039414,0.00032509875],"about_ca_topic_score_codex":0.008177824,"about_ca_topic_score_gemma":0.011318577,"teacher_disagreement_score":0.021538353,"about_ca_system_score_codex":0.0036683416,"about_ca_system_score_gemma":0.001717074,"threshold_uncertainty_score":0.072052956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031051476,0.00044189324,0.88133395,0.0008651964,0.00023453511,0.00025344398,0.0003562772,0.00087971106,0.08458352],"genre_scores_gemma":[0.37843454,0.0005485629,0.5688814,0.0005511912,0.00021389956,0.00058739504,0.0010914976,0.0006968999,0.04899466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991001,0.00034387142,0.00003776795,0.00015899506,0.000178358,0.00018084496],"domain_scores_gemma":[0.9985039,0.0012008905,0.000052981097,0.00010172637,0.00007361831,0.00006692515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964053,0.0013261524,0.0012530402,0.00063624425,0.0011390721,0.002178585,0.0032026325,0.0013087398,0.01843554],"category_scores_gemma":[0.0038621947,0.0007926988,0.0019265725,0.0010560635,0.0014936663,0.0031570916,0.0027115548,0.0039507323,0.0017889896],"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.00026289586,0.00041948186,0.0004444329,0.0008536839,0.00018289384,0.00018177192,0.00034341982,0.3012265,0.0019546172,0.53862673,0.023691144,0.13181253],"study_design_scores_gemma":[0.00007987595,0.00006030836,0.00008910747,0.00004504628,0.000043744916,0.000057424004,0.00012637903,0.3617802,0.00073779153,0.63063437,0.0063265106,0.000019319476],"about_ca_topic_score_codex":0.004235578,"about_ca_topic_score_gemma":0.009300847,"teacher_disagreement_score":0.01843554,"about_ca_system_score_codex":0.0013188261,"about_ca_system_score_gemma":0.0016348633,"threshold_uncertainty_score":0.061673045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729408,0.001018923,0.006725007,0.0007636003,0.000042459007,0.000020569327,0.000083208746,0.000055829787,0.018349618],"genre_scores_gemma":[0.9978119,0.0001602074,0.0011272682,0.000094373565,0.000015765287,0.000010166551,0.00006428835,0.00001943288,0.0006965051],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980241,0.0005984421,0.00017794313,0.0003468687,0.0006751876,0.00017748908],"domain_scores_gemma":[0.9901506,0.0042563016,0.0015471793,0.0025760995,0.0010121885,0.00045764074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024883696,0.00030005426,0.00046222867,0.00085958757,0.0007102212,0.0034992027,0.00069940987,0.0006936762,0.004592682],"category_scores_gemma":[0.019871717,0.00038047964,0.0003423819,0.00041396555,0.00259085,0.003229843,0.0026802106,0.0008307529,0.00040212262],"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.0051902826,0.00041858284,0.2844191,0.0011602611,0.0005925248,0.0014291122,0.08021929,0.0017186414,0.14414929,0.051351916,0.0031076237,0.4262434],"study_design_scores_gemma":[0.00013161222,0.0012429664,0.789576,0.0005949664,0.0003418658,0.0026660857,0.0303899,0.003199968,0.034171805,0.115252644,0.022248143,0.0001840508],"about_ca_topic_score_codex":0.0008891149,"about_ca_topic_score_gemma":0.0007876502,"teacher_disagreement_score":0.004592682,"about_ca_system_score_codex":0.0004942745,"about_ca_system_score_gemma":0.0003458729,"threshold_uncertainty_score":0.015364051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53468966,0.0021827633,0.45311266,0.0007533,0.00014382735,0.00011784061,0.001064847,0.0012390448,0.0066959877],"genre_scores_gemma":[0.9258417,0.00042559352,0.07230379,0.000045646917,0.000055443605,0.000018224902,0.0003580388,0.00004098285,0.00091070693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.0002464086,0.00003818313,0.0001374364,0.00012391785,0.00004342556],"domain_scores_gemma":[0.9972404,0.0012765453,0.00043484155,0.00044422437,0.00044025612,0.0001637277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078024925,0.00046406614,0.00047309723,0.0047045685,0.00030403794,0.0014715658,0.00027968865,0.00035061705,0.0012137376],"category_scores_gemma":[0.0031712383,0.00012716302,0.00040783334,0.0023103498,0.00047223465,0.0010642557,0.00053422136,0.0004426261,0.00039376883],"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.0003833242,0.0002532157,0.1097698,0.000456177,0.00031986908,0.0005389009,0.0009832744,0.03775799,0.033212535,0.006497017,0.0037476516,0.80608016],"study_design_scores_gemma":[0.000019437895,0.00032165542,0.18385771,0.00014304169,0.00014391453,0.0010128951,0.0018839199,0.75238,0.016835982,0.03502823,0.008274056,0.000099211145],"about_ca_topic_score_codex":0.0016718705,"about_ca_topic_score_gemma":0.0032378756,"teacher_disagreement_score":0.0047045685,"about_ca_system_score_codex":0.00027859295,"about_ca_system_score_gemma":0.00023564011,"threshold_uncertainty_score":0.0041264296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026472496,0.00037186922,0.9672725,0.00038040584,0.00014374868,0.00008279304,0.000086336484,0.0003071462,0.0048826286],"genre_scores_gemma":[0.30788574,0.00031568712,0.6861816,0.0004030861,0.00012847621,0.00025630838,0.00034289874,0.0001486872,0.0043375283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.00017571115,0.000031614418,0.00012241898,0.00018211798,0.00006852324],"domain_scores_gemma":[0.9990415,0.00052054,0.00010353453,0.00011907503,0.00017131702,0.000044100263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012730925,0.0010456727,0.0015021897,0.0014182687,0.0006102674,0.0016854167,0.001400495,0.002263567,0.0024386388],"category_scores_gemma":[0.0030849443,0.00053028075,0.0015884989,0.0010455452,0.0005809823,0.0012516499,0.000709764,0.0016556414,0.00042994085],"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.000025057465,0.00004083248,0.00025873262,0.000029851124,0.000034670404,0.000031536198,0.000021854154,0.9727286,0.0010129298,0.004462548,0.0006295833,0.020723896],"study_design_scores_gemma":[0.000008838325,0.000012758651,0.000064735585,0.0000045932584,0.0000058288424,0.000008926259,0.000007390692,0.9978484,0.00019275674,0.0013529726,0.00048951583,0.0000033222418],"about_ca_topic_score_codex":0.0074046263,"about_ca_topic_score_gemma":0.00776652,"teacher_disagreement_score":0.0074046263,"about_ca_system_score_codex":0.0012049233,"about_ca_system_score_gemma":0.0015245881,"threshold_uncertainty_score":0.0147230625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47996926,0.00022107837,0.504391,0.00094037596,0.00013406639,0.00061803596,0.00024964055,0.0033098962,0.010166587],"genre_scores_gemma":[0.86746657,0.00006363077,0.1294053,0.000202622,0.000008669152,0.00031690847,0.00021336142,0.00012398291,0.0021989765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985885,0.00079127576,0.000066838395,0.00024634184,0.00018075545,0.00012639118],"domain_scores_gemma":[0.9937649,0.004515551,0.00042306853,0.000512725,0.00045013512,0.00033361773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003669408,0.00095423014,0.00080316653,0.00049256394,0.00065571634,0.0013841775,0.0019228898,0.0012871608,0.0031975203],"category_scores_gemma":[0.013688821,0.00040734315,0.00063718547,0.00023866569,0.0014175955,0.0027763098,0.0025022512,0.001700308,0.00045925775],"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.0007422439,0.0007384665,0.0076323617,0.00039451866,0.00013377979,0.0004610024,0.0010370904,0.87753516,0.0068231164,0.02236158,0.0023403333,0.07980033],"study_design_scores_gemma":[0.000028600542,0.00014126419,0.00023729334,0.00001077657,0.000014551581,0.00001982349,0.00007228402,0.9930784,0.0012218991,0.0044666473,0.0006959868,0.000012371694],"about_ca_topic_score_codex":0.009721257,"about_ca_topic_score_gemma":0.016023666,"teacher_disagreement_score":0.009721257,"about_ca_system_score_codex":0.0015081692,"about_ca_system_score_gemma":0.0025529903,"threshold_uncertainty_score":0.019405961},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729408,0.001018923,0.006725007,0.0007636003,0.000042459007,0.000020569327,0.000083208746,0.000055829787,0.018349618],"genre_scores_gemma":[0.9978119,0.0001602074,0.0011272682,0.000094373565,0.000015765287,0.000010166551,0.00006428835,0.00001943288,0.0006965051],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980241,0.0005984421,0.00017794313,0.0003468687,0.0006751876,0.00017748908],"domain_scores_gemma":[0.9901506,0.0042563016,0.0015471793,0.0025760995,0.0010121885,0.00045764074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024883696,0.00030005426,0.00046222867,0.00085958757,0.0007102212,0.0034992027,0.00069940987,0.0006936762,0.004592682],"category_scores_gemma":[0.019871717,0.00038047964,0.0003423819,0.00041396555,0.00259085,0.003229843,0.0026802106,0.0008307529,0.00040212262],"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.0051902826,0.00041858284,0.2844191,0.0011602611,0.0005925248,0.0014291122,0.08021929,0.0017186414,0.14414929,0.051351916,0.0031076237,0.4262434],"study_design_scores_gemma":[0.00013161222,0.0012429664,0.789576,0.0005949664,0.0003418658,0.0026660857,0.0303899,0.003199968,0.034171805,0.115252644,0.022248143,0.0001840508],"about_ca_topic_score_codex":0.0008891149,"about_ca_topic_score_gemma":0.0007876502,"teacher_disagreement_score":0.004592682,"about_ca_system_score_codex":0.0004942745,"about_ca_system_score_gemma":0.0003458729,"threshold_uncertainty_score":0.015364051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041717213,0.00008951345,0.93034375,0.00028302651,0.00015014202,0.00028128017,0.00017356226,0.0052646436,0.021696905],"genre_scores_gemma":[0.7491025,0.00007273952,0.23818731,0.00021572018,0.00004696166,0.00029766004,0.000579545,0.0010012222,0.010496441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00018178984,0.00002233324,0.00014220283,0.00021954575,0.00006881564],"domain_scores_gemma":[0.9985672,0.0007889716,0.00007755561,0.0002284849,0.00025192133,0.00008582725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095372,0.00077303126,0.00048155675,0.001048837,0.00052170444,0.0015762526,0.0017728346,0.00096530054,0.011911435],"category_scores_gemma":[0.0061406493,0.00041741462,0.00040527427,0.00050484267,0.00072225934,0.0019836354,0.0021112033,0.0012471516,0.0019380583],"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.001283512,0.001110927,0.0031922264,0.0003237068,0.00012528921,0.0003742302,0.0009827393,0.13521054,0.0604701,0.19078963,0.021577353,0.58455974],"study_design_scores_gemma":[0.00011080305,0.000096730626,0.0004251754,0.000026463453,0.00004101469,0.00006555003,0.00010064046,0.89637154,0.013080105,0.08234098,0.0073216204,0.00001937297],"about_ca_topic_score_codex":0.001448787,"about_ca_topic_score_gemma":0.0019361741,"teacher_disagreement_score":0.011911435,"about_ca_system_score_codex":0.0006285252,"about_ca_system_score_gemma":0.0006501718,"threshold_uncertainty_score":0.039847672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2012095,0.00020537408,0.77816784,0.00033345472,0.000055727545,0.00056596246,0.00008207019,0.0030607784,0.016319202],"genre_scores_gemma":[0.86390835,0.00007761827,0.13156976,0.000069069756,0.00001038,0.00023581577,0.00006359012,0.00005510304,0.0040102676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977535,0.00006111887,0.000009481794,0.000059091966,0.000059696285,0.000035153997],"domain_scores_gemma":[0.9993918,0.00034068397,0.00006531183,0.000052781237,0.00008644956,0.000062925676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052268896,0.00060212536,0.00037564282,0.00017743694,0.00024111736,0.0005761346,0.0008395087,0.00048618196,0.0020650132],"category_scores_gemma":[0.0020053287,0.0002450854,0.00023966514,0.00011449385,0.0004935203,0.000593576,0.00075274426,0.0008743386,0.0003580567],"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.00052295683,0.0006838111,0.0032737993,0.00012440294,0.00006343491,0.00014615897,0.00022175784,0.8078536,0.013305818,0.005794578,0.0011866447,0.16682303],"study_design_scores_gemma":[0.00005250159,0.00016301246,0.0003538078,0.000007943286,0.0000072006274,0.000020122567,0.000017734832,0.9937849,0.002742281,0.0016913072,0.0011511596,0.000008012865],"about_ca_topic_score_codex":0.010160187,"about_ca_topic_score_gemma":0.010285088,"teacher_disagreement_score":0.010160187,"about_ca_system_score_codex":0.00051756686,"about_ca_system_score_gemma":0.0009672886,"threshold_uncertainty_score":0.0202021},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4604767,0.00123218,0.38509434,0.0012040867,0.0001436318,0.00044363493,0.00020184138,0.00089421775,0.1503094],"genre_scores_gemma":[0.9117722,0.00021881537,0.0800921,0.00011414239,0.00002363012,0.00018822955,0.0001734232,0.00009731909,0.0073201554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725574,0.0016139002,0.00014523328,0.00052480784,0.0003181682,0.0001421394],"domain_scores_gemma":[0.9934476,0.0046573225,0.0007242577,0.0005096829,0.0002885903,0.0003724261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023590005,0.0010719085,0.00035067636,0.0010490712,0.0008433661,0.0036731546,0.0012585861,0.0009878894,0.009506038],"category_scores_gemma":[0.014666094,0.0004070961,0.0006375496,0.00043358703,0.0029595261,0.006196665,0.0028870269,0.0011862443,0.0007245747],"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.0014751023,0.0004887381,0.018313294,0.0009997798,0.00018661191,0.0013213976,0.06975227,0.0067854635,0.021394081,0.5241186,0.0046947687,0.3504699],"study_design_scores_gemma":[0.00042259792,0.00094358576,0.01953569,0.00063027436,0.00023612344,0.0016615475,0.027176261,0.09747685,0.013068366,0.75363654,0.08501408,0.00019803309],"about_ca_topic_score_codex":0.0008149577,"about_ca_topic_score_gemma":0.0010667152,"teacher_disagreement_score":0.009506038,"about_ca_system_score_codex":0.0006799375,"about_ca_system_score_gemma":0.00052355585,"threshold_uncertainty_score":0.031800866},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016484548,0.5328466,0.029837787,0.010063254,0.05566733,0.00021892236,0.006643774,0.0016759742,0.36139792],"genre_scores_gemma":[0.02056678,0.5338139,0.026354376,0.014239319,0.06143272,0.0008311271,0.021672565,0.0027212796,0.31836787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989994,0.00016686795,0.00011426111,0.0001991837,0.0004239728,0.00009632979],"domain_scores_gemma":[0.9976572,0.0010695783,0.0001449922,0.00017433945,0.0006934648,0.00026038583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072099123,0.0022315579,0.001583688,0.0138566615,0.0014849867,0.0043531526,0.0012884088,0.0013296354,0.06083568],"category_scores_gemma":[0.0046392446,0.0006697273,0.0011887855,0.022541074,0.00132114,0.0053382963,0.0023817408,0.0032169216,0.04023662],"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.0000333215,0.000041613795,0.00013018514,0.0012138207,0.000019120478,0.00007873314,0.00011343011,0.0007123139,0.00026547385,0.039507233,0.83223367,0.12565126],"study_design_scores_gemma":[0.000004029718,0.000012931329,0.00031417466,0.000766396,0.00000902241,0.00015806587,0.00004089605,0.00018101752,0.00005653254,0.013670802,0.98477244,0.00001367781],"about_ca_topic_score_codex":0.0024936397,"about_ca_topic_score_gemma":0.003950734,"teacher_disagreement_score":0.06083568,"about_ca_system_score_codex":0.0018429987,"about_ca_system_score_gemma":0.0013425363,"threshold_uncertainty_score":0.20351565},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040381484,0.04475657,0.43777084,0.05429145,0.0052534775,0.0004926617,0.0019682203,0.00052189885,0.41456348],"genre_scores_gemma":[0.5465163,0.036154967,0.25212595,0.009717872,0.015552593,0.0019179146,0.0052980725,0.0007752302,0.13194112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948571,0.0021395946,0.0002563144,0.0010105568,0.0012208105,0.0005156969],"domain_scores_gemma":[0.9888553,0.0090561155,0.0003280144,0.00057792146,0.00084497937,0.00033757635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038366076,0.001729133,0.0022876922,0.0024531086,0.0031678786,0.0074126665,0.0027618587,0.0036260672,0.019690854],"category_scores_gemma":[0.0168497,0.0009519437,0.0026154076,0.0031586601,0.0073167463,0.008993372,0.0035538075,0.009887835,0.003001746],"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.000019727466,0.00003968984,0.00010382353,0.00019319307,0.000030756426,0.000056035522,0.00021110066,0.003479539,0.000066591696,0.9639066,0.017516324,0.014376724],"study_design_scores_gemma":[0.000011922242,0.0000076085803,0.00004085668,0.000042658154,0.000004480077,0.00003561361,0.000054759945,0.0049675163,0.000036194637,0.9833536,0.01143675,0.000008034285],"about_ca_topic_score_codex":0.0024463988,"about_ca_topic_score_gemma":0.0015865277,"teacher_disagreement_score":0.019690854,"about_ca_system_score_codex":0.004758667,"about_ca_system_score_gemma":0.002090602,"threshold_uncertainty_score":0.06587243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3613044,0.0015940337,0.4769238,0.0023958874,0.0003000312,0.00018761783,0.0008556763,0.00072974747,0.15570876],"genre_scores_gemma":[0.92637455,0.00055731507,0.057315703,0.00059128273,0.00016562482,0.00011691544,0.00045417072,0.00015020602,0.0142741185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794096,0.0005038771,0.0001906996,0.00054016686,0.00056053686,0.0002636739],"domain_scores_gemma":[0.9965959,0.0019141026,0.0003522889,0.0006172782,0.00029727636,0.00022324911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043613,0.00057041977,0.0010360877,0.00081126654,0.0013005678,0.002555657,0.001346665,0.0010291468,0.0059192954],"category_scores_gemma":[0.0068123466,0.00037230286,0.0012405544,0.0008645567,0.004411537,0.0040314016,0.0016287094,0.002818021,0.00097120035],"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.00006190097,0.000035238405,0.0005688264,0.00006993032,0.000013154815,0.000110136985,0.00036042716,0.0030424227,0.0011011009,0.98267406,0.00092166365,0.011041127],"study_design_scores_gemma":[0.000013805698,0.000028470695,0.00030799478,0.000020415586,0.000008528202,0.00014633551,0.000075842676,0.011016266,0.0008290737,0.98344225,0.0040874803,0.000023573903],"about_ca_topic_score_codex":0.0017757278,"about_ca_topic_score_gemma":0.0012204691,"teacher_disagreement_score":0.0059192954,"about_ca_system_score_codex":0.0011344872,"about_ca_system_score_gemma":0.00064244884,"threshold_uncertainty_score":0.019802034},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034652033,0.0018105921,0.00412481,0.00294151,0.0047668116,0.000114139424,0.0020934313,0.00083789055,0.98296434],"genre_scores_gemma":[0.0011537526,0.00093208125,0.0009873039,0.00088626996,0.00065493665,0.000060518123,0.0013918246,0.0002117201,0.9937215],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938154,0.00006111286,0.000019463709,0.00012787135,0.00033677308,0.000073287614],"domain_scores_gemma":[0.99918026,0.000096721094,0.00002669647,0.00011403271,0.00037339356,0.00020890978],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005879309,0.0008847522,0.00052205636,0.0014674272,0.00135896,0.0042117885,0.0015457305,0.0017504811,0.65266204],"category_scores_gemma":[0.0021764298,0.00029797436,0.00049232616,0.0012631953,0.00053855457,0.0027914336,0.0023910473,0.0017345613,0.56829786],"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.00002329882,0.000032820088,0.00008390356,0.00012038773,0.000001876416,0.000036045298,0.00009392917,0.00009830915,0.0003619399,0.03249452,0.8268789,0.13977408],"study_design_scores_gemma":[0.0000017002808,0.0000047325157,0.000051378498,0.000039363105,6.751939e-7,0.00001862375,0.000025463882,0.00001872139,0.00006027677,0.0030435687,0.9967338,0.0000018723666],"about_ca_topic_score_codex":0.002073801,"about_ca_topic_score_gemma":0.0035618606,"teacher_disagreement_score":0.65266204,"about_ca_system_score_codex":0.0013376048,"about_ca_system_score_gemma":0.0019221945,"threshold_uncertainty_score":0.49543542},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97451496,0.00006763729,0.021487787,0.00023921867,0.000007889713,0.000048504935,0.000030715568,0.000038041144,0.003565244],"genre_scores_gemma":[0.99797827,0.000018496688,0.0017456779,0.000014908331,0.0000043891105,0.000018342176,0.0000072844314,0.0000035787634,0.00020908036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469537,0.0035151902,0.00021081809,0.00046758723,0.0007048395,0.00040626174],"domain_scores_gemma":[0.9422617,0.043336604,0.007866518,0.0038323929,0.0012540108,0.0014488065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061304695,0.0005221489,0.0009409712,0.00066087814,0.00033413296,0.0015746317,0.0004944389,0.00059281365,0.0020453269],"category_scores_gemma":[0.03472227,0.00038833148,0.00036134195,0.00042629748,0.0016089588,0.0016623258,0.0010874164,0.00094550557,0.00012261061],"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.00728243,0.0024773392,0.098371424,0.00087942195,0.0009615278,0.0013987413,0.0025077104,0.23701406,0.10169477,0.43511516,0.0022550463,0.11004229],"study_design_scores_gemma":[0.001004699,0.002226392,0.05799509,0.00006532441,0.00018081686,0.00032988426,0.0003969923,0.6534081,0.014934508,0.2682112,0.0011049724,0.00014205382],"about_ca_topic_score_codex":0.0007095392,"about_ca_topic_score_gemma":0.00058158865,"teacher_disagreement_score":0.0061304695,"about_ca_system_score_codex":0.001092434,"about_ca_system_score_gemma":0.0007260965,"threshold_uncertainty_score":0.03242141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99945897,0.000007679895,0.00023064794,0.0000038476805,6.797054e-7,0.0000094496045,0.000018208093,0.000004325676,0.00026615328],"genre_scores_gemma":[0.9988319,0.000011730863,0.00061359117,0.000006058599,0.0000011311415,0.000018050361,0.00009422999,0.0000062253084,0.00041712102],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99890006,0.0004217784,0.00014595453,0.00017259557,0.00027483728,0.00008467089],"domain_scores_gemma":[0.97961557,0.011051939,0.0059594586,0.0014145995,0.0008930066,0.0010653276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002365577,0.00045656328,0.0002655623,0.00077591947,0.00017873425,0.001466001,0.00035090963,0.00056606473,0.0020154812],"category_scores_gemma":[0.0307186,0.00025113267,0.0002202201,0.00023829007,0.00061928655,0.0007382671,0.0008268944,0.0005433951,0.00045411137],"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.0032007226,0.0029254365,0.92376983,0.00017226586,0.00018894135,0.0002821147,0.0081147235,0.0036109746,0.020199617,0.00045038137,0.00037945466,0.036705356],"study_design_scores_gemma":[0.000060353133,0.0016902654,0.9816558,0.000026861806,0.000045313504,0.00026302302,0.0017958332,0.008895083,0.0042896443,0.0007092826,0.0005137842,0.000054777287],"about_ca_topic_score_codex":0.0018327308,"about_ca_topic_score_gemma":0.0021071585,"teacher_disagreement_score":0.002365577,"about_ca_system_score_codex":0.00040233563,"about_ca_system_score_gemma":0.0001999389,"threshold_uncertainty_score":0.0125104785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20544246,0.00028584193,0.6456349,0.0008430247,0.0002823041,0.0010857192,0.0018000989,0.08260581,0.062019877],"genre_scores_gemma":[0.37038627,0.00018081244,0.5984484,0.00017058743,0.000030024878,0.00032179212,0.0040919143,0.00554652,0.020823695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909675,0.00019219487,0.000060598846,0.00022961377,0.00024342557,0.00017735125],"domain_scores_gemma":[0.99908686,0.00019937087,0.000046631685,0.00032073748,0.0001437741,0.00020263744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017891942,0.0006159105,0.00023782748,0.0006101918,0.0008354556,0.0021362435,0.0010119958,0.00037937352,0.006709709],"category_scores_gemma":[0.0027374302,0.0004659245,0.0006094345,0.00036215843,0.00065265974,0.0016211693,0.0026844111,0.0009827155,0.0018114797],"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.0017643953,0.00083031517,0.014921769,0.00055801054,0.00013042518,0.002350753,0.016229315,0.06693482,0.10438609,0.092652805,0.061896276,0.637345],"study_design_scores_gemma":[0.00031218785,0.00061651,0.01641539,0.00021758191,0.00006767322,0.0007203884,0.00432043,0.29059806,0.09412238,0.03796499,0.5544539,0.00019053016],"about_ca_topic_score_codex":0.012384863,"about_ca_topic_score_gemma":0.015058631,"teacher_disagreement_score":0.012384863,"about_ca_system_score_codex":0.0014544091,"about_ca_system_score_gemma":0.0020274702,"threshold_uncertainty_score":0.02462554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014512544,0.0006203319,0.56971925,0.0026780607,0.00021286026,0.00026819378,0.00017605528,0.00023120179,0.41158158],"genre_scores_gemma":[0.67548084,0.0010282798,0.2700921,0.0008474354,0.00010260126,0.00071564375,0.00021725369,0.00013526792,0.051380605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9976718,0.0017205192,0.0000622611,0.00020679155,0.000211812,0.00012677931],"domain_scores_gemma":[0.9989213,0.00071404345,0.0000578451,0.00012369167,0.000101030666,0.000082189385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719009,0.0006142872,0.0002783161,0.0010741737,0.0023067861,0.0034017796,0.0014376821,0.0010564785,0.011950913],"category_scores_gemma":[0.0033097067,0.00030090366,0.0003680047,0.00072719617,0.008327013,0.004291377,0.0030614806,0.0020344064,0.0007965128],"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.000005489749,0.000011820452,0.00008731217,0.000014029961,0.0000013697606,0.000038255774,0.0021497738,0.0007371772,0.00011081727,0.99178946,0.0006844034,0.004370033],"study_design_scores_gemma":[0.000015840826,0.000035274625,0.0003284329,0.00011381556,0.000005314211,0.00015007988,0.0033670107,0.009453435,0.0004578931,0.85527474,0.13077763,0.000020522948],"about_ca_topic_score_codex":0.008168671,"about_ca_topic_score_gemma":0.010520753,"teacher_disagreement_score":0.011950913,"about_ca_system_score_codex":0.0027683883,"about_ca_system_score_gemma":0.0021041818,"threshold_uncertainty_score":0.039979756},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042836346,0.01325977,0.019277968,0.02045834,0.0020408672,0.000021851398,0.00004327885,0.000069954214,0.9019917],"genre_scores_gemma":[0.83387256,0.004374605,0.005538039,0.0032922614,0.0008096583,0.000046063018,0.000036612702,0.000098512006,0.15193164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897575,0.0005683299,0.000028272147,0.00012365676,0.00017015329,0.00013393891],"domain_scores_gemma":[0.9990953,0.00055529614,0.000057693193,0.000048152735,0.00010598942,0.00013759232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011674588,0.00042311227,0.00024086093,0.000658715,0.0035604697,0.0035932662,0.00051486754,0.001157084,0.0068903426],"category_scores_gemma":[0.0031160822,0.00012937817,0.00018624868,0.0005394935,0.011296842,0.005939988,0.0018433899,0.0023365058,0.00078880315],"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.000019286279,0.0000066206358,0.000095238065,0.0000140879565,0.0000010296963,0.00006415983,0.00310463,0.000062043844,0.000052887688,0.985897,0.004174834,0.0065083033],"study_design_scores_gemma":[0.000014842405,0.0000393918,0.00036047894,0.00011920574,0.000003949037,0.00026884547,0.0029845822,0.0006441959,0.0001888489,0.5746948,0.42066544,0.000015499445],"about_ca_topic_score_codex":0.0050792783,"about_ca_topic_score_gemma":0.007034931,"teacher_disagreement_score":0.0068903426,"about_ca_system_score_codex":0.003027373,"about_ca_system_score_gemma":0.00096891297,"threshold_uncertainty_score":0.023050547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27701744,0.008220498,0.550363,0.005358754,0.00094299146,0.0014567347,0.022535607,0.089089565,0.04501531],"genre_scores_gemma":[0.5733433,0.0011139824,0.39160866,0.0011711397,0.00009245399,0.00045786708,0.024727477,0.0012575991,0.0062275147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824995,0.00062323053,0.00010559276,0.00046719765,0.0003942943,0.00015979621],"domain_scores_gemma":[0.99491996,0.003592244,0.00024114527,0.00068100094,0.00036616117,0.00019959033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023169916,0.0021925473,0.0007443655,0.001510335,0.0007631141,0.0023090215,0.0042007137,0.002692065,0.008130567],"category_scores_gemma":[0.013529622,0.0005686735,0.0013926692,0.0007747437,0.0012515147,0.003986223,0.002543695,0.0025143344,0.0015361176],"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.0018085678,0.00093675085,0.009062033,0.003243955,0.0005266996,0.0010036977,0.00083843374,0.4480977,0.010114686,0.041059405,0.106732085,0.37657595],"study_design_scores_gemma":[0.00013862415,0.00015104329,0.0008848948,0.00011900552,0.00003521149,0.00015569263,0.00017695398,0.9521605,0.0047307694,0.028588882,0.012829995,0.000028391072],"about_ca_topic_score_codex":0.022858866,"about_ca_topic_score_gemma":0.034504216,"teacher_disagreement_score":0.022858866,"about_ca_system_score_codex":0.002000283,"about_ca_system_score_gemma":0.0024894953,"threshold_uncertainty_score":0.04545158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016876135,0.00024241822,0.9933221,0.000046939105,0.00004409857,0.00007988594,0.00024795104,0.0040193745,0.0003096221],"genre_scores_gemma":[0.071675025,0.0003881114,0.92383546,0.000092577204,0.00009838791,0.00038259674,0.0011435308,0.0008959141,0.0014883905],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970958,0.00072789966,0.00031710457,0.0007210834,0.0009330761,0.0002049868],"domain_scores_gemma":[0.9946243,0.0022833045,0.00059368927,0.0014133016,0.0007914132,0.00029393082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032429087,0.0018442878,0.0020184019,0.002978041,0.0008757643,0.0024374723,0.004452434,0.0013475117,0.0047910726],"category_scores_gemma":[0.017304052,0.0012884757,0.0019150778,0.0027154582,0.0009930719,0.005276914,0.0042043696,0.0030191492,0.0019405402],"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.0010923469,0.0002705556,0.0057572518,0.0006143868,0.00037572676,0.00034127524,0.0005472326,0.28934708,0.01600813,0.05656144,0.016600125,0.61248446],"study_design_scores_gemma":[0.000042690812,0.00005492357,0.00043671325,0.00003507614,0.0000276197,0.00010289698,0.00004407471,0.97131574,0.0038967084,0.01831932,0.0056814603,0.00004272242],"about_ca_topic_score_codex":0.007306678,"about_ca_topic_score_gemma":0.008984957,"teacher_disagreement_score":0.007306678,"about_ca_system_score_codex":0.0011309907,"about_ca_system_score_gemma":0.002385941,"threshold_uncertainty_score":0.017150342},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014012804,0.05035367,0.0022222092,0.40301147,0.056146797,0.000022591516,0.0002523427,0.00020320616,0.48638645],"genre_scores_gemma":[0.027988477,0.0120342085,0.0010478949,0.08353213,0.008168135,0.000038221897,0.00010804248,0.00036481055,0.86671805],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988325,0.000362503,0.000043734824,0.00024998197,0.00033655117,0.00017478838],"domain_scores_gemma":[0.99775416,0.00062557915,0.00008941122,0.00017927622,0.0009027062,0.0004489433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013195926,0.00051148236,0.00043039274,0.0014328205,0.0057262136,0.0062898393,0.0009194416,0.0025012363,0.069502786],"category_scores_gemma":[0.007562468,0.00028146512,0.00022909044,0.0011091094,0.003918732,0.0047488175,0.002483076,0.0072248285,0.028979326],"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.000015037742,0.00000967964,0.000064379936,0.000029987259,0.000002069539,0.00002449039,0.00032753343,0.00002248207,0.000038580303,0.09048441,0.8895989,0.019382393],"study_design_scores_gemma":[0.0000027970814,0.0000037970533,0.00006164563,0.000084506326,0.0000014041369,0.000028814688,0.000274934,0.000024325429,0.000030774867,0.010581228,0.9889002,0.0000055597006],"about_ca_topic_score_codex":0.036084864,"about_ca_topic_score_gemma":0.0676758,"teacher_disagreement_score":0.069502786,"about_ca_system_score_codex":0.00475125,"about_ca_system_score_gemma":0.0039494694,"threshold_uncertainty_score":0.23250997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480138,0.00020974911,0.02608877,0.00042228794,0.00013249759,0.00006565008,0.0003794268,0.0003342738,0.024353657],"genre_scores_gemma":[0.9882583,0.000063404084,0.0064716563,0.00014468853,0.000016216707,0.00010910504,0.0003166364,0.000118199394,0.004501762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997696,0.000045339628,0.0000069566654,0.00004725802,0.00005174177,0.0000791275],"domain_scores_gemma":[0.9993832,0.00017295511,0.00005006161,0.00012459508,0.000108664026,0.00016051416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031198908,0.00044476174,0.0007613951,0.00045344324,0.0008385629,0.0013028682,0.0010712357,0.000984543,0.008800721],"category_scores_gemma":[0.0020408565,0.00045413952,0.0005970599,0.00032469732,0.0013366746,0.0012841882,0.0014899877,0.0007522986,0.00072727614],"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.0005916114,0.00022412013,0.005865964,0.0001582376,0.000116806346,0.0005472649,0.00033623935,0.8159051,0.021517979,0.13960579,0.0059857774,0.009145174],"study_design_scores_gemma":[0.0001109407,0.00014815762,0.000925602,0.0000188995,0.000017115328,0.00006752795,0.00013637001,0.9773795,0.0025968263,0.016640924,0.0019217726,0.00003632172],"about_ca_topic_score_codex":0.0056227604,"about_ca_topic_score_gemma":0.0035130957,"teacher_disagreement_score":0.008800721,"about_ca_system_score_codex":0.000685153,"about_ca_system_score_gemma":0.0008940029,"threshold_uncertainty_score":0.029441297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11033453,0.0021735355,0.7208894,0.010819054,0.000582108,0.00070248183,0.0011532215,0.0017215838,0.15162416],"genre_scores_gemma":[0.75542337,0.0013965212,0.22231384,0.00087738706,0.00014205636,0.00097039435,0.0006843163,0.0007506443,0.017441498],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99094146,0.007393976,0.00022358524,0.00049044087,0.00059095985,0.00035942896],"domain_scores_gemma":[0.98245966,0.01374153,0.00072353194,0.0015440044,0.00086941745,0.0006619315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007495288,0.0012831709,0.00044859943,0.0023289276,0.0033119218,0.012910242,0.0020703922,0.0017059271,0.010587108],"category_scores_gemma":[0.01893299,0.0006105126,0.0007667026,0.0023873432,0.007801156,0.009342381,0.008681077,0.002172211,0.0011354553],"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.00034430396,0.000119061144,0.0043394873,0.0012741308,0.00006766615,0.0022038405,0.47067806,0.004875256,0.006274818,0.4162216,0.011384229,0.08221752],"study_design_scores_gemma":[0.00011737651,0.00030226022,0.002022833,0.0021687206,0.00008514992,0.0019012339,0.19920991,0.021360299,0.009779861,0.20651123,0.5564244,0.00011676012],"about_ca_topic_score_codex":0.0015956789,"about_ca_topic_score_gemma":0.002583637,"teacher_disagreement_score":0.012910242,"about_ca_system_score_codex":0.002042342,"about_ca_system_score_gemma":0.0018369361,"threshold_uncertainty_score":0.039639354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9992016,0.00019160265,0.00008334209,0.0000078207395,0.0000035058797,0.0000027507467,0.00011341574,0.000006249674,0.000389691],"genre_scores_gemma":[0.99747354,0.00023037137,0.00024909442,0.000021456155,0.0000058874757,0.000016248277,0.00040032828,0.000017827246,0.0015851096],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998754,0.000017894388,0.000009568243,0.000039731192,0.000013499462,0.00004395528],"domain_scores_gemma":[0.99963677,0.000048534475,0.00008909166,0.000028766204,0.00003886296,0.0001579753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019628125,0.0003484398,0.0003667222,0.0020123885,0.0003379614,0.00044294455,0.0003020286,0.0002505847,0.0018931356],"category_scores_gemma":[0.00030243665,0.00016870486,0.0003354328,0.00030930585,0.0005530229,0.0002158251,0.00038133407,0.0003427934,0.00026685212],"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.0039013606,0.0001727062,0.052995596,0.00009283187,0.00012437438,0.00038037694,0.00057331665,0.00015219729,0.9351528,0.0006664061,0.00010749199,0.00568053],"study_design_scores_gemma":[0.00005604012,0.0012640096,0.93579566,0.000015572528,0.00013927018,0.0006809339,0.0007090938,0.00070600136,0.0595897,0.00020358684,0.0008156562,0.00002456685],"about_ca_topic_score_codex":0.003170084,"about_ca_topic_score_gemma":0.0040510083,"teacher_disagreement_score":0.003170084,"about_ca_system_score_codex":0.00034631466,"about_ca_system_score_gemma":0.00019415427,"threshold_uncertainty_score":0.0063331723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002723392,0.0012155551,0.9834019,0.0029984938,0.0002785825,0.00004982468,0.00007328511,0.0006236175,0.00863539],"genre_scores_gemma":[0.19623546,0.0028749404,0.7774035,0.0033052627,0.000707326,0.00053541834,0.00024748154,0.0017641184,0.016926527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725133,0.0013391848,0.000120413795,0.00048005866,0.0006634729,0.00014553711],"domain_scores_gemma":[0.9842032,0.010611506,0.00088078965,0.002989041,0.0010063706,0.00030906405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041324096,0.0020307445,0.0012638356,0.00090851565,0.0008789288,0.0032857503,0.0022472471,0.0032267757,0.013390915],"category_scores_gemma":[0.035120226,0.000981172,0.0015200921,0.0012482883,0.0039849775,0.008458159,0.0029592742,0.008941351,0.0036667278],"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.00022090737,0.00011425297,0.0010890784,0.0004097226,0.00008831404,0.0001373378,0.00021220683,0.10673798,0.002467276,0.769014,0.014848849,0.10466009],"study_design_scores_gemma":[0.000082632585,0.00013801688,0.0005353594,0.00018256978,0.000039629667,0.00014521847,0.0000529182,0.41503626,0.0029483065,0.55340785,0.027369088,0.00006217782],"about_ca_topic_score_codex":0.0027096816,"about_ca_topic_score_gemma":0.0022597504,"teacher_disagreement_score":0.013390915,"about_ca_system_score_codex":0.0013612703,"about_ca_system_score_gemma":0.0017935205,"threshold_uncertainty_score":0.044797122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10339489,0.0011648993,0.70231634,0.005364264,0.00041484876,0.00027217268,0.0002300157,0.0003568129,0.18648589],"genre_scores_gemma":[0.8998392,0.0005954903,0.08239985,0.0015870885,0.00020701933,0.00040056475,0.00031187938,0.00018785402,0.01447109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927987,0.003681535,0.00033504234,0.0010622512,0.0011238798,0.0009985599],"domain_scores_gemma":[0.9944267,0.003607229,0.00034443272,0.00072233524,0.00051385385,0.0003853715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036906046,0.001023235,0.0011460896,0.0015091067,0.0029783498,0.003961081,0.0017581944,0.0019232891,0.0064004087],"category_scores_gemma":[0.013578758,0.0004575337,0.0016970662,0.0011860743,0.010834963,0.010841011,0.0062704873,0.0055582584,0.0006314673],"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.000014745395,0.000018306262,0.00008532926,0.000012353181,0.0000057003613,0.00003199597,0.00025111352,0.0010293376,0.00012319093,0.9960698,0.0002887048,0.0020696113],"study_design_scores_gemma":[0.000011525436,0.000017996597,0.0000843591,0.0000149644475,0.0000057991183,0.000040429797,0.000120595796,0.005087575,0.0001790379,0.99098057,0.0034452733,0.00001189971],"about_ca_topic_score_codex":0.0047551636,"about_ca_topic_score_gemma":0.002281877,"teacher_disagreement_score":0.0064004087,"about_ca_system_score_codex":0.0030648499,"about_ca_system_score_gemma":0.0011770709,"threshold_uncertainty_score":0.022237182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4475199,0.00022225555,0.52156603,0.001140228,0.0002480114,0.0007841936,0.0005309328,0.0069895783,0.020998893],"genre_scores_gemma":[0.791941,0.00012443351,0.20105356,0.00019469531,0.000010239756,0.00044841736,0.00033060642,0.00031629892,0.0055807163],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996793,0.00010958803,0.000019334104,0.00005567019,0.00009353576,0.000042587413],"domain_scores_gemma":[0.99916744,0.00046864804,0.000049068833,0.00009838342,0.000063442225,0.00015296921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041820822,0.0006613419,0.00030693144,0.000265043,0.00033955518,0.0005095854,0.0015805922,0.0010740795,0.005081787],"category_scores_gemma":[0.0021650088,0.00027860358,0.0003358779,0.00011418639,0.00066744833,0.0006304113,0.0014823794,0.0012348632,0.0008498629],"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.0018727923,0.0032586365,0.0121212825,0.0011522835,0.0002562681,0.0059255646,0.003712143,0.21407515,0.5185759,0.039981242,0.01829459,0.18077424],"study_design_scores_gemma":[0.0005228885,0.0020807511,0.0070698657,0.00007769746,0.000038225087,0.0017481511,0.00032358803,0.8859801,0.06390822,0.012135049,0.026011406,0.000104033774],"about_ca_topic_score_codex":0.0019198952,"about_ca_topic_score_gemma":0.0017986267,"teacher_disagreement_score":0.005081787,"about_ca_system_score_codex":0.00023434419,"about_ca_system_score_gemma":0.00038219462,"threshold_uncertainty_score":0.017000198},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5992792,0.00014196093,0.38293377,0.0008608589,0.000085310334,0.00032699847,0.000106208296,0.0017632843,0.014502303],"genre_scores_gemma":[0.8269251,0.00012267142,0.16701116,0.00027785706,0.000015880198,0.00027945178,0.00015504961,0.0001285361,0.0050842664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999622,0.00016534439,0.000014652173,0.000070690854,0.00008706276,0.000040239505],"domain_scores_gemma":[0.99921787,0.0005304333,0.00005665363,0.0000626229,0.00005321289,0.00007908428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057534606,0.0007643401,0.00030282786,0.00029316844,0.00034859544,0.00083965954,0.0011251058,0.00075841235,0.002082945],"category_scores_gemma":[0.0033163796,0.00018137382,0.00036455705,0.0001487118,0.00080875534,0.0009750945,0.0012734636,0.0007547019,0.00035855232],"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.0030080725,0.0036404692,0.020179082,0.000952108,0.00052886363,0.0020404216,0.011172429,0.260224,0.1842256,0.06295595,0.011492186,0.43958077],"study_design_scores_gemma":[0.00049617165,0.0019399662,0.008690085,0.00006843359,0.00017758891,0.0008387726,0.0010700655,0.89684796,0.028494963,0.032934472,0.028307643,0.00013397574],"about_ca_topic_score_codex":0.0010861865,"about_ca_topic_score_gemma":0.0012237862,"teacher_disagreement_score":0.002082945,"about_ca_system_score_codex":0.00026339898,"about_ca_system_score_gemma":0.00027501548,"threshold_uncertainty_score":0.0069681406},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7297709,0.00041188858,0.2181574,0.0005601062,0.00041193393,0.0019881392,0.004885354,0.01520072,0.02861359],"genre_scores_gemma":[0.89510834,0.00021569051,0.09558357,0.00014419053,0.000018227034,0.00113408,0.0033673937,0.00045764263,0.003970856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992835,0.00033356046,0.000056065724,0.000090101224,0.00014897685,0.00008769289],"domain_scores_gemma":[0.9982369,0.00087741093,0.00012865718,0.00022097523,0.00020869484,0.0003273451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013327916,0.00072446937,0.00037298937,0.0005478136,0.0003772637,0.00064008206,0.0017076592,0.0006334317,0.0053089005],"category_scores_gemma":[0.003243089,0.000275636,0.00029777244,0.00030865308,0.0005946511,0.0008172246,0.0010542937,0.00073408015,0.00078693934],"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.0041876724,0.0053628134,0.037851803,0.0013402883,0.00042426272,0.0012799394,0.0016773477,0.65239424,0.13405831,0.026916703,0.03545017,0.09905643],"study_design_scores_gemma":[0.0005675307,0.0024438621,0.006565123,0.00007381485,0.000080435886,0.00018057664,0.00039782494,0.917347,0.03982514,0.0045007607,0.027924387,0.00009349199],"about_ca_topic_score_codex":0.003541847,"about_ca_topic_score_gemma":0.005258854,"teacher_disagreement_score":0.0053089005,"about_ca_system_score_codex":0.0008192276,"about_ca_system_score_gemma":0.0009192908,"threshold_uncertainty_score":0.017760038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16024667,0.00046211883,0.83203816,0.00078108226,0.000078522855,0.00013668285,0.00051368086,0.0025572896,0.0031856792],"genre_scores_gemma":[0.9448714,0.00012771846,0.05193661,0.00011915257,0.000028912877,0.00016067037,0.0005791677,0.00006387523,0.0021125404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994004,0.00022524537,0.000029250543,0.00020359142,0.00008522673,0.000056313653],"domain_scores_gemma":[0.99581736,0.003618495,0.00016562996,0.00017743271,0.00014535432,0.00007576803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012014227,0.00078619807,0.00059967506,0.00049086416,0.00031194327,0.0012268599,0.001119303,0.001116094,0.0025036752],"category_scores_gemma":[0.008294485,0.00077103236,0.0006761382,0.00039744133,0.0010165127,0.0018407631,0.00088277325,0.0019563772,0.00045085826],"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.00017273473,0.0001178552,0.0022953085,0.000057413006,0.000042251937,0.0000965146,0.000105035426,0.9501033,0.0008063924,0.0085692145,0.0007165745,0.03691733],"study_design_scores_gemma":[0.000006637356,0.00001184369,0.00008478114,0.0000030824594,0.0000024412789,0.0000033611695,0.0000039111096,0.9947272,0.00019704989,0.0048458925,0.000111686895,0.000002090645],"about_ca_topic_score_codex":0.00806195,"about_ca_topic_score_gemma":0.00983538,"teacher_disagreement_score":0.00806195,"about_ca_system_score_codex":0.0012579148,"about_ca_system_score_gemma":0.000632161,"threshold_uncertainty_score":0.016030014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15100943,0.00014043914,0.84020805,0.000106152474,0.00006106367,0.00011027633,0.000110953144,0.0038420004,0.0044115847],"genre_scores_gemma":[0.66879445,0.0000931653,0.32373005,0.00013546941,0.000017643277,0.0000966704,0.00035185606,0.0013480011,0.005432737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999629,0.00004262403,0.000018253913,0.000107827735,0.00013803628,0.00006429655],"domain_scores_gemma":[0.99903226,0.00034336947,0.0001225287,0.0002477935,0.00016361693,0.00009040302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043826527,0.00097568735,0.0005208364,0.0009012707,0.0005909799,0.0018122533,0.0011796785,0.000808236,0.0024216461],"category_scores_gemma":[0.0019963754,0.00057044456,0.00065079046,0.0003365956,0.0009736819,0.00090539176,0.0016403673,0.0007188555,0.00092699844],"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.0009278078,0.00027614192,0.01188505,0.00026337584,0.00012797852,0.0015242213,0.0025907953,0.25183702,0.3262073,0.021664232,0.0065073697,0.37618876],"study_design_scores_gemma":[0.00003398162,0.00019702864,0.0028714999,0.000047453523,0.00006623751,0.00047829014,0.00045317406,0.8923439,0.082335554,0.012530534,0.008588112,0.00005420401],"about_ca_topic_score_codex":0.003134022,"about_ca_topic_score_gemma":0.0048423777,"teacher_disagreement_score":0.003134022,"about_ca_system_score_codex":0.0006806825,"about_ca_system_score_gemma":0.00049513346,"threshold_uncertainty_score":0.008101225},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18309128,0.0007177984,0.7975813,0.0005992953,0.00006282822,0.0002506561,0.001488194,0.005164451,0.011044152],"genre_scores_gemma":[0.60877544,0.00026616827,0.38599572,0.00008918965,0.000021975706,0.00021405709,0.001333615,0.0009681555,0.0023356236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989171,0.00042530132,0.00006434662,0.00025776454,0.00023147457,0.00010407052],"domain_scores_gemma":[0.9959965,0.002613505,0.00030425968,0.0005044338,0.0003175459,0.00026378958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015693189,0.0009379037,0.00042721993,0.0030548251,0.00094808365,0.0041363304,0.0012601729,0.0011739832,0.005663575],"category_scores_gemma":[0.008679546,0.0006206069,0.0010177202,0.0010913144,0.0013362584,0.0038996171,0.0033483466,0.0015366538,0.00070015376],"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.0020448207,0.0005543994,0.06350938,0.0013610924,0.00031643859,0.0026346343,0.063816115,0.17970891,0.08036525,0.18835491,0.018125553,0.39920855],"study_design_scores_gemma":[0.00012617843,0.00027296913,0.02119763,0.000287572,0.00009019406,0.0013236994,0.011136636,0.7271439,0.021173162,0.14705616,0.06996716,0.00022470774],"about_ca_topic_score_codex":0.0034028473,"about_ca_topic_score_gemma":0.005726173,"teacher_disagreement_score":0.005663575,"about_ca_system_score_codex":0.0010593307,"about_ca_system_score_gemma":0.0005792202,"threshold_uncertainty_score":0.018946528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.764431,0.0007765951,0.22082588,0.000672006,0.00020358284,0.00039551166,0.0033426357,0.0042003463,0.0051524616],"genre_scores_gemma":[0.9311688,0.00011800658,0.06391774,0.00011030863,0.000043150954,0.00018196517,0.0027611211,0.00006176146,0.0016372345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934596,0.00014123751,0.000040457544,0.00022720451,0.00013813257,0.0001070372],"domain_scores_gemma":[0.99882716,0.0005758746,0.00019464036,0.00010007148,0.00019119121,0.00011102475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007891949,0.0012300654,0.0005154433,0.002144909,0.00032087317,0.000883963,0.00097162655,0.0010065214,0.0010446815],"category_scores_gemma":[0.0031884979,0.00024726187,0.00060153514,0.00090617326,0.00035087785,0.001073431,0.00075412425,0.0011531526,0.0007945225],"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.0008505251,0.002447754,0.22393237,0.00030257134,0.00034504512,0.0007189794,0.0008947865,0.118002094,0.031779774,0.0017149772,0.016180953,0.6028301],"study_design_scores_gemma":[0.000035703113,0.0003816021,0.06482247,0.00004234927,0.00004173265,0.00023767678,0.00041402137,0.92083377,0.007329843,0.0026997817,0.0031106959,0.00005033726],"about_ca_topic_score_codex":0.0042718067,"about_ca_topic_score_gemma":0.0070160097,"teacher_disagreement_score":0.0042718067,"about_ca_system_score_codex":0.0005199691,"about_ca_system_score_gemma":0.00034814977,"threshold_uncertainty_score":0.0084939},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021867668,0.00024914538,0.9369294,0.0001736193,0.0002085276,0.00053327956,0.0005648959,0.0055065206,0.033966944],"genre_scores_gemma":[0.36972758,0.00040622757,0.5970388,0.00019894345,0.000043359996,0.00081465975,0.0018272094,0.001968207,0.02797505],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918073,0.00009924208,0.00003704249,0.00015593835,0.00045890844,0.00006804987],"domain_scores_gemma":[0.9989611,0.00036107426,0.00006753908,0.00029386417,0.00026735262,0.000049148097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072586193,0.0010353724,0.00042814785,0.00074250397,0.00041775,0.001305514,0.0014773661,0.0008909714,0.017513372],"category_scores_gemma":[0.0034521946,0.0005069417,0.0007010511,0.00033012754,0.0006817923,0.0012690146,0.0018966916,0.0008223452,0.003949856],"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.00026372398,0.0003252615,0.0042372197,0.00085900404,0.00008721487,0.00069765,0.0005940137,0.2933198,0.062901676,0.119259104,0.020265333,0.49718997],"study_design_scores_gemma":[0.00007969936,0.00028005816,0.0009540798,0.00012609073,0.00003463387,0.00047484646,0.00016694196,0.8214074,0.03386982,0.04979663,0.09276268,0.00004713662],"about_ca_topic_score_codex":0.00093651126,"about_ca_topic_score_gemma":0.001556147,"teacher_disagreement_score":0.017513372,"about_ca_system_score_codex":0.00060062454,"about_ca_system_score_gemma":0.000799824,"threshold_uncertainty_score":0.058588028},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06742887,0.00019263319,0.9225489,0.00007521965,0.00006427138,0.00016542003,0.00016492952,0.0073877024,0.0019719938],"genre_scores_gemma":[0.47689596,0.00012292626,0.5187078,0.000072274546,0.000036057867,0.00016140779,0.00066394557,0.0010375639,0.0023019887],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994223,0.00011239173,0.00003933138,0.00019845803,0.00017403538,0.00005348924],"domain_scores_gemma":[0.9985682,0.00057621335,0.00014418061,0.00025337253,0.00035646523,0.000101516795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071382534,0.00083300605,0.0004985791,0.0010182036,0.00039026627,0.00082345866,0.001068658,0.00045667798,0.0026720145],"category_scores_gemma":[0.0046434104,0.0002816125,0.00038361712,0.0006749459,0.0003629077,0.0012333402,0.0011327405,0.00065314415,0.00066497474],"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.0005598432,0.00022939967,0.0035012113,0.00016217923,0.000044142165,0.00025190372,0.0005761829,0.06553742,0.102519184,0.0041638766,0.0042160214,0.81823856],"study_design_scores_gemma":[0.00007754583,0.0002473436,0.0025196283,0.000015586193,0.000037581845,0.00016512485,0.00012553185,0.927222,0.060967013,0.0040959395,0.004491856,0.00003478425],"about_ca_topic_score_codex":0.0035222385,"about_ca_topic_score_gemma":0.00418551,"teacher_disagreement_score":0.0035222385,"about_ca_system_score_codex":0.0004253381,"about_ca_system_score_gemma":0.0005905942,"threshold_uncertainty_score":0.008938789},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09550458,0.0007455619,0.8737348,0.00083279645,0.00012784057,0.00012788044,0.00021576234,0.00014000294,0.028570658],"genre_scores_gemma":[0.8883127,0.0007796174,0.0999554,0.00013937638,0.0001664808,0.00026615837,0.0001785414,0.000088430264,0.010113299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732697,0.0010300187,0.00016365104,0.0004812459,0.0006239924,0.0003742471],"domain_scores_gemma":[0.98648167,0.009627763,0.0015141087,0.0006538112,0.0006253214,0.0010974052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037337116,0.0011654445,0.0012638975,0.0017329818,0.001004467,0.00367654,0.0030818968,0.002027255,0.005050494],"category_scores_gemma":[0.019929487,0.0008669482,0.0011134403,0.0015007971,0.005111236,0.006958222,0.0019854645,0.0029106364,0.00058686105],"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.000071817405,0.000038643622,0.0006613036,0.000051163533,0.0000172163,0.00013803487,0.00020483434,0.08437372,0.0008010906,0.9094119,0.0002853221,0.003945107],"study_design_scores_gemma":[0.000048399237,0.0000755559,0.0003598419,0.000028938484,0.000015785432,0.000055188022,0.000084632564,0.37989348,0.00031832256,0.6174963,0.0015913236,0.000032289463],"about_ca_topic_score_codex":0.0040132217,"about_ca_topic_score_gemma":0.0019278115,"teacher_disagreement_score":0.005050494,"about_ca_system_score_codex":0.0022955234,"about_ca_system_score_gemma":0.0013267644,"threshold_uncertainty_score":0.019746006},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017335797,0.00017929377,0.96245027,0.00010943265,0.00013687238,0.00016860125,0.00033372067,0.015353823,0.0039321813],"genre_scores_gemma":[0.21116747,0.0002944185,0.7699648,0.00014294086,0.000049119895,0.00018823227,0.0020585477,0.0023868345,0.013747669],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966025,0.00005686252,0.000019015686,0.00012876336,0.00010424334,0.000030786603],"domain_scores_gemma":[0.9996972,0.00007245142,0.000028233268,0.00009276174,0.00007676062,0.00003264265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802742,0.00088675955,0.0005298675,0.00079080625,0.0004596263,0.001203811,0.0014528994,0.00069392944,0.0073675932],"category_scores_gemma":[0.001761214,0.00040966898,0.00087690743,0.0004107965,0.00058946974,0.0016749359,0.0014578286,0.0012501993,0.005774782],"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.00037044034,0.00023238074,0.0023378904,0.00045178112,0.0000979967,0.00034461694,0.00074467825,0.052170638,0.08435228,0.018087134,0.011264759,0.82954544],"study_design_scores_gemma":[0.00003584142,0.00017572266,0.00085185945,0.00004102011,0.000042599208,0.0004329413,0.00021494273,0.8786877,0.072142884,0.01090233,0.03643312,0.000038979324],"about_ca_topic_score_codex":0.0019157084,"about_ca_topic_score_gemma":0.0031998847,"teacher_disagreement_score":0.0073675932,"about_ca_system_score_codex":0.00044010088,"about_ca_system_score_gemma":0.0007489314,"threshold_uncertainty_score":0.024646997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049203314,0.00014372173,0.94030756,0.00033337745,0.00007621656,0.00018094848,0.00009953528,0.003077675,0.00657762],"genre_scores_gemma":[0.8071283,0.00008053681,0.18875864,0.00015588739,0.000036257985,0.00024101313,0.00013143131,0.00010278137,0.003365214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944085,0.00013885523,0.0000478614,0.00011952547,0.00018617386,0.00006659328],"domain_scores_gemma":[0.9989882,0.0004316579,0.00012221532,0.0001485898,0.00019584714,0.00011345177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010253931,0.000709111,0.00068286824,0.0004605688,0.00069288234,0.0013087066,0.0018670895,0.0008291321,0.0037705759],"category_scores_gemma":[0.0029548248,0.00041716028,0.00047062922,0.0003547575,0.00086879433,0.0012179636,0.001985563,0.0011051822,0.0007234625],"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.00013771228,0.00013543523,0.0015401476,0.000067442576,0.00006851131,0.00013751215,0.0001529809,0.91882396,0.0040289047,0.016903473,0.0015165242,0.05648744],"study_design_scores_gemma":[0.000006323366,0.000012087343,0.000049392303,0.0000021798767,0.0000030371455,0.0000074048507,0.000004486868,0.9972946,0.00037175635,0.0018395615,0.0004062327,0.0000029589912],"about_ca_topic_score_codex":0.0075688516,"about_ca_topic_score_gemma":0.007641693,"teacher_disagreement_score":0.0075688516,"about_ca_system_score_codex":0.0010061681,"about_ca_system_score_gemma":0.0012292466,"threshold_uncertainty_score":0.015049636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09571383,0.003443506,0.73622286,0.03381686,0.0006701866,0.00032447738,0.001976187,0.0017722428,0.12605985],"genre_scores_gemma":[0.8154621,0.0024209856,0.14751491,0.0056317663,0.00094484707,0.0006481477,0.0020757376,0.0014752548,0.023826212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943452,0.001887395,0.00030158056,0.0014609981,0.0013376374,0.0006671952],"domain_scores_gemma":[0.97584677,0.01946341,0.0008120178,0.002446555,0.0008164323,0.0006149219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003750413,0.0015604433,0.0027622879,0.0010950206,0.0033293448,0.008465916,0.0031308671,0.0029898966,0.01937154],"category_scores_gemma":[0.03270392,0.0010084271,0.0029910281,0.0016846779,0.007615784,0.025890823,0.005637229,0.01014959,0.0030033763],"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.00012644265,0.000102116595,0.000924818,0.0003860384,0.00009195294,0.00015291233,0.00034715087,0.0126589015,0.0008832619,0.95494473,0.010417309,0.018964328],"study_design_scores_gemma":[0.000015765117,0.0000145785425,0.0001118864,0.000032822434,0.00001807733,0.00006978308,0.00007334164,0.01491976,0.0003129128,0.98150396,0.0029146145,0.000012532218],"about_ca_topic_score_codex":0.0026145966,"about_ca_topic_score_gemma":0.003310737,"teacher_disagreement_score":0.01937154,"about_ca_system_score_codex":0.0026551445,"about_ca_system_score_gemma":0.002282307,"threshold_uncertainty_score":0.064804256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8374863,0.001637985,0.1373718,0.00074703543,0.0002654086,0.00032496764,0.0069407006,0.0024831234,0.012742724],"genre_scores_gemma":[0.9631999,0.00022128918,0.02640998,0.000074058014,0.00005311852,0.00008296762,0.0076662074,0.000027865512,0.0022646824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945086,0.0001347185,0.000035530633,0.0001543273,0.00013766991,0.000086962886],"domain_scores_gemma":[0.99845016,0.00078057114,0.00018824919,0.00010573427,0.00036635014,0.00010886489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080953335,0.0009925687,0.0005197468,0.0019893942,0.0002955057,0.0007481363,0.0008257602,0.00050883024,0.00227775],"category_scores_gemma":[0.0040946463,0.00014987699,0.000465734,0.0011006356,0.00021189587,0.00072942127,0.00042856965,0.000951624,0.0013902441],"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.0005884382,0.0016594266,0.25183937,0.00021447672,0.00033057472,0.00027198557,0.000103053586,0.28174785,0.0033171289,0.002117809,0.018881133,0.43892866],"study_design_scores_gemma":[0.000035203004,0.0002054553,0.035818543,0.000036976962,0.000029563831,0.00005070194,0.00006235512,0.95508444,0.0027089845,0.0033870286,0.0025566255,0.000024124187],"about_ca_topic_score_codex":0.011336713,"about_ca_topic_score_gemma":0.020085655,"teacher_disagreement_score":0.011336713,"about_ca_system_score_codex":0.0005881921,"about_ca_system_score_gemma":0.00060202007,"threshold_uncertainty_score":0.022541463},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8002763,0.0012874053,0.12771516,0.00031742128,0.00012882201,0.00064871134,0.042288415,0.0137740895,0.01356375],"genre_scores_gemma":[0.90506494,0.00024405494,0.062953465,0.000027849164,0.0000134124775,0.00018096677,0.029142981,0.00025277556,0.0021196492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927956,0.00012182116,0.00007169088,0.00015048042,0.00030925233,0.000067154375],"domain_scores_gemma":[0.99623173,0.0023043428,0.00028537054,0.00037729385,0.0006336478,0.00016757663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078806945,0.00061917887,0.00048296846,0.006523587,0.0005215165,0.0015208117,0.0009091062,0.0005923626,0.0035241884],"category_scores_gemma":[0.006434718,0.00023793112,0.00051634805,0.0029373849,0.00038024088,0.001700865,0.0009880668,0.0007420378,0.0013225973],"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.0021814478,0.001254257,0.22745581,0.0014093595,0.0005127884,0.00045565979,0.0017905006,0.08904874,0.024127817,0.008499899,0.024956586,0.6183072],"study_design_scores_gemma":[0.000097403594,0.0005149973,0.12918293,0.00018901097,0.00017073586,0.00028444512,0.002421337,0.8132403,0.025727054,0.008945438,0.019128509,0.00009776319],"about_ca_topic_score_codex":0.025073702,"about_ca_topic_score_gemma":0.04190024,"teacher_disagreement_score":0.025073702,"about_ca_system_score_codex":0.0010602868,"about_ca_system_score_gemma":0.00087033433,"threshold_uncertainty_score":0.04985553},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0515329,0.009774674,0.3217092,0.039471354,0.0035342118,0.00013610568,0.00048169555,0.001844963,0.5715149],"genre_scores_gemma":[0.8964509,0.0029506912,0.043203063,0.004321364,0.000687386,0.0001092101,0.00024141236,0.0006906014,0.0513454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981834,0.0009322854,0.000050129853,0.0003197801,0.00031020024,0.00020421688],"domain_scores_gemma":[0.99576193,0.0023575851,0.000317036,0.00074792677,0.00052629097,0.00028915005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019686467,0.00084519986,0.00054187677,0.0009633968,0.00312063,0.0057417746,0.0013924171,0.002304416,0.027046371],"category_scores_gemma":[0.017050304,0.0004213941,0.0006375062,0.00079664605,0.014188138,0.01488982,0.0037400082,0.0030086937,0.004925106],"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.00015492138,0.000022971844,0.0006500259,0.00015326127,0.000018220988,0.00015158324,0.0030375759,0.0014114089,0.00036776336,0.93868035,0.011217364,0.04413453],"study_design_scores_gemma":[0.000020904241,0.000027109381,0.00016408593,0.00013506674,0.000007850874,0.00013200438,0.0010267594,0.0016004568,0.0003086409,0.93271786,0.06383701,0.000022225131],"about_ca_topic_score_codex":0.0018754936,"about_ca_topic_score_gemma":0.001367001,"teacher_disagreement_score":0.027046371,"about_ca_system_score_codex":0.0012498338,"about_ca_system_score_gemma":0.0008334344,"threshold_uncertainty_score":0.090479136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5942201,0.0003211758,0.3748152,0.0009863015,0.00039503677,0.0010753507,0.0012816609,0.010782569,0.016122637],"genre_scores_gemma":[0.883544,0.0000800694,0.107054435,0.00023480976,0.000023970724,0.0002487312,0.00088478165,0.00027427886,0.0076549165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991387,0.00031640317,0.00004235293,0.00026118942,0.00015863556,0.00008264338],"domain_scores_gemma":[0.99776125,0.0013909662,0.00013384664,0.0002288581,0.0003408152,0.00014430155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021146857,0.0011561156,0.0005953756,0.0006534362,0.00052504404,0.0016371873,0.0017984812,0.0012028224,0.0031608231],"category_scores_gemma":[0.0082458565,0.0006508271,0.0006031357,0.0002726938,0.00082714425,0.0019858852,0.00095173874,0.0018791542,0.0015255393],"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.0012712975,0.0006861331,0.01751673,0.00024600187,0.00016115775,0.0003009558,0.0011074757,0.788735,0.01278952,0.012907672,0.009144273,0.15513381],"study_design_scores_gemma":[0.000012872524,0.00005564058,0.0007731079,0.000007231748,0.000007882343,0.000020380534,0.000024898936,0.99497604,0.0009930041,0.0020715196,0.0010429227,0.000014487468],"about_ca_topic_score_codex":0.019536648,"about_ca_topic_score_gemma":0.031374793,"teacher_disagreement_score":0.019536648,"about_ca_system_score_codex":0.0022011884,"about_ca_system_score_gemma":0.0009617602,"threshold_uncertainty_score":0.038845837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7809427,0.00035637678,0.1759182,0.00030939103,0.0000356784,0.00021405835,0.0012571589,0.00039539006,0.040571082],"genre_scores_gemma":[0.94369984,0.00024045893,0.04571828,0.000056106142,0.000026302989,0.00023109875,0.0017748714,0.000120151824,0.008132946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921083,0.00013009537,0.00008311538,0.00018728162,0.00018893852,0.00019975952],"domain_scores_gemma":[0.9942502,0.002215744,0.0017698023,0.00053538947,0.00035629372,0.00087258517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037824194,0.00050346775,0.00057960564,0.0011339632,0.0009107761,0.0021437937,0.0014597352,0.0008271387,0.005946515],"category_scores_gemma":[0.005996424,0.000556646,0.0007571371,0.000992468,0.0021741684,0.0027097513,0.0014818755,0.0008090432,0.0006993475],"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.0020136836,0.00032680543,0.02927495,0.00062127225,0.00013612633,0.0041138735,0.0041705715,0.10085156,0.032746892,0.76889026,0.0059566083,0.05089751],"study_design_scores_gemma":[0.00036894126,0.0008696392,0.013411826,0.0002355125,0.00015515441,0.0058843805,0.0030701233,0.32823116,0.018751984,0.5960042,0.032860104,0.00015702541],"about_ca_topic_score_codex":0.002281561,"about_ca_topic_score_gemma":0.0012758273,"teacher_disagreement_score":0.005946515,"about_ca_system_score_codex":0.00056605553,"about_ca_system_score_gemma":0.00053200027,"threshold_uncertainty_score":0.01989311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044920884,0.00049321266,0.9264733,0.0011197755,0.00006956197,0.00027948717,0.00006759347,0.00023078869,0.026345324],"genre_scores_gemma":[0.44723016,0.00040421006,0.54124767,0.0002421656,0.000054729553,0.00035146606,0.0001359722,0.00011133653,0.010222324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855417,0.0008102543,0.000049467846,0.00015965432,0.0002489931,0.00017733913],"domain_scores_gemma":[0.9972396,0.0020233279,0.00013240942,0.00016469443,0.00017087092,0.0002691096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021947788,0.00080287043,0.0007608946,0.0010192643,0.0012915252,0.001673271,0.0015408209,0.0019206976,0.006273109],"category_scores_gemma":[0.008538596,0.00036271955,0.0009886737,0.0010598117,0.0025933266,0.0033662943,0.003446317,0.002278098,0.00048618752],"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.00047845993,0.00038224302,0.0012129013,0.0003109032,0.00010644364,0.000286845,0.0011995427,0.27103835,0.003867757,0.5850737,0.006968818,0.12907407],"study_design_scores_gemma":[0.000111089845,0.00018743204,0.00030953935,0.000056145003,0.000038320333,0.00013283496,0.00033639872,0.7259831,0.0012714755,0.26480234,0.0067400504,0.00003127262],"about_ca_topic_score_codex":0.0051564374,"about_ca_topic_score_gemma":0.0059592724,"teacher_disagreement_score":0.006273109,"about_ca_system_score_codex":0.0011975653,"about_ca_system_score_gemma":0.0013345216,"threshold_uncertainty_score":0.020985663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23928712,0.0006313722,0.72262007,0.0009748849,0.000092501825,0.00042708783,0.00082210597,0.00042994606,0.03471488],"genre_scores_gemma":[0.7299673,0.00029819703,0.2565135,0.0003165814,0.00015597542,0.0006839965,0.00088910054,0.00020053232,0.010974797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595153,0.0012811357,0.0003309444,0.0007945863,0.0010919876,0.00054994755],"domain_scores_gemma":[0.9829623,0.009785343,0.0023367936,0.0028126505,0.0010394113,0.0010636284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040414752,0.000838437,0.0012611161,0.002660132,0.0022692916,0.0044316254,0.0029688356,0.0022565338,0.008672427],"category_scores_gemma":[0.022508932,0.0012184214,0.0018532216,0.0026597234,0.005388428,0.009313087,0.0045344695,0.0042093433,0.0012167756],"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.00018067578,0.00009062813,0.0010977604,0.000098472214,0.000019791594,0.000097810305,0.00064709707,0.016375272,0.0017740811,0.96472335,0.00094693527,0.013948235],"study_design_scores_gemma":[0.00004942823,0.00015339533,0.0006269327,0.00009015841,0.000025039428,0.00032114598,0.00021355267,0.12467348,0.002831526,0.86305475,0.0079065375,0.000054191012],"about_ca_topic_score_codex":0.0010612266,"about_ca_topic_score_gemma":0.00081124186,"teacher_disagreement_score":0.008672427,"about_ca_system_score_codex":0.0034252976,"about_ca_system_score_gemma":0.001885899,"threshold_uncertainty_score":0.029012144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072008416,0.0040580384,0.6350375,0.006676736,0.00038803567,0.00023508139,0.00014389258,0.0017508019,0.2797015],"genre_scores_gemma":[0.8194304,0.0013069195,0.14991857,0.00039635095,0.00009127153,0.00021430012,0.00013944668,0.00011247671,0.02839026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999718,0.000110547495,0.000012987269,0.00005129168,0.00006672308,0.00004042285],"domain_scores_gemma":[0.99954623,0.0001715915,0.00003603984,0.000084872285,0.000066229535,0.00009505807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038488457,0.00039556518,0.00022540604,0.0004521988,0.0011167815,0.0027727266,0.00093659776,0.0012398715,0.012501802],"category_scores_gemma":[0.001734255,0.00020346577,0.0003719784,0.00033050543,0.0019614543,0.0033431167,0.0023335547,0.0011697782,0.0010400688],"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.000035237714,0.00003155617,0.0006224727,0.00010141916,0.000020773366,0.00017302051,0.001992499,0.0077998885,0.0024420803,0.9513495,0.0034212454,0.032010235],"study_design_scores_gemma":[0.00003385754,0.0000715105,0.0014383481,0.00010127099,0.000033192387,0.00044063426,0.0014028751,0.094447196,0.0017740903,0.7080774,0.19213694,0.000042757514],"about_ca_topic_score_codex":0.0037905877,"about_ca_topic_score_gemma":0.004546222,"teacher_disagreement_score":0.012501802,"about_ca_system_score_codex":0.001232567,"about_ca_system_score_gemma":0.0006022436,"threshold_uncertainty_score":0.04182273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025765426,0.00037931226,0.9650208,0.0004014325,0.000034201774,0.0001506495,0.00017436744,0.0007054665,0.007368347],"genre_scores_gemma":[0.2510158,0.00041609514,0.74406934,0.00024317854,0.000030250656,0.00023925572,0.00035798625,0.00029555126,0.00333253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835324,0.00067289715,0.00008414435,0.00021638816,0.00044625165,0.00022706413],"domain_scores_gemma":[0.9948125,0.0036337622,0.00047467646,0.0005471875,0.00038075456,0.00015102474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014758313,0.00074424135,0.00084901793,0.0010771742,0.0008024532,0.0019756106,0.0020017342,0.0012562105,0.0046457825],"category_scores_gemma":[0.014098336,0.00089922146,0.0009049247,0.0012051613,0.0013210375,0.0032541906,0.0014071253,0.0019251718,0.00089959987],"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.0003817409,0.00017841093,0.0015115014,0.00040223936,0.0000804257,0.000220281,0.00042796516,0.48103732,0.0057010134,0.35266688,0.00752137,0.14987081],"study_design_scores_gemma":[0.000074480384,0.00011226796,0.00028282037,0.00005716276,0.000027306025,0.00022796584,0.00007145931,0.7211945,0.0031781301,0.26870626,0.006042609,0.000025057658],"about_ca_topic_score_codex":0.003163927,"about_ca_topic_score_gemma":0.003705321,"teacher_disagreement_score":0.0046457825,"about_ca_system_score_codex":0.00178286,"about_ca_system_score_gemma":0.0019383277,"threshold_uncertainty_score":0.015541732},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005119718,0.00016271803,0.98455185,0.000102374244,0.00004759995,0.00014245757,0.00009274259,0.0069975345,0.0027830182],"genre_scores_gemma":[0.06379532,0.00011078575,0.93219477,0.0001433759,0.00002351026,0.00040611916,0.0003719111,0.0005811957,0.0023729864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999153,0.00022503268,0.00008622046,0.00018929513,0.00026163965,0.00008470009],"domain_scores_gemma":[0.99849725,0.00060896925,0.00014018785,0.00041688682,0.00024520626,0.00009142856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013047495,0.0013007976,0.00096450944,0.0013070176,0.00055432244,0.0011204974,0.003417177,0.0012433247,0.00799941],"category_scores_gemma":[0.004236589,0.0006680402,0.0012442588,0.0011909277,0.0012308159,0.00236951,0.0026980308,0.0019058137,0.0028721783],"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.0005383761,0.00031939827,0.0011543302,0.00058078836,0.00008348458,0.00008940749,0.00029730337,0.12984477,0.009809,0.03514234,0.01581979,0.8063211],"study_design_scores_gemma":[0.00015593752,0.00017782557,0.00029309336,0.000047885576,0.000036492427,0.000081121354,0.000052362153,0.9485072,0.0055135363,0.03217044,0.012933163,0.00003093226],"about_ca_topic_score_codex":0.006394177,"about_ca_topic_score_gemma":0.008086567,"teacher_disagreement_score":0.00799941,"about_ca_system_score_codex":0.0012026437,"about_ca_system_score_gemma":0.0019171459,"threshold_uncertainty_score":0.026760697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04694761,0.00039341958,0.7403037,0.000442461,0.0006550053,0.0013614701,0.0038225257,0.06093867,0.14513506],"genre_scores_gemma":[0.31343073,0.00027886507,0.5143008,0.0004173369,0.000048887978,0.001377403,0.0048493533,0.004947223,0.16034935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995679,0.0000436603,0.000033331846,0.00007958099,0.00019201722,0.0000834452],"domain_scores_gemma":[0.9997336,0.00005539723,0.0000153458,0.0000703509,0.00006436237,0.00006087161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035917806,0.0008670928,0.0007339001,0.0005035602,0.00054051547,0.0011685938,0.0034096811,0.0010429487,0.08045039],"category_scores_gemma":[0.0011377009,0.00046784058,0.00049746333,0.00042587446,0.0003941987,0.0012538221,0.0034704662,0.0008441335,0.019412123],"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.0045372522,0.0010447011,0.0027938809,0.0011415295,0.0001570384,0.001046098,0.0007523537,0.034954283,0.06432866,0.078845546,0.12099506,0.6894036],"study_design_scores_gemma":[0.0009707414,0.0011914911,0.0018261544,0.00024615048,0.00012537056,0.0012827708,0.0004040636,0.5976104,0.05753488,0.043904837,0.29473123,0.000171865],"about_ca_topic_score_codex":0.0022804304,"about_ca_topic_score_gemma":0.0041115787,"teacher_disagreement_score":0.08045039,"about_ca_system_score_codex":0.00045545588,"about_ca_system_score_gemma":0.0008417335,"threshold_uncertainty_score":0.26913333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054243505,0.00010440314,0.991568,0.000070810514,0.00003295483,0.00009474057,0.000045562792,0.001300742,0.0013584667],"genre_scores_gemma":[0.2311048,0.00009746277,0.76542336,0.00016982919,0.000045929835,0.00041701525,0.00030383124,0.00054543605,0.0018923794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486214,0.002537579,0.00028413883,0.0005622396,0.0014843439,0.00026948334],"domain_scores_gemma":[0.987422,0.007907179,0.00064326276,0.001816267,0.0018810602,0.0003302543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00919495,0.0011254663,0.0012018684,0.001159677,0.00070025417,0.0021854057,0.002191812,0.0014128353,0.0060695973],"category_scores_gemma":[0.03258758,0.0006839034,0.0007494268,0.00065224874,0.0013212035,0.0028606306,0.0027167085,0.0025025406,0.0011675813],"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.0009952296,0.00056096615,0.0033162124,0.0003644506,0.00016387849,0.00014329044,0.0002591017,0.40722048,0.010305176,0.09700462,0.00778242,0.47188413],"study_design_scores_gemma":[0.00006633853,0.00013716682,0.00028916597,0.000029575373,0.000012160799,0.000038180995,0.000029086514,0.9693972,0.004732427,0.023311807,0.0019376886,0.000019219458],"about_ca_topic_score_codex":0.0023500915,"about_ca_topic_score_gemma":0.0028451085,"teacher_disagreement_score":0.00919495,"about_ca_system_score_codex":0.001357084,"about_ca_system_score_gemma":0.001955654,"threshold_uncertainty_score":0.04862815},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2672207,0.0040415484,0.03164125,0.0019429241,0.00036340096,0.00014207647,0.00032282056,0.0002521526,0.69407314],"genre_scores_gemma":[0.9622059,0.0010362786,0.00783549,0.00025175925,0.00007711481,0.0000865264,0.00030816198,0.000110553345,0.028088346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964774,0.000091544214,0.000012010508,0.000055510187,0.00014697987,0.000046291192],"domain_scores_gemma":[0.99951994,0.00021286779,0.00007010256,0.00004926454,0.000074350006,0.0000734681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039077463,0.00045350354,0.00019197876,0.00027936645,0.00028300076,0.0020291477,0.0003956793,0.00043618216,0.008288223],"category_scores_gemma":[0.0025476727,0.00017198201,0.00023889428,0.00038569333,0.00051302114,0.0017491566,0.0010998008,0.0010669713,0.0010706246],"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.0012963578,0.0003095009,0.013866757,0.0011963645,0.000272906,0.00091763056,0.016400842,0.0068593156,0.13276634,0.22338226,0.03927136,0.56346035],"study_design_scores_gemma":[0.00019836375,0.0010250625,0.30604723,0.0011955475,0.0004054261,0.0015240737,0.016702717,0.04004071,0.033383913,0.43363363,0.16556832,0.00027505538],"about_ca_topic_score_codex":0.0004651887,"about_ca_topic_score_gemma":0.00058353203,"teacher_disagreement_score":0.008288223,"about_ca_system_score_codex":0.00065779313,"about_ca_system_score_gemma":0.00024752627,"threshold_uncertainty_score":0.027726889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006120097,0.00003923558,0.0018293238,0.00008035905,0.000055187586,0.00016042677,0.99510056,0.0014968822,0.00062607334],"genre_scores_gemma":[0.011149606,0.00012015558,0.0161376,0.0006112015,0.00011499611,0.002717248,0.95853966,0.00370806,0.006901593],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723417,0.00046090703,0.00043279133,0.000787429,0.0008387927,0.00024583208],"domain_scores_gemma":[0.9486239,0.040751677,0.001654856,0.0031939035,0.005162263,0.00061347074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0041156127,0.0017906254,0.0016705681,0.0030257138,0.0014136267,0.0018766383,0.0028472047,0.0013776467,0.7421408],"category_scores_gemma":[0.0483041,0.0008182025,0.0014044136,0.0037813724,0.00049419206,0.0017705905,0.0010307448,0.001628724,0.15489918],"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.0011771224,0.00031640832,0.004931825,0.004355977,0.00016767147,0.00011665182,0.00013506218,0.0014263483,0.001570609,0.0007202399,0.96657616,0.018505922],"study_design_scores_gemma":[0.008703378,0.0015568257,0.06908103,0.004676481,0.0010930252,0.0015111321,0.00083122565,0.013799923,0.016764937,0.017430957,0.863807,0.0007440951],"about_ca_topic_score_codex":0.005076115,"about_ca_topic_score_gemma":0.009730258,"teacher_disagreement_score":0.7421408,"about_ca_system_score_codex":0.0012466534,"about_ca_system_score_gemma":0.0026426218,"threshold_uncertainty_score":0.36780477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9547412,0.0020762288,0.037378937,0.00016172763,0.0000495972,0.00009823881,0.000112760325,0.00019927263,0.005182104],"genre_scores_gemma":[0.98953295,0.0005744839,0.009110093,0.000015798058,0.0000037404418,0.000045309465,0.00004925435,0.000017773316,0.00065049954],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998766,0.000013509342,0.000009091548,0.000020274589,0.000042951764,0.00003761987],"domain_scores_gemma":[0.9998814,0.000036328413,0.000033737866,0.0000060089233,0.000021144817,0.000021406984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023946576,0.00045690368,0.0005137334,0.00047478412,0.00024964302,0.000868806,0.00035961304,0.00042326192,0.0011159643],"category_scores_gemma":[0.0003949813,0.00022368877,0.0004549517,0.00033228763,0.0002592556,0.0005492216,0.0003942457,0.00038109766,0.00021880795],"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.00059144583,0.00059006293,0.0016063654,0.00084601645,0.000041210886,0.00050518283,0.00008229113,0.30479333,0.6578214,0.0016803527,0.00039411994,0.031048147],"study_design_scores_gemma":[0.000109807144,0.0025733374,0.0020928958,0.000061017407,0.00008742417,0.00011504485,0.00019936537,0.7067858,0.28341353,0.00076428126,0.0037381938,0.000059262784],"about_ca_topic_score_codex":0.0009872274,"about_ca_topic_score_gemma":0.0019137046,"teacher_disagreement_score":0.0011159643,"about_ca_system_score_codex":0.0003428519,"about_ca_system_score_gemma":0.00047363646,"threshold_uncertainty_score":0.003733337},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011780353,0.00013718416,0.0036053744,0.004862233,0.0016923294,0.005723186,0.8118366,0.0075816205,0.16338345],"genre_scores_gemma":[0.015587232,0.0008044236,0.024864363,0.0055090664,0.0009780991,0.035583396,0.48378325,0.015843991,0.41704622],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99595684,0.0010319403,0.0005986069,0.00026345174,0.0017287781,0.00042028545],"domain_scores_gemma":[0.929687,0.04037033,0.0014809468,0.0022453775,0.023240533,0.0029757472],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007296655,0.0010588479,0.000921521,0.0057777674,0.0018929736,0.0052031744,0.0020489653,0.001917825,0.9442274],"category_scores_gemma":[0.068124466,0.0012801333,0.0008416902,0.0073877317,0.0009793815,0.004159413,0.0042968066,0.0025272823,0.64382833],"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.00003832261,0.000034697186,0.00010159552,0.00040759522,0.0000020559276,0.000010417568,0.00017121967,0.00003173392,0.000047666843,0.00052594795,0.9910816,0.0075471313],"study_design_scores_gemma":[0.00035113926,0.000043071996,0.002053318,0.0012147021,0.000009366004,0.00004056621,0.0019099234,0.00022693827,0.0004048287,0.0030485175,0.990647,0.00005051624],"about_ca_topic_score_codex":0.01237772,"about_ca_topic_score_gemma":0.018601952,"teacher_disagreement_score":0.9442274,"about_ca_system_score_codex":0.0033435663,"about_ca_system_score_gemma":0.006730996,"threshold_uncertainty_score":0.07955283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14896297,0.00040298692,0.8416305,0.00019179958,0.000089512,0.0002109562,0.00007222976,0.0019687607,0.006470249],"genre_scores_gemma":[0.76297647,0.00014319988,0.23478019,0.000085177715,0.00003069566,0.000120656565,0.0001075456,0.00016542629,0.0015906994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994783,0.00017580358,0.000022867995,0.000087222754,0.00016419264,0.000071679504],"domain_scores_gemma":[0.9982309,0.0011929149,0.00013031134,0.00011241877,0.00023022176,0.000103197075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010141182,0.0013437504,0.0011047176,0.0016162221,0.0006241996,0.0012864555,0.001177966,0.0009254395,0.0018416869],"category_scores_gemma":[0.0049794056,0.0006874278,0.00079613115,0.00068097474,0.001007884,0.0014755614,0.0013500963,0.00079523074,0.00034112477],"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.00016512352,0.0000957498,0.0019254977,0.00008835492,0.00008174885,0.00013000307,0.00017146893,0.90705824,0.0024743965,0.006537745,0.0007799857,0.080491714],"study_design_scores_gemma":[0.000013078203,0.00003699045,0.00013837153,0.0000039738798,0.000009040994,0.000011910099,0.000020162519,0.9968298,0.00070272875,0.0019357902,0.00029202158,0.000006078711],"about_ca_topic_score_codex":0.012150552,"about_ca_topic_score_gemma":0.0142016085,"teacher_disagreement_score":0.012150552,"about_ca_system_score_codex":0.0011280827,"about_ca_system_score_gemma":0.00097158586,"threshold_uncertainty_score":0.02415967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3198419,0.000300017,0.6701178,0.0002298911,0.00003123004,0.00015846845,0.0001155921,0.00050501677,0.008700107],"genre_scores_gemma":[0.88364506,0.0000995152,0.1127696,0.000045187422,0.0000066609505,0.00013375675,0.000093520386,0.00007447425,0.0031322897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991173,0.0003560076,0.000035558973,0.00016959482,0.00015655665,0.00016500044],"domain_scores_gemma":[0.9969015,0.0021915855,0.0002546315,0.00027137483,0.00011517514,0.00026572574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010606312,0.0007608808,0.0008324438,0.0005651388,0.0007120459,0.0013315496,0.0012466664,0.00081005145,0.002985702],"category_scores_gemma":[0.005120449,0.0004672316,0.00049489207,0.00041562275,0.0015295488,0.0024348474,0.002951594,0.0008661441,0.00029833792],"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.0006817256,0.0001615446,0.0032128205,0.00017519956,0.00007150207,0.0003149546,0.0005716632,0.88139665,0.0068125217,0.05548929,0.0011167432,0.049995456],"study_design_scores_gemma":[0.000027221759,0.0001080908,0.00047471086,0.000014143975,0.000009288061,0.000107831744,0.00012969461,0.95908934,0.0016040741,0.037096422,0.001323995,0.000015098787],"about_ca_topic_score_codex":0.0018832111,"about_ca_topic_score_gemma":0.002664229,"teacher_disagreement_score":0.002985702,"about_ca_system_score_codex":0.0007878716,"about_ca_system_score_gemma":0.00070796575,"threshold_uncertainty_score":0.009988189},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32439938,0.06524217,0.0068177124,0.0015778198,0.0019362388,0.0011766729,0.009344254,0.0010053739,0.58850044],"genre_scores_gemma":[0.85236394,0.009011062,0.010975407,0.0012047387,0.00044750326,0.0006752205,0.0035666812,0.00011880997,0.12163667],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998355,0.000017101054,0.00001321414,0.000067086214,0.000036786514,0.000030187415],"domain_scores_gemma":[0.99987197,0.000023379234,0.00005088216,0.000013390325,0.000027277318,0.0000130315675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015243192,0.0008567994,0.0004666421,0.0023728001,0.0020085846,0.000465406,0.000555719,0.00064759137,0.026998507],"category_scores_gemma":[0.00036276228,0.00031206463,0.00020072148,0.001190381,0.0006701819,0.0012465733,0.0008279242,0.0004706382,0.009111157],"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.00095439615,0.0001404066,0.018261297,0.0026719645,0.00010768838,0.003907184,0.00425027,0.00083195296,0.025378821,0.01468298,0.07631003,0.85250306],"study_design_scores_gemma":[0.00012663237,0.0002819102,0.17771503,0.001023838,0.00018571818,0.008291704,0.0025497216,0.00043418453,0.0023629426,0.003945147,0.8030245,0.00005869977],"about_ca_topic_score_codex":0.011736745,"about_ca_topic_score_gemma":0.037132155,"teacher_disagreement_score":0.026998507,"about_ca_system_score_codex":0.000768484,"about_ca_system_score_gemma":0.00062214717,"threshold_uncertainty_score":0.09031904},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049132425,0.0095734205,0.46364918,0.028179348,0.0024188992,0.00020849341,0.00057301443,0.0021057057,0.4441596],"genre_scores_gemma":[0.82498527,0.0032614265,0.09670559,0.000980315,0.0009696706,0.00032314166,0.0004913508,0.0007357719,0.071547456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941057,0.0034522214,0.00032255496,0.0008658228,0.0009301945,0.00032347787],"domain_scores_gemma":[0.9832305,0.0071604014,0.0006341752,0.007394449,0.0009153782,0.0006650068],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0048212237,0.00056015555,0.0008961717,0.0016004445,0.0041162833,0.014145011,0.0021057313,0.0032825756,0.019432383],"category_scores_gemma":[0.01596691,0.00057310757,0.0012333291,0.0029322365,0.01447503,0.030868819,0.008312102,0.0042921556,0.0030317612],"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.000021661659,0.000005923335,0.00009899283,0.000031550997,0.000004180468,0.000040759223,0.0013509287,0.0003480378,0.00016464437,0.9858764,0.0013692856,0.010687699],"study_design_scores_gemma":[0.000010676735,0.00000931054,0.000042391854,0.000029599703,0.000008732691,0.000099329576,0.00054400455,0.0016183491,0.00041142802,0.9516681,0.04554657,0.000011428092],"about_ca_topic_score_codex":0.0024129152,"about_ca_topic_score_gemma":0.0012689432,"teacher_disagreement_score":0.99517876,"about_ca_system_score_codex":0.0021732685,"about_ca_system_score_gemma":0.001971069,"threshold_uncertainty_score":0.065007865},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030797293,0.02657186,0.029448142,0.034293137,0.06318476,0.0017051228,0.03478991,0.014447086,0.7647627],"genre_scores_gemma":[0.037354134,0.0052332617,0.009785715,0.0018617474,0.004253401,0.00040202856,0.024235496,0.0019516659,0.91492254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992816,0.0001456098,0.000025902125,0.00008881065,0.00032935603,0.00012873473],"domain_scores_gemma":[0.99714607,0.0003525967,0.000048168815,0.00018553677,0.0014168374,0.0008508312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021028596,0.0013497588,0.000674285,0.0012654942,0.0022464797,0.0038200135,0.0010235416,0.0011998415,0.1456017],"category_scores_gemma":[0.0028966018,0.0003400808,0.00035885838,0.0010579817,0.0005401511,0.0018777371,0.0022269068,0.0016047317,0.043624748],"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.0001853803,0.000057012756,0.00023611238,0.000082127575,0.000008094793,0.00005552299,0.0001729738,0.00014009555,0.0007698341,0.00047070594,0.9581701,0.03965204],"study_design_scores_gemma":[0.000050972292,0.000099660814,0.004581353,0.00013550547,0.000016874088,0.000065345506,0.00066930865,0.0012190365,0.0011054446,0.00057444954,0.9914532,0.000028991333],"about_ca_topic_score_codex":0.10181936,"about_ca_topic_score_gemma":0.24156524,"teacher_disagreement_score":0.1456017,"about_ca_system_score_codex":0.0020210922,"about_ca_system_score_gemma":0.0033136492,"threshold_uncertainty_score":0.48708624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07283764,0.00010931498,0.9066552,0.0005114305,0.00012525974,0.00045905015,0.000082180406,0.00055894564,0.018660989],"genre_scores_gemma":[0.6116039,0.00010502762,0.3795577,0.00017069791,0.00006042582,0.00038683056,0.00013291507,0.00008877964,0.007893729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972765,0.0010103352,0.0001320699,0.00043132817,0.0007270692,0.00042271518],"domain_scores_gemma":[0.9984255,0.0005177816,0.00018235842,0.00021008428,0.00034158077,0.0003226899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00295094,0.0011044735,0.0007931189,0.0010097129,0.0015414078,0.0018968685,0.0019280979,0.0011654083,0.0042471876],"category_scores_gemma":[0.0062129432,0.00027980414,0.0007370035,0.0006202396,0.00090534304,0.0018837095,0.003856252,0.0014511289,0.0007604923],"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.0009806772,0.0014407984,0.007961395,0.00043282486,0.0002120321,0.0004505283,0.002509722,0.28267604,0.01604932,0.2146952,0.008867096,0.46372432],"study_design_scores_gemma":[0.0001346133,0.0005665476,0.0026786264,0.00008633626,0.000086868306,0.00027768183,0.0008942051,0.8414205,0.0064327354,0.13494653,0.01240475,0.00007061279],"about_ca_topic_score_codex":0.003972185,"about_ca_topic_score_gemma":0.00398081,"teacher_disagreement_score":0.0042471876,"about_ca_system_score_codex":0.0012436036,"about_ca_system_score_gemma":0.0021241514,"threshold_uncertainty_score":0.015606225},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037809284,0.00030776497,0.15051073,0.002791253,0.0019687128,0.0012547994,0.020428143,0.48206457,0.336893],"genre_scores_gemma":[0.07939781,0.0005620812,0.07632874,0.004496904,0.00057000556,0.0016362736,0.041420087,0.21054582,0.58504224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956469,0.0006282912,0.00029135196,0.0007527224,0.002229222,0.0004514076],"domain_scores_gemma":[0.9874835,0.0024115897,0.00038633597,0.0041939793,0.004949946,0.00057475764],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026015823,0.001635051,0.00091761636,0.0015221257,0.0010038739,0.002602174,0.002301382,0.0015841095,0.47691816],"category_scores_gemma":[0.022487251,0.0011147705,0.00077330315,0.000789884,0.0012567359,0.0050444184,0.0042415974,0.0026236572,0.3926298],"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.00043776684,0.000063169406,0.000500877,0.00023586827,0.0000142638655,0.00021238197,0.0001415379,0.0006156863,0.0036202231,0.01029023,0.8640809,0.11978702],"study_design_scores_gemma":[0.00013073462,0.000058739486,0.0005263772,0.00012566129,0.000011385432,0.0002889073,0.000053302658,0.0052291234,0.012708346,0.00868877,0.9721149,0.00006374457],"about_ca_topic_score_codex":0.0038369517,"about_ca_topic_score_gemma":0.0041454323,"teacher_disagreement_score":0.52308184,"about_ca_system_score_codex":0.0019142731,"about_ca_system_score_gemma":0.0033848237,"threshold_uncertainty_score":0.74611276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022095172,0.04926181,0.004795471,0.102797315,0.016577419,0.0004512819,0.008593335,0.00049637764,0.7949318],"genre_scores_gemma":[0.05194225,0.0069315326,0.001460822,0.0042014974,0.00047034307,0.00010743423,0.0010254629,0.00014147778,0.9337192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986052,0.00017875007,0.000043435106,0.00018328242,0.00059988286,0.00038950986],"domain_scores_gemma":[0.9979329,0.0002704221,0.00009209849,0.00012192797,0.0011387825,0.00044382244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127042,0.0007762142,0.00034325747,0.0021075085,0.010249178,0.0060737445,0.0010983365,0.002675976,0.10227805],"category_scores_gemma":[0.0028574958,0.00031972775,0.0004957089,0.003380188,0.0027544154,0.0019088908,0.0019542612,0.0024235882,0.008908736],"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.00006905508,0.000036699053,0.0036787286,0.000325414,0.000018894187,0.0003982072,0.00789973,0.0004229761,0.0008020432,0.07350732,0.820821,0.09201998],"study_design_scores_gemma":[0.000003422236,0.000006964802,0.0062530977,0.0001313341,0.000003302942,0.000043132975,0.0020185986,0.000071161274,0.00016213684,0.00060798624,0.9906854,0.000013457041],"about_ca_topic_score_codex":0.9620825,"about_ca_topic_score_gemma":0.9821874,"teacher_disagreement_score":0.96002984,"about_ca_system_score_codex":0.039970163,"about_ca_system_score_gemma":0.044105098,"threshold_uncertainty_score":0.3421542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006120097,0.00003923558,0.0018293238,0.00008035905,0.000055187586,0.00016042677,0.99510056,0.0014968822,0.00062607334],"genre_scores_gemma":[0.011149606,0.00012015558,0.0161376,0.0006112015,0.00011499611,0.002717248,0.95853966,0.00370806,0.006901593],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723417,0.00046090703,0.00043279133,0.000787429,0.0008387927,0.00024583208],"domain_scores_gemma":[0.9486239,0.040751677,0.001654856,0.0031939035,0.005162263,0.00061347074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0041156127,0.0017906254,0.0016705681,0.0030257138,0.0014136267,0.0018766383,0.0028472047,0.0013776467,0.7421408],"category_scores_gemma":[0.0483041,0.0008182025,0.0014044136,0.0037813724,0.00049419206,0.0017705905,0.0010307448,0.001628724,0.15489918],"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.0011771224,0.00031640832,0.004931825,0.004355977,0.00016767147,0.00011665182,0.00013506218,0.0014263483,0.001570609,0.0007202399,0.96657616,0.018505922],"study_design_scores_gemma":[0.008703378,0.0015568257,0.06908103,0.004676481,0.0010930252,0.0015111321,0.00083122565,0.013799923,0.016764937,0.017430957,0.863807,0.0007440951],"about_ca_topic_score_codex":0.005076115,"about_ca_topic_score_gemma":0.009730258,"teacher_disagreement_score":0.7421408,"about_ca_system_score_codex":0.0012466534,"about_ca_system_score_gemma":0.0026426218,"threshold_uncertainty_score":0.36780477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07283764,0.00010931498,0.9066552,0.0005114305,0.00012525974,0.00045905015,0.000082180406,0.00055894564,0.018660989],"genre_scores_gemma":[0.6116039,0.00010502762,0.3795577,0.00017069791,0.00006042582,0.00038683056,0.00013291507,0.00008877964,0.007893729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972765,0.0010103352,0.0001320699,0.00043132817,0.0007270692,0.00042271518],"domain_scores_gemma":[0.9984255,0.0005177816,0.00018235842,0.00021008428,0.00034158077,0.0003226899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00295094,0.0011044735,0.0007931189,0.0010097129,0.0015414078,0.0018968685,0.0019280979,0.0011654083,0.0042471876],"category_scores_gemma":[0.0062129432,0.00027980414,0.0007370035,0.0006202396,0.00090534304,0.0018837095,0.003856252,0.0014511289,0.0007604923],"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.0009806772,0.0014407984,0.007961395,0.00043282486,0.0002120321,0.0004505283,0.002509722,0.28267604,0.01604932,0.2146952,0.008867096,0.46372432],"study_design_scores_gemma":[0.0001346133,0.0005665476,0.0026786264,0.00008633626,0.000086868306,0.00027768183,0.0008942051,0.8414205,0.0064327354,0.13494653,0.01240475,0.00007061279],"about_ca_topic_score_codex":0.003972185,"about_ca_topic_score_gemma":0.00398081,"teacher_disagreement_score":0.0042471876,"about_ca_system_score_codex":0.0012436036,"about_ca_system_score_gemma":0.0021241514,"threshold_uncertainty_score":0.015606225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03656045,0.00041212895,0.0014661098,0.010215067,0.0002454519,0.00009044487,0.0003867567,0.00028568172,0.9503379],"genre_scores_gemma":[0.22077197,0.00061820477,0.0034693165,0.002486138,0.000045065968,0.00013292013,0.00037605313,0.00018058855,0.7719198],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906033,0.00020087959,0.000018460654,0.00011968753,0.00021910522,0.00038148035],"domain_scores_gemma":[0.9970401,0.00036355836,0.00016238964,0.00017782567,0.00080861227,0.0014475501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016432,0.00047823344,0.0001858903,0.0015408737,0.0074463882,0.0039399858,0.0011173902,0.0017509894,0.08757062],"category_scores_gemma":[0.0025870195,0.00021537121,0.00019271144,0.0010109585,0.001932786,0.0022555701,0.0024443213,0.001995121,0.016123869],"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.00015926338,0.0008949168,0.021597259,0.0002230613,0.000013200181,0.00030784146,0.01419043,0.00051843503,0.0010327537,0.17459945,0.46587953,0.32058394],"study_design_scores_gemma":[0.000025982408,0.00003649718,0.023350053,0.00019591194,0.000005583391,0.000089196095,0.010804746,0.00021996239,0.00072074006,0.007483209,0.95705235,0.000015743251],"about_ca_topic_score_codex":0.13669106,"about_ca_topic_score_gemma":0.4400104,"teacher_disagreement_score":0.8633089,"about_ca_system_score_codex":0.012458268,"about_ca_system_score_gemma":0.01237501,"threshold_uncertainty_score":0.2929529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034382744,0.06854693,0.0024325685,0.010887198,0.0058359536,0.000043669083,0.0007604756,0.00042821653,0.9076267],"genre_scores_gemma":[0.012068128,0.009909392,0.001040754,0.0003847356,0.0003672463,0.000026611835,0.00018003541,0.00036352722,0.9756596],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9996666,0.000058391437,0.000008659459,0.000089665766,0.000122014644,0.000054707136],"domain_scores_gemma":[0.9998049,0.000054026023,0.000015127045,0.0000111983645,0.00006297323,0.000051819745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037106287,0.0009467518,0.0004723019,0.00089190184,0.001759684,0.0030245262,0.0004683408,0.0013615639,0.13666856],"category_scores_gemma":[0.000647738,0.00039763685,0.00034210275,0.0010752457,0.00089704496,0.0020050653,0.0012858858,0.0021052754,0.028758245],"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.00011959864,0.0000270609,0.000442495,0.00031082175,0.000010783615,0.00030120317,0.0010119155,0.00029824095,0.0011390931,0.087210834,0.70040536,0.20872256],"study_design_scores_gemma":[0.00000280029,0.0000057531533,0.0004468331,0.00006140168,9.975091e-7,0.000070103335,0.00007884733,0.000044314045,0.00007650998,0.0007983244,0.99841166,0.000002532794],"about_ca_topic_score_codex":0.0386153,"about_ca_topic_score_gemma":0.09324273,"teacher_disagreement_score":0.13666856,"about_ca_system_score_codex":0.0039789937,"about_ca_system_score_gemma":0.002053985,"threshold_uncertainty_score":0.4572019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714291,0.0007211478,0.0031046455,0.000120533754,0.00003011003,0.00019765961,0.00007921044,0.000038458646,0.024279123],"genre_scores_gemma":[0.98558456,0.000799841,0.008288842,0.00004655917,0.000020547091,0.0002003269,0.00021898345,0.00004073725,0.0047994903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947076,0.0025373178,0.0003731898,0.00025380644,0.0018023758,0.0003257634],"domain_scores_gemma":[0.9749135,0.018723125,0.0016504991,0.0005806052,0.0033177033,0.00081460126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047442834,0.00028752326,0.00034376097,0.0028198375,0.00050962967,0.002629507,0.0004516457,0.00036053214,0.0033487598],"category_scores_gemma":[0.020078946,0.00013125564,0.00043025287,0.0012848428,0.0007742624,0.0013646868,0.0011631703,0.0003712244,0.00038540392],"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.004354564,0.0022600768,0.15110232,0.0055604405,0.00046084658,0.0008843273,0.088392265,0.001786334,0.025626248,0.011441842,0.004960627,0.7031702],"study_design_scores_gemma":[0.00022090203,0.007822792,0.8057542,0.001129722,0.00029688884,0.001825425,0.09191362,0.009431029,0.012964388,0.0031231649,0.0653501,0.00016785254],"about_ca_topic_score_codex":0.00080820173,"about_ca_topic_score_gemma":0.0018281387,"teacher_disagreement_score":0.0047442834,"about_ca_system_score_codex":0.0007727665,"about_ca_system_score_gemma":0.0005546173,"threshold_uncertainty_score":0.025090456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1467664,0.00029285435,0.8427948,0.00023147328,0.000025303134,0.00013162564,0.000039734332,0.00061184965,0.009105977],"genre_scores_gemma":[0.6655126,0.0002868255,0.32922065,0.00008548357,0.000009959907,0.00021437508,0.00009576035,0.00010551414,0.0044687833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999368,0.00023931282,0.000024057903,0.00012687537,0.00016784373,0.00007390898],"domain_scores_gemma":[0.9988288,0.00071047794,0.00015524578,0.00012300175,0.00011829165,0.00006417008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011760393,0.0007786256,0.0006750713,0.0004195583,0.00055660907,0.0013208947,0.0011801426,0.0008735212,0.0015324362],"category_scores_gemma":[0.0025821698,0.0003753359,0.00049946195,0.00040647312,0.0008990265,0.0015235933,0.0009874001,0.0010244854,0.00033772385],"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.00023201543,0.00019977608,0.0015955474,0.00012022828,0.000048216243,0.00007904821,0.00030011285,0.8818921,0.008623729,0.03437251,0.000827651,0.071709126],"study_design_scores_gemma":[0.000009655373,0.00008382331,0.00015663305,0.000005593294,0.000006101391,0.000029423263,0.000031026313,0.9911214,0.0027331137,0.0047718426,0.0010439833,0.0000073892343],"about_ca_topic_score_codex":0.0025273701,"about_ca_topic_score_gemma":0.002783841,"teacher_disagreement_score":0.0025273701,"about_ca_system_score_codex":0.0007568165,"about_ca_system_score_gemma":0.0010590012,"threshold_uncertainty_score":0.006219566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61056155,0.0009038228,0.30220985,0.0008439346,0.00029842267,0.000991934,0.00048782837,0.025474597,0.058227964],"genre_scores_gemma":[0.8147165,0.00037828996,0.16510126,0.00014730745,0.00003085174,0.00036273297,0.0007971602,0.001295361,0.017170448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969212,0.00091342046,0.00015841743,0.0006042357,0.0010817942,0.0003209675],"domain_scores_gemma":[0.9940697,0.0033901872,0.000348875,0.0010222148,0.0009954731,0.0001735923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003951646,0.00082240714,0.0005975888,0.0011331118,0.0006968596,0.0029171337,0.0017050868,0.0010528935,0.011187428],"category_scores_gemma":[0.014705617,0.0005236978,0.00061204017,0.0005292981,0.0010526492,0.0024541225,0.0011479137,0.001373197,0.002398703],"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.0028268925,0.002372165,0.02682347,0.0016166953,0.00017551242,0.0005817314,0.0024299622,0.08419591,0.051470835,0.050179,0.0131592415,0.7641686],"study_design_scores_gemma":[0.00048538588,0.0014437205,0.01648799,0.0002146338,0.00021992723,0.00043661927,0.0017369967,0.84534955,0.06432829,0.007665287,0.06151855,0.000113035916],"about_ca_topic_score_codex":0.009788954,"about_ca_topic_score_gemma":0.006743907,"teacher_disagreement_score":0.011187428,"about_ca_system_score_codex":0.0013455015,"about_ca_system_score_gemma":0.0016349365,"threshold_uncertainty_score":0.037425697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013592602,0.0005583883,0.012904244,0.0020527223,0.003244462,0.00069249875,0.040749352,0.12116436,0.81727463],"genre_scores_gemma":[0.0058157262,0.0002929134,0.005858453,0.000614889,0.00025702151,0.00033164478,0.026324902,0.04051151,0.919993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890137,0.00011364841,0.000045266046,0.00014647441,0.00056486623,0.00022833086],"domain_scores_gemma":[0.99556774,0.00032821365,0.0001055275,0.00041538672,0.0028259766,0.00075715786],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010964266,0.0019147497,0.0010317405,0.0022942275,0.001842905,0.0047164103,0.0023976043,0.0021306928,0.8304821],"category_scores_gemma":[0.0076195155,0.0008996024,0.00076629204,0.0013494876,0.00051875494,0.0046465076,0.0035379569,0.0020120868,0.79609156],"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.000095420306,0.000025537927,0.00012482537,0.000052240055,0.0000023864623,0.00003837022,0.000058587833,0.000053875516,0.00024629707,0.0006535406,0.98360795,0.015040826],"study_design_scores_gemma":[0.000028740382,0.000019604846,0.0004437241,0.00005749543,0.000001960837,0.000047645433,0.00007955189,0.00020908305,0.00033826698,0.00029899564,0.9984509,0.000024035802],"about_ca_topic_score_codex":0.03867956,"about_ca_topic_score_gemma":0.06851384,"teacher_disagreement_score":0.16951787,"about_ca_system_score_codex":0.0022804758,"about_ca_system_score_gemma":0.0016535919,"threshold_uncertainty_score":0.24179661},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071790756,0.0005129196,0.00435747,0.00045834586,0.001353246,0.00062953663,0.0589668,0.01823003,0.91477376],"genre_scores_gemma":[0.0027575304,0.000884926,0.005256389,0.00044494838,0.0004177197,0.0004980185,0.05388868,0.008271739,0.92758],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942774,0.000036192312,0.000026681395,0.00007618834,0.0003758251,0.000057386056],"domain_scores_gemma":[0.9985763,0.00008011344,0.000036704427,0.00015290071,0.0009236152,0.00023040995],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045084002,0.001449602,0.0008343915,0.0023167888,0.001127175,0.0036993993,0.0017345332,0.0005919475,0.80332136],"category_scores_gemma":[0.0021356319,0.00077589735,0.0006530791,0.0030371868,0.00023619006,0.0020942888,0.002009378,0.0012784792,0.7552165],"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.000019989027,0.0000089437135,0.000026196218,0.0000360163,0.0000011207926,0.000010951715,0.000007915081,0.000015992808,0.00014341777,0.00020178137,0.9841302,0.015397591],"study_design_scores_gemma":[0.000026280028,0.000018112245,0.00071996474,0.000049323484,0.0000052309624,0.00006443396,0.000025558566,0.00013452994,0.00037028102,0.00023521316,0.99833655,0.0000144774485],"about_ca_topic_score_codex":0.007940743,"about_ca_topic_score_gemma":0.0090670595,"teacher_disagreement_score":0.19667864,"about_ca_system_score_codex":0.0008729683,"about_ca_system_score_gemma":0.0010976802,"threshold_uncertainty_score":0.28053814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075015955,0.00024058783,0.88239163,0.00054384524,0.000051794075,0.0003924555,0.00026925988,0.0019899844,0.03910448],"genre_scores_gemma":[0.5121337,0.00035260568,0.46613297,0.000076780125,0.00001365336,0.00031594382,0.0006571603,0.0003729728,0.01994422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.00038389498,0.00004140459,0.00011922173,0.0002166249,0.000051468778],"domain_scores_gemma":[0.99817383,0.0013652312,0.000085104686,0.00018103156,0.0001319833,0.00006290205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374597,0.00039352212,0.000182177,0.00059597736,0.0010021911,0.0024177008,0.0008413923,0.00071439357,0.006228121],"category_scores_gemma":[0.005288636,0.00043247335,0.0006360163,0.00038612194,0.0017423872,0.0032344195,0.002073715,0.0007337078,0.0009571507],"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.00014678316,0.00010913804,0.0016662672,0.0003737855,0.000024597935,0.0009223829,0.017866552,0.06637218,0.007847852,0.78786325,0.00437423,0.11243299],"study_design_scores_gemma":[0.000087973756,0.00020391903,0.0007360209,0.00031754147,0.00005470402,0.00087251404,0.004172788,0.39944458,0.030334353,0.34132066,0.22237727,0.000077641605],"about_ca_topic_score_codex":0.0017574045,"about_ca_topic_score_gemma":0.0024438715,"teacher_disagreement_score":0.006228121,"about_ca_system_score_codex":0.0011069097,"about_ca_system_score_gemma":0.00076867593,"threshold_uncertainty_score":0.020835161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002967902,0.00014803374,0.000380319,0.0005240794,0.0010265098,0.00003619498,0.002491554,0.0013623923,0.9937342],"genre_scores_gemma":[0.00095635257,0.000099209676,0.00009169045,0.00007838841,0.00006110423,0.00001974491,0.0011304786,0.0004730624,0.99709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963164,0.000026213183,0.0000172147,0.00006679881,0.00014612009,0.000112108224],"domain_scores_gemma":[0.9990613,0.000053092484,0.00003311428,0.000096853844,0.00032152524,0.00043411186],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004857021,0.001162617,0.00076161645,0.0013021183,0.002197783,0.0061394246,0.0012521597,0.0018001761,0.91934705],"category_scores_gemma":[0.0015620689,0.000493182,0.0004918604,0.0011910979,0.00047940755,0.0034076173,0.0035509686,0.001986509,0.8693149],"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.000056930206,0.000027629281,0.000106936415,0.000064173204,0.0000016261379,0.00004896779,0.000047794325,0.000030722884,0.00016400553,0.0030362604,0.9707625,0.025652537],"study_design_scores_gemma":[0.0000068379077,0.000012090228,0.00026567196,0.00004099166,0.0000012998133,0.00001747082,0.00006442488,0.00004299754,0.00009543926,0.0003737776,0.99907494,0.0000039426122],"about_ca_topic_score_codex":0.0070458315,"about_ca_topic_score_gemma":0.019723568,"teacher_disagreement_score":0.08065295,"about_ca_system_score_codex":0.0018623433,"about_ca_system_score_gemma":0.0012879813,"threshold_uncertainty_score":0.115041554},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31696093,0.004161905,0.29995838,0.014978429,0.0007814735,0.0003999664,0.006584572,0.00096187444,0.35521242],"genre_scores_gemma":[0.88815564,0.0013781541,0.029621882,0.00034930435,0.00009586633,0.0004544243,0.0018438214,0.00013811415,0.07796279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9994636,0.00021740845,0.000020862684,0.00013081328,0.000077045835,0.000090281595],"domain_scores_gemma":[0.9992499,0.00038511594,0.00009934819,0.00006884694,0.0001157451,0.000080945014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645646,0.0006953004,0.0006015982,0.00089598354,0.0009364273,0.0039183563,0.0017130221,0.0013839495,0.023228751],"category_scores_gemma":[0.003250694,0.0003799635,0.001209717,0.0015178821,0.0013250262,0.0031860904,0.0016666292,0.0016867428,0.0026987342],"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.00047407465,0.00021271559,0.021105047,0.00029220083,0.00017248622,0.0003550726,0.0043871505,0.22455755,0.00089731865,0.6842655,0.017197898,0.046082936],"study_design_scores_gemma":[0.00019684447,0.0002450288,0.012814087,0.00024748317,0.0001854847,0.00019247667,0.0042625307,0.5664496,0.00058558123,0.32581854,0.08890329,0.00009900539],"about_ca_topic_score_codex":0.04205555,"about_ca_topic_score_gemma":0.035495162,"teacher_disagreement_score":0.04205555,"about_ca_system_score_codex":0.0031591302,"about_ca_system_score_gemma":0.0029637585,"threshold_uncertainty_score":0.0836215},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012859472,0.00085358944,0.0044014947,0.00304154,0.0021690459,0.0001945098,0.0072725476,0.007100287,0.97368103],"genre_scores_gemma":[0.0076269573,0.00058800355,0.0034299924,0.0012161186,0.00020756562,0.00020393236,0.0071109026,0.0023039589,0.97731256],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905664,0.00019170425,0.000057550886,0.00020268366,0.00036298085,0.00012845754],"domain_scores_gemma":[0.9976059,0.00024592347,0.000085194755,0.0005854052,0.0008593132,0.000618271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013936602,0.0008509111,0.0006092437,0.00274635,0.0016551946,0.00459827,0.0015528543,0.0011281951,0.64198446],"category_scores_gemma":[0.0048070303,0.000479903,0.0005349217,0.0017236384,0.00056461146,0.0021693902,0.00321528,0.0013430218,0.483474],"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.000116607516,0.0000563526,0.000371824,0.00019448351,0.000008175881,0.000088247914,0.000114453804,0.000086460204,0.00054933684,0.01850578,0.8311817,0.14872658],"study_design_scores_gemma":[0.000015059156,0.000009304614,0.00024172812,0.000039975028,0.0000032016562,0.000067521745,0.000039528375,0.00007502649,0.00016714838,0.0018033664,0.9975339,0.0000041887934],"about_ca_topic_score_codex":0.004155843,"about_ca_topic_score_gemma":0.008312731,"teacher_disagreement_score":0.64198446,"about_ca_system_score_codex":0.0014995422,"about_ca_system_score_gemma":0.00289314,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61321914,0.008355562,0.0008567627,0.19364381,0.00047019217,0.00039961757,0.0032887438,0.000063001135,0.1797032],"genre_scores_gemma":[0.93266666,0.0046211085,0.0009870438,0.0067903358,0.000094980714,0.00023405478,0.0006552257,0.00007118932,0.053879462],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.987117,0.0020268748,0.00075541117,0.00051245856,0.005476357,0.0041117747],"domain_scores_gemma":[0.9527549,0.010559922,0.00567822,0.0012317381,0.011237431,0.018537758],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0062915417,0.00027378145,0.00060881325,0.0029171105,0.020712253,0.0088179875,0.002695056,0.0027591663,0.014938635],"category_scores_gemma":[0.03022114,0.00088047876,0.0006329625,0.010087387,0.0057716267,0.0026066443,0.004829589,0.002523315,0.0005594477],"study_design_candidate":"qualitative","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.00042180638,0.00042871005,0.37382936,0.00084888714,0.00017627125,0.0014705244,0.16830878,0.0007798107,0.00046508928,0.14052609,0.18282408,0.12992062],"study_design_scores_gemma":[0.00014876055,0.000073587755,0.62837577,0.001293725,0.00008070997,0.00036295646,0.14055769,0.0012109336,0.00023345852,0.009195979,0.2182883,0.00017821582],"about_ca_topic_score_codex":0.9954255,"about_ca_topic_score_gemma":0.9987122,"teacher_disagreement_score":0.99724084,"about_ca_system_score_codex":0.22920738,"about_ca_system_score_gemma":0.45795494,"threshold_uncertainty_score":0.8940102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96821535,0.0008959408,0.0019304893,0.00045037994,0.000024854773,0.0002958554,0.015918951,0.00011742607,0.012150911],"genre_scores_gemma":[0.9809625,0.00036371837,0.0020825043,0.00013552717,0.000005956738,0.00014277137,0.006417015,0.00002754909,0.009862341],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99970275,0.000034543325,0.000010732891,0.00005329144,0.000092458606,0.00010622736],"domain_scores_gemma":[0.99905926,0.000060928614,0.00005563874,0.000032025106,0.0006553393,0.0001367971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042655133,0.00047805224,0.00044559818,0.0012050098,0.0020043345,0.0012298573,0.00096104527,0.0005407945,0.0028826704],"category_scores_gemma":[0.0009721479,0.0001821836,0.00039686676,0.002844784,0.0005523165,0.00051599974,0.0009144813,0.0004674341,0.0004073032],"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.0006884645,0.00036026855,0.87128115,0.00047450236,0.00045819848,0.0010252525,0.007309301,0.010475204,0.00632083,0.0011409967,0.01701819,0.083447754],"study_design_scores_gemma":[0.000027489452,0.00003414976,0.97967017,0.00008692508,0.00005695029,0.00004676127,0.0063686976,0.004734683,0.00053257996,0.00010952882,0.00830173,0.000030398409],"about_ca_topic_score_codex":0.99620926,"about_ca_topic_score_gemma":0.9987581,"teacher_disagreement_score":0.01633674,"about_ca_system_score_codex":0.01633674,"about_ca_system_score_gemma":0.014466808,"threshold_uncertainty_score":0.11853188},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013947689,0.014744133,0.00043383756,0.16639301,0.013310862,0.00013946982,0.036677677,0.00044070857,0.75391257],"genre_scores_gemma":[0.038756378,0.0111264065,0.00030205344,0.004906818,0.0032178976,0.00007439547,0.009513264,0.00010384663,0.931999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953544,0.000047065085,0.000018772294,0.000025067122,0.0002566222,0.00011695305],"domain_scores_gemma":[0.99791545,0.00026544768,0.00013873972,0.00007888455,0.00066930545,0.0009322484],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057812204,0.0005028695,0.0003902897,0.0018657928,0.0026673984,0.0044438015,0.00064866996,0.0017390539,0.22472422],"category_scores_gemma":[0.002684069,0.00024709856,0.00031498642,0.0030839997,0.00054916186,0.0013638774,0.000892801,0.0015358252,0.046068735],"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.000008546388,0.000030616273,0.0021865207,0.00002407494,0.0000020503371,0.000020040594,0.000090329726,0.000020837548,0.000010714462,0.0012016717,0.97492933,0.02147529],"study_design_scores_gemma":[0.000008441862,0.000022894634,0.046947733,0.00026983817,0.000008655366,0.00007628598,0.0015644055,0.00018438166,0.000085959626,0.0022094415,0.94860715,0.000014910316],"about_ca_topic_score_codex":0.35497063,"about_ca_topic_score_gemma":0.5928054,"teacher_disagreement_score":0.77527577,"about_ca_system_score_codex":0.004783471,"about_ca_system_score_gemma":0.006179039,"threshold_uncertainty_score":0.7517774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015157958,0.0011779747,0.95154494,0.007493646,0.00023332899,0.00013178022,0.00012643267,0.0016855006,0.022448357],"genre_scores_gemma":[0.3367236,0.0010707573,0.6524248,0.0014885776,0.00021945896,0.00036780597,0.00030063526,0.00061065675,0.0067937034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977258,0.0013270961,0.00012253312,0.00038276523,0.00035033099,0.0000915436],"domain_scores_gemma":[0.9962298,0.0025201726,0.00021595426,0.00058153,0.00022826335,0.0002243142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026837846,0.000913703,0.0005812825,0.00058692537,0.000768792,0.005637101,0.002161136,0.0025036822,0.005260084],"category_scores_gemma":[0.00762108,0.0010742069,0.0015026146,0.00035804682,0.0042571435,0.0087656,0.002206151,0.0031816924,0.0015089263],"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.00037970534,0.00033964796,0.0029251392,0.0009955816,0.00014429324,0.00067714235,0.013682316,0.06902778,0.018993758,0.7187726,0.010412552,0.16364945],"study_design_scores_gemma":[0.00009339816,0.00015817823,0.0012437019,0.00038597666,0.000119823984,0.00049613306,0.001790678,0.33063135,0.0063971644,0.54770404,0.11084947,0.00013001352],"about_ca_topic_score_codex":0.0013500969,"about_ca_topic_score_gemma":0.0016538524,"teacher_disagreement_score":0.005637101,"about_ca_system_score_codex":0.0012407546,"about_ca_system_score_gemma":0.0006718046,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15496416,0.029070713,0.023213468,0.03883742,0.007632949,0.00027244087,0.0012066873,0.0010974279,0.74370474],"genre_scores_gemma":[0.5860802,0.026756857,0.023022726,0.004773157,0.0014613348,0.0004066631,0.00088066957,0.0013056977,0.3553127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.000107230415,0.00003384929,0.00009175185,0.0001674715,0.00014501759],"domain_scores_gemma":[0.9996489,0.000045776596,0.000057074085,0.00003451565,0.00008418577,0.00012955366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047799782,0.00052295334,0.00045314681,0.0018739107,0.0017656116,0.0077804364,0.00049837364,0.00091295206,0.022094507],"category_scores_gemma":[0.0015056647,0.0002505379,0.0003145981,0.0020208373,0.0028106328,0.0033933518,0.0028420852,0.0027027784,0.0041037044],"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.00053683453,0.0003046058,0.005134984,0.0011519217,0.000068375746,0.0015440361,0.027364822,0.0005703391,0.0038662856,0.31794032,0.2223629,0.41915458],"study_design_scores_gemma":[0.000044360087,0.00006060612,0.012660766,0.00066569645,0.000063673986,0.0014034057,0.014416255,0.0004969964,0.0014449047,0.03708921,0.931605,0.00004923184],"about_ca_topic_score_codex":0.00643426,"about_ca_topic_score_gemma":0.012324271,"teacher_disagreement_score":0.022094507,"about_ca_system_score_codex":0.0018560162,"about_ca_system_score_gemma":0.0027154775,"threshold_uncertainty_score":0.073913515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98215044,0.000564863,0.0030446178,0.00021720452,0.000061083905,0.000037483733,0.0009645367,0.00023043746,0.012729293],"genre_scores_gemma":[0.9971239,0.00012768667,0.0006793943,0.000040103932,0.000007840599,0.000013018066,0.0005944682,0.000054483902,0.0013590944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.000032212065,0.0000069384346,0.000039485647,0.00010915883,0.0000688422],"domain_scores_gemma":[0.99959725,0.00014906428,0.000042563857,0.00003387346,0.00014438797,0.00003287995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039210738,0.0005015203,0.000322713,0.00052743015,0.0005220696,0.0005179731,0.00038820633,0.0004130538,0.0034153229],"category_scores_gemma":[0.0009055281,0.00014694406,0.0004554913,0.00046586402,0.00028360446,0.000669148,0.00051009236,0.0005856111,0.0004715936],"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.0009068959,0.00025618158,0.093324296,0.0006418943,0.00022662606,0.0013011117,0.00040787883,0.8097558,0.04868367,0.002978412,0.0051560425,0.036361195],"study_design_scores_gemma":[0.000065533546,0.0015238845,0.1744031,0.00012068947,0.00024258206,0.00054865493,0.001201444,0.7738527,0.035089254,0.0016771973,0.011194791,0.000080245074],"about_ca_topic_score_codex":0.01092714,"about_ca_topic_score_gemma":0.0112065915,"teacher_disagreement_score":0.01092714,"about_ca_system_score_codex":0.0007565121,"about_ca_system_score_gemma":0.00042322723,"threshold_uncertainty_score":0.021727085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072894567,0.0055149496,0.002561419,0.3569766,0.02427293,0.0000721191,0.0005554555,0.0009706432,0.60178643],"genre_scores_gemma":[0.08342685,0.0033154318,0.0020490226,0.06533639,0.0023081235,0.000062880084,0.0004858885,0.00078301074,0.84223235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974831,0.00058892224,0.00008850585,0.00035796533,0.0009438905,0.0005376839],"domain_scores_gemma":[0.9932461,0.0009854173,0.00037947783,0.00062457117,0.0025516402,0.0022128606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018490709,0.00070411235,0.00046422347,0.0011850852,0.011858902,0.006994755,0.0014892224,0.007380322,0.12658821],"category_scores_gemma":[0.023829104,0.0005819205,0.00030425223,0.0006811714,0.0041966885,0.005740683,0.0038103668,0.00736662,0.07620418],"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.000023910112,0.0000119921615,0.00082515617,0.000036864836,0.000004640264,0.00041432047,0.001442238,0.000018412804,0.000100667734,0.010270229,0.956287,0.030564604],"study_design_scores_gemma":[0.0000057838934,0.000009438989,0.0005437202,0.00014625312,0.000004945528,0.00064860017,0.003488783,0.000048001973,0.0001580633,0.003516062,0.9914158,0.000014518024],"about_ca_topic_score_codex":0.066373385,"about_ca_topic_score_gemma":0.12549902,"teacher_disagreement_score":0.9336266,"about_ca_system_score_codex":0.0031888324,"about_ca_system_score_gemma":0.0035844776,"threshold_uncertainty_score":0.42347974},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008503384,0.0005816883,0.0018689311,0.015411339,0.0010865838,0.00010589664,0.0016843382,0.0002791104,0.9704788],"genre_scores_gemma":[0.070371024,0.0009935877,0.0031869242,0.005648565,0.00011306538,0.000046102174,0.0011719668,0.000117438954,0.9183513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993542,0.000031158266,0.0000038765274,0.000026285927,0.00036342014,0.00022100408],"domain_scores_gemma":[0.9994506,0.000027716282,0.000012029242,0.00001972181,0.00032874983,0.00016122092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048031347,0.00066778273,0.00017282911,0.0006438838,0.0029958682,0.0028510995,0.00087033137,0.002315429,0.041509148],"category_scores_gemma":[0.0009775176,0.00012801771,0.00036127926,0.0007164733,0.0007981117,0.00076400145,0.0012994917,0.0017178867,0.005346914],"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.00009565588,0.000231687,0.0027284345,0.00009214273,0.000021532334,0.00016241691,0.00015641634,0.00275547,0.0015638001,0.109190136,0.7956727,0.08732962],"study_design_scores_gemma":[0.000025692114,0.000032127336,0.0024639992,0.000044009794,0.0000068384916,0.000030709198,0.000433416,0.002022274,0.0008456027,0.0060516903,0.9880321,0.000011456894],"about_ca_topic_score_codex":0.87566054,"about_ca_topic_score_gemma":0.9420245,"teacher_disagreement_score":0.12433946,"about_ca_system_score_codex":0.011583809,"about_ca_system_score_gemma":0.03297489,"threshold_uncertainty_score":0.2501434},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017260255,0.00292722,0.007039073,0.108465165,0.009547542,0.0006706831,0.00256759,0.0014989402,0.8500235],"genre_scores_gemma":[0.08764639,0.0008135705,0.003998974,0.015395886,0.0003170932,0.00014806967,0.0011451762,0.00024086305,0.8902939],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985421,0.00014133238,0.000023119434,0.00015115453,0.0005403572,0.00060207094],"domain_scores_gemma":[0.9981963,0.00007731623,0.000028343704,0.000069991285,0.001079402,0.0005486677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732944,0.0005606744,0.00032736917,0.00079896546,0.005940864,0.004060886,0.0011187524,0.005217665,0.07221555],"category_scores_gemma":[0.0028270776,0.0002619617,0.0007543277,0.00050060323,0.0011020462,0.0019357816,0.0023649773,0.0034558417,0.0083164545],"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.00023967061,0.00014119102,0.0028217826,0.0001304127,0.00003365467,0.0011659117,0.0006102294,0.0010218172,0.0015458332,0.12223092,0.82774746,0.042311132],"study_design_scores_gemma":[0.00005012961,0.000037406313,0.0015356361,0.00006670909,0.000010046605,0.00008867751,0.00045810375,0.00081214117,0.00048313584,0.0048292284,0.9916005,0.000028352715],"about_ca_topic_score_codex":0.7742148,"about_ca_topic_score_gemma":0.88443875,"teacher_disagreement_score":0.2257852,"about_ca_system_score_codex":0.01566512,"about_ca_system_score_gemma":0.035139088,"threshold_uncertainty_score":0.45422977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012378395,0.00057615514,0.0014667513,0.0036978945,0.00067431416,0.00010256819,0.004957058,0.0011619225,0.9861255],"genre_scores_gemma":[0.0054062586,0.0004993696,0.0006218721,0.0002941909,0.000026340122,0.000016838523,0.0015269979,0.00025928678,0.9913489],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988845,0.000028473032,0.000011238798,0.00006175801,0.00086295867,0.00015112205],"domain_scores_gemma":[0.9970702,0.00011619325,0.00004664224,0.00013357637,0.0021656302,0.00046780848],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006964258,0.00073873193,0.0006069616,0.0017354649,0.0036100857,0.003463906,0.0010988467,0.0015754782,0.41873178],"category_scores_gemma":[0.0021468746,0.00046837362,0.00039283378,0.0018260663,0.0008107275,0.0012486909,0.0012537541,0.0015763209,0.15747297],"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.000085472,0.000068315414,0.0006098298,0.000101959005,0.000006200115,0.00008278275,0.000056665936,0.00013630032,0.0010277788,0.012960255,0.91361237,0.07125213],"study_design_scores_gemma":[0.000012137956,0.000014223171,0.0005715822,0.000035495745,0.000003502138,0.000043801803,0.00008720479,0.0002651913,0.0011228414,0.00069480226,0.9971419,0.0000070931856],"about_ca_topic_score_codex":0.33223614,"about_ca_topic_score_gemma":0.68099314,"teacher_disagreement_score":0.6677638,"about_ca_system_score_codex":0.0044613685,"about_ca_system_score_gemma":0.014303949,"threshold_uncertainty_score":0.8291086},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023653014,0.013033647,0.81644243,0.03532366,0.0010710792,0.00031374293,0.0003672633,0.00037871086,0.10941644],"genre_scores_gemma":[0.66161555,0.00641009,0.30977702,0.0038399976,0.0029576211,0.000702441,0.00039056927,0.0002058279,0.014100932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97066724,0.018596098,0.0018011773,0.0029394059,0.005088719,0.00090738677],"domain_scores_gemma":[0.86688656,0.10378424,0.008117901,0.010724993,0.00898997,0.0014963199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017482001,0.00076532253,0.0016281512,0.008119511,0.003680061,0.010795988,0.0024077238,0.0026620163,0.006475973],"category_scores_gemma":[0.082752526,0.0005696706,0.0018432215,0.0074701374,0.017620428,0.015221006,0.0049586487,0.0033460287,0.0011232044],"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.000012602195,0.000008456164,0.00022312123,0.0001443113,0.000015975334,0.00004008007,0.00042763696,0.001291866,0.00007139228,0.9835295,0.0019808868,0.012254191],"study_design_scores_gemma":[0.0000073802594,0.0000070428305,0.00008028432,0.00004549173,0.000008537085,0.0000405727,0.00010763935,0.0029898793,0.00013211412,0.9885328,0.008036866,0.000011430312],"about_ca_topic_score_codex":0.0015491423,"about_ca_topic_score_gemma":0.0010044479,"teacher_disagreement_score":0.017482001,"about_ca_system_score_codex":0.0051964233,"about_ca_system_score_gemma":0.0039806287,"threshold_uncertainty_score":0.09245473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5779342,0.0002299283,0.067740545,0.0013342742,0.0001393142,0.00013030355,0.0001478521,0.00027968516,0.35206392],"genre_scores_gemma":[0.96832776,0.00003830798,0.0070284535,0.000067032015,0.000015753723,0.000034666184,0.00007037863,0.000022433735,0.024395265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991059,0.00037317423,0.000029770676,0.00014120965,0.00014335064,0.00020656237],"domain_scores_gemma":[0.9983424,0.00073023903,0.00015197834,0.00010517167,0.0002435124,0.00042673407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087436894,0.00029138284,0.00022827063,0.0004843899,0.001373106,0.0019333196,0.00060542533,0.0005316315,0.0172755],"category_scores_gemma":[0.0040803715,0.00018102517,0.00024884028,0.00030445418,0.0019572154,0.0015123665,0.0014869743,0.0007287029,0.0005576215],"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.00039905732,0.000068903035,0.0042682393,0.000082977895,0.000035429603,0.00037309277,0.0031583842,0.0071787895,0.0043006036,0.94904286,0.0057694283,0.02532219],"study_design_scores_gemma":[0.0002339441,0.00046889525,0.010331809,0.00010336316,0.000050702103,0.0006237301,0.0041833036,0.11148653,0.0050907303,0.7824595,0.08487474,0.000092787224],"about_ca_topic_score_codex":0.0040390864,"about_ca_topic_score_gemma":0.0075384243,"teacher_disagreement_score":0.0172755,"about_ca_system_score_codex":0.0012767585,"about_ca_system_score_gemma":0.00052273954,"threshold_uncertainty_score":0.057792366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105712056,0.00089079444,0.8257496,0.0016816356,0.000118021046,0.0006228452,0.002167193,0.008978462,0.054079447],"genre_scores_gemma":[0.4875059,0.00038020944,0.4729338,0.00024742953,0.00002572908,0.00032152532,0.0014725184,0.0011520295,0.03596077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9989766,0.0003558329,0.000047943937,0.00025976225,0.00026237796,0.00009745777],"domain_scores_gemma":[0.9979386,0.0011421692,0.00014889998,0.00028652648,0.00034242176,0.00014137621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196327,0.00062241557,0.00028979592,0.00173418,0.0012793916,0.0018376582,0.0008294675,0.00048475483,0.015983365],"category_scores_gemma":[0.0062377052,0.0005392668,0.00060409645,0.0010122263,0.0013931028,0.002124506,0.0009699575,0.00087307853,0.001448563],"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.0005834766,0.00019167575,0.015817413,0.0006352165,0.000088732515,0.0007855251,0.009459584,0.05302384,0.061387915,0.47656897,0.04132059,0.34013703],"study_design_scores_gemma":[0.000102625425,0.00032108137,0.014014145,0.0002842958,0.00008342935,0.0005348968,0.0018142768,0.44730303,0.061828144,0.16426152,0.3092575,0.00019511713],"about_ca_topic_score_codex":0.06832727,"about_ca_topic_score_gemma":0.10616816,"teacher_disagreement_score":0.06832727,"about_ca_system_score_codex":0.0038342313,"about_ca_system_score_gemma":0.0029419216,"threshold_uncertainty_score":0.13585913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051970355,0.0077070836,0.6131669,0.013250277,0.0013614317,0.0010442601,0.0013552157,0.007598031,0.3025464],"genre_scores_gemma":[0.35772103,0.0032554944,0.54455,0.0015329539,0.00043387798,0.0008997409,0.001560338,0.0010805234,0.08896596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986242,0.00059883227,0.000039275317,0.00024173399,0.00033200756,0.00016398351],"domain_scores_gemma":[0.99760926,0.0011297602,0.00005783638,0.0002683135,0.00041658324,0.0005182929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020938981,0.0011555491,0.0006042116,0.0010758404,0.0013575953,0.002353861,0.0024139301,0.0009584005,0.030966355],"category_scores_gemma":[0.0063178446,0.00050233287,0.0006526358,0.0012496897,0.0014592349,0.002761064,0.001405112,0.0021101888,0.0035949294],"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.0007239418,0.0008954574,0.0017194609,0.0004612684,0.0000911672,0.00016309394,0.0014714954,0.05109464,0.012196862,0.39299932,0.1520039,0.38617936],"study_design_scores_gemma":[0.00049153616,0.0008474399,0.0035054584,0.0002617232,0.00009059432,0.00019398029,0.00054392277,0.34006727,0.009537074,0.23933698,0.40495786,0.00016621755],"about_ca_topic_score_codex":0.08928094,"about_ca_topic_score_gemma":0.10502524,"teacher_disagreement_score":0.08928094,"about_ca_system_score_codex":0.0050694584,"about_ca_system_score_gemma":0.0038229162,"threshold_uncertainty_score":0.17752254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055313144,0.00028081503,0.74614245,0.0012735575,0.0005498983,0.0010814545,0.00072715734,0.08050781,0.11412366],"genre_scores_gemma":[0.32362956,0.00033754084,0.6178037,0.0012018591,0.00012362783,0.0008425438,0.0020320152,0.006175886,0.047853325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998833,0.00032950751,0.00007539413,0.00017766427,0.00044250334,0.00014199552],"domain_scores_gemma":[0.9990963,0.0003018894,0.000058946276,0.00017018535,0.00017087361,0.00020185606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017761252,0.0008847146,0.00044024314,0.00078044296,0.000439639,0.0021671206,0.002280043,0.0007416341,0.013942541],"category_scores_gemma":[0.0037307083,0.00040274218,0.0009176684,0.0003137199,0.00092512526,0.0035185765,0.0034003542,0.0012850962,0.004429614],"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.002881164,0.0022216546,0.0055235503,0.00095483265,0.0002203322,0.0015427672,0.004742224,0.04612229,0.07641158,0.22770776,0.06539298,0.56627893],"study_design_scores_gemma":[0.0007651181,0.0014370236,0.0023707524,0.00022807033,0.00018851625,0.00096025487,0.0008862562,0.42992738,0.033760864,0.10604043,0.42314994,0.00028542467],"about_ca_topic_score_codex":0.0029047374,"about_ca_topic_score_gemma":0.0037473515,"teacher_disagreement_score":0.013942541,"about_ca_system_score_codex":0.00082433876,"about_ca_system_score_gemma":0.0010777751,"threshold_uncertainty_score":0.046642423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18246302,0.0060911034,0.45307007,0.005717573,0.0058304192,0.0009540895,0.0054812822,0.0121032735,0.32828912],"genre_scores_gemma":[0.664103,0.0018136431,0.19934052,0.00038103628,0.00038261773,0.00026418868,0.00342416,0.0013028997,0.12898791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959224,0.00007858228,0.000024124929,0.000055557997,0.00014085957,0.0001087079],"domain_scores_gemma":[0.9987337,0.00043675042,0.000037886977,0.00011119555,0.00033647582,0.00034409593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092341413,0.00069252425,0.0008741549,0.00058156566,0.0011645888,0.0016808385,0.0014226144,0.000632211,0.05007393],"category_scores_gemma":[0.0023470426,0.00024286185,0.00037332645,0.0007805575,0.000485929,0.00066803355,0.0010293267,0.000930856,0.0037540812],"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.0034478335,0.0006140038,0.0018659271,0.00082778896,0.000062504034,0.00046459027,0.00027540186,0.38727346,0.011746889,0.09787864,0.23352669,0.26201627],"study_design_scores_gemma":[0.0003597101,0.0002741323,0.0011541116,0.00008580486,0.000030163457,0.000080141246,0.000114638184,0.86745805,0.004321439,0.028263941,0.0978083,0.00004958565],"about_ca_topic_score_codex":0.08686793,"about_ca_topic_score_gemma":0.111249626,"teacher_disagreement_score":0.08686793,"about_ca_system_score_codex":0.0033088385,"about_ca_system_score_gemma":0.005770127,"threshold_uncertainty_score":0.1727246},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063674025,0.005182227,0.0680638,0.009440693,0.001488397,0.00029040303,0.0007517468,0.0017285957,0.84938014],"genre_scores_gemma":[0.4522958,0.0038430693,0.15976115,0.0009803649,0.0001343125,0.00018627981,0.0017193016,0.00031980104,0.38075984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999445,0.00014521742,0.000023031489,0.00009222547,0.00018454886,0.0001099403],"domain_scores_gemma":[0.9994537,0.00016918078,0.000030663366,0.000033890083,0.00013621245,0.00017637238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524116,0.00086703786,0.00041899955,0.00062438037,0.002224483,0.002922202,0.00124705,0.0010845336,0.038122028],"category_scores_gemma":[0.0022627057,0.0002911032,0.0003512122,0.00044368053,0.0016645312,0.00094955444,0.0017276856,0.0010987499,0.0035512617],"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.00065484416,0.00041923218,0.004570749,0.000769752,0.00005379104,0.0010053597,0.0031949547,0.040174846,0.0052456353,0.3675914,0.23107865,0.3452407],"study_design_scores_gemma":[0.00008276632,0.00023756441,0.0033906577,0.0006580014,0.00003378927,0.00067652954,0.0043927487,0.071962945,0.002957528,0.14351825,0.77198666,0.00010244673],"about_ca_topic_score_codex":0.12892477,"about_ca_topic_score_gemma":0.319514,"teacher_disagreement_score":0.12892477,"about_ca_system_score_codex":0.0035853703,"about_ca_system_score_gemma":0.0058134077,"threshold_uncertainty_score":0.25634873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88851285,0.005629823,0.00072530156,0.022987384,0.00011328617,0.00014540837,0.017129296,0.00008301689,0.0646736],"genre_scores_gemma":[0.96584296,0.004949781,0.0005636699,0.0012729948,0.000053374926,0.000030701136,0.0048652454,0.000031569056,0.02238967],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986337,0.0000563924,0.000056439854,0.0000765054,0.0008371325,0.0003397872],"domain_scores_gemma":[0.98975056,0.0007405267,0.00076729356,0.00007684549,0.0062008635,0.0024639668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008728722,0.00021048733,0.00014432013,0.0047207386,0.002300759,0.0025821554,0.0006172424,0.00050115155,0.0068630856],"category_scores_gemma":[0.0049276846,0.00022435177,0.00022854436,0.007870117,0.0005125465,0.0009916844,0.0010215918,0.0007304968,0.0009301242],"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.000091504146,0.00009521426,0.89030397,0.00007101452,0.00002149138,0.00019015293,0.0034775902,0.00032517203,0.00048488716,0.0013926403,0.043852463,0.05969394],"study_design_scores_gemma":[0.000004367567,0.000028437964,0.9695831,0.00007591858,0.000008331566,0.00012599205,0.008087274,0.00069727964,0.00018113156,0.00012126618,0.02106837,0.00001847801],"about_ca_topic_score_codex":0.9633659,"about_ca_topic_score_gemma":0.9817625,"teacher_disagreement_score":0.036634088,"about_ca_system_score_codex":0.014838666,"about_ca_system_score_gemma":0.031961743,"threshold_uncertainty_score":0.10766256},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011391946,0.0065627275,0.0013380841,0.0018707545,0.0013680769,0.00004637639,0.001844714,0.00068025,0.98514986],"genre_scores_gemma":[0.002559447,0.0030468206,0.00081446755,0.00038071314,0.00008191066,0.000017532671,0.00084131793,0.00026936812,0.9919883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993462,0.000051557192,0.000026567224,0.00024803213,0.0002455442,0.00008207361],"domain_scores_gemma":[0.99927837,0.00012872166,0.00005118749,0.000119503755,0.00024304158,0.00017913038],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043848966,0.0019306063,0.0010629897,0.0021256409,0.0023397997,0.0065751635,0.0015288193,0.002741475,0.81692976],"category_scores_gemma":[0.0014956824,0.00067776465,0.0007585208,0.0017779219,0.0008488796,0.0033238507,0.0029018496,0.0022404364,0.5561206],"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.0003702499,0.00016550272,0.001058396,0.0006980795,0.0000477418,0.0012515021,0.0003836595,0.0009251663,0.0026867485,0.056341924,0.53973335,0.3963377],"study_design_scores_gemma":[0.000018401524,0.000023247954,0.0005159826,0.00022594718,0.0000072370767,0.0002251672,0.000108947315,0.0001288612,0.00030588414,0.0034684362,0.99496126,0.000010602618],"about_ca_topic_score_codex":0.010376341,"about_ca_topic_score_gemma":0.02817234,"teacher_disagreement_score":0.18307024,"about_ca_system_score_codex":0.0018171896,"about_ca_system_score_gemma":0.0019069059,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043865375,0.0010480682,0.8872505,0.0013899811,0.0002941942,0.0003463877,0.00029854622,0.00527564,0.060231294],"genre_scores_gemma":[0.34392595,0.00043033037,0.64107955,0.00035244983,0.00011188538,0.0002935151,0.00042890766,0.00065317895,0.012724356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851006,0.0005718933,0.000043813783,0.00017737325,0.00055793754,0.00013896107],"domain_scores_gemma":[0.996358,0.0021016444,0.00017914492,0.00057683495,0.00056658447,0.00021781515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021537389,0.00068629277,0.00078371953,0.0012139868,0.00060212624,0.0014781407,0.0020462302,0.0011450519,0.011678031],"category_scores_gemma":[0.011411774,0.00046537342,0.00063915364,0.0014339774,0.0010194741,0.0016218872,0.0017380185,0.0016860323,0.0018640282],"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.0006686891,0.00034228928,0.002748147,0.00024502483,0.00008859767,0.00013310833,0.0002520937,0.48467872,0.0046395995,0.20188648,0.01845562,0.28586167],"study_design_scores_gemma":[0.000048215305,0.00008933206,0.0002929734,0.000028703986,0.000024209983,0.000031131953,0.000014626486,0.9615032,0.0010417203,0.028061364,0.00885211,0.000012345512],"about_ca_topic_score_codex":0.022636686,"about_ca_topic_score_gemma":0.035259366,"teacher_disagreement_score":0.022636686,"about_ca_system_score_codex":0.0018869432,"about_ca_system_score_gemma":0.0030461852,"threshold_uncertainty_score":0.04500985},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047415264,0.6406551,0.03942345,0.0034989852,0.0011948978,0.00023226277,0.0010544494,0.0009388498,0.26558673],"genre_scores_gemma":[0.21696289,0.5908645,0.036272824,0.0013956754,0.0006317441,0.00015361221,0.0032870157,0.0002658536,0.1501659],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989912,0.00010661123,0.000070939794,0.0001397096,0.0005731394,0.0001183321],"domain_scores_gemma":[0.99825555,0.00048781704,0.00012158984,0.00007514086,0.00079396245,0.00026593145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011471556,0.00066907494,0.00070369744,0.0033424937,0.0005727185,0.0023458614,0.0012438169,0.0009459123,0.009826079],"category_scores_gemma":[0.0025104699,0.0004428099,0.00032219038,0.0048490944,0.00037482078,0.0021014463,0.00053547474,0.0006220864,0.0043620486],"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.00013945754,0.00023647874,0.0056997463,0.0011710281,0.000030673287,0.00012392495,0.0002796383,0.002640263,0.0010197274,0.008148855,0.03371652,0.9467937],"study_design_scores_gemma":[0.000018386077,0.0002997446,0.016043637,0.0010401506,0.000047944177,0.0009958082,0.0006069275,0.0073636775,0.0016501226,0.005304035,0.96658915,0.000040428913],"about_ca_topic_score_codex":0.024821227,"about_ca_topic_score_gemma":0.03265854,"teacher_disagreement_score":0.024821227,"about_ca_system_score_codex":0.0017351089,"about_ca_system_score_gemma":0.0021331485,"threshold_uncertainty_score":0.04935348},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055607646,0.00008360304,0.9456299,0.000062579486,0.000057005138,0.00022334278,0.00045459063,0.042700306,0.005227934],"genre_scores_gemma":[0.121261686,0.0003718788,0.8490214,0.00016888701,0.000037926133,0.00072193093,0.0018682521,0.009154017,0.017393993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993931,0.00011480059,0.00006244726,0.000110101726,0.00027016154,0.00004939113],"domain_scores_gemma":[0.99749786,0.0013962422,0.00014422192,0.0004629803,0.0002852154,0.00021335708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010355312,0.0011773956,0.0004958683,0.0009110008,0.00037041557,0.0013902402,0.0022787307,0.0009957412,0.016808642],"category_scores_gemma":[0.005367075,0.00086016394,0.00094894675,0.00033155383,0.0007404143,0.0022758846,0.0019218597,0.001627054,0.0038792456],"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.0011365911,0.00055150443,0.0040113833,0.0019798544,0.00018844118,0.0018743543,0.0029990668,0.043446504,0.15497348,0.060808938,0.05846323,0.6695667],"study_design_scores_gemma":[0.00042829564,0.0006125946,0.0028803234,0.0003248376,0.00016240278,0.0028024728,0.00036478683,0.4287256,0.094272025,0.029330641,0.43979234,0.0003036338],"about_ca_topic_score_codex":0.0008968992,"about_ca_topic_score_gemma":0.0013885675,"teacher_disagreement_score":0.016808642,"about_ca_system_score_codex":0.00031344904,"about_ca_system_score_gemma":0.0007659559,"threshold_uncertainty_score":0.056230485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002244796,0.99550796,0.00018508188,0.00039529498,0.00020088973,0.000010283547,0.00003697693,0.000010470802,0.00342851],"genre_scores_gemma":[0.0019409425,0.99673164,0.00022854652,0.00026585133,0.0001388952,0.0000117252,0.00006240028,0.0000062153886,0.0006136905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995534,0.00009198274,0.000079780446,0.00007227552,0.00015518811,0.000047381272],"domain_scores_gemma":[0.9981743,0.0013470046,0.00014439628,0.000027466993,0.00022389907,0.00008293697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288951,0.0013896908,0.0013329288,0.0029153093,0.00049751333,0.0024041806,0.0014189105,0.0017353039,0.008006417],"category_scores_gemma":[0.0032453449,0.0004839757,0.00066524884,0.0033735826,0.0009549592,0.0027125296,0.0010335738,0.0013744622,0.0026285658],"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.00008216426,0.00008874735,0.00040584544,0.03602865,0.0001239,0.00010362524,0.00021603554,0.0010917963,0.00019992316,0.014719173,0.04432243,0.9026176],"study_design_scores_gemma":[0.000014203099,0.0000677309,0.0009941566,0.020228961,0.00013468535,0.00029576532,0.00020761362,0.00019801524,0.00013843944,0.0056653116,0.9720324,0.00002255423],"about_ca_topic_score_codex":0.0036361474,"about_ca_topic_score_gemma":0.005743307,"teacher_disagreement_score":0.008006417,"about_ca_system_score_codex":0.001131931,"about_ca_system_score_gemma":0.0027036567,"threshold_uncertainty_score":0.026784182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08221695,0.00035533097,0.8927882,0.0011698474,0.00014849711,0.00018305355,0.00022618438,0.00072724815,0.022184707],"genre_scores_gemma":[0.94994766,0.0000936322,0.044629145,0.000104683335,0.00004235256,0.00015972414,0.0000721364,0.00003434666,0.004916309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992279,0.00025099746,0.000057328798,0.00014182966,0.00019045032,0.00013153716],"domain_scores_gemma":[0.997051,0.0016528672,0.0003526034,0.00023541668,0.0004313812,0.00027673072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463995,0.00075624074,0.0012993922,0.0006031572,0.0010472175,0.0022316861,0.00216096,0.0016903856,0.006676185],"category_scores_gemma":[0.0049076453,0.0004943473,0.0005640588,0.0006735252,0.0013774146,0.0015050998,0.0033750131,0.0012080905,0.0006330473],"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.00015198936,0.00006913863,0.0005874049,0.000084528925,0.00005589659,0.00018323278,0.00012235141,0.9119985,0.0013559647,0.071286134,0.0011646107,0.0129401935],"study_design_scores_gemma":[0.0000151076165,0.000017712218,0.000052207564,0.0000039823367,0.0000053034087,0.000012106371,0.000008291121,0.9891679,0.00010698829,0.0102932,0.00031304112,0.0000040972495],"about_ca_topic_score_codex":0.007934604,"about_ca_topic_score_gemma":0.007104816,"teacher_disagreement_score":0.007934604,"about_ca_system_score_codex":0.0015209262,"about_ca_system_score_gemma":0.0016477869,"threshold_uncertainty_score":0.022334099},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034374762,0.14664145,0.06979472,0.0454113,0.026842073,0.0007112329,0.0053579826,0.0042079,0.6666586],"genre_scores_gemma":[0.08695788,0.04854008,0.030901939,0.0019949926,0.0022356922,0.0006582443,0.008339665,0.0011765388,0.81919485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917763,0.00021138511,0.000044332817,0.00009823872,0.00032321617,0.00014512998],"domain_scores_gemma":[0.99862325,0.00043496373,0.000041002757,0.00012107851,0.00043865852,0.0003410989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021378582,0.0010627264,0.0007433847,0.0016636336,0.0015979207,0.00688308,0.001107291,0.0013983207,0.051930316],"category_scores_gemma":[0.0024201756,0.0005115499,0.0004099657,0.0019441943,0.0016303678,0.0029578211,0.003221884,0.0025610426,0.012212043],"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.0004239627,0.00029645502,0.0011852954,0.00059743633,0.000047761758,0.000121259814,0.000956693,0.0017099724,0.0049232836,0.037833855,0.6421467,0.30975732],"study_design_scores_gemma":[0.000033372653,0.00005335947,0.0025420352,0.00032362287,0.000024830744,0.000110421766,0.00087193464,0.0022627905,0.0031834166,0.006633927,0.983937,0.000023233479],"about_ca_topic_score_codex":0.025784977,"about_ca_topic_score_gemma":0.042913936,"teacher_disagreement_score":0.051930316,"about_ca_system_score_codex":0.00256945,"about_ca_system_score_gemma":0.0039767814,"threshold_uncertainty_score":0.17372417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023307385,0.033946384,0.2441678,0.018826362,0.08926492,0.0010642546,0.0056856303,0.008077824,0.57565945],"genre_scores_gemma":[0.04807165,0.015481776,0.068577595,0.002259011,0.0049816566,0.0007211528,0.013084425,0.0021284642,0.8446942],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991636,0.00023078987,0.0000481823,0.0001354157,0.0002978985,0.00012408325],"domain_scores_gemma":[0.99776196,0.00039541937,0.000057399895,0.00039935464,0.0008377333,0.0005481094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022544125,0.0009976337,0.001350897,0.0010570684,0.001106029,0.0049010944,0.0013429231,0.001190592,0.13206963],"category_scores_gemma":[0.0031173443,0.00031577208,0.0007814253,0.0015821726,0.0010561047,0.0021480415,0.0024679266,0.0026678576,0.056157283],"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.00031092836,0.00028113017,0.0006398993,0.00032284294,0.00005455019,0.000102680366,0.00012326508,0.0008870128,0.002417848,0.008698523,0.7434047,0.24275665],"study_design_scores_gemma":[0.00006245086,0.00012530279,0.0020916078,0.00028220133,0.00005884922,0.00021841504,0.00025447228,0.0084847035,0.002394604,0.010460962,0.97553545,0.000031004853],"about_ca_topic_score_codex":0.005805077,"about_ca_topic_score_gemma":0.010789233,"teacher_disagreement_score":0.13206963,"about_ca_system_score_codex":0.0008603754,"about_ca_system_score_gemma":0.0027183224,"threshold_uncertainty_score":0.44181693},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061398516,0.011728839,0.039985072,0.043515135,0.024282483,0.00010575836,0.0012760903,0.0011700351,0.8717968],"genre_scores_gemma":[0.16823009,0.01660062,0.02476518,0.012389194,0.013782762,0.0003040456,0.0046349284,0.0020898401,0.75720346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99893695,0.00031389817,0.000081555256,0.0002043116,0.0003255466,0.00013764268],"domain_scores_gemma":[0.998095,0.00095959526,0.00008496675,0.00021743502,0.0003004443,0.00034265223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081879017,0.00089856965,0.00073602266,0.0007807669,0.0025858188,0.0062606814,0.001904566,0.0018962305,0.09298442],"category_scores_gemma":[0.005419649,0.0003658079,0.00055600674,0.0007542957,0.0019515435,0.009562668,0.0037819222,0.0032794042,0.015972741],"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.000042620486,0.000027074777,0.00009004567,0.00011760893,0.000009742821,0.00003621907,0.0005127806,0.00037376824,0.0001769045,0.60133487,0.35842887,0.03884949],"study_design_scores_gemma":[0.000009076445,0.000013701456,0.00010217265,0.0001070994,0.000005689718,0.0000728122,0.00023362563,0.00065812067,0.0001877906,0.17094773,0.8276539,0.000008317568],"about_ca_topic_score_codex":0.0017965768,"about_ca_topic_score_gemma":0.0042247814,"teacher_disagreement_score":0.09298442,"about_ca_system_score_codex":0.0016882392,"about_ca_system_score_gemma":0.001145054,"threshold_uncertainty_score":0.3110639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23509984,0.0008517723,0.74870217,0.0008933012,0.00020169682,0.00023723506,0.002005614,0.0038588408,0.008149615],"genre_scores_gemma":[0.75842845,0.00033386587,0.2251292,0.00027640956,0.000055656226,0.00014736614,0.004764024,0.00021621276,0.010648817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993414,0.0002578258,0.000037403315,0.00023149254,0.0000756161,0.000056237826],"domain_scores_gemma":[0.9984534,0.00073283154,0.00016009298,0.0004183331,0.00014973042,0.00008560804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008493173,0.0010761253,0.00053918245,0.0007917503,0.00032930492,0.0013549242,0.0015226832,0.0014177327,0.0039919103],"category_scores_gemma":[0.005582466,0.00042237015,0.00091974734,0.00088478724,0.00086377986,0.0034028906,0.0010389898,0.0018984147,0.0014996263],"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.00074166636,0.00056176074,0.017059732,0.00027738625,0.00014132276,0.0002650881,0.0004382616,0.5231293,0.004924769,0.031150509,0.022043701,0.39926648],"study_design_scores_gemma":[0.000011163978,0.00004717081,0.0008426117,0.000016021519,0.0000062703007,0.000045742112,0.000032592758,0.9876633,0.0008611101,0.008764705,0.0016983834,0.0000109373395],"about_ca_topic_score_codex":0.004910818,"about_ca_topic_score_gemma":0.010729077,"teacher_disagreement_score":0.004910818,"about_ca_system_score_codex":0.0008958222,"about_ca_system_score_gemma":0.00051416794,"threshold_uncertainty_score":0.013354242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00280309,0.024624629,0.0057353675,0.01808652,0.004402074,0.000026002672,0.0000858941,0.00040980536,0.9438266],"genre_scores_gemma":[0.015802525,0.009134946,0.0019392213,0.004232941,0.00072603,0.000023492206,0.00009018169,0.00031528054,0.96773547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993729,0.00014459544,0.000019232215,0.00012923374,0.000254143,0.000080017926],"domain_scores_gemma":[0.9995913,0.00012466098,0.000013327498,0.000053362186,0.00011241621,0.00010496925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065807404,0.0006639843,0.00038541216,0.0009211571,0.0028537593,0.007144057,0.00076492707,0.0020573128,0.057966106],"category_scores_gemma":[0.0017167332,0.00033031453,0.00026099614,0.0008830694,0.0030101284,0.008461903,0.002251138,0.0040294225,0.018678982],"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.000032106036,0.000042694483,0.00012942005,0.00013713105,0.0000041951735,0.00007365206,0.0025260546,0.00016010951,0.0003459868,0.4676408,0.41387844,0.11502946],"study_design_scores_gemma":[0.0000011646669,0.0000059131767,0.000053406915,0.00007023495,7.6234585e-7,0.0000636523,0.0002275951,0.00008136153,0.00007381613,0.01211583,0.987303,0.0000031869458],"about_ca_topic_score_codex":0.0041356646,"about_ca_topic_score_gemma":0.009131339,"teacher_disagreement_score":0.057966106,"about_ca_system_score_codex":0.0027218575,"about_ca_system_score_gemma":0.0017204235,"threshold_uncertainty_score":0.19391596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00798705,0.00687031,0.97160846,0.000824388,0.00012353183,0.000205947,0.0001041968,0.0003049295,0.011971171],"genre_scores_gemma":[0.20087269,0.0068524247,0.7862915,0.00046841553,0.00024775814,0.00078006194,0.00020794262,0.00036681324,0.0039124615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807286,0.001012746,0.0000848473,0.0001620418,0.0005489578,0.00011846676],"domain_scores_gemma":[0.99846137,0.0008726637,0.00015046753,0.00025199167,0.00018674678,0.00007677445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002733845,0.0014317436,0.0017604522,0.0023499886,0.0009305111,0.0030831879,0.0025666105,0.0016379755,0.0021630113],"category_scores_gemma":[0.0057849945,0.0009288454,0.0016754143,0.0024114512,0.0026839415,0.00301088,0.0021502513,0.002493213,0.00040180743],"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.000042627813,0.000067403365,0.00051049737,0.00036447507,0.00011110234,0.00006014249,0.00013595093,0.7047684,0.0009023301,0.24242894,0.001896066,0.04871197],"study_design_scores_gemma":[0.000023100638,0.000069890666,0.0002480478,0.00012402856,0.000028030765,0.00004738452,0.000059236354,0.88104165,0.00044404017,0.109138414,0.008751995,0.000024137082],"about_ca_topic_score_codex":0.00992737,"about_ca_topic_score_gemma":0.011995018,"teacher_disagreement_score":0.00992737,"about_ca_system_score_codex":0.0017574197,"about_ca_system_score_gemma":0.0037126567,"threshold_uncertainty_score":0.019739151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0970965,0.0011478357,0.87712944,0.0004879858,0.00014163865,0.00016445297,0.0001137621,0.0011259347,0.022592513],"genre_scores_gemma":[0.93732804,0.00024522966,0.058972772,0.000111224486,0.000033708584,0.00010021059,0.00009445893,0.00006251076,0.0030517695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995191,0.0001271128,0.000030441073,0.00010449515,0.00013666038,0.000082254024],"domain_scores_gemma":[0.99898905,0.000554215,0.000098200144,0.0001223877,0.0001505999,0.00008544103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061486,0.0010496735,0.00082466565,0.00032760928,0.00034207146,0.0010455069,0.0017912589,0.0008862181,0.003734396],"category_scores_gemma":[0.0028885535,0.0003424227,0.0004699545,0.00018978056,0.0009610988,0.0011235452,0.0013797205,0.0015625814,0.00043890288],"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.00018155658,0.00012583446,0.0006778198,0.0001374436,0.00005227069,0.000046040605,0.00006182561,0.8935911,0.0018759054,0.01938612,0.0012019748,0.082662165],"study_design_scores_gemma":[0.000011673805,0.00003512881,0.00004731897,0.000005568031,0.0000031408117,0.0000036799174,0.0000028465556,0.9966989,0.00027692097,0.0026476742,0.00026424715,0.0000028982204],"about_ca_topic_score_codex":0.007460523,"about_ca_topic_score_gemma":0.007793696,"teacher_disagreement_score":0.007460523,"about_ca_system_score_codex":0.0009588475,"about_ca_system_score_gemma":0.0010197321,"threshold_uncertainty_score":0.014834225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45552352,0.0003768635,0.539957,0.00041867772,0.000025952024,0.00022001528,0.00022014666,0.00057610596,0.0026816104],"genre_scores_gemma":[0.94863707,0.00012500506,0.0504894,0.000046787663,0.0000100449315,0.000102322185,0.00019046113,0.00003270413,0.00036615104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996033,0.0021209947,0.00022382416,0.00047133805,0.00082532887,0.00032555108],"domain_scores_gemma":[0.9669744,0.027678125,0.0021389816,0.0016686613,0.0007189613,0.0008209261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070238872,0.0015185045,0.0013638963,0.0014139317,0.0006076015,0.002179405,0.0010512233,0.0012949347,0.0013565233],"category_scores_gemma":[0.035520718,0.00085137534,0.0010351144,0.0008068701,0.0026603332,0.0042128465,0.0026083519,0.0018262106,0.00014507872],"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.000103411054,0.00005149901,0.0033388585,0.000046060733,0.000047681202,0.000040483643,0.00013395383,0.975637,0.00031126582,0.012617537,0.00009478967,0.0075775287],"study_design_scores_gemma":[0.000012808729,0.000053375657,0.00035375849,0.000011092549,0.000008866629,0.000007983113,0.00003242264,0.9735475,0.0003083667,0.02556114,0.00009578709,0.0000068915083],"about_ca_topic_score_codex":0.0050388663,"about_ca_topic_score_gemma":0.00539349,"teacher_disagreement_score":0.0070238872,"about_ca_system_score_codex":0.002327178,"about_ca_system_score_gemma":0.0019326361,"threshold_uncertainty_score":0.03714633},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07773283,0.0006648299,0.89555997,0.0006152671,0.00018150372,0.00094533735,0.0022025162,0.013133192,0.008964557],"genre_scores_gemma":[0.32889432,0.00039144338,0.66297925,0.00035135064,0.00006344025,0.0018106969,0.0025212867,0.0017079226,0.0012803563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898642,0.0059688017,0.0005715957,0.00087384565,0.0023171636,0.00040437223],"domain_scores_gemma":[0.9652825,0.026485398,0.0010339275,0.004837141,0.0016385817,0.0007224579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012651713,0.0031376788,0.0018337693,0.004268441,0.0007767891,0.0031227847,0.0035045259,0.0019423892,0.0036390782],"category_scores_gemma":[0.05854569,0.0008880499,0.0013232682,0.0027933763,0.0020352209,0.004038066,0.0036426398,0.0038066597,0.0009380704],"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.0009854488,0.0013895386,0.012030731,0.0011036145,0.0008550601,0.0002840188,0.00061095256,0.6351064,0.0046208557,0.09139501,0.032242868,0.21937545],"study_design_scores_gemma":[0.00013244837,0.0003496339,0.00094157946,0.000060905717,0.000040918952,0.000092802926,0.000081219354,0.9299316,0.0037364499,0.060072206,0.004514405,0.000045872086],"about_ca_topic_score_codex":0.0023926822,"about_ca_topic_score_gemma":0.004406882,"teacher_disagreement_score":0.012651713,"about_ca_system_score_codex":0.0014570201,"about_ca_system_score_gemma":0.0018442789,"threshold_uncertainty_score":0.06690943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01680033,0.00020317109,0.9795767,0.00023682872,0.000024525989,0.000059546146,0.00004161053,0.00038016986,0.0026772076],"genre_scores_gemma":[0.5433239,0.00019685719,0.45279515,0.00022845049,0.000062941064,0.00034215144,0.00020722169,0.00018516758,0.0026582251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968401,0.0018357498,0.00009705866,0.00029883403,0.0006708477,0.0002573959],"domain_scores_gemma":[0.98818076,0.009398948,0.00062322605,0.0008887605,0.00066271186,0.000245502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004792041,0.0011620584,0.0018691159,0.0012454885,0.00069222297,0.0015784738,0.0022117957,0.0014699643,0.0027504666],"category_scores_gemma":[0.022429947,0.0009334752,0.0008891498,0.0010311897,0.0016480114,0.0023661219,0.0017237879,0.0021763346,0.00053548825],"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.000090536436,0.000050572995,0.0006453717,0.000039687555,0.000037847996,0.0000453528,0.00005092252,0.94233376,0.00034299432,0.04032935,0.00074708695,0.015286543],"study_design_scores_gemma":[0.000007037136,0.00000568777,0.000024116805,0.0000035131818,0.0000023340826,0.000005388659,0.0000027160506,0.9904578,0.00009871627,0.009284487,0.00010617043,0.0000020009643],"about_ca_topic_score_codex":0.006164158,"about_ca_topic_score_gemma":0.0074905357,"teacher_disagreement_score":0.006164158,"about_ca_system_score_codex":0.0019742476,"about_ca_system_score_gemma":0.0023171944,"threshold_uncertainty_score":0.025343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070577464,0.00010377966,0.98988265,0.00008801847,0.000034262444,0.000112570015,0.00004856328,0.0011603682,0.0015119218],"genre_scores_gemma":[0.26655006,0.00008654267,0.7298406,0.00018222822,0.00004296427,0.00048925367,0.00029476424,0.0005205042,0.0019930752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938292,0.0032418552,0.0003316604,0.0006494608,0.0016469135,0.00030101297],"domain_scores_gemma":[0.98498464,0.009817747,0.0007289407,0.0019317411,0.002163832,0.00037314568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010611146,0.0010602499,0.001185722,0.0011510169,0.00082750217,0.0023182484,0.0021065953,0.0013791162,0.006285802],"category_scores_gemma":[0.039319314,0.0006240199,0.00073460996,0.00067448936,0.0014288259,0.0029688356,0.0028487092,0.002535491,0.0011864828],"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.001160065,0.00064415945,0.0039575025,0.0003656093,0.00016066595,0.00016190214,0.00033553972,0.3574295,0.010577229,0.12355832,0.007672857,0.4939767],"study_design_scores_gemma":[0.000089164816,0.0001891912,0.00039986704,0.00003935894,0.000016178545,0.000047750615,0.000041746454,0.9517625,0.0061516594,0.03886659,0.0023690492,0.000027052294],"about_ca_topic_score_codex":0.002033068,"about_ca_topic_score_gemma":0.0022729295,"teacher_disagreement_score":0.010611146,"about_ca_system_score_codex":0.0013450109,"about_ca_system_score_gemma":0.0018912499,"threshold_uncertainty_score":0.056117773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35902068,0.00010025345,0.6261257,0.00036602982,0.000065659835,0.00050536275,0.000057465113,0.00066779694,0.013091023],"genre_scores_gemma":[0.750547,0.000033686916,0.24553761,0.00014258437,0.000012315013,0.00043684084,0.00006983914,0.00006829181,0.0031517325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978504,0.0010377232,0.00008859554,0.00025965285,0.0005700469,0.00019358282],"domain_scores_gemma":[0.9945762,0.0030367633,0.0006510663,0.00093550223,0.0005028146,0.0002976945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004809344,0.00087435934,0.0006851766,0.0007943136,0.0007655855,0.0012706957,0.0022905772,0.0011385281,0.002385594],"category_scores_gemma":[0.010146673,0.00046387952,0.00068261154,0.00036806293,0.001775383,0.0012166128,0.0028179274,0.0012143406,0.00033046733],"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.0005416651,0.00081017986,0.0038814659,0.00009674019,0.00015591313,0.00039949425,0.00075621356,0.7885231,0.010275852,0.12699781,0.0010851733,0.066476434],"study_design_scores_gemma":[0.00008544616,0.00024782054,0.00024843766,0.000010018418,0.000027426015,0.000078232784,0.0000489628,0.9650958,0.005832432,0.026570015,0.001738198,0.000017240174],"about_ca_topic_score_codex":0.0009450966,"about_ca_topic_score_gemma":0.0011313823,"teacher_disagreement_score":0.004809344,"about_ca_system_score_codex":0.0009945427,"about_ca_system_score_gemma":0.0008317656,"threshold_uncertainty_score":0.025434554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050763953,0.00020860547,0.93630725,0.00046754073,0.000025152221,0.00027238048,0.00021352309,0.00022534752,0.011516264],"genre_scores_gemma":[0.7216289,0.00046911646,0.26484156,0.00024822543,0.000052103525,0.0006337945,0.00068804633,0.00014394354,0.011294225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973232,0.0012769838,0.00014653549,0.00059870095,0.00041203125,0.00024242843],"domain_scores_gemma":[0.9944457,0.003248815,0.00055467384,0.0007373671,0.0005526523,0.00046077004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028664595,0.0014444772,0.001750791,0.0016524792,0.0009172497,0.0024688025,0.0025702273,0.0018478779,0.007294842],"category_scores_gemma":[0.01375795,0.00066722574,0.001306984,0.0014075213,0.0021972342,0.0035623517,0.0022481286,0.0021149928,0.0013278062],"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.00012512981,0.000092074995,0.001136867,0.00012564029,0.00009514138,0.00010428201,0.00036125115,0.5505448,0.00097001035,0.41869977,0.0022033036,0.025541617],"study_design_scores_gemma":[0.00002915397,0.000034440895,0.00021939882,0.000017242082,0.0000136338995,0.00003633412,0.00007712883,0.7795248,0.00028077568,0.21850598,0.0012460422,0.000015120914],"about_ca_topic_score_codex":0.002726494,"about_ca_topic_score_gemma":0.0026329597,"teacher_disagreement_score":0.007294842,"about_ca_system_score_codex":0.0034266685,"about_ca_system_score_gemma":0.0016410031,"threshold_uncertainty_score":0.024862349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017992511,0.00007001835,0.97557473,0.0002471646,0.000039074985,0.000069371905,0.0001350968,0.00065653725,0.005215494],"genre_scores_gemma":[0.7310089,0.00013455159,0.2556828,0.00016720785,0.000047512738,0.00033422263,0.000392742,0.00014994119,0.012082155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989987,0.00026949306,0.000057909197,0.00023745421,0.0003081443,0.0001283388],"domain_scores_gemma":[0.9967513,0.0016574406,0.0003045033,0.0007260982,0.00040140428,0.00015921006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014245652,0.0010811784,0.0011864591,0.0003859094,0.0005810648,0.0020467492,0.003190091,0.0019207881,0.0062606484],"category_scores_gemma":[0.0077922954,0.0005795769,0.0008634672,0.00041063575,0.001150167,0.003072237,0.0028758242,0.002622163,0.0012445209],"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.000116782365,0.00008074379,0.001187261,0.00007527922,0.000034966914,0.00013201222,0.00016371769,0.9125012,0.0013287946,0.051745687,0.0010591013,0.03157446],"study_design_scores_gemma":[0.000007822309,0.000009801759,0.000045383735,0.0000026581752,0.000003183568,0.000011047405,0.0000055200508,0.98958606,0.000249095,0.00957144,0.00050485367,0.0000031301965],"about_ca_topic_score_codex":0.0038331808,"about_ca_topic_score_gemma":0.00524082,"teacher_disagreement_score":0.0062606484,"about_ca_system_score_codex":0.00087834324,"about_ca_system_score_gemma":0.0013416378,"threshold_uncertainty_score":0.020944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04465351,0.0003581091,0.94391453,0.00067008275,0.00007892237,0.00015912105,0.000104235565,0.00032719824,0.009734252],"genre_scores_gemma":[0.9056,0.00039850821,0.0888412,0.00025199322,0.00008033751,0.00026939547,0.00014459221,0.000074386684,0.004339602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454224,0.0031076968,0.00021235722,0.00061329105,0.0009744416,0.00055001694],"domain_scores_gemma":[0.9806207,0.014486379,0.0013335859,0.0022641034,0.0005515683,0.0007437574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007692006,0.0019642967,0.0015943008,0.0010307231,0.0012615432,0.002845019,0.001926986,0.0017286752,0.0049429126],"category_scores_gemma":[0.020681717,0.00072910474,0.0013815397,0.0007221702,0.0035424011,0.005305379,0.005800522,0.005029576,0.0005897858],"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.00021334442,0.00008143122,0.0005268323,0.0000946767,0.0000740185,0.00015034608,0.00020060096,0.6934099,0.0012125635,0.28965753,0.0009837822,0.013395039],"study_design_scores_gemma":[0.000020686432,0.00004907808,0.00007134441,0.000016750386,0.00001287953,0.00003089214,0.0000303227,0.7577269,0.00037952987,0.24096234,0.0006875876,0.000011747126],"about_ca_topic_score_codex":0.0017104807,"about_ca_topic_score_gemma":0.0016335244,"teacher_disagreement_score":0.007692006,"about_ca_system_score_codex":0.0024174142,"about_ca_system_score_gemma":0.0017600785,"threshold_uncertainty_score":0.040679693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0646653,0.00073246215,0.9250493,0.0011280421,0.00008978359,0.00023142059,0.00015587779,0.00045420666,0.007493571],"genre_scores_gemma":[0.8600533,0.00040173926,0.13464807,0.00041453057,0.00010832193,0.00055781344,0.00027734935,0.00016745306,0.0033713393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99444085,0.0038665733,0.00017255502,0.00044980965,0.0006785222,0.0003916134],"domain_scores_gemma":[0.96053946,0.034028105,0.0018221585,0.0017712563,0.0009203101,0.0009188583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00800558,0.0013573897,0.002161027,0.0009697944,0.0007053511,0.001695611,0.0027490177,0.0019045713,0.003104898],"category_scores_gemma":[0.035984073,0.0007861231,0.0010907453,0.001165968,0.0028102829,0.0026122164,0.0022903406,0.0025741104,0.00036537173],"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.00030721977,0.0001421458,0.0010749265,0.00009937818,0.0000838039,0.0000778897,0.00008300318,0.9181818,0.0002901824,0.06568128,0.00095588196,0.013022355],"study_design_scores_gemma":[0.000021114945,0.000024980314,0.0000730475,0.000008341447,0.000007525197,0.000008764233,0.000004421621,0.97583985,0.00010616213,0.023732418,0.00016907565,0.00000430994],"about_ca_topic_score_codex":0.0040721484,"about_ca_topic_score_gemma":0.0040779016,"teacher_disagreement_score":0.00800558,"about_ca_system_score_codex":0.0024383084,"about_ca_system_score_gemma":0.0027853956,"threshold_uncertainty_score":0.042338014},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03547058,0.009397259,0.8327449,0.084131114,0.0017959082,0.00018296053,0.0003327477,0.00032029557,0.035624333],"genre_scores_gemma":[0.68499404,0.0070441216,0.28938508,0.0052809855,0.0032366111,0.00052915904,0.00049542065,0.00022156961,0.0088130655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99350595,0.0037464332,0.00037405282,0.0009737537,0.0010683648,0.0003314068],"domain_scores_gemma":[0.9840333,0.011576828,0.00089617696,0.0010380475,0.0013008694,0.0011547355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007468098,0.0007935211,0.0010316623,0.001219658,0.0027049824,0.01055895,0.0020156319,0.003964467,0.0033634703],"category_scores_gemma":[0.016649246,0.00061910745,0.0010604302,0.001536212,0.0048214206,0.010682443,0.008066259,0.00505383,0.00078294025],"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.00009337903,0.00009958383,0.0035142947,0.0004294389,0.00012498928,0.0009134431,0.0045476663,0.031015525,0.0010679248,0.8905908,0.013773862,0.053829122],"study_design_scores_gemma":[0.000020513295,0.00003136139,0.00059523137,0.00013922964,0.000020402613,0.00026426965,0.0031019559,0.084449805,0.00045324705,0.85768485,0.053200416,0.00003860207],"about_ca_topic_score_codex":0.002402734,"about_ca_topic_score_gemma":0.002119364,"teacher_disagreement_score":0.01055895,"about_ca_system_score_codex":0.0015323397,"about_ca_system_score_gemma":0.0016424068,"threshold_uncertainty_score":0.039495587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011499635,0.0002672827,0.9837474,0.00030427225,0.000045108303,0.000114315786,0.00007212867,0.0011926016,0.002757305],"genre_scores_gemma":[0.43562543,0.00027854927,0.55502546,0.00042228593,0.00010439529,0.0006686662,0.00033101314,0.000643035,0.0069012064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888164,0.000413968,0.00005456043,0.00017623295,0.00036083488,0.00011286817],"domain_scores_gemma":[0.9975286,0.00149912,0.00021863851,0.00029803198,0.00030846914,0.00014708558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702127,0.0013180338,0.0016719319,0.0010373475,0.0007509263,0.0013530827,0.0037362082,0.0016618763,0.004817768],"category_scores_gemma":[0.0068733604,0.0007260221,0.00077570294,0.00066960376,0.0014793406,0.0019481194,0.0033007998,0.0023748248,0.0010262668],"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.00032777374,0.0001982257,0.0014550477,0.00017634661,0.0001273521,0.00017217959,0.00013699668,0.8221288,0.0033679686,0.043755952,0.0050573084,0.12309614],"study_design_scores_gemma":[0.000016385115,0.00003536054,0.000042267337,0.0000059237605,0.0000037373734,0.000017160304,0.0000070378073,0.99201185,0.00038338744,0.006740544,0.0007317921,0.0000045726238],"about_ca_topic_score_codex":0.0030251446,"about_ca_topic_score_gemma":0.0036503999,"teacher_disagreement_score":0.004817768,"about_ca_system_score_codex":0.00095436786,"about_ca_system_score_gemma":0.0020201048,"threshold_uncertainty_score":0.016116977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07599018,0.00016073222,0.91391057,0.00020136317,0.00006079369,0.000101937054,0.000053612952,0.003337659,0.006183164],"genre_scores_gemma":[0.806674,0.000089531626,0.18862697,0.00027838754,0.000026936981,0.0002555183,0.00011073111,0.00031765655,0.0036203936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995505,0.00009116828,0.000025035988,0.00010929431,0.0001550248,0.00006897637],"domain_scores_gemma":[0.9988569,0.00064050953,0.00012243314,0.00014107782,0.000157789,0.000081281476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008759049,0.00075037155,0.00062065,0.00037322004,0.00029270956,0.000731319,0.0013076639,0.0007286949,0.0030735019],"category_scores_gemma":[0.0043506157,0.00039926657,0.00038671834,0.00019950529,0.0010422703,0.00091336574,0.0013084019,0.0018131048,0.00053867727],"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.0004500119,0.00026340917,0.0028664465,0.00016669824,0.000069749905,0.00014396568,0.00030120998,0.79012895,0.021436669,0.03144007,0.003023974,0.14970878],"study_design_scores_gemma":[0.000030937543,0.00008424699,0.00017506079,0.00001164804,0.000008017891,0.000023627685,0.000012175395,0.9921669,0.0027581167,0.0035542327,0.0011677265,0.0000072962794],"about_ca_topic_score_codex":0.0033683332,"about_ca_topic_score_gemma":0.0042627943,"teacher_disagreement_score":0.0033683332,"about_ca_system_score_codex":0.00059908716,"about_ca_system_score_gemma":0.0013586029,"threshold_uncertainty_score":0.01028192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032490157,0.00016690828,0.9633243,0.0001348932,0.000040475217,0.00006875971,0.00002266259,0.0005672601,0.003184521],"genre_scores_gemma":[0.7349317,0.00028347582,0.25926286,0.0002373959,0.0000302141,0.00013995235,0.0001241272,0.00023934634,0.004750837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.0000727658,0.000018601742,0.000073271905,0.00008144907,0.000058524358],"domain_scores_gemma":[0.99930596,0.00036068534,0.000067231,0.00008332616,0.000119121665,0.000063660125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095551566,0.0009259343,0.000911842,0.00065220863,0.00029050824,0.00089992816,0.0017208051,0.00079547364,0.0030260016],"category_scores_gemma":[0.003146676,0.00039140825,0.0005433658,0.00033989814,0.000962125,0.0023090665,0.001130436,0.0015307014,0.0005095126],"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.00014965801,0.00011170876,0.0023179473,0.00011289692,0.00008109,0.000070662085,0.00012757407,0.72472113,0.0065430766,0.059867594,0.0015487476,0.20434792],"study_design_scores_gemma":[0.000013231945,0.000047443926,0.00007998252,0.0000054433312,0.0000075417,0.000015860565,0.00000821746,0.99224275,0.0007962836,0.00638384,0.00039553578,0.0000038633725],"about_ca_topic_score_codex":0.0048145894,"about_ca_topic_score_gemma":0.005615532,"teacher_disagreement_score":0.0048145894,"about_ca_system_score_codex":0.000910083,"about_ca_system_score_gemma":0.0013268996,"threshold_uncertainty_score":0.010123014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72714436,0.00023256855,0.21602224,0.0019346218,0.00012640555,0.00026643428,0.00039664132,0.0025657834,0.05131095],"genre_scores_gemma":[0.9268007,0.00008068817,0.06531258,0.00047258823,0.00001024739,0.00007542261,0.00031334264,0.00012354413,0.006810738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994548,0.00019704101,0.000025028026,0.00012959277,0.00010906031,0.00008456341],"domain_scores_gemma":[0.9972421,0.0015960679,0.00019602176,0.00047834433,0.00025159135,0.00023590458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017446572,0.0005936564,0.0003785823,0.00032628956,0.00032548702,0.0014074577,0.0009340428,0.00081189914,0.0050926497],"category_scores_gemma":[0.012064112,0.0002556847,0.0002951999,0.00015452286,0.0012251525,0.0024344143,0.0011366166,0.0014746863,0.00095042476],"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.0015593267,0.0016211766,0.066027865,0.0008461035,0.00029657807,0.0008523859,0.006309221,0.3011327,0.056439802,0.16251981,0.022365753,0.3800293],"study_design_scores_gemma":[0.00014362113,0.0008271839,0.008247318,0.0000989731,0.000050543087,0.000296456,0.0011950418,0.8226754,0.009925762,0.13641986,0.02004465,0.00007522356],"about_ca_topic_score_codex":0.0037606908,"about_ca_topic_score_gemma":0.008950678,"teacher_disagreement_score":0.0050926497,"about_ca_system_score_codex":0.00044160683,"about_ca_system_score_gemma":0.00088704395,"threshold_uncertainty_score":0.017036617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9160251,0.0006771142,0.07698782,0.00043257742,0.00013891645,0.00012686854,0.0010935748,0.0010345812,0.0034835562],"genre_scores_gemma":[0.9869888,0.000110859895,0.009621641,0.000120773,0.00002227345,0.000040529267,0.00064856664,0.00001774484,0.0024289552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997552,0.000018944815,0.000024754665,0.00008730278,0.000043919365,0.00006977651],"domain_scores_gemma":[0.9994142,0.00017807477,0.0001226616,0.000045946763,0.00017393558,0.00006507895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005238791,0.0008802745,0.0007016744,0.0014734083,0.00035160567,0.0009715909,0.0010278857,0.000994224,0.0014107428],"category_scores_gemma":[0.0012615985,0.00027111298,0.00058122486,0.0005703046,0.00027218784,0.00084555557,0.0005617044,0.00094462035,0.00071405526],"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.0027619954,0.0025802648,0.32684883,0.0002275299,0.0005055617,0.0013438823,0.0003555894,0.2104324,0.040598765,0.0012830093,0.007145706,0.40591645],"study_design_scores_gemma":[0.000011208498,0.00019325083,0.02393818,0.000015301568,0.0000507594,0.00012034308,0.000061910454,0.9714651,0.0032580895,0.00047902574,0.00038693962,0.000019947076],"about_ca_topic_score_codex":0.013668627,"about_ca_topic_score_gemma":0.01670255,"teacher_disagreement_score":0.013668627,"about_ca_system_score_codex":0.00064439455,"about_ca_system_score_gemma":0.0005221611,"threshold_uncertainty_score":0.027178109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2664664,0.0017704342,0.6064568,0.009116965,0.0007643273,0.0006837268,0.0029664296,0.0039546113,0.10782022],"genre_scores_gemma":[0.7461871,0.00043863978,0.23145427,0.00060434313,0.0000467594,0.0002341469,0.0022907706,0.0004920111,0.018251825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996581,0.0010939074,0.0002275104,0.00096794753,0.00078318705,0.00034652508],"domain_scores_gemma":[0.99366355,0.0028053557,0.0004978467,0.0013846322,0.0009948035,0.00065385597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028877708,0.0019486581,0.0014611454,0.0020973266,0.0018824153,0.007814302,0.0030146139,0.00279014,0.018535336],"category_scores_gemma":[0.022177339,0.00091083895,0.0011918084,0.0020567852,0.0029750352,0.014696173,0.005979074,0.0039448803,0.0031760158],"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.0018001803,0.0014361758,0.025747232,0.00092081114,0.0004995606,0.00046996085,0.0025408461,0.04639699,0.0047337255,0.5140381,0.04265132,0.35876518],"study_design_scores_gemma":[0.00018695499,0.00047918473,0.0050824457,0.00038204668,0.00020898147,0.00023706743,0.004543017,0.27924046,0.0054611894,0.665671,0.038359083,0.00014861704],"about_ca_topic_score_codex":0.009319174,"about_ca_topic_score_gemma":0.012132736,"teacher_disagreement_score":0.018535336,"about_ca_system_score_codex":0.0011917277,"about_ca_system_score_gemma":0.0022690583,"threshold_uncertainty_score":0.06200689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008299394,0.0034363978,0.0012655667,0.008809393,0.006757763,0.00002804448,0.00071853906,0.00038991738,0.9777646],"genre_scores_gemma":[0.0057976143,0.0018902004,0.00040496266,0.002136343,0.000566384,0.000026723725,0.0005640624,0.00026030478,0.98835343],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995377,0.00007522036,0.000015544378,0.00004977731,0.0002486031,0.00007327034],"domain_scores_gemma":[0.9996012,0.000084290754,0.000011786689,0.00005158555,0.00014893003,0.00010218489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029735002,0.0005587552,0.00033433372,0.00067608507,0.0030982485,0.008795028,0.00083975715,0.0017201451,0.25025254],"category_scores_gemma":[0.001468147,0.00030350912,0.00035112028,0.0012141811,0.0012972208,0.0059109456,0.0034211949,0.0024892038,0.10816149],"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.00001668798,0.000008554299,0.000048249287,0.000050505103,0.0000011011053,0.00006300357,0.00043974043,0.000038132013,0.00009915587,0.036833543,0.93333036,0.029070994],"study_design_scores_gemma":[8.393693e-7,0.0000015149755,0.000034768484,0.000025988813,3.8312683e-7,0.00003786774,0.00019980253,0.000013926061,0.000035270605,0.001156563,0.9984914,0.0000016271335],"about_ca_topic_score_codex":0.005794176,"about_ca_topic_score_gemma":0.010786313,"teacher_disagreement_score":0.25025254,"about_ca_system_score_codex":0.0024780794,"about_ca_system_score_gemma":0.0013229172,"threshold_uncertainty_score":0.8371782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018131053,0.00460013,0.009706543,0.0010968765,0.0019610652,0.00042553525,0.013947622,0.01462963,0.9518195],"genre_scores_gemma":[0.0032548588,0.0020207819,0.0017245696,0.0006074881,0.000119116274,0.0002041141,0.00753519,0.0018295282,0.98270434],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992649,0.00005057666,0.00006374019,0.00021220447,0.000243221,0.00016531086],"domain_scores_gemma":[0.9985954,0.000299689,0.00007030915,0.000444657,0.00032475975,0.00026508622],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016956589,0.00376832,0.002459105,0.0028493148,0.002662128,0.0050990614,0.0030675803,0.0050240736,0.95299935],"category_scores_gemma":[0.003154252,0.0018956809,0.0013328075,0.009365658,0.001520575,0.010630572,0.005710841,0.0026064161,0.96780807],"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.0002499727,0.00017608026,0.00045098,0.00065088936,0.000042665382,0.0002207899,0.00009866503,0.00057712005,0.0012400922,0.007273581,0.69196653,0.2970526],"study_design_scores_gemma":[0.000039054405,0.00003059294,0.0006887927,0.00025697268,0.000041578987,0.00013412176,0.000075822885,0.00068177475,0.00048239692,0.0016100783,0.9959227,0.000036118352],"about_ca_topic_score_codex":0.017747851,"about_ca_topic_score_gemma":0.015267149,"teacher_disagreement_score":0.047000647,"about_ca_system_score_codex":0.002566907,"about_ca_system_score_gemma":0.0012629451,"threshold_uncertainty_score":0.06704062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017265754,0.0047532795,0.009228195,0.0011015288,0.0020516028,0.0004243587,0.012734332,0.013277529,0.9547026],"genre_scores_gemma":[0.0029832246,0.0020297982,0.0015928757,0.000603152,0.000119834185,0.00019987542,0.006565301,0.0015313104,0.9843747],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930584,0.00004818493,0.000060278573,0.00020266039,0.00022499842,0.00015804294],"domain_scores_gemma":[0.9986695,0.0002961918,0.00006797434,0.0003898395,0.00031302564,0.00026354325],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016709063,0.0038734826,0.0025956798,0.0029144997,0.002664575,0.0051180925,0.0031246212,0.0054445476,0.9545583],"category_scores_gemma":[0.0030536347,0.001896533,0.0013237087,0.009724897,0.0015120626,0.010397387,0.0056429976,0.0026973768,0.9696834],"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.00023917464,0.00017033936,0.00041086393,0.0006364453,0.000040190756,0.00022206253,0.00009148887,0.00055823533,0.001145731,0.0060460423,0.6995684,0.29087102],"study_design_scores_gemma":[0.00003994358,0.000031650183,0.00069343694,0.0002612864,0.00004195752,0.00013590374,0.00007938777,0.00068938604,0.00042835542,0.0014701138,0.9960926,0.00003589224],"about_ca_topic_score_codex":0.017689597,"about_ca_topic_score_gemma":0.015004773,"teacher_disagreement_score":0.045441687,"about_ca_system_score_codex":0.0023630306,"about_ca_system_score_gemma":0.0011876469,"threshold_uncertainty_score":0.06481707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021106,0.00549315,0.011179655,0.0012786745,0.002285825,0.0004519391,0.013915727,0.015335354,0.94794905],"genre_scores_gemma":[0.003787383,0.0024352367,0.0019143708,0.000675746,0.00013309318,0.00022691813,0.007606172,0.0018934523,0.9813276],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923956,0.000052614352,0.000065249216,0.00021848593,0.00025087668,0.00017317566],"domain_scores_gemma":[0.9985318,0.00031979443,0.000070655806,0.0004618458,0.00032870178,0.00028714506],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018513976,0.003935123,0.0026096636,0.002951416,0.0028577566,0.005054291,0.0030869877,0.005436245,0.949523],"category_scores_gemma":[0.0034524438,0.0019822395,0.0013313505,0.009585023,0.0015986543,0.011366884,0.0060786945,0.002777526,0.9659126],"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.00028423514,0.00019233045,0.0005002355,0.00068982615,0.00004569207,0.00023618816,0.0001115493,0.00064222224,0.001249564,0.0076081525,0.68218917,0.30625084],"study_design_scores_gemma":[0.000042194584,0.00003397719,0.0007569186,0.00028356496,0.00004691277,0.00014559178,0.00009162537,0.0008001297,0.0004918798,0.0018331027,0.9954354,0.00003859473],"about_ca_topic_score_codex":0.019080207,"about_ca_topic_score_gemma":0.016926652,"teacher_disagreement_score":0.050477028,"about_ca_system_score_codex":0.0025674966,"about_ca_system_score_gemma":0.0012931869,"threshold_uncertainty_score":0.07199925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019732732,0.005397827,0.01060358,0.0011544563,0.0021083613,0.0004337199,0.013885346,0.013261239,0.9511822],"genre_scores_gemma":[0.0034209995,0.0023445291,0.0018666217,0.0006036738,0.00012518525,0.00020543572,0.0076339985,0.0016362378,0.98216337],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992581,0.00005601182,0.00006542852,0.000207841,0.0002508086,0.00016182629],"domain_scores_gemma":[0.9987249,0.00028652322,0.00006571068,0.00038160072,0.00030839638,0.00023295615],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016882112,0.0037522821,0.0024346623,0.0027992625,0.002610145,0.0049822438,0.0029330645,0.004984762,0.9436697],"category_scores_gemma":[0.0030904058,0.0016864729,0.0012164604,0.009801215,0.0014401363,0.010327636,0.005377549,0.002583444,0.9617627],"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.0002526871,0.00016210685,0.00040906374,0.0006570097,0.000041045118,0.00021131552,0.000095976546,0.00060834346,0.0011436591,0.0067491373,0.68549836,0.30417135],"study_design_scores_gemma":[0.000038930775,0.000030226009,0.0006574429,0.00026739805,0.00004334828,0.00013148601,0.00007664538,0.0007950414,0.00044905214,0.001674059,0.99580234,0.000034027114],"about_ca_topic_score_codex":0.018999558,"about_ca_topic_score_gemma":0.0157366,"teacher_disagreement_score":0.056330323,"about_ca_system_score_codex":0.0024040123,"about_ca_system_score_gemma":0.0012264556,"threshold_uncertainty_score":0.08034831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04359283,0.0013987103,0.8944528,0.0021779407,0.00021669228,0.0001186348,0.00021637634,0.0008344386,0.05699151],"genre_scores_gemma":[0.8064895,0.0011814514,0.16716166,0.0005481487,0.0001915687,0.00044200718,0.00022087687,0.000326371,0.023438407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990251,0.00037658066,0.000052280677,0.00015639716,0.00024342227,0.0001462469],"domain_scores_gemma":[0.99328315,0.0050200266,0.00054382376,0.00043791943,0.00035283936,0.00036221655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023428714,0.00076361024,0.0011204899,0.0011961681,0.0010572402,0.0020760107,0.001463632,0.0017642077,0.010513683],"category_scores_gemma":[0.01330087,0.0005651041,0.0012040954,0.00079889514,0.0023175473,0.0035969317,0.0027732328,0.0036777155,0.0008745981],"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.00014070474,0.00003977186,0.00034773222,0.00014140883,0.000031498275,0.00019521995,0.00029204707,0.12608384,0.0010346969,0.84995425,0.003140489,0.018598294],"study_design_scores_gemma":[0.000034610246,0.00003636807,0.00007392763,0.000030871863,0.000017067967,0.000054261185,0.000038998533,0.43914023,0.00042266413,0.5577053,0.0024301817,0.000015548625],"about_ca_topic_score_codex":0.001789987,"about_ca_topic_score_gemma":0.0016696897,"teacher_disagreement_score":0.010513683,"about_ca_system_score_codex":0.0018103627,"about_ca_system_score_gemma":0.0017133118,"threshold_uncertainty_score":0.035171807},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34444642,0.006838868,0.008195774,0.02776213,0.0050725406,0.00026913072,0.105529636,0.0017723083,0.5001131],"genre_scores_gemma":[0.66532755,0.0030454986,0.0063968482,0.003069433,0.0015792554,0.00012780823,0.03235735,0.00033599077,0.2877603],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999684,0.000028563896,0.000014993204,0.00007011701,0.0001513235,0.000050980463],"domain_scores_gemma":[0.998877,0.00014101581,0.00022451978,0.00011578182,0.0003720484,0.0002696448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023852897,0.000495204,0.00018763651,0.0018704409,0.0027474547,0.0018131756,0.0005332932,0.0010508827,0.041795913],"category_scores_gemma":[0.0016994242,0.00024018969,0.00015403432,0.0031858769,0.0007568954,0.0014356655,0.0013061564,0.001396957,0.008725981],"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.00044922472,0.00008757799,0.06796377,0.00034072122,0.00005708284,0.0024499907,0.0070553278,0.0002936164,0.0028246536,0.009290088,0.78279394,0.12639397],"study_design_scores_gemma":[0.000011815875,0.00008546349,0.24539933,0.00024112557,0.000038332317,0.002207635,0.008475545,0.0008422156,0.001564286,0.0013630296,0.73968005,0.000091098176],"about_ca_topic_score_codex":0.056308422,"about_ca_topic_score_gemma":0.23849018,"teacher_disagreement_score":0.056308422,"about_ca_system_score_codex":0.0010140607,"about_ca_system_score_gemma":0.000562961,"threshold_uncertainty_score":0.13982123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034415215,0.00038392705,0.8740091,0.0005159405,0.00018360652,0.00014258071,0.000064200736,0.00039563433,0.089889914],"genre_scores_gemma":[0.69861645,0.00042917908,0.25736648,0.00022414663,0.00008678159,0.0003325251,0.00016358306,0.0001851434,0.04259578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995598,0.00013186036,0.000026300791,0.000087361084,0.00010687088,0.00008776216],"domain_scores_gemma":[0.99919933,0.0004782978,0.000049337967,0.000062951185,0.00008315169,0.00012694157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004638435,0.0008233151,0.0005626394,0.00046816448,0.0008981811,0.00201705,0.0019414314,0.0012263795,0.010876955],"category_scores_gemma":[0.0024728877,0.0003483081,0.00073712325,0.0003991054,0.0010056645,0.0019932569,0.0019281398,0.0022127114,0.0014853071],"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.00010876279,0.0001253099,0.00029641582,0.00015468204,0.00004202082,0.0001915645,0.00042825605,0.050338387,0.0088191265,0.8756657,0.004443031,0.059386767],"study_design_scores_gemma":[0.000039841467,0.00008681378,0.00014989823,0.00004109633,0.000023458406,0.00011766769,0.00015108341,0.58185506,0.0017830342,0.40932852,0.006401626,0.000021897504],"about_ca_topic_score_codex":0.0010464705,"about_ca_topic_score_gemma":0.0020204065,"teacher_disagreement_score":0.010876955,"about_ca_system_score_codex":0.000841752,"about_ca_system_score_gemma":0.0007218775,"threshold_uncertainty_score":0.036387026},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21243419,0.0037706157,0.35075027,0.0053538,0.001493772,0.00040747394,0.0011515806,0.0006512673,0.42398706],"genre_scores_gemma":[0.8815694,0.002196929,0.044616904,0.0010501592,0.001112834,0.00036709534,0.00090419763,0.00034312857,0.067839324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995878,0.0021453176,0.00017292539,0.00043715298,0.00057104224,0.00079556444],"domain_scores_gemma":[0.9889004,0.0076031815,0.00094278454,0.00073688873,0.0006094338,0.0012073069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003044474,0.001174505,0.0015442367,0.001858388,0.0029676883,0.005045323,0.0020661564,0.0017195689,0.025506953],"category_scores_gemma":[0.017668217,0.0006759736,0.0010692608,0.002070802,0.003405702,0.0071515557,0.0030407638,0.0030998145,0.0027539937],"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.00030611572,0.000071311384,0.00078750483,0.00014219055,0.000054379612,0.00012763687,0.00031679156,0.013605378,0.0002885848,0.9536988,0.011167197,0.019433986],"study_design_scores_gemma":[0.00008143336,0.000071952534,0.00060713425,0.000056947265,0.000035558704,0.0001013267,0.0001645476,0.029168451,0.00018480817,0.96095645,0.008549376,0.000021910051],"about_ca_topic_score_codex":0.0033670494,"about_ca_topic_score_gemma":0.0040885163,"teacher_disagreement_score":0.025506953,"about_ca_system_score_codex":0.0019042251,"about_ca_system_score_gemma":0.0013049794,"threshold_uncertainty_score":0.085329235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018249528,0.0014919683,0.9842279,0.00034818676,0.0000796684,0.00007886537,0.000109436514,0.00042020692,0.011418832],"genre_scores_gemma":[0.23314497,0.0031945684,0.7511009,0.000351292,0.00027890227,0.0013396338,0.00047652714,0.0004373528,0.009675837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807763,0.0009772148,0.00008072185,0.00019679972,0.00057650404,0.00009118347],"domain_scores_gemma":[0.99378246,0.005166289,0.00023789835,0.00040392764,0.00030723892,0.00010224497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026309644,0.0011385932,0.001412768,0.0011898624,0.0007783644,0.0015343707,0.001522689,0.0015186707,0.012032499],"category_scores_gemma":[0.012896619,0.00088315015,0.0011988186,0.0016277388,0.0021356377,0.0018619268,0.0020164463,0.0026511361,0.0019129862],"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.00004555793,0.00002234749,0.00025744064,0.00017170461,0.00003927894,0.000044640306,0.000047068334,0.70405847,0.0002636778,0.2644817,0.0017830709,0.028785123],"study_design_scores_gemma":[0.000014856209,0.000012494563,0.000042419062,0.00002972357,0.0000073200135,0.000018831857,0.0000046533764,0.8894231,0.000147471,0.1055865,0.0047030887,0.000009628769],"about_ca_topic_score_codex":0.006337426,"about_ca_topic_score_gemma":0.0063701468,"teacher_disagreement_score":0.012032499,"about_ca_system_score_codex":0.0018904202,"about_ca_system_score_gemma":0.002635598,"threshold_uncertainty_score":0.040252745},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04614749,0.0051780315,0.3805298,0.0055667837,0.0010346778,0.00033841617,0.00034233558,0.0010114063,0.55985105],"genre_scores_gemma":[0.6967907,0.0032868509,0.21847203,0.0015838295,0.00039099847,0.00046551088,0.00038827516,0.000390574,0.07823123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993191,0.00034195924,0.000028166285,0.00010393116,0.00015499497,0.00005192765],"domain_scores_gemma":[0.9992466,0.00046203207,0.000055169,0.000085459964,0.00005234411,0.000098485085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055903674,0.0005873,0.0002760789,0.00069132703,0.0015515758,0.004661528,0.0011254557,0.0011665974,0.008549478],"category_scores_gemma":[0.0027286953,0.0002005107,0.0005144846,0.00051089743,0.002696684,0.003876021,0.0032477984,0.0011238117,0.0010398048],"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.00009127015,0.00005914029,0.0006615006,0.00029924558,0.0000284329,0.00089415844,0.011870413,0.003097932,0.003796864,0.90819365,0.014430188,0.05657727],"study_design_scores_gemma":[0.000054117187,0.00012738642,0.0008874126,0.00027765174,0.000037014015,0.0023536652,0.0037134904,0.031895712,0.002790274,0.30834576,0.64946395,0.000053584776],"about_ca_topic_score_codex":0.00096735905,"about_ca_topic_score_gemma":0.001526907,"teacher_disagreement_score":0.008549478,"about_ca_system_score_codex":0.0007397478,"about_ca_system_score_gemma":0.0006185006,"threshold_uncertainty_score":0.028600872},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003623166,0.036816005,0.5093735,0.009011555,0.0053994926,0.00010976715,0.0014209741,0.00832867,0.42591688],"genre_scores_gemma":[0.05674453,0.014952442,0.20769797,0.0020040665,0.0012632314,0.00015536588,0.0017515472,0.0048041507,0.7106267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970657,0.00003991394,0.000018079198,0.00009011977,0.00010734207,0.00003793726],"domain_scores_gemma":[0.9998117,0.000049316062,0.000011281278,0.000046141904,0.000054254295,0.000027266571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047641303,0.0014524084,0.0006553543,0.0010104534,0.0012244951,0.003680909,0.0016327004,0.0015780637,0.068859436],"category_scores_gemma":[0.0016427437,0.000949393,0.00051635446,0.0010926047,0.0013408317,0.005396617,0.001846082,0.0028846338,0.046386052],"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.00009231313,0.000045443987,0.00017017427,0.00020481148,0.000018653607,0.000060101273,0.00025270914,0.0031942904,0.0016966632,0.2668476,0.3671004,0.36031684],"study_design_scores_gemma":[0.00001273088,0.000011955678,0.00021642323,0.000120804856,0.000015144818,0.00025308854,0.00007816122,0.0067178323,0.0017961401,0.19465195,0.79609543,0.000030331103],"about_ca_topic_score_codex":0.005140611,"about_ca_topic_score_gemma":0.015692148,"teacher_disagreement_score":0.068859436,"about_ca_system_score_codex":0.0013919459,"about_ca_system_score_gemma":0.0014445654,"threshold_uncertainty_score":0.2303577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00932002,0.00040082322,0.98557866,0.00010021116,0.000039507275,0.0000548489,0.000014469356,0.0005350437,0.003956453],"genre_scores_gemma":[0.44607863,0.00041836954,0.54994905,0.0001526759,0.000047496855,0.0004102842,0.00006761249,0.0001842888,0.0026916026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911386,0.00034356245,0.000046542926,0.00017180802,0.00023393001,0.00009027995],"domain_scores_gemma":[0.99824715,0.0012040237,0.00015148606,0.00017193308,0.00015189835,0.00007352985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017593757,0.000967226,0.0007884454,0.00080261385,0.00043024737,0.0012707296,0.0015825635,0.0010892381,0.0030602803],"category_scores_gemma":[0.0049881353,0.000743468,0.0005667206,0.0007834668,0.001983017,0.0017536151,0.0012794342,0.0012620649,0.00044593454],"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.00016269088,0.00007585668,0.00030076338,0.00014578288,0.0000485907,0.000076511584,0.000110299574,0.8852677,0.0018213679,0.031637132,0.0008622675,0.079491116],"study_design_scores_gemma":[0.00004982655,0.00004805804,0.00005070401,0.00001426889,0.000011975592,0.000025749607,0.000014193308,0.9856706,0.0007913671,0.011769153,0.0015454415,0.000008687083],"about_ca_topic_score_codex":0.0059584416,"about_ca_topic_score_gemma":0.0045901993,"teacher_disagreement_score":0.0059584416,"about_ca_system_score_codex":0.0012621471,"about_ca_system_score_gemma":0.0013906069,"threshold_uncertainty_score":0.011847496},"labels":[],"label_agreement":null}]}