{"meta":{"query_hash":"1b1b5196a5ce","filters":{"venue":"Advances in Computer Games"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/1b1b5196a5ce","api":"https://metacan.xera.ac/api/v1/cohort?venue=Advances+in+Computer+Games"},"results":[{"id":"W1489504788","doi":"10.1007/978-0-387-35706-5_17","title":"Solving 7×7 Hex: Virtual Connections and Game-State Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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; University of Alberta","keywords":"Outcome (game theory); Reduction (mathematics); Sequential game; Game tree; Computer science; State (computer science); Connection (principal bundle); Tree (set theory); Combinatorial game theory; Extensive-form game; Monte Carlo tree search; Game theory; Theoretical computer science; Mathematical optimization; Mathematical economics; Algorithm; Mathematics; Combinatorics","score_opus":0.018469418800435688,"score_gpt":0.2704984088857533,"score_spread":0.25202899008531765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489504788","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.053316258,0.0001843042,0.8305373,0.0005380967,0.0002515157,0.00016322204,0.00022061964,0.0012395064,0.113549285],"genre_scores_gemma":[0.55297774,0.00030464426,0.39183405,0.00022640903,0.00007692365,0.00040924913,0.0007038929,0.00075549143,0.052711606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994941,0.00016725143,0.000025265283,0.0001097992,0.000117650954,0.00008598609],"domain_scores_gemma":[0.99954176,0.00025761596,0.00002432681,0.00009575021,0.000048461967,0.000032055912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955744,0.00095795444,0.00074856245,0.00034963267,0.0011435143,0.0017498577,0.0015780913,0.001213626,0.02566446],"category_scores_gemma":[0.0017065776,0.00050024263,0.00095643144,0.00052575296,0.0013708221,0.0030280796,0.0023958064,0.0023389473,0.002642805],"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.0001601004,0.0001304928,0.0002532853,0.00022736113,0.000049815222,0.00012532924,0.0005951425,0.111399986,0.0038759562,0.72748184,0.0131513635,0.14254932],"study_design_scores_gemma":[0.000031857664,0.000036432728,0.00008574844,0.000030086441,0.000020126128,0.000053243486,0.00018709006,0.2616567,0.00294386,0.7207349,0.014200362,0.000019567167],"about_ca_topic_score_codex":0.0022161377,"about_ca_topic_score_gemma":0.0031151772,"teacher_disagreement_score":0.02566446,"about_ca_system_score_codex":0.00061012374,"about_ca_system_score_gemma":0.0007236831,"threshold_uncertainty_score":0.08585614},"labels":[],"label_agreement":null},{"id":"W1516840567","doi":"10.1007/978-0-387-35706-5_23","title":"Solving the Oshi-Zumo Game","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nash equilibrium; Mathematical economics; Computer science; Game theory; Strategy; Mathematics","score_opus":0.053153344532452164,"score_gpt":0.3524715400949214,"score_spread":0.2993181955624692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516840567","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.15261738,0.0007288242,0.60283977,0.0021379504,0.00044669138,0.00029684606,0.00018023232,0.000284825,0.24046743],"genre_scores_gemma":[0.6781561,0.001279379,0.21678714,0.00036632683,0.00011814455,0.00043785977,0.0002934972,0.000112052185,0.10244957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997533,0.00008836414,0.000013419236,0.000037109625,0.00005039497,0.00005740064],"domain_scores_gemma":[0.9997037,0.00020267323,0.00001616731,0.000024569144,0.000017750595,0.000035073623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267833,0.0008497876,0.00085911714,0.0002998178,0.0009768691,0.0014237217,0.0010425748,0.0012006926,0.009859203],"category_scores_gemma":[0.0017638609,0.0002604438,0.0006375447,0.0004321684,0.00097027456,0.0027286874,0.0015731255,0.0015972567,0.0006703345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00023692769,0.00012545928,0.0004117235,0.00021847937,0.000043910593,0.0001266634,0.00059392676,0.04736306,0.0028081979,0.8737898,0.006573274,0.06770874],"study_design_scores_gemma":[0.00008991526,0.00010936369,0.00025446087,0.00006525243,0.00003678271,0.00006605153,0.00048002228,0.19935167,0.0020814056,0.77832925,0.019106738,0.000029066427],"about_ca_topic_score_codex":0.0020301135,"about_ca_topic_score_gemma":0.0043911184,"teacher_disagreement_score":0.009859203,"about_ca_system_score_codex":0.00060207286,"about_ca_system_score_gemma":0.0012160249,"threshold_uncertainty_score":0.03298235},"labels":[],"label_agreement":null},{"id":"W1526187220","doi":"10.1007/978-0-387-35706-5_15","title":"Search and Knowledge in Lines of Action","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Olympiad; Action (physics); Domain (mathematical analysis); Gold medal; Computer science; Class (philosophy); Position (finance); Artificial intelligence; Mathematics education; Psychology; Mathematics; Art; Business; Art history","score_opus":0.051817475745823405,"score_gpt":0.3466774546907443,"score_spread":0.2948599789449209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526187220","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01268222,0.019822126,0.19468056,0.0051717083,0.0004365958,0.000044708555,0.00024423862,0.00028204877,0.7666359],"genre_scores_gemma":[0.5084698,0.017957184,0.07982905,0.0007192451,0.0005820337,0.00024975184,0.00057572813,0.00024643895,0.39137077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965453,0.00012514868,0.000022301729,0.000064605956,0.00010143281,0.000031982152],"domain_scores_gemma":[0.99918216,0.00052662886,0.000055980916,0.00009675762,0.00010116322,0.000037385125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037870667,0.0005013303,0.00044278835,0.00092693046,0.00078811904,0.0037860598,0.0007710158,0.0014047427,0.017876495],"category_scores_gemma":[0.002414794,0.00032628115,0.00038054603,0.0018524077,0.0029450327,0.008491211,0.00077677215,0.0014393135,0.0022749698],"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.000008043086,0.000007380518,0.00007123894,0.000057981782,0.000004216328,0.000026470709,0.00036779046,0.0011406265,0.00010816557,0.96372694,0.005491341,0.028989904],"study_design_scores_gemma":[0.000005149617,0.000006780467,0.00008573901,0.000071939685,0.000004523938,0.000058251862,0.00016539778,0.0027164323,0.00017860226,0.9349425,0.06175931,0.000005311042],"about_ca_topic_score_codex":0.0023521944,"about_ca_topic_score_gemma":0.0024341838,"teacher_disagreement_score":0.017876495,"about_ca_system_score_codex":0.0016815149,"about_ca_system_score_gemma":0.0008833367,"threshold_uncertainty_score":0.05980289},"labels":[],"label_agreement":null},{"id":"W1548895693","doi":"10.1007/978-0-387-35706-5_1","title":"Evaluation Function Tuning via Ordinal Correlation","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Heuristic; Metric (unit); Correlation; Computer science; Function (biology); Feature (linguistics); Quality (philosophy); Evaluation function; Space (punctuation); Artificial intelligence; Ordinal optimization; Mathematics; Data mining; Machine learning; Ordinal data; Engineering","score_opus":0.03255499166891886,"score_gpt":0.2965026661006124,"score_spread":0.26394767443169354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548895693","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.008159295,0.0005479281,0.9863963,0.00014622002,0.000080339945,0.000039054656,0.000024891144,0.0008980824,0.003707911],"genre_scores_gemma":[0.47628665,0.00039752712,0.5095438,0.0002551053,0.00024011168,0.00025132875,0.00019546511,0.00068637874,0.012143644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994591,0.002657079,0.0003051827,0.00065340014,0.0014978931,0.00029541235],"domain_scores_gemma":[0.99101007,0.0055574025,0.00043209395,0.0014619342,0.0013101419,0.00022825257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006208108,0.00077973376,0.0019274895,0.0011957056,0.00059074163,0.0019735666,0.0016289327,0.0010828292,0.0059444443],"category_scores_gemma":[0.020020435,0.0005069968,0.0006577799,0.0012491565,0.0011118011,0.0028777814,0.002191294,0.002627597,0.0012942257],"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.0005482199,0.00025559825,0.0016172349,0.0002670575,0.00014475643,0.000049647733,0.00011395333,0.16742247,0.008956575,0.12080493,0.00817877,0.69164073],"study_design_scores_gemma":[0.00003003219,0.00009254484,0.0005301626,0.00002815726,0.000022572516,0.00003900155,0.000012724023,0.9472793,0.0032560702,0.046819706,0.001868287,0.000021361344],"about_ca_topic_score_codex":0.0006688247,"about_ca_topic_score_gemma":0.0008589796,"teacher_disagreement_score":0.006208108,"about_ca_system_score_codex":0.0009834071,"about_ca_system_score_gemma":0.00090138795,"threshold_uncertainty_score":0.032832026},"labels":[],"label_agreement":null},{"id":"W1579046794","doi":"10.1007/978-0-387-35706-5_9","title":"DF-PN in Go: An Application to the One-Eye Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Problem solver; Solver; Order (exchange); Computer science; Mathematics; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.022639719726458465,"score_gpt":0.29932827622194697,"score_spread":0.2766885564954885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579046794","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.046721138,0.00079664314,0.6585521,0.0033578703,0.00069029117,0.00021175803,0.0005690461,0.0014823817,0.28761882],"genre_scores_gemma":[0.48921028,0.0010753503,0.4241073,0.00060153945,0.00027918944,0.00023687769,0.0007100847,0.00060247234,0.08317692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.00007542461,0.000012791251,0.000068577894,0.00006761682,0.000056625315],"domain_scores_gemma":[0.99950814,0.00031094177,0.000020533258,0.000061318584,0.00005313148,0.000045952966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051571307,0.0005691191,0.0007830544,0.0005616056,0.0014173945,0.001531574,0.0012316386,0.0025954996,0.02102217],"category_scores_gemma":[0.0035274974,0.00018234696,0.0009848399,0.0009282111,0.0013336348,0.00286401,0.002551847,0.0018356283,0.0019003528],"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.00010234181,0.000063252955,0.00053441373,0.00015512214,0.000015766935,0.00024583135,0.00027416833,0.01718242,0.0012142808,0.85694623,0.022770032,0.100496195],"study_design_scores_gemma":[0.000034703207,0.000017634295,0.00020181708,0.000027927766,0.000011273361,0.00017893495,0.00015330318,0.063231185,0.00077990023,0.914247,0.021102402,0.000013842702],"about_ca_topic_score_codex":0.005476586,"about_ca_topic_score_gemma":0.0050072446,"teacher_disagreement_score":0.02102217,"about_ca_system_score_codex":0.0007564833,"about_ca_system_score_gemma":0.00078408926,"threshold_uncertainty_score":0.07032615},"labels":[],"label_agreement":null},{"id":"W1580378151","doi":"10.1007/978-0-387-35706-5_13","title":"Building the Checkers 10-Piece Endgame Databases","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chess endgame; Database; nobody; Computer science; Artificial intelligence","score_opus":0.038097764308383415,"score_gpt":0.31234599491663956,"score_spread":0.27424823060825615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580378151","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.052863993,0.0019063365,0.7546715,0.00094752776,0.00049245305,0.00081924925,0.035411898,0.059157163,0.093729764],"genre_scores_gemma":[0.2514788,0.0011949558,0.61383724,0.0004741405,0.000091423615,0.0004947421,0.073778726,0.004030494,0.054619424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.000110024375,0.00012686478,0.0003872267,0.0005364418,0.00012936548],"domain_scores_gemma":[0.9986644,0.00022489153,0.00006408082,0.00063844904,0.00031022157,0.00009799779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080653536,0.0010288542,0.0015400075,0.002890054,0.0011336381,0.004998484,0.0055028405,0.0010670399,0.035551902],"category_scores_gemma":[0.004562177,0.0015126899,0.0017368648,0.0027176207,0.0006887892,0.0069416286,0.0033092678,0.0013890371,0.016003784],"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.0009077816,0.00044584146,0.005024471,0.0005913629,0.00025817647,0.00048268324,0.00067555247,0.03244142,0.0061868834,0.11074365,0.17239368,0.6698484],"study_design_scores_gemma":[0.0002658469,0.00034992935,0.0030572088,0.0003106726,0.00031035778,0.0008234819,0.0011455626,0.36706793,0.035970014,0.15290223,0.43763235,0.00016445294],"about_ca_topic_score_codex":0.013356317,"about_ca_topic_score_gemma":0.022439362,"teacher_disagreement_score":0.035551902,"about_ca_system_score_codex":0.0012200988,"about_ca_system_score_gemma":0.0017639861,"threshold_uncertainty_score":0.11893296},"labels":[],"label_agreement":null}]}