{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219505,0.001121162,0.0009416371,0.00167241,0.0006468558,0.001723536,0.00161093,0.001382418,0.003981674],"category_scores_gemma":[0.01283435,0.000501911,0.0007340551,0.001207793,0.001674474,0.002049156,0.001247809,0.00175481,0.0008686495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002249963,"about_ca_system_score_gemma":0.00207141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003558763,"about_ca_topic_score_gemma":0.003984325,"domain_scores_codex":[0.9990748,0.0003484018,0.00006445966,0.0001365252,0.0002857481,0.00009008035],"domain_scores_gemma":[0.9968696,0.001953959,0.0002415775,0.0003021033,0.000537033,0.00009567418],"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.0000849264,0.0001062454,0.001035744,0.0001847922,0.00003932884,0.00008958286,0.000262955,0.7193109,0.001996763,0.1304968,0.002306755,0.1440851],"study_design_scores_gemma":[0.00002331092,0.000048389,0.00008536089,0.00004224175,0.00001483268,0.00002913821,0.0000402845,0.9548979,0.001170547,0.04068257,0.002951865,0.00001351422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009415298,0.0002079689,0.9862619,0.00009989158,0.00002894073,0.0001080758,0.00005120368,0.0004749617,0.003351794],"genre_scores_gemma":[0.2491134,0.0003540659,0.74763,0.0001227544,0.00002473006,0.0004919073,0.0002489285,0.0002012922,0.00181297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003981674,"threshold_uncertainty_score":0.01632464,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126319,0.001508745,0.001223849,0.001665778,0.0006550037,0.00124099,0.001601704,0.001305119,0.001903464],"category_scores_gemma":[0.006969176,0.0007231386,0.000932843,0.0007803444,0.001454021,0.001481293,0.001696544,0.0009323526,0.0003810686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050681,"about_ca_system_score_gemma":0.001172246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007598973,"about_ca_topic_score_gemma":0.008877063,"domain_scores_codex":[0.9990699,0.0003184316,0.00004748177,0.0001294818,0.0003073559,0.0001272789],"domain_scores_gemma":[0.9973791,0.001829977,0.0001696599,0.000192411,0.0002678107,0.0001610989],"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.0001179878,0.0001142554,0.00115849,0.0001027088,0.00008139523,0.0001850245,0.0001766086,0.9206145,0.002663368,0.01145682,0.0006352948,0.06269365],"study_design_scores_gemma":[0.00001445819,0.00003349761,0.0000698031,0.000003759453,0.00001312346,0.00001463687,0.00001327399,0.9947797,0.000685856,0.003986893,0.0003782693,0.000006684492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07209203,0.0003628987,0.915648,0.0002432521,0.00007507044,0.0002414597,0.00005184256,0.001751584,0.009533797],"genre_scores_gemma":[0.784465,0.000210989,0.2125556,0.0001268976,0.00004954073,0.0002651555,0.00009555593,0.0001863377,0.002044913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007598973,"threshold_uncertainty_score":0.01510948,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380827,0.001233638,0.0006759127,0.001133819,0.0002959444,0.001918515,0.0009570696,0.001519191,0.002171278],"category_scores_gemma":[0.007013422,0.0002949318,0.0003952954,0.0007347475,0.0005646397,0.002631504,0.0008578271,0.002882213,0.001014543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006885949,"about_ca_system_score_gemma":0.0007013492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00569797,"about_ca_topic_score_gemma":0.007536537,"domain_scores_codex":[0.999564,0.0001575185,0.0000172307,0.00009523517,0.0000670634,0.00009888696],"domain_scores_gemma":[0.9986425,0.000633871,0.0001689706,0.0001126788,0.0002220308,0.0002200277],"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.0005788518,0.001457849,0.2036202,0.0004755077,0.0006173494,0.0002174779,0.0003561314,0.09034291,0.002887627,0.01540011,0.04751052,0.6365355],"study_design_scores_gemma":[0.00004200134,0.0001826912,0.0222038,0.0003287496,0.0001211337,0.0001243763,0.0003269836,0.8675039,0.001155577,0.1012021,0.006757276,0.00005147746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.618232,0.02198502,0.266917,0.06416482,0.001518113,0.0002149047,0.004595216,0.00204946,0.02032342],"genre_scores_gemma":[0.9701089,0.002546707,0.02160835,0.0016788,0.0002421397,0.00005609121,0.00146963,0.00005837371,0.002231071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00569797,"threshold_uncertainty_score":0.01132959,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002791074,0.0005779226,0.0008859328,0.0008245222,0.0005364126,0.001164098,0.0009770739,0.001302431,0.001438431],"category_scores_gemma":[0.01009263,0.0003299731,0.0005023171,0.0006511605,0.0009971458,0.001388857,0.0007049278,0.0005925724,0.0001831979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009972488,"about_ca_system_score_gemma":0.001125852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004118555,"about_ca_topic_score_gemma":0.003255931,"domain_scores_codex":[0.9977914,0.001583054,0.00006270752,0.0001180989,0.0003010245,0.0001436696],"domain_scores_gemma":[0.9930247,0.005959861,0.000380174,0.0001446541,0.0002931326,0.0001974101],"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.0001470024,0.00006620436,0.001229852,0.00004864134,0.00004426299,0.00005616291,0.00008886182,0.962873,0.0003769016,0.02667251,0.0002142576,0.008182311],"study_design_scores_gemma":[0.00001642371,0.0000661805,0.0001091731,0.000006374189,0.000005663614,0.0000170602,0.00001225684,0.9929254,0.0001070653,0.006521778,0.000206836,0.000005786958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4311344,0.001341501,0.551569,0.0003517367,0.00007795568,0.0002570881,0.00008832407,0.0002615883,0.0149185],"genre_scores_gemma":[0.9424213,0.0002619915,0.0557393,0.00007076492,0.00001212005,0.0001666465,0.00005209529,0.00002759771,0.001248164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004118555,"threshold_uncertainty_score":0.01476079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}