{"meta":{"query_hash":"4a9ac89301f9","filters":{"venue":"International Journal of Game Theory"},"cohort_total":31,"direct_labels_cover":0,"predictions_cover":31,"exported":31,"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/4a9ac89301f9","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Game+Theory"},"results":[{"id":"W1529977182","doi":"10.1007/s00182-015-0484-8","title":"Misère-play Hackenbush Sprigs","year":2015,"lang":"da","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical economics; Computer science; Mathematics","score_opus":0.0544581537954976,"score_gpt":0.3308740018835286,"score_spread":0.276415848088031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529977182","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.15451445,0.006586775,0.7477503,0.014270531,0.048045807,0.0002804946,0.00005086635,0.00010150311,0.028399272],"genre_scores_gemma":[0.9840966,0.0002459674,0.006750377,0.0013963479,0.0038457122,0.0000016899222,0.0000022729484,0.00003479902,0.0036262209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484265,0.0006024562,0.0014859239,0.0003715233,0.0022406273,0.00045679905],"domain_scores_gemma":[0.9930641,0.00085621944,0.0014296205,0.00053507107,0.0035609773,0.0005540124],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0042707296,0.0003451314,0.00048753014,0.00057635177,0.000054679716,0.0006950361,0.0049704057,0.0001880856,0.000569864],"category_scores_gemma":[0.002329835,0.00030843224,0.00041202034,0.000297558,0.00047369394,0.0015986068,0.0006334149,0.0007710698,0.001611354],"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.0017015663,0.00095498405,0.0018228629,0.000016097567,0.0013781813,0.0031104344,0.03038759,0.0053936522,0.001493413,0.45571876,0.03428185,0.4637406],"study_design_scores_gemma":[0.0014197265,0.0012179441,0.000898285,0.0008842847,0.00014177812,0.003344343,0.0031194307,0.011514484,0.02466446,0.7067126,0.24518096,0.00090167235],"about_ca_topic_score_codex":0.000045812474,"about_ca_topic_score_gemma":0.000012191195,"teacher_disagreement_score":0.82958215,"about_ca_system_score_codex":0.00054238713,"about_ca_system_score_gemma":0.0010803976,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W1892351060","doi":"10.1007/s00182-017-0608-4","title":"Two-player Tower of Hanoi","year":2017,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Tower; Mathematics; Mathematical economics; Characterization (materials science); Combinatorics; Transfer (computing); Type (biology); Class (philosophy); Computer science; Artificial intelligence; Geography; Physics","score_opus":0.031181330870869394,"score_gpt":0.3483884644706121,"score_spread":0.31720713359974273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892351060","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.31114292,0.000269706,0.64738894,0.0033285196,0.0062835263,0.000061878796,0.000004631039,0.000020229785,0.031499628],"genre_scores_gemma":[0.990867,0.000032595857,0.0076836203,0.00021212857,0.0004262188,5.941997e-7,1.2479104e-7,0.000006224532,0.0007714472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985686,0.00007053242,0.000500175,0.000116333125,0.0006192653,0.00012507023],"domain_scores_gemma":[0.99735695,0.00024160101,0.000990703,0.00046402524,0.0008804078,0.00006633083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010901949,0.000090252484,0.0001758996,0.0001742947,0.00005458146,0.00020524548,0.003881072,0.00003613812,0.00020719667],"category_scores_gemma":[0.00071444525,0.00007371347,0.00016039136,0.000030449852,0.0002733601,0.0010070018,0.00035898446,0.000170778,0.0000463687],"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.00023370559,0.00018182148,0.002489633,0.000002999785,0.00026609557,0.00022914556,0.0026772902,0.0005407453,0.012970286,0.76072204,0.0007716249,0.2189146],"study_design_scores_gemma":[0.0005319822,0.00024662341,0.004384069,0.00022340755,0.000020923073,0.0004315408,0.00030605224,0.0029608745,0.22949931,0.7537024,0.0074613476,0.00023148004],"about_ca_topic_score_codex":0.00001716091,"about_ca_topic_score_gemma":0.000004725885,"teacher_disagreement_score":0.6797241,"about_ca_system_score_codex":0.000045651028,"about_ca_system_score_gemma":0.00010435993,"threshold_uncertainty_score":0.7212062},"labels":[],"label_agreement":null},{"id":"W1978080183","doi":"10.1007/s00182-008-0148-z","title":"Continuously stable strategies, neighborhood superiority and two-player games with continuous strategy space","year":2008,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematical economics; Dominance (genetics); Strategic dominance; Mathematics; Nash equilibrium; Strategy; Bargaining problem; Risk dominance; Space (punctuation); Repeated game; Set (abstract data type); Stability (learning theory); Equilibrium selection; Mathematical optimization; Game theory; Computer science","score_opus":0.0419915399792156,"score_gpt":0.33943135293830634,"score_spread":0.2974398129590907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978080183","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.95374435,0.0005418968,0.02585442,0.00080152677,0.0002758384,0.00012450907,0.000034106957,0.000022476466,0.018600862],"genre_scores_gemma":[0.9963677,0.00011471197,0.0006305025,0.00018655378,0.00032187405,0.000004242776,0.0000020404325,0.000017619579,0.0023547746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687165,0.00039248186,0.00080628257,0.00030086053,0.0013752814,0.00025342894],"domain_scores_gemma":[0.995805,0.0013682226,0.0007280261,0.0003131509,0.0015822303,0.00020333342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026551457,0.00021389259,0.00046182776,0.00029410623,0.00012517335,0.0004361929,0.0010508973,0.00006623157,0.00071001315],"category_scores_gemma":[0.0005137418,0.00014370911,0.00012079953,0.00024850832,0.0005848165,0.0010927474,0.00009569858,0.0003796486,0.000057590943],"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.0027966416,0.00048245752,0.045877166,0.000004223428,0.0004949881,0.0008460297,0.0042431885,0.0016401767,0.007054527,0.9089819,0.0012252743,0.026353436],"study_design_scores_gemma":[0.004317558,0.00094065594,0.06060463,0.000095500574,0.00007960166,0.0076822536,0.015427859,0.00023178193,0.0029465049,0.89119786,0.015983006,0.00049278967],"about_ca_topic_score_codex":0.000026112935,"about_ca_topic_score_gemma":0.000020613814,"teacher_disagreement_score":0.042623315,"about_ca_system_score_codex":0.000047249618,"about_ca_system_score_gemma":0.00040761504,"threshold_uncertainty_score":0.7774146},"labels":[],"label_agreement":null},{"id":"W1982244359","doi":"10.1007/s001820400165","title":"An equivalent definition of stable Equilibria","year":2004,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematical economics; Mathematics; Stability (learning theory); Computer science","score_opus":0.12206246096434366,"score_gpt":0.41930701298130996,"score_spread":0.2972445520169663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982244359","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.88914084,0.000105792235,0.09972761,0.0009859015,0.0005535579,0.000052759,0.00003387786,0.000009683082,0.009389983],"genre_scores_gemma":[0.99591374,0.000023152234,0.0033812365,0.00018702052,0.00031846066,0.0000016892265,0.0000031930267,0.000008629019,0.00016288662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971394,0.00026578453,0.0009428889,0.00014761061,0.0013796065,0.00012471953],"domain_scores_gemma":[0.9966305,0.0007331335,0.0009182858,0.00030938387,0.0012976472,0.00011103271],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046089725,0.000091819486,0.00022082868,0.0003703964,0.000030422776,0.00010046602,0.0014825705,0.00003932654,0.00094391784],"category_scores_gemma":[0.001044098,0.00006903934,0.00017971433,0.00021590885,0.00018578336,0.0007090775,0.000077881996,0.00015024096,0.00012688394],"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.00046987509,0.00026188235,0.0001471638,0.0000012914367,0.00006078365,0.000014841702,0.00094630476,0.0030086308,0.06599645,0.91460294,0.00006681409,0.014423034],"study_design_scores_gemma":[0.0006835849,0.00020653753,0.0013240576,0.000045745677,0.000015912654,0.00012984929,0.0008242337,0.000040721956,0.016586632,0.97897005,0.0011051636,0.00006753824],"about_ca_topic_score_codex":0.000005426051,"about_ca_topic_score_gemma":0.0000015978381,"teacher_disagreement_score":0.10677289,"about_ca_system_score_codex":0.00007423172,"about_ca_system_score_gemma":0.00016574984,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W1999922619","doi":"10.1007/s001820200100","title":"Voting for voters: the unanimity case","year":2003,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":9,"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 British Columbia","funders":"","keywords":"Unanimity; Voting; Computer science; Mathematical economics; Computer security; Economics; Political science; Law","score_opus":0.04368151745305899,"score_gpt":0.2654214621755924,"score_spread":0.22173994472253344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999922619","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.8221553,0.0013011309,0.15875292,0.0010261023,0.004766929,0.00019100038,0.000067548506,0.000015565674,0.011723507],"genre_scores_gemma":[0.99785864,0.000010272691,0.0004593153,0.00030613795,0.0004657241,0.0000036775318,6.404805e-7,0.000014879145,0.0008806981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988543,0.00011851386,0.0006877759,0.00011237826,0.00005849635,0.00016855446],"domain_scores_gemma":[0.99811363,0.00066025736,0.0008714183,0.000116801326,0.0001851728,0.000052745134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005949096,0.00009236473,0.00021399173,0.00014000731,0.00007113091,0.00008717786,0.00039323315,0.00004623888,0.00014244783],"category_scores_gemma":[0.0017057002,0.00007244268,0.00022323692,0.00005603415,0.00006672742,0.00017704419,0.00002065558,0.00016811129,0.00004863517],"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.0000936571,0.00004351216,0.0019477309,0.0000061690307,0.00018089598,0.000095820826,0.00085977954,0.00017015992,0.000026146537,0.99520415,0.00019057875,0.0011814057],"study_design_scores_gemma":[0.0014216062,0.00016139081,0.00086712337,0.00008026184,0.000023834684,0.007950643,0.0013473437,0.0005071905,0.0006056198,0.93833303,0.04849317,0.00020875683],"about_ca_topic_score_codex":0.000009898333,"about_ca_topic_score_gemma":0.0000034646177,"teacher_disagreement_score":0.17570336,"about_ca_system_score_codex":0.000089818896,"about_ca_system_score_gemma":0.000024626775,"threshold_uncertainty_score":0.29541266},"labels":[],"label_agreement":null},{"id":"W2015298863","doi":"10.1007/s00182-012-0320-3","title":"A discrete cost sharing model with technological cooperation","year":2012,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":10,"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 Windsor","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Cost sharing; Computer science; Mathematical economics; Microeconomics; Economics; Political science","score_opus":0.1017389285974349,"score_gpt":0.4122655095867778,"score_spread":0.31052658098934294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015298863","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.19020832,0.000067787856,0.8022238,0.001605346,0.00022288972,0.00007412396,0.00000875671,0.000019997206,0.005568979],"genre_scores_gemma":[0.99468285,0.000012050049,0.002364218,0.00027015505,0.00027780738,0.00000825775,0.0000016457251,0.0000073792926,0.0023756365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825597,0.000087094224,0.0005168969,0.00012938239,0.0008723671,0.00013831272],"domain_scores_gemma":[0.9980343,0.00043843992,0.00047757305,0.00020510778,0.0007395234,0.0001050386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038145392,0.00008881352,0.00014925399,0.00025675987,0.00007173912,0.00014563074,0.0009968,0.0000553045,0.00042439316],"category_scores_gemma":[0.0009080914,0.000052171257,0.00008428119,0.00021502786,0.00022284294,0.0008795154,0.00010741124,0.00023161493,0.00012849942],"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.00036326132,0.00010215816,0.001552478,2.817144e-7,0.000052586376,0.0000042910424,0.00040518976,0.0116023645,0.0013661333,0.9557916,0.00019362966,0.028566057],"study_design_scores_gemma":[0.0006414913,0.00008211513,0.0012270937,0.000036294266,0.000027508488,0.00069141836,0.0011556657,0.010825036,0.0043499945,0.9680712,0.012730041,0.00016210487],"about_ca_topic_score_codex":2.7003895e-7,"about_ca_topic_score_gemma":4.8838564e-7,"teacher_disagreement_score":0.80447453,"about_ca_system_score_codex":0.00006351667,"about_ca_system_score_gemma":0.000037742284,"threshold_uncertainty_score":0.46468076},"labels":[],"label_agreement":null},{"id":"W2032932628","doi":"10.1007/s001820300162","title":"On the geometry of Nash equilibria and correlated equilibria","year":2004,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Nash equilibrium; Polytope; Epsilon-equilibrium; Correlated equilibrium; Best response; Mathematical economics; Mathematics; Boundary (topology); Risk dominance; Combinatorics; Convex polytope; Symmetric equilibrium; Regular polygon; Convex geometry; Equilibrium selection; Game theory; Convex set; Geometry; Repeated game; Convex optimization; Mathematical analysis","score_opus":0.05398014815568975,"score_gpt":0.3669856524237441,"score_spread":0.31300550426805435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032932628","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.9823228,0.00017644852,0.0073460164,0.0036585056,0.0005959016,0.00007320936,0.000018093557,0.00000745058,0.0058015487],"genre_scores_gemma":[0.99840564,0.000024538711,0.00015417548,0.00060102646,0.00014064008,0.0000013837524,7.577941e-7,0.000008866379,0.0006629655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974373,0.00028468156,0.00081035914,0.00015319628,0.0011949408,0.000119540564],"domain_scores_gemma":[0.99384266,0.0042473343,0.00083349174,0.00029765436,0.000695977,0.00008287165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004947305,0.00010853757,0.00022855577,0.00036273347,0.000043834898,0.00011148378,0.0013980998,0.00005076695,0.00079973135],"category_scores_gemma":[0.004013854,0.00006235294,0.00016008907,0.00033834667,0.00038920614,0.00026264865,0.00016703265,0.00027578577,0.00011879471],"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.00057329127,0.00012051451,0.00021058985,8.484487e-7,0.0001178345,0.000013836299,0.0006656679,0.0006983311,0.018007986,0.9690628,0.0004479473,0.01008036],"study_design_scores_gemma":[0.00068221224,0.00015744557,0.003155156,0.000072661955,0.000017156804,0.00018620865,0.00050372264,0.000119445845,0.0047901175,0.98909014,0.0011597748,0.00006597841],"about_ca_topic_score_codex":0.0000022217494,"about_ca_topic_score_gemma":6.4660776e-7,"teacher_disagreement_score":0.020027326,"about_ca_system_score_codex":0.00004146006,"about_ca_system_score_gemma":0.0000979998,"threshold_uncertainty_score":0.87564975},"labels":[],"label_agreement":null},{"id":"W2053224708","doi":"10.1007/s00182-015-0473-y","title":"Grundy values of Fibonacci nim","year":2015,"lang":"de","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Thompson Rivers University; Pacific Institute for the Mathematical Sciences","keywords":"Fibonacci number; Combinatorics; Value (mathematics); Mathematics; Pisano period; Fibonacci polynomials; Statistics","score_opus":0.0556402941168552,"score_gpt":0.3405083313536427,"score_spread":0.28486803723678755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053224708","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.293184,0.022264587,0.62005734,0.0071018087,0.047883466,0.0002696688,0.00006259785,0.00005900934,0.009117483],"genre_scores_gemma":[0.989069,0.00046578876,0.0059904316,0.00040964558,0.0027518838,9.936861e-7,0.000002029648,0.000024485973,0.001285762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536765,0.00057299645,0.0015458363,0.0002602463,0.0019519306,0.00030131542],"domain_scores_gemma":[0.9928153,0.0009022178,0.0017797803,0.00042477736,0.0037727673,0.00030515742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038540002,0.00025473404,0.00049385946,0.0005555645,0.00003075367,0.00023032379,0.0037449093,0.00013857133,0.00029967836],"category_scores_gemma":[0.0020485187,0.00022621454,0.00039005736,0.00025922756,0.00049166917,0.0010226532,0.00054458185,0.0004768347,0.0004180995],"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.0025805014,0.0014695199,0.003695396,0.00003956157,0.0026695516,0.0011062843,0.04185727,0.013568625,0.0026892603,0.53143656,0.0183117,0.38057575],"study_design_scores_gemma":[0.000766341,0.0012348889,0.00058667257,0.0007476794,0.00015453773,0.00047640808,0.0023807527,0.011605949,0.036607996,0.91028124,0.034733683,0.00042383224],"about_ca_topic_score_codex":0.000038013044,"about_ca_topic_score_gemma":0.0000032095177,"teacher_disagreement_score":0.69588494,"about_ca_system_score_codex":0.00027089077,"about_ca_system_score_gemma":0.0008118938,"threshold_uncertainty_score":0.9224762},"labels":[],"label_agreement":null},{"id":"W2061674703","doi":"10.1007/s00182-013-0366-x","title":"Farsighted free trade networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Social Sciences and Humanities Research Council of Canada; University of Seoul; Seoul National University; McGill University","keywords":"Pairwise comparison; Free trade; Negotiation; Tariff; International trade; Set (abstract data type); Rules of origin; Computer science; Stability (learning theory); Economics; International economics; Artificial intelligence","score_opus":0.045406443404572665,"score_gpt":0.35461549287253796,"score_spread":0.3092090494679653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061674703","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.5567128,0.0006266142,0.3793662,0.021215351,0.0032032402,0.00025414763,0.000023216602,0.000047424423,0.03855102],"genre_scores_gemma":[0.9955501,0.00002703252,0.0007388737,0.0011253671,0.00069179654,0.0000054781144,0.000001303879,0.000010459773,0.0018496085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971993,0.00036613332,0.0008792098,0.00016006606,0.0012336291,0.00016168678],"domain_scores_gemma":[0.99593353,0.0020557859,0.0006959867,0.0004132104,0.00075359107,0.00014792207],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029983877,0.00011397737,0.00022211816,0.00032169808,0.00004764688,0.0002916653,0.002940498,0.00006767699,0.004457629],"category_scores_gemma":[0.0018246984,0.000077044606,0.00023415625,0.00025412804,0.00017854082,0.000602974,0.0001485599,0.00029473868,0.000521179],"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.0002848837,0.00027049848,0.0008182693,6.5440656e-7,0.00026133604,0.000040955205,0.0010511442,0.0031950974,0.0034409552,0.62431765,0.052564066,0.31375453],"study_design_scores_gemma":[0.00052631815,0.000056506142,0.010487598,0.00001806728,0.000013079801,0.00019727316,0.00047791714,0.0010967221,0.00061643566,0.9601997,0.026215766,0.000094584444],"about_ca_topic_score_codex":0.0000028428087,"about_ca_topic_score_gemma":0.0000010436327,"teacher_disagreement_score":0.4388373,"about_ca_system_score_codex":0.000043975127,"about_ca_system_score_gemma":0.00004886414,"threshold_uncertainty_score":0.99645245},"labels":[],"label_agreement":null},{"id":"W2070069110","doi":"10.1007/s00182-013-0407-5","title":"Linking the Kar and folk solutions through a problem separation property","year":2014,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":4,"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 Windsor","funders":"","keywords":"Property (philosophy); Shapley value; Affine transformation; Steiner tree problem; Set (abstract data type); Tree (set theory); Mathematical optimization; Computer science; Connection (principal bundle); Enhanced Data Rates for GSM Evolution; Separation (statistics); Mathematics; Mathematical economics; Game theory; Combinatorics; Artificial intelligence; Pure mathematics","score_opus":0.03995072654535058,"score_gpt":0.2618093603182075,"score_spread":0.22185863377285692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070069110","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.43977657,0.0040482683,0.41639918,0.010430764,0.003828083,0.0004258273,0.000037524413,0.000054507036,0.12499928],"genre_scores_gemma":[0.99700606,0.0000656171,0.00058159797,0.00036999368,0.00064758264,0.000004246863,0.0000015853313,0.000011178738,0.0013121678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.00013877619,0.00058562355,0.0001160107,0.000079812344,0.00012654049],"domain_scores_gemma":[0.99878985,0.0002379147,0.00068678585,0.00011349272,0.00014176796,0.000030193878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035790736,0.000086208034,0.00019039486,0.00009687371,0.0000966728,0.00012185684,0.00034636582,0.00004855891,0.000053672604],"category_scores_gemma":[0.00028088255,0.000054756234,0.00009498604,0.000055638047,0.000099920806,0.0003350171,0.000057163856,0.00019555072,0.000065892964],"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.00006928649,0.000037132813,0.0014789109,0.000008217695,0.000113436836,0.0000017232855,0.0028019066,0.00027219552,0.000104044375,0.9905618,0.00017379898,0.0043775714],"study_design_scores_gemma":[0.0004792643,0.00010766106,0.0010806154,0.00011306538,0.000011241918,0.00015430646,0.00020672873,0.0014673042,0.00007313551,0.9093882,0.08681881,0.000099702906],"about_ca_topic_score_codex":0.000012388062,"about_ca_topic_score_gemma":0.0000034671507,"teacher_disagreement_score":0.55722946,"about_ca_system_score_codex":0.000050264633,"about_ca_system_score_gemma":0.000017296472,"threshold_uncertainty_score":0.22328945},"labels":[],"label_agreement":null},{"id":"W2082395609","doi":"10.1007/s00182-015-0474-x","title":"Dynamic learning and strategic communication","year":2015,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Principal (computer security); Cheap talk; Stochastic game; Strategic communication; Outcome (game theory); Computer science; Quasiconvex function; Preference; Mathematical economics; Microeconomics; Economics; Mathematics; Computer security","score_opus":0.1173250229012824,"score_gpt":0.4346124465811177,"score_spread":0.3172874236798353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082395609","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.95338017,0.00091183156,0.011720956,0.0023608874,0.0003092105,0.000044184835,0.000003382154,0.000013854852,0.03125553],"genre_scores_gemma":[0.9968501,0.00009521896,0.0010695569,0.00010499343,0.000056310335,0.0000011826162,0.0000016865872,0.000005770493,0.0018152032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979565,0.000558093,0.00050580373,0.000099619116,0.0008047987,0.000075144795],"domain_scores_gemma":[0.99686694,0.0011979577,0.0005539908,0.00016645296,0.0010981619,0.00011647725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063918917,0.00006795637,0.0001393196,0.00023367495,0.00004305394,0.00019882417,0.0009158147,0.000035567035,0.00016160298],"category_scores_gemma":[0.0016564289,0.00005010012,0.00006122854,0.0001321811,0.00017619474,0.0003069557,0.00012364982,0.0002576206,0.000105298306],"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.00045404994,0.000107547894,0.001842113,8.257614e-7,0.0000967157,0.000019177665,0.003045496,0.0012240655,0.001375447,0.91312635,0.00023710474,0.07847111],"study_design_scores_gemma":[0.00040789018,0.00007104577,0.00074520527,0.000017924938,0.0000093229755,0.00024860635,0.0054372796,0.0008692385,0.00007772034,0.98488855,0.007172803,0.00005438568],"about_ca_topic_score_codex":0.0000014859659,"about_ca_topic_score_gemma":0.0000023140892,"teacher_disagreement_score":0.07841672,"about_ca_system_score_codex":0.00004739621,"about_ca_system_score_gemma":0.00008383078,"threshold_uncertainty_score":0.22153148},"labels":[],"label_agreement":null},{"id":"W2091040861","doi":"10.1007/s001820000037","title":"Separating equilibria in a continuous-time bargaining model with two-sided uncertainty","year":2000,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Valuation (finance); Economics; Mathematical economics; Microeconomics; Outcome (game theory); Discounting; Econometrics; Finance","score_opus":0.014987079450937028,"score_gpt":0.24615872967319088,"score_spread":0.23117165022225386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091040861","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.8260364,0.00028076206,0.010878051,0.00032898242,0.00007793779,0.00003885753,0.000021617348,0.00001048304,0.1623269],"genre_scores_gemma":[0.9946635,0.000050802584,0.0010916728,0.0004589021,0.00013762397,0.0000022190557,0.0000059469503,0.000013233346,0.0035761066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987827,0.00005128147,0.0007621682,0.00014841017,0.00010890046,0.00014656848],"domain_scores_gemma":[0.9991474,0.00011979789,0.00044921573,0.000106408326,0.00011522748,0.00006195216],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010983086,0.00010522681,0.00035044516,0.00035767176,0.000019368335,0.00007381392,0.00033752096,0.000031239288,0.0057430165],"category_scores_gemma":[0.00009598584,0.000100098754,0.00014169041,0.00012996918,0.00004243183,0.00028269077,0.000020361796,0.00018033058,0.00022104087],"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.0013173246,0.00021223945,0.008309949,0.0000031128473,0.0006205028,0.00013387005,0.0020151716,0.4637921,0.00061445,0.5141948,0.00019825375,0.008588261],"study_design_scores_gemma":[0.0027931996,0.00011894087,0.0010011868,0.00016315092,0.000019425306,0.00012093598,0.00021792756,0.55891156,0.00008004047,0.43505654,0.0012485036,0.00026861756],"about_ca_topic_score_codex":0.000027726897,"about_ca_topic_score_gemma":0.000008211528,"teacher_disagreement_score":0.16862708,"about_ca_system_score_codex":0.00010256607,"about_ca_system_score_gemma":0.00004459443,"threshold_uncertainty_score":0.9951659},"labels":[],"label_agreement":null},{"id":"W2092709098","doi":"10.1007/s00182-006-0047-0","title":"The calculus of ethical voting","year":2006,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Electoral Systems and Political Participation","field":"Social Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Consistency (knowledge bases); Duty; Voting; Moral obligation; Order (exchange); Incentive; Identity (music); Obligation; Function (biology); Turnout; Uniqueness; Mathematical economics; Nash equilibrium; Computer science; Law and economics; Microeconomics; Political science; Economics; Social psychology; Psychology; Law; Philosophy; Artificial intelligence; Politics","score_opus":0.02185795303786727,"score_gpt":0.3745385984857783,"score_spread":0.35268064544791106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092709098","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.9240515,0.00044522653,0.008583734,0.026259052,0.0022236689,0.00008236703,0.000003835853,0.000012304189,0.03833828],"genre_scores_gemma":[0.9978645,0.00000616804,0.000025595844,0.00012031102,0.0011696803,5.4596677e-7,2.5349289e-7,0.000002926332,0.0008100405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850136,0.0004200429,0.00037090838,0.000032581833,0.0005543407,0.00012077415],"domain_scores_gemma":[0.9981411,0.0009472711,0.00028561446,0.00003256675,0.00055093213,0.000042476277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026586675,0.000033705808,0.0000800767,0.00003517802,0.00008463065,0.00004225995,0.00027308933,0.00006406652,0.000050853698],"category_scores_gemma":[0.0009793949,0.0000217746,0.00008448624,0.000052389663,0.00025132627,0.00006711167,0.000014231087,0.00019918704,0.000007024814],"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.000049067487,0.000019372494,0.0018105981,9.891417e-7,0.000022845627,0.0000039134966,0.00051287067,0.00005047494,0.0004998974,0.9936869,0.00038990084,0.00295317],"study_design_scores_gemma":[0.00072874845,0.0001803845,0.027836412,0.00019085423,0.000046935427,0.000033447337,0.001253878,0.00032309938,0.004376471,0.84990215,0.11496364,0.00016395192],"about_ca_topic_score_codex":0.0011799377,"about_ca_topic_score_gemma":0.00062701735,"teacher_disagreement_score":0.14378473,"about_ca_system_score_codex":0.000075100594,"about_ca_system_score_gemma":0.00010867235,"threshold_uncertainty_score":0.17837207},"labels":[],"label_agreement":null},{"id":"W2093064345","doi":"10.1007/s001820200098","title":"Maximal stable sets of two-player games","year":2002,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Component (thermodynamics); Mathematics; Set (abstract data type); Combinatorics; Mathematical economics; Stability (learning theory); Connected component; Computer science; Physics","score_opus":0.09866001960081501,"score_gpt":0.39480978080433715,"score_spread":0.29614976120352215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093064345","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.9292302,0.00055512314,0.022760324,0.0019356816,0.0009350183,0.00007894538,0.000055094744,0.00001328857,0.044436302],"genre_scores_gemma":[0.99345,0.000046802084,0.0011877146,0.00028292811,0.00024047667,0.000001932066,8.0448797e-7,0.000010168237,0.0047791954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677753,0.00032472386,0.0010211788,0.00016666729,0.0015526771,0.00015719302],"domain_scores_gemma":[0.9956591,0.00164356,0.0009894449,0.0003099427,0.0012897694,0.00010817195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038082558,0.00011618679,0.000291413,0.00043114563,0.000035649995,0.000105793646,0.0016547885,0.000044628538,0.008461603],"category_scores_gemma":[0.0013619364,0.00008393926,0.00023874975,0.0002581493,0.00022202366,0.0004767573,0.00011539912,0.0002181704,0.00046765938],"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.00073680724,0.0007786471,0.003974033,0.0000039633774,0.000390396,0.00010208924,0.0033628265,0.0024743206,0.017255446,0.727334,0.012983794,0.23060365],"study_design_scores_gemma":[0.0009783482,0.00012232311,0.0026492379,0.000046386744,0.000027557597,0.0003896139,0.00075125176,0.0006613156,0.01009045,0.9572251,0.026931671,0.00012678768],"about_ca_topic_score_codex":0.0000026373998,"about_ca_topic_score_gemma":0.0000013974899,"teacher_disagreement_score":0.23047686,"about_ca_system_score_codex":0.000041161024,"about_ca_system_score_gemma":0.000040419283,"threshold_uncertainty_score":0.9924448},"labels":[],"label_agreement":null},{"id":"W2099084709","doi":"10.1007/s001820400177","title":"Resource-monotonicity for house allocation problems","year":2004,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Monotonic function; Dictator; Object (grammar); Resource (disambiguation); Simple (philosophy); Independence (probability theory); Sequence (biology); Mathematical economics; Computer science; Resource allocation; Microeconomics; Mathematical optimization; Economics; Mathematics; Artificial intelligence; Law; Statistics","score_opus":0.030265495735515378,"score_gpt":0.25094157691034585,"score_spread":0.22067608117483048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099084709","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.74867463,0.0012695742,0.23766454,0.0026119957,0.002164467,0.00034517812,0.00006607044,0.000059096317,0.0071444623],"genre_scores_gemma":[0.9977034,0.00003756384,0.0008232983,0.00028765647,0.0005818137,0.000009345225,0.0000033780032,0.000028194523,0.00052536145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988034,0.000038392114,0.00079250324,0.00014185223,0.00007975919,0.00014414576],"domain_scores_gemma":[0.99846977,0.00016666458,0.00097604585,0.000132447,0.00020096175,0.00005409837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027644632,0.000100802215,0.00025403415,0.0002599465,0.000035994966,0.00007076464,0.00050576543,0.00006795293,0.000038617352],"category_scores_gemma":[0.00045899407,0.00010196742,0.00020109751,0.00006107118,0.000057009733,0.0002407224,0.000028652332,0.00014662632,0.000101812446],"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.00029528525,0.00013724348,0.00046733205,0.000014553035,0.0001925402,0.0000047114,0.0017248822,0.0068770065,0.00031822696,0.98833257,0.0000936713,0.0015419811],"study_design_scores_gemma":[0.0018874609,0.00021759755,0.00068269717,0.00012123752,0.00001026342,0.00010583165,0.00018493722,0.00013716471,0.001674674,0.9554955,0.039334785,0.00014787838],"about_ca_topic_score_codex":0.000014236151,"about_ca_topic_score_gemma":0.0000028878571,"teacher_disagreement_score":0.24902877,"about_ca_system_score_codex":0.00020533448,"about_ca_system_score_gemma":0.000038213377,"threshold_uncertainty_score":0.41581106},"labels":[],"label_agreement":null},{"id":"W2105547434","doi":"10.1007/s001820200113","title":"Perfect equilibrium and lexicographic beliefs","year":2003,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Lexicographical order; Property (philosophy); Independence (probability theory); Product (mathematics); Mathematical economics; Characterization (materials science); Mathematics; Joint (building); Finite set; Combinatorics; Statistics; Engineering; Epistemology","score_opus":0.058621436496871016,"score_gpt":0.3845995118169048,"score_spread":0.3259780753200338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105547434","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.9575458,0.0008024209,0.014746032,0.0013127405,0.00081549,0.000060512095,0.000008305762,0.000012122023,0.02469656],"genre_scores_gemma":[0.99727494,0.000054157666,0.00048663025,0.0003837626,0.00020009845,0.0000018028766,4.0638602e-7,0.0000087518465,0.0015894583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755275,0.0005338428,0.0006285181,0.00017396465,0.0009778972,0.00013305306],"domain_scores_gemma":[0.99671704,0.0017637612,0.00046623728,0.00022226282,0.0007033281,0.00012740352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061744093,0.000104723906,0.00019895866,0.00045328226,0.00003727923,0.00019903909,0.0008514114,0.000047325786,0.00084110716],"category_scores_gemma":[0.002898117,0.00007450104,0.00016968265,0.00025971924,0.00026606908,0.00037633104,0.00007063591,0.00021046492,0.000103585124],"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.00018358132,0.000118283984,0.0035581014,0.0000010763198,0.0001148032,0.000030394784,0.0008201302,0.000102676255,0.008019388,0.94976133,0.0006774568,0.03661277],"study_design_scores_gemma":[0.0004694557,0.000099547855,0.0050955955,0.000021244063,0.000015226491,0.0006679256,0.00049521384,0.000021741356,0.003261429,0.9571293,0.032632753,0.00009054122],"about_ca_topic_score_codex":6.092979e-7,"about_ca_topic_score_gemma":6.6303016e-7,"teacher_disagreement_score":0.039729115,"about_ca_system_score_codex":0.000020138383,"about_ca_system_score_gemma":0.00006915122,"threshold_uncertainty_score":0.92095333},"labels":[],"label_agreement":null},{"id":"W2110681344","doi":"10.1007/s00182-010-0237-7","title":"Noncooperative formation of coalitions in hedonic games","year":2010,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Core (optical fiber); Mathematical economics; Class (philosophy); Economics; Point (geometry); Repeated game; Mathematics; Game theory; Computer science","score_opus":0.019829514491124117,"score_gpt":0.257316331565879,"score_spread":0.2374868170747549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110681344","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.97298276,0.00024339904,0.009635931,0.00039575231,0.0015280574,0.000062140825,0.00005529325,0.00000493276,0.015091746],"genre_scores_gemma":[0.9990347,0.00003940427,0.0002753403,0.00007405025,0.0002212046,0.0000023341029,0.0000035574737,0.000007625506,0.00034178724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880666,0.000064135835,0.00089351035,0.00007527881,0.00006908308,0.00009135154],"domain_scores_gemma":[0.9985785,0.00020621046,0.00086685014,0.0000984041,0.00021646307,0.000033592463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021780794,0.00007069807,0.00025035776,0.00042100548,0.000013419923,0.000028788309,0.00033792635,0.00005728131,0.00036413042],"category_scores_gemma":[0.00047972333,0.00006973484,0.0001105674,0.000092743256,0.000080902304,0.00042085358,0.000025516056,0.00026429867,0.00006150161],"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.00012279346,0.000121224075,0.004434952,0.0000091146485,0.000054280492,0.000007932336,0.002712178,0.00024118647,0.0020131432,0.9891514,0.000050550312,0.0010812444],"study_design_scores_gemma":[0.0021132617,0.00022843244,0.017670603,0.00024011878,0.000009428038,0.00032732886,0.0013354464,0.0011390726,0.008679259,0.95997894,0.0080536,0.00022448943],"about_ca_topic_score_codex":0.000016007949,"about_ca_topic_score_gemma":0.000024984947,"teacher_disagreement_score":0.029172441,"about_ca_system_score_codex":0.000054022956,"about_ca_system_score_gemma":0.000031140742,"threshold_uncertainty_score":0.3986973},"labels":[],"label_agreement":null},{"id":"W2120693554","doi":"10.1007/s00182-011-0274-x","title":"Bidding and sequential coalition formation with externalities","year":2011,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environment and Climate Change Canada; McGill University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Mathematical economics; Stochastic game; Economics; Bidding; Externality; Markov perfect equilibrium; Markov chain; Partition (number theory); Repeated game; Monotonic function; Nash equilibrium; Microeconomics; Property (philosophy); Game theory; Computer science; Mathematics; Combinatorics","score_opus":0.06763808638016416,"score_gpt":0.22991856312608266,"score_spread":0.1622804767459185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120693554","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.8891316,0.0004670145,0.0905649,0.00008590562,0.00075428205,0.00004527143,0.000023502495,0.000011751792,0.01891579],"genre_scores_gemma":[0.9985782,0.000053688884,0.00059516804,0.00008395128,0.0002574278,0.0000014011674,0.000001930488,0.000009381329,0.00041885418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999238,0.000052907697,0.00047811575,0.00007683785,0.000067308145,0.00008682963],"domain_scores_gemma":[0.9990394,0.000056189692,0.00068745064,0.00006018609,0.00011638088,0.00004038824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645854,0.00007281966,0.00016262852,0.00023264166,0.000025161504,0.00005969659,0.00018141752,0.000033184795,0.00027179086],"category_scores_gemma":[0.00006373997,0.000064745436,0.000052668478,0.000032360855,0.00007055886,0.0006092395,0.000023022303,0.000097748656,0.000029942234],"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.00043006014,0.000035672827,0.004764596,0.000014379651,0.00013937439,0.000026179452,0.005133844,0.0000152136145,0.00013349856,0.9877684,0.000020756743,0.0015179921],"study_design_scores_gemma":[0.0014580074,0.00035178536,0.013304074,0.0003186716,0.000021717267,0.0014809767,0.0019611039,0.0002776529,0.0025723455,0.97511476,0.0029173181,0.00022158239],"about_ca_topic_score_codex":0.000021864758,"about_ca_topic_score_gemma":0.0000020085745,"teacher_disagreement_score":0.10944661,"about_ca_system_score_codex":0.00005100719,"about_ca_system_score_gemma":0.000009028243,"threshold_uncertainty_score":0.29759192},"labels":[],"label_agreement":null},{"id":"W2150736298","doi":"10.1007/s00182-012-0356-4","title":"Contractually stable networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"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":"Services Fédéraux des Affaires Scientifiques, Techniques et Culturelles; Fonds De La Recherche Scientifique - FNRS; State University of New York; Northwestern University; Concordia University; Université Paris-Sud; Vanderbilt University","keywords":"Unanimity; Simple (philosophy); Stability (learning theory); Operations research; Computer science; Mathematical economics; Microeconomics; Law and economics; Economics; Business; Law; Political science; Mathematics","score_opus":0.024527264487646003,"score_gpt":0.2388360905801483,"score_spread":0.2143088260925023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150736298","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.65492946,0.012665041,0.21283239,0.0006008117,0.014181785,0.00012500786,0.00004882846,0.00003648034,0.10458018],"genre_scores_gemma":[0.9955174,0.00008456245,0.00017826876,0.00038004183,0.0019300412,0.0000011982729,0.0000019240667,0.000016260463,0.0018903133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880934,0.000073129806,0.0007330296,0.00007811257,0.000079290214,0.00022709256],"domain_scores_gemma":[0.9984739,0.00027654498,0.0008893154,0.00011112411,0.00014043636,0.00010870522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003955407,0.000095022195,0.00027407336,0.00019253121,0.00002394605,0.000062453764,0.00044497402,0.0000656022,0.0009070248],"category_scores_gemma":[0.0003770391,0.00009208882,0.000154916,0.000053981643,0.00004976464,0.00051032496,0.00003689427,0.00022202038,0.00029139017],"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.00019875316,0.00013329623,0.018504646,0.0000030495837,0.00027137809,0.000010089725,0.00094542047,0.0005781059,0.000041901174,0.9765016,0.00059129705,0.0022204588],"study_design_scores_gemma":[0.0029825044,0.0002683958,0.04186039,0.00021406321,0.00004119609,0.000981909,0.0008899183,0.0011638846,0.0005421935,0.6577818,0.29265,0.00062375295],"about_ca_topic_score_codex":0.000005866229,"about_ca_topic_score_gemma":3.5041245e-7,"teacher_disagreement_score":0.3405879,"about_ca_system_score_codex":0.000088027,"about_ca_system_score_gemma":0.000014011693,"threshold_uncertainty_score":0.99312854},"labels":[],"label_agreement":null},{"id":"W2170563224","doi":"10.1007/s001820200099","title":"Sharing the cost of a network: core and core allocations","year":2002,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Core (optical fiber); Mathematical economics; Set (abstract data type); Mathematical optimization; Tree (set theory); Solution set; Solution concept; Mathematics; Computer science; Game theory; Combinatorics","score_opus":0.10690966215199764,"score_gpt":0.2699413569966439,"score_spread":0.16303169484464625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170563224","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.94733953,0.0069976165,0.011142742,0.0013993169,0.0020720917,0.00017660383,0.00005634967,0.000012848116,0.030802913],"genre_scores_gemma":[0.99766666,0.0002409797,0.00009679225,0.00019579925,0.00041662686,0.0000022365077,0.0000010785302,0.000009651944,0.0013701872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990826,0.000025173196,0.0006258015,0.00009308684,0.00006650938,0.00010681895],"domain_scores_gemma":[0.9985652,0.00029165408,0.00083204766,0.00013351171,0.00013822426,0.000039361246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017982194,0.00007222711,0.00020812068,0.00011518603,0.000042574746,0.000040466784,0.000480333,0.000037300433,0.00039847748],"category_scores_gemma":[0.00027056973,0.000058707934,0.00009239178,0.00007609193,0.00012399477,0.0001268467,0.00006514368,0.00016272276,0.000037247155],"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.00004948234,0.000043992975,0.02690365,0.0000062244426,0.00018365162,0.0000054962475,0.001364274,0.0009975771,0.000028985347,0.9673492,0.00049487053,0.0025726077],"study_design_scores_gemma":[0.001031457,0.00012866435,0.02720911,0.0002583112,0.000026858701,0.00044247063,0.00053584925,0.010135969,0.0000436247,0.93808335,0.021927143,0.00017718702],"about_ca_topic_score_codex":0.000008360163,"about_ca_topic_score_gemma":0.0000025978711,"teacher_disagreement_score":0.05032713,"about_ca_system_score_codex":0.00003476326,"about_ca_system_score_gemma":0.0000059086055,"threshold_uncertainty_score":0.4363049},"labels":[],"label_agreement":null},{"id":"W2765508545","doi":"10.1007/s00182-017-0598-2","title":"Sterling stirling play","year":2017,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Stirling number; Stirling numbers of the first kind; Permutation (music); Mathematics; Stirling numbers of the second kind; Stirling engine; Combinatorics; Set (abstract data type); Product (mathematics); Value (mathematics); Discrete mathematics; Computer science; Physics; Geometry; Statistics","score_opus":0.06102106279879391,"score_gpt":0.4027295698415748,"score_spread":0.3417085070427809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765508545","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.73300576,0.00013990817,0.24382682,0.0006777423,0.008510364,0.00012485942,0.0000068580075,0.00004372731,0.013663984],"genre_scores_gemma":[0.9764298,0.000023887931,0.02175266,0.00004727852,0.0011347545,0.0000011783363,2.4258281e-7,0.00002836034,0.00058178906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998516,0.00006773745,0.0005729311,0.00008916293,0.00061360025,0.00014057192],"domain_scores_gemma":[0.9965621,0.00094177003,0.0014662611,0.00035520163,0.0006012505,0.00007341422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013176622,0.00012428945,0.00026297822,0.00012551807,0.00009783576,0.00018571435,0.0014071965,0.000055931294,0.00008742321],"category_scores_gemma":[0.00471733,0.00010396515,0.00015499347,0.0000150088845,0.000096167874,0.0004946913,0.00017938734,0.0002830014,0.000020303703],"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.0002276371,0.00013781333,0.00015441656,0.000018170844,0.00028073843,0.00018273569,0.0013556597,0.00006104216,0.0014454325,0.98209053,0.00014139625,0.013904446],"study_design_scores_gemma":[0.00087875087,0.00006047134,0.00012965604,0.0003050198,0.00003808898,0.00020886394,0.00019742562,0.00009801,0.002988759,0.9940165,0.000971481,0.000106920736],"about_ca_topic_score_codex":6.247675e-7,"about_ca_topic_score_gemma":6.119709e-7,"teacher_disagreement_score":0.2434241,"about_ca_system_score_codex":0.00010736522,"about_ca_system_score_gemma":0.000057970254,"threshold_uncertainty_score":0.56474257},"labels":[],"label_agreement":null},{"id":"W2948567253","doi":"10.1007/s00182-019-00683-3","title":"Self-recognition in teams","year":2019,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Experimental Behavioral Economics Studies","field":"Social Sciences","cited_by":5,"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 Toronto","funders":"","keywords":"Task (project management); Order (exchange); Type (biology); Computer science; Game theory; Mathematical economics; Psychology; Economics; Management","score_opus":0.016266233602337102,"score_gpt":0.3307623084666442,"score_spread":0.3144960748643071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948567253","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.9244768,0.0001954993,0.000011508125,0.0005164858,0.0013610631,0.000063018684,0.0000024277779,0.000008601706,0.07336461],"genre_scores_gemma":[0.99854904,0.00020918634,0.00035969834,0.00021267481,0.00023958847,0.000001455891,8.0590905e-7,0.000005047485,0.00042246995],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992439,0.00011601906,0.000247112,0.000060014318,0.00023794516,0.000094985495],"domain_scores_gemma":[0.9994634,0.00011894061,0.00018962017,0.000033964046,0.00015948199,0.00003458447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009316583,0.000047361216,0.00010435509,0.00014470113,0.00001925825,0.000036316716,0.00028358243,0.000033530072,0.0005017052],"category_scores_gemma":[0.00006835255,0.000045780536,0.00006519633,0.000042122974,0.00006138616,0.00032862095,0.00003651642,0.00011498691,0.00024523173],"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.0012710232,0.001582197,0.36781597,0.000013188949,0.00062119105,0.0002046063,0.15473735,0.00008873113,0.011209121,0.3155287,0.0007382845,0.14618963],"study_design_scores_gemma":[0.008938228,0.0009152354,0.06751837,0.00065232033,0.000095029965,0.000164087,0.15033117,0.00007912848,0.016081752,0.6326263,0.1214868,0.0011116007],"about_ca_topic_score_codex":0.000103084916,"about_ca_topic_score_gemma":0.00008723515,"teacher_disagreement_score":0.31709757,"about_ca_system_score_codex":0.00041241452,"about_ca_system_score_gemma":0.00008577421,"threshold_uncertainty_score":0.549332},"labels":[],"label_agreement":null},{"id":"W2999458623","doi":"10.1007/s00182-019-00702-3","title":"Three-player nim with podium rule","year":2020,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Equivalence (formal languages); Combinatorial game theory; Order (exchange); Mathematical economics; Characterization (materials science); Computer science; Discrete mathematics; Game theory; Sequential game; Physics","score_opus":0.027153284574486517,"score_gpt":0.2752359548013868,"score_spread":0.24808267022690028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999458623","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.06334682,0.00012570657,0.9245291,0.009142407,0.00088324904,0.000042373642,0.000002245364,0.000039130122,0.0018889923],"genre_scores_gemma":[0.9678607,0.00001549282,0.028475974,0.002574669,0.0009985985,0.0000010839121,3.6239885e-7,0.000011464968,0.000061643164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850625,0.00006169452,0.00039193055,0.00016602676,0.0007199674,0.00015416209],"domain_scores_gemma":[0.99852735,0.00021231548,0.0003505326,0.00015886563,0.00060195604,0.00014900295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045339268,0.00011791493,0.00016432094,0.0001153513,0.000026628513,0.0001740597,0.00195704,0.00003763654,0.00018499998],"category_scores_gemma":[0.00015976165,0.00008688226,0.0001018441,0.00014140485,0.00010389747,0.00067906966,0.00018296331,0.0002625867,0.00019463731],"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.0012217709,0.00022243713,0.0045020543,0.00000818187,0.00057472533,0.0012992566,0.0073216297,0.003535173,0.0052167983,0.6187657,0.0034476137,0.35388467],"study_design_scores_gemma":[0.001313546,0.0024268772,0.007284665,0.00030837418,0.00006749704,0.002158479,0.0007345462,0.051038876,0.07672883,0.82966006,0.027409287,0.0008689874],"about_ca_topic_score_codex":0.000005246189,"about_ca_topic_score_gemma":0.000003911197,"teacher_disagreement_score":0.9045139,"about_ca_system_score_codex":0.00005160479,"about_ca_system_score_gemma":0.00013621274,"threshold_uncertainty_score":0.36367},"labels":[],"label_agreement":null},{"id":"W3012333240","doi":"10.1007/s00182-020-00715-3","title":"On lattices from combinatorial game theory: infinite case","year":2020,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive lattice; Converse; Iterated function; Distributive property; Mathematics; Partially ordered set; Lattice (music); Finite set; Combinatorics; Complete lattice; Map of lattices; Existential quantification; Discrete mathematics; Pure mathematics; Universality (dynamical systems)","score_opus":0.03442724259271438,"score_gpt":0.30245293624011366,"score_spread":0.26802569364739925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012333240","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.5331968,0.0003167432,0.44610646,0.0068075485,0.008355631,0.00011480195,0.0000316051,0.00010031118,0.004970105],"genre_scores_gemma":[0.9932188,0.000027625154,0.0017049538,0.0033507745,0.001625747,0.0000015914379,0.000001457028,0.000016862428,0.00005222102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756694,0.0004658333,0.00066326436,0.0002615787,0.0008442331,0.00019813982],"domain_scores_gemma":[0.9958183,0.002517719,0.0006270267,0.0002621022,0.00055633736,0.00021852135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468656,0.00019000498,0.00027259477,0.00018839278,0.000044075554,0.00032690822,0.0021881126,0.00008389072,0.0003352074],"category_scores_gemma":[0.0016439223,0.00016027446,0.00020344942,0.00017212833,0.00015832859,0.000778129,0.00030012842,0.0004874395,0.0003269047],"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.00079291104,0.00012993185,0.00009782996,0.000001985338,0.0002497632,0.0042182156,0.0064853407,0.0009082832,0.00043893108,0.9251542,0.0004074561,0.06111513],"study_design_scores_gemma":[0.0005185264,0.0004769902,0.00007277205,0.00008257383,0.000026586687,0.0006305948,0.0004636221,0.005690996,0.008869148,0.97807014,0.0048932526,0.00020477467],"about_ca_topic_score_codex":0.000017279703,"about_ca_topic_score_gemma":0.0000023047987,"teacher_disagreement_score":0.46002197,"about_ca_system_score_codex":0.00008425732,"about_ca_system_score_gemma":0.0001246328,"threshold_uncertainty_score":0.65358025},"labels":[],"label_agreement":null},{"id":"W3121950987","doi":"10.1007/s00182-010-0238-6","title":"Corrigendum to “Resource-monotonicity for house allocation problems”","year":2010,"lang":"en","type":"erratum","venue":"International Journal of Game Theory","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Social Sciences and Humanities Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Lemma (botany); Mathematical proof; Counterexample; Null (SQL); Domain (mathematical analysis); Object (grammar); Monotonic function; Mathematics; Discrete mathematics; Invariant (physics); Mathematical economics; Preference; Independence (probability theory); Combinatorics; Computer science; Artificial intelligence","score_opus":0.036136562314952374,"score_gpt":0.26020456676152703,"score_spread":0.22406800444657465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121950987","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026151411,0.008880773,0.2352931,0.008033427,0.5680704,0.0036029771,0.0028267824,0.0003238057,0.14681733],"genre_scores_gemma":[0.5341126,0.00033424242,0.0016830951,0.0021266672,0.019560417,0.00012171197,0.00019316364,0.00037020756,0.44149792],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99734175,0.00009390541,0.001667344,0.0003798018,0.00019833367,0.00031888086],"domain_scores_gemma":[0.9957542,0.00021604204,0.0028766177,0.00037181302,0.0006107194,0.00017059757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00448102,0.00032161037,0.0008148828,0.0008658747,0.00006443362,0.00020306751,0.001611909,0.00052482425,0.00023691407],"category_scores_gemma":[0.0013812154,0.0003370287,0.0005231041,0.00011178324,0.00008079971,0.00021218741,0.00011458742,0.001162867,0.00037358757],"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.0008182649,0.00030940844,0.00018025316,0.00014385174,0.0010364103,0.00001950193,0.003008445,0.000390683,0.00018817736,0.48417336,0.50454706,0.0051845647],"study_design_scores_gemma":[0.00059576385,0.00023767928,0.00013834807,0.0003061876,0.000028955024,0.000083348416,0.00007939992,0.00017850914,0.00011988696,0.1601438,0.83777696,0.00031115423],"about_ca_topic_score_codex":0.0000293177,"about_ca_topic_score_gemma":0.0000269499,"teacher_disagreement_score":0.54850996,"about_ca_system_score_codex":0.00030713147,"about_ca_system_score_gemma":0.0001583041,"threshold_uncertainty_score":0.99990815},"labels":[],"label_agreement":null},{"id":"W3183790857","doi":"10.1007/s00182-025-00928-4","title":"Specifying a game-theoretic extensive form as an abstract 5-ary relation","year":2025,"lang":"en","type":"preprint","venue":"International Journal of Game Theory","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Western University","funders":"","keywords":"Axiom; Mathematical economics; Relation (database); Mathematics; Set (abstract data type); Bijection; Node (physics); Action (physics); Successor cardinal; Extensive-form game; Tree (set theory); Combinatorial game theory; Discrete mathematics; Computer science; Theoretical computer science; Combinatorics; Game theory; Sequential game","score_opus":0.0915849344649609,"score_gpt":0.4345450077200754,"score_spread":0.3429600732551145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183790857","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.83293235,0.0008726232,0.06259711,0.003272569,0.006300665,0.0005420774,0.00021970953,0.00007971929,0.09318316],"genre_scores_gemma":[0.9915356,0.0002816525,0.001229101,0.0010071093,0.0013426264,0.000016069616,0.00003394746,0.000028741628,0.0045251744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343526,0.00071392633,0.002286034,0.00064814405,0.00262754,0.0002890754],"domain_scores_gemma":[0.98764426,0.004105844,0.003074195,0.001015313,0.0038554,0.00030500942],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009279593,0.00039824093,0.0007087665,0.001404074,0.00010013771,0.0006601475,0.0040533254,0.00037817567,0.0032046833],"category_scores_gemma":[0.0077320836,0.00032153496,0.0007040608,0.00030960375,0.00039880633,0.0008322812,0.0008358994,0.0016592412,0.00044068793],"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.0016424512,0.0003597749,0.0002283232,0.000017884102,0.0004462027,0.0002112922,0.004318378,0.0053338376,0.0006455074,0.87188435,0.0008714378,0.11404055],"study_design_scores_gemma":[0.00054082385,0.0001087841,0.006308808,0.0005544421,0.00010254214,0.00034423827,0.0017049604,0.00048068952,0.0007938547,0.982609,0.0061677243,0.0002841523],"about_ca_topic_score_codex":0.000009581876,"about_ca_topic_score_gemma":0.0000049516584,"teacher_disagreement_score":0.1586032,"about_ca_system_score_codex":0.00031957807,"about_ca_system_score_gemma":0.0008305253,"threshold_uncertainty_score":0.99992365},"labels":[],"label_agreement":null},{"id":"W4205202743","doi":"10.1007/s00182-015-0489-3","title":"Building Nim","year":2015,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Security token; Simple (philosophy); State (computer science); Sequential game; Extensive-form game; Repeated game; Stack (abstract data type); Combinatorial game theory","score_opus":0.047897129096536234,"score_gpt":0.3434468646214678,"score_spread":0.2955497355249316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205202743","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.062272877,0.00028473797,0.9271461,0.0018938518,0.0036088307,0.000023965367,6.120403e-7,0.00003040813,0.0047386177],"genre_scores_gemma":[0.95208913,0.000013772571,0.046499938,0.0004961025,0.00064023974,5.7140795e-7,9.3175714e-8,0.0000064448354,0.00025370784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985396,0.00011917829,0.00040195862,0.000105196785,0.00070471765,0.00012932756],"domain_scores_gemma":[0.99818283,0.00023730696,0.0003247737,0.00016973149,0.00094888255,0.00013646169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015563548,0.00008030967,0.00012114087,0.00023009095,0.000014654467,0.0001626185,0.002097329,0.000034387762,0.000032139793],"category_scores_gemma":[0.00075453904,0.00006696536,0.000098334036,0.00011004183,0.00007259312,0.0008091807,0.00022376684,0.00017645722,0.000103913946],"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.000078908626,0.0000588051,0.00025305452,6.45183e-7,0.00007628215,0.00018791128,0.0017448382,0.0012450254,0.0013435986,0.7938213,0.0012692544,0.19992039],"study_design_scores_gemma":[0.00018827744,0.00013696821,0.00014661525,0.000051248986,0.000005869833,0.00062333944,0.0002408506,0.0039411327,0.023769213,0.9477659,0.023015916,0.00011465326],"about_ca_topic_score_codex":0.0000043909217,"about_ca_topic_score_gemma":6.8041936e-7,"teacher_disagreement_score":0.8898163,"about_ca_system_score_codex":0.0001265799,"about_ca_system_score_gemma":0.00016485919,"threshold_uncertainty_score":0.38973936},"labels":[],"label_agreement":null},{"id":"W4313372258","doi":"10.1007/s00182-022-00815-2","title":"Trilateral escalation in the dollar auction","year":2022,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Rivalry; Bidding; Economics; Liberian dollar; Microeconomics; Mathematical economics; Finance","score_opus":0.021403204831441612,"score_gpt":0.22454674601618457,"score_spread":0.20314354118474295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313372258","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.97080404,0.0007216461,0.009403052,0.0031029186,0.0030843846,0.000082563456,0.000052286512,0.0000051975267,0.0127439],"genre_scores_gemma":[0.99843514,0.000059186605,0.00006823108,0.00054656167,0.00033926673,0.0000052995115,0.0000047811086,0.000007299004,0.00053424825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991118,0.00008401563,0.000562704,0.00008613929,0.000069123525,0.00008626355],"domain_scores_gemma":[0.9992548,0.00010001168,0.00050286076,0.000089891466,0.000035811034,0.00001657869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026097342,0.000056042492,0.00014154334,0.00025179386,0.00004406353,0.000048072732,0.00047426473,0.000020041272,0.0007961215],"category_scores_gemma":[0.000060822815,0.000050884766,0.000111966496,0.0000714008,0.000026692493,0.0002352079,0.00005354093,0.00022036707,0.00002417128],"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.00030024536,0.00008160014,0.0025774236,0.0000010079755,0.00005709519,0.000018220537,0.002867731,0.012852054,0.000016785985,0.97850984,0.00027758605,0.0024404114],"study_design_scores_gemma":[0.00083965866,0.00010170681,0.006549882,0.0000048036172,0.0000034380248,0.00020542539,0.00092167826,0.0012423067,0.000019854238,0.9327318,0.05730096,0.00007845473],"about_ca_topic_score_codex":0.000017359456,"about_ca_topic_score_gemma":0.000002289525,"teacher_disagreement_score":0.057023373,"about_ca_system_score_codex":0.0001910066,"about_ca_system_score_gemma":0.000017760009,"threshold_uncertainty_score":0.8716972},"labels":[],"label_agreement":null},{"id":"W4379881933","doi":"10.1007/s00182-023-00862-3","title":"Cheating robot games","year":2023,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Vancouver Island University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial game theory; Mathematics; Vertex (graph theory); Combinatorics; Bipartite graph; Game tree; Repeated game; Computer science; Discrete mathematics; Graph; Game theory; Mathematical economics","score_opus":0.03239836443435306,"score_gpt":0.3268333627425049,"score_spread":0.29443499830815184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379881933","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.13261066,0.00023950511,0.8498007,0.0054266816,0.0050105504,0.000060003797,0.0000020769037,0.00018382058,0.0066660065],"genre_scores_gemma":[0.99051356,0.000076371914,0.0074363174,0.0004144087,0.0006345308,0.0000016306545,6.068193e-7,0.000010276405,0.00091228925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998386,0.00012097215,0.0004951316,0.00013764539,0.00067133486,0.0001888819],"domain_scores_gemma":[0.99827784,0.0005744236,0.00034645834,0.00019443169,0.0005297333,0.000077099765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015111355,0.00009712383,0.00014779087,0.0003990001,0.00003415514,0.00018187535,0.0019840947,0.000040480238,0.000089735826],"category_scores_gemma":[0.00072865025,0.00008283969,0.0001450626,0.00030351462,0.000080193015,0.0006679363,0.00027611273,0.00020847222,0.0003806257],"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.000068070585,0.00006867126,0.0009066245,0.000003880838,0.00018484105,0.00044588925,0.0046299486,0.0072840834,0.008379752,0.36331022,0.001974443,0.6127436],"study_design_scores_gemma":[0.0003093619,0.00020963633,0.004943174,0.0002266438,0.000014352926,0.00063769566,0.0011197858,0.034774713,0.06066435,0.88427645,0.012510128,0.00031370533],"about_ca_topic_score_codex":0.0000036359413,"about_ca_topic_score_gemma":0.0000010197807,"teacher_disagreement_score":0.8579029,"about_ca_system_score_codex":0.00007353518,"about_ca_system_score_gemma":0.00009292531,"threshold_uncertainty_score":0.48923},"labels":[],"label_agreement":null},{"id":"W4396661433","doi":"10.1007/s00182-024-00896-1","title":"Stable source connection and assignment problems as multi-period shortest path problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"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 Windsor","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Period (music); Connection (principal bundle); Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematics; Computer science; K shortest path routing; Mathematical optimization; Combinatorics; Computer network; Physics; Graph; Geometry","score_opus":0.020033509547972585,"score_gpt":0.2676365030996414,"score_spread":0.2476029935516688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396661433","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.020851616,0.0023896333,0.97205,0.0015189304,0.0020974553,0.00012120915,0.000005873672,0.00008104964,0.0008842268],"genre_scores_gemma":[0.99106175,0.00018450129,0.0073855403,0.00018401825,0.00028962782,0.0000068298123,0.000001585714,0.000013027282,0.00087313954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985356,0.000115820614,0.00039899157,0.00022878617,0.0005539177,0.00016688452],"domain_scores_gemma":[0.99914694,0.0002017324,0.00016854292,0.000137049,0.00024439747,0.00010132779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429978,0.00013610185,0.00015814175,0.000273465,0.00006366226,0.000619324,0.0006889273,0.000045887966,0.000074101416],"category_scores_gemma":[0.00007579373,0.000111678964,0.000106792046,0.00015313849,0.00009915161,0.0007356194,0.00020552182,0.00030711805,0.0000200842],"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.00008098283,0.0005104062,0.00064809003,0.000062337975,0.0007175616,0.0004624044,0.010050985,0.007526119,0.006404271,0.520007,0.0004767576,0.4530531],"study_design_scores_gemma":[0.0014806519,0.0009629507,0.0013240259,0.0014689317,0.000054906814,0.0060605905,0.0007410685,0.3107239,0.0021186639,0.5992131,0.0753188,0.00053237565],"about_ca_topic_score_codex":0.000015320333,"about_ca_topic_score_gemma":0.0000040789632,"teacher_disagreement_score":0.97021013,"about_ca_system_score_codex":0.000105855586,"about_ca_system_score_gemma":0.00011353141,"threshold_uncertainty_score":0.59721553},"labels":[],"label_agreement":null},{"id":"W4403913874","doi":"10.1007/s00182-024-00919-x","title":"A complete solution for the partisan chocolate game","year":2024,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa","keywords":"Mathematical economics; Sequential game; Economics; Game theory; Advertising; Mathematics; Computer science; Business","score_opus":0.05035097164405101,"score_gpt":0.2714434690468612,"score_spread":0.22109249740281017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403913874","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.041992173,0.014221633,0.91359556,0.0112129245,0.009636905,0.00031938896,0.0005676816,0.000035188314,0.008418551],"genre_scores_gemma":[0.99604416,0.0004499145,0.0003374447,0.00041249226,0.0010912273,0.000014754445,0.000004793387,0.00001944314,0.0016257836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990517,0.00001759051,0.0006127578,0.00013115973,0.000042202355,0.00014457847],"domain_scores_gemma":[0.99897575,0.00044448758,0.00033305254,0.00011476274,0.00008962489,0.000042332387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015879232,0.00008831301,0.00019540795,0.00015670875,0.00003717914,0.00018327225,0.00045578802,0.000040369952,0.00038958905],"category_scores_gemma":[0.0001158358,0.0000707988,0.00026846997,0.000040318257,0.00007958149,0.0002887251,0.000045366476,0.00015443654,0.00014266348],"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.00017460853,0.00001943806,0.00006317924,0.000007607597,0.00039409506,0.000006323255,0.0007274418,0.0006363677,0.000089805035,0.9826184,0.0013168452,0.013945887],"study_design_scores_gemma":[0.00033161842,0.000058609232,0.00023512614,0.000036963564,0.000013410059,0.00005988376,0.000049852715,0.024191473,0.000028439965,0.6330706,0.3418528,0.00007119701],"about_ca_topic_score_codex":0.000011022663,"about_ca_topic_score_gemma":0.0000034636305,"teacher_disagreement_score":0.954052,"about_ca_system_score_codex":0.00013252246,"about_ca_system_score_gemma":0.00003308078,"threshold_uncertainty_score":0.42657268},"labels":[],"label_agreement":null}]}