{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"2d4429f89592","filters":{"venue":"2020 IEEE Conference on Games (CoG)"}},"results":[{"id":"W3093947831","doi":"10.1109/cog47356.2020.9231637","title":"Evolving Initial Heuristic Functions for Agent-Centered Heuristic Search","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":8,"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":"Heuristics; Incremental heuristic search; Pathfinding; Computer science; Heuristic; Beam search; Artificial intelligence; Hyper-heuristic; Context (archaeology); Domain (mathematical analysis); Class (philosophy); Consistent heuristic; Mathematical optimization; Theoretical computer science; Machine learning; Graph; Search algorithm; Mathematics; Algorithm; Robot; Mobile robot","authors":[{"name":"Vadim Bulitko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1313606239383958,"gpt":0.3236612080701814,"spread":0.1923005841317856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002608832,0.000370384,0.0004426936,0.0001239155,0.0002879743,0.0005186499,0.001357778,0.0001281259,0.0001400664],"category_scores_gemma":[0.000679327,0.0003778687,0.0001716311,0.0005266737,0.0001141314,0.0003303787,0.0002293643,0.0004883599,0.000878707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006132902,"about_ca_system_score_gemma":0.0003972132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001988381,"about_ca_topic_score_gemma":0.000002102733,"domain_scores_codex":[0.996945,0.000189695,0.0004847468,0.001056489,0.0005803914,0.0007437388],"domain_scores_gemma":[0.9978253,0.0004783343,0.0001525863,0.0006831264,0.0003573067,0.000503348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001290924,0.002183167,0.002900602,0.002070504,0.001730966,0.003141707,0.02740645,0.05348403,0.02181559,0.0516913,0.4882146,0.3440701],"study_design_scores_gemma":[0.001115779,0.0009152687,0.001219416,0.0001646419,0.0000699499,0.00002556267,0.0001529238,0.9928009,0.0004382104,0.0006592986,0.001937994,0.0005000567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00151626,0.0001026753,0.9882207,0.004274399,0.001989001,0.0007729955,0.0001158054,0.0004927707,0.002515412],"genre_scores_gemma":[0.9584839,0.0000173556,0.03801651,0.001706166,0.0007460944,0.0001516453,0.00004955689,0.00004446178,0.000784348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9569676,"threshold_uncertainty_score":0.9998992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3093593979","doi":"10.1109/cog47356.2020.9231889","title":"Combining Influence Maps with Heuristic Search for Executing Sneak-Attacks in RTS Games","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Adversary; Computer science; Surprise; Heuristic; Path (computing); Domain (mathematical analysis); Order (exchange); Artificial intelligence; Computer security; Programming language; Mathematics","authors":[{"name":"Lucas Critch","is_ca":true},{"name":"David G. Churchill","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07439078111553457,"gpt":0.3131677415266299,"spread":0.2387769604110953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005098048,0.0004818232,0.000612567,0.0001531162,0.0001998081,0.0006135223,0.001998031,0.0001645212,0.00004598649],"category_scores_gemma":[0.0005139741,0.0004480851,0.0001091351,0.001033735,0.0003197539,0.0006878108,0.0003219743,0.0006974945,0.000242502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007743148,"about_ca_system_score_gemma":0.0004594061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001115979,"about_ca_topic_score_gemma":0.00008463228,"domain_scores_codex":[0.9960212,0.0001990189,0.0007303681,0.00134049,0.0007100721,0.0009988199],"domain_scores_gemma":[0.9973446,0.0007952604,0.0002477955,0.0007800826,0.0004370338,0.0003952004],"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.001845699,0.001073019,0.06298331,0.001562862,0.0003971138,0.001667349,0.08919531,0.1984247,0.03237959,0.282195,0.00847609,0.3198],"study_design_scores_gemma":[0.001096334,0.002479146,0.003537176,0.00138795,0.00004494841,0.00003362962,0.002760643,0.922402,0.05634752,0.006101175,0.002261682,0.001547806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5306779,0.0001984031,0.4477131,0.011809,0.0006830546,0.002388189,0.0000457412,0.0007429293,0.005741739],"genre_scores_gemma":[0.9875866,0.00004226898,0.009913494,0.001910264,0.0001469648,0.0001858752,0.000007361735,0.00004739405,0.0001597755],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7239773,"threshold_uncertainty_score":0.9997971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3094342878","doi":"10.1109/cog47356.2020.9231887","title":"Can Deep Learning Predict Problematic Gaming?","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Gambling Behavior and Treatments","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Focus (optics); Deep learning; Artificial intelligence; Balance (ability); Machine learning; Class (philosophy); Data science; Psychology","authors":[{"name":"Qirui Wu","is_ca":true},{"name":"Jacques Carette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1098606878868081,"gpt":0.347349941712742,"spread":0.2374892538259339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000108319,0.0003553374,0.0004301879,0.00007457337,0.0001228744,0.0001056447,0.0003500829,0.0001737011,0.003153787],"category_scores_gemma":[0.00008673672,0.0003236449,0.0001322208,0.0002774666,0.00009110946,0.0000638667,0.00004416971,0.0005647324,0.002087173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003767747,"about_ca_system_score_gemma":0.00007156377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008537855,"about_ca_topic_score_gemma":0.00003087919,"domain_scores_codex":[0.9978276,0.0002000401,0.0003910587,0.000715925,0.0003332251,0.0005320992],"domain_scores_gemma":[0.998902,0.0000900821,0.0001867416,0.0003848097,0.00009278748,0.000343549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.001534589,0.003629131,0.4377719,0.0009744558,0.002869229,0.003680367,0.1254458,0.00119442,0.02005322,0.01771416,0.02495647,0.3601762],"study_design_scores_gemma":[0.02615745,0.02038586,0.8504474,0.002123864,0.00451891,0.0003348195,0.01955295,0.03627252,0.006591003,0.007137759,0.02023752,0.006240006],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9349267,0.0002220879,0.0009938986,0.006149875,0.001360661,0.001539616,0.00005439109,0.0008616861,0.05389102],"genre_scores_gemma":[0.9953724,0.00002292957,0.0002018989,0.000640828,0.0001749407,0.0002490146,0.00004350785,0.00005931942,0.003235183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4126754,"threshold_uncertainty_score":0.9999216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3094375143","doi":"10.1109/cog47356.2020.9231854","title":"Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Monte Carlo tree search; Computer science; Iterated function; Prisoner's dilemma; Game tree; Tree (set theory); Dilemma; Game theory; Monte Carlo method; Fictitious play; Adversary; Variety (cybernetics); Mathematical optimization; Artificial intelligence; Mathematical economics; Sequential game; Mathematics; Computer security","authors":[{"name":"Garrison W. Greenwood","is_ca":false},{"name":"Daniel Ashlock","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.085846143607329,"gpt":0.3095868613929219,"spread":0.2237407177855929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003443696,0.0005643386,0.0006595397,0.0002352767,0.0001236689,0.001292699,0.002261016,0.000249731,0.00034853],"category_scores_gemma":[0.0001955841,0.0005195034,0.0001648759,0.001328927,0.0002667255,0.001383262,0.0003500161,0.0009057678,0.001071217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008319693,"about_ca_system_score_gemma":0.0005800416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004601532,"about_ca_topic_score_gemma":0.000529426,"domain_scores_codex":[0.9956035,0.0003602995,0.0008229045,0.001391153,0.0008505299,0.0009716375],"domain_scores_gemma":[0.9977579,0.0002779675,0.0001859737,0.0009329687,0.0004076133,0.0004376387],"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.001071303,0.001316166,0.01117117,0.0004173816,0.0004795943,0.002930452,0.09731022,0.1161145,0.08684272,0.18503,0.03631236,0.4610041],"study_design_scores_gemma":[0.0005475371,0.0009538314,0.004638643,0.0002633988,0.00002456256,0.00001416279,0.003127144,0.952181,0.02937185,0.002213998,0.00549901,0.001164867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8940722,0.0003994049,0.06442752,0.02151647,0.001213106,0.001594832,0.00004717196,0.00100391,0.01572534],"genre_scores_gemma":[0.9949941,0.0001240947,0.002573204,0.001198181,0.0002494971,0.0001108217,0.000004244874,0.00004402646,0.0007018428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8360665,"threshold_uncertainty_score":0.9997441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}