{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"4f44b01ba0d3","filters":{"venue":"IEEE Transactions on Computational Intelligence and AI in Games"}},"results":[{"id":"W2102256448","doi":"10.1109/tciaig.2010.2067212","title":"Monte Carlo Tree Search in Hex","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Monte Carlo method; Game tree; Computer science; Tree (set theory); Olympiad; Theoretical computer science; Algorithm; Artificial intelligence; Game theory; Mathematics; Mathematical economics; Combinatorics; Statistics; Sequential game","authors":[{"name":"Broderick Arneson","is_ca":true},{"name":"Ryan Hayward","is_ca":true},{"name":"Philip Henderson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03421570580501265,"gpt":0.3124778418136939,"spread":0.2782621360086812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003989941,0.0002199031,0.0002275694,0.000624639,0.0001249583,0.0001955512,0.0006215303,0.0001318436,0.00005365762],"category_scores_gemma":[0.00001922295,0.0002228083,0.00007602745,0.0008395683,0.0002471022,0.0006672484,0.00001014908,0.0008750228,0.00009688057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000527136,"about_ca_system_score_gemma":0.000134677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005261312,"about_ca_topic_score_gemma":0.002583538,"domain_scores_codex":[0.9980324,0.00008689403,0.0005124341,0.0005807362,0.0004064595,0.0003810936],"domain_scores_gemma":[0.9987434,0.0006367431,0.00004787005,0.0003120099,0.0001393617,0.0001206008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001829125,0.0002134908,0.0004251898,0.000008254407,0.000007421986,0.00002589323,0.001856137,0.6388329,0.0003911918,0.006161002,0.00002081992,0.3520395],"study_design_scores_gemma":[0.00008761357,0.0001284416,0.003476185,0.00006085937,0.000002701852,0.00003185785,0.0003924294,0.9486735,0.02398839,0.0227119,0.0001513271,0.000294761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2371921,0.00004686624,0.7598346,0.001873305,0.0005640684,0.0001925072,0.000004252677,0.00006922523,0.0002230843],"genre_scores_gemma":[0.9836237,0.0000713429,0.0155313,0.000514993,0.00003745809,0.00004476185,5.230171e-7,0.0000130273,0.0001629097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7464315,"threshold_uncertainty_score":0.908586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel Ashlock","is_ca":true},{"name":"C. Lee","is_ca":true},{"name":"Cameron McGuinness","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09710456400680863,"gpt":0.3039637029241788,"spread":0.2068591389173702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001304847,0.000111213,0.0001130724,0.0002303644,0.00008061509,0.00002998476,0.0002367042,0.00004820467,0.00003950766],"category_scores_gemma":[0.000002009987,0.0001099398,0.00004809408,0.0004325977,0.0001301836,0.000339692,0.000002937909,0.0001457413,0.00001475393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002709683,"about_ca_system_score_gemma":0.0001352843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006106959,"about_ca_topic_score_gemma":0.00001847248,"domain_scores_codex":[0.9990126,0.00004011526,0.0002954924,0.0002890195,0.0002201296,0.0001426661],"domain_scores_gemma":[0.9994794,0.0001006244,0.00005053549,0.0001512395,0.0001621061,0.00005605627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001526973,0.0005911019,0.0001025568,0.00002809756,0.00001755083,0.000002962764,0.001869568,0.8675519,0.0006695858,0.03428382,0.00005740728,0.09481014],"study_design_scores_gemma":[0.0001059355,0.0001319344,0.003080164,0.00003175409,0.000003766839,0.000009078007,0.00006488191,0.9493121,0.03593069,0.01115761,0.0000440303,0.000128055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02610106,0.00003985701,0.9727761,0.0006841881,0.0001195933,0.0001658724,0.00001381499,0.00003869858,0.00006079903],"genre_scores_gemma":[0.893556,0.00001504314,0.1058815,0.0004368623,0.00001462629,0.0000425791,0.000003459485,0.000005064837,0.00004493211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8674549,"threshold_uncertainty_score":0.4483216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102669142","doi":"10.1109/tciaig.2011.2161310","title":"A Generic Approach to Challenge Modeling for the Procedural Creation of Video Game Levels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Generative grammar; Entertainment; Fitness function; Generative Design; Video game; Generative model; Constraint (computer-aided design); Multimedia; Human–computer interaction; Artificial intelligence; Function (biology); Genetic algorithm; Game design; Machine learning","authors":[{"name":"Nathan Sorenson","is_ca":true},{"name":"Philippe Pasquier","is_ca":true},{"name":"Steve DiPaola","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1476889815550019,"gpt":0.3228816404081994,"spread":0.1751926588531975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965963,0.000175544,0.0001944675,0.0002721024,0.0001323026,0.00006101407,0.0005235699,0.00006733608,0.000008534752],"category_scores_gemma":[0.00002296048,0.0001419656,0.0000885803,0.0004910213,0.0001161604,0.0003897917,0.000007705733,0.0001596996,0.000008437557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003685892,"about_ca_system_score_gemma":0.00008762052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001082665,"about_ca_topic_score_gemma":0.00003697459,"domain_scores_codex":[0.9985498,0.00004255517,0.0004863574,0.0004250385,0.0002618241,0.0002344671],"domain_scores_gemma":[0.9989441,0.0004040773,0.00008218525,0.0002314337,0.0002704003,0.0000677858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003627724,0.0002060698,0.000003417766,0.00002321993,0.00001885716,3.021032e-7,0.007611731,0.8373551,0.00005425789,0.01778956,0.000007839618,0.1368933],"study_design_scores_gemma":[0.00004512935,0.0001976227,0.00009455913,0.00004992172,0.00001009125,0.000006689527,0.0007501392,0.9443415,0.009754079,0.04456904,0.00002631946,0.0001548917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006951858,0.0001379996,0.9910008,0.0008537394,0.0002004781,0.0006055203,0.00000880981,0.00004685545,0.0001939611],"genre_scores_gemma":[0.910043,0.00005787354,0.08910814,0.0004709491,0.00002554109,0.0002463059,7.932812e-7,0.00001124777,0.00003615224],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9030911,"threshold_uncertainty_score":0.5789191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel Ashlock","is_ca":true},{"name":"Eun-Youn Kim","is_ca":false},{"name":"Wendy Ashlock","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04299606175402597,"gpt":0.3450189370156095,"spread":0.3020228752615835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003123523,0.0000805637,0.0001386979,0.0002735484,0.0003161848,0.00004246045,0.000117429,0.00004528079,0.00005984842],"category_scores_gemma":[0.00003535729,0.00007065984,0.00009924285,0.001326403,0.000202539,0.0002391996,0.000001292379,0.0001386289,0.000002252245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006000793,"about_ca_system_score_gemma":0.0001014785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005452032,"about_ca_topic_score_gemma":0.0007773338,"domain_scores_codex":[0.9988953,0.0002298878,0.0002944895,0.0001874238,0.0002730952,0.0001198415],"domain_scores_gemma":[0.9992159,0.0004146451,0.00009045401,0.00009763111,0.0001480431,0.00003333113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003374505,0.0001065433,0.0003624436,0.000001769982,0.00004202262,7.368516e-7,0.004482195,0.9586081,0.00009357738,0.00769782,0.00000215941,0.02856887],"study_design_scores_gemma":[0.00008672396,0.00007159603,0.02124391,0.0000618085,0.0001282156,0.0000013234,0.001374287,0.9303343,0.002308025,0.04417101,0.00006718982,0.0001516271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4052667,0.0000231846,0.5934818,0.0008845174,0.00008838726,0.000116278,0.000008423136,0.00001232729,0.0001183088],"genre_scores_gemma":[0.9986406,0.00007368177,0.0008193362,0.0003251831,0.00001670707,0.000006106767,0.00000284794,0.000002715661,0.0001128252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5933739,"threshold_uncertainty_score":0.2881425,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alejandro Ramírez","is_ca":true},{"name":"Vadim Bulitko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04652783522670113,"gpt":0.3296732094588575,"spread":0.2831453742321564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003342883,0.0002062268,0.0002202085,0.0003595643,0.0002324533,0.0002046303,0.0002596587,0.00008726198,0.000004745259],"category_scores_gemma":[0.00003159607,0.0002101431,0.00005527639,0.0002445026,0.0001013682,0.0006490517,0.000006836506,0.0002745437,0.00001000847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000475431,"about_ca_system_score_gemma":0.00004326981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003340886,"about_ca_topic_score_gemma":0.00001671748,"domain_scores_codex":[0.9985288,0.00007076479,0.0004146787,0.0005182041,0.0001997358,0.0002678027],"domain_scores_gemma":[0.998267,0.00126481,0.00007499756,0.0001493067,0.0001552581,0.00008864565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003186774,0.000053481,0.00002962905,0.00001530099,0.00001537857,0.00000147152,0.002231487,0.8811362,0.00005139827,0.00498294,0.00001155457,0.1114393],"study_design_scores_gemma":[0.00007544874,0.0001576904,0.00003836401,0.0001501656,0.000006535554,0.00001349815,0.0004321331,0.9554232,0.004964441,0.03844558,0.00007203501,0.0002208588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03428963,0.00009796859,0.9642029,0.0005139679,0.0003752767,0.0002370261,0.000004305424,0.0002266308,0.00005225841],"genre_scores_gemma":[0.9429477,0.00002839106,0.05632216,0.0005707298,0.00003571911,0.00005549292,0.000001635433,0.00001430697,0.00002382324],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9086581,"threshold_uncertainty_score":0.8569386,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ben Kybartas","is_ca":true},{"name":"Clark Verbrugge","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03904835426595322,"gpt":0.306807278472532,"spread":0.2677589242065788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002927308,0.0001707191,0.0003047841,0.0008710488,0.0001512358,0.0001683037,0.0003345509,0.00008419692,0.0000245679],"category_scores_gemma":[0.00002023275,0.0001707116,0.0001692982,0.001274085,0.000118033,0.000602578,0.000004375978,0.0001342131,0.00002468404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005943207,"about_ca_system_score_gemma":0.00006845267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000535363,"about_ca_topic_score_gemma":0.0001870593,"domain_scores_codex":[0.9983116,0.00007830468,0.0006501852,0.0004548727,0.0002848441,0.0002202266],"domain_scores_gemma":[0.9985044,0.0006168484,0.0001539465,0.0002310944,0.0004200437,0.00007367836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007565872,0.00009306151,0.00009634229,0.00002956416,0.0001314758,0.000001169995,0.0008450157,0.8467346,0.0005732252,0.03033818,0.00002080758,0.121129],"study_design_scores_gemma":[0.00004067803,0.0001363766,0.0002745963,0.00007092358,0.00006137026,0.000005660953,0.0006327668,0.9411672,0.0428975,0.01453203,0.00001216026,0.0001687354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06493957,0.00008758801,0.9335564,0.0006119458,0.0002462553,0.0003928089,0.00001264905,0.00006710374,0.00008567385],"genre_scores_gemma":[0.9720742,0.00003529916,0.02736183,0.0002519415,0.00003070989,0.0001821388,0.000007127387,0.000009104239,0.000047714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9071346,"threshold_uncertainty_score":0.6961418,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Giovanna Martínez-Arellano","is_ca":false},{"name":"Richard Cant","is_ca":false},{"name":"David D. Woods","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04723508883444439,"gpt":0.3226099156286452,"spread":0.2753748267942008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897088,0.0002664707,0.0002585056,0.0003864375,0.0003241806,0.0002782261,0.0004267601,0.0001002996,0.00001848514],"category_scores_gemma":[0.00005056736,0.0002207756,0.0001222994,0.0004340577,0.0001954424,0.0008589964,0.000009235188,0.0001991451,0.00002006181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117707,"about_ca_system_score_gemma":0.00012288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005647247,"about_ca_topic_score_gemma":0.00002747952,"domain_scores_codex":[0.9978608,0.00007382208,0.0006356176,0.0006555829,0.0003096936,0.0004644867],"domain_scores_gemma":[0.9979864,0.001281982,0.0001512919,0.0002312056,0.0002364496,0.00011268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000222854,0.0001037849,0.00020274,0.00002535056,0.00002339848,0.000006183245,0.001277811,0.2355388,0.0007782662,0.003148981,0.000005663817,0.7588667],"study_design_scores_gemma":[0.0001485615,0.0002430637,0.0005764098,0.0005511536,0.00001720732,0.00004535496,0.0003898158,0.9139838,0.04907896,0.03423275,0.0002641591,0.0004687595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06447701,0.00008890879,0.9328286,0.001634242,0.0004150806,0.0004149534,0.000007936437,0.0001196631,0.00001357435],"genre_scores_gemma":[0.8668253,0.00004702089,0.1322005,0.000663585,0.00007221434,0.00009960894,8.550768e-7,0.00002043581,0.00007043788],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8023483,"threshold_uncertainty_score":0.9002966,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marius Stănescu","is_ca":true},{"name":"Michal Čertický","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02649509238743087,"gpt":0.2769151818827071,"spread":0.2504200894952763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004069124,0.0002070351,0.0002136477,0.0003310863,0.0001415496,0.0001897219,0.000243725,0.00007636596,0.00001193503],"category_scores_gemma":[0.00001529775,0.0001792197,0.00004073515,0.0006145202,0.0001247775,0.0006500311,0.000004693468,0.0002905561,0.00002012981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005752996,"about_ca_system_score_gemma":0.00009256011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001470809,"about_ca_topic_score_gemma":0.0002552116,"domain_scores_codex":[0.9983717,0.0001279393,0.0003452113,0.0005758138,0.0002760266,0.0003033524],"domain_scores_gemma":[0.9992563,0.0002587468,0.00008694701,0.0001865864,0.0001292139,0.00008224748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004372744,0.000281418,0.00169614,0.00003693034,0.00001885284,0.000009103321,0.003166214,0.653183,0.0001001201,0.002269614,0.00001790062,0.339177],"study_design_scores_gemma":[0.0002957408,0.0006253533,0.006958651,0.0003096821,0.00001150432,0.00007583661,0.000604955,0.9786496,0.00371878,0.008222137,0.0001380515,0.0003897251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2242841,0.00003727173,0.7743079,0.0004156595,0.0002034554,0.0002626253,0.000001554709,0.0001239153,0.0003635591],"genre_scores_gemma":[0.9870766,0.0000668964,0.01247353,0.00007691703,0.00005762072,0.00006261234,0.00000450926,0.00001187233,0.000169378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7627926,"threshold_uncertainty_score":0.7308366,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jiaxing Song","is_ca":true},{"name":"Martin Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03134361171356633,"gpt":0.3152985357169212,"spread":0.2839549240033549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003808685,0.0001572485,0.0001888166,0.0001875242,0.0001452486,0.0001002164,0.0006101316,0.000066049,0.00001969732],"category_scores_gemma":[0.00002626899,0.0001254193,0.00009049514,0.0003474077,0.0002604215,0.0004291325,0.000004031972,0.0001841763,0.0000135047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002133698,"about_ca_system_score_gemma":0.00006003242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006546084,"about_ca_topic_score_gemma":0.00009959839,"domain_scores_codex":[0.9986525,0.00007561358,0.0004244766,0.0003750624,0.0002490593,0.0002232846],"domain_scores_gemma":[0.9974917,0.001813913,0.0000959336,0.0003277748,0.0002070463,0.00006366592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001956595,0.000121592,0.000009373563,0.00000867476,0.00001211216,1.828621e-7,0.001165698,0.6397819,0.0004599148,0.03015351,0.00001197108,0.3282555],"study_design_scores_gemma":[0.00005283561,0.0002779786,0.0002328884,0.00003528602,0.000007455733,0.000002695847,0.0002231292,0.8165371,0.09244273,0.08987927,0.0001779425,0.0001306851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01407479,0.0000488503,0.9838943,0.00118886,0.0003879714,0.0002902875,0.000007284084,0.00004999531,0.00005760618],"genre_scores_gemma":[0.9720806,0.00005493533,0.02696956,0.0007166347,0.00003832542,0.00008215394,0.000001097583,0.000009839349,0.00004681807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9580058,"threshold_uncertainty_score":0.5114453,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; 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","authors":[{"name":"Jakub Pawlewicz","is_ca":false},{"name":"Ryan Hayward","is_ca":true},{"name":"Philip Henderson","is_ca":true},{"name":"Broderick Arneson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02751037634781225,"gpt":0.2917056138452298,"spread":0.2641952374974176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003524663,0.0002069332,0.0002239736,0.0005640726,0.0001421711,0.0001583468,0.000412809,0.00009821777,0.00005643498],"category_scores_gemma":[0.00003036453,0.0002149613,0.00006805923,0.0007200312,0.0001896931,0.0006179985,0.000007257342,0.0004187303,0.000121425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007667907,"about_ca_system_score_gemma":0.00007287894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001612157,"about_ca_topic_score_gemma":0.0004716636,"domain_scores_codex":[0.9982022,0.0001395508,0.0005080007,0.0005329653,0.0002986181,0.0003186705],"domain_scores_gemma":[0.9985455,0.0009463077,0.00006325973,0.0002468986,0.0001023804,0.00009566843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001136334,0.0001689208,0.0001556307,0.000003921481,0.000006712394,0.000003835697,0.0007599668,0.7090471,0.00004293295,0.0499619,0.00002617531,0.2398115],"study_design_scores_gemma":[0.00009512098,0.000255696,0.001369902,0.00007628631,0.000003378598,0.00001712622,0.0004218312,0.9267939,0.007557443,0.06269336,0.0004403829,0.0002756077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04191322,0.0000353026,0.9547783,0.002154344,0.000551024,0.0001673638,0.000003791672,0.00009026899,0.0003063621],"genre_scores_gemma":[0.9901772,0.00004712438,0.008610502,0.0009154212,0.00003729675,0.00005148449,0.000001318606,0.00001144254,0.0001482588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9482639,"threshold_uncertainty_score":0.8765867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Eun-Youn Kim","is_ca":false},{"name":"Daniel Ashlock","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07597290461484736,"gpt":0.3318570849259049,"spread":0.2558841803110576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198802,0.0001225122,0.0001232558,0.0003924202,0.0002587355,0.00005978706,0.0001228252,0.00006404855,0.0007718891],"category_scores_gemma":[0.00002483003,0.0001046103,0.00003158802,0.000423273,0.0001137345,0.0003573881,0.000002534433,0.0000984802,0.0001800486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001863758,"about_ca_system_score_gemma":0.00007238259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000138634,"about_ca_topic_score_gemma":0.0001998514,"domain_scores_codex":[0.9986263,0.0002617051,0.0002661148,0.0002944909,0.0002714518,0.0002799656],"domain_scores_gemma":[0.9993216,0.0004353705,0.00003879053,0.00007453046,0.00005826123,0.0000714483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004228523,0.0005499718,0.000718357,0.00001533159,0.00003886381,0.00002062705,0.09192283,0.7281574,0.003799107,0.004972391,0.0002628891,0.1691194],"study_design_scores_gemma":[0.006262898,0.004106911,0.02529834,0.009477668,0.0001093339,0.00005226498,0.1264125,0.3710786,0.2444462,0.1384798,0.06716032,0.007115072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2074828,0.00008304761,0.7904177,0.001201595,0.0001832363,0.0002943447,0.000008377362,0.00003495062,0.0002939863],"genre_scores_gemma":[0.9951592,0.0001891851,0.00151045,0.0007890019,0.00003892192,0.00007856791,6.478398e-7,0.00001052946,0.002223512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7889072,"threshold_uncertainty_score":0.8451644,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean-François Landry","is_ca":true},{"name":"Jean‐Pierre Dussault","is_ca":true},{"name":"Philippe Mahey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03502819625358886,"gpt":0.2970997863229458,"spread":0.262071590069357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003115221,0.0001958521,0.0002704914,0.0001954402,0.0001522981,0.0001571296,0.0003508267,0.0000714816,0.000008258028],"category_scores_gemma":[0.00004488532,0.0001429793,0.000110149,0.0002444999,0.0002848377,0.0002627421,0.000004732201,0.000155302,0.000002463901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002305506,"about_ca_system_score_gemma":0.00008455905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001687513,"about_ca_topic_score_gemma":0.00002370971,"domain_scores_codex":[0.9986028,0.00005000582,0.0004847053,0.0004214028,0.0001855616,0.0002554992],"domain_scores_gemma":[0.996531,0.00274722,0.0001201398,0.0001888478,0.0003440187,0.00006876687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001144296,0.0001864648,0.00001643037,0.00004553685,0.00004346485,1.845135e-7,0.000621881,0.7969594,0.0003934597,0.006350464,0.00006100564,0.1952073],"study_design_scores_gemma":[0.0003397595,0.0002925832,0.0001169804,0.00003147042,0.00001612584,0.000003759815,0.0002526071,0.9565743,0.009741662,0.03240063,0.00006853073,0.0001615806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002564724,0.0001764193,0.9939549,0.001584741,0.0001742638,0.001453357,0.00004025069,0.00003618208,0.00001516822],"genre_scores_gemma":[0.9171466,0.00002212831,0.08120964,0.0007004197,0.00002799693,0.0008279731,0.000002685744,0.00001231352,0.00005025781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9145818,"threshold_uncertainty_score":0.5830527,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Turing test; Computer science; Turing; Test (biology); Artificial intelligence; Human–computer interaction","authors":[{"name":"Andrew Cenkner","is_ca":true},{"name":"Vadim Bulitko","is_ca":true},{"name":"Marcia L. Spetch","is_ca":true},{"name":"Eric L. G. Legge","is_ca":true},{"name":"Craig G. Anderson","is_ca":true},{"name":"Matthew Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05074143744200125,"gpt":0.3411247877602143,"spread":0.2903833503182131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007548487,0.0001390972,0.0001472669,0.000210118,0.0001661928,0.0001175507,0.00006405794,0.00008734019,0.0009666357],"category_scores_gemma":[0.0000115923,0.0001382533,0.0000521437,0.0001692093,0.0001181179,0.0002388506,0.000001051589,0.0003348993,0.0003285355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000381875,"about_ca_system_score_gemma":0.00002102167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005320713,"about_ca_topic_score_gemma":0.00006591504,"domain_scores_codex":[0.9991121,0.00005075928,0.0002391996,0.0002802762,0.0001291824,0.0001884783],"domain_scores_gemma":[0.9989502,0.0007805347,0.00005030941,0.00007223524,0.00007042698,0.00007623107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008289253,0.000807601,0.002723151,0.00003829686,0.0001254974,0.00002275791,0.01838852,0.07536145,0.0004730253,0.006115946,0.002034734,0.8938261],"study_design_scores_gemma":[0.002509283,0.001792456,0.3700609,0.001266376,0.0001710901,0.0006599858,0.08113655,0.4329397,0.009995207,0.09142762,0.005259823,0.002781029],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1976552,0.00024362,0.7900381,0.005838705,0.001239827,0.0003478374,0.00001006157,0.0001230998,0.004503528],"genre_scores_gemma":[0.9959446,0.00004528743,0.001058687,0.001589223,0.00005518412,0.00007511862,0.000001797278,0.00001351523,0.001216621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8910451,"threshold_uncertainty_score":0.9999466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Amir Danak","is_ca":true},{"name":"Shie Mannor","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1503638895536261,"gpt":0.3396824478784384,"spread":0.1893185583248123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004157936,0.0001372785,0.0001570041,0.000407803,0.0003772012,0.0001195109,0.0001525697,0.000053477,0.00006531172],"category_scores_gemma":[0.00003231916,0.0001113714,0.00003329302,0.0008527147,0.0001758327,0.0003027584,0.000003841885,0.0002831031,0.00003981623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002165786,"about_ca_system_score_gemma":0.0000312861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004733129,"about_ca_topic_score_gemma":0.000009636579,"domain_scores_codex":[0.9985844,0.00009957887,0.000357851,0.0004707663,0.0003329428,0.0001544249],"domain_scores_gemma":[0.9990553,0.0004303094,0.00007515664,0.0001446798,0.0001753541,0.0001191941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007719353,0.000181982,0.001238218,0.000003317261,0.00001632342,0.000001249919,0.003165845,0.926156,0.00003161741,0.003204501,0.00001647362,0.06590732],"study_design_scores_gemma":[0.001179874,0.001734193,0.09927034,0.000523162,0.0001405886,0.0006354458,0.07575608,0.5494537,0.035916,0.2309963,0.002376727,0.002017569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.149052,0.00002808337,0.8494069,0.0002298272,0.0000862802,0.0001642281,0.000004312803,0.00004801939,0.0009803355],"genre_scores_gemma":[0.9767895,0.0000399561,0.02216471,0.00008405883,0.00002585277,0.00008576635,0.000001158599,0.000009306724,0.0007996944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8277375,"threshold_uncertainty_score":0.4541593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}