{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064535,0.0003090924,0.0007248779,0.0004393772,0.0005222878,0.0009714183,0.0007508916,0.0008548586,0.00574016],"category_scores_gemma":[0.005088984,0.0002550575,0.0004349117,0.0005517122,0.001105136,0.001116502,0.0009834025,0.0008447092,0.0004882598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008843139,"about_ca_system_score_gemma":0.0008594496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006007894,"about_ca_topic_score_gemma":0.005689013,"domain_scores_codex":[0.9994751,0.000244678,0.00002032152,0.00006159054,0.0001182578,0.00008001535],"domain_scores_gemma":[0.998401,0.001182685,0.00008020845,0.000114655,0.0001484498,0.00007299386],"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.0001197164,0.00003357996,0.0009405952,0.00003539121,0.00001735915,0.00008344939,0.00009351835,0.8294067,0.0004814708,0.1556171,0.001311986,0.01185927],"study_design_scores_gemma":[0.00001570879,0.00001408202,0.00008532569,0.000005059038,0.000003034536,0.00001189657,0.00001901963,0.9668642,0.000172934,0.0319174,0.0008875647,0.000003741795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.195923,0.0005310818,0.7499408,0.000643244,0.0001380443,0.0001318218,0.0002998404,0.0006373869,0.05175473],"genre_scores_gemma":[0.8351283,0.0001927411,0.156383,0.0003159095,0.00002482691,0.0001939122,0.000323406,0.0001417068,0.007296271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006007894,"threshold_uncertainty_score":0.01920277,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901738,0.000375945,0.0002894072,0.0003452198,0.0002293685,0.0005692727,0.0007008921,0.0004398019,0.001745416],"category_scores_gemma":[0.001851192,0.0002403248,0.0004399945,0.000221586,0.0005262167,0.000440039,0.0006530816,0.0004315375,0.0002134381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005341964,"about_ca_system_score_gemma":0.0005085316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012481,"about_ca_topic_score_gemma":0.0009842962,"domain_scores_codex":[0.9998135,0.00004865109,0.0000101697,0.00003845635,0.00005773868,0.00003155258],"domain_scores_gemma":[0.9995067,0.0002612691,0.00004395457,0.00006665238,0.00009356885,0.00002784679],"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.000110203,0.00009546783,0.001799397,0.0001282283,0.00002996804,0.0001449829,0.0002716437,0.8133831,0.04491338,0.0557685,0.001198191,0.08215692],"study_design_scores_gemma":[0.00002808876,0.00008886153,0.0002987344,0.00001563848,0.00001230555,0.00004413769,0.00002499592,0.977752,0.01021819,0.008801542,0.002702265,0.00001315332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1537215,0.00005957661,0.8362226,0.00008410507,0.00002918835,0.000119638,0.0001047334,0.001185204,0.008473425],"genre_scores_gemma":[0.6991491,0.00005739159,0.2963674,0.00004325283,0.000005371991,0.0002353344,0.000219185,0.0002753338,0.003647706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001745416,"threshold_uncertainty_score":0.005838931,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008524907,0.0009840089,0.0006156528,0.0008011425,0.0008539439,0.002076782,0.002895019,0.001682348,0.005646148],"category_scores_gemma":[0.002450769,0.0006212419,0.002102282,0.0006734392,0.001672895,0.001569684,0.001752749,0.002576854,0.001101006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001282218,"about_ca_system_score_gemma":0.001529388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002962871,"about_ca_topic_score_gemma":0.004434555,"domain_scores_codex":[0.999254,0.0001920675,0.00004163135,0.0001926013,0.0002626957,0.00005703587],"domain_scores_gemma":[0.9994369,0.0001973225,0.00005496999,0.0001513619,0.0001090781,0.00005037273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000338678,0.00009250111,0.0006696114,0.0002190907,0.00006331394,0.0001837772,0.0005378444,0.3642056,0.01027018,0.5695048,0.002397253,0.05182211],"study_design_scores_gemma":[0.00001028339,0.00003108412,0.0001350991,0.00003832725,0.00002375073,0.00009660709,0.00005053435,0.8858254,0.002256927,0.09374075,0.01776658,0.00002468562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009031962,0.00002387068,0.9963872,0.00007294535,0.00001427664,0.00005407177,0.00003199564,0.0001134887,0.002398896],"genre_scores_gemma":[0.08606253,0.0001578699,0.9083112,0.000138519,0.00003457721,0.0004436317,0.0001548133,0.0002288831,0.004468012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005646148,"threshold_uncertainty_score":0.01888824,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006649846,0.0002321377,0.0004368792,0.0005363203,0.0002674629,0.0006429615,0.0004384966,0.0003770436,0.0009867807],"category_scores_gemma":[0.003136639,0.0001417225,0.0003732684,0.0002936882,0.0007802414,0.0007727576,0.0003352216,0.0003954402,0.00008406463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006806208,"about_ca_system_score_gemma":0.0005151103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002284183,"about_ca_topic_score_gemma":0.001103659,"domain_scores_codex":[0.9997839,0.00008423263,0.00001168221,0.00004415611,0.0000506715,0.00002531154],"domain_scores_gemma":[0.9986566,0.0009041097,0.0001799046,0.0001350631,0.00008769565,0.00003659264],"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.00009517701,0.0000614496,0.00433738,0.0000541145,0.00004290516,0.0001344098,0.0001978205,0.8981897,0.01179186,0.05141059,0.0002472813,0.03343727],"study_design_scores_gemma":[0.000002458388,0.00002001094,0.0004284597,0.000002663099,0.00000311928,0.0000177765,0.00001109999,0.9917974,0.0006898568,0.006894191,0.0001275579,0.000005282454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2791912,0.0001542585,0.7176407,0.0001361309,0.00001580689,0.0000509229,0.0000999076,0.0002402029,0.002470944],"genre_scores_gemma":[0.9284049,0.00006523763,0.07067271,0.00001543173,0.000004584797,0.00006001851,0.00005653788,0.0000159676,0.0007046554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002284183,"threshold_uncertainty_score":0.004938304,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131066,0.001057441,0.0004722528,0.000549293,0.0005961833,0.001530577,0.001875475,0.0009389659,0.004375111],"category_scores_gemma":[0.004886787,0.0007156583,0.0009898578,0.0004336633,0.0009293694,0.001434806,0.001717628,0.001176621,0.0006892939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136581,"about_ca_system_score_gemma":0.001771253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01239974,"about_ca_topic_score_gemma":0.02100201,"domain_scores_codex":[0.9989065,0.0005323496,0.00006375325,0.0001953974,0.0002344634,0.00006756321],"domain_scores_gemma":[0.9979437,0.001497244,0.0001544237,0.0001781631,0.000142574,0.00008398992],"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.0001922625,0.0001431198,0.001804468,0.0002232938,0.0000616904,0.0003001805,0.0009920367,0.9029744,0.004490713,0.03267069,0.001750274,0.05439693],"study_design_scores_gemma":[0.00001605754,0.0000212351,0.0001134638,0.00001100139,0.0000122086,0.0000322324,0.00005448389,0.9876425,0.001013926,0.008287653,0.00278678,0.000008458502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02042069,0.0001974503,0.9727233,0.000212411,0.00002336246,0.0002000865,0.000237573,0.001620636,0.00436447],"genre_scores_gemma":[0.4365415,0.0003450176,0.5589324,0.00006443881,0.00001794056,0.0004777567,0.0006232751,0.000312989,0.002684709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01239974,"threshold_uncertainty_score":0.0246551,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498801,0.0006631982,0.0004099991,0.001271684,0.0007125733,0.001858057,0.001144907,0.0006400492,0.005054626],"category_scores_gemma":[0.01167468,0.0004530158,0.001037612,0.0005516491,0.001313113,0.002479319,0.001142652,0.0009024587,0.00125111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214034,"about_ca_system_score_gemma":0.001261145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00457697,"about_ca_topic_score_gemma":0.005529498,"domain_scores_codex":[0.9970149,0.001139821,0.0002207689,0.0005215292,0.0009800183,0.0001230279],"domain_scores_gemma":[0.9946613,0.003142013,0.0003389927,0.0009636817,0.0007866838,0.0001072867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000557931,0.0004014937,0.008951752,0.001764178,0.0002397257,0.001963596,0.006977015,0.1997321,0.07091298,0.318968,0.01473619,0.374795],"study_design_scores_gemma":[0.00005301301,0.0002313112,0.00137083,0.0001013332,0.0001003481,0.0005836063,0.0005222301,0.8220454,0.05426953,0.06769271,0.05294343,0.00008622441],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03321248,0.0001643761,0.9423561,0.0002205702,0.00004794008,0.0004283081,0.0005878028,0.01541589,0.007566503],"genre_scores_gemma":[0.3251355,0.0001855354,0.66323,0.0001313682,0.00002532463,0.0002976289,0.001595353,0.002568341,0.006831035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005054626,"threshold_uncertainty_score":0.01690942,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007559309,0.0007669937,0.000397104,0.0006677554,0.0003799215,0.0007923579,0.000960756,0.0006048051,0.002163905],"category_scores_gemma":[0.002009428,0.0002715592,0.0005527326,0.0003002022,0.0006161304,0.0005752592,0.0007892614,0.0006431275,0.0004032239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003422393,"about_ca_system_score_gemma":0.0003775105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008243172,"about_ca_topic_score_gemma":0.0009672666,"domain_scores_codex":[0.9995027,0.00020226,0.00002364721,0.00008007947,0.0001475942,0.00004377176],"domain_scores_gemma":[0.9994241,0.0003553227,0.00005558792,0.00005111397,0.00006765788,0.0000461978],"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.0002824331,0.0006122442,0.006739698,0.0004752378,0.0001598601,0.000704504,0.001824783,0.4835027,0.06820867,0.09764691,0.002194742,0.3376482],"study_design_scores_gemma":[0.0000861854,0.0005220462,0.00138217,0.0000798263,0.00008553159,0.0005185253,0.0002849756,0.9424839,0.01663497,0.02135762,0.01650219,0.00006202985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07932103,0.0001262843,0.9093895,0.0001140148,0.00004159122,0.0003484854,0.00003171918,0.0007200616,0.009907322],"genre_scores_gemma":[0.3442852,0.0002277167,0.6503738,0.00009125724,0.00001367742,0.0004024063,0.0001257759,0.0001385307,0.004341715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002163905,"threshold_uncertainty_score":0.007239044,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003139954,0.001456333,0.001117788,0.001208636,0.0003793451,0.00150131,0.001707875,0.001322949,0.001672115],"category_scores_gemma":[0.01301327,0.0005807403,0.0008643096,0.0006169894,0.001061757,0.002170961,0.001240818,0.001974704,0.0002258705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262061,"about_ca_system_score_gemma":0.001239754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005262807,"about_ca_topic_score_gemma":0.003675099,"domain_scores_codex":[0.9985304,0.0006679224,0.00007627313,0.0002986786,0.0002660762,0.0001606215],"domain_scores_gemma":[0.9878192,0.01036388,0.0008868854,0.0002083249,0.0004332771,0.0002885359],"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.0002373739,0.0001100985,0.002791957,0.00005781347,0.00005900155,0.00006772728,0.00008317443,0.9674793,0.0009156236,0.004833149,0.0002216291,0.0231432],"study_design_scores_gemma":[0.000004029259,0.00001460768,0.0001258222,0.000002245627,0.000002864826,0.000004171527,0.000007346548,0.9956868,0.0002763945,0.003846901,0.00002594233,0.000002867767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1802538,0.0001836034,0.817255,0.0003667617,0.00002411749,0.00008129235,0.0001519694,0.0005474399,0.001136058],"genre_scores_gemma":[0.8981233,0.000101392,0.1006073,0.00007883827,0.0000197536,0.0001316257,0.0002495943,0.00005505048,0.000633025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005262807,"threshold_uncertainty_score":0.01660585,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007833966,0.000690448,0.0006360245,0.0005610246,0.0004231935,0.001750177,0.001718255,0.0009242346,0.02445223],"category_scores_gemma":[0.004466346,0.000420469,0.001012429,0.0007740057,0.0005944961,0.001809398,0.002255823,0.001650776,0.002714011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009241363,"about_ca_system_score_gemma":0.002151252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004508521,"about_ca_topic_score_gemma":0.009412309,"domain_scores_codex":[0.9989906,0.0001819256,0.00007023227,0.0002064769,0.0003479159,0.0002028938],"domain_scores_gemma":[0.9989417,0.0006148609,0.00004942243,0.0001355573,0.0001870142,0.000071535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004748398,0.0002613704,0.001900276,0.0005340968,0.0000954806,0.0006283566,0.0002828203,0.2203858,0.005581609,0.5562149,0.0382231,0.1754173],"study_design_scores_gemma":[0.0002687406,0.00007771169,0.0002680125,0.00004890365,0.00003407451,0.0002938397,0.00008981728,0.7742949,0.00351882,0.1781725,0.04290594,0.00002679701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03312062,0.0002494325,0.8812242,0.00103795,0.0002428153,0.0003440537,0.002371255,0.00233117,0.07907849],"genre_scores_gemma":[0.2837744,0.0002247697,0.683589,0.0004686683,0.0001336795,0.0003705476,0.002252999,0.0006005612,0.0285855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02445223,"threshold_uncertainty_score":0.08180088,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001901708,0.0009083889,0.000978895,0.0008055653,0.001416343,0.002762195,0.001468386,0.001464348,0.02674276],"category_scores_gemma":[0.01061302,0.0005674108,0.0008314747,0.0006779643,0.002108985,0.005669564,0.004634058,0.002472617,0.002039358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009821632,"about_ca_system_score_gemma":0.001309732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001273386,"about_ca_topic_score_gemma":0.001853877,"domain_scores_codex":[0.9979266,0.00085935,0.0001164894,0.0003679089,0.0004085006,0.0003212014],"domain_scores_gemma":[0.9962219,0.002175008,0.0003344145,0.00052673,0.0003583101,0.0003836112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003297802,0.0001457904,0.001000168,0.0001994403,0.00005139206,0.000296502,0.0004607346,0.08111911,0.002359854,0.8668713,0.005302866,0.04186302],"study_design_scores_gemma":[0.0001525983,0.0001772479,0.0002438096,0.00007477309,0.00003394366,0.0001904667,0.0002319301,0.2643719,0.002465985,0.7175747,0.01445323,0.0000293584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.210543,0.0004213614,0.6474137,0.001682105,0.0002735888,0.0003994319,0.0004710513,0.001691366,0.1371044],"genre_scores_gemma":[0.8153195,0.0001714719,0.1610081,0.0007295976,0.00004839423,0.0003430098,0.0002861891,0.0003490165,0.02174468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02674276,"threshold_uncertainty_score":0.08946341,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00720804,0.0009491728,0.0009690353,0.0004796759,0.0007423472,0.002715922,0.001508452,0.001881736,0.003480062],"category_scores_gemma":[0.05693616,0.0006832809,0.0005179531,0.0005475847,0.001370976,0.003029612,0.00130263,0.001925778,0.0005019294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008866781,"about_ca_system_score_gemma":0.0008882975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003628385,"about_ca_topic_score_gemma":0.0003971033,"domain_scores_codex":[0.9921997,0.004449837,0.0008659385,0.0009154839,0.001171353,0.0003976717],"domain_scores_gemma":[0.9515802,0.03959327,0.002371603,0.003859172,0.001453603,0.001142054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.03881471,0.03073517,0.04742598,0.005129268,0.001289075,0.0009176407,0.00590983,0.2404906,0.3121629,0.07203919,0.002160938,0.2429247],"study_design_scores_gemma":[0.01228415,0.1196537,0.05910444,0.0008854649,0.002262465,0.000737298,0.002646618,0.4111232,0.2091832,0.1481301,0.03306814,0.0009211735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8998925,0.0002370177,0.08499368,0.0005223189,0.0001900238,0.006264478,0.0004439143,0.0002720313,0.007184125],"genre_scores_gemma":[0.926683,0.0001836252,0.05757374,0.000367558,0.00004069769,0.01338067,0.000142659,0.00009824371,0.00152976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00720804,"threshold_uncertainty_score":0.03812021,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005740558,0.000768014,0.0009016873,0.0006144538,0.0007923707,0.001163787,0.001844026,0.001392054,0.006127092],"category_scores_gemma":[0.001505096,0.0005011839,0.00060522,0.000298633,0.0009446074,0.000778367,0.001727103,0.001308587,0.0005211532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001103391,"about_ca_system_score_gemma":0.002354886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01407497,"about_ca_topic_score_gemma":0.01552783,"domain_scores_codex":[0.9996665,0.00006809088,0.00001904631,0.00007485512,0.0001062159,0.00006539929],"domain_scores_gemma":[0.9996642,0.0001210461,0.00003348225,0.00004266148,0.00007185595,0.00006679723],"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.0001603399,0.00008365593,0.0002632598,0.00007345655,0.00003007243,0.0001642311,0.0001085647,0.9294782,0.005472254,0.02858138,0.001060391,0.03452412],"study_design_scores_gemma":[0.0000181993,0.00001921405,0.00003069412,0.000003483538,0.000005233656,0.000009941552,0.000007749484,0.9969758,0.0003937831,0.002193208,0.000336629,0.000006150579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01832754,0.00007038254,0.9733869,0.0001535353,0.00006046801,0.0001222193,0.00005042712,0.0007553663,0.007073164],"genre_scores_gemma":[0.707127,0.00007645047,0.2868478,0.00007720079,0.00001832061,0.0002541597,0.00008255064,0.00009272961,0.00542376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01407497,"threshold_uncertainty_score":0.02798611,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00818892,0.0009839446,0.001224854,0.000656214,0.00133509,0.002865735,0.001641151,0.001811746,0.005007242],"category_scores_gemma":[0.05898206,0.0002883523,0.001455804,0.0004335416,0.003970497,0.002871339,0.00265494,0.002127189,0.001926682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00141831,"about_ca_system_score_gemma":0.001653447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001039179,"about_ca_topic_score_gemma":0.0007577946,"domain_scores_codex":[0.9896533,0.004622346,0.0007150915,0.001126145,0.002853636,0.001029616],"domain_scores_gemma":[0.9560034,0.02179557,0.003108518,0.01044385,0.006455454,0.002193241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001802089,0.0006955874,0.05099079,0.0007877439,0.000600514,0.001648609,0.006859476,0.04555304,0.03011945,0.6574749,0.03591225,0.1675557],"study_design_scores_gemma":[0.0002451682,0.002694387,0.03118074,0.0003080104,0.0002542544,0.001510285,0.00267697,0.2952566,0.07348213,0.5165349,0.07549913,0.0003573823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5994407,0.0004058376,0.2854909,0.006222778,0.0004306729,0.0006706282,0.0009052794,0.001882489,0.1045506],"genre_scores_gemma":[0.9394735,0.0001116962,0.05039274,0.0006665508,0.00005805662,0.0003647546,0.0003804477,0.0001961312,0.008356243],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00818892,"threshold_uncertainty_score":0.04330766,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007086669,0.001675576,0.002432121,0.001042248,0.0006062545,0.002923769,0.005459199,0.002505454,0.003532657],"category_scores_gemma":[0.02673977,0.001079474,0.001540236,0.001107154,0.002352595,0.004036684,0.002341232,0.003393813,0.0007895879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019462,"about_ca_system_score_gemma":0.002012262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002845428,"about_ca_topic_score_gemma":0.001838432,"domain_scores_codex":[0.9931618,0.002859355,0.0003367931,0.001359301,0.00178514,0.000497533],"domain_scores_gemma":[0.9860972,0.008415509,0.002351835,0.001495485,0.001277746,0.000362195],"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.00009817089,0.0001643258,0.000769068,0.0001440479,0.0001371018,0.0002003871,0.0001326192,0.7363805,0.002265944,0.2154423,0.0009706155,0.04329496],"study_design_scores_gemma":[0.00001646773,0.00005965783,0.00009410077,0.000006637193,0.00001440978,0.00004566959,0.000006644996,0.9573383,0.0003375047,0.04157276,0.0004892406,0.00001862891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002874782,0.0001118911,0.9956486,0.0001035088,0.00001939506,0.00003385617,0.00001530921,0.0001097099,0.001083055],"genre_scores_gemma":[0.635193,0.000423469,0.3549538,0.0002393698,0.0003142201,0.0002942603,0.000113913,0.0001870582,0.008280886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007086669,"threshold_uncertainty_score":0.03747833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}