{"meta":{"query_hash":"4f44b01ba0d3","filters":{"venue":"IEEE Transactions on Computational Intelligence and AI in Games"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"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/4f44b01ba0d3","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Computational+Intelligence+and+AI+in+Games"},"results":[{"id":"W1991894089","doi":"10.1109/tciaig.2011.2160994","title":"A Robust Learning Approach to Repeated Auctions With Monitoring and Entry Fees","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Bidding; Common value auction; Robustness (evolution); Computer science; Real-time bidding; Ebidding; Simple (philosophy); Combinatorial auction; Mathematical optimization; Operations research; Microeconomics; Economics; Mathematics","score_opus":0.15036388955362612,"score_gpt":0.33968244787843843,"score_spread":0.1893185583248123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991894089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028747823,0.00011189113,0.99564856,0.00010350883,0.000019395058,0.000033856173,0.000015309208,0.00010970991,0.0010830552],"genre_scores_gemma":[0.635193,0.00042346897,0.35495383,0.00023936975,0.0003142201,0.00029426027,0.00011391297,0.0001870582,0.008280886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931618,0.002859355,0.00033679308,0.0013593007,0.0017851397,0.00049753295],"domain_scores_gemma":[0.98609716,0.008415509,0.002351835,0.0014954854,0.0012777464,0.00036219496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070866686,0.0016755763,0.0024321214,0.001042248,0.0006062545,0.0029237694,0.005459199,0.0025054538,0.003532657],"category_scores_gemma":[0.02673977,0.0010794742,0.0015402363,0.0011071543,0.0023525949,0.0040366836,0.0023412325,0.0033938128,0.0007895879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009817089,0.00016432583,0.000769068,0.00014404791,0.0001371018,0.00020038706,0.00013261916,0.7363805,0.0022659444,0.21544226,0.0009706155,0.04329496],"study_design_scores_gemma":[0.000016467728,0.000059657832,0.000094100775,0.000006637193,0.000014409781,0.000045669585,0.000006644996,0.95733833,0.00033750467,0.04157276,0.00048924057,0.000018628907],"about_ca_topic_score_codex":0.0028454277,"about_ca_topic_score_gemma":0.0018384317,"teacher_disagreement_score":0.0070866686,"about_ca_system_score_codex":0.0019462004,"about_ca_system_score_gemma":0.0020122621,"threshold_uncertainty_score":0.037478328},"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":"W2026485182","doi":"10.1109/tciaig.2013.2275162","title":"Passing a Hide-and-Seek Third-Person Turing Test","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Turing test; Computer science; Turing; Test (biology); Artificial intelligence; Human–computer interaction","score_opus":0.05074143744200125,"score_gpt":0.3411247877602143,"score_spread":0.29038335031821305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026485182","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.5994407,0.00040583764,0.2854909,0.0062227775,0.00043067292,0.00067062816,0.00090527936,0.0018824892,0.10455062],"genre_scores_gemma":[0.9394735,0.00011169616,0.050392736,0.0006665508,0.000058056623,0.0003647546,0.0003804477,0.00019613124,0.008356243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896533,0.0046223463,0.0007150915,0.0011261454,0.002853636,0.0010296162],"domain_scores_gemma":[0.9560034,0.021795565,0.0031085182,0.010443847,0.0064554536,0.002193241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00818892,0.0009839446,0.0012248538,0.00065621396,0.0013350905,0.0028657345,0.0016411507,0.0018117463,0.0050072423],"category_scores_gemma":[0.05898206,0.0002883523,0.0014558038,0.0004335416,0.003970497,0.0028713385,0.0026549404,0.002127189,0.0019266823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018020893,0.00069558737,0.050990794,0.0007877439,0.000600514,0.0016486094,0.0068594757,0.045553036,0.030119447,0.65747494,0.035912246,0.16755569],"study_design_scores_gemma":[0.0002451682,0.0026943875,0.031180738,0.00030801038,0.00025425438,0.0015102847,0.0026769696,0.2952566,0.07348213,0.5165349,0.07549913,0.0003573823],"about_ca_topic_score_codex":0.0010391794,"about_ca_topic_score_gemma":0.0007577946,"teacher_disagreement_score":0.00818892,"about_ca_system_score_codex":0.00141831,"about_ca_system_score_gemma":0.001653447,"threshold_uncertainty_score":0.043307662},"labels":[],"label_agreement":null},{"id":"W2029705123","doi":"10.1109/tciaig.2014.2365414","title":"Predicting Opponent's Production in Real-Time Strategy Games With Answer Set Programming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Logic, Reasoning, and Knowledge","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":"Computer science; Probabilistic logic; Artificial intelligence; Set (abstract data type); Semantics (computer science); Theoretical computer science; Machine learning; Programming language","score_opus":0.02649509238743087,"score_gpt":0.27691518188270714,"score_spread":0.2504200894952763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029705123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18025377,0.00018360336,0.81725496,0.00036676173,0.000024117491,0.000081292346,0.00015196945,0.0005474399,0.0011360584],"genre_scores_gemma":[0.89812326,0.00010139199,0.10060733,0.000078838275,0.000019753601,0.0001316257,0.00024959428,0.00005505048,0.000633025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985304,0.0006679224,0.00007627313,0.00029867858,0.0002660762,0.0001606215],"domain_scores_gemma":[0.9878192,0.0103638815,0.0008868854,0.00020832487,0.00043327714,0.0002885359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031399543,0.0014563334,0.0011177884,0.0012086355,0.00037934515,0.0015013103,0.0017078746,0.0013229487,0.0016721148],"category_scores_gemma":[0.013013268,0.0005807403,0.0008643096,0.00061698945,0.001061757,0.002170961,0.0012408178,0.0019747035,0.0002258705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023737388,0.00011009851,0.0027919565,0.000057813475,0.00005900155,0.00006772728,0.000083174426,0.96747935,0.0009156236,0.004833149,0.00022162912,0.023143198],"study_design_scores_gemma":[0.0000040292593,0.000014607679,0.00012582217,0.0000022456275,0.000002864826,0.0000041715266,0.000007346548,0.9956868,0.00027639454,0.0038469015,0.000025942325,0.000002867767],"about_ca_topic_score_codex":0.0052628065,"about_ca_topic_score_gemma":0.0036750992,"teacher_disagreement_score":0.0052628065,"about_ca_system_score_codex":0.0012620613,"about_ca_system_score_gemma":0.001239754,"threshold_uncertainty_score":0.016605854},"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":"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":"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":"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":"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":"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":"W2129786343","doi":"10.1109/tciaig.2009.2018704","title":"Fingerprint Analysis of the Noisy Prisoner's Dilemma Using a Finite-State Representation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":52,"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; University of Guelph","funders":"","keywords":"Noise (video); Computer science; Prisoner's dilemma; Fidelity; Dilemma; Artificial intelligence; Odds; Evolutionary computation; Evolutionary algorithm; Tournament selection; Machine learning; Pattern recognition (psychology); Genetic algorithm; Mathematics; Logistic regression","score_opus":0.04299606175402597,"score_gpt":0.3450189370156095,"score_spread":0.3020228752615835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129786343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27919117,0.00015425854,0.7176407,0.00013613088,0.000015806894,0.0000509229,0.0000999076,0.00024020292,0.002470944],"genre_scores_gemma":[0.92840487,0.00006523763,0.07067271,0.000015431735,0.0000045847974,0.00006001851,0.000056537883,0.000015967604,0.0007046554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978393,0.00008423263,0.000011682208,0.00004415611,0.0000506715,0.00002531154],"domain_scores_gemma":[0.99865663,0.0009041097,0.00017990461,0.00013506308,0.000087695655,0.000036592635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006649846,0.00023213773,0.00043687923,0.0005363203,0.00026746292,0.0006429615,0.0004384966,0.00037704365,0.0009867807],"category_scores_gemma":[0.0031366393,0.0001417225,0.0003732684,0.0002936882,0.00078024145,0.0007727576,0.00033522162,0.0003954402,0.00008406463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009517701,0.0000614496,0.0043373797,0.0000541145,0.00004290516,0.00013440978,0.00019782051,0.8981897,0.011791857,0.05141059,0.00024728134,0.03343727],"study_design_scores_gemma":[0.000002458388,0.000020010937,0.00042845967,0.0000026630992,0.0000031192797,0.000017776501,0.000011099993,0.99179745,0.00068985677,0.006894191,0.00012755785,0.0000052824544],"about_ca_topic_score_codex":0.0022841827,"about_ca_topic_score_gemma":0.0011036588,"teacher_disagreement_score":0.0022841827,"about_ca_system_score_codex":0.00068062084,"about_ca_system_score_gemma":0.00051511027,"threshold_uncertainty_score":0.0049383044},"labels":[],"label_agreement":null},{"id":"W2161213945","doi":"10.1109/tciaig.2011.2138707","title":"Search-Based Procedural Generation of Maze-Like Levels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":107,"is_retracted":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":"California Institute of Technology","keywords":"Fitness function; Initialization; Computer science; Fitness approximation; Artificial intelligence; Path (computing); Representation (politics); Grid; Genetic programming; Function (biology); Evolutionary algorithm; Machine learning; Genetic algorithm; Mathematics","score_opus":0.09710456400680863,"score_gpt":0.30396370292417885,"score_spread":0.20685913891737023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161213945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1537215,0.00005957661,0.8362226,0.00008410507,0.000029188352,0.000119638,0.00010473337,0.0011852039,0.008473425],"genre_scores_gemma":[0.69914913,0.000057391586,0.29636738,0.000043252832,0.0000053719914,0.00023533443,0.00021918496,0.00027533385,0.003647706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998135,0.000048651087,0.000010169696,0.00003845635,0.00005773868,0.000031552583],"domain_scores_gemma":[0.9995067,0.00026126913,0.000043954573,0.000066652385,0.00009356885,0.00002784679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039017384,0.00037594503,0.00028940718,0.0003452198,0.00022936845,0.0005692727,0.00070089207,0.00043980186,0.0017454156],"category_scores_gemma":[0.0018511923,0.00024032484,0.0004399945,0.00022158599,0.0005262167,0.000440039,0.00065308163,0.0004315375,0.00021343814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011020298,0.00009546783,0.001799397,0.00012822832,0.000029968036,0.00014498294,0.00027164372,0.8133831,0.044913378,0.0557685,0.0011981906,0.08215692],"study_design_scores_gemma":[0.000028088763,0.000088861525,0.00029873443,0.00001563848,0.00001230555,0.000044137687,0.000024995916,0.97775203,0.010218194,0.008801542,0.002702265,0.000013153319],"about_ca_topic_score_codex":0.0010124809,"about_ca_topic_score_gemma":0.0009842962,"teacher_disagreement_score":0.0017454156,"about_ca_system_score_codex":0.00053419644,"about_ca_system_score_gemma":0.0005085316,"threshold_uncertainty_score":0.0058389306},"labels":[],"label_agreement":null},{"id":"W2393952865","doi":"10.1109/tciaig.2016.2565558","title":"Changing Resources Available to Game Playing Agents: Another Relevant Design Factor in Agent Experiments","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","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 Guelph","funders":"University of Guelph","keywords":"Cooperativeness; Computer science; Markov chain; Resource (disambiguation); Game theory; Iterated function; Social dilemma; Artificial intelligence; Machine learning; Microeconomics; Economics; Mathematics","score_opus":0.07597290461484736,"score_gpt":0.33185708492590493,"score_spread":0.2558841803110576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393952865","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.8998925,0.0002370177,0.08499368,0.00052231894,0.00019002381,0.0062644775,0.00044391432,0.00027203126,0.007184125],"genre_scores_gemma":[0.926683,0.00018362516,0.057573743,0.00036755798,0.000040697687,0.013380666,0.00014265899,0.00009824371,0.0015297597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921997,0.0044498374,0.0008659385,0.00091548386,0.0011713528,0.00039767165],"domain_scores_gemma":[0.9515802,0.03959327,0.002371603,0.0038591716,0.0014536034,0.001142054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072080404,0.00094917277,0.00096903526,0.0004796759,0.0007423472,0.0027159217,0.0015084515,0.0018817363,0.0034800624],"category_scores_gemma":[0.056936163,0.00068328093,0.00051795307,0.00054758467,0.0013709755,0.0030296117,0.0013026301,0.0019257776,0.0005019294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03881471,0.030735169,0.04742598,0.0051292684,0.001289075,0.0009176407,0.0059098303,0.2404906,0.3121629,0.07203919,0.0021609378,0.24292472],"study_design_scores_gemma":[0.012284147,0.11965372,0.059104435,0.00088546495,0.0022624652,0.000737298,0.0026466178,0.41112325,0.20918322,0.14813009,0.033068143,0.0009211735],"about_ca_topic_score_codex":0.00036283853,"about_ca_topic_score_gemma":0.00039710331,"teacher_disagreement_score":0.0072080404,"about_ca_system_score_codex":0.00088667806,"about_ca_system_score_gemma":0.00088829745,"threshold_uncertainty_score":0.03812021},"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}]}