{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14905201,0.000028083366,0.8494069,0.00022982719,0.000086280204,0.00016422807,0.0000043128034,0.00004801939,0.0009803355],"genre_scores_gemma":[0.9767895,0.000039956096,0.022164708,0.00008405883,0.00002585277,0.000085766354,0.0000011585988,0.000009306724,0.0007996944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858445,0.000099578865,0.00035785098,0.00047076633,0.0003329428,0.00015442492],"domain_scores_gemma":[0.9990553,0.00043030942,0.00007515664,0.00014467981,0.00017535406,0.00011919414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041579362,0.00013727848,0.00015700408,0.00040780302,0.00037720116,0.00011951094,0.00015256973,0.000053476997,0.000065311724],"category_scores_gemma":[0.000032319156,0.00011137139,0.000033293018,0.0008527147,0.00017583267,0.0003027584,0.000003841885,0.0002831031,0.00003981623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007719353,0.00018198202,0.0012382176,0.0000033172612,0.000016323422,0.000001249919,0.0031658453,0.926156,0.00003161741,0.0032045012,0.000016473621,0.06590732],"study_design_scores_gemma":[0.0011798743,0.0017341934,0.099270344,0.000523162,0.00014058857,0.0006354458,0.07575608,0.54945374,0.035915997,0.2309963,0.002376727,0.0020175686],"about_ca_topic_score_codex":0.00004733129,"about_ca_topic_score_gemma":0.000009636579,"teacher_disagreement_score":0.8277375,"about_ca_system_score_codex":0.00002165786,"about_ca_system_score_gemma":0.0000312861,"threshold_uncertainty_score":0.45415935},"labels":[],"label_agreement":null},{"id":"W2006652402","doi":"10.1109/tciaig.2014.2309077","title":"An Enhanced Solver for the Game of Amazons","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Chess endgame; Computer science; Combinatorial game theory; Game complexity; Game theory; Theoretical computer science; Problem solver; Computational complexity theory; Sequential game; Mathematical economics; Algorithm; Artificial intelligence; Mathematics; Programming language; Computational science","score_opus":0.03134361171356633,"score_gpt":0.31529853571692124,"score_spread":0.2839549240033549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006652402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014074789,0.0000488503,0.98389435,0.0011888597,0.00038797143,0.00029028745,0.0000072840844,0.00004999531,0.00005760618],"genre_scores_gemma":[0.97208065,0.00005493533,0.026969561,0.0007166347,0.000038325416,0.000082153936,0.0000010975831,0.000009839349,0.00004681807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986525,0.00007561358,0.00042447657,0.0003750624,0.00024905935,0.00022328463],"domain_scores_gemma":[0.99749166,0.0018139125,0.0000959336,0.00032777482,0.00020704632,0.00006366592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086847,0.00015724846,0.00018881657,0.00018752419,0.00014524865,0.000100216406,0.0006101316,0.000066049,0.000019697323],"category_scores_gemma":[0.00002626899,0.00012541935,0.000090495145,0.00034740765,0.00026042154,0.0004291325,0.0000040319724,0.00018417627,0.0000135046985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019565952,0.000121591984,0.0000093735625,0.0000086747605,0.000012112159,1.8286212e-7,0.0011656978,0.6397819,0.00045991482,0.030153515,0.00001197108,0.3282555],"study_design_scores_gemma":[0.000052835607,0.0002779786,0.00023288836,0.000035286015,0.000007455733,0.0000026958471,0.0002231292,0.8165371,0.09244273,0.08987927,0.00017794252,0.00013068515],"about_ca_topic_score_codex":0.000065460845,"about_ca_topic_score_gemma":0.00009959839,"teacher_disagreement_score":0.95800585,"about_ca_system_score_codex":0.000021336979,"about_ca_system_score_gemma":0.000060032424,"threshold_uncertainty_score":0.5114453},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19765519,0.00024361996,0.7900381,0.005838705,0.001239827,0.00034783743,0.000010061566,0.0001230998,0.004503528],"genre_scores_gemma":[0.99594456,0.00004528743,0.0010586873,0.0015892227,0.000055184122,0.00007511862,0.000001797278,0.00001351523,0.001216621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991121,0.000050759285,0.0002391996,0.0002802762,0.00012918237,0.00018847827],"domain_scores_gemma":[0.99895024,0.0007805347,0.00005030941,0.00007223524,0.000070426984,0.000076231074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000075484866,0.00013909725,0.00014726688,0.00021011799,0.00016619283,0.000117550684,0.00006405794,0.00008734019,0.0009666357],"category_scores_gemma":[0.0000115923,0.00013825325,0.000052143696,0.00016920926,0.00011811788,0.00023885064,0.0000010515887,0.00033489932,0.00032853548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082892526,0.00080760097,0.002723151,0.000038296865,0.00012549736,0.000022757906,0.018388525,0.075361446,0.0004730253,0.0061159465,0.0020347342,0.8938261],"study_design_scores_gemma":[0.0025092827,0.0017924565,0.3700609,0.0012663763,0.00017109014,0.0006599858,0.081136554,0.43293968,0.009995207,0.09142762,0.005259823,0.002781029],"about_ca_topic_score_codex":0.0005320713,"about_ca_topic_score_gemma":0.00006591504,"teacher_disagreement_score":0.8910451,"about_ca_system_score_codex":0.0000381875,"about_ca_system_score_gemma":0.000021021675,"threshold_uncertainty_score":0.9999466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22428405,0.000037271733,0.7743079,0.0004156595,0.00020345536,0.00026262525,0.0000015547092,0.00012391532,0.0003635591],"genre_scores_gemma":[0.98707664,0.0000668964,0.01247353,0.00007691703,0.00005762072,0.00006261234,0.00000450926,0.000011872335,0.00016937796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837166,0.00012793927,0.0003452113,0.00057581376,0.00027602664,0.0003033524],"domain_scores_gemma":[0.99925625,0.00025874685,0.00008694701,0.00018658639,0.00012921392,0.00008224748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040691235,0.00020703507,0.00021364771,0.00033108634,0.00014154961,0.00018972195,0.00024372502,0.00007636596,0.000011935029],"category_scores_gemma":[0.000015297748,0.00017921967,0.00004073515,0.00061452016,0.00012477752,0.0006500311,0.0000046934683,0.00029055605,0.000020129806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004372744,0.000281418,0.0016961399,0.00003693034,0.000018852843,0.000009103321,0.003166214,0.65318304,0.00010012007,0.0022696136,0.000017900617,0.33917695],"study_design_scores_gemma":[0.0002957408,0.0006253533,0.0069586514,0.0003096821,0.000011504325,0.000075836615,0.000604955,0.97864956,0.00371878,0.008222137,0.00013805149,0.0003897251],"about_ca_topic_score_codex":0.00014708094,"about_ca_topic_score_gemma":0.0002552116,"teacher_disagreement_score":0.76279265,"about_ca_system_score_codex":0.000057529956,"about_ca_system_score_gemma":0.000092560105,"threshold_uncertainty_score":0.73083663},"labels":[],"label_agreement":null},{"id":"W2047316657","doi":"10.1109/tciaig.2014.2345398","title":"Stronger Virtual Connections in Hex","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Bottleneck; Computer science; Connection (principal bundle); Set (abstract data type); Solver; Theoretical computer science; Search algorithm; Search tree; Tree (set theory); Iterative deepening depth-first search; Computational complexity theory; Algorithm; Monte Carlo method; Beam search; Mathematics; Best-first search; Programming language; Combinatorics","score_opus":0.027510376347812254,"score_gpt":0.2917056138452298,"score_spread":0.2641952374974176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047316657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041913223,0.0000353026,0.9547783,0.0021543445,0.00055102404,0.0001673638,0.0000037916723,0.000090268986,0.0003063621],"genre_scores_gemma":[0.99017715,0.000047124384,0.008610502,0.00091542123,0.000037296748,0.000051484487,0.0000013186065,0.0000114425375,0.00014825883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982022,0.00013955077,0.0005080007,0.0005329653,0.00029861814,0.00031867053],"domain_scores_gemma":[0.99854547,0.00094630773,0.00006325973,0.00024689865,0.00010238036,0.00009566843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035246628,0.00020693318,0.00022397356,0.00056407263,0.00014217106,0.00015834683,0.000412809,0.000098217766,0.000056434983],"category_scores_gemma":[0.000030364527,0.0002149613,0.000068059235,0.00072003115,0.00018969309,0.0006179985,0.000007257342,0.00041873025,0.00012142498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011363342,0.00016892081,0.00015563068,0.0000039214806,0.000006712394,0.000003835697,0.0007599668,0.70904714,0.00004293295,0.049961902,0.00002617531,0.23981148],"study_design_scores_gemma":[0.00009512098,0.000255696,0.0013699017,0.00007628631,0.0000033785975,0.000017126224,0.00042183115,0.9267939,0.007557443,0.062693365,0.00044038292,0.00027560774],"about_ca_topic_score_codex":0.00016121572,"about_ca_topic_score_gemma":0.00047166357,"teacher_disagreement_score":0.94826394,"about_ca_system_score_codex":0.00007667907,"about_ca_system_score_gemma":0.00007287894,"threshold_uncertainty_score":0.87658674},"labels":[],"label_agreement":null},{"id":"W2082667841","doi":"10.1109/tciaig.2013.2284385","title":"A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Heuristics; Mathematical optimization; Heuristic; Domain (mathematical analysis); State (computer science); Class (philosophy); Controller (irrigation); Planner; Sequence (biology); Artificial intelligence; Algorithm; Mathematics","score_opus":0.035028196253588856,"score_gpt":0.2970997863229458,"score_spread":0.262071590069357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082667841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025647238,0.0001764193,0.9939549,0.001584741,0.00017426378,0.0014533574,0.00004025069,0.000036182082,0.000015168224],"genre_scores_gemma":[0.91714656,0.000022128312,0.081209645,0.0007004197,0.00002799693,0.0008279731,0.0000026857442,0.000012313519,0.000050257808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986028,0.000050005823,0.00048470535,0.00042140283,0.00018556158,0.0002554992],"domain_scores_gemma":[0.996531,0.0027472202,0.00012013975,0.0001888478,0.0003440187,0.000068766865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031152213,0.00019585209,0.00027049138,0.0001954402,0.00015229815,0.00015712959,0.00035082665,0.0000714816,0.000008258028],"category_scores_gemma":[0.00004488532,0.0001429793,0.00011014896,0.00024449994,0.0002848377,0.00026274208,0.0000047322014,0.00015530203,0.0000024639005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011442957,0.00018646482,0.000016430373,0.00004553685,0.000043464846,1.8451352e-7,0.00062188104,0.7969594,0.00039345975,0.0063504637,0.000061005645,0.19520727],"study_design_scores_gemma":[0.00033975948,0.0002925832,0.00011698041,0.00003147042,0.000016125838,0.0000037598152,0.00025260713,0.9565743,0.009741662,0.03240063,0.00006853073,0.0001615806],"about_ca_topic_score_codex":0.0001687513,"about_ca_topic_score_gemma":0.000023709707,"teacher_disagreement_score":0.91458184,"about_ca_system_score_codex":0.000023055061,"about_ca_system_score_gemma":0.00008455905,"threshold_uncertainty_score":0.5830527},"labels":[],"label_agreement":null},{"id":"W2102256448","doi":"10.1109/tciaig.2010.2067212","title":"Monte Carlo Tree Search in Hex","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Monte Carlo method; Game tree; Computer science; Tree (set theory); Olympiad; Theoretical computer science; Algorithm; Artificial intelligence; Game theory; Mathematics; Mathematical economics; Combinatorics; Statistics; Sequential game","score_opus":0.034215705805012646,"score_gpt":0.31247784181369387,"score_spread":0.2782621360086812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102256448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23719212,0.00004686624,0.7598346,0.001873305,0.0005640684,0.00019250723,0.0000042526767,0.00006922523,0.00022308428],"genre_scores_gemma":[0.9836237,0.000071342896,0.015531297,0.000514993,0.00003745809,0.000044761848,5.2301715e-7,0.000013027298,0.00016290967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980324,0.00008689403,0.0005124341,0.0005807362,0.0004064595,0.00038109356],"domain_scores_gemma":[0.9987434,0.0006367431,0.000047870053,0.00031200986,0.00013936165,0.00012060077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039899407,0.00021990307,0.00022756936,0.00062463904,0.00012495827,0.00019555123,0.00062153034,0.0001318436,0.00005365762],"category_scores_gemma":[0.00001922295,0.00022280833,0.00007602745,0.00083956827,0.00024710223,0.00066724845,0.000010149078,0.00087502284,0.00009688057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001829125,0.00021349076,0.0004251898,0.0000082544075,0.0000074219856,0.000025893229,0.001856137,0.63883287,0.00039119183,0.0061610024,0.000020819922,0.35203946],"study_design_scores_gemma":[0.000087613575,0.00012844158,0.0034761853,0.000060859373,0.0000027018523,0.00003185785,0.00039242939,0.94867355,0.023988388,0.022711897,0.00015132713,0.000294761],"about_ca_topic_score_codex":0.0005261312,"about_ca_topic_score_gemma":0.0025835377,"teacher_disagreement_score":0.7464315,"about_ca_system_score_codex":0.000052713596,"about_ca_system_score_gemma":0.000134677,"threshold_uncertainty_score":0.908586},"labels":[],"label_agreement":null},{"id":"W2102669142","doi":"10.1109/tciaig.2011.2161310","title":"A Generic Approach to Challenge Modeling for the Procedural Creation of Video Game Levels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Generative grammar; Entertainment; Fitness function; Generative Design; Video game; Generative model; Constraint (computer-aided design); Multimedia; Human–computer interaction; Artificial intelligence; Function (biology); Genetic algorithm; Game design; Machine learning","score_opus":0.1476889815550019,"score_gpt":0.3228816404081994,"score_spread":0.17519265885319749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102669142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069518583,0.00013799958,0.9910008,0.0008537394,0.0002004781,0.0006055203,0.0000088098095,0.000046855454,0.00019396105],"genre_scores_gemma":[0.910043,0.000057873538,0.08910814,0.00047094913,0.000025541085,0.00024630586,7.932812e-7,0.000011247771,0.00003615224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854976,0.00004255517,0.00048635737,0.00042503848,0.00026182408,0.00023446714],"domain_scores_gemma":[0.9989441,0.00040407732,0.00008218525,0.00023143372,0.00027040034,0.0000677858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029659632,0.00017554397,0.0001944675,0.0002721024,0.00013230261,0.000061014067,0.00052356994,0.000067336085,0.000008534752],"category_scores_gemma":[0.000022960483,0.00014196563,0.0000885803,0.00049102126,0.000116160416,0.00038979173,0.000007705733,0.00015969964,0.000008437557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003627724,0.00020606977,0.0000034177665,0.000023219933,0.000018857163,3.0210325e-7,0.0076117306,0.83735514,0.000054257893,0.017789556,0.000007839618,0.13689332],"study_design_scores_gemma":[0.00004512935,0.0001976227,0.00009455913,0.000049921724,0.0000100912475,0.000006689527,0.00075013924,0.94434154,0.009754079,0.04456904,0.000026319462,0.00015489172],"about_ca_topic_score_codex":0.0001082665,"about_ca_topic_score_gemma":0.000036974594,"teacher_disagreement_score":0.90309113,"about_ca_system_score_codex":0.000036858924,"about_ca_system_score_gemma":0.00008762052,"threshold_uncertainty_score":0.57891905},"labels":[],"label_agreement":null},{"id":"W2115451979","doi":"10.1109/tciaig.2014.2346690","title":"Automated Planning and Player Modeling for Interactive Storytelling","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Storytelling; Interactive storytelling; Planner; Entertainment; Narrative; Human–computer interaction; Multimedia; Automated planning and scheduling; Agency (philosophy); Perception; Domain (mathematical analysis); Process (computing); Artificial intelligence","score_opus":0.046527835226701134,"score_gpt":0.3296732094588575,"score_spread":0.28314537423215635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115451979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034289632,0.00009796859,0.96420294,0.00051396794,0.0003752767,0.00023702609,0.0000043054238,0.0002266308,0.000052258412],"genre_scores_gemma":[0.94294775,0.000028391065,0.056322165,0.00057072984,0.000035719113,0.000055492925,0.0000016354326,0.000014306972,0.000023823239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852884,0.00007076479,0.00041467874,0.00051820406,0.00019973585,0.0002678027],"domain_scores_gemma":[0.998267,0.0012648099,0.00007499756,0.00014930672,0.00015525808,0.000088645655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033428828,0.00020622676,0.00022020847,0.0003595643,0.00023245327,0.0002046303,0.00025965873,0.00008726198,0.000004745259],"category_scores_gemma":[0.00003159607,0.00021014307,0.00005527639,0.00024450262,0.00010136824,0.00064905174,0.0000068365057,0.00027454365,0.000010008466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186774,0.000053480995,0.000029629055,0.000015300988,0.000015378571,0.0000014715204,0.0022314873,0.8811362,0.000051398267,0.0049829404,0.0000115545745,0.11143928],"study_design_scores_gemma":[0.00007544874,0.00015769045,0.00003836401,0.0001501656,0.0000065355543,0.000013498146,0.00043213312,0.95542324,0.004964441,0.03844558,0.00007203501,0.00022085884],"about_ca_topic_score_codex":0.00003340886,"about_ca_topic_score_gemma":0.000016717482,"teacher_disagreement_score":0.9086581,"about_ca_system_score_codex":0.000047543104,"about_ca_system_score_gemma":0.000043269814,"threshold_uncertainty_score":0.8569386},"labels":[],"label_agreement":null},{"id":"W2115867107","doi":"10.1109/tciaig.2013.2290088","title":"Analysis of ReGEN as a Graph-Rewriting System for Quest Generation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Computer science; Rewriting; Context (archaeology); Graph; Video game; Graph rewriting; Representation (politics); Multimedia; Human–computer interaction; Theoretical computer science; Programming language","score_opus":0.03904835426595322,"score_gpt":0.30680727847253203,"score_spread":0.2677589242065788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115867107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064939566,0.000087588014,0.93355644,0.00061194575,0.00024625534,0.00039280887,0.000012649053,0.00006710374,0.00008567385],"genre_scores_gemma":[0.97207415,0.000035299156,0.027361827,0.0002519415,0.00003070989,0.0001821388,0.000007127387,0.000009104239,0.000047714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983116,0.00007830468,0.0006501852,0.0004548727,0.00028484414,0.00022022663],"domain_scores_gemma":[0.9985044,0.00061684835,0.00015394649,0.00023109435,0.00042004374,0.00007367836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029273084,0.0001707191,0.00030478413,0.00087104883,0.00015123577,0.0001683037,0.00033455095,0.000084196916,0.000024567902],"category_scores_gemma":[0.000020232754,0.00017071162,0.00016929819,0.0012740853,0.00011803302,0.00060257805,0.000004375978,0.00013421309,0.000024684035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075658722,0.00009306151,0.00009634229,0.000029564157,0.00013147578,0.0000011699948,0.00084501575,0.8467346,0.0005732252,0.030338176,0.00002080758,0.12112901],"study_design_scores_gemma":[0.00004067803,0.00013637662,0.0002745963,0.000070923576,0.00006137026,0.0000056609533,0.00063276675,0.9411672,0.042897504,0.014532029,0.000012160263,0.00016873535],"about_ca_topic_score_codex":0.00053536304,"about_ca_topic_score_gemma":0.00018705928,"teacher_disagreement_score":0.9071346,"about_ca_system_score_codex":0.000059432066,"about_ca_system_score_gemma":0.00006845267,"threshold_uncertainty_score":0.6961418},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40526673,0.000023184597,0.59348184,0.0008845174,0.00008838726,0.000116278,0.000008423136,0.000012327291,0.000118308824],"genre_scores_gemma":[0.9986406,0.00007368177,0.00081933616,0.0003251831,0.000016707074,0.0000061067667,0.0000028479403,0.0000027156607,0.00011282525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988953,0.00022988778,0.00029448952,0.00018742378,0.00027309518,0.00011984153],"domain_scores_gemma":[0.9992159,0.0004146451,0.00009045401,0.00009763111,0.00014804307,0.000033331125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031235235,0.000080563696,0.00013869793,0.00027354842,0.0003161848,0.00004246045,0.00011742899,0.000045280787,0.000059848422],"category_scores_gemma":[0.000035357294,0.000070659844,0.000099242854,0.001326403,0.00020253895,0.00023919958,0.0000012923789,0.00013862886,0.0000022522447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003374505,0.00010654334,0.00036244356,0.0000017699823,0.00004202262,7.368516e-7,0.004482195,0.9586081,0.00009357738,0.0076978197,0.00000215941,0.028568871],"study_design_scores_gemma":[0.00008672396,0.000071596034,0.021243913,0.0000618085,0.00012821564,0.0000013234004,0.0013742873,0.93033427,0.0023080253,0.044171013,0.00006718982,0.00015162707],"about_ca_topic_score_codex":0.0005452032,"about_ca_topic_score_gemma":0.0007773338,"teacher_disagreement_score":0.5933739,"about_ca_system_score_codex":0.00006000793,"about_ca_system_score_gemma":0.00010147848,"threshold_uncertainty_score":0.2881425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026101064,0.00003985701,0.9727761,0.0006841881,0.00011959331,0.00016587239,0.000013814986,0.000038698585,0.00006079903],"genre_scores_gemma":[0.893556,0.000015043135,0.10588145,0.00043686232,0.000014626291,0.000042579104,0.0000034594848,0.0000050648373,0.000044932105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.000040115257,0.00029549244,0.00028901952,0.0002201296,0.00014266609],"domain_scores_gemma":[0.9994794,0.000100624384,0.000050535495,0.00015123948,0.0001621061,0.00005605627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013048471,0.00011121303,0.000113072434,0.00023036441,0.00008061509,0.000029984763,0.00023670416,0.00004820467,0.000039507664],"category_scores_gemma":[0.0000020099872,0.00010993982,0.00004809408,0.00043259768,0.00013018357,0.00033969196,0.000002937909,0.00014574126,0.000014753932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015269728,0.00059110194,0.0001025568,0.000028097556,0.000017550834,0.0000029627636,0.0018695679,0.8675519,0.00066958583,0.03428382,0.00005740728,0.094810136],"study_design_scores_gemma":[0.00010593546,0.00013193442,0.0030801636,0.00003175409,0.000003766839,0.000009078007,0.00006488191,0.9493121,0.03593069,0.011157611,0.000044030305,0.00012805499],"about_ca_topic_score_codex":0.00006106959,"about_ca_topic_score_gemma":0.00001847248,"teacher_disagreement_score":0.86745495,"about_ca_system_score_codex":0.000027096834,"about_ca_system_score_gemma":0.00013528431,"threshold_uncertainty_score":0.44832158},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2074828,0.000083047606,0.7904177,0.001201595,0.00018323633,0.00029434473,0.000008377362,0.000034950623,0.00029398626],"genre_scores_gemma":[0.9951592,0.00018918514,0.0015104499,0.00078900193,0.00003892192,0.000078567915,6.4783984e-7,0.000010529464,0.0022235117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986263,0.00026170508,0.00026611477,0.0002944909,0.0002714518,0.00027996564],"domain_scores_gemma":[0.9993216,0.00043537054,0.000038790535,0.000074530464,0.00005826123,0.000071448296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041988018,0.00012251218,0.00012325583,0.00039242022,0.0002587355,0.00005978706,0.00012282516,0.000064048545,0.0007718891],"category_scores_gemma":[0.000024830033,0.000104610255,0.00003158802,0.00042327304,0.000113734466,0.00035738805,0.000002534433,0.000098480195,0.0001800486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042285232,0.0005499718,0.00071835704,0.000015331587,0.000038863815,0.000020627052,0.09192283,0.7281574,0.0037991074,0.004972391,0.00026288905,0.1691194],"study_design_scores_gemma":[0.006262898,0.004106911,0.025298342,0.0094776675,0.00010933393,0.000052264983,0.12641254,0.37107864,0.24444617,0.13847984,0.067160316,0.007115072],"about_ca_topic_score_codex":0.00013863396,"about_ca_topic_score_gemma":0.00019985139,"teacher_disagreement_score":0.78890723,"about_ca_system_score_codex":0.00018637584,"about_ca_system_score_gemma":0.000072382594,"threshold_uncertainty_score":0.8451644},"labels":[],"label_agreement":null},{"id":"W2563424741","doi":"10.1109/tciaig.2016.2642158","title":"Creating AI Characters for Fighting Games Using Genetic Programming","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Trent University; Nottingham Trent University","keywords":"Computer science; Genetic programming; Code (set theory); Character (mathematics); Process (computing); Point (geometry); Artificial intelligence; Tournament; Selection (genetic algorithm); Human–computer interaction; Programming language","score_opus":0.04723508883444439,"score_gpt":0.3226099156286452,"score_spread":0.27537482679420083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563424741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06447701,0.00008890879,0.9328286,0.0016342422,0.0004150806,0.00041495336,0.000007936437,0.00011966307,0.000013574351],"genre_scores_gemma":[0.86682534,0.00004702089,0.13220048,0.000663585,0.000072214345,0.00009960894,8.5507685e-7,0.000020435806,0.00007043788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978608,0.00007382208,0.0006356176,0.00065558293,0.00030969363,0.00046448671],"domain_scores_gemma":[0.9979864,0.0012819819,0.00015129193,0.00023120559,0.00023644959,0.00011268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028970875,0.0002664707,0.00025850558,0.00038643746,0.00032418058,0.00027822607,0.0004267601,0.00010029961,0.000018485143],"category_scores_gemma":[0.000050567356,0.00022077556,0.00012229943,0.00043405773,0.0001954424,0.0008589964,0.000009235188,0.00019914506,0.000020061805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022285396,0.00010378486,0.00020273999,0.00002535056,0.000023398476,0.0000061832447,0.001277811,0.23553884,0.0007782662,0.0031489811,0.000005663817,0.75886667],"study_design_scores_gemma":[0.00014856146,0.00024306365,0.0005764098,0.00055115356,0.00001720732,0.000045354962,0.00038981577,0.9139838,0.04907896,0.034232747,0.00026415905,0.0004687595],"about_ca_topic_score_codex":0.000056472465,"about_ca_topic_score_gemma":0.000027479517,"teacher_disagreement_score":0.8023483,"about_ca_system_score_codex":0.000111770656,"about_ca_system_score_gemma":0.00012288001,"threshold_uncertainty_score":0.9002966},"labels":[],"label_agreement":null}]}