{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10692012,0.00023214339,0.8851336,0.0007838513,0.00004985547,0.00015135636,0.00029383117,0.0013077726,0.005127403],"genre_scores_gemma":[0.8517635,0.00013154466,0.14538282,0.00023241242,0.0000323378,0.00011685762,0.00029541232,0.00014102094,0.001904113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645776,0.0019008125,0.00020456962,0.0005531176,0.000534944,0.00034881296],"domain_scores_gemma":[0.9855078,0.012357564,0.00053303095,0.00084486516,0.0004107933,0.0003459541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047662887,0.0007239546,0.0016504577,0.0008311131,0.0009738698,0.001985615,0.002053686,0.0016595656,0.002758749],"category_scores_gemma":[0.026735358,0.00063928403,0.0007033384,0.00075432047,0.002222597,0.0035691576,0.002242548,0.0029229175,0.0004509769],"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.0008350388,0.00027627326,0.004875476,0.00022635596,0.00011306088,0.00024265001,0.0007103412,0.76405823,0.0019690965,0.14265648,0.0025150303,0.08152203],"study_design_scores_gemma":[0.00003920889,0.000025007732,0.00020960555,0.000010226261,0.000009280107,0.00001899437,0.000037584792,0.9413453,0.00080393907,0.05707865,0.0004105463,0.000011673424],"about_ca_topic_score_codex":0.009331248,"about_ca_topic_score_gemma":0.008411244,"teacher_disagreement_score":0.009331248,"about_ca_system_score_codex":0.0019885595,"about_ca_system_score_gemma":0.0034002652,"threshold_uncertainty_score":0.025206804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45668173,0.0026703351,0.51024693,0.0025240413,0.00032386667,0.0004748618,0.010018587,0.0072321584,0.009827501],"genre_scores_gemma":[0.9165347,0.00036477414,0.07244464,0.0002229575,0.000038149607,0.00014943286,0.0077184136,0.00017487873,0.0023521353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819213,0.000998941,0.000067336136,0.00045710953,0.00019280695,0.000091674134],"domain_scores_gemma":[0.9942052,0.0038693454,0.00037701827,0.0009974373,0.0003574059,0.00019359065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033288465,0.0009976256,0.0006775264,0.0012476019,0.00037818588,0.0012044235,0.0012809779,0.00168243,0.0038130737],"category_scores_gemma":[0.017863574,0.0005197661,0.0005707891,0.0008571449,0.0011710888,0.0016094843,0.0012526012,0.0017552242,0.0018640688],"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.00093812204,0.0007538116,0.04422106,0.0006560981,0.00033335842,0.00025052173,0.00045116147,0.7048993,0.0032814168,0.01035785,0.019118689,0.21473855],"study_design_scores_gemma":[0.000038996037,0.00012741538,0.0076925512,0.000077397795,0.00001900475,0.00007153914,0.00014077715,0.9643131,0.0021389117,0.020387214,0.004956592,0.00003646955],"about_ca_topic_score_codex":0.008968299,"about_ca_topic_score_gemma":0.01670179,"teacher_disagreement_score":0.008968299,"about_ca_system_score_codex":0.0012027399,"about_ca_system_score_gemma":0.0010161449,"threshold_uncertainty_score":0.01783216},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10754289,0.0056818286,0.25696182,0.06878436,0.0025847054,0.00013623408,0.00047414747,0.0022426276,0.55559134],"genre_scores_gemma":[0.8007986,0.0017560668,0.075026475,0.003918847,0.00015061366,0.00014622415,0.00029572338,0.0015226812,0.11638474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984635,0.00082055567,0.000040867188,0.0002344614,0.00026837998,0.00017230998],"domain_scores_gemma":[0.9986156,0.00066386984,0.000067214416,0.0002849961,0.00016833044,0.00019986265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126507,0.0007251826,0.00054279406,0.0006486638,0.0032279014,0.0058627455,0.0009817745,0.0020380935,0.018848432],"category_scores_gemma":[0.008849162,0.0004695222,0.00064976106,0.00046011945,0.007470908,0.008799547,0.004686235,0.0033672175,0.003919931],"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.000084635285,0.000016899105,0.0002372268,0.00008228888,0.000014045942,0.000093367606,0.0025748343,0.0021591014,0.00044796022,0.9409184,0.027981948,0.025389286],"study_design_scores_gemma":[0.000030733518,0.000049376566,0.00018110214,0.00016716783,0.000012837001,0.00041357634,0.00257215,0.007072631,0.0013495018,0.7099629,0.27814627,0.000041704247],"about_ca_topic_score_codex":0.0033548719,"about_ca_topic_score_gemma":0.0051689153,"teacher_disagreement_score":0.018848432,"about_ca_system_score_codex":0.0018618256,"about_ca_system_score_gemma":0.0011571744,"threshold_uncertainty_score":0.06305426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92316395,0.00030685763,0.061791684,0.00044052667,0.00007447529,0.0008325138,0.00029720055,0.0002299871,0.0128628835],"genre_scores_gemma":[0.9365687,0.000117625365,0.05960972,0.00009717349,0.000012606651,0.00027434085,0.00019216514,0.00004352973,0.0030841455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980563,0.0011462457,0.0000995256,0.00017391871,0.0003730948,0.0001509082],"domain_scores_gemma":[0.992718,0.005434216,0.00037916776,0.0005923853,0.0004496573,0.0004264946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026284682,0.0010917068,0.00074182963,0.0008640054,0.0008082973,0.0013620245,0.0016178726,0.0016310418,0.0032120522],"category_scores_gemma":[0.011206644,0.00027040156,0.00063085527,0.0006840709,0.0015026662,0.002203737,0.0014395912,0.0014612491,0.0003136963],"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.0034527022,0.009471444,0.025846886,0.0015165334,0.0005716437,0.002382403,0.0028609456,0.65053195,0.022985835,0.12150498,0.006923802,0.1519509],"study_design_scores_gemma":[0.00054500054,0.0023010967,0.0055027907,0.00006432797,0.00008100818,0.00027452136,0.0010587856,0.9268576,0.01570014,0.03962651,0.007914929,0.00007331052],"about_ca_topic_score_codex":0.0067008757,"about_ca_topic_score_gemma":0.008799664,"teacher_disagreement_score":0.0067008757,"about_ca_system_score_codex":0.001457179,"about_ca_system_score_gemma":0.0006049734,"threshold_uncertainty_score":0.013900876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083729945,0.000030143743,0.9945327,0.000088001856,0.000019235556,0.0001277536,0.00016272259,0.0013815975,0.002820532],"genre_scores_gemma":[0.03566704,0.00010681214,0.9589869,0.000095105024,0.00001621392,0.0004904585,0.0007985956,0.00092553586,0.002913421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865675,0.00045946654,0.000098276876,0.00020330242,0.00047423746,0.00010783583],"domain_scores_gemma":[0.9987888,0.000609068,0.00007384958,0.00025566987,0.00017913656,0.0000935218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041991,0.0011754772,0.0005480583,0.0014698193,0.0010654924,0.0022360012,0.0027232894,0.0013502397,0.0133014275],"category_scores_gemma":[0.004209903,0.0007649565,0.0020834128,0.00097604905,0.0017112626,0.0026507832,0.0034932357,0.0024860697,0.0025280386],"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.00012335276,0.00017823138,0.00046246368,0.0005606708,0.000076616314,0.00044542123,0.0010372936,0.1817723,0.011247722,0.6295427,0.017073132,0.1574801],"study_design_scores_gemma":[0.000056651545,0.000059038714,0.00009383805,0.000102701444,0.000032838157,0.00020038687,0.00015367389,0.58012384,0.008686409,0.3442953,0.066156924,0.000038349324],"about_ca_topic_score_codex":0.003312369,"about_ca_topic_score_gemma":0.007863433,"teacher_disagreement_score":0.0133014275,"about_ca_system_score_codex":0.0012687154,"about_ca_system_score_gemma":0.0015388275,"threshold_uncertainty_score":0.04449773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93527764,0.00047029712,0.05403737,0.00024648564,0.000039667004,0.00012644664,0.006164216,0.00077541184,0.0028623245],"genre_scores_gemma":[0.9808218,0.00010433705,0.013543021,0.00003881902,0.00001900443,0.00007662387,0.0045649866,0.000034728982,0.0007965696],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994524,0.00012513305,0.00005354398,0.00017085057,0.00009830801,0.000099851946],"domain_scores_gemma":[0.99738425,0.0012406852,0.0006149814,0.00023547582,0.00021809734,0.00030663575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304321,0.0008033794,0.0007336861,0.0031515888,0.00031711673,0.00081718684,0.0006467575,0.00056937773,0.0012119279],"category_scores_gemma":[0.005016145,0.00025844565,0.00053760497,0.00195926,0.0003110473,0.0011175941,0.0006488777,0.0006380584,0.00056841713],"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.0010781935,0.0012302077,0.72820675,0.00037582137,0.00036087798,0.00049423496,0.0007694366,0.08609458,0.00472639,0.0036281443,0.00892852,0.16410692],"study_design_scores_gemma":[0.00002687634,0.00018492929,0.22599626,0.000053163312,0.00006424944,0.00031627552,0.00033581204,0.7634441,0.0019018418,0.00468341,0.0029511808,0.00004188541],"about_ca_topic_score_codex":0.007184514,"about_ca_topic_score_gemma":0.019353405,"teacher_disagreement_score":0.007184514,"about_ca_system_score_codex":0.0006246203,"about_ca_system_score_gemma":0.00046106143,"threshold_uncertainty_score":0.014285386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22891955,0.0007118169,0.76204187,0.0003271023,0.00009218525,0.00009213796,0.00033995518,0.001980468,0.0054949163],"genre_scores_gemma":[0.895306,0.00015357004,0.09793658,0.00010899378,0.00001795776,0.000071776056,0.00063115906,0.0001055407,0.0056684315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998319,0.000049891492,0.000007881982,0.000047847258,0.000031333064,0.00003115194],"domain_scores_gemma":[0.999616,0.00021403028,0.000035967536,0.00004214265,0.00006763365,0.000024058047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047159786,0.0006317,0.00036697803,0.00023261031,0.00016165721,0.00037011498,0.0007127482,0.00057727244,0.0012445872],"category_scores_gemma":[0.0014837726,0.00031124902,0.0004932755,0.00018387643,0.00040054866,0.00041914816,0.0004442169,0.001157784,0.00035793555],"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.000109840345,0.000121225596,0.002682046,0.000051683517,0.00007064986,0.000051298382,0.00007902176,0.87057775,0.009604066,0.004678622,0.0014868097,0.11048693],"study_design_scores_gemma":[0.0000013411935,0.0000067691226,0.00021584822,0.0000020055627,0.0000017009468,0.000002973327,0.0000030551505,0.9985145,0.0006361487,0.00050932844,0.000104688115,0.0000016628759],"about_ca_topic_score_codex":0.008499448,"about_ca_topic_score_gemma":0.010886769,"teacher_disagreement_score":0.008499448,"about_ca_system_score_codex":0.0007514743,"about_ca_system_score_gemma":0.00054387515,"threshold_uncertainty_score":0.016899943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837337,0.000107530635,0.21208967,0.00016745356,0.00003218857,0.00010029287,0.00003331417,0.0001938008,0.003541937],"genre_scores_gemma":[0.9506946,0.0000629395,0.046460837,0.00009548924,0.000009949837,0.00009724222,0.000055106517,0.00003932453,0.0024844732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976355,0.00009693467,0.000009114516,0.00005000755,0.000042797554,0.000037666374],"domain_scores_gemma":[0.99861586,0.0008341407,0.00016816473,0.00011433995,0.0001446744,0.00012274306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020706,0.00042807986,0.0003941354,0.00035702018,0.00032573787,0.0006259961,0.0009073033,0.00067077135,0.0015985348],"category_scores_gemma":[0.0047889925,0.00026325716,0.00026916538,0.00016899435,0.0006032018,0.0007915677,0.00077365985,0.00053383986,0.00030113786],"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.00031840234,0.0005503055,0.02559156,0.00020039687,0.00015031909,0.0005238702,0.00097005087,0.7227221,0.06893471,0.032848194,0.001277848,0.14591226],"study_design_scores_gemma":[0.00003329084,0.00020337797,0.0018542154,0.000011137654,0.000025299323,0.000118899574,0.00013206861,0.9842478,0.0059251483,0.0065742345,0.00086060894,0.000014006687],"about_ca_topic_score_codex":0.0006506035,"about_ca_topic_score_gemma":0.0009938726,"teacher_disagreement_score":0.0015985348,"about_ca_system_score_codex":0.00036790175,"about_ca_system_score_gemma":0.00029616823,"threshold_uncertainty_score":0.005398035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08233232,0.000116199575,0.90765584,0.0002756882,0.000053091535,0.00018306686,0.000056084926,0.0013599321,0.007967863],"genre_scores_gemma":[0.59424824,0.0001134897,0.3995207,0.00018686698,0.000015510968,0.000252032,0.0001569365,0.00053467514,0.0049715755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996475,0.00014714026,0.00001582755,0.0000688474,0.00007811663,0.000042467225],"domain_scores_gemma":[0.9994511,0.00026304764,0.000058312296,0.00008777948,0.00009210913,0.00004768816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006851929,0.00048703334,0.0002539263,0.00030531574,0.00036067513,0.0010559225,0.0011719882,0.0008637597,0.0016148038],"category_scores_gemma":[0.0023811324,0.00036934554,0.000521035,0.00014536342,0.0012874735,0.0011936038,0.0013127308,0.0011318803,0.00042340942],"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.00018558178,0.00037191526,0.0033713789,0.00025223743,0.00007315007,0.0006283209,0.002927542,0.50356555,0.08952301,0.24864146,0.0031972155,0.1472627],"study_design_scores_gemma":[0.000026034331,0.00008538242,0.00032362435,0.000025049127,0.000015270196,0.000101126636,0.00016545896,0.93927133,0.01240498,0.040506,0.0070583164,0.00001738435],"about_ca_topic_score_codex":0.001146947,"about_ca_topic_score_gemma":0.0015840341,"teacher_disagreement_score":0.0016148038,"about_ca_system_score_codex":0.00066515215,"about_ca_system_score_gemma":0.0005483912,"threshold_uncertainty_score":0.005402088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18469737,0.00029615872,0.7846376,0.0010629176,0.00023037157,0.0015402877,0.00039453316,0.009304489,0.017836297],"genre_scores_gemma":[0.62276274,0.00009149732,0.36935237,0.00075990177,0.000057467078,0.00063028175,0.0005977657,0.00024603668,0.005501973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957912,0.0014831519,0.00028499067,0.0011148783,0.0009980095,0.0003277427],"domain_scores_gemma":[0.9898074,0.0061838296,0.0008862862,0.0011194276,0.0013919072,0.0006112369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028481716,0.0016227361,0.0008273965,0.0014233665,0.0007876783,0.0030434278,0.002401442,0.0012921047,0.0037218765],"category_scores_gemma":[0.014800306,0.00048754446,0.00064538745,0.00051785435,0.0010503973,0.003495306,0.0022989998,0.0022630512,0.0014634388],"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.0029251678,0.0025604428,0.070864476,0.0007108916,0.00039039817,0.00057885493,0.0067800805,0.02214035,0.12973264,0.03213517,0.009502808,0.7216788],"study_design_scores_gemma":[0.0002022397,0.0011850627,0.01730373,0.00012401893,0.0002500172,0.00069738267,0.0012231525,0.8733291,0.043744978,0.03386754,0.02787026,0.00020260185],"about_ca_topic_score_codex":0.0031447262,"about_ca_topic_score_gemma":0.0028271514,"teacher_disagreement_score":0.0037218765,"about_ca_system_score_codex":0.00088120805,"about_ca_system_score_gemma":0.0009961297,"threshold_uncertainty_score":0.015062809},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18308638,0.00011755465,0.7999227,0.00011936055,0.00009174673,0.00015994583,0.00013469098,0.0022385775,0.014129056],"genre_scores_gemma":[0.71222544,0.00009320324,0.28213474,0.0000642353,0.000009257045,0.00014463533,0.00019560053,0.0002842914,0.0048486777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984574,0.00002736874,0.000009799884,0.00004166172,0.000052709063,0.000022750954],"domain_scores_gemma":[0.9996063,0.00017603902,0.00002353151,0.00008665204,0.000074838266,0.00003276896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031656242,0.0003911052,0.00042610854,0.00052712887,0.0003928199,0.0006274694,0.0007494657,0.00040893446,0.0022506712],"category_scores_gemma":[0.0012164066,0.000273119,0.0006153367,0.0003438806,0.0005113924,0.0004739451,0.0010398077,0.00043257454,0.00035738538],"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.00014485772,0.00009516478,0.0041622636,0.00017169632,0.00008745712,0.0007120033,0.00065812276,0.625254,0.08288357,0.06742703,0.003944608,0.21445926],"study_design_scores_gemma":[0.00001396275,0.000035025972,0.0005296025,0.000008789416,0.000014174857,0.000116850264,0.00005027163,0.9785281,0.0070864223,0.010127411,0.0034722625,0.00001712902],"about_ca_topic_score_codex":0.0015896116,"about_ca_topic_score_gemma":0.0021373578,"teacher_disagreement_score":0.0022506712,"about_ca_system_score_codex":0.0004013075,"about_ca_system_score_gemma":0.00026841197,"threshold_uncertainty_score":0.0075292587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99739575,0.00004654654,0.00017072045,0.000037247777,0.000008506864,0.00004806248,0.000041123112,0.0000016070175,0.0022503424],"genre_scores_gemma":[0.99809116,0.0000858243,0.00038159217,0.00009859982,0.000013660922,0.00011508155,0.00006266597,0.00000496403,0.0011463633],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984162,0.0007987613,0.0001044628,0.00021023084,0.00035871766,0.00011163264],"domain_scores_gemma":[0.98278195,0.011509953,0.0025082203,0.00072015525,0.0011897655,0.0012900368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025262032,0.0002851689,0.000358672,0.00047863042,0.00071862945,0.0014811321,0.000410734,0.00057890837,0.0043713236],"category_scores_gemma":[0.01528465,0.00027265507,0.00027220053,0.00033729782,0.00093742803,0.0006449964,0.0009086693,0.0010931472,0.0005087546],"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.0034515474,0.012319965,0.8021425,0.0010733308,0.0004792829,0.00092251826,0.09658762,0.0003852531,0.020021515,0.0014247402,0.0012649334,0.05992685],"study_design_scores_gemma":[0.0001079669,0.0018722363,0.9708858,0.000048527963,0.00009394598,0.00017837236,0.02352077,0.0004526346,0.0010378438,0.00023594264,0.0015420088,0.000023953035],"about_ca_topic_score_codex":0.0008772718,"about_ca_topic_score_gemma":0.0016504271,"teacher_disagreement_score":0.0043713236,"about_ca_system_score_codex":0.0003406615,"about_ca_system_score_gemma":0.00029390614,"threshold_uncertainty_score":0.014623523},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014066601,0.0013202375,0.0048291245,0.044799004,0.029868053,0.0020220084,0.00783523,0.002344599,0.90557504],"genre_scores_gemma":[0.0017029895,0.0004241533,0.0011458087,0.007080682,0.0016341965,0.0004191376,0.0042842273,0.00046051285,0.9828483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99579066,0.0003969122,0.000091642425,0.00035821422,0.0025022582,0.00086037855],"domain_scores_gemma":[0.9853394,0.0004805085,0.00024745075,0.0005592904,0.008862765,0.004510646],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007256125,0.0010938117,0.00070199376,0.0032375047,0.0042260536,0.008108712,0.0028864532,0.005578806,0.41365072],"category_scores_gemma":[0.00831721,0.0006807421,0.0011397098,0.0014109503,0.0007407438,0.002116497,0.0040212804,0.0037816437,0.37441716],"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.000029984862,0.000048439077,0.00008630293,0.000034559333,0.0000017473967,0.000009982079,0.000009352361,0.000024334897,0.00013905989,0.0013951154,0.98610884,0.01211219],"study_design_scores_gemma":[0.0000115845905,0.00002073564,0.00022814177,0.000034610206,0.000002319465,0.000008216679,0.000029351067,0.000051223404,0.0001354861,0.0005096678,0.9989654,0.0000033567878],"about_ca_topic_score_codex":0.016340557,"about_ca_topic_score_gemma":0.047765605,"teacher_disagreement_score":0.58634925,"about_ca_system_score_codex":0.0042322706,"about_ca_system_score_gemma":0.019227423,"threshold_uncertainty_score":0.83635604},"labels":[],"label_agreement":null}]}