{"meta":{"query_hash":"a17b10194b3b","filters":{"venue":"2019 IEEE Conference on Games (CoG)"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"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/a17b10194b3b","api":"https://metacan.xera.ac/api/v1/cohort?venue=2019+IEEE+Conference+on+Games+%28CoG%29"},"results":[{"id":"W2946581269","doi":"10.1109/cig.2019.8848029","title":"Policy Based Inference in Trick-Taking Card Games","year":2019,"lang":"en","type":"preprint","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Computer science; Sequence (biology); Set (abstract data type); State (computer science); Action (physics); Artificial intelligence; Feature (linguistics); German; Approximate inference; Theoretical computer science; Machine learning; Algorithm; Programming language","score_opus":0.08961568525558564,"score_gpt":0.35239628772256115,"score_spread":0.26278060246697554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946581269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07675391,0.001182225,0.8244406,0.0091899745,0.012791198,0.0056635253,0.00026571148,0.0017313045,0.06798153],"genre_scores_gemma":[0.9883917,0.00043858166,0.006254234,0.0013746063,0.0005213748,0.0003124349,0.00003442643,0.00009482522,0.0025778413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920967,0.0006200213,0.0015354828,0.0027526522,0.0013889051,0.0016062391],"domain_scores_gemma":[0.99175,0.0014681477,0.0015070521,0.004197537,0.0006926375,0.00038464073],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010342235,0.0012939466,0.0016257816,0.0020341256,0.00012754828,0.0013624589,0.0063378527,0.0011140665,0.0001903431],"category_scores_gemma":[0.0017776204,0.0012858881,0.0005166184,0.0012896424,0.00038706692,0.0006673478,0.0017511344,0.0026010103,0.0021833312],"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.00024641308,0.0009777781,0.012462603,0.00081348076,0.00026725465,0.00027308022,0.0072055967,0.25705796,0.002116888,0.18982363,0.0051709535,0.52358437],"study_design_scores_gemma":[0.00073248486,0.0005498583,0.007782748,0.0033891737,0.00006944614,0.0000071257737,0.00023362374,0.91882914,0.013675304,0.04871846,0.0029673683,0.0030452819],"about_ca_topic_score_codex":0.003221661,"about_ca_topic_score_gemma":0.0004881579,"teacher_disagreement_score":0.9116378,"about_ca_system_score_codex":0.00052238605,"about_ca_system_score_gemma":0.004574049,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2946807670","doi":"10.1109/cig.2019.8848125","title":"Learning Policies from Human Data for Skat","year":2019,"lang":"en","type":"preprint","venue":"2019 IEEE Conference on Games (CoG)","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Counterfactual thinking; Reinforcement learning; Perfect information; Bidding; Regret; Construct (python library); Counterfactual conditional; Artificial intelligence; State (computer science); Imitation; Value (mathematics); Action (physics); Bridge (graph theory); Task (project management); Data science; Machine learning; Microeconomics; Economics","score_opus":0.17336762946699313,"score_gpt":0.314959953163113,"score_spread":0.14159232369611985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946807670","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.8228692,0.0056881825,0.015531931,0.0027587842,0.011006076,0.0033656766,0.032054555,0.00034917874,0.10637644],"genre_scores_gemma":[0.96474046,0.0016974137,0.00029497128,0.00039873875,0.00093818107,0.00006763153,0.004191417,0.00009083397,0.027580358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968817,0.00001527254,0.0009709333,0.0014717635,0.00010091028,0.00055938476],"domain_scores_gemma":[0.9959399,0.00010666022,0.0011769824,0.0025291392,0.00011977136,0.00012752187],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005914683,0.00051371864,0.0011449534,0.0003395716,0.00017431793,0.0005202747,0.0018277637,0.00049412623,0.0014835055],"category_scores_gemma":[0.000089726884,0.0005654345,0.00024722834,0.00008513073,0.00010423234,0.00022084867,0.0007245648,0.0009220922,0.001620968],"study_design_candidate":"not_applicable","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.0003149114,0.00080075784,0.17908774,0.0014236808,0.0026707335,0.000016059063,0.004876401,0.04688935,0.00028024652,0.46834606,0.27412394,0.021170128],"study_design_scores_gemma":[0.0014010039,0.00046284226,0.042766094,0.0007077313,0.00016334647,0.0000010540449,0.00025092496,0.3430129,0.00010340482,0.059420355,0.54954296,0.0021673916],"about_ca_topic_score_codex":0.0037780209,"about_ca_topic_score_gemma":0.00022626655,"teacher_disagreement_score":0.4089257,"about_ca_system_score_codex":0.00007601805,"about_ca_system_score_gemma":0.0001395648,"threshold_uncertainty_score":0.9996797},"labels":[],"label_agreement":null},{"id":"W2948811720","doi":"10.1109/cig.2019.8847990","title":"The Riddle of Togelby","year":2019,"lang":"en","type":"preprint","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"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":"Simple (philosophy); Representation (politics); Space (punctuation); Computer science; Combinatorial game theory; Theoretical computer science; Artificial intelligence; Sequential game; Mathematics; Epistemology; Mathematical economics; Game theory; Political science; Politics; Philosophy","score_opus":0.07207285091656218,"score_gpt":0.30925238682364603,"score_spread":0.23717953590708385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948811720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08880889,0.0048150937,0.68834424,0.0125301285,0.04150959,0.0062567242,0.00031977444,0.0011879225,0.15622765],"genre_scores_gemma":[0.9837954,0.00090855407,0.0027110812,0.00028979967,0.00028199967,0.00011209981,0.000009162547,0.00004453028,0.011847381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996066,0.00025777757,0.00090257,0.0011753016,0.00089927064,0.000699127],"domain_scores_gemma":[0.99381304,0.00077956566,0.00085117825,0.003733899,0.0006695887,0.00015274908],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077905407,0.00056768814,0.000724192,0.00018879925,0.00015802191,0.0006183764,0.005901273,0.00047075137,0.000105123334],"category_scores_gemma":[0.00023968198,0.00041879414,0.00035776393,0.00024684877,0.00047473345,0.00024249617,0.0016579442,0.001132882,0.0020727182],"study_design_candidate":"theoretical_or_conceptual","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.0001431193,0.0004046523,0.00073478336,0.00031527693,0.00043856064,0.000024952797,0.004609692,0.015440708,0.0036102307,0.52995914,0.05500935,0.38930956],"study_design_scores_gemma":[0.0004451565,0.0011963367,0.0018712839,0.0023782074,0.00017084101,0.000017826416,0.0007468566,0.5458446,0.14698958,0.23714459,0.06026566,0.0029290454],"about_ca_topic_score_codex":0.0002933919,"about_ca_topic_score_gemma":0.00008940794,"teacher_disagreement_score":0.8949865,"about_ca_system_score_codex":0.00007525927,"about_ca_system_score_gemma":0.0008735377,"threshold_uncertainty_score":0.9998264},"labels":[],"label_agreement":null},{"id":"W2975017304","doi":"10.1109/cig.2019.8848040","title":"Using Simple Games to Evaluate Self-Organization Concepts: a Whack-a-mole Case Study","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Reinforcement Learning in Robotics","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 Calgary","funders":"","keywords":"Generality; Simple (philosophy); Hammer; Computer science; Task (project management); Industrial engineering; Engineering; Psychology; Epistemology; Mechanical engineering; Systems engineering","score_opus":0.05754343499664861,"score_gpt":0.34501022742724996,"score_spread":0.28746679243060136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975017304","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.652534,0.000013421168,0.34354028,0.000117339674,0.0008607777,0.0015366472,0.0000033887297,0.00036216518,0.0010319417],"genre_scores_gemma":[0.9876723,0.000008872031,0.009941289,0.0006446501,0.00009072677,0.000024082783,0.0000072202415,0.000051585655,0.0015592156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966779,0.00032223755,0.0005470947,0.0009581199,0.00085945573,0.0006352377],"domain_scores_gemma":[0.996981,0.00016390269,0.00032247088,0.001501952,0.00078001514,0.00025060878],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005868504,0.00042198395,0.00046552773,0.0002717427,0.00019700991,0.00074068725,0.0011832168,0.00012884251,0.00030751692],"category_scores_gemma":[0.00015621322,0.0004079929,0.00007128681,0.0008742132,0.000044246077,0.00077154476,0.00041176134,0.00032020392,0.0022685318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00002874595,0.000510561,0.025184335,0.00006988024,0.00027469473,0.00044736062,0.02455481,0.9279928,0.007063492,0.0039280006,0.002324803,0.007620511],"study_design_scores_gemma":[0.0017617544,0.0017008688,0.0016740591,0.00012906513,0.00010723722,0.00022751192,0.0033805396,0.986476,0.0026635798,0.00010440494,0.0008705686,0.0009043863],"about_ca_topic_score_codex":0.00021001342,"about_ca_topic_score_gemma":0.00001886191,"teacher_disagreement_score":0.33513832,"about_ca_system_score_codex":0.00016481137,"about_ca_system_score_gemma":0.00040105244,"threshold_uncertainty_score":0.9998372},"labels":[],"label_agreement":null},{"id":"W2975132448","doi":"10.1109/cig.2019.8848065","title":"Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Multi-Agent Systems and Negotiation","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":"Simon Fraser University","funders":"","keywords":"Computer science; Answer set programming; Graph; Theoretical computer science; Key (lock); Logic programming; Operating system","score_opus":0.10817532799863167,"score_gpt":0.294793417072607,"score_spread":0.1866180890739753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975132448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1307786,0.000063682535,0.8626809,0.0014807018,0.0022710194,0.0017533966,0.000027817136,0.00018457131,0.0007592811],"genre_scores_gemma":[0.9826712,0.000016290538,0.014665469,0.00082332204,0.0002593086,0.00025231377,0.000038393046,0.000015691032,0.0012580341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825233,0.00007405038,0.0003988939,0.00058850617,0.00031154777,0.00037469517],"domain_scores_gemma":[0.9986322,0.0001299948,0.00029572606,0.0004976989,0.00032887587,0.00011548547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839356,0.00023162045,0.0002886195,0.00012219358,0.00013843573,0.00034767285,0.00040899107,0.00015857175,0.00009858082],"category_scores_gemma":[0.000090274865,0.00020545891,0.00012288171,0.00017152273,0.000036712623,0.0004945124,0.000029967157,0.00015934362,0.0003023136],"study_design_candidate":"theoretical_or_conceptual","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.00004782112,0.00013972877,0.0013602617,0.0001158086,0.000079503516,0.000002149505,0.0012850149,0.00057328504,0.06308617,0.91766214,0.005962618,0.009685512],"study_design_scores_gemma":[0.0032285792,0.0012226532,0.006742813,0.0009738432,0.00005610433,0.000019301722,0.00035625166,0.9275465,0.03890425,0.017033964,0.0027245714,0.0011911696],"about_ca_topic_score_codex":0.000035223315,"about_ca_topic_score_gemma":0.000022470242,"teacher_disagreement_score":0.9269732,"about_ca_system_score_codex":0.000037343725,"about_ca_system_score_gemma":0.0001549379,"threshold_uncertainty_score":0.8378371},"labels":[],"label_agreement":null},{"id":"W2975392813","doi":"10.1109/cig.2019.8848033","title":"Mining Player In-game Time Spending Regularity for Churn Prediction in Free Online Games","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Customer churn and segmentation","field":"Business, Management and Accounting","cited_by":17,"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 Toronto","funders":"","keywords":"Computer science","score_opus":0.03699918568312889,"score_gpt":0.2615649434211816,"score_spread":0.2245657577380527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975392813","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.9867133,0.000074612326,0.00023819385,0.000919255,0.0011634763,0.0010161862,0.000050808314,0.0000992262,0.0097249625],"genre_scores_gemma":[0.9878367,0.000024770681,0.00030907133,0.00057336484,0.00064937375,0.000052699797,0.00028164007,0.000039879145,0.010232497],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998312,0.000021663378,0.00044368312,0.00050052936,0.00029206063,0.00043007467],"domain_scores_gemma":[0.99917465,0.000087443674,0.00024482328,0.00037195854,0.0000998647,0.000021234824],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043495322,0.00025580515,0.00035777144,0.00059730717,0.000040487772,0.00023712362,0.00031499253,0.0001629132,0.0009615221],"category_scores_gemma":[0.000101583464,0.0002617713,0.00008576882,0.00034794788,0.00003839645,0.001163256,0.00007913825,0.00023303599,0.0007229157],"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.0029403365,0.0026488178,0.54844344,0.002141768,0.00028135758,0.0000683768,0.0032698517,0.004264793,0.10190597,0.027196512,0.11289439,0.19394438],"study_design_scores_gemma":[0.013630721,0.00030470555,0.48409843,0.0024452445,0.00017747951,0.0000073956794,0.002444799,0.4508136,0.0018601237,0.009253287,0.0333533,0.0016109087],"about_ca_topic_score_codex":0.0003151498,"about_ca_topic_score_gemma":0.0005667325,"teacher_disagreement_score":0.44654882,"about_ca_system_score_codex":0.00008565131,"about_ca_system_score_gemma":0.0000395684,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W2975442767","doi":"10.1109/cig.2019.8848095","title":"Deep Variational Autoencoders for NPC Behaviour Classification","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"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":"Artificial intelligence; Computer science; Deep learning; Set (abstract data type); Machine learning; Unsupervised learning; Video game; Training set; Pattern recognition (psychology); Multimedia","score_opus":0.06522760177606564,"score_gpt":0.31019196062656246,"score_spread":0.24496435885049683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975442767","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.0107287755,0.000034588273,0.97660035,0.0025525803,0.002396688,0.0010921429,0.000020508332,0.00027577562,0.00629857],"genre_scores_gemma":[0.9534482,0.000020844698,0.04087021,0.000576891,0.0001724359,0.00020642555,0.000029665873,0.00002828459,0.0046470542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752593,0.00008719723,0.0004830928,0.0008626922,0.0005273254,0.0005137345],"domain_scores_gemma":[0.9977087,0.00035442624,0.0002967856,0.0009991813,0.00049156486,0.00014936719],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040867517,0.00029026205,0.00029208683,0.00020080265,0.00013718051,0.00036403522,0.0014265679,0.00020295303,0.00034081453],"category_scores_gemma":[0.00011642203,0.00028229938,0.00015221667,0.00026546183,0.000100019795,0.0007144598,0.00008640809,0.00024070445,0.0025255093],"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.0000658727,0.00027647946,0.003377888,0.000029388937,0.000057834415,0.0000025415952,0.0017885882,0.008404551,0.005760031,0.91182715,0.0065461476,0.061863538],"study_design_scores_gemma":[0.00023109344,0.00030656395,0.009671157,0.000047088146,0.00002185046,0.0000035942953,0.00017803363,0.96180516,0.003086993,0.022134578,0.0020997967,0.00041410548],"about_ca_topic_score_codex":0.00005371834,"about_ca_topic_score_gemma":0.000038711674,"teacher_disagreement_score":0.9534006,"about_ca_system_score_codex":0.00009906286,"about_ca_system_score_gemma":0.00033207797,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W2976200185","doi":"10.1109/cig.2019.8848114","title":"Learning to Select Mates in Evolving Non-playable Characters","year":2019,"lang":"en","type":"article","venue":"2019 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":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.02209196078967483,"score_gpt":0.2720301828173503,"score_spread":0.2499382220276755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976200185","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.9679802,0.00004471899,0.016511265,0.0011503844,0.0014467763,0.00086605275,0.0000027122287,0.00028633536,0.011711564],"genre_scores_gemma":[0.98923904,0.0000334517,0.0027752568,0.00059634366,0.00008020878,0.00005831522,0.00000307608,0.000031717304,0.007182622],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971724,0.0001266546,0.00047243302,0.00092214433,0.00045926074,0.00084711215],"domain_scores_gemma":[0.9983125,0.0002859567,0.0001789342,0.0007973972,0.00022594167,0.00019926963],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005423362,0.00034952958,0.00044109783,0.00044208468,0.00009514128,0.0005370863,0.001529102,0.00015124232,0.0003687896],"category_scores_gemma":[0.00017090885,0.0003437696,0.00008576797,0.0007152049,0.000049896353,0.0008935067,0.00022781052,0.00057039905,0.0099768955],"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.00030956563,0.0006947782,0.1322321,0.00025222902,0.00017372175,0.00016767895,0.04022025,0.04797711,0.44556051,0.04382645,0.011900407,0.2766852],"study_design_scores_gemma":[0.00048813093,0.0016779354,0.04358766,0.0011815702,0.00001638601,0.000017192095,0.0013187866,0.76827735,0.17458831,0.0031270788,0.003951421,0.0017681855],"about_ca_topic_score_codex":0.00034220744,"about_ca_topic_score_gemma":0.000083543164,"teacher_disagreement_score":0.72030026,"about_ca_system_score_codex":0.00011931004,"about_ca_system_score_gemma":0.00021203235,"threshold_uncertainty_score":0.9999014},"labels":[],"label_agreement":null},{"id":"W2976261784","doi":"10.1109/cig.2019.8848093","title":"Towards Procedurally Generated Languages for Non-playable Characters in Video Games","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Computer science; Neuroevolution; Communication source; Architecture; Video game; Illusion; Atmosphere (unit); Artificial intelligence; Artificial neural network; Multimedia; Human–computer interaction; Computer network","score_opus":0.03239987219828947,"score_gpt":0.2993356794207047,"score_spread":0.2669358072224152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976261784","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.9286265,0.00022866644,0.05122644,0.0038050287,0.002489313,0.0031638914,0.000053539483,0.00046398613,0.00994265],"genre_scores_gemma":[0.98540896,0.000096237054,0.005565369,0.0012700261,0.00017111012,0.00029622397,0.000021525135,0.000043768672,0.007126776],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969457,0.00008218446,0.00059978856,0.0010553825,0.0004549862,0.0008619536],"domain_scores_gemma":[0.99796647,0.00020988556,0.00026985566,0.0009907933,0.0003874152,0.00017555927],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472485,0.0004449832,0.0005622029,0.00035135416,0.000076882905,0.0004651096,0.0017169972,0.0002324696,0.00017534886],"category_scores_gemma":[0.00016306237,0.00040068527,0.0001469098,0.00049828994,0.00010311286,0.00092010456,0.00015033317,0.00034210875,0.0014155274],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00073324493,0.0010936239,0.008825316,0.0006266813,0.00029248054,0.00012169492,0.015101645,0.0057117185,0.42642692,0.11574806,0.039179306,0.3861393],"study_design_scores_gemma":[0.0015559702,0.0016491723,0.01403752,0.00096218364,0.000041384334,0.00002505775,0.0012240049,0.461384,0.5021154,0.006935851,0.007879224,0.0021902206],"about_ca_topic_score_codex":0.00027303424,"about_ca_topic_score_gemma":0.00016465432,"teacher_disagreement_score":0.4556723,"about_ca_system_score_codex":0.00010208913,"about_ca_system_score_gemma":0.000540432,"threshold_uncertainty_score":0.9998445},"labels":[],"label_agreement":null},{"id":"W2976512954","doi":"10.1109/cig.2019.8847957","title":"Using Active Probing by a Game Management AI to Faster Classify Players","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Digital Games and Media","field":"Social Sciences","cited_by":3,"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 Calgary","funders":"","keywords":"Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.05108697250690437,"score_gpt":0.3285383312108906,"score_spread":0.27745135870398624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976512954","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3485647,0.000030427314,0.0009878253,0.001875436,0.001591008,0.0019009076,0.000055510158,0.00012501443,0.64486915],"genre_scores_gemma":[0.85070413,0.00004386971,0.00020171067,0.0020616811,0.00012525464,0.00004922681,0.0000075501684,0.000028300676,0.14677826],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977981,0.0000829763,0.0002377695,0.00057054183,0.0006026808,0.00070792675],"domain_scores_gemma":[0.9990167,0.00005740393,0.0001250433,0.00033741005,0.00012581811,0.00033762303],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002300114,0.00025667337,0.0003077398,0.00014793483,0.00007030686,0.00034540417,0.00045365296,0.00014595556,0.00053314416],"category_scores_gemma":[0.000028862103,0.00023936816,0.000100749654,0.00026390457,0.00014278371,0.00048665598,0.00008955886,0.00023577643,0.0016805875],"study_design_candidate":"not_applicable","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.00053450355,0.000482143,0.0009863937,0.00015013336,0.0003786463,0.000038136473,0.050966207,0.00043948603,0.017167803,0.07673389,0.04445488,0.8076678],"study_design_scores_gemma":[0.0013794972,0.0004311271,0.00078325573,0.00071941025,0.00008262672,0.000001398435,0.017244998,0.0011567087,0.0023690814,0.0005902945,0.97430146,0.0009401244],"about_ca_topic_score_codex":0.00017870798,"about_ca_topic_score_gemma":0.00013598487,"teacher_disagreement_score":0.9298466,"about_ca_system_score_codex":0.00018391633,"about_ca_system_score_gemma":0.00019329487,"threshold_uncertainty_score":0.9990967},"labels":[],"label_agreement":null},{"id":"W2976677836","doi":"10.1109/cig.2019.8847947","title":"Automatic Generation of Diverse Cavern Maps with Morphing Cellular Automata","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"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":"Cellular automaton; Computer science; Automaton; Morphing; Mobile automaton; Function (biology); Theoretical computer science; Fitness function; Stochastic cellular automaton; Automata theory; Algorithm; Artificial intelligence; Machine learning; Genetic algorithm","score_opus":0.03616004166228312,"score_gpt":0.23779619693657664,"score_spread":0.20163615527429352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976677836","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.8011765,0.0000558196,0.1917013,0.0005175882,0.00044928765,0.0008693371,0.000044757086,0.0004089786,0.004776424],"genre_scores_gemma":[0.9886473,0.00001556806,0.009193637,0.00012170625,0.000051261366,0.000039028397,0.00005275668,0.00001973351,0.0018590476],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982072,0.00006820742,0.0003343685,0.00057694566,0.0004998971,0.00031336886],"domain_scores_gemma":[0.99801123,0.000058269183,0.00028278973,0.0013799552,0.00015776342,0.00011000127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019919235,0.00024850864,0.00031808496,0.00015361652,0.00009296757,0.00018761674,0.00101592,0.00009525604,0.00021232832],"category_scores_gemma":[0.000009243232,0.00021141731,0.00007810572,0.00031545953,0.00007514481,0.000493514,0.00014515097,0.00016321719,0.0011484483],"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.000022894656,0.00058390293,0.0012434598,0.00027386151,0.00018879077,0.000042317988,0.0029356948,0.00268421,0.69190955,0.19773518,0.009793598,0.092586555],"study_design_scores_gemma":[0.0007661724,0.00025792522,0.0012577748,0.00014965846,0.00004280703,0.000012029075,0.00009035688,0.93684983,0.058480244,0.00062174664,0.0010748958,0.00039657505],"about_ca_topic_score_codex":0.00013930652,"about_ca_topic_score_gemma":0.000019565558,"teacher_disagreement_score":0.9341656,"about_ca_system_score_codex":0.00003849333,"about_ca_system_score_gemma":0.00018100545,"threshold_uncertainty_score":0.99962926},"labels":[],"label_agreement":null},{"id":"W2977147391","doi":"10.1109/cig.2019.8847951","title":"Music Matters: An empirical study on the effects of adaptive music on experienced and perceived player affect","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Media Influence and Health","field":"Arts and Humanities","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Feeling; Affect (linguistics); Music and emotion; Value (mathematics); Psychology; Empirical research; Music psychology; Cognitive psychology; Computer science; Multimedia; Social psychology; Communication; Music; Mathematics; Music education; Machine learning; Statistics; Pedagogy","score_opus":0.10901141873984949,"score_gpt":0.32057629757851913,"score_spread":0.21156487883866965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977147391","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.98950577,0.000021095793,0.0000018325973,0.0005297346,0.00096003525,0.0020383128,0.000021200043,0.000044462657,0.006877555],"genre_scores_gemma":[0.9922881,0.000015938973,0.0000041016524,0.0061968057,0.00024593514,0.00018864202,0.0000036645733,0.000026311794,0.0010305068],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99801373,0.00034910717,0.0002807117,0.0005342856,0.00044184053,0.00038031366],"domain_scores_gemma":[0.998138,0.0008373333,0.00016904231,0.00059996435,0.00011008997,0.00014553896],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026109905,0.00032538164,0.0004716341,0.00014176262,0.0001978527,0.00013841083,0.00032254786,0.00008144348,0.0021125127],"category_scores_gemma":[0.000053144468,0.00019910258,0.0000726724,0.00004507557,0.0003369132,0.00020779994,0.00003427981,0.00036735597,0.0006380164],"study_design_candidate":"qualitative","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.0014542642,0.0021724403,0.006698501,0.000302255,0.00021080997,0.00003607073,0.9133863,0.000015754318,0.01014512,0.039908648,0.019223746,0.0064461054],"study_design_scores_gemma":[0.008253832,0.0857288,0.53885037,0.0034686956,0.00032599267,0.000006191807,0.34550214,0.0018981447,0.0044719107,0.0016204742,0.0076483563,0.0022251087],"about_ca_topic_score_codex":0.0002152914,"about_ca_topic_score_gemma":0.00042343643,"teacher_disagreement_score":0.56788415,"about_ca_system_score_codex":0.000028605165,"about_ca_system_score_gemma":0.00009382914,"threshold_uncertainty_score":0.9987997},"labels":[],"label_agreement":null},{"id":"W4255592375","doi":"10.1109/cig.2019.8848025","title":"CoG 2019 Program Committee","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Mobile Health and mHealth Applications","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southern University of Science and Technology; University of Tsukuba; Ritsumeikan University; Pontificia Universidade Católica do Paraná; University of Crete; Sejong University; Universität Duisburg-Essen; Queensland University of Technology; University of Melbourne; RMIT University; Army Research Laboratory; University of Tokyo; University of Nevada, Reno; National University of Singapore; École Polytechnique Fédérale de Lausanne; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Georgia Institute of Technology; Kanazawa University; Australian National University; Kindai University; Florida State University; University of Colorado Boulder; Turun Yliopisto; Fordham University; Masarykova Univerzita; University of Ontario Institute of Technology; University of Aizu; Queen Mary University of London; Università ta' Malta; National Chengchi University; Technische Universität Kaiserslautern; Technische Universiteit Eindhoven; Universiteit Leiden; Drexel University; North Carolina State University; Universidade de Lisboa; University of California, Santa Cruz; University of Southern California","keywords":"Computer science","score_opus":0.06797754503613865,"score_gpt":0.43183088688745164,"score_spread":0.363853341851313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255592375","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28581864,0.0022361313,0.001022508,0.037330445,0.013917054,0.06382089,0.0010575638,0.0029978836,0.5917989],"genre_scores_gemma":[0.83844644,0.0019395138,0.0014789746,0.015686834,0.0010253647,0.019645222,0.000417228,0.00015480007,0.12120561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99510163,0.0005617651,0.001156467,0.0009271013,0.0005490811,0.0017039274],"domain_scores_gemma":[0.995465,0.0007388587,0.00064471166,0.0016857174,0.0005618472,0.000903871],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009095115,0.00047075548,0.00077266,0.00022469046,0.00069202087,0.000044372617,0.0007543725,0.0006235669,0.005459675],"category_scores_gemma":[0.00011294174,0.00041745874,0.00014614896,0.00039524338,0.0001533715,0.0001808838,0.00012275865,0.0017489521,0.051391073],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0003002967,0.0006558771,0.018907964,0.0010270347,0.00005598685,0.0000034951095,0.0007617829,0.000011392304,0.00049518823,0.06436731,0.723789,0.18962467],"study_design_scores_gemma":[0.0023218938,0.00081020436,0.027405007,0.00060982106,0.000056361576,0.0000026306382,0.00051501294,0.0011226481,0.00005858636,0.0017722782,0.96481144,0.00051409064],"about_ca_topic_score_codex":0.00073874055,"about_ca_topic_score_gemma":0.00030360578,"teacher_disagreement_score":0.5526278,"about_ca_system_score_codex":0.00015784173,"about_ca_system_score_gemma":0.0019026875,"threshold_uncertainty_score":0.99982774},"labels":[],"label_agreement":null}]}