{"meta":{"query_hash":"2d4429f89592","filters":{"venue":"2020 IEEE Conference on Games (CoG)"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2d4429f89592","api":"https://metacan.xera.ac/api/v1/cohort?venue=2020+IEEE+Conference+on+Games+%28CoG%29"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07439078111553457,"score_gpt":0.31316774152662985,"score_spread":0.23877696041109528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093593979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53067786,0.0001984031,0.44771308,0.011808999,0.0006830546,0.002388189,0.000045741195,0.00074292935,0.005741739],"genre_scores_gemma":[0.9875866,0.000042268985,0.009913494,0.0019102641,0.0001469648,0.00018587524,0.0000073617352,0.00004739405,0.00015977546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960212,0.00019901888,0.00073036813,0.00134049,0.0007100721,0.00099882],"domain_scores_gemma":[0.9973446,0.00079526036,0.00024779545,0.0007800826,0.00043703383,0.00039520042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050980475,0.0004818232,0.000612567,0.00015311615,0.00019980814,0.00061352225,0.001998031,0.00016452117,0.000045986493],"category_scores_gemma":[0.0005139741,0.0004480851,0.00010913507,0.001033735,0.00031975395,0.00068781077,0.0003219743,0.00069749454,0.00024250202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001845699,0.0010730186,0.06298331,0.001562862,0.0003971138,0.0016673491,0.08919531,0.19842465,0.032379594,0.28219503,0.00847609,0.31979996],"study_design_scores_gemma":[0.0010963342,0.0024791455,0.0035371762,0.00138795,0.000044948414,0.000033629618,0.0027606434,0.92240196,0.056347523,0.006101175,0.0022616817,0.0015478062],"about_ca_topic_score_codex":0.00011159786,"about_ca_topic_score_gemma":0.00008463228,"teacher_disagreement_score":0.7239773,"about_ca_system_score_codex":0.000077431476,"about_ca_system_score_gemma":0.00045940606,"threshold_uncertainty_score":0.9997971},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13136062393839582,"score_gpt":0.32366120807018145,"score_spread":0.19230058413178563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093947831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00151626,0.000102675316,0.9882207,0.0042743986,0.0019890012,0.0007729955,0.00011580538,0.00049277075,0.002515412],"genre_scores_gemma":[0.9584839,0.000017355604,0.038016513,0.0017061657,0.00074609445,0.00015164532,0.000049556893,0.00004446178,0.000784348],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694496,0.00018969495,0.0004847468,0.0010564894,0.0005803914,0.00074373884],"domain_scores_gemma":[0.9978253,0.00047833426,0.00015258629,0.0006831264,0.00035730674,0.00050334795],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026088316,0.00037038405,0.00044269362,0.00012391548,0.00028797425,0.00051864993,0.0013577781,0.00012812593,0.0001400664],"category_scores_gemma":[0.000679327,0.0003778687,0.00017163114,0.00052667374,0.00011413137,0.0003303787,0.00022936426,0.00048835995,0.000878707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012909243,0.0021831666,0.0029006023,0.002070504,0.0017309663,0.003141707,0.027406454,0.05348403,0.021815589,0.0516913,0.48821464,0.3440701],"study_design_scores_gemma":[0.0011157792,0.00091526867,0.0012194164,0.00016464185,0.0000699499,0.000025562671,0.00015292379,0.9928009,0.00043821044,0.0006592986,0.001937994,0.0005000567],"about_ca_topic_score_codex":0.000019883812,"about_ca_topic_score_gemma":0.0000021027329,"teacher_disagreement_score":0.9569676,"about_ca_system_score_codex":0.000061329025,"about_ca_system_score_gemma":0.00039721324,"threshold_uncertainty_score":0.9998992},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1098606878868081,"score_gpt":0.347349941712742,"score_spread":0.23748925382593394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094342878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93492675,0.00022208793,0.0009938986,0.0061498745,0.001360661,0.0015396156,0.000054391086,0.00086168613,0.053891018],"genre_scores_gemma":[0.99537235,0.000022929571,0.00020189887,0.000640828,0.00017494065,0.00024901464,0.000043507847,0.000059319416,0.0032351834],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99782765,0.0002000401,0.00039105865,0.000715925,0.00033322512,0.00053209916],"domain_scores_gemma":[0.998902,0.000090082096,0.00018674157,0.00038480968,0.00009278748,0.000343549],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000108319044,0.00035533743,0.0004301879,0.00007457337,0.00012287442,0.00010564467,0.00035008293,0.0001737011,0.0031537865],"category_scores_gemma":[0.00008673672,0.00032364487,0.00013222083,0.00027746658,0.00009110946,0.0000638667,0.00004416971,0.0005647324,0.0020871728],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015345885,0.0036291312,0.43777195,0.0009744558,0.0028692286,0.0036803673,0.12544577,0.0011944202,0.020053215,0.017714156,0.024956467,0.36017624],"study_design_scores_gemma":[0.026157454,0.020385856,0.85044736,0.0021238644,0.0045189103,0.00033481952,0.019552952,0.036272522,0.006591003,0.007137759,0.02023752,0.006240006],"about_ca_topic_score_codex":0.00008537855,"about_ca_topic_score_gemma":0.000030879186,"teacher_disagreement_score":0.41267538,"about_ca_system_score_codex":0.000037677466,"about_ca_system_score_gemma":0.000071563765,"threshold_uncertainty_score":0.99992156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.085846143607329,"score_gpt":0.3095868613929219,"score_spread":0.2237407177855929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094375143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89407223,0.00039940487,0.06442752,0.021516474,0.0012131056,0.0015948319,0.000047171965,0.0010039099,0.015725335],"genre_scores_gemma":[0.9949941,0.00012409469,0.0025732042,0.0011981813,0.00024949713,0.00011082174,0.0000042448737,0.000044026463,0.0007018428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956035,0.0003602995,0.00082290446,0.0013911529,0.00085052993,0.0009716375],"domain_scores_gemma":[0.99775785,0.00027796754,0.00018597367,0.0009329687,0.00040761335,0.00043763866],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034436956,0.0005643386,0.00065953966,0.0002352767,0.0001236689,0.0012926986,0.0022610156,0.00024973098,0.00034852998],"category_scores_gemma":[0.00019558407,0.00051950343,0.00016487595,0.0013289273,0.00026672552,0.0013832618,0.00035001608,0.0009057678,0.0010712167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010713028,0.0013161663,0.011171174,0.00041738164,0.00047959428,0.0029304519,0.09731022,0.116114475,0.08684272,0.18503003,0.036312364,0.4610041],"study_design_scores_gemma":[0.0005475371,0.0009538314,0.0046386435,0.00026339878,0.000024562562,0.000014162793,0.0031271444,0.952181,0.029371846,0.0022139985,0.00549901,0.0011648674],"about_ca_topic_score_codex":0.00046015324,"about_ca_topic_score_gemma":0.00052942603,"teacher_disagreement_score":0.83606654,"about_ca_system_score_codex":0.00008319693,"about_ca_system_score_gemma":0.00058004155,"threshold_uncertainty_score":0.99974406},"labels":[],"label_agreement":null}]}