{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003375994,0.006834134,0.96755344,0.00047261838,0.003966149,0.00038807676,0.000007996202,0.0003814687,0.020058515],"genre_scores_gemma":[0.4065874,0.05214388,0.42352608,0.001565354,0.004568689,0.0001734925,0.000046539168,0.00042217123,0.11096642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729973,0.00003916611,0.0007237803,0.0011189613,0.00036864053,0.00044971227],"domain_scores_gemma":[0.9983832,0.00027087866,0.00035940643,0.00072098733,0.00013843479,0.00012707057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022692038,0.00050163,0.0005534693,0.00048905594,0.00014195169,0.00029151034,0.0007446098,0.00022226482,0.000038594895],"category_scores_gemma":[0.000027912856,0.00053680287,0.00012955906,0.00014438866,0.0004246535,0.0016006222,0.00060005987,0.0006320919,0.000091265436],"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.0000069690195,0.000021932481,0.00001550335,0.000029660267,0.000021136571,0.000050997358,0.0012706063,0.020424487,0.00001342838,0.34581473,0.00008364109,0.6322469],"study_design_scores_gemma":[0.0002385075,0.00043262044,0.000047544978,0.0011011383,0.00001759209,0.00023916335,0.000045461853,0.044048212,0.000870587,0.8424483,0.10940154,0.0011093364],"about_ca_topic_score_codex":0.00004142169,"about_ca_topic_score_gemma":0.0001268261,"teacher_disagreement_score":0.63113755,"about_ca_system_score_codex":0.00023676058,"about_ca_system_score_gemma":0.00013604375,"threshold_uncertainty_score":0.99970835},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003333527,0.015234668,0.1821067,0.0029004042,0.0021871787,0.00087814673,0.0000510651,0.0001914152,0.79611707],"genre_scores_gemma":[0.39415714,0.006465461,0.027222358,0.005408886,0.0039299056,0.00018550828,0.000038403898,0.00021712344,0.5623752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968436,0.00008359829,0.0008961364,0.0008808976,0.000948081,0.00034770605],"domain_scores_gemma":[0.9951223,0.0026480325,0.0005125339,0.001477007,0.00015753588,0.00008257879],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012941423,0.0003901839,0.00055624906,0.0002663222,0.000158647,0.00028996274,0.0022575748,0.00018714179,0.0009235838],"category_scores_gemma":[0.00013806067,0.000249311,0.0002522523,0.00019752812,0.0005379209,0.00045764004,0.00050186546,0.0006386686,0.0013909038],"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.00000678208,0.000013315044,0.00002666936,0.000005652061,0.000008746911,0.0000125444785,0.00035403387,0.0058419006,0.0000012234727,0.62314135,0.000714614,0.36987314],"study_design_scores_gemma":[0.00010301896,0.000022348922,0.000076790144,0.000116263356,0.000006351583,0.000010900292,0.00001755507,0.00036686938,0.000008036827,0.55164015,0.44745365,0.00017807499],"about_ca_topic_score_codex":0.000003646855,"about_ca_topic_score_gemma":0.000062924024,"teacher_disagreement_score":0.44673902,"about_ca_system_score_codex":0.00008390851,"about_ca_system_score_gemma":0.000100627265,"threshold_uncertainty_score":0.9999959},"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":"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.006421624,0.047860112,0.8851394,0.0004957733,0.0032793514,0.00085749413,0.000009237953,0.0002128545,0.055724137],"genre_scores_gemma":[0.5803531,0.053134583,0.33986735,0.000373143,0.0016819994,0.000055255572,0.000015356194,0.00016655879,0.024352668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982565,0.000038361337,0.00058329897,0.0006214488,0.000237544,0.0002628616],"domain_scores_gemma":[0.99890935,0.00030572395,0.00014711003,0.00047029086,0.00011529847,0.00005225048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002585309,0.00028383342,0.0004771934,0.0005649052,0.000024652296,0.00005202738,0.0007406425,0.00020220963,0.000014124991],"category_scores_gemma":[0.000011910385,0.00028578425,0.00006732657,0.00015611078,0.0002660868,0.0009197442,0.0005575852,0.0004164624,0.000024970139],"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.000007403138,0.000038067305,0.00032627888,0.00014501488,0.0000063557964,0.000023437868,0.0009274767,0.007920894,0.000011415287,0.22870745,0.000011015831,0.7618752],"study_design_scores_gemma":[0.0005790233,0.0006359345,0.0011855493,0.0047603515,0.000012915666,0.00005212123,0.00007940302,0.17433076,0.0076918607,0.7305566,0.07872524,0.0013902155],"about_ca_topic_score_codex":0.000055612818,"about_ca_topic_score_gemma":0.00059633976,"teacher_disagreement_score":0.760485,"about_ca_system_score_codex":0.00012185322,"about_ca_system_score_gemma":0.0001486408,"threshold_uncertainty_score":0.9999594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023785744,0.004444508,0.93345785,0.00012280443,0.0056676217,0.00047953398,0.0000014623345,0.00022920543,0.05557321],"genre_scores_gemma":[0.43394175,0.0044304975,0.5097229,0.0018458404,0.0060330806,0.00029348632,0.000242095,0.00036048453,0.043129854],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677646,0.0000891816,0.0007258445,0.0009474411,0.001109283,0.0003517698],"domain_scores_gemma":[0.99806035,0.00024412986,0.0004952745,0.0007373139,0.0003868407,0.000076075885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087359274,0.00044207106,0.00041287046,0.00047793888,0.000119627875,0.00017364019,0.00083953235,0.00030477488,0.00018171407],"category_scores_gemma":[0.000035518133,0.0004739328,0.00014187332,0.00014528264,0.00013466743,0.001913821,0.0003223785,0.0005681234,0.00033501946],"study_design_candidate":"design_other","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.00000786303,0.000015503163,0.000036237572,0.000015337384,0.000016581142,0.0000117791,0.00019923477,0.124935545,0.0000031077714,0.123380035,0.00005880475,0.75131994],"study_design_scores_gemma":[0.00012513119,0.00016749698,0.00007476049,0.00037941284,0.000031628184,0.000014744156,0.0000032411035,0.4780514,0.000042768694,0.4947024,0.026039729,0.00036730006],"about_ca_topic_score_codex":0.000019669384,"about_ca_topic_score_gemma":0.00010155152,"teacher_disagreement_score":0.75095266,"about_ca_system_score_codex":0.0006533225,"about_ca_system_score_gemma":0.00024386219,"threshold_uncertainty_score":0.99977124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008938667,0.002027629,0.962756,0.002056206,0.0007585153,0.0013434238,0.0000058437754,0.00021391228,0.03074908],"genre_scores_gemma":[0.07346686,0.0029121058,0.8931605,0.0058447644,0.002421796,0.0008690314,0.000046812118,0.00022143383,0.021056693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685526,0.000061563966,0.00080454897,0.0012430713,0.0005310909,0.00050445047],"domain_scores_gemma":[0.9976628,0.00019701483,0.00029654213,0.0016008237,0.00012137765,0.00012147894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004539659,0.0004673574,0.00049775,0.00039115926,0.000084104024,0.00023843022,0.003126162,0.00023265035,0.000019992702],"category_scores_gemma":[0.0000125180995,0.00040630455,0.00009981962,0.0003071364,0.00016217897,0.0011327761,0.0007838706,0.0006205893,0.0004538604],"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.000005783839,0.000050395447,0.000085635686,0.000024000898,0.000005502286,0.0000125011375,0.0014664574,0.06320558,0.0000036807853,0.32499248,0.00005969993,0.6100883],"study_design_scores_gemma":[0.00010828198,0.00024968293,0.00021784137,0.00061734504,0.0000056838644,0.0000066729413,0.000013775969,0.042412136,0.00020244691,0.65004784,0.3054238,0.00069448334],"about_ca_topic_score_codex":0.00010071073,"about_ca_topic_score_gemma":0.0024064514,"teacher_disagreement_score":0.60939384,"about_ca_system_score_codex":0.00033471658,"about_ca_system_score_gemma":0.0001398411,"threshold_uncertainty_score":0.9998389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002130852,0.012967162,0.92865777,0.00086572586,0.002537072,0.00047715034,0.000020583237,0.00035435168,0.054098897],"genre_scores_gemma":[0.011684022,0.011326474,0.92110986,0.003397299,0.0030469806,0.000119466495,0.00004194554,0.00024461956,0.04902932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627084,0.00006136748,0.00087874866,0.001355918,0.00073544175,0.00069770054],"domain_scores_gemma":[0.9963699,0.00086406554,0.0005001952,0.0020002548,0.00014143101,0.00012415095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044801002,0.00071807293,0.0006632467,0.00034130138,0.00018625706,0.00031526407,0.003821774,0.00019853715,0.00023157087],"category_scores_gemma":[0.00006748939,0.0005743271,0.00025635524,0.0002214818,0.0005992772,0.001652979,0.0016790505,0.0008381105,0.00040601986],"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.0000052550877,0.000018451427,0.000013890569,0.00003105453,0.00002276461,0.00008631498,0.00025508078,0.010282507,0.0000035505489,0.5921483,0.00056743657,0.3965654],"study_design_scores_gemma":[0.00010091262,0.00008413093,0.000011415557,0.0007786677,0.00001436521,0.000041211028,0.00000853771,0.01641533,0.0005621084,0.34710056,0.63419974,0.00068306626],"about_ca_topic_score_codex":0.00005262207,"about_ca_topic_score_gemma":0.00012767663,"teacher_disagreement_score":0.6336323,"about_ca_system_score_codex":0.0002873586,"about_ca_system_score_gemma":0.00022690756,"threshold_uncertainty_score":0.9996708},"labels":[],"label_agreement":null}]}