{"meta":{"query_hash":"b5ca8b9a6e48","filters":{"topic":"Game Theory and Applications"},"cohort_total":675,"direct_labels_cover":0,"predictions_cover":675,"exported":675,"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/b5ca8b9a6e48","api":"https://metacan.xera.ac/api/v1/cohort?topic=Game+Theory+and+Applications"},"results":[{"id":"W107916717","doi":"10.1007/978-90-481-9097-3_13","title":"Conflict Analysis Methods: The Graph Model for Conflict Resolution","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in group decision and negotiation/Advances in group decision and negotation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":34,"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 Waterloo; Wilfrid Laurier University","funders":"","keywords":"Conflict resolution; Conflict analysis; Management science; Computer science; Operations research; Graph; Engineering; Theoretical computer science; Sociology; Social science","score_opus":0.06587152426544463,"score_gpt":0.42541142276411686,"score_spread":0.35953989849867224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107916717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026388066,0.04288085,0.94356894,0.00037135964,0.0009392305,0.0021595561,0.00019791927,0.00007671542,0.0071665994],"genre_scores_gemma":[0.19669484,0.27287596,0.50799704,0.002530083,0.0006740073,0.001637172,0.0008359456,0.0003130424,0.016441926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909131,0.0004689934,0.0034425887,0.0024927107,0.0020021484,0.00068047515],"domain_scores_gemma":[0.9707564,0.024606971,0.001941622,0.0016713489,0.00071382674,0.0003098358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009363602,0.0009568117,0.0017208318,0.0030485264,0.0009781361,0.0006013822,0.0013583099,0.00090802385,0.00021138327],"category_scores_gemma":[0.004348716,0.00070329465,0.0005963088,0.0020112994,0.0009416306,0.0028057485,0.00037754947,0.0012298024,0.000034082306],"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.00081996206,0.000083124185,0.00032851144,0.00001913753,0.000043832137,0.000002657844,0.000801522,0.012957431,0.00015579887,0.3163097,0.00010267999,0.6683756],"study_design_scores_gemma":[0.0015203942,0.00013001713,0.0018179569,0.00014983611,0.00018432368,0.000010436976,0.00030413028,0.13300546,0.000020223633,0.63901055,0.22327462,0.00057206606],"about_ca_topic_score_codex":0.0000142338395,"about_ca_topic_score_gemma":0.003688562,"teacher_disagreement_score":0.6678036,"about_ca_system_score_codex":0.00014461647,"about_ca_system_score_gemma":0.00006877161,"threshold_uncertainty_score":0.9995418},"labels":[],"label_agreement":null},{"id":"W1141974438","doi":"10.1017/cbo9780511609909.006","title":"Game theory","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"University of Manitoba","funders":"","keywords":"Talmud; Game theory; Darwin (ADL); Philosophy; Epistemology; Literature; Computer science; Art; Judaism; Mathematical economics; Mathematics; Theology","score_opus":0.0749801950949118,"score_gpt":0.28110610405083464,"score_spread":0.20612590895592284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1141974438","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009850345,0.00009355555,0.0027097352,0.00004533717,0.0001274248,0.00032750273,0.00023946392,0.00014598304,0.9962125],"genre_scores_gemma":[0.006120323,0.000028450571,0.000073495976,0.00022541621,0.00013855741,5.2637404e-7,0.000021548429,0.000025748788,0.99336594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976945,0.00016193095,0.00034619923,0.00077735755,0.0007476786,0.00027232326],"domain_scores_gemma":[0.99680364,0.0007759773,0.00039187333,0.0014890175,0.00030905547,0.00023044045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010165788,0.0003430802,0.00047192088,0.00031475478,0.00023653635,0.00013089685,0.0018317355,0.00036099638,0.00007203028],"category_scores_gemma":[0.00008916016,0.00033155247,0.00036431637,0.000022802875,0.00046253196,0.000117155076,0.0003803554,0.0004925907,0.00067477004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006847392,0.000008211973,2.6067883e-7,0.0000031469028,0.000031169086,0.00006419517,0.00004124087,0.0000031848947,0.000018857485,0.9262101,0.03239775,0.04115342],"study_design_scores_gemma":[0.00022582458,0.00003355968,0.000019606578,0.000041078347,0.00009582511,0.000013848243,0.000054726253,0.000012392401,0.00014648674,0.03661932,0.96239614,0.00034120245],"about_ca_topic_score_codex":0.0000057685725,"about_ca_topic_score_gemma":5.522064e-7,"teacher_disagreement_score":0.9299984,"about_ca_system_score_codex":0.00008823286,"about_ca_system_score_gemma":0.0001004864,"threshold_uncertainty_score":0.99991363},"labels":[],"label_agreement":null},{"id":"W116446403","doi":"","title":"CHARACTERIZING CONSISTENCY WITH MONOMIALS (PRELIMINARY VERSION)","year":2006,"lang":"en","type":"article","venue":"","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":"Monomial; Characterization (materials science); Consistency (knowledge bases); Mathematical proof; Fallacy; Mathematics; Mathematical economics; Algebra over a field; Discrete mathematics; Pure mathematics; Epistemology; Philosophy","score_opus":0.04996289161775291,"score_gpt":0.3135401086958154,"score_spread":0.2635772170780625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116446403","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.77007174,0.000015284037,0.0027871528,0.001909183,0.00004240295,0.00011066833,0.0000070776628,0.000054952314,0.2250015],"genre_scores_gemma":[0.98238796,8.7129604e-7,0.0018866761,0.00033978032,0.00005587973,0.000015121825,0.000005206213,0.000004895144,0.015303587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989484,0.00005776708,0.00028801963,0.00026719287,0.00030269165,0.00013591886],"domain_scores_gemma":[0.99871397,0.00060063635,0.00011030224,0.00042798326,0.00009861227,0.000048516657],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006650388,0.00007751133,0.000137223,0.00008105226,0.00019305099,0.00010940648,0.00031177726,0.000030278727,0.0020719618],"category_scores_gemma":[0.00008021231,0.000047971484,0.00004374293,0.00028433144,0.00010449533,0.00022834355,0.000053983516,0.000047750178,0.0029013867],"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.00052512786,0.0004119728,0.025223857,0.0000047736985,0.000023278802,0.000029413495,0.00034562347,0.0002440112,0.06318096,0.80424154,0.06492345,0.04084599],"study_design_scores_gemma":[0.001110385,0.00040005558,0.35941494,0.000027583394,0.00004115602,0.000088513225,0.003172464,0.00057612744,0.044377636,0.25039053,0.33980748,0.00059311755],"about_ca_topic_score_codex":0.00003100922,"about_ca_topic_score_gemma":0.000008753318,"teacher_disagreement_score":0.553851,"about_ca_system_score_codex":0.000009721433,"about_ca_system_score_gemma":0.000029987312,"threshold_uncertainty_score":0.9988403},"labels":[],"label_agreement":null},{"id":"W134861336","doi":"","title":"On The Trees Whose 2-Step Competition Numbers Are Two.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Biology; Ecology","score_opus":0.04567934963282414,"score_gpt":0.3360517443376116,"score_spread":0.29037239470478743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134861336","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.9378834,0.000024035224,0.000092580965,0.010746332,0.00049394567,0.00019499929,0.000010556526,0.00006623018,0.050487965],"genre_scores_gemma":[0.9959232,0.0000034545744,0.00007607054,0.0012311861,0.000028952527,0.000040540137,0.0000030459182,0.0000096282665,0.002683898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982549,0.00026831627,0.00030905468,0.00031167187,0.0006623314,0.00019374056],"domain_scores_gemma":[0.9966812,0.002090342,0.00018666798,0.00082447036,0.00013404875,0.00008323254],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014053887,0.00012335049,0.00015883677,0.00006947964,0.00037465958,0.00017588308,0.0007860488,0.00004452761,0.0012198034],"category_scores_gemma":[0.0006410178,0.00007734187,0.00009583923,0.00051442074,0.0001522579,0.00017259853,0.00007350649,0.00017750732,0.005702883],"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.0000129221025,0.000115278366,0.0006174923,2.7872701e-7,0.00000525873,9.24924e-7,0.00018067728,0.00010755967,0.000109848836,0.9693343,0.026211485,0.0033039676],"study_design_scores_gemma":[0.0003936417,0.000031357475,0.0053253705,0.000012815062,0.0000060042516,0.0000028851196,0.00064880686,0.00046740464,0.00069220725,0.92735827,0.06495627,0.00010499249],"about_ca_topic_score_codex":0.000010732894,"about_ca_topic_score_gemma":0.00007579518,"teacher_disagreement_score":0.058039866,"about_ca_system_score_codex":0.000039726074,"about_ca_system_score_gemma":0.000019132865,"threshold_uncertainty_score":0.9996932},"labels":[],"label_agreement":null},{"id":"W1428174065","doi":"10.1016/j.orl.2015.07.006","title":"Approximated cooperative equilibria for games played over event trees","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Saint Petersburg State University","keywords":"Stochastic game; Mathematical economics; Event (particle physics); Focus (optics); Class (philosophy); Tree (set theory); Mathematics; Event horizon; Computer science; Horizon; Mathematical optimization; Combinatorics; Artificial intelligence; Physics","score_opus":0.3516116309144722,"score_gpt":0.5185068786424022,"score_spread":0.16689524772793002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1428174065","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.91373104,0.000046689365,0.057667073,0.02419996,0.00012739703,0.0014893234,0.00015426318,0.00006007363,0.002524169],"genre_scores_gemma":[0.9876675,0.0000030063136,0.0030191655,0.0008658458,0.00018226453,0.0010368814,0.00008286057,0.000020345038,0.007122142],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960341,0.00087905966,0.00051105977,0.0005834675,0.0014977054,0.0004946471],"domain_scores_gemma":[0.9958686,0.0016545665,0.00003751459,0.00079953874,0.001343294,0.0002964382],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0069168424,0.00014656875,0.00022949459,0.00039962423,0.000687031,0.00094197824,0.00091056334,0.000065016415,0.0005026068],"category_scores_gemma":[0.005637359,0.00010756418,0.000093229464,0.0013638498,0.0004303173,0.0006456567,0.00019124664,0.00025010973,0.00080679625],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028341296,0.000314786,0.0002645599,0.000003971128,0.00006122783,0.000004752168,0.004136531,0.07765722,0.27841216,0.12013157,0.5153308,0.003399035],"study_design_scores_gemma":[0.0041137612,0.0007087083,0.0022884498,0.00004106827,0.000025228974,0.000015380616,0.009352952,0.60276884,0.036144875,0.033703674,0.31005308,0.00078397687],"about_ca_topic_score_codex":0.00006815756,"about_ca_topic_score_gemma":0.00023270462,"teacher_disagreement_score":0.5251116,"about_ca_system_score_codex":0.0001181077,"about_ca_system_score_gemma":0.00030677044,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W146436045","doi":"10.1007/978-3-642-45046-4_2","title":"Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Nash equilibrium; Conjecture; Combinatorics; Mathematics; Stochastic game; Cardinality (data modeling); Best response; Mathematical economics; Bipartite graph; Epsilon-equilibrium; Correctness; Discrete mathematics; Risk dominance; Graph; Computer science; Algorithm","score_opus":0.05271743398532542,"score_gpt":0.3217263007987142,"score_spread":0.2690088668133888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146436045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026044133,0.0001332866,0.9821917,0.0021729136,0.0014811511,0.0018784442,0.000112120724,0.00016590183,0.009260114],"genre_scores_gemma":[0.7493806,0.0000252254,0.21271583,0.0037812314,0.0015388145,0.00033514365,0.00012399748,0.0001757405,0.031923436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993415,0.00007123026,0.0013336556,0.0023629502,0.0018316706,0.0009854755],"domain_scores_gemma":[0.99318814,0.0022633143,0.0010678094,0.002369026,0.0007699869,0.00034174995],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0036962023,0.0006626353,0.0009621832,0.0010533549,0.0005061921,0.0009937354,0.004024469,0.0005171381,0.001358289],"category_scores_gemma":[0.0008242351,0.0005285979,0.00032269853,0.0009080544,0.0015821061,0.0006693698,0.0010324902,0.00060018327,0.0008804423],"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.00009703548,0.00017408651,0.0003307057,0.00009659135,0.000056698325,0.0000856965,0.0011697978,0.0051602544,0.0054563857,0.08514551,0.007360015,0.89486724],"study_design_scores_gemma":[0.0003847292,0.00011397937,0.0002069874,0.0001612477,0.000022265118,0.000069914,0.00000243627,0.09490998,0.0020847933,0.88094646,0.02036192,0.000735295],"about_ca_topic_score_codex":0.000011806294,"about_ca_topic_score_gemma":0.00004475628,"teacher_disagreement_score":0.8941319,"about_ca_system_score_codex":0.00015501602,"about_ca_system_score_gemma":0.0005160696,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W1480523909","doi":"10.1002/9780470400531.eorms0739","title":"Saddlepoints and <scp>von</scp> <scp>N</scp> eumann Minimax Theorem","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","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":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Minimax; Section (typography); Computer science; Mathematics; Mathematical economics","score_opus":0.08170557980113678,"score_gpt":0.3797936999561272,"score_spread":0.2980881201549904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480523909","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012554107,0.001485813,0.001479458,0.00014964836,0.00024006098,0.0016857425,0.00012948975,0.0000789098,0.98219675],"genre_scores_gemma":[0.011804892,0.022471268,0.0067822365,0.000087568296,0.00017186455,0.0003888504,0.00002325704,0.0001030962,0.95816696],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99319714,0.00038357358,0.00079765415,0.0016659731,0.0029777356,0.0009779147],"domain_scores_gemma":[0.99494094,0.0018460213,0.00023199107,0.0017519209,0.0006397949,0.0005893352],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008511529,0.00039646533,0.0005234307,0.002657276,0.0011830057,0.00088186644,0.002792851,0.00018506128,0.0006960797],"category_scores_gemma":[0.0057408423,0.00030855412,0.00007904051,0.0032590956,0.0052998737,0.000741258,0.0018755809,0.00045450663,0.00091784605],"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.0000030571043,0.00026442469,0.00044362136,0.0000835962,0.000047179146,0.000013621151,0.0020782975,0.000011897087,0.00014539495,0.30543616,0.66969776,0.021774966],"study_design_scores_gemma":[0.0003212514,0.00019960894,0.0023837269,0.0002085892,0.000028525024,0.000008718802,0.0058865496,0.0002836949,0.00014414673,0.038907494,0.95152146,0.000106264255],"about_ca_topic_score_codex":0.00018299917,"about_ca_topic_score_gemma":0.00031089806,"teacher_disagreement_score":0.28182366,"about_ca_system_score_codex":0.000040312847,"about_ca_system_score_gemma":0.00025962788,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W1481805678","doi":"10.1002/9780470061794.ch13","title":"Game Theoretic Activation and Transmission Scheduling in Unattended Ground Sensor Networks: A Correlated Equilibrium Approach","year":2007,"lang":"en","type":"other","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scheduling (production processes); Wireless sensor network; Computer science; Transmission (telecommunications); Game theory; Mathematical optimization; Real-time computing; Computer network; Mathematical economics; Mathematics; Telecommunications","score_opus":0.05357579340477552,"score_gpt":0.33703186022321935,"score_spread":0.2834560668184438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481805678","genre_codex":"methods","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.0056177615,0.0002283728,0.5394973,0.00012368769,0.00007008603,0.0005581938,0.0000032542655,0.0001469511,0.45375437],"genre_scores_gemma":[0.5968897,0.00007208351,0.008284336,0.0002148051,0.00016169412,0.000032653497,0.000061026873,0.00020684455,0.39407688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972375,0.00031405274,0.000643621,0.00082084327,0.0006240696,0.0003599102],"domain_scores_gemma":[0.99792296,0.000977064,0.00032612428,0.00056414533,0.00006204701,0.00014767684],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002409495,0.00031952723,0.00046605707,0.00095976196,0.000052081345,0.00017753708,0.00043528542,0.00060255843,0.002389368],"category_scores_gemma":[0.0001745558,0.00023004219,0.00008412639,0.0014480754,0.00027660903,0.00013068524,0.00007059005,0.00051105686,0.00010664818],"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.0010198723,0.0013620752,0.0011273108,0.00024061519,0.00022652777,0.00003361882,0.0031943775,0.040531956,0.0040693735,0.6711195,0.025329378,0.25174537],"study_design_scores_gemma":[0.0028026488,0.00011344156,0.0014194942,0.00089555647,0.00009171654,0.0000687318,0.0039924677,0.6983931,0.00041078927,0.21440563,0.07579981,0.0016066065],"about_ca_topic_score_codex":0.00004146279,"about_ca_topic_score_gemma":0.0000054378597,"teacher_disagreement_score":0.6578612,"about_ca_system_score_codex":0.0000336505,"about_ca_system_score_gemma":0.00003762123,"threshold_uncertainty_score":0.9985226},"labels":[],"label_agreement":null},{"id":"W1483563252","doi":"10.22201/cimsur.18704115e.2010.9.158","title":"Comportamiento de elección y no coordinación en un entorno de información global y local: un enfoque computacional","year":2010,"lang":"es","type":"article","venue":"Revista Pueblos y fronteras digital","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Von Neumann architecture; Microfoundations; Humanities; Welfare economics; Computer science; Economics; Philosophy","score_opus":0.00894449809834107,"score_gpt":0.30572172730214586,"score_spread":0.2967772292038048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483563252","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.91268414,0.00035515014,0.05986971,0.0008208384,0.0006803841,0.00082564534,0.0028276525,0.00019036653,0.021746099],"genre_scores_gemma":[0.9946258,0.000057148107,0.001991314,0.000823148,0.00069624174,0.00006636461,0.00036685288,0.00005728265,0.0013158186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938743,0.00025809938,0.0018526026,0.0011328094,0.0014765383,0.0014056476],"domain_scores_gemma":[0.9947675,0.0011405916,0.00078418845,0.0014884677,0.0006704921,0.0011487749],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019751508,0.00083889253,0.001014146,0.00022869569,0.00053241994,0.0038416472,0.0026665,0.00049803633,0.00244685],"category_scores_gemma":[0.0011266987,0.0007766785,0.00067420985,0.0010436825,0.00092551543,0.0014075614,0.0007327017,0.0010351042,0.0045365663],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003916169,0.0013763005,0.26706,0.00012428313,0.00034006216,0.00014776096,0.0005944852,0.00016883039,0.0009778069,0.5564748,0.012024364,0.16031969],"study_design_scores_gemma":[0.00182145,0.0003182879,0.06177597,0.0002465937,0.00015990503,0.0008424434,0.0004110904,0.008047244,0.00069896184,0.03479002,0.8895581,0.0013299364],"about_ca_topic_score_codex":0.000059807986,"about_ca_topic_score_gemma":0.00001903551,"teacher_disagreement_score":0.87753373,"about_ca_system_score_codex":0.0005234803,"about_ca_system_score_gemma":0.00075231644,"threshold_uncertainty_score":0.99946845},"labels":[],"label_agreement":null},{"id":"W1490582271","doi":"10.1609/aaai.v24i1.7623","title":"An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Hypercube; Subgame perfect equilibrium; Discounting; Set (abstract data type); Stochastic game; Mathematical optimization; Computer science; Computation; Integer (computer science); Point (geometry); Mathematical economics; Mathematics; Algorithm; Nash equilibrium; Parallel computing","score_opus":0.15214642404434298,"score_gpt":0.40870097926832477,"score_spread":0.2565545552239818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490582271","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.89590484,0.0000027498243,0.093541026,0.0018898213,0.00032492465,0.0015761118,0.000033778568,0.000121646044,0.0066050873],"genre_scores_gemma":[0.99305606,0.0000015205643,0.006177295,0.000090791305,0.00009099471,0.00026812192,0.000003027886,0.000018810757,0.00029339077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99747235,0.00004141255,0.0008616331,0.0006665817,0.0006455121,0.00031251617],"domain_scores_gemma":[0.9964354,0.00056271395,0.0006599757,0.00049588474,0.0017289172,0.00011711351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033700347,0.00021730062,0.00031444008,0.00020028133,0.00025457743,0.000411814,0.00192765,0.00014822555,0.00016914959],"category_scores_gemma":[0.0027165157,0.0001474073,0.00016189508,0.0008661939,0.0005641984,0.00044209906,0.00013303915,0.00035782286,0.000077461475],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097694945,0.000109983615,0.0001078562,0.000008575683,0.0000034375023,3.309566e-8,0.00037496668,0.000054197906,0.6225063,0.3514444,0.00009027023,0.025202299],"study_design_scores_gemma":[0.000014962619,0.00013277556,0.00009597114,0.000021903445,0.000007650236,0.0000028743762,0.000463717,0.027496375,0.5388041,0.4327681,0.000087289955,0.0001042719],"about_ca_topic_score_codex":0.0000137319175,"about_ca_topic_score_gemma":0.0000119719325,"teacher_disagreement_score":0.09715119,"about_ca_system_score_codex":0.000014869101,"about_ca_system_score_gemma":0.00008113711,"threshold_uncertainty_score":0.60110956},"labels":[],"label_agreement":null},{"id":"W14935104","doi":"10.1007/978-3-642-35582-0_9","title":"Learning Correlated Equilibria in Noncooperative Games with Cluster Structure","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Cluster (spacecraft); Mathematical economics; Computer science; Statistical physics; Economics; Physics","score_opus":0.036659301440707226,"score_gpt":0.28779658546780273,"score_spread":0.2511372840270955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14935104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029432092,0.000627967,0.96021944,0.001412339,0.000477213,0.0013440754,0.00014766652,0.00006778897,0.006271443],"genre_scores_gemma":[0.5512778,0.000045836063,0.4478718,0.00015905849,0.00013659768,0.00002565518,0.000051080522,0.000023821634,0.00040836193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845177,0.000034253055,0.00073740026,0.00016858724,0.0003800031,0.00022795868],"domain_scores_gemma":[0.99760914,0.0010363368,0.0005702824,0.00050009205,0.00023532771,0.00004880152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008309592,0.00025747588,0.0004160239,0.00027157684,0.00065446337,0.00022325158,0.0014117298,0.00021982599,0.000010002153],"category_scores_gemma":[0.00019997948,0.00016464911,0.00011107427,0.0004272234,0.00062553387,0.0004092414,0.0005045893,0.0006614186,0.0000019610804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063777406,0.00000822669,0.000040358864,0.000025875628,0.000033657863,3.188183e-8,0.0040011043,0.9523705,0.000023896153,0.027514486,0.000027912192,0.015947534],"study_design_scores_gemma":[0.0006188602,0.00015933083,0.0003691996,0.00035842558,0.00008158516,0.000026879963,0.000086274915,0.93347174,0.00014364076,0.008494944,0.055612482,0.0005766292],"about_ca_topic_score_codex":0.0000131932875,"about_ca_topic_score_gemma":0.00016629818,"teacher_disagreement_score":0.5218457,"about_ca_system_score_codex":0.00004881377,"about_ca_system_score_gemma":0.00013722137,"threshold_uncertainty_score":0.6714196},"labels":[],"label_agreement":null},{"id":"W1496781821","doi":"10.1109/icsmc.2002.1175662","title":"Dynamic conflict analysis by integrating value-focused thinking and the graph model for conflict resolution","year":2003,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Premise; Conflict resolution; Decision maker; Conflict analysis; Value (mathematics); Frame (networking); Computer science; Preference; Management science; Graph; Resolution (logic); Operations research; Artificial intelligence; Mathematics; Epistemology; Machine learning; Engineering; Sociology; Economics; Microeconomics; Theoretical computer science; Social science","score_opus":0.07408416623150131,"score_gpt":0.3662438927377253,"score_spread":0.29215972650622396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496781821","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.06121909,0.00026741435,0.92801726,0.0014449386,0.00002235986,0.00044124553,0.00002931203,0.000046822828,0.008511583],"genre_scores_gemma":[0.97653973,0.000025794729,0.017447636,0.000643223,0.0000044973985,0.00009517131,0.00001040274,0.000007979774,0.0052255397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799925,0.00036352486,0.0005204516,0.00043413832,0.00046654625,0.00021608299],"domain_scores_gemma":[0.9959265,0.003023969,0.000228109,0.00055312226,0.0002003333,0.00006794308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006873264,0.00013873445,0.00031344054,0.00020490655,0.0006783972,0.00033959234,0.00045679876,0.00006987303,0.0000667202],"category_scores_gemma":[0.0015842296,0.00007489261,0.00023482497,0.0011591525,0.0003274521,0.00016795601,0.000041734555,0.00012549508,0.000009840949],"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.00003692729,0.000016467235,0.00010749689,8.7819285e-7,0.00008705678,3.3750485e-8,0.0019042548,0.010319692,0.00056571193,0.98457307,0.0007999423,0.0015884697],"study_design_scores_gemma":[0.0004857782,0.000008487549,0.00003506771,0.0000018649746,0.0001278421,7.44482e-7,0.0010236531,0.65507585,0.00013879492,0.34109083,0.0019363271,0.00007475083],"about_ca_topic_score_codex":0.000051793326,"about_ca_topic_score_gemma":0.0001108557,"teacher_disagreement_score":0.9153207,"about_ca_system_score_codex":0.000016517562,"about_ca_system_score_gemma":0.000027326587,"threshold_uncertainty_score":0.5217751},"labels":[],"label_agreement":null},{"id":"W1500428599","doi":"10.1109/sfcs.2005.68","title":"Sink Equilibria and Convergence","year":2005,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":229,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inefficiency; Mathematical optimization; Mathematics; Mathematical economics; Vertex (graph theory); Graph; Computer science; Combinatorics; Economics; Microeconomics","score_opus":0.12092047808182765,"score_gpt":0.4106595465523904,"score_spread":0.28973906847056274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500428599","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.8759703,0.00004681314,0.0074665667,0.0051254653,0.000034069864,0.000046939083,0.0000015908513,0.000032813063,0.11127543],"genre_scores_gemma":[0.9714476,0.000004089419,0.0021383576,0.00056017877,0.000042913358,0.0000028767238,1.8478919e-7,0.0000014875372,0.025802309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939233,0.000028233186,0.00014821216,0.0001643616,0.00018996037,0.00007692605],"domain_scores_gemma":[0.999278,0.00035009457,0.000027327518,0.00024447445,0.00003950259,0.000060599003],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006422696,0.000034774766,0.000056248908,0.000029334782,0.000058062946,0.00006657302,0.00021160621,0.000016909145,0.005352393],"category_scores_gemma":[0.000208543,0.000023041577,0.00001555818,0.00017510752,0.00008173812,0.00017293401,0.00006268921,0.000025992687,0.003155504],"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.0000057068155,0.000022223645,0.0029255305,3.3550526e-7,0.000001964774,2.7205175e-7,0.00023006368,0.000014463074,0.015338136,0.81267416,0.022530587,0.14625654],"study_design_scores_gemma":[0.00013203194,0.000014949187,0.012559951,0.0000011236335,0.0000025885477,0.000008979482,0.0003005159,0.0072319102,0.006884563,0.38680527,0.58595806,0.00010003278],"about_ca_topic_score_codex":0.000002067614,"about_ca_topic_score_gemma":0.000008294079,"teacher_disagreement_score":0.5634275,"about_ca_system_score_codex":0.000002357923,"about_ca_system_score_gemma":0.000008384924,"threshold_uncertainty_score":0.99762064},"labels":[],"label_agreement":null},{"id":"W1502418095","doi":"10.2139/ssrn.795388","title":"Stable Networks and Convex Payoffs","year":2005,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"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":"Regular polygon; Mathematical economics; Economics; Mathematics; Computer science; Geometry","score_opus":0.02761745776293288,"score_gpt":0.32398795396660546,"score_spread":0.29637049620367256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502418095","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.7120881,0.007876795,0.25947747,0.008734544,0.00016667083,0.00016961108,0.000002585385,0.000048900463,0.011435298],"genre_scores_gemma":[0.9867206,0.001363783,0.00014568803,0.00032006184,0.00038645347,0.0000034232182,5.049185e-7,0.000007923341,0.011051542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769855,0.00013680883,0.00034110274,0.00020847014,0.00037347432,0.0012416046],"domain_scores_gemma":[0.99904495,0.00033334157,0.00015702585,0.0002390283,0.00010658693,0.000119073135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006306652,0.000092615745,0.0001535589,0.00008487872,0.00034540237,0.00020517425,0.0004195948,0.000051990566,0.00032836554],"category_scores_gemma":[0.00019040056,0.00006568159,0.00005689593,0.0002928326,0.00008710601,0.0003024952,0.000051206032,0.0009840749,0.00023663837],"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.000025407502,0.000035607314,0.0017765403,2.1908193e-7,0.00002593759,5.8726897e-7,0.00010302694,0.0016475974,0.00014005722,0.7328183,0.0014420069,0.2619847],"study_design_scores_gemma":[0.00031045813,0.00006951434,0.00091204117,0.000002640651,0.000010989613,0.00032929913,0.0011320106,0.0036243743,0.000059297738,0.8877869,0.1056563,0.000106142994],"about_ca_topic_score_codex":0.000005000036,"about_ca_topic_score_gemma":0.00020442861,"teacher_disagreement_score":0.27463248,"about_ca_system_score_codex":0.00013046808,"about_ca_system_score_gemma":0.0004069774,"threshold_uncertainty_score":0.42753705},"labels":[],"label_agreement":null},{"id":"W1502594267","doi":"10.1023/a:1024268907844","title":"Order of Play, Forward Induction, and Presentation Effects in Two-Person Games","year":2003,"lang":"en","type":"article","venue":"Experimental Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; McMaster University","funders":"","keywords":"Iterated function; Distribution (mathematics); Observability; Contrast (vision); Presentation (obstetrics); Mathematical economics; Order (exchange); Computer science; Extensive-form game; Sequential game; Game theory; Mathematics; Economics; Artificial intelligence; Applied mathematics","score_opus":0.0507998160701484,"score_gpt":0.3732535769387899,"score_spread":0.3224537608686415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502594267","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.99088675,0.00017108621,0.0003396537,0.000069001624,0.00012511823,0.00020067951,0.0000030721844,0.000005865625,0.008198759],"genre_scores_gemma":[0.9982269,0.000007369705,0.0014048811,0.00004919541,0.00001597339,0.000040176616,0.0000019339861,0.0000056277863,0.00024793926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927455,0.000084535284,0.00025519077,0.00022574146,0.000068964495,0.0000910146],"domain_scores_gemma":[0.9993912,0.0002535149,0.00011559084,0.00017646483,0.000021679094,0.000041568877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042796688,0.000071076705,0.00014340522,0.000106956744,0.000043923013,0.000038806287,0.00010621197,0.00002696408,0.0001395462],"category_scores_gemma":[0.0001482833,0.000066259345,0.000024828138,0.00015183399,0.00009783894,0.00026091962,0.000020650983,0.000043535947,0.000031980595],"study_design_candidate":"bench_or_experimental","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.00013424817,0.0005462214,0.055134907,0.000013649377,0.00003693578,0.0000013335375,0.01852776,0.0038189348,0.08709756,0.8184271,0.0010309635,0.0152303865],"study_design_scores_gemma":[0.0021599873,0.0001375353,0.02040087,0.00001362517,0.0000056841286,0.000016538486,0.022627788,0.0014713189,0.8548359,0.095203765,0.0028791095,0.00024785762],"about_ca_topic_score_codex":0.00003151245,"about_ca_topic_score_gemma":0.000022145383,"teacher_disagreement_score":0.76773834,"about_ca_system_score_codex":0.00003328826,"about_ca_system_score_gemma":0.000020886397,"threshold_uncertainty_score":0.27019775},"labels":[],"label_agreement":null},{"id":"W1505892680","doi":"","title":"Emergence of Cooperation in ANonymous Social Networks through Social Capital","year":2010,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reciprocity (cultural anthropology); Anonymity; Social capital; Social dilemma; Enforcement; Microeconomics; Dilemma; Prisoner's dilemma; Computer science; Matching (statistics); Social network (sociolinguistics); Repeated game; Game theory; Economics; Computer security; Social psychology; Psychology; Sociology; Social media","score_opus":0.08077855648943753,"score_gpt":0.4144309429157569,"score_spread":0.33365238642631934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505892680","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.94416004,0.000007649639,0.00006822209,0.0005307803,0.00016858445,0.00022364072,0.000013250203,0.000007899921,0.054819953],"genre_scores_gemma":[0.99867207,0.0000935072,0.00020554168,0.000039274073,0.00023073335,0.00005302573,0.0000063831376,0.0000103858465,0.00068906334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979772,0.00027569846,0.00064950745,0.00040780962,0.00031246152,0.00037730768],"domain_scores_gemma":[0.998564,0.0007439734,0.00013558214,0.00032787002,0.0001810063,0.000047577327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003867259,0.00009362005,0.00024573575,0.00018282313,0.000273787,0.00007656035,0.0006652294,0.00017801762,0.0008410035],"category_scores_gemma":[0.0008487588,0.000090205845,0.000073307565,0.0005491014,0.00052762835,0.00026526846,0.00016160184,0.00063699816,0.000031176274],"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.0002522437,0.00062921754,0.020910405,0.000009982445,0.000022792661,0.000008937672,0.017346287,0.008143417,0.023432784,0.30272537,0.0015087909,0.6250098],"study_design_scores_gemma":[0.004439851,0.00047024092,0.29874635,0.000037820362,0.000014471499,0.000026415913,0.064623766,0.108663365,0.007674483,0.4623754,0.051242005,0.001685837],"about_ca_topic_score_codex":0.000050036182,"about_ca_topic_score_gemma":0.0021692046,"teacher_disagreement_score":0.6233239,"about_ca_system_score_codex":0.00003944166,"about_ca_system_score_gemma":0.00016607631,"threshold_uncertainty_score":0.92083985},"labels":[],"label_agreement":null},{"id":"W1506152160","doi":"","title":"A Decomposition of Ricardian Trade Gains under External Economies of Scale","year":2010,"lang":"en","type":"preprint","venue":"Institutional Repositories DataBase (IRDB)","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":"McGill University","funders":"","keywords":"Economics; Decomposition; Economies of scale; Representation (politics); Exposition (narrative); Returns to scale; Scale (ratio); Graph; Production (economics); Macroeconomics; Microeconomics; Computer science; Chemistry; Geography","score_opus":0.08239548771730687,"score_gpt":0.39385573962977655,"score_spread":0.3114602519124697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506152160","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.90598184,0.0003106409,0.07680267,0.0012679953,0.003231842,0.0004940155,0.0053999494,0.000054274562,0.0064567546],"genre_scores_gemma":[0.98547184,0.000043685606,0.012873008,0.00010186669,0.0007400975,0.00008944838,0.0005242009,0.000015946362,0.00013987861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579495,0.00022521058,0.0016012527,0.00085685763,0.0012693572,0.00025237765],"domain_scores_gemma":[0.9952116,0.0010056199,0.0012322232,0.0018708048,0.00047811805,0.00020162355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015193995,0.00033442493,0.0007371666,0.00037248636,0.00037137567,0.00019798815,0.0014004456,0.0003415872,0.0001329056],"category_scores_gemma":[0.000606236,0.00029869663,0.0004417215,0.00036316118,0.0014860012,0.0005631828,0.00091431226,0.0007337058,0.00004029382],"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.00042508222,0.000974447,0.008696797,0.00022971083,0.00028964726,0.000031851898,0.0008820334,0.020975972,0.18888588,0.7709604,0.0032537375,0.004394472],"study_design_scores_gemma":[0.0011271684,0.00014428301,0.12286047,0.001182295,0.00040167788,0.00040240522,0.0009579751,0.0017889532,0.33873358,0.487366,0.043762695,0.001272522],"about_ca_topic_score_codex":0.00036596938,"about_ca_topic_score_gemma":0.00018990546,"teacher_disagreement_score":0.2835944,"about_ca_system_score_codex":0.00012770189,"about_ca_system_score_gemma":0.0007721746,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W1506639511","doi":"","title":"Communication and Consensus","year":2009,"lang":"en","type":"article","venue":"2009 Meeting Papers","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":"York University","funders":"","keywords":"Cheap talk; Sobel operator; Discretion; Agency (philosophy); Plan (archaeology); Principal (computer security); Business; Control (management); Shareholder; Scale (ratio); Computer science; Marketing; Economics; Microeconomics; Political science; Artificial intelligence; Sociology; Computer security; Corporate governance; Law","score_opus":0.05842708633615124,"score_gpt":0.3623718016744469,"score_spread":0.30394471533829565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506639511","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.6287173,0.00036649543,0.000022522307,0.0074947905,0.000019453935,0.00008126846,0.0000026995033,0.0000530623,0.3632424],"genre_scores_gemma":[0.9945957,0.000025992556,0.0023197127,0.0011274995,0.000016159742,0.0000023099165,0.000001255005,0.0000025119537,0.001908833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990832,0.00015606382,0.00022831734,0.00018439112,0.00023474779,0.00011324222],"domain_scores_gemma":[0.9984586,0.0008638306,0.000098237106,0.00045635586,0.000059702248,0.00006327332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927574,0.00006042674,0.00009560099,0.000050693165,0.0002410151,0.000089345165,0.00027548452,0.00003406536,0.00010600301],"category_scores_gemma":[0.0010839332,0.000047542177,0.000026780684,0.00023480003,0.00010851506,0.000033378088,0.000028754837,0.00007564611,0.00014897608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049129918,0.00011507617,0.0040667625,0.0000018863668,0.000010736222,0.0000031086643,0.0024590858,0.00034305043,0.08412199,0.20886809,0.02324172,0.67671937],"study_design_scores_gemma":[0.00075240224,0.00012343997,0.15243967,0.000059516104,0.000027370716,0.00005113564,0.004832859,0.0010043571,0.0038762982,0.44429967,0.39209113,0.00044214603],"about_ca_topic_score_codex":0.000006700877,"about_ca_topic_score_gemma":0.0000069459184,"teacher_disagreement_score":0.6762772,"about_ca_system_score_codex":0.000005758406,"about_ca_system_score_gemma":0.00001019568,"threshold_uncertainty_score":0.19387136},"labels":[],"label_agreement":null},{"id":"W1506848536","doi":"10.2139/ssrn.2101661","title":"Generic Outcomes of Observational Learning","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"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":"Observational study; Observational learning; Psychology; Computer science; Medicine; Mathematics education; Experiential learning; Internal medicine","score_opus":0.14288103336555857,"score_gpt":0.39159723960318216,"score_spread":0.24871620623762358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506848536","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.9641619,0.0008100611,0.03206808,0.0008737039,0.00012535448,0.000039899005,0.0000010127201,0.000011258267,0.0019087617],"genre_scores_gemma":[0.99173266,0.000114255614,0.00036375344,0.00007850005,0.00016325552,0.000003111632,0.0000011812692,0.000006567958,0.007536697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764156,0.00018686942,0.00043154712,0.00010182361,0.0006317674,0.001006409],"domain_scores_gemma":[0.9986914,0.00054914365,0.00033319058,0.00017429971,0.00017381604,0.00007819069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007606317,0.00007549808,0.0001701293,0.000117038675,0.00020676672,0.000034241995,0.0004519566,0.00003541197,0.00028329698],"category_scores_gemma":[0.0010503408,0.000052017418,0.00012544842,0.00041173637,0.000052250165,0.0003409318,0.000042104075,0.00072487537,0.00021027753],"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.000005526627,0.000041995958,0.40021136,2.2288779e-7,0.000027563427,3.726053e-8,0.00012994467,0.00021433957,0.00068893447,0.58138007,0.00007589588,0.017224098],"study_design_scores_gemma":[0.00016271418,0.00004994078,0.23785427,0.0000013758141,0.000013434499,0.00006934257,0.0018673084,0.00007970236,0.00022585772,0.74792945,0.011668766,0.000077811615],"about_ca_topic_score_codex":0.0000032206087,"about_ca_topic_score_gemma":0.000011273911,"teacher_disagreement_score":0.1665494,"about_ca_system_score_codex":0.00010697347,"about_ca_system_score_gemma":0.00045695005,"threshold_uncertainty_score":0.31492633},"labels":[],"label_agreement":null},{"id":"W1507152933","doi":"10.1109/icsmc.1992.271761","title":"Sensory data fusion: a team consensus approach","year":2003,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sensor fusion; Process (computing); Fuse (electrical); Computer science; Function (biology); Fusion; Artificial intelligence; Machine learning; Engineering","score_opus":0.35478813949029814,"score_gpt":0.4240657736119273,"score_spread":0.06927763412162918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507152933","genre_codex":"other","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.05592717,0.00006461011,0.024650766,0.000699129,0.00009533052,0.00019214471,0.000055323,0.00007952432,0.918236],"genre_scores_gemma":[0.9094686,0.000002663444,0.026833039,0.00051370665,0.000036720714,0.00000815952,0.000012812999,0.000005987034,0.06311833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981194,0.0003032562,0.00033100278,0.00055024296,0.0005244324,0.00017165633],"domain_scores_gemma":[0.99630845,0.0010634194,0.00007894397,0.0023324396,0.00010565656,0.0001110833],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033248237,0.000087346154,0.00014467316,0.00006994985,0.00019089499,0.0001083384,0.0010221733,0.000049124643,0.0023509245],"category_scores_gemma":[0.0022457086,0.00005698516,0.00003524613,0.0005075766,0.00016062167,0.00008481448,0.00020613955,0.00009772339,0.0027139755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101862315,0.00018263402,0.00047184338,0.0000012931927,0.000008169534,0.0000023063092,0.00018125943,0.000051391256,0.0016136967,0.70300186,0.27896115,0.015514237],"study_design_scores_gemma":[0.00023068715,0.000011310224,0.00026367162,0.0000010977623,0.00000786731,0.00009405125,0.0036376554,0.0033904393,0.00093441573,0.13683009,0.8544514,0.00014730317],"about_ca_topic_score_codex":0.0000045209526,"about_ca_topic_score_gemma":0.000003946916,"teacher_disagreement_score":0.8551177,"about_ca_system_score_codex":0.0000054551647,"about_ca_system_score_gemma":0.000060381386,"threshold_uncertainty_score":0.9985611},"labels":[],"label_agreement":null},{"id":"W1512546332","doi":"10.1007/978-3-540-75520-3_5","title":"Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Evolutionarily stable strategy; Bayesian game; Mathematical economics; Stability (learning theory); Best response; Set (abstract data type); Computer science; Bayesian probability; Strategy; Routing (electronic design automation); Evolutionary dynamics; Mathematical optimization; Game theory; Correlated equilibrium; Equilibrium selection; Mathematics; Repeated game; Artificial intelligence; Machine learning","score_opus":0.06399736059940628,"score_gpt":0.3374010393084751,"score_spread":0.2734036787090688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512546332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001793462,0.00022663487,0.9835783,0.00051768596,0.0003726131,0.00034522888,0.000006123954,0.000036790385,0.013123147],"genre_scores_gemma":[0.9550552,0.000023183904,0.04294423,0.00070685626,0.00049836485,0.000006781216,0.000013759083,0.000019851284,0.000731823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659234,0.00006740161,0.0008552943,0.00091161137,0.0011929215,0.00038041777],"domain_scores_gemma":[0.9972283,0.0013711568,0.00038320624,0.00064505293,0.0002677341,0.00010453813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00391707,0.00025936746,0.00033287168,0.0012220778,0.00018247055,0.00044419212,0.0010303934,0.00025663784,0.00011395473],"category_scores_gemma":[0.000834701,0.00022516586,0.00005766825,0.0011091625,0.0006351796,0.00094462844,0.00046978402,0.0004440415,0.000049804217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020545212,0.000027525977,0.0014277807,0.0000149375055,0.0000022949919,0.000014883824,0.002074076,0.02779033,0.00028211635,0.08151964,0.00004923982,0.8867766],"study_design_scores_gemma":[0.00015378404,0.000035739427,0.0028088859,0.00015815809,0.0000033934102,0.00003835356,0.000004274298,0.33014622,0.00026685718,0.6642673,0.0018460032,0.00027101775],"about_ca_topic_score_codex":0.00000956184,"about_ca_topic_score_gemma":0.00016958699,"teacher_disagreement_score":0.9532617,"about_ca_system_score_codex":0.00022581039,"about_ca_system_score_gemma":0.00018275001,"threshold_uncertainty_score":0.9181997},"labels":[],"label_agreement":null},{"id":"W1513221568","doi":"10.1109/icsmc.2003.1245691","title":"Policy equilibria for graph games","year":2004,"lang":"en","type":"article","venue":"","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":"University of Waterloo; Wilfrid Laurier University; Toronto Metropolitan University","funders":"","keywords":"Graph; Computer science; Conflict resolution; State (computer science); Mathematical economics; Stability (learning theory); Theoretical computer science; Mathematics; Political science; Algorithm","score_opus":0.12337666868364694,"score_gpt":0.44301884038497535,"score_spread":0.3196421717013284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513221568","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.526486,0.00002313004,0.3001105,0.02188251,0.00010380575,0.00039679022,0.000026765469,0.00013189278,0.15083863],"genre_scores_gemma":[0.9796083,0.0000015253347,0.0063380757,0.0009239938,0.0001140596,0.000045928467,0.0000014229155,0.0000046118,0.012962072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916154,0.000017747807,0.00021574883,0.00021630373,0.00023371009,0.00015493519],"domain_scores_gemma":[0.99890697,0.00047005492,0.000048948965,0.0004097749,0.00009050454,0.0000737491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007180547,0.000056115674,0.0000937817,0.00014923116,0.00009736033,0.00009932318,0.00045084342,0.000028197084,0.00031719412],"category_scores_gemma":[0.0008659199,0.000036935024,0.00009819123,0.0006214448,0.000081556645,0.00013522376,0.000044977463,0.00002565588,0.00076904823],"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.0000061612745,0.000021014494,0.000045314475,3.540737e-7,0.0000019770246,6.6395856e-8,0.00009029414,0.00007552507,0.0026760737,0.9861022,0.0025082736,0.008472725],"study_design_scores_gemma":[0.00022866596,0.00002371933,0.00073994487,0.0000010826807,0.0000017800267,0.0000018875678,0.00019430138,0.000027078822,0.0040179826,0.9640941,0.03061761,0.000051836443],"about_ca_topic_score_codex":0.000021574411,"about_ca_topic_score_gemma":0.000015066217,"teacher_disagreement_score":0.45312232,"about_ca_system_score_codex":0.000009011114,"about_ca_system_score_gemma":0.00007081708,"threshold_uncertainty_score":0.9884816},"labels":[],"label_agreement":null},{"id":"W1514336978","doi":"","title":"Effective Learning in Adaptive Dynamic Systems.","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Class (philosophy); Set (abstract data type); Mathematical optimization; Reinforcement learning; Interdependence; Exploit; Pareto principle; Artificial intelligence; Mathematics","score_opus":0.04536597256458312,"score_gpt":0.39274707077939236,"score_spread":0.3473810982148092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514336978","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.67476606,0.000050303217,0.19576178,0.00007692747,0.00007978834,0.0003001162,7.526035e-7,0.00005394073,0.12891035],"genre_scores_gemma":[0.9895157,6.7726273e-7,0.000259632,0.000030552903,0.000014030722,0.00002246972,4.4310775e-7,0.000003818081,0.01015265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987788,0.00020202273,0.0002846733,0.0002440281,0.00032126403,0.0001691661],"domain_scores_gemma":[0.996698,0.0028943615,0.00007700134,0.00019597888,0.000084327454,0.000050332415],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005260714,0.00006146351,0.0001293553,0.00020568442,0.00007706282,0.00005284312,0.00024174411,0.00004152747,0.00013052385],"category_scores_gemma":[0.0007257805,0.00004325778,0.000032852196,0.0007493341,0.000051353803,0.000110310284,0.000045876663,0.00015515923,0.0012588896],"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.00014535815,0.000121642755,0.02085444,0.0000029681453,0.000013096199,0.000021353155,0.0021182024,0.013747862,0.0038269449,0.6626063,0.0003261291,0.29621568],"study_design_scores_gemma":[0.0010084201,0.00032427962,0.63927424,0.000053056287,0.0000098857545,0.00003051922,0.040767383,0.08921726,0.0018658421,0.20145659,0.025499467,0.00049306185],"about_ca_topic_score_codex":0.000053291315,"about_ca_topic_score_gemma":0.00019415402,"teacher_disagreement_score":0.61841977,"about_ca_system_score_codex":0.00004905475,"about_ca_system_score_gemma":0.000012257866,"threshold_uncertainty_score":0.99951875},"labels":[],"label_agreement":null},{"id":"W1516840567","doi":"10.1007/978-0-387-35706-5_23","title":"Solving the Oshi-Zumo Game","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nash equilibrium; Mathematical economics; Computer science; Game theory; Strategy; Mathematics","score_opus":0.053153344532452164,"score_gpt":0.3524715400949214,"score_spread":0.2993181955624692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516840567","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003333527,0.015234668,0.1821067,0.0029004042,0.0021871787,0.00087814673,0.0000510651,0.0001914152,0.79611707],"genre_scores_gemma":[0.39415714,0.006465461,0.027222358,0.005408886,0.0039299056,0.00018550828,0.000038403898,0.00021712344,0.5623752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968436,0.00008359829,0.0008961364,0.0008808976,0.000948081,0.00034770605],"domain_scores_gemma":[0.9951223,0.0026480325,0.0005125339,0.001477007,0.00015753588,0.00008257879],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012941423,0.0003901839,0.00055624906,0.0002663222,0.000158647,0.00028996274,0.0022575748,0.00018714179,0.0009235838],"category_scores_gemma":[0.00013806067,0.000249311,0.0002522523,0.00019752812,0.0005379209,0.00045764004,0.00050186546,0.0006386686,0.0013909038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000678208,0.000013315044,0.00002666936,0.000005652061,0.000008746911,0.0000125444785,0.00035403387,0.0058419006,0.0000012234727,0.62314135,0.000714614,0.36987314],"study_design_scores_gemma":[0.00010301896,0.000022348922,0.000076790144,0.000116263356,0.000006351583,0.000010900292,0.00001755507,0.00036686938,0.000008036827,0.55164015,0.44745365,0.00017807499],"about_ca_topic_score_codex":0.000003646855,"about_ca_topic_score_gemma":0.000062924024,"teacher_disagreement_score":0.44673902,"about_ca_system_score_codex":0.00008390851,"about_ca_system_score_gemma":0.000100627265,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W152345152","doi":"10.1007/978-1-4020-6872-0_13","title":"Rational Choice and Evolutionary Fit","year":2008,"lang":"en","type":"book-chapter","venue":"Philosophical studies series","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Prince Edward Island","funders":"","keywords":"Darwinism; Morality; Irrationality; Normative; Epistemology; Agency (philosophy); Nothing; Philosophy; Rationality","score_opus":0.2986419527484258,"score_gpt":0.3953408474023247,"score_spread":0.09669889465389891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152345152","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011382374,0.033513762,0.000038093083,0.15524279,0.00050160073,0.0005912742,0.0004176847,0.00018168167,0.8083749],"genre_scores_gemma":[0.14501004,0.015538479,0.00086953334,0.0023582072,0.003503246,0.00016553547,0.000061143444,0.00007332478,0.83242047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997194,0.000054804757,0.0006925489,0.00074849796,0.0011020651,0.00020810548],"domain_scores_gemma":[0.99606895,0.0024077955,0.00028365088,0.000524818,0.0005763956,0.00013838543],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039960654,0.00036342535,0.000649481,0.00013927727,0.00091533543,0.00006432639,0.00044846023,0.00023656874,0.00075818854],"category_scores_gemma":[0.0016058489,0.00027519566,0.00016635716,0.00009883156,0.0021197165,0.00027938563,0.0005572339,0.0004051015,0.0008342756],"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.000031000334,0.000018317472,0.000059084003,0.0000097577295,0.00012126672,0.000008228669,0.00019682257,0.000009323046,0.00000276092,0.96231556,0.035801403,0.0014264458],"study_design_scores_gemma":[0.000069452275,0.00004267218,0.00063264335,0.000018716259,0.000020635063,0.000046054272,0.000026106516,0.0000024457156,0.0000011443283,0.555294,0.44368252,0.00016361504],"about_ca_topic_score_codex":0.0000015396457,"about_ca_topic_score_gemma":0.000009690132,"teacher_disagreement_score":0.4078811,"about_ca_system_score_codex":0.000053022828,"about_ca_system_score_gemma":0.00005995623,"threshold_uncertainty_score":0.99997},"labels":[],"label_agreement":null},{"id":"W1526198743","doi":"","title":"Identification of a Simple Dynamic Discrete Game Under Rationalizability","year":2008,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rationalizability; Identification (biology); Simple (philosophy); Sequential game; Rationality; Mathematical economics; Markov perfect equilibrium; Rational expectations; Markov chain; Economics; Mathematics; Econometrics; Game theory; Nash equilibrium; Statistics","score_opus":0.10202515171324616,"score_gpt":0.43958076499026516,"score_spread":0.337555613277019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526198743","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.9823452,0.000049757127,0.0016399665,0.00080031744,0.00015162409,0.00095677003,0.00032603458,0.00002485895,0.013705419],"genre_scores_gemma":[0.9956818,0.0012998233,0.00017855482,0.000027217073,0.0000438398,0.00027179104,0.00012176682,0.000023412274,0.0023517634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948772,0.00090806547,0.0017769529,0.0011779573,0.0008584963,0.00040129916],"domain_scores_gemma":[0.9931615,0.0030954436,0.0006645649,0.0024267214,0.0005162487,0.00013554662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008377205,0.00020925194,0.0005324747,0.0005943849,0.0001702962,0.00017573798,0.0016749868,0.00029734318,0.00029527492],"category_scores_gemma":[0.0033769913,0.00019901906,0.00025264933,0.00042929366,0.0009838174,0.00017294376,0.0010436916,0.000829608,0.00007432116],"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.00044745026,0.0012306363,0.016827255,0.00022389487,0.00021566587,0.000008959004,0.0036195065,0.5834904,0.01304272,0.073667474,0.00047624586,0.30674982],"study_design_scores_gemma":[0.00029680273,0.00003096242,0.054698747,0.00003198549,0.000006691859,0.0000058718333,0.0011628042,0.09689425,0.00087605946,0.84058946,0.005102712,0.0003036807],"about_ca_topic_score_codex":0.000032687498,"about_ca_topic_score_gemma":0.00020113082,"teacher_disagreement_score":0.76692194,"about_ca_system_score_codex":0.00049948844,"about_ca_system_score_gemma":0.0006930429,"threshold_uncertainty_score":0.8115762},"labels":[],"label_agreement":null},{"id":"W152794511","doi":"","title":"Phi-Strong (weak) domination in a graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.05296783659037206,"score_gpt":0.34865348522186346,"score_spread":0.2956856486314914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152794511","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.93419737,0.000051171817,0.00031652238,0.00033574773,0.0005843221,0.00018487977,0.0000022415538,0.000029543502,0.064298205],"genre_scores_gemma":[0.9984546,0.000003859284,0.00018971777,0.00005376219,0.0000030882788,0.000045050878,0.000001751939,0.0000071646996,0.0012410526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982841,0.00030351782,0.00038946175,0.00032644998,0.0004837315,0.00021272378],"domain_scores_gemma":[0.99849063,0.00068519666,0.00012032561,0.00051130244,0.00011800631,0.00007455272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025330347,0.00009882959,0.00016671655,0.0002538191,0.00011373992,0.000091923415,0.00042510315,0.00006312318,0.00032435192],"category_scores_gemma":[0.001339273,0.0000856545,0.00006537885,0.0013033771,0.00008084829,0.00024351885,0.000034274886,0.00013453113,0.0005686265],"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.0000054965512,0.00009681529,0.0064547565,5.577097e-7,0.000002063447,0.0000012899211,0.00018957446,0.000021847927,0.00038181702,0.9897729,0.001029178,0.002043661],"study_design_scores_gemma":[0.00058142416,0.000022518212,0.011525475,0.0000047724798,0.0000028831146,0.0000028569204,0.00048928766,0.000059746326,0.0017016002,0.97442496,0.011087682,0.00009680431],"about_ca_topic_score_codex":0.000008330936,"about_ca_topic_score_gemma":0.000015887334,"teacher_disagreement_score":0.06425718,"about_ca_system_score_codex":0.000034721867,"about_ca_system_score_gemma":0.000038705086,"threshold_uncertainty_score":0.7308733},"labels":[],"label_agreement":null},{"id":"W1528321644","doi":"","title":"Two Characterizations of Consistency","year":2005,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Consistency (knowledge bases); Mathematics; Monomial; Dispersion (optics); Product (mathematics); Mathematical economics; Combinatorics; Pure mathematics; Discrete mathematics; Geometry; Physics","score_opus":0.06572823074557255,"score_gpt":0.34898438061112536,"score_spread":0.2832561498655528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528321644","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.8718533,0.0006093834,0.0021739863,0.0012967265,0.002176013,0.00077105226,0.001239175,0.00015722655,0.11972314],"genre_scores_gemma":[0.9862843,0.000089252935,0.0035271307,0.00039381726,0.0006478324,0.00020242935,0.0001081929,0.000048970207,0.00869806],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9942449,0.00047789782,0.002485738,0.0013861699,0.0009008558,0.0005044733],"domain_scores_gemma":[0.9918029,0.0019890775,0.0021221798,0.002936509,0.0008050894,0.00034430262],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026498905,0.0005625826,0.0013129901,0.00082511024,0.00036237563,0.0002564304,0.0022975309,0.00044791444,0.01152936],"category_scores_gemma":[0.0017007835,0.0005331933,0.00069704023,0.0006290755,0.0013791233,0.00034053577,0.0010177364,0.0008567695,0.0032295992],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071444745,0.0010038004,0.6220555,0.00009605263,0.00040328735,0.000016128979,0.0021784697,0.001068581,0.0064362935,0.3321088,0.015731463,0.018830223],"study_design_scores_gemma":[0.002661016,0.00016619245,0.47510672,0.00063498475,0.0005874209,0.00028275317,0.002113158,0.0018642779,0.0065933843,0.2937982,0.21280347,0.0033884104],"about_ca_topic_score_codex":0.000038338334,"about_ca_topic_score_gemma":0.0001219625,"teacher_disagreement_score":0.19707201,"about_ca_system_score_codex":0.0001531321,"about_ca_system_score_gemma":0.0012452191,"threshold_uncertainty_score":0.999712},"labels":[],"label_agreement":null},{"id":"W1531613433","doi":"","title":"Reputation for a Servant of Two Masters","year":2012,"lang":"en","type":"article","venue":"The Faculty Digital Archive (New York University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reputation; Pooling; Action (physics); Incentive; Outcome (game theory); Microeconomics; Compromise; Stochastic game; Law and economics; Economics; Computer science; Political science; Law; Artificial intelligence","score_opus":0.1768817241512783,"score_gpt":0.35086605334224463,"score_spread":0.17398432919096632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531613433","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.7071989,0.000011415021,0.23074512,0.0010952099,0.000093278686,0.000524605,0.0010489454,0.000047743397,0.059234772],"genre_scores_gemma":[0.97706544,4.794129e-7,0.001877782,0.000046828492,0.00004674801,9.0597706e-7,0.00006500044,0.0000051417765,0.020891678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991114,0.000059060712,0.00018216747,0.00017442912,0.0002760627,0.00019688728],"domain_scores_gemma":[0.9984,0.00089513225,0.00018620417,0.00031705928,0.00007496986,0.00012663406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000345788,0.000087932625,0.00013403791,0.00013474906,0.00016304465,0.00007002061,0.0006592919,0.000016456721,0.000028779677],"category_scores_gemma":[0.00020696773,0.000059108916,0.00014680298,0.0005109601,0.00018450437,0.0005878219,0.00014426683,0.000054309097,0.00013804449],"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.00054918055,0.00023223378,0.0068581807,0.000009076732,0.00010079018,0.0000012005991,0.018918455,0.0014632625,0.0024907556,0.85141206,0.018081577,0.099883236],"study_design_scores_gemma":[0.00136434,0.00014660141,0.010246802,0.000023333134,0.000073553696,0.0000091568845,0.022762025,0.0005824331,0.0015607433,0.43344682,0.5295181,0.00026603238],"about_ca_topic_score_codex":0.000022315877,"about_ca_topic_score_gemma":0.000013225265,"teacher_disagreement_score":0.5114366,"about_ca_system_score_codex":0.00001768453,"about_ca_system_score_gemma":0.000041236464,"threshold_uncertainty_score":0.24103916},"labels":[],"label_agreement":null},{"id":"W1531806653","doi":"10.1007/978-3-642-25510-6_19","title":"A General Framework for Computing Optimal Correlated Equilibria in Compact Games","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Singleton; Optimization problem; Mathematics; Algorithm","score_opus":0.08701163899252042,"score_gpt":0.36238796200849593,"score_spread":0.27537632301597553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531806653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015515427,0.00020440746,0.97811675,0.00035165253,0.0011718803,0.0007472181,0.000026407035,0.000078293364,0.0037879804],"genre_scores_gemma":[0.7124028,0.0000057277352,0.2857394,0.0006634297,0.0004498946,0.0000085370075,0.000009003674,0.000039138038,0.0006820494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952217,0.00009425675,0.0011472156,0.001679914,0.0010802236,0.00077669555],"domain_scores_gemma":[0.9924127,0.005106279,0.00060087984,0.0013388266,0.00034050184,0.00020081045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003687471,0.0005093441,0.0008514101,0.0010832588,0.00027382866,0.000516067,0.0032411215,0.00050939043,0.0002300441],"category_scores_gemma":[0.0012156855,0.00041873977,0.00023660772,0.0010871105,0.0011670438,0.0003045242,0.0006437486,0.0010677818,0.00013765473],"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.00010568269,0.000088107336,0.00066683546,0.000015331634,0.000016732387,0.000026558359,0.0029822749,0.18464965,0.00026193773,0.3682949,0.00014232378,0.44274968],"study_design_scores_gemma":[0.00020899465,0.00009580184,0.0005492555,0.0002214107,0.0000065171193,0.000019859486,0.0000010023949,0.3559242,0.00022559098,0.6411068,0.0012807616,0.00035981456],"about_ca_topic_score_codex":0.000027729267,"about_ca_topic_score_gemma":0.000036988647,"teacher_disagreement_score":0.69688743,"about_ca_system_score_codex":0.00015952806,"about_ca_system_score_gemma":0.00036245259,"threshold_uncertainty_score":0.99982643},"labels":[],"label_agreement":null},{"id":"W1539406205","doi":"","title":"Misery loves company: social influence and the supply/pricing decision of a popular restaurant","year":2000,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"Simon Fraser University","funders":"","keywords":"Supply and demand; Argument (complex analysis); Economics; Demand curve; Function (biology); Microeconomics; Excess supply; Supply","score_opus":0.07020005447058668,"score_gpt":0.3978898553094941,"score_spread":0.3276898008389074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539406205","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.98471355,0.00025383235,0.000016413404,0.0014368484,0.000069871545,0.0007636779,0.00007356418,0.000013020362,0.012659202],"genre_scores_gemma":[0.9956359,0.002989508,0.0004434296,0.000077507204,0.000083202074,0.00009353368,0.000008023093,0.000022505335,0.00064634904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952574,0.0010702023,0.0013752856,0.0009561294,0.0008423858,0.0004986408],"domain_scores_gemma":[0.9917813,0.0059619606,0.00044092952,0.0014476757,0.00023944717,0.00012869228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011295118,0.00024599483,0.0008200287,0.00054507644,0.00041434547,0.00035136708,0.001970673,0.00029920822,0.00013697411],"category_scores_gemma":[0.003064784,0.00017507005,0.00022084663,0.00039575482,0.0019474416,0.00014253434,0.0014718294,0.0012875833,0.000022723332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018772687,0.000182045,0.01120565,0.00006523838,0.000071848975,0.000013870057,0.0069652703,0.029788263,0.00046526978,0.02080756,0.00021418928,0.92834353],"study_design_scores_gemma":[0.002296863,0.000061451814,0.12665589,0.00042693753,0.000025989146,0.000021246284,0.007604374,0.0138953095,0.00024503702,0.8305854,0.017635362,0.0005461289],"about_ca_topic_score_codex":0.00014181528,"about_ca_topic_score_gemma":0.00016747342,"teacher_disagreement_score":0.9277974,"about_ca_system_score_codex":0.00014787877,"about_ca_system_score_gemma":0.00032859156,"threshold_uncertainty_score":0.71754295},"labels":[],"label_agreement":null},{"id":"W1539417924","doi":"10.1007/11766247_6","title":"Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":49,"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é Laval","funders":"","keywords":"Computer science; Observability; Nash equilibrium; Equilibrium selection; Solution concept; Context (archaeology); Mathematical economics; Complete information; Rational agent; Correlated equilibrium; Deliberation; Pareto principle; Game theory; Epsilon-equilibrium; Mathematical optimization; Best response; Repeated game; Artificial intelligence; Mathematics","score_opus":0.03915314013422875,"score_gpt":0.30918814919938353,"score_spread":0.27003500906515476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539417924","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.018836202,0.000058051734,0.9689834,0.00062810763,0.0005635457,0.00047163133,0.000020462108,0.0000579333,0.010380656],"genre_scores_gemma":[0.9844809,0.0000063665716,0.0143037755,0.00060848135,0.00022049253,0.000015687405,0.00003462148,0.0000130346125,0.00031663492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964034,0.00008471653,0.0010975709,0.00074989366,0.0013039396,0.00036045455],"domain_scores_gemma":[0.99708813,0.0011570972,0.00048885576,0.00084813824,0.0003420473,0.00007571064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002854263,0.0003151759,0.00041221274,0.001491981,0.00018066798,0.0009027633,0.0011408157,0.00024485012,0.00014197969],"category_scores_gemma":[0.0005389625,0.00026877222,0.00008116653,0.0011103712,0.00049393316,0.0019013778,0.00039955004,0.00057611254,0.00030456673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011866698,0.00001067063,0.0015556221,0.00000869914,0.0000017698446,0.000002814172,0.0004946939,0.24775705,0.00060490903,0.016923865,0.00011997735,0.73250806],"study_design_scores_gemma":[0.00047601716,0.00012031499,0.02595294,0.00029986326,0.000008597789,0.000038334623,0.0000024906724,0.33046827,0.0008615469,0.62664557,0.014303562,0.0008225297],"about_ca_topic_score_codex":0.00013010515,"about_ca_topic_score_gemma":0.00070380245,"teacher_disagreement_score":0.9656447,"about_ca_system_score_codex":0.00026938235,"about_ca_system_score_gemma":0.00025898812,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null},{"id":"W1539532232","doi":"10.1609/aimag.v31i4.2310","title":"Algorithmic Game Theory: Special Issue Introduction","year":2010,"lang":"en","type":"article","venue":"AI Magazine","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Game theory; Computer science; Algorithmic game theory; Mechanism (biology); Game design; Implementation theory; Management science; Artificial intelligence; Term (time); Data science; Repeated game; Mathematical economics; Engineering; Epistemology; Mathematics","score_opus":0.0227147478713124,"score_gpt":0.34397797083457066,"score_spread":0.32126322296325827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539532232","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34347817,0.000049780087,0.051969495,0.16297968,0.014846012,0.0010822815,0.00008561218,0.00047201486,0.42503697],"genre_scores_gemma":[0.8087719,0.000005554906,0.0023649689,0.001613835,0.05096562,0.0000416605,0.000019548701,0.00002433079,0.13619258],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839926,0.0001314839,0.00033788188,0.00043904045,0.00048301712,0.00020931767],"domain_scores_gemma":[0.9983155,0.0003620591,0.00011230787,0.00088627695,0.00022192048,0.00010191259],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023960725,0.000118484284,0.00017185758,0.00014677686,0.00012838852,0.00016472784,0.0006069416,0.00007854611,0.030288212],"category_scores_gemma":[0.0013461233,0.00008947518,0.000073284675,0.00063029537,0.00022704678,0.00028093017,0.00009343837,0.0003476244,0.037982248],"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.00002867646,0.000058227997,0.000064969805,5.773795e-7,0.000004908704,0.0000016458907,0.00018804931,0.000009543925,0.022107188,0.2976605,0.39038536,0.28949034],"study_design_scores_gemma":[0.0001125584,0.000018594015,0.002008612,4.4728736e-7,0.000005422287,0.000016755172,0.00004165295,0.00010096173,0.0020198394,0.3625607,0.6330422,0.00007224706],"about_ca_topic_score_codex":0.0000014947767,"about_ca_topic_score_gemma":0.00002250047,"teacher_disagreement_score":0.46529374,"about_ca_system_score_codex":0.000008706292,"about_ca_system_score_gemma":0.000029240784,"threshold_uncertainty_score":0.9705982},"labels":[],"label_agreement":null},{"id":"W1539591984","doi":"","title":"Reputation in Endogenous Production Teams","year":2001,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"HEC Montréal","funders":"","keywords":"Reputation; Work (physics); Production (economics); Computer science; Microeconomics; Business; Economics; Engineering; Political science; Law","score_opus":0.1693616416662277,"score_gpt":0.42062095293113944,"score_spread":0.25125931126491174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539591984","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.84241885,0.00006710194,0.000023603034,0.0010524476,0.0004284034,0.0011209395,0.00001883717,0.000036025333,0.15483378],"genre_scores_gemma":[0.9889295,0.0021677886,0.0004565117,0.000035611287,0.00027730953,0.000524198,0.000038525173,0.000031070373,0.0075395023],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950013,0.0008982521,0.0012418468,0.001553652,0.0006847642,0.0006201567],"domain_scores_gemma":[0.99591243,0.001440382,0.00035015828,0.001892443,0.00027148167,0.0001331182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012910589,0.00022638695,0.00047218852,0.0013037057,0.00018255466,0.00030754704,0.0012881111,0.00035320612,0.00023937269],"category_scores_gemma":[0.0058749267,0.00022328961,0.0001335157,0.00075899885,0.00032454243,0.00020681675,0.00080451125,0.0015736754,0.00017705682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010765455,0.00031448662,0.009954972,0.00002184065,0.000015040643,0.000031173826,0.0015859698,0.1029668,0.0008983066,0.0019630962,0.00010642156,0.88203424],"study_design_scores_gemma":[0.0009365057,0.00015123084,0.03420339,0.00027091027,0.000010177572,0.00014654998,0.010347748,0.015067427,0.0024388204,0.86117667,0.07423017,0.001020406],"about_ca_topic_score_codex":0.00013649517,"about_ca_topic_score_gemma":0.00075396814,"teacher_disagreement_score":0.8810138,"about_ca_system_score_codex":0.00093583716,"about_ca_system_score_gemma":0.00056508486,"threshold_uncertainty_score":0.9105486},"labels":[],"label_agreement":null},{"id":"W1541257362","doi":"10.1016/j.jmateco.2016.01.003","title":"Volume of trade and dynamic network formation in two-sided economies","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"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 Ottawa","funders":"","keywords":"Stylized fact; Pairwise comparison; Economics; Matching (statistics); Population; Shock (circulatory); Stability (learning theory); Microeconomics; Econometrics; Economy; Computer science; Mathematics; Statistics","score_opus":0.044887382889535345,"score_gpt":0.3321596460919777,"score_spread":0.2872722632024423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541257362","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.97508407,0.000034222543,0.02050283,0.00284213,0.000038166003,0.000070234535,0.000004243608,0.0000021089093,0.0014219694],"genre_scores_gemma":[0.9957695,0.00006410528,0.0039514247,0.00004822872,0.000037809103,0.0000017765014,1.0286783e-7,0.0000046514715,0.00012242896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837357,0.0000574435,0.0012819634,0.00008810867,0.00008408348,0.000114854454],"domain_scores_gemma":[0.99692756,0.0019883434,0.0007956254,0.00017935409,0.000037565987,0.00007157489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002513086,0.00006886581,0.00037316806,0.00012641212,0.000024509776,0.00004140901,0.00026663518,0.000034082932,0.00020840626],"category_scores_gemma":[0.0007536463,0.000041811425,0.00008547395,0.00007325901,0.0001225265,0.000521485,0.00003932595,0.000067947956,0.00005165225],"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.0002075983,0.00024320319,0.0035976311,0.00004110508,0.00005421247,0.0000035813196,0.001556521,0.006340779,0.0016869728,0.8711748,0.0015914488,0.11350213],"study_design_scores_gemma":[0.0005408436,0.000043001135,0.004253128,0.00006671409,0.000008591695,0.00008933187,0.00029079197,0.014003625,0.00026700713,0.97990066,0.0004802079,0.000056088888],"about_ca_topic_score_codex":2.6429754e-7,"about_ca_topic_score_gemma":0.000013898032,"teacher_disagreement_score":0.11344604,"about_ca_system_score_codex":0.000048304617,"about_ca_system_score_gemma":0.00002672742,"threshold_uncertainty_score":0.22819024},"labels":[],"label_agreement":null},{"id":"W1542186358","doi":"10.1007/978-3-540-45080-1_19","title":"Learning from Average Experience","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Outcome (game theory); Computer science; Stochastic game; Class (philosophy); Oligopoly; Artificial intelligence; Microeconomics; Economics; Cournot competition","score_opus":0.062307684646932274,"score_gpt":0.3294645827433816,"score_spread":0.2671568980964493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542186358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004892105,0.0001829179,0.972461,0.00041455746,0.0008829733,0.0002129393,0.000007021206,0.000064327716,0.020882184],"genre_scores_gemma":[0.9476893,0.000023994106,0.04309988,0.0020984646,0.00037045128,0.000015379912,0.000005904581,0.000031514428,0.0066651152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952704,0.00010612954,0.0006832372,0.0016883604,0.0017914805,0.00046041995],"domain_scores_gemma":[0.9951004,0.002649352,0.0003788197,0.0014257189,0.00026500807,0.0001807222],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019968823,0.00037637624,0.00048261878,0.0005376006,0.00046542817,0.00068103406,0.0029508518,0.0002546071,0.0012133751],"category_scores_gemma":[0.0012010771,0.00030255728,0.00013725126,0.000760251,0.0012020654,0.00035758814,0.0005783886,0.0009284539,0.0007390162],"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.000010436088,0.00002823099,0.00047948517,0.0000023835205,0.0000062898125,0.00004659943,0.0054360456,0.10894522,0.00080286135,0.022704113,0.00008724976,0.8614511],"study_design_scores_gemma":[0.0001321,0.00006065514,0.00020428051,0.00008168869,0.000004196234,0.000016551789,0.0000037121943,0.03468002,0.0019534635,0.924556,0.03781315,0.00049416],"about_ca_topic_score_codex":0.000016800404,"about_ca_topic_score_gemma":0.000027018661,"teacher_disagreement_score":0.9427972,"about_ca_system_score_codex":0.000113082046,"about_ca_system_score_gemma":0.00017560586,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W1549469597","doi":"10.5555/1036843.1036848","title":"Computing Nash equilibria of action-graph games","year":2004,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Stochastic game; Nash equilibrium; Computer science; Exponential function; Mathematics; Graph; Bottleneck; Mathematical optimization; Mathematical economics; Discrete mathematics","score_opus":0.235146508396361,"score_gpt":0.2842161282027014,"score_spread":0.04906961980634042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549469597","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.8942592,0.000010925369,0.09939304,0.000086731336,0.0000852049,0.000074537136,0.000005341837,0.000048070113,0.0060369624],"genre_scores_gemma":[0.99834096,0.0000079514675,0.0002966443,0.00004238566,0.000027803677,9.200226e-8,0.000001208081,0.0000050923422,0.0012778317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990181,0.000082548846,0.00022252608,0.0003796763,0.00013345877,0.00016373051],"domain_scores_gemma":[0.99859554,0.00042682473,0.00020593317,0.00052192423,0.0001611489,0.00008861612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785165,0.00009059032,0.0001684826,0.00021202855,0.00014658201,0.00003326606,0.00064841076,0.000053194522,0.00019677993],"category_scores_gemma":[0.00017348552,0.000086010434,0.0001337543,0.001442632,0.00022364345,0.0002806613,0.00013573706,0.00009414402,0.00031408886],"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.000045997574,0.00012786603,0.010251894,0.000004584587,0.000026403595,0.000012657409,0.0003545406,0.11963813,0.0073834965,0.85970706,0.00019605017,0.0022513263],"study_design_scores_gemma":[0.00074346043,0.000057975023,0.01615021,0.000020416841,0.000028594139,0.0000058064,0.0021731486,0.0060233297,0.006155518,0.9663554,0.002094744,0.00019140838],"about_ca_topic_score_codex":0.000030958483,"about_ca_topic_score_gemma":0.00002428003,"teacher_disagreement_score":0.1136148,"about_ca_system_score_codex":0.00002981151,"about_ca_system_score_gemma":0.000055521177,"threshold_uncertainty_score":0.40370816},"labels":[],"label_agreement":null},{"id":"W1551549727","doi":"","title":"Characterizing Consistency by Monomials and by Product Dispersions","year":2006,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Monomial; Consistency (knowledge bases); Mathematics; Product (mathematics); Characterization (materials science); Mathematical economics; Pure mathematics; Discrete mathematics; Physics; Geometry","score_opus":0.04175836556465398,"score_gpt":0.3067420737388969,"score_spread":0.2649837081742429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551549727","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.95572674,0.0041893013,0.00039557266,0.0035440982,0.0017263031,0.0011435224,0.003260269,0.0001882766,0.029825898],"genre_scores_gemma":[0.9818926,0.00018705128,0.0008235231,0.00054872036,0.0004517004,0.00032652187,0.00036764954,0.000064939886,0.015337281],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99400574,0.00050716015,0.001858173,0.002310414,0.0006396289,0.00067886774],"domain_scores_gemma":[0.9940171,0.001677186,0.0013712996,0.0022118215,0.00026831558,0.00045423908],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0028160473,0.00073399855,0.0013285973,0.00039822469,0.0007738922,0.00078653864,0.0014957996,0.00046990503,0.0017657205],"category_scores_gemma":[0.0011343606,0.00067832274,0.00039934122,0.00031378987,0.0014458558,0.00043373142,0.0010729161,0.00095135975,0.001078016],"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.000031942564,0.0003850799,0.36209205,0.000052060495,0.00015077973,0.000007670922,0.0005605908,0.000012591856,0.01968726,0.004283158,0.6025922,0.010144654],"study_design_scores_gemma":[0.0015476085,0.00011008613,0.108362705,0.00036375926,0.00040118548,0.00021873853,0.0012278309,0.0003442383,0.011958018,0.046168603,0.8256165,0.0036807237],"about_ca_topic_score_codex":0.0001887564,"about_ca_topic_score_gemma":0.000060264352,"teacher_disagreement_score":0.25372934,"about_ca_system_score_codex":0.00019379656,"about_ca_system_score_gemma":0.00048425703,"threshold_uncertainty_score":0.9996998},"labels":[],"label_agreement":null},{"id":"W1554661716","doi":"10.48550/arxiv.1206.3261","title":"Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Advice (programming); Mediator; Test (biology); Computer science; Relation (database); Artificial intelligence; Machine learning; Data mining; Medicine","score_opus":0.1484742225203335,"score_gpt":0.2814103446425897,"score_spread":0.1329361221222562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554661716","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.6629666,0.000009252369,0.3311124,0.0001925106,0.00010708144,0.00028068453,0.0000407503,0.00011942327,0.005171269],"genre_scores_gemma":[0.9818692,8.8607413e-7,0.0019932417,0.00014917576,0.00007385659,0.0000028800744,0.000010011489,0.000013988628,0.015886767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858105,0.00014988777,0.00023758276,0.0004588918,0.00013804022,0.00043457127],"domain_scores_gemma":[0.9951601,0.00373996,0.0001276254,0.00041918523,0.00018620979,0.00036693586],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001346394,0.00013343092,0.0001959488,0.0001769068,0.000271921,0.000082114886,0.0005844967,0.000078293975,0.00063359126],"category_scores_gemma":[0.003387296,0.00012774873,0.000083564395,0.0008203742,0.00009536592,0.0004297369,0.00020309445,0.00018654736,0.0016630435],"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.00043353692,0.0005500372,0.19526325,0.00001706584,0.000057814897,0.000022219472,0.0035012122,0.033322077,0.007847484,0.7347804,0.015352716,0.008852184],"study_design_scores_gemma":[0.003182376,0.0012351295,0.101591565,0.00008847324,0.00037280124,0.00003552665,0.0110541135,0.3184619,0.0008835352,0.26779816,0.2936238,0.0016726442],"about_ca_topic_score_codex":0.000013064263,"about_ca_topic_score_gemma":0.000008712582,"teacher_disagreement_score":0.46698225,"about_ca_system_score_codex":0.000050715993,"about_ca_system_score_gemma":0.000038880655,"threshold_uncertainty_score":0.9991143},"labels":[],"label_agreement":null},{"id":"W156513541","doi":"","title":"Computing pure Nash equilibria in symmetric action graph games","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nash equilibrium; Treewidth; Best response; Combinatorial game theory; Mathematics; Graph; Epsilon-equilibrium; Time complexity; Game theory; Combinatorics; Repeated game; Mathematical optimization; Computer science; Mathematical economics; Line graph; Pathwidth","score_opus":0.14018558336943265,"score_gpt":0.43125774414230117,"score_spread":0.2910721607728685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156513541","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.88318306,0.000036577218,0.053305063,0.00034238424,0.00014302276,0.00010918674,7.781985e-7,0.000061108854,0.06281883],"genre_scores_gemma":[0.99624294,0.000002587515,0.0013357658,0.00018602239,0.00006646534,0.0000016565743,0.0000011438556,0.000004592048,0.0021588549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844295,0.000083811145,0.00045235138,0.00030403823,0.00047957347,0.00023729475],"domain_scores_gemma":[0.9976535,0.0017298487,0.000114303584,0.00034304513,0.00008426474,0.00007504714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045784586,0.00007853358,0.00013804079,0.00074799894,0.00009022469,0.00011379126,0.00041101236,0.0000619044,0.00040068917],"category_scores_gemma":[0.0007822341,0.000058275236,0.00006414038,0.0037871923,0.000056610777,0.00021171846,0.00008542408,0.00012996534,0.0005310715],"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.000032300683,0.00013573498,0.044397898,0.0000028116997,0.000005982532,0.0000050665526,0.00042315686,0.00021594104,0.011616103,0.42272243,0.0036226541,0.5168199],"study_design_scores_gemma":[0.00045097704,0.000042777086,0.39317697,0.000012158503,0.000005233317,0.000017337677,0.0040503996,0.0049606077,0.007069218,0.57316893,0.016799208,0.00024619498],"about_ca_topic_score_codex":0.000021703314,"about_ca_topic_score_gemma":0.00012632343,"teacher_disagreement_score":0.5165737,"about_ca_system_score_codex":0.000021187483,"about_ca_system_score_gemma":0.000015622838,"threshold_uncertainty_score":0.6826027},"labels":[],"label_agreement":null},{"id":"W1569875485","doi":"","title":"The Econometrics of Social Networks","year":2009,"lang":"en","type":"article","venue":"Cahiers de recherche","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Affect (linguistics); Identification (biology); Social network (sociolinguistics); Econometrics; Estimation; Social network analysis; Network structure; Economics; Computer science; Psychology; Sociology; Social capital; Machine learning; Social science; Social media","score_opus":0.44384819698138545,"score_gpt":0.47647882254976326,"score_spread":0.032630625568377813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569875485","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2848358,0.0010207159,0.2912904,0.011526256,0.0002138408,0.00029192102,0.000008056737,0.00006150804,0.41075152],"genre_scores_gemma":[0.9894462,0.00008169827,0.0015914149,0.0005203706,0.000088462926,0.0000053161143,6.309615e-7,0.0000033743222,0.008262495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983498,0.00087477325,0.00027736727,0.00014047898,0.00018277264,0.00017480482],"domain_scores_gemma":[0.9919953,0.0073870546,0.00014273566,0.0003095807,0.00011047156,0.000054905806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014740448,0.00005349086,0.000115687326,0.000075813485,0.00025629337,0.00007273467,0.00067874015,0.00028133768,0.00006450189],"category_scores_gemma":[0.006815858,0.00003408597,0.000095877156,0.0014035117,0.0002668374,0.000050937466,0.000015999369,0.00051222614,0.000049579292],"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.000013457343,0.000019468705,0.00006158588,2.645637e-7,0.000005674451,2.0890229e-7,0.0011316912,0.00018949756,0.00015150242,0.37855268,0.00539216,0.6144818],"study_design_scores_gemma":[0.000085659325,0.00002763089,0.0044965744,9.271754e-7,0.0000071603877,0.0000018709604,0.0015036772,0.0014355269,0.00057465216,0.91584647,0.07595785,0.00006202076],"about_ca_topic_score_codex":4.9565085e-7,"about_ca_topic_score_gemma":8.827416e-7,"teacher_disagreement_score":0.70461047,"about_ca_system_score_codex":0.00013070888,"about_ca_system_score_gemma":0.00006642673,"threshold_uncertainty_score":0.8159711},"labels":[],"label_agreement":null},{"id":"W1571167861","doi":"10.1002/9780470400531.eorms0882","title":"The Graph Model For Conflict Resolution","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Conflict resolution; Graph; Computer science; Management science; Operations research; Process (computing); Theoretical computer science; Engineering; Sociology; Social science","score_opus":0.18989794440915875,"score_gpt":0.44039591627456337,"score_spread":0.2504979718654046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571167861","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007739796,0.0008997703,0.08183427,0.0006139539,0.00015151924,0.0021867026,0.00010261879,0.000034211876,0.9140996],"genre_scores_gemma":[0.0022787491,0.023238935,0.0112638315,0.000030279776,0.00007572891,0.0009130736,0.000009591961,0.000043824333,0.962146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965898,0.00012172896,0.0004410393,0.00070913497,0.0016489358,0.0004893526],"domain_scores_gemma":[0.99747795,0.0004744256,0.00010219976,0.0011739738,0.00060514273,0.00016630815],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.008836384,0.00014447923,0.00018707452,0.0010853392,0.0016837764,0.00039847242,0.0020776473,0.000071507005,0.00017687834],"category_scores_gemma":[0.0010527102,0.00009068918,0.000055484346,0.001732797,0.003387034,0.0002521741,0.0005540204,0.00016319855,0.00009276531],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133224885,0.00004695114,0.0000066529324,0.000013811987,0.000010305376,2.0076155e-7,0.00021952206,0.00025529054,0.000025117375,0.60521024,0.3811547,0.013043903],"study_design_scores_gemma":[0.00015937885,0.00007791076,0.00006864371,0.000052154912,0.00001067243,5.2474064e-7,0.00044906113,0.036069423,0.000016925645,0.078480445,0.88449067,0.00012419051],"about_ca_topic_score_codex":0.00010039596,"about_ca_topic_score_gemma":0.0006437072,"teacher_disagreement_score":0.52672976,"about_ca_system_score_codex":0.000022274628,"about_ca_system_score_gemma":0.00018753126,"threshold_uncertainty_score":0.9996159},"labels":[],"label_agreement":null},{"id":"W1572821073","doi":"10.7202/602327ar","title":"Croyances individuelles et coordination sociale","year":2009,"lang":"fr","type":"article","venue":"L Actualité économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coordination game; Sociology; Humanities; Epistemology; Game theory; Philosophy; Mathematical economics; Economics","score_opus":0.13413243552413778,"score_gpt":0.39311392845822113,"score_spread":0.25898149293408335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572821073","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.7039951,0.0019532552,0.008375716,0.20102069,0.00093835936,0.00052945194,0.0001879907,0.000121678044,0.08287775],"genre_scores_gemma":[0.9144673,0.00023948334,0.0016236382,0.007690974,0.0004089832,0.00003381656,0.000022955763,0.0000138025,0.075499065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972768,0.0007108968,0.00077702635,0.00061438454,0.00020113535,0.00041977793],"domain_scores_gemma":[0.99649423,0.0020849332,0.00043137607,0.0005758581,0.00022537373,0.00018819647],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003236601,0.00026973768,0.00041577307,0.00016808073,0.0003764493,0.0006574956,0.0008535881,0.00031224772,0.0027839302],"category_scores_gemma":[0.0011165149,0.00026236253,0.00021118697,0.0005010833,0.00037603677,0.0010516393,0.0000859441,0.00032208624,0.0025944395],"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.00001498098,0.00016742582,0.00019752636,0.000003984634,0.000014393547,0.0000013356662,0.002026613,0.000106319494,0.0003288662,0.6990184,0.008643194,0.28947693],"study_design_scores_gemma":[0.00021684926,0.00007583425,0.006046956,0.000026408494,0.000015986858,0.0000059150175,0.0006970861,0.00018639883,0.0017804876,0.5806938,0.4100505,0.00020378405],"about_ca_topic_score_codex":0.00014130492,"about_ca_topic_score_gemma":0.00019509309,"teacher_disagreement_score":0.4014073,"about_ca_system_score_codex":0.0001085601,"about_ca_system_score_gemma":0.00036342372,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W1575204797","doi":"10.3982/te760","title":"An anti-folk theorem for finite past equilibria in repeated games with private monitoring","year":2012,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Folk theorem; Repeated game; Mathematical economics; Period (music); Bounded function; Mathematics; Game theory; Private information retrieval; Nash equilibrium; Economics; Equilibrium selection; Statistics; Mathematical analysis","score_opus":0.0580672219543426,"score_gpt":0.34670635000639405,"score_spread":0.28863912805205144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575204797","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.9829607,0.000018775705,0.01169196,0.0003920706,0.00014739827,0.000369551,0.00003408289,0.000059127487,0.0043263426],"genre_scores_gemma":[0.9952208,0.00001037088,0.004177051,0.000082388295,0.0003304126,0.000072819086,0.000009620911,0.00003193301,0.0000646034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980653,0.00019882445,0.0006097286,0.0004539141,0.00013685177,0.00053538044],"domain_scores_gemma":[0.9961865,0.00239211,0.00018066748,0.0009109044,0.0000705295,0.00025931347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038090125,0.00019162621,0.00036556288,0.00014314675,0.000109841836,0.000193264,0.00073940185,0.0001051787,0.00027607035],"category_scores_gemma":[0.00060007296,0.00013900903,0.00007804891,0.0002681961,0.00067445304,0.00055724586,0.000097458265,0.00015057909,0.00016704557],"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.00021436535,0.00010826616,0.027015053,0.0000022308363,0.000009087341,3.55854e-7,0.0005181941,0.00066474214,0.0009325682,0.96593696,0.0000073616,0.004590794],"study_design_scores_gemma":[0.00063943764,0.0001392657,0.016906733,0.00001826608,0.000017161927,0.0000065031413,0.00080599036,0.010345576,0.0067240866,0.96274626,0.0013687598,0.00028197592],"about_ca_topic_score_codex":0.0000010837656,"about_ca_topic_score_gemma":9.0381053e-7,"teacher_disagreement_score":0.012260108,"about_ca_system_score_codex":0.000040782168,"about_ca_system_score_gemma":0.000029101915,"threshold_uncertainty_score":0.56686234},"labels":[],"label_agreement":null},{"id":"W1575902665","doi":"10.48550/arxiv.1401.3373","title":"An Iterated Game of Uncoordinated Sharing of Licensed Spectrum Using Zero-Determinant Strategies","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Service provider; Computer science; Stackelberg competition; License; Game theory; Repeated game; Computer network; Service (business); Business; Microeconomics; Economics; Marketing","score_opus":0.21468081335855466,"score_gpt":0.30101497122051496,"score_spread":0.0863341578619603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575902665","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.87881494,0.0000103219145,0.11939329,0.000011357886,0.00012897949,0.00024152498,0.000051953546,0.000055397977,0.0012922257],"genre_scores_gemma":[0.9991584,0.000009252039,0.00024325185,0.000009020545,0.000030513896,4.8014437e-7,0.00001752109,0.000021114987,0.00051049097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973187,0.00034395728,0.00071407284,0.0010871311,0.00023484217,0.0003012891],"domain_scores_gemma":[0.9958425,0.00036455496,0.0012124898,0.001902538,0.0005259375,0.00015196012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013177908,0.00030987628,0.00073226495,0.0006048223,0.00010987482,0.00015625983,0.0021362957,0.0002857178,0.00020915661],"category_scores_gemma":[0.00013618582,0.00029990068,0.00025000607,0.0012427346,0.00039256105,0.0004154377,0.00074229424,0.0003744766,0.00003121372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002105785,0.00023967067,0.0058851163,0.0000829666,0.00008220441,0.000041612817,0.0007675924,0.80886817,0.030804632,0.1527193,0.000016267924,0.00028191408],"study_design_scores_gemma":[0.0004229662,0.000115618896,0.0035982716,0.00017291524,0.00011958237,0.0000043773834,0.0010766187,0.51596546,0.01152588,0.46659246,0.000047473914,0.00035836597],"about_ca_topic_score_codex":0.00032837637,"about_ca_topic_score_gemma":0.000052227737,"teacher_disagreement_score":0.31387314,"about_ca_system_score_codex":0.00006971198,"about_ca_system_score_gemma":0.0002184946,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W1577419414","doi":"10.1007/978-3-540-27821-4_17","title":"Convergence Issues in Competitive Games","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Submodular set function; Nash equilibrium; Computer science; Convergence (economics); Mathematical economics; Outcome (game theory); Shapley value; Best response; Function (biology); Mathematical optimization; Graph; Game theory; Mathematics; Theoretical computer science; Economics","score_opus":0.04630530986479416,"score_gpt":0.3445192531479084,"score_spread":0.29821394328311424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577419414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024381964,0.0007612649,0.951417,0.0028505058,0.001241328,0.0006233746,0.000029215267,0.00008051314,0.040558595],"genre_scores_gemma":[0.9692938,0.000081105456,0.027019735,0.0011371662,0.0002692742,0.000015162093,0.000004011443,0.000021999815,0.0021577717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954819,0.00007308092,0.00081329176,0.0015349963,0.0016020761,0.00049465674],"domain_scores_gemma":[0.99611723,0.0018193763,0.00032759842,0.001244543,0.00034961506,0.00014161173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026014224,0.00039262013,0.000617651,0.0010358267,0.00017529358,0.00037217425,0.003050224,0.0002455037,0.0008340453],"category_scores_gemma":[0.0006690867,0.00031860243,0.00012209422,0.0011483947,0.0019591092,0.00035897546,0.00065982935,0.00071237003,0.0007929526],"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.00001433958,0.000050970244,0.0006851796,0.000009235259,0.0000044536973,0.000067045985,0.0020238683,0.03346306,0.00016550573,0.74486476,0.000033423526,0.21861814],"study_design_scores_gemma":[0.00018757714,0.00006278161,0.000946849,0.00026911098,0.0000030110527,0.000016638216,0.000004958029,0.005588916,0.0013629311,0.9834641,0.007699645,0.00039348195],"about_ca_topic_score_codex":0.000054585023,"about_ca_topic_score_gemma":0.00032060329,"teacher_disagreement_score":0.9668556,"about_ca_system_score_codex":0.00023417834,"about_ca_system_score_gemma":0.0004997676,"threshold_uncertainty_score":0.99998504},"labels":[],"label_agreement":null},{"id":"W1578925422","doi":"","title":"THE ROBUSTNESS OF EQUILIBRIUM ANALYSIS: THE CASE OF UNDOMINATED NASH EQUILIBRIUM","year":2006,"lang":"en","type":"preprint","venue":"eScholarship@McGill (McGill)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nash equilibrium; Mathematical economics; Complete information; Robustness (evolution); Monotonic function; Corollary; Sequential equilibrium; Stochastic game; Social choice theory; Bayesian game; Equilibrium selection; Mathematics; Epsilon-equilibrium; Solution concept; Computer science; Repeated game; Best response; Game theory; Discrete mathematics","score_opus":0.05509382591506524,"score_gpt":0.3260607089278943,"score_spread":0.27096688301282906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578925422","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.9744914,0.0005543202,0.000046719513,0.0002804662,0.0007305551,0.0012098748,0.0028251898,0.00011274891,0.019748684],"genre_scores_gemma":[0.99546933,0.000025627965,0.00041429632,0.00005411191,0.00006596728,0.00021819497,0.000079450416,0.00007837997,0.00359466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887833,0.0032360884,0.0034521134,0.001684895,0.0019852328,0.0008583766],"domain_scores_gemma":[0.97952193,0.00897776,0.0033837962,0.005715359,0.0021346118,0.00026656667],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.015104379,0.0008026806,0.0017454277,0.00080563506,0.0011826665,0.00039032043,0.005877418,0.00070303417,0.000248151],"category_scores_gemma":[0.0052014454,0.00048387598,0.0017361593,0.004971603,0.0014416582,0.00047469608,0.003933747,0.0018879884,0.000089041554],"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.0008044763,0.0010719077,0.00021533918,0.00024859945,0.0042017386,0.00029146625,0.000047706522,0.34595346,0.04013948,0.48257816,0.00020208418,0.12424558],"study_design_scores_gemma":[0.0019583753,0.00019436964,0.0017668594,0.00026865036,0.005948695,0.00043171583,0.0018482021,0.032359876,0.11117816,0.82252645,0.019568626,0.0019499959],"about_ca_topic_score_codex":0.00083152915,"about_ca_topic_score_gemma":0.0013287652,"teacher_disagreement_score":0.3399483,"about_ca_system_score_codex":0.00018471676,"about_ca_system_score_gemma":0.00014989663,"threshold_uncertainty_score":0.9997613},"labels":[],"label_agreement":null},{"id":"W1586050742","doi":"10.1109/icsmc.2003.1244464","title":"Status quo analysis of an environmental conflict","year":2004,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Status quo; Computer science; Conflict analysis; Influence diagram; Conflict resolution; Diagram; Resolution (logic); Table (database); Operations research; Political science; Artificial intelligence; Data mining; Decision tree; Mathematics; Law","score_opus":0.0940488218429036,"score_gpt":0.39996005857738115,"score_spread":0.30591123673447757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586050742","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.9810496,0.000011814902,0.0077424194,0.000087231565,0.000009469176,0.000045932084,0.000053002157,0.000011659002,0.010988849],"genre_scores_gemma":[0.997335,0.000004070081,0.0012370968,0.00011152497,0.0000053055323,0.0000031250563,0.000013980339,0.0000018676053,0.0012879914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901485,0.000042379907,0.00026211046,0.0001941939,0.0003862914,0.00010018509],"domain_scores_gemma":[0.9991783,0.0001553236,0.000082617,0.00047909952,0.000014162759,0.00009052105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005170951,0.00004587479,0.00014652486,0.0001907917,0.000047737736,0.000026780554,0.00027269317,0.000021161704,0.0046451706],"category_scores_gemma":[0.00005304517,0.000031896816,0.00009163232,0.0007107949,0.000118394266,0.00012249037,0.000033036675,0.000027505916,0.00032551168],"study_design_candidate":"observational","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.00008146297,0.0016066178,0.066050954,0.0000010299967,0.00069588487,0.00000449562,0.0081812,0.0567323,0.123919636,0.6506436,0.00024874677,0.091834076],"study_design_scores_gemma":[0.0006847142,0.00016402052,0.77820724,0.0000010363203,0.00037402916,0.0000018529133,0.007967949,0.0025956149,0.04812998,0.13021468,0.03142649,0.00023242265],"about_ca_topic_score_codex":0.000078037185,"about_ca_topic_score_gemma":0.000073967574,"teacher_disagreement_score":0.71215624,"about_ca_system_score_codex":0.000013927501,"about_ca_system_score_gemma":0.000013436882,"threshold_uncertainty_score":0.9962647},"labels":[],"label_agreement":null},{"id":"W1604446916","doi":"","title":"Bayesian reputation modeling in E-marketplaces sensitive to subjecthity, deception and change","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deception; Computer science; Reputation; Heuristics; Interpretation (philosophy); Probabilistic logic; Artificial intelligence; Subjectivity; Bayesian probability; Machine learning; Psychology; Social psychology","score_opus":0.37358274091608257,"score_gpt":0.4420146932122569,"score_spread":0.06843195229617433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604446916","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.55577815,0.0000054848824,0.42932048,0.0052468292,0.000084435414,0.00040499854,0.00002132348,0.000034269877,0.009104028],"genre_scores_gemma":[0.99797654,0.000005058059,0.0012419915,0.00041579184,0.00012213433,0.0000778108,0.000014087357,0.0000062561708,0.00014034758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975265,0.00023019894,0.0005822986,0.00053465966,0.0009400001,0.00018633206],"domain_scores_gemma":[0.99812794,0.0006997781,0.00012096836,0.00015683191,0.0008198122,0.000074695556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026849636,0.00012965187,0.00015861847,0.000509516,0.00017514307,0.00032193685,0.00021619245,0.000080970036,0.00016519059],"category_scores_gemma":[0.001506273,0.00012148972,0.00003183897,0.00087468344,0.000084635,0.00043008558,0.000053652646,0.00014830087,0.00036449058],"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.00015625649,0.00010767139,0.00019079521,0.0000017006702,0.0000017713875,0.0000020785733,0.0013353927,0.038559593,0.0037664662,0.78383493,0.000050497678,0.17199285],"study_design_scores_gemma":[0.0000143688185,0.00003108987,0.0027585768,0.000017825918,0.0000012020677,0.0000017953873,0.001000109,0.42815647,0.003810327,0.5640832,0.000026578717,0.00009841295],"about_ca_topic_score_codex":0.00027180256,"about_ca_topic_score_gemma":0.0025575096,"teacher_disagreement_score":0.4421984,"about_ca_system_score_codex":0.00007865379,"about_ca_system_score_gemma":0.00007466379,"threshold_uncertainty_score":0.4954207},"labels":[],"label_agreement":null},{"id":"W1608293404","doi":"10.1007/978-3-540-72665-4_3","title":"Competition and Coordination in Stochastic Games","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Competition (biology); Variety (cybernetics); Class (philosophy); Artificial intelligence; Reinforcement learning; Set (abstract data type); Hill climbing; Theoretical computer science; Mathematical optimization; Machine learning; Mathematics","score_opus":0.05803968769199988,"score_gpt":0.34314482509648364,"score_spread":0.28510513740448373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608293404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003088851,0.00015579136,0.9891381,0.0007506415,0.00030999657,0.00029206352,0.000006210957,0.000026160547,0.0062321555],"genre_scores_gemma":[0.9855613,0.0000047139843,0.012976051,0.00045237612,0.00014391598,0.000006222129,0.000004166472,0.000011116675,0.00084014906],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723774,0.000041165225,0.00054066913,0.0009054588,0.0009911489,0.00028383924],"domain_scores_gemma":[0.9967226,0.002185628,0.00023290081,0.0005450622,0.0002229177,0.00009092793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033699246,0.00022446924,0.00032875262,0.0012900593,0.00014508885,0.00028948914,0.000869898,0.0001844232,0.000094331765],"category_scores_gemma":[0.0005486541,0.0001886037,0.000042850636,0.00075649424,0.00095384865,0.00025971976,0.0002952102,0.00043284308,0.00007745964],"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.000011472738,0.00002272307,0.00012381734,0.000004701027,0.0000015049436,0.00001013723,0.00058480864,0.030330915,0.00012954028,0.20277175,0.000013650603,0.76599497],"study_design_scores_gemma":[0.00018036831,0.00005166198,0.0018317607,0.00014250178,0.0000030980202,0.000026044094,0.0000016998763,0.088568486,0.00009978229,0.90750384,0.0013485415,0.00024220874],"about_ca_topic_score_codex":0.0000112927855,"about_ca_topic_score_gemma":0.00024942053,"teacher_disagreement_score":0.9824724,"about_ca_system_score_codex":0.00011389639,"about_ca_system_score_gemma":0.00011179234,"threshold_uncertainty_score":0.7691036},"labels":[],"label_agreement":null},{"id":"W1609159258","doi":"10.1063/1.3241347","title":"Dynamics of Equilibrium Problems: A Hybrid Systems Approach","year":2009,"lang":"en","type":"article","venue":"AIP conference proceedings","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":"University of Guelph","funders":"","keywords":"Disequilibrium; Computer science; Jump; Hybrid system; Mathematical optimization; Dynamical systems theory; Interval (graph theory); Population; Variational inequality; Track (disk drive); Dynamical system (definition); Projection (relational algebra); Statistical physics; Mathematics; Algorithm; Physics","score_opus":0.0778672397861505,"score_gpt":0.3199297420564352,"score_spread":0.2420625022702847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609159258","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.71118903,0.00010583791,0.11337163,0.002395332,0.000100263715,0.0009033358,0.000043967946,0.00017405688,0.17171656],"genre_scores_gemma":[0.99696887,0.0000057760244,0.00093858526,0.000076472716,0.000047153608,0.000052052616,0.000008039094,0.000008496797,0.0018945379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975748,0.000024924098,0.00073071645,0.00053938426,0.0008186673,0.00031150528],"domain_scores_gemma":[0.9978356,0.00013758297,0.00046678836,0.00034167804,0.0010850462,0.00013330615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017334615,0.00018015118,0.00039241774,0.00019620598,0.00008481356,0.00036638888,0.0012140201,0.00007257278,0.00005814746],"category_scores_gemma":[0.00053250795,0.00013961233,0.00008868823,0.0007547156,0.00019126489,0.0005151409,0.000100931364,0.00017396588,0.00009694792],"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.000025973939,0.00022916507,0.003959416,0.000050370967,0.00001094934,4.3862357e-7,0.0015372722,0.000054292443,0.020442141,0.96272403,0.0016833179,0.009282603],"study_design_scores_gemma":[0.00032175265,0.0002765109,0.0027507227,0.00008836369,0.000025599757,0.00005847472,0.0048528737,0.36408255,0.0012865327,0.6239388,0.0019793038,0.0003385618],"about_ca_topic_score_codex":0.000011824312,"about_ca_topic_score_gemma":5.5874074e-7,"teacher_disagreement_score":0.36402825,"about_ca_system_score_codex":0.000035137662,"about_ca_system_score_gemma":0.00009273451,"threshold_uncertainty_score":0.5693225},"labels":[],"label_agreement":null},{"id":"W1614386032","doi":"10.5235/20403313.4.2.273","title":"Reasons and Decisions","year":2013,"lang":"en","type":"article","venue":"Jurisprudence","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Political science; Law and economics; Law; Sociology","score_opus":0.089081202688771,"score_gpt":0.3927393620428864,"score_spread":0.3036581593541154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614386032","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.96015203,0.00014489472,0.011161476,0.0051287976,0.000081251936,0.00021471786,0.000005879937,0.0000536627,0.023057312],"genre_scores_gemma":[0.98936445,0.000032692216,0.0035309484,0.00038665108,0.000038148835,0.00006102173,4.1342673e-7,0.000004644812,0.006581006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986534,0.0000783573,0.00026492626,0.0003410226,0.00049376825,0.00016853282],"domain_scores_gemma":[0.99666697,0.00225314,0.00007808048,0.00065874244,0.00017050284,0.00017256802],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00086231274,0.000077878074,0.00012058385,0.00008858016,0.00021322492,0.0002865777,0.0005842182,0.00004412304,0.0016598738],"category_scores_gemma":[0.002712681,0.000053661333,0.00003787081,0.0004858445,0.00017079664,0.00037912748,0.00017095909,0.00009542533,0.0074124527],"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.0000073367587,0.000100637015,0.02377076,0.0000010861273,0.000007768682,0.0000039468914,0.000769087,0.000017417613,0.008761437,0.32711038,0.1597063,0.47974384],"study_design_scores_gemma":[0.000085555635,0.00002020993,0.25658667,0.000010611705,0.00000406377,0.00002004596,0.0003877699,0.00035508434,0.0004995149,0.66380346,0.078109644,0.0001173575],"about_ca_topic_score_codex":0.000029615958,"about_ca_topic_score_gemma":0.000009856927,"teacher_disagreement_score":0.47962648,"about_ca_system_score_codex":0.0000061848446,"about_ca_system_score_gemma":0.000022672679,"threshold_uncertainty_score":0.99925274},"labels":[],"label_agreement":null},{"id":"W162372568","doi":"","title":"Bound For 2-Exponents of Primitive Extremal Tournaments.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.13004630986359506,"score_gpt":0.3715315202130298,"score_spread":0.24148521034943476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162372568","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.9922217,0.000041674975,0.0005448229,0.00018714095,0.00054028543,0.0003038471,0.0000225691,0.000017368893,0.0061205802],"genre_scores_gemma":[0.9970865,0.0000069651333,0.00046218096,0.00006290292,0.000008244948,0.00005057256,0.000004030612,0.000008332939,0.0023102327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984999,0.00007825111,0.00043853765,0.000263999,0.00053790805,0.00018142175],"domain_scores_gemma":[0.99797916,0.0009142394,0.00024988904,0.0004449,0.00032798524,0.00008379571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085523527,0.00009280853,0.00022393132,0.00009470387,0.00023534599,0.000027365679,0.0005297009,0.000049876693,0.00015749256],"category_scores_gemma":[0.00076175906,0.0000767786,0.00011970548,0.00032791717,0.0001896304,0.00017146667,0.00007609171,0.00006513935,0.00012283037],"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.000078906814,0.00035299337,0.008805687,0.0000029187513,0.000025182797,0.0000026899322,0.0009533141,0.000005620403,0.006446686,0.9725236,0.008243853,0.0025585215],"study_design_scores_gemma":[0.0008614958,0.00011317194,0.029078357,0.000007387421,0.000009378095,0.00000776241,0.00026452274,0.00005474393,0.012833843,0.94831717,0.008356939,0.00009521471],"about_ca_topic_score_codex":0.000005257143,"about_ca_topic_score_gemma":8.285049e-7,"teacher_disagreement_score":0.024206445,"about_ca_system_score_codex":0.000024992452,"about_ca_system_score_gemma":0.00006111616,"threshold_uncertainty_score":0.31309402},"labels":[],"label_agreement":null},{"id":"W1645009427","doi":"10.1111/j.1558-5646.2011.01274.x","title":"THE OPTIMAL SAMPLING STRATEGY FOR UNFAMILIAR PREY","year":2011,"lang":"en","type":"article","venue":"Evolution","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Predation; Biology; Mimicry; Bayesian inference; Müllerian mimicry; Inference; Predator; Aposematism; Coevolution; Ecology; Bayesian probability; Artificial intelligence; Computer science","score_opus":0.3315319543390005,"score_gpt":0.4200102248316339,"score_spread":0.0884782704926334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645009427","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.30311227,0.00013621338,0.6836981,0.00017581029,0.00020205564,0.0003310553,0.000014941583,0.000046981946,0.012282561],"genre_scores_gemma":[0.99311453,0.0000033360825,0.0043229926,0.000016837967,0.00008046394,0.00007657436,0.0000018475746,0.0000043636387,0.0023790377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991308,0.00006386622,0.00023307493,0.00019493524,0.00021644593,0.00016088679],"domain_scores_gemma":[0.99866784,0.000672711,0.00009278108,0.00036665366,0.00016023427,0.000039757015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017765546,0.000054769534,0.00006119152,0.000032348486,0.0004969359,0.00006698933,0.0004102889,0.00003682129,0.00008007453],"category_scores_gemma":[0.0006015809,0.000033233086,0.000060459653,0.00020468203,0.00009817985,0.00014931572,0.000033274773,0.0000530942,0.0002897602],"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.000071303286,0.000034170662,0.0005566769,8.147828e-7,0.0000062214726,5.1306387e-8,0.00041751107,0.0010613829,0.0009757579,0.97085005,0.0026488518,0.02337723],"study_design_scores_gemma":[0.00013438099,0.00007115749,0.04392549,0.0000026073362,0.000008299686,0.0000018210305,0.0015465165,0.0071885297,0.000753869,0.92207915,0.024210155,0.000078046825],"about_ca_topic_score_codex":0.000012693132,"about_ca_topic_score_gemma":0.000025543683,"teacher_disagreement_score":0.69000226,"about_ca_system_score_codex":0.000022130656,"about_ca_system_score_gemma":0.000038854272,"threshold_uncertainty_score":0.38220796},"labels":[],"label_agreement":null},{"id":"W1646856192","doi":"10.1023/a:1008713120075","title":"Coalition Analysis in Group Decision Support","year":2001,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":170,"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 Waterloo; Toronto Metropolitan University; Wilfrid Laurier University","funders":"","keywords":"Operations research; Computer science; Management science; Decision analysis; Decision support system; Mathematics; Mathematical economics; Engineering; Artificial intelligence","score_opus":0.05666481454648493,"score_gpt":0.37236245209305463,"score_spread":0.3156976375465697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646856192","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.6126581,0.000063233434,0.38501891,0.0002790325,0.00014104329,0.00020351441,0.000011465427,0.000039202656,0.0015855171],"genre_scores_gemma":[0.99371296,0.00022365962,0.005003825,0.00044164737,0.00007143468,0.000034865057,0.00009482813,0.00001213598,0.00040461507],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9960513,0.00028775434,0.0011714548,0.00085111684,0.0013233017,0.00031507426],"domain_scores_gemma":[0.9956434,0.0028591948,0.00032155935,0.000782442,0.00018759965,0.00020581408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0047431528,0.00021126092,0.00044827763,0.0014993851,0.00027330493,0.00035143024,0.0004715744,0.00018028471,0.0020201004],"category_scores_gemma":[0.0014561597,0.00016969495,0.00020284047,0.0046495437,0.00008415927,0.00082156225,0.00014487396,0.00017747462,0.00065241655],"study_design_candidate":"observational","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.00045087418,0.00031946294,0.13731924,0.000001597033,0.000033666776,0.000018357614,0.0005125219,0.0006745962,0.00095921085,0.035936475,0.002778387,0.8209956],"study_design_scores_gemma":[0.00096417795,0.000102722064,0.70223176,0.000014837467,0.00006977978,0.00002089446,0.00052118755,0.0127410805,0.0000377806,0.25801367,0.025060602,0.00022150963],"about_ca_topic_score_codex":0.000051812785,"about_ca_topic_score_gemma":0.0009884561,"teacher_disagreement_score":0.8207741,"about_ca_system_score_codex":0.000067482055,"about_ca_system_score_gemma":0.00001764405,"threshold_uncertainty_score":0.9988922},"labels":[],"label_agreement":null},{"id":"W1651715594","doi":"10.1109/tnse.2015.2500162","title":"The Strategic Formation of Multi-Layer Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enhanced Data Rates for GSM Evolution; Layer (electronics); Nash equilibrium; Computer science; Network layer; Network formation; Mathematical optimization; Game theory; Set (abstract data type); Network topology; Strategy; Topology (electrical circuits); Mathematics; Computer network; Artificial intelligence; Mathematical economics; Combinatorics","score_opus":0.135086230070719,"score_gpt":0.33015150198233567,"score_spread":0.19506527191161668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651715594","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.09259576,0.00012390959,0.906069,0.00013040545,0.0004737423,0.000108813925,0.0000013994937,0.00003190748,0.00046505727],"genre_scores_gemma":[0.9986687,0.000044324355,0.0010849441,0.000027195447,0.000044938184,0.000018397888,1.01636054e-7,0.000004260045,0.00010714847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986667,0.00002811854,0.00028888858,0.00018378063,0.00058119575,0.00025134202],"domain_scores_gemma":[0.998805,0.000413594,0.000071559334,0.000308534,0.0002629546,0.0001383635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003516975,0.00008250912,0.000099441735,0.0001000827,0.00045183225,0.00018317899,0.00042234213,0.00003387222,0.00000397196],"category_scores_gemma":[0.00004389074,0.000052868156,0.00003228113,0.0014836778,0.00024516974,0.00042045218,0.0000033578083,0.00013770268,0.000013795011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007253056,0.000010845359,0.0000023698678,6.712004e-7,0.0000016289795,1.18763325e-7,0.00011822581,0.9824079,0.00057580543,0.00400863,0.00008130089,0.012785195],"study_design_scores_gemma":[0.00013148687,0.000038522117,0.000110644505,0.000010502022,0.000005370072,0.000006245316,0.00062832,0.9946948,0.0012805216,0.0020805318,0.00094045926,0.000072593604],"about_ca_topic_score_codex":0.0000037693962,"about_ca_topic_score_gemma":0.000013971093,"teacher_disagreement_score":0.9060729,"about_ca_system_score_codex":0.000026417292,"about_ca_system_score_gemma":0.000068812915,"threshold_uncertainty_score":0.3475174},"labels":[],"label_agreement":null},{"id":"W165596894","doi":"","title":"A polynomial-time algorithm for action-graph games","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Graph; Time complexity; Representation (politics); Mathematics; Polynomial; Bounded function; Theoretical computer science; Context (archaeology); Computer science; Algorithm; Discrete mathematics","score_opus":0.275005480657108,"score_gpt":0.44427386357591075,"score_spread":0.16926838291880275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165596894","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.01577238,0.000020671427,0.92345166,0.005708926,0.0004723719,0.00072443666,0.00039361214,0.00014445119,0.053311504],"genre_scores_gemma":[0.98233646,0.0000036498996,0.0087411525,0.00037283002,0.00053194066,0.00019628285,0.000049279868,0.000013107523,0.0077553135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703944,0.0001173818,0.0007520819,0.00059615367,0.0012173785,0.0002775687],"domain_scores_gemma":[0.99568003,0.0021106543,0.00026877428,0.00031316595,0.0015385008,0.00008884898],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001790717,0.00018303207,0.00023019136,0.00038446818,0.00039730722,0.00039507757,0.00069332763,0.0001113625,0.0021549554],"category_scores_gemma":[0.001186717,0.00015750893,0.00017339492,0.0007841294,0.00025578265,0.0002566307,0.00003813329,0.00015200902,0.0036235186],"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.00004640556,0.0001713672,0.0000069069715,7.395284e-7,0.0000062688428,3.2768912e-7,0.00003776781,0.0009561442,0.0056213117,0.54740864,0.013062763,0.43268138],"study_design_scores_gemma":[0.000035127527,0.00007216541,0.00025959002,0.000007107263,0.0000054664342,0.0000024423184,0.00022348142,0.0878851,0.032164678,0.86121285,0.017946064,0.00018592623],"about_ca_topic_score_codex":0.000038228303,"about_ca_topic_score_gemma":0.000060051738,"teacher_disagreement_score":0.96656406,"about_ca_system_score_codex":0.000061500476,"about_ca_system_score_gemma":0.00024158295,"threshold_uncertainty_score":0.9987572},"labels":[],"label_agreement":null},{"id":"W1722412788","doi":"10.1111/j.1467-9396.2011.00955.x","title":"Forming Efficient Free‐Trade Networks: A Sequential Mechanism","year":2011,"lang":"en","type":"article","venue":"Review of International Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Subgame perfect equilibrium; Economics; Outcome (game theory); Free trade; Markov perfect equilibrium; Mechanism (biology); Mathematical economics; Subgame; Network formation; International trade; Microeconomics; Computer science; Repeated game; Nash equilibrium; Game theory; Equilibrium selection; Physics","score_opus":0.11123124175756993,"score_gpt":0.35148271369205575,"score_spread":0.24025147193448582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722412788","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.19178876,0.030402789,0.49316314,0.008984542,0.0049831173,0.0022098375,0.0005003647,0.00014068298,0.26782677],"genre_scores_gemma":[0.96050715,0.024387771,0.012421237,0.001985191,0.00023801088,0.000054255197,0.00001908443,0.000016437774,0.00037083117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864763,0.00004783424,0.000781923,0.00023158279,0.00018368966,0.00010736804],"domain_scores_gemma":[0.9986858,0.0002076411,0.00048314384,0.0004644824,0.00010392315,0.00005503778],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001814456,0.00008683677,0.00023852491,0.0000852126,0.00004117722,0.00002568751,0.0012077536,0.00003334915,0.001697472],"category_scores_gemma":[0.00036650992,0.000071471164,0.00019183975,0.00011068838,0.000054443466,0.00015800593,0.00018599453,0.000068191075,0.00014469381],"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.0000075056755,0.000050214745,0.000032492473,0.000030315949,0.00002697472,4.2874578e-7,0.00007667536,0.0003905448,0.000024321078,0.97985274,0.00071164005,0.018796168],"study_design_scores_gemma":[0.00053136825,0.00006402101,0.0006813719,0.0014177207,0.00006791538,0.000062737505,0.00020800141,0.084446974,0.0024698456,0.78158385,0.12807636,0.00038981542],"about_ca_topic_score_codex":0.000006420158,"about_ca_topic_score_gemma":0.0000045419465,"teacher_disagreement_score":0.7687184,"about_ca_system_score_codex":0.000043338776,"about_ca_system_score_gemma":0.00003797393,"threshold_uncertainty_score":0.9992151},"labels":[],"label_agreement":null},{"id":"W1784946991","doi":"","title":"Empirically Evaluating Multiagent Reinforcement Learning Algorithms","year":2005,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reinforcement learning; Computer science; Regret; Artificial intelligence; Convergence (economics); Variety (cybernetics); Machine learning; Test (biology); Nash equilibrium; Mathematical optimization; Mathematics","score_opus":0.26109125382031484,"score_gpt":0.49437850659256566,"score_spread":0.23328725277225082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784946991","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.2676253,0.000037617152,0.56987375,0.0052531543,0.00008960169,0.0003426016,8.0890675e-7,0.00016798388,0.15660916],"genre_scores_gemma":[0.905879,0.0000025814018,0.03363121,0.00080366025,0.00012756651,0.000031858097,0.000002698437,0.0000058651112,0.05951556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771273,0.000168597,0.00054379395,0.00033129775,0.0010262401,0.00021735071],"domain_scores_gemma":[0.9983056,0.0008178736,0.00014503882,0.0004010221,0.00021580077,0.00011464859],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0039519537,0.00009303335,0.00012794326,0.00009026243,0.00029547533,0.00014755182,0.0004563669,0.000035683966,0.010525484],"category_scores_gemma":[0.0016887519,0.00006412436,0.000080156606,0.00038754274,0.000045740977,0.00019007425,0.00013981311,0.00014178877,0.0066084247],"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.000007489985,0.000040415325,0.00041427417,4.1980618e-7,0.0000065034183,4.1876766e-7,0.00079075486,0.15856417,0.0023059607,0.009771637,0.003043471,0.82505447],"study_design_scores_gemma":[0.0003858301,0.000113855116,0.0021398738,0.000004337559,0.000008890887,0.000004470382,0.001215427,0.6892925,0.0044737454,0.008862239,0.29331708,0.00018178314],"about_ca_topic_score_codex":0.000008183733,"about_ca_topic_score_gemma":0.000006872764,"teacher_disagreement_score":0.82487273,"about_ca_system_score_codex":0.000036278016,"about_ca_system_score_gemma":0.0000353594,"threshold_uncertainty_score":0.99416506},"labels":[],"label_agreement":null},{"id":"W1788846219","doi":"10.5220/0004811700500059","title":"Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns","year":2014,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nash equilibrium; Computer science; Reinforcement learning; Class (philosophy); Computation; Pareto optimal; Mathematical optimization; Theoretical computer science; Pareto principle; Mathematics; Multi-objective optimization; Algorithm; Artificial intelligence","score_opus":0.07539226596707282,"score_gpt":0.3811754951195865,"score_spread":0.30578322915251366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788846219","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.80860806,0.000016278915,0.18588594,0.00031774316,0.000022586515,0.00016970352,0.000008966818,0.000025748323,0.0049449685],"genre_scores_gemma":[0.9897364,0.0000023958648,0.009766672,0.000055198474,0.00001766694,0.00000656239,0.0000055161913,0.000006937929,0.0004026672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983344,0.00016760908,0.0005178981,0.00025697428,0.00057577185,0.00014734671],"domain_scores_gemma":[0.99812335,0.000698322,0.00036250742,0.0004229123,0.00031222717,0.00008067271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009326945,0.00009741588,0.00029508572,0.00007352706,0.00004097251,0.000043096315,0.0004950886,0.000040939216,0.00046718988],"category_scores_gemma":[0.00040188184,0.000062610496,0.00006577201,0.00038925585,0.00026317706,0.00017103365,0.000080567675,0.000049596238,0.000043413864],"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.0007762162,0.00043428858,0.0490171,0.00004601111,0.00010641805,0.0000010582673,0.004304826,0.0200792,0.04903924,0.78489906,0.007611716,0.08368484],"study_design_scores_gemma":[0.0075940136,0.0017823104,0.11205565,0.00024594332,0.00017865816,0.00002552278,0.008006584,0.164039,0.23919454,0.4285123,0.03734632,0.0010191457],"about_ca_topic_score_codex":0.000014405242,"about_ca_topic_score_gemma":0.000011644994,"teacher_disagreement_score":0.35638678,"about_ca_system_score_codex":0.000006497368,"about_ca_system_score_gemma":0.00004736323,"threshold_uncertainty_score":0.5115402},"labels":[],"label_agreement":null},{"id":"W1831799901","doi":"10.1007/978-3-540-72951-8_25","title":"Selfish Routing with Oblivious Users","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Computer science; Latency (audio); Computer network; Routing (electronic design automation); Static routing; Policy-based routing; Equal-cost multi-path routing; The Internet; Flow network; Routing domain; Hierarchical routing; Distributed computing; Routing protocol; Mathematical optimization; Mathematics; World Wide Web; Telecommunications","score_opus":0.0699192145958308,"score_gpt":0.3368978829090431,"score_spread":0.2669786683132123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831799901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022556807,0.00006124121,0.96372426,0.00045448428,0.00042746507,0.00030954304,0.000006678938,0.00009118647,0.03266944],"genre_scores_gemma":[0.8800173,0.000006521359,0.114544414,0.0021189824,0.00045871912,0.0000064534647,0.0000031233565,0.000039874405,0.0028046316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950341,0.000040816147,0.00066724775,0.0014794586,0.0021814771,0.0005968996],"domain_scores_gemma":[0.99487215,0.002577487,0.00043149476,0.0014602522,0.00045686477,0.00020173503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004531265,0.00039149035,0.00047375596,0.00095196854,0.00040198083,0.0006905642,0.0028774315,0.00024709507,0.00020637826],"category_scores_gemma":[0.00040843396,0.00027492075,0.00010417184,0.0011732657,0.0013388343,0.00032832855,0.00053005747,0.0007591331,0.00034997193],"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.000022974024,0.00002939763,0.0007864234,0.0000047493504,0.00000979333,0.00007353698,0.0012439106,0.025730554,0.000056523364,0.046166588,0.000068182024,0.92580736],"study_design_scores_gemma":[0.0004010467,0.00025388724,0.0013018014,0.00031126128,0.00002263442,0.00020720536,0.000005192777,0.041756433,0.0009675587,0.93796045,0.01571265,0.0010998695],"about_ca_topic_score_codex":0.000013345175,"about_ca_topic_score_gemma":0.00024534675,"teacher_disagreement_score":0.9247075,"about_ca_system_score_codex":0.00014839855,"about_ca_system_score_gemma":0.0003571943,"threshold_uncertainty_score":0.9999703},"labels":[],"label_agreement":null},{"id":"W1853731358","doi":"10.1007/978-3-642-38233-8_14","title":"Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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 Waterloo","funders":"","keywords":"Upper and lower bounds; Price of stability; Stability (learning theory); Combinatorics; Nash equilibrium; Shapley value; Function (biology); Mathematics; Undirected graph; Discrete mathematics; Computer science; Mathematical economics; Game theory; Graph; Mathematical analysis; Economics","score_opus":0.09273870334345653,"score_gpt":0.30727903446057636,"score_spread":0.21454033111711984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853731358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009958024,0.00019458303,0.98268104,0.001468298,0.0004158635,0.0011672805,0.0000060412226,0.000029342815,0.004079516],"genre_scores_gemma":[0.97495824,0.000009351307,0.023408705,0.0010284394,0.0002124283,0.000043550917,7.772042e-7,0.00001680578,0.0003216842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959542,0.0004105009,0.00079843163,0.0010215954,0.0013588391,0.0004564085],"domain_scores_gemma":[0.9783801,0.018740237,0.00057815865,0.0018815896,0.00035431053,0.000065635875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010444404,0.00030809426,0.0004339115,0.0002700225,0.00037567134,0.0004619643,0.0038623444,0.00017461344,0.00039898613],"category_scores_gemma":[0.0024045862,0.00015206359,0.00010753801,0.0014831905,0.0019393446,0.0001879623,0.0006326369,0.0007988401,0.000085346226],"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.00005251429,0.00007758754,0.00027544628,0.0000115317935,0.000012111932,0.0000034213294,0.0028558236,0.23724502,0.00083854614,0.1790135,0.0002566784,0.5793578],"study_design_scores_gemma":[0.00008040623,0.000085705426,0.0016567389,0.000117888056,0.000005146722,0.0000035646158,0.0000043163536,0.15769723,0.0013256884,0.83807206,0.00072951656,0.00022173303],"about_ca_topic_score_codex":0.00006777932,"about_ca_topic_score_gemma":0.00015667327,"teacher_disagreement_score":0.9650002,"about_ca_system_score_codex":0.00012671483,"about_ca_system_score_gemma":0.00038560748,"threshold_uncertainty_score":0.7177261},"labels":[],"label_agreement":null},{"id":"W1892095999","doi":"10.1287/opre.1110.0964","title":"Rational Generating Functions and Integer Programming Games","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Integer programming; Nash equilibrium; Integer (computer science); Dimension (graph theory); Class (philosophy); Price of anarchy; Stochastic game; Game theory; Action (physics)","score_opus":0.47876759126902424,"score_gpt":0.5057032951195757,"score_spread":0.02693570385055144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892095999","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.81667435,0.00021621518,0.1096299,0.0023811774,0.00014213551,0.0008171847,0.00002770846,0.000081889964,0.07002946],"genre_scores_gemma":[0.9446275,0.000009419255,0.019070262,0.00005160523,0.00012647161,0.0003667514,0.0000139513095,0.000008763987,0.035725247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976647,0.0004721647,0.00036512592,0.00041196318,0.0008193764,0.0002666901],"domain_scores_gemma":[0.9977537,0.0006093176,0.000020534391,0.0004595277,0.001020715,0.0001362263],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0047311415,0.00008049879,0.00010248244,0.0003601063,0.0015592107,0.00066767185,0.0003505363,0.000052819152,0.002599478],"category_scores_gemma":[0.0023495355,0.00006075343,0.000035681904,0.0011019974,0.00038586173,0.00048300732,0.00017639312,0.0002937588,0.0010390145],"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.000025983703,0.00030796413,0.0036881433,0.0000029555806,0.000026188256,0.0000035100184,0.006974122,0.0012107111,0.014772409,0.6969182,0.009818218,0.26625162],"study_design_scores_gemma":[0.0012837688,0.0007196318,0.028435318,0.000059059545,0.00003652756,0.00016261001,0.065499686,0.22121601,0.0128291,0.14532062,0.52336615,0.0010714929],"about_ca_topic_score_codex":0.00009005782,"about_ca_topic_score_gemma":0.00036823534,"teacher_disagreement_score":0.55159754,"about_ca_system_score_codex":0.000022704455,"about_ca_system_score_gemma":0.00015153886,"threshold_uncertainty_score":0.9997406},"labels":[],"label_agreement":null},{"id":"W1894388702","doi":"10.5282/edoc.13750","title":"Three Essays on Commitment and Information Problems","year":2011,"lang":"en","type":"article","venue":"Electronic Theses of LMU Munich (Ludwig-Maximilians-Universität München)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; Northwestern University","keywords":"Psychology; Sociology","score_opus":0.07684071444212204,"score_gpt":0.2781104889980469,"score_spread":0.20126977455592487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894388702","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.7751902,0.0010962676,0.016578298,0.0018897787,0.00019558227,0.0017750422,0.000113955764,0.00023638991,0.2029245],"genre_scores_gemma":[0.99769443,0.00029871525,0.0006837884,0.00023154974,0.000023550354,0.000026126045,0.000017482856,0.000018418375,0.0010059557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970391,0.0002289081,0.0006930189,0.00048671654,0.00088990515,0.0006623614],"domain_scores_gemma":[0.99678975,0.00078774954,0.0004997655,0.0013961925,0.00032999745,0.00019652302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016451403,0.00033948154,0.00047444404,0.00048445928,0.0004265938,0.00008604257,0.0017339066,0.00018074486,0.00083895435],"category_scores_gemma":[0.0002925153,0.0002884529,0.00018496889,0.0008364479,0.00047386464,0.002984949,0.00036840307,0.00045402642,0.00044091645],"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.00038350932,0.00032287542,0.0005497762,0.000022583754,0.00014787981,0.000002652314,0.010563111,0.00015307013,0.00041615666,0.94833297,0.0010051492,0.038100258],"study_design_scores_gemma":[0.0027732702,0.0018457623,0.0053411606,0.00013565086,0.00021421438,0.00003253368,0.015749285,0.0017544997,0.0053626276,0.79870105,0.16721237,0.000877602],"about_ca_topic_score_codex":0.00029659085,"about_ca_topic_score_gemma":0.00056465535,"teacher_disagreement_score":0.22250423,"about_ca_system_score_codex":0.0002327588,"about_ca_system_score_gemma":0.0002505563,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W1895449838","doi":"10.3968/7518","title":"A Study of Law-Based Chinese Petition System From the Perspective of Evolutionary Game Model","year":2015,"lang":"en","type":"article","venue":"Canadian social science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lawsuit; China; Position (finance); State (computer science); Perspective (graphical); Law; Function (biology); Track (disk drive); Law and economics; Political science; Sociology; Business; Computer science","score_opus":0.10881320966825733,"score_gpt":0.38051180833701564,"score_spread":0.27169859866875834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895449838","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.9306646,0.000025435662,0.0006770317,0.00068360957,0.00007516425,0.000274101,0.00021467898,0.000009687341,0.067375675],"genre_scores_gemma":[0.9996835,5.7048226e-8,0.0000935573,0.00010172634,0.000053571384,0.00002572781,0.0000011520347,0.0000025832435,0.000038107264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99817306,0.00016138103,0.00024148978,0.00027317333,0.0009862748,0.00016461304],"domain_scores_gemma":[0.9979978,0.00026883066,0.00016374604,0.00035133303,0.0010022416,0.00021603424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018129399,0.000063208194,0.00014530137,0.000110794215,0.00040128265,0.000045044646,0.0009963423,0.000028430151,0.00002061706],"category_scores_gemma":[0.00074788765,0.0000418117,0.00004458094,0.0013979516,0.0010817692,0.00021842228,0.00004267041,0.000065063534,0.000020941887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017916182,0.0000972153,0.009525009,8.3092135e-7,0.0000049614055,0.0000014686225,0.040842116,0.0021869654,0.0003096695,0.94637084,0.00049836235,0.0001446606],"study_design_scores_gemma":[0.000779776,0.00014852526,0.07726401,0.000018693165,0.00002802107,0.000001526821,0.5345549,0.042931315,0.00007712639,0.34336174,0.000623588,0.00021079602],"about_ca_topic_score_codex":0.053316757,"about_ca_topic_score_gemma":0.04564919,"teacher_disagreement_score":0.6030091,"about_ca_system_score_codex":0.00045719667,"about_ca_system_score_gemma":0.0015115162,"threshold_uncertainty_score":0.9717652},"labels":[],"label_agreement":null},{"id":"W1919930141","doi":"10.2139/ssrn.1923151","title":"Dynamic Coordination Via Organizational Routines","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Business; Process management; Computer science; Dynamic capabilities; Knowledge management","score_opus":0.030154948378733115,"score_gpt":0.31099637806207875,"score_spread":0.28084142968334563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919930141","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.39710525,0.00025029856,0.5931711,0.0015475235,0.00021884001,0.00010997506,0.0000029929101,0.000049484755,0.007544507],"genre_scores_gemma":[0.99119747,0.00005964236,0.0005165397,0.00008261327,0.000074953656,0.0000037557313,0.0000039089405,0.000012585368,0.008048528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978421,0.00014066072,0.00041408607,0.00021559112,0.00054405944,0.00084351347],"domain_scores_gemma":[0.99882275,0.00015427612,0.00026125473,0.00024059214,0.0004483889,0.00007276482],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0040337113,0.00010094216,0.00012338258,0.00018701574,0.00035410674,0.00008195876,0.0006642956,0.000053054046,0.0011125637],"category_scores_gemma":[0.00055843155,0.00007624945,0.00007183493,0.00075265043,0.00006840397,0.0003203329,0.00004600175,0.00059111824,0.0008999548],"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.000021121114,0.000078495985,0.0045361025,2.7996995e-7,0.000026822667,6.844095e-7,0.00033047088,0.000018449062,0.0013239454,0.96532595,0.00013653489,0.028201122],"study_design_scores_gemma":[0.00019152541,0.000066231376,0.007258224,0.0000016253083,0.000011548699,0.00030540043,0.0010327634,0.0008708682,0.00020593204,0.98918515,0.0007769153,0.00009381053],"about_ca_topic_score_codex":0.000008447696,"about_ca_topic_score_gemma":0.00016492582,"teacher_disagreement_score":0.59409225,"about_ca_system_score_codex":0.00023634631,"about_ca_system_score_gemma":0.00065694464,"threshold_uncertainty_score":0.999878},"labels":[],"label_agreement":null},{"id":"W1931733763","doi":"10.1007/978-3-540-77105-0_20","title":"Network Formation: Bilateral Contracting and Myopic Dynamics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pairwise comparison; Node (physics); Stochastic game; Computer science; Set (abstract data type); Network formation; Routing (electronic design automation); Repeated game; Crawling; Simple (philosophy); Computer network; Topology (electrical circuits); Mathematical optimization; Game theory; Mathematical economics; Mathematics; Engineering","score_opus":0.06514636889501765,"score_gpt":0.3364258573956081,"score_spread":0.27127948850059047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931733763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018721804,0.00019501527,0.98450375,0.0008066178,0.00067099015,0.00025409204,0.0000061144133,0.00004130612,0.011649939],"genre_scores_gemma":[0.92190915,0.000017479344,0.07369943,0.0022399146,0.000878825,0.000004990712,0.000007944287,0.000020255116,0.001222017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971764,0.000034387776,0.0006699967,0.0007650748,0.0009279393,0.00042618567],"domain_scores_gemma":[0.9961498,0.0024081504,0.0003881873,0.0006845689,0.00024489258,0.00012442569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003620569,0.00025719462,0.00035812805,0.00043156973,0.00041313368,0.00061703374,0.0011115834,0.00021972238,0.00006748977],"category_scores_gemma":[0.00029666384,0.00020000723,0.00006061928,0.00056310627,0.00071158085,0.00049049116,0.00042358635,0.00055152876,0.00006670926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008317218,0.000006027573,0.00027808404,0.000005229158,0.0000025546356,0.000012677615,0.00036111128,0.018858606,0.000009790693,0.08567559,0.000026407173,0.8947556],"study_design_scores_gemma":[0.000103833656,0.00003532677,0.00049221504,0.0000839835,0.000004697995,0.00007384248,0.0000010345581,0.23543769,0.00003542288,0.76072145,0.002781983,0.00022853866],"about_ca_topic_score_codex":0.0000049556515,"about_ca_topic_score_gemma":0.00018273084,"teacher_disagreement_score":0.920037,"about_ca_system_score_codex":0.00012022448,"about_ca_system_score_gemma":0.00009549733,"threshold_uncertainty_score":0.8156058},"labels":[],"label_agreement":null},{"id":"W1932937768","doi":"10.1142/8442","title":"Games and Dynamic Games","year":2012,"lang":"en","type":"book","venue":"World Scientific-Now Publishers series in business","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical economics; Markov perfect equilibrium; Sequential game; Combinatorial game theory; Turns, rounds and time-keeping systems in games; Differential game; Markov chain; Computer science; Extensive-form game; Piecewise; Differential (mechanical device); Repeated game; Equilibrium selection; Game theory; Mathematics; Nash equilibrium; Mathematical optimization; Game mechanics; Video game design; Artificial intelligence; Engineering","score_opus":0.0428624959311336,"score_gpt":0.3144744079289236,"score_spread":0.27161191199779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932937768","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006655698,0.0038394502,0.0004377343,0.010821396,0.010822833,0.0012622084,0.00027174255,0.0002985139,0.9655904],"genre_scores_gemma":[0.017441327,0.000036507645,0.0006427341,0.00017722204,0.00026421406,0.00011580344,0.0002617339,0.00007974074,0.9809807],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9931775,0.00030380435,0.0014159499,0.0020084945,0.0021008288,0.0009934539],"domain_scores_gemma":[0.99355406,0.001095525,0.0008386193,0.002678672,0.0014543929,0.0003787329],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007761488,0.0006886773,0.0010724341,0.0032554583,0.00069041335,0.010658066,0.0029914365,0.000390599,0.0032227598],"category_scores_gemma":[0.0018589859,0.00058090687,0.00018178223,0.0064644082,0.0037404,0.0071115876,0.001084485,0.000749492,0.0008370547],"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.00007057828,0.0001302518,0.00090519676,0.000090554684,0.000028727183,0.00001319293,0.0010341873,0.00005340865,0.00008452568,0.066843756,0.8990582,0.03168742],"study_design_scores_gemma":[0.00020883606,0.00000620698,0.0072390903,0.00013600485,0.000030333955,0.000023586437,0.00048723217,0.000043575383,0.0000120275545,0.13790485,0.8533338,0.00057449535],"about_ca_topic_score_codex":0.000010948154,"about_ca_topic_score_gemma":0.0038413801,"teacher_disagreement_score":0.0710611,"about_ca_system_score_codex":0.00029908645,"about_ca_system_score_gemma":0.00085394504,"threshold_uncertainty_score":0.99994093},"labels":[],"label_agreement":null},{"id":"W1963519478","doi":"10.1007/s00199-006-0158-7","title":"The role of externalities and information aggregation in market collapse","year":2006,"lang":"en","type":"article","venue":"Economic 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":"University of Manitoba","funders":"","keywords":"Externality; Economics; Microeconomics; Information aggregation; Ex-ante; Network effect; Aggregate (composite); Market failure; Computer science; Macroeconomics","score_opus":0.008907189015133873,"score_gpt":0.2558982447530206,"score_spread":0.2469910557378867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963519478","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.91266674,0.00028058642,0.0001715007,0.00014502784,0.000046373276,0.00009237688,0.0000165123,0.000005502629,0.086575374],"genre_scores_gemma":[0.99788266,0.000028257151,0.000034421333,0.00002398327,0.000022972275,0.0000143810585,0.000001331407,0.000001594283,0.0019904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992625,0.00015341985,0.00037986078,0.00007151061,0.00006546247,0.00006725557],"domain_scores_gemma":[0.99804306,0.0015308709,0.00019256222,0.00019991165,0.000021256208,0.000012326604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031509197,0.00004044451,0.0000756368,0.00007743224,0.000075887205,0.000092382375,0.00019003356,0.000021675918,0.00021543645],"category_scores_gemma":[0.000164157,0.00002802522,0.000020032363,0.000059400085,0.00014223928,0.0004988912,0.00003553887,0.000029695844,0.000087602166],"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.000041575775,0.0000034414782,0.0032525756,5.372123e-7,0.000001185448,1.7441415e-8,0.00031136206,0.0001019657,0.000037657843,0.9221273,0.0002732579,0.07384913],"study_design_scores_gemma":[0.000107854634,0.000004674198,0.034006115,0.0000030566082,0.0000010466574,0.0000013363598,0.0025525051,0.00078062137,0.0009360049,0.9116344,0.049942292,0.000030105195],"about_ca_topic_score_codex":0.00004684727,"about_ca_topic_score_gemma":0.000084343,"teacher_disagreement_score":0.08521591,"about_ca_system_score_codex":0.000019970084,"about_ca_system_score_gemma":0.000021131204,"threshold_uncertainty_score":0.23588781},"labels":[],"label_agreement":null},{"id":"W1964737813","doi":"10.1142/s0219198904000216","title":"BOOK REVIEW: <i>Differential Games in Marketing</i>. By Steffen Jørgensen and Georges Zaccour","year":2004,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Chatterjee; Mathematical economics; Arrow; Library science; Computer science; Mathematics; Artificial intelligence","score_opus":0.02786565933808989,"score_gpt":0.3589306493530891,"score_spread":0.3310649900149992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964737813","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005197771,0.95328414,0.0010577472,0.030611407,0.0002686194,0.0008827977,0.00008506196,0.00005156333,0.008560897],"genre_scores_gemma":[0.047121514,0.8790645,0.00011341196,0.050442036,0.00011818776,0.00023895249,0.00004983987,0.00003118501,0.02282039],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617624,0.0009631856,0.0010782803,0.000630362,0.00088987313,0.0002620315],"domain_scores_gemma":[0.997018,0.0016030385,0.00043047834,0.0005848696,0.00023480502,0.00012881502],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006999828,0.00025366375,0.0006018297,0.00013948578,0.00005808917,0.00011218057,0.0010918422,0.000059827853,0.008069338],"category_scores_gemma":[0.0038192086,0.00018943525,0.00018472267,0.00036554356,0.00020550989,0.0003219524,0.00024168495,0.0002440937,0.000768673],"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.00015857813,0.00029363626,0.00029535222,0.0010734407,0.000090698246,0.000018388178,0.0001373286,0.0000063428706,0.0008492772,0.065696985,0.7044196,0.22696035],"study_design_scores_gemma":[0.00037463594,0.000017234268,0.0009976905,0.0064544496,0.000043455235,0.000053060983,0.000024040315,0.000007274505,0.00010621727,0.08889208,0.9028122,0.00021765663],"about_ca_topic_score_codex":0.0000052101327,"about_ca_topic_score_gemma":0.0000029728246,"teacher_disagreement_score":0.2267427,"about_ca_system_score_codex":0.00005871721,"about_ca_system_score_gemma":0.000051123883,"threshold_uncertainty_score":0.9928374},"labels":[],"label_agreement":null},{"id":"W1964850210","doi":"10.1111/0008-4085.00087","title":"Know‐how sharing with stochastic innovations","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Economics/Revue canadienne d économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"","keywords":"Humanities; Economics; Welfare economics; Microeconomics; Political science; Philosophy","score_opus":0.28293283704788397,"score_gpt":0.25158066874600465,"score_spread":0.03135216830187931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964850210","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.9827744,0.00006335047,0.004604001,0.009095754,0.00045264087,0.00018456999,0.00006597835,0.0000066613825,0.0027526899],"genre_scores_gemma":[0.9947505,0.000010565007,0.0005515818,0.00050374476,0.00042918386,0.000016259792,0.0000051266506,0.000031353,0.0037016694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802756,0.000051662453,0.00088474393,0.00041508218,0.0000076171164,0.00061334326],"domain_scores_gemma":[0.9957895,0.00046764337,0.0008349124,0.0007152635,0.000652857,0.0015397848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018440997,0.00022018452,0.00048820945,0.0012462904,0.00033965506,0.00051619456,0.0013404174,0.0001092933,0.0007130665],"category_scores_gemma":[0.0008805615,0.0002078239,0.00013414552,0.0006940739,0.00024220523,0.0007751722,0.000027959517,0.0003522629,0.00009442881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046573638,0.000010977907,0.00805109,0.0000024236508,0.00006842569,0.0000855336,0.0008055008,0.03245138,0.000017032587,0.94865566,0.00096500956,0.008840389],"study_design_scores_gemma":[0.0006486845,0.0002715257,0.0028941077,0.00006953149,0.000038903792,0.0020139592,0.002077734,0.0045826873,0.00003268509,0.8887599,0.09816907,0.00044118808],"about_ca_topic_score_codex":0.01566665,"about_ca_topic_score_gemma":0.95086306,"teacher_disagreement_score":0.9351964,"about_ca_system_score_codex":0.00081496354,"about_ca_system_score_gemma":0.0019579716,"threshold_uncertainty_score":0.9908881},"labels":[],"label_agreement":null},{"id":"W1964918808","doi":"10.2139/ssrn.1022182","title":"The Role of Independence in the Green-Lin Diamond-Dybvig Model","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision 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":"Simon Fraser University","funders":"","keywords":"Independence (probability theory); Diamond; Economics; Econometrics; Mathematics; Statistics; Materials science; Metallurgy","score_opus":0.022276894018181753,"score_gpt":0.3134680912452225,"score_spread":0.2911911972270408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964918808","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.9626544,0.004159457,0.018447088,0.0039253,0.00004103595,0.00018787771,0.0000041358603,0.000008706052,0.010571959],"genre_scores_gemma":[0.9970006,0.00031799023,0.000035066736,0.00005869055,0.00008951902,0.0000116481415,3.7100688e-7,0.0000057104735,0.0024804107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969926,0.00033215852,0.0005505128,0.00017255743,0.0009826856,0.0009694708],"domain_scores_gemma":[0.99814934,0.0009334826,0.00029572682,0.00045756134,0.00013773005,0.000026192416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013087959,0.000092532406,0.00012980998,0.000094637384,0.0003925499,0.000118975106,0.0017795132,0.000055725188,0.000012897088],"category_scores_gemma":[0.00024545327,0.00004473172,0.00010411506,0.0006004562,0.00015701888,0.00017659643,0.00005571993,0.001343343,0.00004909667],"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.000023286662,0.000054265853,0.0020432377,1.6128281e-7,0.0000054632465,4.0890276e-7,0.000269429,0.0034543418,0.0007984715,0.9514849,0.000068620866,0.041797407],"study_design_scores_gemma":[0.00014626345,0.000037638103,0.0016479485,0.0000026870805,0.0000055479195,0.00007270037,0.0041033668,0.0075545087,0.00028637217,0.98417324,0.0019155747,0.00005414792],"about_ca_topic_score_codex":0.00019924177,"about_ca_topic_score_gemma":0.00517576,"teacher_disagreement_score":0.041743256,"about_ca_system_score_codex":0.00009531598,"about_ca_system_score_gemma":0.0008064124,"threshold_uncertainty_score":0.58362323},"labels":[],"label_agreement":null},{"id":"W1965925421","doi":"10.1287/mnsc.1060.0605","title":"Stable Farsighted Coalitions in Competitive Markets","year":2007,"lang":"en","type":"article","venue":"Management Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Status quo; Microeconomics; Economics; Profit (economics); Competition (biology); Alliance; Market share; Outcome (game theory); Market economy","score_opus":0.06508715931266254,"score_gpt":0.3832771114069123,"score_spread":0.3181899520942497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965925421","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24357171,0.0000100665175,0.047192413,0.00078803004,0.0001382006,0.00032422435,0.0000066103185,0.00004070133,0.70792806],"genre_scores_gemma":[0.9870633,0.000003988304,0.0027457105,0.00036577357,0.000010809145,0.000017720276,0.0000013550256,0.000002786927,0.009788546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99749047,0.000064955515,0.00037431033,0.000516045,0.0011398145,0.00041440135],"domain_scores_gemma":[0.99860346,0.00049565925,0.000089518006,0.0005834072,0.00011729281,0.000110683235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011093593,0.000080299425,0.000106351916,0.0007351588,0.000372685,0.00022947472,0.0012512049,0.000016607826,0.00079399365],"category_scores_gemma":[0.00028653932,0.00006620856,0.000028823759,0.00453577,0.0006179591,0.00048070602,0.00032512398,0.00007624338,0.00084927806],"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.000011430458,0.00008794921,0.003649968,0.0000013880397,0.0000015053034,0.000012550494,0.000230014,0.000057435383,0.0006168067,0.98274654,0.00074264704,0.011841755],"study_design_scores_gemma":[0.00030110354,0.000015137722,0.6212081,0.000017476515,0.000004128507,0.0000021924056,0.006710844,0.00075704284,0.001624042,0.24945413,0.119739614,0.00016622522],"about_ca_topic_score_codex":0.000011576098,"about_ca_topic_score_gemma":0.00007416846,"teacher_disagreement_score":0.7434916,"about_ca_system_score_codex":0.00007956361,"about_ca_system_score_gemma":0.000022051909,"threshold_uncertainty_score":0.99992865},"labels":[],"label_agreement":null},{"id":"W1966154982","doi":"10.1111/j.1540-5982.2006.00378.x","title":"Formation of buyer‐seller trade networks in a quality‐differentiated product market","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Economics/Revue canadienne d économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quality (philosophy); Business; Product (mathematics); Set (abstract data type); Microeconomics; Association (psychology); Commerce; Product differentiation; Industrial organization; Complementary good; Economics; Computer science","score_opus":0.22216962356855927,"score_gpt":0.2523543694598248,"score_spread":0.030184745891265546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966154982","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.994013,0.00016979026,0.0007452258,0.0021390647,0.00042537018,0.0002601074,0.00011970763,0.0000032023056,0.0021245484],"genre_scores_gemma":[0.9987709,0.000023154027,0.00018175947,0.00013638951,0.0002700227,0.000011183882,0.000016881479,0.000019298976,0.00057041354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967287,0.0002808405,0.0021522434,0.00031159492,0.000008870839,0.00051772303],"domain_scores_gemma":[0.996717,0.00052948185,0.0014144845,0.00051798363,0.00019395992,0.00062712334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032022682,0.00019667218,0.0006606511,0.0010675717,0.00010773714,0.00012871873,0.0008226719,0.00012910743,0.0005176189],"category_scores_gemma":[0.00049121986,0.00020272665,0.00021429219,0.0004616517,0.00016172939,0.00058960856,0.000015970969,0.00029267368,0.000009465034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002785703,0.00010033006,0.037683308,0.000042906227,0.00007286555,0.00004520364,0.0017260398,0.1338556,0.00031162656,0.7952521,0.013541051,0.017090404],"study_design_scores_gemma":[0.0012943916,0.0001566303,0.08895785,0.000104715014,0.000033031487,0.0002547692,0.001195932,0.019209903,0.00088398054,0.8692987,0.018102236,0.0005078399],"about_ca_topic_score_codex":0.067327335,"about_ca_topic_score_gemma":0.97156477,"teacher_disagreement_score":0.90423745,"about_ca_system_score_codex":0.000682186,"about_ca_system_score_gemma":0.000809533,"threshold_uncertainty_score":0.9388834},"labels":[],"label_agreement":null},{"id":"W1967741242","doi":"10.5539/mas.v1n4p37","title":"The Value of a Network","year":2007,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Centrality; Computer science; Extension (predicate logic); Value (mathematics); Mechanism (biology); Measure (data warehouse); Process (computing); Simple (philosophy); Data mining; Epistemology; Mathematics; Statistics; Machine learning","score_opus":0.06131182708941314,"score_gpt":0.37731274431307543,"score_spread":0.3160009172236623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967741242","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.19603537,0.000052829695,0.6719573,0.00032428055,0.0001312852,0.00019229593,0.0000011481997,0.00002594572,0.1312795],"genre_scores_gemma":[0.9963972,0.0000018829983,0.002673673,0.00016643081,0.000059200887,0.000009923119,8.732205e-8,0.0000034967347,0.00068813673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729156,0.000025835816,0.00043640818,0.0003781435,0.0014435905,0.00042445055],"domain_scores_gemma":[0.99690056,0.0016907268,0.00019731477,0.0009282494,0.00017071678,0.00011244527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018408293,0.000072410716,0.00011537083,0.00007664155,0.0009582582,0.00015394241,0.0022221818,0.000026278125,0.000022570415],"category_scores_gemma":[0.00046031404,0.00004092991,0.0000425236,0.0021668747,0.0016942752,0.000100887824,0.00024810413,0.00009621133,0.000171203],"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.000017692688,0.000013718788,0.00016354883,2.2932964e-7,9.130333e-7,1.4936869e-7,0.00037751754,0.0016713693,0.086357564,0.82280344,0.00027954273,0.08831431],"study_design_scores_gemma":[0.000064597436,0.000008755211,0.008409772,0.0000015647591,0.000001981326,0.0000016307552,0.00031456506,0.020471022,0.013360524,0.94867724,0.008623712,0.00006462931],"about_ca_topic_score_codex":0.0000028978322,"about_ca_topic_score_gemma":0.0000126034965,"teacher_disagreement_score":0.8003618,"about_ca_system_score_codex":0.000018945186,"about_ca_system_score_gemma":0.00010618629,"threshold_uncertainty_score":0.7370244},"labels":[],"label_agreement":null},{"id":"W1970704004","doi":"10.1109/cdc.2013.6760041","title":"Distributed optimization by myopic strategic interactions and the price of heterogeneity","year":2013,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Computer science; Equivalence (formal languages); Nash equilibrium; Quadratic equation; Mathematical optimization; Stability (learning theory); Dynamical systems theory; Class (philosophy); Mathematical economics; Mathematics; Artificial intelligence; Discrete mathematics; Machine learning","score_opus":0.07002013781055641,"score_gpt":0.352880643827759,"score_spread":0.2828605060172026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970704004","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.71573657,0.000030219757,0.2724874,0.002643218,0.000029470384,0.000256621,0.000028605313,0.00001667849,0.008771245],"genre_scores_gemma":[0.9981566,0.000008025282,0.0008411887,0.00008484418,0.000006183493,0.000035758007,0.000010484628,0.0000016953777,0.00085523725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925226,0.0001296694,0.00025482135,0.00013335486,0.00016586171,0.0000640576],"domain_scores_gemma":[0.99862415,0.0007884552,0.00012121504,0.00026912946,0.00016074299,0.000036306912],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004770974,0.00004677925,0.00009306584,0.000024699571,0.00010721989,0.000119147306,0.000218312,0.000017547245,0.0013146591],"category_scores_gemma":[0.00017839593,0.000023768813,0.000029252195,0.00028614738,0.00018200657,0.00019336994,0.000047593967,0.000045310277,0.00007504626],"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.00008582111,0.00041971004,0.0039449907,0.000008452165,0.00008539285,1.2375872e-7,0.0007433246,0.028628537,0.014318314,0.90966696,0.033170514,0.008927834],"study_design_scores_gemma":[0.001637818,0.00006731471,0.01181737,0.000008619025,0.000039998107,0.0000133067015,0.005617425,0.33693883,0.01185698,0.6258164,0.0059328564,0.00025309523],"about_ca_topic_score_codex":0.0000571736,"about_ca_topic_score_gemma":0.000009788895,"teacher_disagreement_score":0.3083103,"about_ca_system_score_codex":0.0000042763813,"about_ca_system_score_gemma":0.000008083253,"threshold_uncertainty_score":0.99959826},"labels":[],"label_agreement":null},{"id":"W1971896209","doi":"10.1007/pl00013690","title":"Spatial social networks","year":2000,"lang":"en","type":"article","venue":"Review of Economic Design","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SR Research (Canada)","funders":"","keywords":"Pairwise comparison; Subgame perfect equilibrium; Computer science; Network formation; Construct (python library); Nash equilibrium; Incentive; Variable (mathematics); Network topology; Mathematical economics; Social network (sociolinguistics); Topology (electrical circuits); Microeconomics; Economics; Mathematics; Artificial intelligence; Combinatorics; Computer network","score_opus":0.1448590396153295,"score_gpt":0.3977631086563847,"score_spread":0.2529040690410552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971896209","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.01911587,0.073869646,0.48416796,0.008122256,0.0007230609,0.0029671558,0.00006714968,0.00012909171,0.4108378],"genre_scores_gemma":[0.96480197,0.024830747,0.0016232664,0.001880815,0.0005274612,0.000069833404,0.0000059788204,0.00001587647,0.006244042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987066,0.0002634722,0.0006112013,0.0002047067,0.00010106195,0.000112990594],"domain_scores_gemma":[0.9988592,0.0005391998,0.0002076532,0.0003253914,0.000028099084,0.000040450712],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029737505,0.00007173704,0.00033089562,0.00002595919,0.00007152995,0.00002481933,0.0004793291,0.00003293979,0.023617422],"category_scores_gemma":[0.00009376589,0.000056636825,0.00014304418,0.00010535668,0.00007625155,0.00008535747,0.000017628527,0.00005001726,0.0038012527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009692901,0.00001599378,0.000019229294,0.000028151082,0.0000072653634,1.9050361e-7,0.000020133106,0.0007557541,0.0000055197593,0.013837236,0.04713739,0.93816346],"study_design_scores_gemma":[0.00029758477,0.000062726736,0.0013772178,0.00049104146,0.000055556622,0.000009127086,0.000018365243,0.010352233,0.00013324346,0.14262107,0.84429926,0.0002825509],"about_ca_topic_score_codex":0.000005951182,"about_ca_topic_score_gemma":0.0000014782793,"teacher_disagreement_score":0.9456861,"about_ca_system_score_codex":0.000017513412,"about_ca_system_score_gemma":0.000046303696,"threshold_uncertainty_score":0.9969744},"labels":[],"label_agreement":null},{"id":"W1975387410","doi":"10.1016/j.tcs.2003.09.012","title":"Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Computer science; Game theory; Mathematical economics; Mathematics","score_opus":0.05169847140430342,"score_gpt":0.3529689354392122,"score_spread":0.30127046403490876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975387410","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.171807,0.00011829053,0.44760284,0.004398869,0.0037590626,0.0031503513,0.000045020326,0.00021590349,0.36890268],"genre_scores_gemma":[0.9944786,0.0000034528066,0.0020319764,0.0010937847,0.00015591574,0.00007299058,0.0000017358176,0.000016803082,0.002144771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993753,0.0014790898,0.0006269825,0.0012749424,0.002103838,0.00076213595],"domain_scores_gemma":[0.9923289,0.004562246,0.00021659491,0.002230106,0.0003010691,0.00036113092],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.022447132,0.0002869486,0.00036315736,0.00016764957,0.0016044622,0.0014041848,0.007364889,0.000084757776,0.0045509604],"category_scores_gemma":[0.0016599596,0.0001595008,0.00011903044,0.0020908809,0.007738893,0.00046079722,0.00206341,0.00038935602,0.0097884815],"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.00004459143,0.00014931765,0.000018838004,9.228364e-7,0.000004294424,0.0000032735174,0.0005735854,0.00021610424,0.0002909441,0.9807497,0.0023789362,0.015569449],"study_design_scores_gemma":[0.0004540539,0.00027721268,0.000128821,0.000019384752,0.000008923255,0.000050900147,0.00009856287,0.0057505644,0.0050596944,0.95485294,0.03305077,0.00024817686],"about_ca_topic_score_codex":0.0000020082746,"about_ca_topic_score_gemma":8.631217e-7,"teacher_disagreement_score":0.8226716,"about_ca_system_score_codex":0.00010441431,"about_ca_system_score_gemma":0.0001674056,"threshold_uncertainty_score":0.9996953},"labels":[],"label_agreement":null},{"id":"W1975993410","doi":"10.1139/l05-028","title":"Strategic analysis of the James Bay hydro-electric dispute in Canada","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hydroelectricity; Conflict resolution; Decision analysis; Operations research; Bay; Conflict analysis; Graph; Environmental resource management; Engineering; Environmental science; Computer science; Political science; Economics; Civil engineering; Law","score_opus":0.02292471577876885,"score_gpt":0.24318751605766228,"score_spread":0.22026280027889344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975993410","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.9958364,0.0004716673,0.0009129182,0.00085359334,0.00010880472,0.00003543819,0.000012761343,0.0000011421436,0.0017673046],"genre_scores_gemma":[0.99977624,0.000005007291,0.00003723359,0.000060160757,0.000040842566,8.65137e-7,2.1999632e-7,0.00000461821,0.00007479761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987489,0.000043302403,0.00054621143,0.00008892488,0.00035930335,0.00021337268],"domain_scores_gemma":[0.99886745,0.0003001505,0.00021239596,0.00025298275,0.00011135659,0.00025564188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008059861,0.00007566986,0.00025498323,0.0008028897,0.00004169196,0.00003902227,0.00068414264,0.000023670233,0.00032856423],"category_scores_gemma":[0.0003092516,0.00005270107,0.00012841156,0.0031129061,0.000018183156,0.00010981546,0.000008679537,0.00019617606,0.0000017420728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011339433,0.0000031316697,0.017941946,0.0000012554881,0.000070534465,0.000008688452,0.00017319602,0.9766236,0.00035949558,0.0030940066,0.00035619034,0.0013668195],"study_design_scores_gemma":[0.000355242,0.000029090672,0.5645162,0.00007386814,0.00030867176,0.000060037564,0.0010936141,0.39951065,0.0012255781,0.0053072586,0.027191792,0.00032800052],"about_ca_topic_score_codex":0.3026374,"about_ca_topic_score_gemma":0.9988881,"teacher_disagreement_score":0.6962507,"about_ca_system_score_codex":0.00033431107,"about_ca_system_score_gemma":0.0024141306,"threshold_uncertainty_score":0.7020064},"labels":[],"label_agreement":null},{"id":"W1977645093","doi":"10.1142/s0219198904000150","title":"FORMALIZATION OF MULTI-LEVEL GAMES","year":2004,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"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; Outcome (game theory); Contrast (vision); Nash equilibrium; Game theory; Von Neumann architecture; Generalization; Best response; Extensive-form game; Distribution (mathematics); Mathematics; Computer science; Sequential game; Pure mathematics; Artificial intelligence","score_opus":0.2536500171444254,"score_gpt":0.4591666713175731,"score_spread":0.20551665417314768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977645093","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.021339178,0.031622656,0.8805222,0.007254304,0.0008563481,0.0011796732,0.0002561128,0.00012456313,0.05684495],"genre_scores_gemma":[0.9831359,0.006155409,0.0032829912,0.0018433686,0.000070066504,0.000063552296,0.000029298119,0.000013521186,0.005405903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978032,0.0002050208,0.0008460446,0.00027852922,0.00074320345,0.00012397823],"domain_scores_gemma":[0.99788153,0.00048127276,0.00047346888,0.00051226007,0.00058993115,0.000061528146],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0035305019,0.00012162087,0.00029240584,0.00014400326,0.000037786947,0.00003945731,0.0010842509,0.000039129234,0.001850396],"category_scores_gemma":[0.002857845,0.00008854762,0.00019207553,0.00044850807,0.0001569501,0.000311625,0.000114295886,0.00008373348,0.0010116335],"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.000016755732,0.00011439173,0.000080670005,0.0000464687,0.000024967596,8.647239e-7,0.00016322134,0.00028592226,0.00035669742,0.85141426,0.00035045313,0.14714533],"study_design_scores_gemma":[0.0005339802,0.000029464376,0.0024935699,0.0010661411,0.000035037774,0.000031868134,0.000103856335,0.00010604356,0.0025545356,0.85550934,0.13737302,0.00016312719],"about_ca_topic_score_codex":0.0000029541554,"about_ca_topic_score_gemma":0.0000033972165,"teacher_disagreement_score":0.9617967,"about_ca_system_score_codex":0.000037965703,"about_ca_system_score_gemma":0.000058686855,"threshold_uncertainty_score":0.9997662},"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":"W1979004417","doi":"10.1142/s0219198900000081","title":"EVOLUTIONARY AND DYNAMIC STABILITY IN SYMMETRIC EVOLUTIONARY GAMES WITH TWO INDEPENDENT DECISIONS","year":2000,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematical economics; Stability (learning theory); Stochastic game; Nash equilibrium; Statement (logic); Competition (biology); Evolutionarily stable strategy; Risk dominance; Best response; Epsilon-equilibrium; Mathematics; Economics; Game theory; Computer science; Ecology; Biology; Machine learning","score_opus":0.05656978910844371,"score_gpt":0.37635403092585,"score_spread":0.3197842418174063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979004417","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.80642,0.1012802,0.0040454455,0.007012518,0.00027012717,0.0017948364,0.00028044527,0.00013793197,0.07875847],"genre_scores_gemma":[0.9779502,0.016466917,0.0009346854,0.00087802764,0.000039568346,0.00018050059,0.000033754,0.000016807548,0.0034994965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955903,0.00091084914,0.0010278542,0.0008055783,0.0013824746,0.00028293612],"domain_scores_gemma":[0.99477285,0.0036250863,0.00024511002,0.00081209,0.00037887372,0.00016598411],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0047182306,0.00025156312,0.00046572008,0.0004552507,0.00011462462,0.00008969937,0.0011034496,0.00006363359,0.010751572],"category_scores_gemma":[0.002300837,0.00017910136,0.00013707034,0.001530919,0.00040971002,0.0005097248,0.0001767531,0.00032624393,0.0010608372],"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.00037651413,0.0005185696,0.011599575,0.000043138705,0.000060796505,0.000026593694,0.00018454093,0.00038991956,0.000045287943,0.25013557,0.0008565509,0.73576295],"study_design_scores_gemma":[0.0008620359,0.000081877006,0.16500382,0.0012151394,0.00004900392,0.00037151214,0.0001855901,0.0018897741,0.000008184846,0.7491557,0.08080596,0.00037142844],"about_ca_topic_score_codex":0.00001548436,"about_ca_topic_score_gemma":0.00004258644,"teacher_disagreement_score":0.7353915,"about_ca_system_score_codex":0.0002126249,"about_ca_system_score_gemma":0.000134303,"threshold_uncertainty_score":0.99971694},"labels":[],"label_agreement":null},{"id":"W1980655759","doi":"10.1007/s11518-006-0152-4","title":"Group size and parallelism effects in tasks with heterogeneous levels of difficulty: A stochastic order approach","year":2004,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Task (project management); Group (periodic table); Parallelism (grammar); Order (exchange); Computer science; Stochastic ordering; Theoretical computer science; Cognitive psychology; Mathematics; Psychology; Parallel computing; Statistics; Engineering; Economics","score_opus":0.03248800363734389,"score_gpt":0.27803814775840985,"score_spread":0.24555014412106596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980655759","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.84197795,0.0010522567,0.15642482,0.000020896056,0.00018592105,0.00030417094,0.000002699179,0.000006434458,0.000024860872],"genre_scores_gemma":[0.99881756,0.0000049137025,0.0010748463,0.0000041585863,0.000056600707,0.000017650797,4.6766896e-8,0.000007699652,0.000016509595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747074,0.000063910134,0.0008048905,0.00026544984,0.0011508525,0.00024417878],"domain_scores_gemma":[0.99810857,0.0005969027,0.00045238968,0.00022668025,0.0004362607,0.00017922652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042629284,0.00014807678,0.0005268992,0.0003999095,0.00009271789,0.00025405563,0.00040470212,0.000053407202,3.4445043e-7],"category_scores_gemma":[0.00087095326,0.00008996037,0.000030335334,0.0011395826,0.00020266669,0.00042492314,0.000050592447,0.00015083459,7.423486e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018283981,0.000053912507,0.00031267473,0.00019046779,0.000017897888,0.0000236209,0.0016829316,0.92632914,0.06130872,0.009817477,0.0000017182625,0.00024314658],"study_design_scores_gemma":[0.016885284,0.004114781,0.15154901,0.012129127,0.00024517387,0.03196203,0.030011198,0.74269706,0.0030985076,0.0043022404,0.00042211363,0.002583456],"about_ca_topic_score_codex":0.00003798927,"about_ca_topic_score_gemma":0.0000022923782,"teacher_disagreement_score":0.18363208,"about_ca_system_score_codex":0.000064409316,"about_ca_system_score_gemma":0.00010287385,"threshold_uncertainty_score":0.36684772},"labels":[],"label_agreement":null},{"id":"W1981156082","doi":"10.1109/smc.2014.6974373","title":"Conflict analysis on water use and oil sands development in the Athabasca River","year":2014,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Oil sands; Asphalt; Environmental science; Unconventional oil; Fossil fuel; Petroleum engineering; Environmental engineering; Water resource management; Geology; Waste management; Engineering; Geography","score_opus":0.10818354481599317,"score_gpt":0.3460744678630673,"score_spread":0.2378909230470741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981156082","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.9820709,0.0000021351118,0.0024619743,0.0010048694,0.000008690715,0.000029288098,9.713402e-7,0.000007998284,0.014413161],"genre_scores_gemma":[0.9913248,0.0000021790863,0.00043168073,0.0009689261,0.000008188278,0.000014184894,0.000002819024,0.0000016133811,0.0072456086],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989399,0.00017424884,0.00021071339,0.00022145089,0.0003427326,0.00011099166],"domain_scores_gemma":[0.9984891,0.001031718,0.000026614987,0.00037492818,0.000043510085,0.00003416457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495004,0.00006183385,0.00011789035,0.00016806531,0.000114208626,0.00017534867,0.0002941515,0.000023763389,0.0005597633],"category_scores_gemma":[0.0001746166,0.00002485611,0.00003801537,0.00042576133,0.00007498813,0.00009533986,0.000052550822,0.000050487564,0.0004723745],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011222885,0.0004253846,0.35513714,0.000003712927,0.00023934533,0.0000046435907,0.06256641,0.0008325134,0.0016985597,0.34510124,0.0063493093,0.22752951],"study_design_scores_gemma":[0.00028155878,0.000023466368,0.60683686,0.0000025628144,0.000037483773,0.0000013141481,0.000520581,0.0015008383,0.005923691,0.009651993,0.3750817,0.00013796397],"about_ca_topic_score_codex":0.00004728897,"about_ca_topic_score_gemma":0.00022275849,"teacher_disagreement_score":0.3687324,"about_ca_system_score_codex":0.000004995782,"about_ca_system_score_gemma":0.0000048034535,"threshold_uncertainty_score":0.6129015},"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":"W1982713086","doi":"10.1007/s10479-014-1652-0","title":"Decentralized stochastic control","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Theory of computation; Decentralization; Decentralised system; Computer science; Control (management); State (computer science); Stochastic control; Mathematical optimization; Optimal control; Distributed computing; Mathematics; Artificial intelligence; Economics; Algorithm","score_opus":0.5710642858031221,"score_gpt":0.6010051164305524,"score_spread":0.02994083062743036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982713086","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.73066705,0.000100628444,0.23416477,0.021984963,0.000061479885,0.00057739636,0.000045801808,0.00002533155,0.012372546],"genre_scores_gemma":[0.99665,0.000011593327,0.0003672505,0.000276579,0.000048141308,0.00007152533,0.000003862972,0.0000057177986,0.0025653262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966328,0.0010754432,0.00045567384,0.00026501963,0.0012651195,0.00030590442],"domain_scores_gemma":[0.9941508,0.0027081915,0.000031865922,0.0007392295,0.0022211745,0.00014872743],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010934685,0.00006237349,0.00018533497,0.0003315338,0.00041522126,0.00020261966,0.00077327766,0.000043237294,0.0013631426],"category_scores_gemma":[0.011848693,0.000045870624,0.00007334144,0.0010363335,0.0003350599,0.00019784193,0.00007003214,0.00016793919,0.0013221387],"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.00007443925,0.00022366339,0.00019892152,0.000002320405,0.000020514319,3.307569e-7,0.00047271044,0.04926249,0.0125593925,0.8915936,0.018829579,0.026762046],"study_design_scores_gemma":[0.001876273,0.00054855517,0.013766354,0.000037256093,0.000011798717,0.0000072084254,0.001126312,0.28386194,0.022460975,0.58595204,0.0900095,0.00034181622],"about_ca_topic_score_codex":0.000045119225,"about_ca_topic_score_gemma":0.000041427495,"teacher_disagreement_score":0.30564156,"about_ca_system_score_codex":0.0000046248756,"about_ca_system_score_gemma":0.000099657766,"threshold_uncertainty_score":0.99954975},"labels":[],"label_agreement":null},{"id":"W1982840974","doi":"10.1145/1978721.1978724","title":"Linear solvers for nonlinear games","year":2011,"lang":"en","type":"article","venue":"ACM SIGecom Exchanges","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":"University of British Columbia","funders":"","keywords":"Constructive; Reduction (mathematics); USable; Computer science; Nash equilibrium; Mathematical optimization; Theoretical computer science; Mathematics; Mathematical economics","score_opus":0.34129555898865505,"score_gpt":0.4151936907719584,"score_spread":0.07389813178330334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982840974","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.8936001,0.000771262,0.04941048,0.010836608,0.0016285034,0.0019453196,0.0005195759,0.000537118,0.040751025],"genre_scores_gemma":[0.8867905,0.000066869216,0.09694988,0.0013179928,0.00063405756,0.000307787,0.000027014134,0.0000396263,0.013866276],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985604,0.000066886576,0.00032667365,0.00042296236,0.00033082662,0.0002922225],"domain_scores_gemma":[0.9966881,0.0016327349,0.00015453811,0.0011850229,0.00021838045,0.00012120233],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013564756,0.00014016787,0.00022361374,0.00014679134,0.00019792786,0.00005157321,0.001435819,0.00008373835,0.0019376633],"category_scores_gemma":[0.002293995,0.000105949286,0.00014411651,0.00032933286,0.00013423094,0.00018634897,0.0002267966,0.00008405069,0.0012829523],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051432604,0.0010068028,0.009658119,0.000047860725,0.00016774455,0.00001213644,0.030965175,0.000029552191,0.0065978733,0.09072759,0.23569661,0.6245762],"study_design_scores_gemma":[0.0004478909,0.00019809027,0.0029024724,0.00000943632,0.0000267673,0.0000043292816,0.0028530199,0.00062864705,0.020572111,0.35456547,0.6175039,0.00028787728],"about_ca_topic_score_codex":0.000015264439,"about_ca_topic_score_gemma":0.0000541717,"teacher_disagreement_score":0.6242883,"about_ca_system_score_codex":0.000009951918,"about_ca_system_score_gemma":0.000027298443,"threshold_uncertainty_score":0.9994947},"labels":[],"label_agreement":null},{"id":"W1985833622","doi":"10.1016/s0165-1889(01)00072-0","title":"Channel coordination over time: incentive equilibria and credibility","year":2003,"lang":"en","type":"article","venue":"Journal of Economic Dynamics and Control","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Goodwill; Channel coordination; Incentive; Credibility; Microeconomics; Channel (broadcasting); Economics; Profit maximization; Profit (economics); Pareto efficiency; Maximization; Supply chain; Pareto principle; Advertising; Business; Computer science; Marketing; Supply chain management; Finance; Telecommunications","score_opus":0.019049455435077856,"score_gpt":0.30503804638581217,"score_spread":0.2859885909507343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985833622","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.9837471,0.00013341065,0.0131671475,0.00084863236,0.00015523907,0.00009508867,0.000032081312,0.000002297292,0.0018189963],"genre_scores_gemma":[0.9989391,0.000016968332,0.000059958704,0.00009308431,0.000060229602,0.0000014970288,5.160398e-7,0.0000036067631,0.0008250266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990435,0.000122031706,0.00048718991,0.00015135291,0.00010057814,0.00009533307],"domain_scores_gemma":[0.99860275,0.00059672893,0.00046322992,0.00013289509,0.00010986583,0.00009452913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025340265,0.00007159063,0.00024843685,0.00009011062,0.00007615477,0.0001407569,0.00013366746,0.00004162901,0.00013413145],"category_scores_gemma":[0.0003661692,0.000055442746,0.000060609615,0.000048649883,0.000095507225,0.00032063128,0.000021309763,0.00008923885,0.000016292019],"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.0006549662,0.000273227,0.0540548,0.0000094617,0.00028540436,0.0000073224073,0.0006440601,0.002299507,0.0043034293,0.89102936,0.002741788,0.04369669],"study_design_scores_gemma":[0.001634813,0.000100402634,0.02404673,0.0000058712358,0.000030823354,0.00003638617,0.00020748182,0.5096794,0.000020764635,0.46305197,0.0010942977,0.00009106398],"about_ca_topic_score_codex":0.0000026279824,"about_ca_topic_score_gemma":0.000010159519,"teacher_disagreement_score":0.5073799,"about_ca_system_score_codex":0.000057032004,"about_ca_system_score_gemma":0.000051139807,"threshold_uncertainty_score":0.22608896},"labels":[],"label_agreement":null},{"id":"W1986411334","doi":"10.1007/s00199-004-0588-z","title":"Information and crowding externalities","year":2005,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Center for Interuniversity Research and Analysis on Organizations; HEC Montréal","funders":"","keywords":"Private information retrieval; Externality; Crowding out; Microeconomics; Welfare; Crowding; Economics; Complete information; Public good; Public information; Information asymmetry; Public economics; Computer science; Computer security; Internet privacy; Psychology; Monetary economics; Cognitive psychology","score_opus":0.04062104552052302,"score_gpt":0.330132057088705,"score_spread":0.289511011568182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986411334","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.93525803,0.00007629808,0.008648887,0.0007125638,0.00008049627,0.00004883145,0.000011400687,0.000026618874,0.055136893],"genre_scores_gemma":[0.995503,0.000008553158,0.00029714845,0.0004315925,0.00011305248,0.0000071115983,9.675103e-7,0.000002197758,0.003636371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943686,0.00006471878,0.00027810063,0.00008145668,0.000057043326,0.00008184493],"domain_scores_gemma":[0.9989654,0.00062800746,0.00013995875,0.00021232727,0.000013298669,0.000041043986],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021644966,0.000048254296,0.00007648893,0.000081884085,0.00010218383,0.0001998623,0.00020682112,0.000021830643,0.0017331447],"category_scores_gemma":[0.00019916553,0.000039708775,0.000025170133,0.000027090378,0.000086012755,0.0009586992,0.00005473751,0.000039502942,0.003780459],"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.0000077852055,0.0000016302725,0.00020024746,3.5698068e-7,0.0000019548525,1.6233649e-8,0.0011613395,0.00014696825,0.000038345635,0.7915462,0.0006016107,0.20629354],"study_design_scores_gemma":[0.00009467127,0.0000041943863,0.0021383413,0.0000016996464,0.0000017430929,0.0000062351764,0.0021533065,0.00035108242,0.0007045709,0.76441634,0.2300719,0.000055919245],"about_ca_topic_score_codex":0.0000026056664,"about_ca_topic_score_gemma":0.0000037722762,"teacher_disagreement_score":0.2294703,"about_ca_system_score_codex":0.000023211633,"about_ca_system_score_gemma":0.000014744947,"threshold_uncertainty_score":0.9991794},"labels":[],"label_agreement":null},{"id":"W1992540913","doi":"10.1016/j.tcs.2009.11.015","title":"Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Niche; Mathematical economics; Bayesian probability; Economics; Equilibrium selection; Bayesian game; Computer science; Routing (electronic design automation); Mathematics; Mathematical optimization; Evolutionary biology; Theoretical computer science; Game theory; Artificial intelligence; Biology; Ecology; Repeated game","score_opus":0.03453562216005108,"score_gpt":0.3365466295953586,"score_spread":0.3020110074353075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992540913","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.26633608,0.000017994438,0.7225313,0.0023213262,0.000087576394,0.00014750726,0.0000012200604,0.000042246906,0.008514738],"genre_scores_gemma":[0.9883111,0.000002124526,0.011043094,0.00050903606,0.000106030966,0.000002700176,0.0000012900954,0.0000025211646,0.000022074257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776775,0.00018249349,0.00045771076,0.00047352337,0.00080954144,0.00030900986],"domain_scores_gemma":[0.9986578,0.0005126027,0.00009926742,0.00040858687,0.00018160226,0.00014013986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040384666,0.00010130366,0.00014923577,0.0002876319,0.00024471298,0.00045570228,0.00078495935,0.000043786284,0.00011927832],"category_scores_gemma":[0.00084105955,0.00007887335,0.000028297241,0.0018022213,0.0012675669,0.0012429614,0.0002112179,0.00011905813,0.00006070539],"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.000009002493,0.000027987206,0.00038510896,5.9879994e-7,1.8429344e-7,9.3734815e-7,0.0005410974,0.00035415168,0.0009490141,0.9391181,0.000042566277,0.05857124],"study_design_scores_gemma":[0.00009083,0.000048181177,0.024278678,0.000011122825,0.000001044916,0.000014069489,0.000053993794,0.378048,0.0005124347,0.5967995,0.000071328424,0.00007084231],"about_ca_topic_score_codex":7.903073e-7,"about_ca_topic_score_gemma":8.010103e-7,"teacher_disagreement_score":0.721975,"about_ca_system_score_codex":0.00005094361,"about_ca_system_score_gemma":0.00005138108,"threshold_uncertainty_score":0.46704033},"labels":[],"label_agreement":null},{"id":"W1994262888","doi":"10.1109/smc.2013.415","title":"Inverse Approach in Third Party Intervention","year":2013,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Conflict resolution; Inverse; Computer science; Intervention (counseling); Focus (optics); Resolution (logic); Inverse method; Graph; Operations research; Management science; Political science; Artificial intelligence; Engineering; Mathematics; Psychology; Theoretical computer science; Law; Applied mathematics","score_opus":0.13304261155413766,"score_gpt":0.3785072950816455,"score_spread":0.24546468352750783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994262888","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.7567214,0.0000046538626,0.018106852,0.0006064715,0.000035891775,0.00018508613,6.029019e-7,0.00002824174,0.22431083],"genre_scores_gemma":[0.9797201,6.279815e-7,0.0022920207,0.00022571068,0.000012358463,0.00008019134,0.0000017333314,0.0000019008834,0.017665364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906844,0.00012056649,0.00028676997,0.00019782656,0.0002262818,0.00010011559],"domain_scores_gemma":[0.999343,0.00017540409,0.00005359119,0.0003243631,0.000057775378,0.00004588631],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013460962,0.000045262914,0.00008162117,0.000100779485,0.000033682645,0.00010147839,0.0003297075,0.000031726737,0.0042360225],"category_scores_gemma":[0.00021558336,0.0000290314,0.00005312948,0.00043096635,0.000049120626,0.0003156953,0.00006864709,0.00006728995,0.0076084933],"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.000013478136,0.0007443332,0.043946255,0.000005520408,0.000007439346,6.728315e-7,0.0017650872,0.00033682355,0.0017228652,0.59650934,0.19863905,0.15630916],"study_design_scores_gemma":[0.00033290515,0.000020423615,0.08326285,0.0000042636593,0.0000017810902,0.0000021141623,0.0051711556,0.01681338,0.0005778445,0.8809169,0.0127868885,0.000109525776],"about_ca_topic_score_codex":0.00010466219,"about_ca_topic_score_gemma":0.00006187363,"teacher_disagreement_score":0.28440756,"about_ca_system_score_codex":0.000008677461,"about_ca_system_score_gemma":0.00000548257,"threshold_uncertainty_score":0.99667424},"labels":[],"label_agreement":null},{"id":"W1995617946","doi":"10.1016/j.camwa.2010.05.040","title":"Matrix representation and extension of coalition analysis in group decision support","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":32,"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 Waterloo; Wilfrid Laurier University","funders":"","keywords":"Graph; Transitive relation; Theoretical computer science; Stability (learning theory); Mathematics; Matrix representation; Computer science; Mathematical optimization; Group (periodic table); Combinatorics; Machine learning","score_opus":0.04251451872973134,"score_gpt":0.38358745081525875,"score_spread":0.3410729320855274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995617946","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.3812651,0.0000065774425,0.6177508,0.00013767045,0.000018752387,0.00042077678,0.000012150485,0.000022707365,0.00036543453],"genre_scores_gemma":[0.7415003,0.0000073673896,0.2582226,0.000022225231,0.000016164591,0.00013797641,0.00003140721,0.000007901679,0.00005402818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997939,0.00005364161,0.00080305315,0.00049382536,0.0005666757,0.00014379495],"domain_scores_gemma":[0.996146,0.0018473351,0.00046075296,0.0011689097,0.0002755257,0.00010142421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015101782,0.00013155071,0.00037265438,0.000648041,0.00012026285,0.00009756722,0.00043826087,0.00007498989,0.00008568255],"category_scores_gemma":[0.00017891383,0.0001006772,0.00008397749,0.002594919,0.00020468523,0.0001953336,0.00011367142,0.00014941413,0.00004668336],"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.00007431306,0.0011536253,0.019676123,0.000051669544,0.00012356034,0.0000036580702,0.0024960176,0.0032590544,0.020828633,0.8424219,0.0006556773,0.109255776],"study_design_scores_gemma":[0.0008996869,0.00010093744,0.11571521,0.000041979678,0.00031231207,0.000062278355,0.0013534734,0.11379774,0.0012828348,0.76421845,0.001883296,0.00033180293],"about_ca_topic_score_codex":0.000013136413,"about_ca_topic_score_gemma":0.00012649695,"teacher_disagreement_score":0.3602352,"about_ca_system_score_codex":0.00001082278,"about_ca_system_score_gemma":0.00002439658,"threshold_uncertainty_score":0.4105497},"labels":[],"label_agreement":null},{"id":"W1996864214","doi":"10.1006/game.1999.0767","title":"Subgame Monotonicity in Extensive Form Evolutionary Games","year":2000,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"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; Wright; Monotonic function; Subgame perfect equilibrium; Subgame; Replicator equation; Generalization; Mathematics; Computer science; Population; Game theory; Repeated game; Equilibrium selection","score_opus":0.04884692327721313,"score_gpt":0.32954932131061837,"score_spread":0.28070239803340524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996864214","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.99454683,0.00025449877,0.000015505539,0.0005470961,0.0000753973,0.00026926358,0.000057017078,0.000025417732,0.0042089988],"genre_scores_gemma":[0.9936892,0.00018176685,0.00022680972,0.00018164533,0.000047289872,0.00014032677,0.000005435841,0.000008589412,0.0055189836],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986266,0.000046831283,0.00048690513,0.000477975,0.00010364144,0.00025804303],"domain_scores_gemma":[0.99911004,0.00022295665,0.00009256216,0.00043585888,0.000028747625,0.00010983678],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005502078,0.00013369262,0.00026568308,0.00012437197,0.00010618951,0.00010118016,0.00030746323,0.00008161988,0.0051515726],"category_scores_gemma":[0.000033543776,0.0001161322,0.000083636136,0.00011173915,0.00017836537,0.00035088012,0.00006210882,0.00012095246,0.0014038944],"study_design_candidate":"observational","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.000091683585,0.00020727348,0.19221643,0.0000021642682,0.000007743182,0.000012016496,0.0012590875,0.0003611213,0.00025036282,0.0112174265,0.0033270805,0.79104763],"study_design_scores_gemma":[0.0003879056,0.00003576778,0.9207853,0.000006315168,0.000014061596,0.000040456718,0.00075303455,0.0012608125,0.000120101366,0.038600102,0.037798747,0.0001973918],"about_ca_topic_score_codex":0.00020482072,"about_ca_topic_score_gemma":0.0002027244,"teacher_disagreement_score":0.7908502,"about_ca_system_score_codex":0.00006988274,"about_ca_system_score_gemma":0.000044099306,"threshold_uncertainty_score":0.9993736},"labels":[],"label_agreement":null},{"id":"W1996999179","doi":"10.2202/1935-1704.1591","title":"A Theory of Credibility under Commitment","year":2010,"lang":"en","type":"article","venue":"The B E Journal of Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Commit; Credibility; Bayesian game; Microeconomics; Economics; Stochastic game; Class (philosophy); Rationality; Contingency; Bayesian probability; Mathematical economics; Repeated game; Game theory; Computer science","score_opus":0.07087454318798433,"score_gpt":0.3530560288480631,"score_spread":0.2821814856600787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996999179","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.97214776,0.00002405799,0.012695826,0.00490679,0.00033653516,0.000095773576,0.000012597089,0.0000035161227,0.009777157],"genre_scores_gemma":[0.998531,0.000020251933,0.00084490946,0.000362372,0.00012854348,0.0000010734634,1.7124187e-7,0.0000067152637,0.000104951745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979632,0.0005334993,0.0010122411,0.000112811125,0.00023841995,0.00013985262],"domain_scores_gemma":[0.99050486,0.007526027,0.0007144987,0.0008643468,0.00026441045,0.00012585298],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.018598048,0.000092775714,0.00031506948,0.00007575565,0.00009570551,0.00004596115,0.0015697953,0.00006827501,0.0022133088],"category_scores_gemma":[0.0022304114,0.000047916696,0.0002171156,0.00012110364,0.0020293852,0.000112309805,0.00015799841,0.00043581397,0.0000801894],"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.00023891343,0.00010092409,0.00012725097,7.6973055e-7,0.000025597583,1.4031502e-7,0.00026605753,0.00032213982,0.0016777402,0.9927039,0.00018886614,0.0043477044],"study_design_scores_gemma":[0.00022382343,0.000088224486,0.0020770852,0.000003001006,0.000041065206,0.000050300918,0.0010130674,0.00042405052,0.003885451,0.9907261,0.0014160563,0.00005173547],"about_ca_topic_score_codex":6.546733e-7,"about_ca_topic_score_gemma":0.0000032462028,"teacher_disagreement_score":0.026383264,"about_ca_system_score_codex":0.000018570181,"about_ca_system_score_gemma":0.000095170144,"threshold_uncertainty_score":0.99869883},"labels":[],"label_agreement":null},{"id":"W1999757901","doi":"10.1016/s1570-8667(03)00022-4","title":"On time versus size for monotone dynamic monopolies in regular topologies","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Monotone polygon; Mathematics; Combinatorics; Hypercube; Simple (philosophy); Network topology; Computation; Dynamo; Discrete mathematics; Graph; Computer science; Topology (electrical circuits); Algorithm; Physics","score_opus":0.055838635520928194,"score_gpt":0.4016639778191219,"score_spread":0.34582534229819367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999757901","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.9599904,0.00055912964,0.028139988,0.0035389967,0.00077646744,0.00044336,0.00005941489,0.000021897391,0.006470374],"genre_scores_gemma":[0.9815509,0.000048601327,0.015296208,0.000081386985,0.00005975075,0.000016715956,0.000001008771,0.000012954837,0.0029325183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981188,0.00019203429,0.0007201698,0.00020874153,0.00052228995,0.0002379721],"domain_scores_gemma":[0.99489653,0.0040034377,0.0004537924,0.00035812132,0.0001980129,0.00009009261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023566766,0.0001341894,0.00036271647,0.00022140515,0.00010499286,0.00009522741,0.0005577781,0.00007646239,0.00018341235],"category_scores_gemma":[0.005291634,0.00009179546,0.00020634047,0.0003915891,0.00015091604,0.00025357565,0.000029720364,0.00018330317,0.000071570015],"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.007400536,0.0014464813,0.00055572874,0.000026321231,0.00053349975,0.00014353321,0.0041509536,0.019726338,0.023709346,0.72875696,0.026183207,0.18736711],"study_design_scores_gemma":[0.0025353697,0.0009931977,0.0011333883,0.0000294052,0.000030526993,0.000027621561,0.0027784344,0.0039495938,0.0048887087,0.9744677,0.008959576,0.000206502],"about_ca_topic_score_codex":0.0000025446238,"about_ca_topic_score_gemma":0.0000042245542,"teacher_disagreement_score":0.24571075,"about_ca_system_score_codex":0.00007062265,"about_ca_system_score_gemma":0.00006971592,"threshold_uncertainty_score":0.6334962},"labels":[],"label_agreement":null},{"id":"W1999859126","doi":"10.5539/cis.v2n3p154","title":"A Species-Coexistence Model Defending against Credit Cheating in E-Commerce","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cheating; Computer science; Default; Rationality; Set (abstract data type); Mechanism (biology); Control (management); Microeconomics; Artificial intelligence; Business; Economics; Finance; Psychology","score_opus":0.09935146596326772,"score_gpt":0.35816005048452415,"score_spread":0.25880858452125644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999859126","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.5469209,0.000007788875,0.37816998,0.0010844326,0.000105864165,0.0001384122,0.0000036502104,0.00003970482,0.073529266],"genre_scores_gemma":[0.985619,0.000009821352,0.011669329,0.0025689234,0.000036623896,0.0000036564415,0.0000017129968,0.0000010041813,0.000089922076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819195,0.000026495627,0.00055740937,0.00023704542,0.0007394837,0.00024761885],"domain_scores_gemma":[0.9989605,0.00020877796,0.00016250936,0.00034239853,0.00021148051,0.000114334405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030532405,0.000092997834,0.00013788555,0.00050666346,0.00039698297,0.0007702487,0.00081726286,0.00002784185,0.0000112900425],"category_scores_gemma":[0.00040979314,0.00007400949,0.000028187671,0.0018066524,0.00026735401,0.007098518,0.00016205368,0.00011923034,0.000089375855],"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.000013692997,0.00004358891,0.0018221046,0.000004970493,8.828556e-7,6.9847215e-7,0.015512623,0.066838495,0.0029426985,0.3523249,0.00148045,0.5590149],"study_design_scores_gemma":[0.000161159,0.000025232825,0.051457204,0.000019002911,5.858322e-7,0.000006275205,0.0005214248,0.9291626,0.00030232206,0.015090519,0.0031405147,0.00011313143],"about_ca_topic_score_codex":0.0000012811989,"about_ca_topic_score_gemma":5.511739e-7,"teacher_disagreement_score":0.8623241,"about_ca_system_score_codex":0.000040293067,"about_ca_system_score_gemma":0.000071402705,"threshold_uncertainty_score":0.7427526},"labels":[],"label_agreement":null},{"id":"W2000470205","doi":"10.1016/j.mathsocsci.2015.02.001","title":"On the centipede game with a social norm","year":2015,"lang":"en","type":"article","venue":"Mathematical Social Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematical economics; Norm (philosophy); Introspection; Simultaneous game; Computer science; Screening game; Non-cooperative game; Dominance (genetics); Ultimatum game; Subgame perfect equilibrium; Mathematics; Game theory; Mathematical optimization; Psychology; Epistemology; Cognitive psychology; Philosophy","score_opus":0.38645242231143884,"score_gpt":0.4546359428157334,"score_spread":0.06818352050429455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000470205","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.66768,0.000004435001,0.0073980936,0.038685717,0.000060350227,0.00026756895,0.0000063800126,0.000058134552,0.2858393],"genre_scores_gemma":[0.99692744,9.944539e-8,0.00040547852,0.00089327025,0.00016347348,0.000038772658,2.3882754e-7,0.000004612371,0.0015666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684787,0.00022514822,0.00029367098,0.000317203,0.0019978106,0.00031828214],"domain_scores_gemma":[0.99761194,0.0018128817,0.00015044847,0.00018817662,0.00013747149,0.000099057994],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051323795,0.00011358459,0.00020073778,0.00004979087,0.0011291187,0.0005071466,0.0011784636,0.000050763578,0.00089168455],"category_scores_gemma":[0.0018257343,0.00004908191,0.00008279181,0.0012382572,0.0017124078,0.00015709393,0.00011110542,0.00013123019,0.002031882],"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.000011398213,0.00008287121,0.00004420686,7.077046e-7,0.0000030471497,5.688824e-7,0.0042182505,0.000005867673,0.000015987926,0.98480654,0.008940586,0.0018699567],"study_design_scores_gemma":[0.00011295618,0.00007612703,0.0004875862,0.00000410371,0.0000064157957,0.000002384981,0.006695956,0.00034302924,0.0000672782,0.9873335,0.004778542,0.000092137314],"about_ca_topic_score_codex":0.0000056057916,"about_ca_topic_score_gemma":0.000012076696,"teacher_disagreement_score":0.32924744,"about_ca_system_score_codex":0.000029778526,"about_ca_system_score_gemma":0.0001102923,"threshold_uncertainty_score":0.99874514},"labels":[],"label_agreement":null},{"id":"W2000775611","doi":"10.1109/globalsip.2014.7032237","title":"Multi-layer network formation via a Colonel Blotto game","year":2014,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nash equilibrium; Computer science; Set (abstract data type); Layer (electronics); Enhanced Data Rates for GSM Evolution; Strategy; Function (biology); Game theory; Mathematical optimization; Mathematical economics; Artificial intelligence; Mathematics","score_opus":0.14584602352537734,"score_gpt":0.390175769854837,"score_spread":0.24432974632945964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000775611","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.16367127,0.000009041507,0.81601113,0.000881112,0.00010734275,0.00016597928,0.0000012814063,0.00007924619,0.019073589],"genre_scores_gemma":[0.97673243,0.0000010868706,0.013753528,0.0011117093,0.00011872368,0.000035649948,0.0000025673519,0.000005178256,0.008239098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987156,0.0001575074,0.0003566442,0.00021560967,0.00036044454,0.00019421281],"domain_scores_gemma":[0.9984667,0.0007003796,0.00012349516,0.00048508294,0.00013622326,0.00008817522],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021935448,0.00007802934,0.00013119292,0.00005465691,0.00015100099,0.00011710987,0.0004174536,0.00005153276,0.0010159513],"category_scores_gemma":[0.00039322706,0.000053497944,0.00005874904,0.00044493287,0.00005273403,0.0002755699,0.000072809176,0.00006724496,0.0065130554],"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.00009761664,0.00033740303,0.0042792154,0.000006775394,0.000024255507,0.0000010789104,0.0021443728,0.0153661035,0.027428543,0.4945958,0.15348667,0.30223218],"study_design_scores_gemma":[0.0005437383,0.000057640616,0.025678251,0.000005153663,0.000010113998,0.000010060996,0.0001812211,0.3972143,0.0016685862,0.33175364,0.24267495,0.00020237456],"about_ca_topic_score_codex":0.0000075180883,"about_ca_topic_score_gemma":0.00005655302,"teacher_disagreement_score":0.8130612,"about_ca_system_score_codex":0.000009852007,"about_ca_system_score_gemma":0.000007830617,"threshold_uncertainty_score":0.99989724},"labels":[],"label_agreement":null},{"id":"W2001647405","doi":"10.1145/1807406.1807447","title":"Symmetric games with piecewise linear utilities","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Representation (politics); Nash equilibrium; Mathematics; Computational complexity theory; Piecewise; Piecewise linear function; Time complexity; Polynomial; Focus (optics); Discrete mathematics; Mathematical optimization; Algorithm","score_opus":0.07662254952079682,"score_gpt":0.3726518853322362,"score_spread":0.29602933581143936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001647405","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.7682125,0.000015807147,0.008026401,0.0010716228,0.00009617511,0.00009924178,0.0000068804234,0.00008232691,0.22238904],"genre_scores_gemma":[0.948724,0.0000015601094,0.005260864,0.00023894936,0.00006893656,0.000016371501,9.1295345e-7,0.0000052811906,0.04568317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988361,0.00003633444,0.0002138203,0.0002634536,0.00049786124,0.0001524152],"domain_scores_gemma":[0.9978599,0.0010905064,0.0000614706,0.0006957164,0.00019315115,0.000099252466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010114082,0.00007950328,0.00012164059,0.00020575525,0.00012086063,0.000119686345,0.0005352697,0.000041391177,0.004365828],"category_scores_gemma":[0.0009256635,0.00004302328,0.00004087633,0.0011036041,0.00021336351,0.00017321401,0.00005549519,0.00015465247,0.0024855977],"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.00002189137,0.00008232452,0.005561173,0.0000011473912,0.0000068626223,0.0000014849883,0.00026065682,0.000012110495,0.0020097112,0.9105675,0.0056268177,0.075848274],"study_design_scores_gemma":[0.00040090302,0.00012174979,0.03174125,0.0000037255363,0.000014769204,0.000033980315,0.003068413,0.0015919033,0.019265741,0.41692477,0.52652806,0.00030472243],"about_ca_topic_score_codex":0.000016798227,"about_ca_topic_score_gemma":0.00007499991,"teacher_disagreement_score":0.52090126,"about_ca_system_score_codex":0.0000023066345,"about_ca_system_score_gemma":0.000036831505,"threshold_uncertainty_score":0.9982911},"labels":[],"label_agreement":null},{"id":"W2007607403","doi":"10.1109/icassp.2010.5496080","title":"Pareto-optimal solutions of Nash bargaining resource allocation games with spectral mask and total power constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical optimization; Bottleneck; Resource allocation; Computer science; Bandwidth (computing); Nash equilibrium; Pareto optimal; Bargaining problem; Pareto principle; Game theory; Computational complexity theory; Multi-objective optimization; Mathematical economics; Mathematics; Algorithm; Telecommunications","score_opus":0.03560089906664556,"score_gpt":0.3068002601224034,"score_spread":0.27119936105575787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007607403","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.90665257,0.000009385595,0.022085171,0.00072980655,0.00002693566,0.00013236719,0.000016133201,0.000035301025,0.07031233],"genre_scores_gemma":[0.98931247,5.507693e-7,0.009138467,0.00006831283,0.00002478242,0.000009728301,0.0000033570793,0.0000062264994,0.0014360998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987125,0.000062584295,0.0003214636,0.00030824405,0.00039036587,0.00020487298],"domain_scores_gemma":[0.9986461,0.000571731,0.0001349483,0.0003955083,0.00013911532,0.00011263453],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012445211,0.00009929541,0.00015962534,0.0001012211,0.0001732714,0.000086081505,0.00022970409,0.00006153867,0.0014687635],"category_scores_gemma":[0.00038929068,0.00006892845,0.000037718528,0.0002956244,0.00085896254,0.00017921829,0.00006944563,0.00017549413,0.00005331023],"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.00006175892,0.00010098064,0.006468363,0.000001593144,0.000025561578,0.0000018612077,0.0022671083,0.00026551634,0.049694065,0.92445606,0.0010835154,0.015573627],"study_design_scores_gemma":[0.0045800316,0.0015655939,0.4515957,0.00011071043,0.00018572478,0.0012558922,0.10789487,0.018036751,0.067557804,0.3234683,0.021711309,0.0020373072],"about_ca_topic_score_codex":0.000007765541,"about_ca_topic_score_gemma":0.00004347142,"teacher_disagreement_score":0.60098773,"about_ca_system_score_codex":0.0000047750077,"about_ca_system_score_gemma":0.000062309744,"threshold_uncertainty_score":0.999444},"labels":[],"label_agreement":null},{"id":"W2007945516","doi":"10.1061/(asce)0733-9364(2006)132:10(1043)","title":"Conflict Resolution in Construction Disputes Using the Graph Model","year":2006,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compromise; Conflict resolution; Conflict analysis; Order (exchange); Operations research; Resolution (logic); Dispute resolution; Management science; Computer science; Economics; Engineering; Political science; Artificial intelligence; Law; Finance","score_opus":0.036787634739610726,"score_gpt":0.29302883497635923,"score_spread":0.2562412002367485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007945516","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.45982024,0.000145777,0.5389931,0.00030327705,0.00021909026,0.00007753189,0.0000011684401,0.0000086800765,0.0004311028],"genre_scores_gemma":[0.96494204,0.000106568026,0.03479356,0.000014628396,0.0000745947,0.00000277898,2.773281e-7,0.0000040113537,0.00006156271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896055,0.00003742469,0.0004927911,0.00010454392,0.00030528527,0.00009937574],"domain_scores_gemma":[0.9994048,0.00009791967,0.00024585286,0.00013208568,0.000090776055,0.000028586901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611478,0.00007313878,0.00012760331,0.00037428987,0.00009035125,0.00008810031,0.0001322969,0.00002360855,0.0000055868127],"category_scores_gemma":[0.00004098122,0.00005024429,0.000052491436,0.0003969675,0.00010778182,0.00020854913,0.000029560411,0.000113749775,7.625128e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111127065,0.000009997858,0.0005060813,0.000005383904,0.000011535762,0.0000025304232,0.000040278075,0.728786,0.0007560376,0.26215315,0.00009791958,0.0076199938],"study_design_scores_gemma":[0.0007567001,0.000025633728,0.010035699,0.00008252954,0.00006579578,0.00078338425,0.0015969451,0.8481249,0.00035136435,0.1287018,0.009314333,0.00016089964],"about_ca_topic_score_codex":0.000006770911,"about_ca_topic_score_gemma":0.000002343388,"teacher_disagreement_score":0.50512177,"about_ca_system_score_codex":0.000028984476,"about_ca_system_score_gemma":0.00001021634,"threshold_uncertainty_score":0.20489027},"labels":[],"label_agreement":null},{"id":"W2008110601","doi":"10.3138/infor.51.3.103","title":"A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China","year":2013,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation; Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Graph; China; Computer science; Component (thermodynamics); Water diversion; Operations research; Conflict resolution; Graph theory; Management science; Mathematical optimization; Theoretical computer science; Mathematics; Economics; Political science; Environmental science; Water resource management","score_opus":0.11145830825018233,"score_gpt":0.3902588848800015,"score_spread":0.27880057662981916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008110601","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.5871665,0.000014233188,0.3984927,0.0043338803,0.000041074265,0.0046924883,0.000102250204,0.00003038361,0.0051265103],"genre_scores_gemma":[0.99439853,0.000005538545,0.0009864442,0.00033520698,0.00004500697,0.0026783224,0.00017525749,0.0000061355045,0.0013695776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969475,0.00013713636,0.0007958233,0.0002687148,0.0014741692,0.0003766423],"domain_scores_gemma":[0.997129,0.00054495875,0.00008553035,0.0003483216,0.0016674929,0.00022469294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050397106,0.00012876597,0.00019922356,0.0009048465,0.00061682577,0.0010133018,0.00037004251,0.00010893148,0.000046419736],"category_scores_gemma":[0.0004953421,0.000079035344,0.00003398185,0.00068654184,0.00014718363,0.002453861,0.00013745531,0.00021394112,0.0006893305],"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.0006160557,0.00007609931,0.001733354,0.00007468488,0.000017632721,2.1813706e-7,0.019833928,0.28941298,0.0026663472,0.6597623,0.009112368,0.016693983],"study_design_scores_gemma":[0.0009484133,0.00016604661,0.008623569,0.000032953878,0.0000019075198,0.0000074026743,0.0015475139,0.8999455,0.00026189882,0.007720995,0.08057853,0.00016525404],"about_ca_topic_score_codex":0.00045051152,"about_ca_topic_score_gemma":0.000043108623,"teacher_disagreement_score":0.6520414,"about_ca_system_score_codex":0.00007779334,"about_ca_system_score_gemma":0.00011377748,"threshold_uncertainty_score":0.9771292},"labels":[],"label_agreement":null},{"id":"W2008758111","doi":"10.1093/restud/rdr008","title":"Set Identification in Models with Multiple Equilibria","year":2011,"lang":"en","type":"article","venue":"The Review of Economic Studies","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Identification (biology); Set (abstract data type); Computer science; Econometrics; Mathematics; Biology","score_opus":0.4023465261707252,"score_gpt":0.4345985877091183,"score_spread":0.032252061538393106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008758111","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.86024016,0.11808529,0.0007093329,0.001782785,0.00013533361,0.0010990442,0.000034774435,0.000020559171,0.017892698],"genre_scores_gemma":[0.9755166,0.023783974,0.00017376526,0.00010805517,0.000012187272,0.000095043,7.811633e-7,0.0000039050537,0.00030566222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887156,0.0001412739,0.0006178378,0.00019227658,0.000092093826,0.00008493127],"domain_scores_gemma":[0.9981805,0.0007598602,0.0003603494,0.00061286386,0.00007201824,0.000014413282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032396438,0.00007193928,0.0003326236,0.00004459168,0.000050355167,0.000008697797,0.00051893503,0.0000101415035,0.00010614105],"category_scores_gemma":[0.0003483409,0.000036596626,0.00005407404,0.0001544934,0.0002054284,0.00017697514,0.00010221402,0.000037624297,0.0002958205],"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.00016613994,0.00015744964,0.01310539,0.0013576457,0.00039091188,0.000001189609,0.031636473,0.0010424989,0.0003175575,0.8719172,0.015776468,0.06413107],"study_design_scores_gemma":[0.00034884724,0.000049201557,0.01253512,0.0015673175,0.00008086098,0.0000059060353,0.0070093684,0.0025204883,0.0007757184,0.9711819,0.0037227375,0.00020249496],"about_ca_topic_score_codex":0.00001939113,"about_ca_topic_score_gemma":0.0000762879,"teacher_disagreement_score":0.11527644,"about_ca_system_score_codex":0.000019880674,"about_ca_system_score_gemma":0.00002040949,"threshold_uncertainty_score":0.3802273},"labels":[],"label_agreement":null},{"id":"W201420632","doi":"","title":"On Stability and Convergence of Multi-Commodity Networks and Services","year":2007,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Price of anarchy; Nash equilibrium; Mathematical economics; Convergence (economics); Best response; Price of stability; Computer science; Game theory; Commodity; Epsilon-equilibrium; Stability (learning theory); Mathematical optimization; Economics; Mathematics","score_opus":0.10257758186559725,"score_gpt":0.3819197544082351,"score_spread":0.2793421725426379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201420632","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.9524873,0.00004498639,0.045219343,0.00008806872,0.000030870597,0.00008546369,0.000005675241,0.000011012808,0.0020273179],"genre_scores_gemma":[0.9991392,0.000008050083,0.00059595006,0.00013913724,0.000006878137,0.0000012578189,4.822268e-7,0.0000013404084,0.00010768834],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992199,0.00005616353,0.000242601,0.00020924043,0.0001830485,0.00008903125],"domain_scores_gemma":[0.99786335,0.0016091869,0.000077118704,0.0002944085,0.00008395055,0.000071986746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027762833,0.00005081,0.00010863942,0.000029600522,0.00007222066,0.000023772633,0.00017153133,0.000034936154,0.00034175752],"category_scores_gemma":[0.00012096795,0.00003378449,0.000014893303,0.00017703477,0.00018714623,0.00008362424,0.00007655006,0.00005280769,0.000011556831],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026953637,0.00053659873,0.5412669,0.000033586006,0.0000155444,0.0000012183448,0.0020921763,0.00043047173,0.004352968,0.369989,0.0002978772,0.08071409],"study_design_scores_gemma":[0.000409217,0.00007868072,0.820898,0.000008922613,0.000006262831,0.0000020894588,0.0023928543,0.03942722,0.012623689,0.123131685,0.00088684104,0.00013455999],"about_ca_topic_score_codex":0.000044314955,"about_ca_topic_score_gemma":0.00031335052,"teacher_disagreement_score":0.27963108,"about_ca_system_score_codex":0.0000025509241,"about_ca_system_score_gemma":0.000003836074,"threshold_uncertainty_score":0.37420052},"labels":[],"label_agreement":null},{"id":"W2015322361","doi":"10.1109/tsmc.2014.2376473","title":"Inverse Approach to the Graph Model for Conflict Resolution","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"King Abdulaziz University","keywords":"Negotiation; Conflict resolution; Management science; Inverse; Operations research; Computer science; Political science; Mathematics; Economics; Law","score_opus":0.11178108374798676,"score_gpt":0.3152887073969451,"score_spread":0.20350762364895833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015322361","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.012302011,0.00009657771,0.9778903,0.00029538263,0.00081563875,0.0018055412,0.00012379808,0.00007646248,0.0065942463],"genre_scores_gemma":[0.97935164,0.000013559654,0.00042652246,0.00018524454,0.00015554318,0.0010127828,0.0000030690928,0.00002542131,0.018826207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972452,0.00044149315,0.0007190329,0.0006011017,0.0006803628,0.00031283445],"domain_scores_gemma":[0.9975614,0.00074808695,0.00021148419,0.0009827449,0.0002674236,0.00022884269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033112457,0.0002257354,0.0003669934,0.00025724465,0.0006362874,0.00047330564,0.0005827215,0.00014068355,0.0000026409095],"category_scores_gemma":[0.00004740317,0.00014988921,0.00014583446,0.00049413356,0.00013427588,0.00009647662,0.0000041335434,0.00016896662,0.00016055055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053092903,0.00009784546,0.0000040835153,0.00004304223,0.000031398653,6.569552e-8,0.0020001098,0.8935865,0.00028081282,0.09373205,0.008144649,0.0020263533],"study_design_scores_gemma":[0.00037366856,0.000102018,0.000015377247,0.000038289025,0.000042745713,0.000019777926,0.0028207528,0.9294917,0.00006698655,0.0016387263,0.0651932,0.00019674338],"about_ca_topic_score_codex":0.00013821018,"about_ca_topic_score_gemma":0.00007399134,"teacher_disagreement_score":0.97746384,"about_ca_system_score_codex":0.00003540366,"about_ca_system_score_gemma":0.000025974434,"threshold_uncertainty_score":0.61123043},"labels":[],"label_agreement":null},{"id":"W2017509081","doi":"10.1111/1540-5982.00009","title":"Rationalized subjective equilibria in repeated games","year":2003,"lang":"fr","type":"article","venue":"Canadian Journal of Economics/Revue canadienne d économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical economics; Cournot competition; Simple (philosophy); Nash equilibrium; Humanities; Mathematics; Economics; Philosophy; Epistemology","score_opus":0.23118132564692648,"score_gpt":0.25916894433067456,"score_spread":0.027987618683748078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017509081","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.97288656,0.0026422152,0.00018951343,0.00833797,0.0034425887,0.0004218991,0.00033107967,0.0000041099997,0.011744054],"genre_scores_gemma":[0.9837143,0.00022129537,0.00083561207,0.0006752034,0.00040991377,0.000024014269,0.000010808406,0.000050739967,0.014058159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951094,0.00080706255,0.0022925816,0.0006602316,0.000008693155,0.0011220538],"domain_scores_gemma":[0.99332947,0.0014275857,0.001331852,0.0007517406,0.0006017996,0.002557545],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0053044,0.00040081464,0.0010276501,0.0016103619,0.00023753873,0.00041886195,0.0010852552,0.0003838928,0.005274975],"category_scores_gemma":[0.00403347,0.00048589107,0.0003968092,0.00075280305,0.0006203027,0.0011536776,0.000022385113,0.00067907054,0.00026205543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008230393,0.000031490144,0.0080326395,0.000011867913,0.00009480199,0.0002037789,0.0022487435,0.0076598604,0.000052339103,0.97553176,0.0011486585,0.004901776],"study_design_scores_gemma":[0.0011722565,0.00019328149,0.0020416328,0.00014432498,0.000040913867,0.0009797786,0.0019559904,0.001477876,0.0002920545,0.802931,0.18833312,0.0004377827],"about_ca_topic_score_codex":0.11006814,"about_ca_topic_score_gemma":0.9809963,"teacher_disagreement_score":0.87092817,"about_ca_system_score_codex":0.0034298568,"about_ca_system_score_gemma":0.011031286,"threshold_uncertainty_score":0.99975926},"labels":[],"label_agreement":null},{"id":"W2017663727","doi":"10.1016/j.amc.2010.01.047","title":"The Leitmann–Schmitendorf advertising differential game","year":2010,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Differential game; Mathematical economics; Differential (mechanical device); State (computer science); Constant (computer programming); Perspective (graphical); Mathematics; Separable space; Computer science; Applied mathematics; Mathematical optimization; Mathematical analysis; Algorithm; Artificial intelligence; Physics","score_opus":0.03828459421699283,"score_gpt":0.3389180910741064,"score_spread":0.3006334968571136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017663727","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.6994046,0.000010543967,0.29242522,0.00037496627,0.00012470178,0.00019042553,0.0000016089726,0.000036013644,0.0074319206],"genre_scores_gemma":[0.9878571,0.0000049655273,0.011719084,0.000050711784,0.00007229079,0.000032066942,0.0000030436133,0.000008520378,0.00025222712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886477,0.000014588505,0.00037038123,0.00021351069,0.00039519623,0.00014157467],"domain_scores_gemma":[0.9979264,0.0014411306,0.00018808604,0.00029634812,0.00008678778,0.0000612083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007919894,0.0000975462,0.00013222302,0.00004824684,0.00043917127,0.00042978898,0.0002806551,0.000045417743,0.00003823769],"category_scores_gemma":[0.00014831488,0.000058695816,0.00003813683,0.00018823109,0.00014475806,0.00006128124,0.000093311945,0.00015438073,0.00014052338],"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.0000047455305,0.00003460344,0.000009360715,0.0000030780252,0.000005054811,1.5090349e-7,0.00065875135,0.00006220958,0.01618728,0.78016067,0.00017901266,0.20269509],"study_design_scores_gemma":[0.00018207467,0.000009274282,0.001453037,0.0000031514203,0.000011822658,0.000008307732,0.0006932198,0.04628729,0.0010474174,0.94705176,0.0031605577,0.000092083894],"about_ca_topic_score_codex":0.0000012742222,"about_ca_topic_score_gemma":0.000010292392,"teacher_disagreement_score":0.28845248,"about_ca_system_score_codex":0.0000031643538,"about_ca_system_score_gemma":0.000011836186,"threshold_uncertainty_score":0.4144465},"labels":[],"label_agreement":null},{"id":"W2021508809","doi":"10.1016/j.dam.2009.06.032","title":"Multiple levels of preference in interactive strategic decisions","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":58,"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; University of Waterloo","funders":"","keywords":"Preference; Mathematics; Graph; Stability (learning theory); Decision maker; Ranking (information retrieval); Mathematical economics; Mathematical optimization; Combinatorics; Computer science; Operations research; Artificial intelligence; Statistics; Machine learning","score_opus":0.2618965418645576,"score_gpt":0.40123021836661665,"score_spread":0.13933367650205908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021508809","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.836365,0.000011187052,0.059847955,0.00014339585,0.000023810846,0.0004739028,0.00006833651,0.000030611336,0.10303584],"genre_scores_gemma":[0.9756754,0.0000034399955,0.02402256,0.000048100355,0.000010725836,0.0000326922,0.0000037833065,0.0000075446656,0.0001957768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794793,0.000039986397,0.0008761114,0.00033323726,0.00059165613,0.000211087],"domain_scores_gemma":[0.9956968,0.0029474983,0.0003743743,0.0007844261,0.000118198914,0.000078742676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106825,0.00015681656,0.00038828934,0.00020722765,0.00006025055,0.00006953086,0.0008103783,0.000072401905,0.00022349908],"category_scores_gemma":[0.000937101,0.00011349315,0.00007987242,0.0007540802,0.00010135755,0.00013591621,0.00008479369,0.0001757694,0.00020146374],"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.000042119813,0.0003371826,0.000048433776,0.000005439187,0.0000072620956,0.0000011145048,0.004126237,0.0004339976,0.033007298,0.94817215,0.00006824819,0.013750484],"study_design_scores_gemma":[0.00039922431,0.00003652319,0.0036605531,0.000045008248,0.000007616598,0.0000018779401,0.006526465,0.003571328,0.010030405,0.9755356,0.00005696789,0.00012846966],"about_ca_topic_score_codex":0.0000019017873,"about_ca_topic_score_gemma":0.000017109794,"teacher_disagreement_score":0.13931042,"about_ca_system_score_codex":0.000019827652,"about_ca_system_score_gemma":0.00004399355,"threshold_uncertainty_score":0.46281162},"labels":[],"label_agreement":null},{"id":"W2022930142","doi":"10.1007/s00199-004-0580-7","title":"The folk theorem revisited","year":2005,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Curse of dimensionality; Public finance; Simple (philosophy); Inertia; Action (physics); Folk theorem; Mathematical economics; Face (sociological concept); Contrast (vision); Decomposition; Key (lock); Computer science; Economics; Artificial intelligence; Repeated game; Game theory; Epistemology; Computer security; Physics; Classical mechanics; Philosophy; Macroeconomics; Linguistics","score_opus":0.04432725340367523,"score_gpt":0.344449233244285,"score_spread":0.3001219798406098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022930142","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46293736,0.00097537297,0.006035165,0.010472218,0.00042781356,0.00036471811,0.000035480884,0.00014191927,0.51860994],"genre_scores_gemma":[0.9689935,0.000033752363,0.00017563166,0.0006431062,0.00040947617,0.000024311346,0.0000014362548,0.000010813853,0.02970796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984063,0.00043005322,0.00048199558,0.00032367022,0.00013389396,0.00022412004],"domain_scores_gemma":[0.9937923,0.004794347,0.00018924267,0.0011111805,0.00003415952,0.0000787868],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008703508,0.00010461627,0.00015100479,0.000057699923,0.0004847096,0.00026741717,0.0012372434,0.000042703872,0.00387423],"category_scores_gemma":[0.00069616124,0.000060645416,0.00012856122,0.00011326852,0.0002902716,0.00020472973,0.0001224766,0.00011531699,0.02298454],"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.00002501814,0.0000063998627,0.000038941667,1.1364303e-7,0.000007297669,1.03541694e-7,0.00016886291,0.0000960718,0.000056861958,0.82154924,0.00982786,0.16822322],"study_design_scores_gemma":[0.00007022342,0.000004597537,0.00030179255,0.0000010507305,0.000003081528,0.0000033686667,0.0003906844,0.00023490947,0.0003410294,0.5719052,0.42669097,0.00005311052],"about_ca_topic_score_codex":7.768118e-7,"about_ca_topic_score_gemma":0.000009635405,"teacher_disagreement_score":0.5060562,"about_ca_system_score_codex":0.000052060706,"about_ca_system_score_gemma":0.000038734204,"threshold_uncertainty_score":0.99703634},"labels":[],"label_agreement":null},{"id":"W2025273848","doi":"10.1007/s00446-014-0223-6","title":"Concurrent imitation dynamics in congestion games","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Latency (audio); Computer science; Imitation; Convergence (economics); Coordination game; Singleton; Monotonic function; Mathematical optimization; Mathematics; Mathematical economics; Economics","score_opus":0.05841268452614844,"score_gpt":0.36737204169785637,"score_spread":0.3089593571717079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025273848","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.47223973,0.00000947833,0.52617896,0.00043535256,0.000121435536,0.000070198716,0.000027462926,0.00003866615,0.0008787177],"genre_scores_gemma":[0.99940187,6.491769e-7,0.00027352432,0.000056708297,0.000045021607,0.0000047129683,0.00019659787,0.000004037872,0.00001687831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985334,0.00025564907,0.00043623662,0.00028463092,0.00031310273,0.00017696669],"domain_scores_gemma":[0.99774843,0.0015681651,0.00019217406,0.0002681944,0.00016941504,0.000053615677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972244,0.00008425726,0.00015342717,0.000102022415,0.00011213014,0.00013301923,0.00033228955,0.000046451532,0.000023988132],"category_scores_gemma":[0.0018271873,0.00007516209,0.000041982687,0.0006676673,0.00006139937,0.000087460525,0.0000516372,0.00012555569,0.00013897232],"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.0000033173046,0.00005375535,0.02766988,0.000002326422,0.0000025319125,5.180073e-7,0.00016941648,0.02013549,0.000123945,0.5049187,0.00028301618,0.44663712],"study_design_scores_gemma":[0.000254535,0.000018701683,0.10059609,0.00001920991,0.0000032769344,0.0000020451048,0.00072866946,0.8197853,0.00011582385,0.0767752,0.0016014795,0.000099691366],"about_ca_topic_score_codex":0.000009114995,"about_ca_topic_score_gemma":0.000027590058,"teacher_disagreement_score":0.7996498,"about_ca_system_score_codex":0.00009547413,"about_ca_system_score_gemma":0.000016383148,"threshold_uncertainty_score":0.3065021},"labels":[],"label_agreement":null},{"id":"W2025842805","doi":"10.1016/j.laa.2012.02.019","title":"An open problem on inverse matrices from industrial organization, and a partial solution","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"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 Saskatchewan","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Mathematics; Class (philosophy); Inverse problem; Inverse; Point (geometry); Algebra over a field; Pure mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.11038892478107576,"score_gpt":0.3646384466049752,"score_spread":0.2542495218238994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025842805","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.9795421,0.00014258263,0.01569867,0.0018444692,0.00006275175,0.0012640537,0.00016971714,0.0000849517,0.0011907456],"genre_scores_gemma":[0.99673545,0.000048323327,0.001699328,0.00032718846,0.0006006852,0.00020606403,0.00012084757,0.00001451731,0.00024760573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986509,0.00013292946,0.00035449016,0.0004088595,0.00026283518,0.00018997537],"domain_scores_gemma":[0.9985712,0.00038830398,0.00017740123,0.00043781372,0.00016456662,0.00026069712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007767636,0.00012325315,0.0001611818,0.0000917319,0.0005380032,0.000336129,0.0005165691,0.000116244875,0.00039661978],"category_scores_gemma":[0.00023848287,0.00009944912,0.000013663604,0.0007948759,0.00007990034,0.00082474516,0.00020059162,0.00012668374,0.00052895723],"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.00005259806,0.000756771,0.015874976,0.0000040193227,0.000030977993,1.7045372e-7,0.002331221,0.00005927462,0.009097196,0.92224234,0.005578877,0.043971553],"study_design_scores_gemma":[0.0032255612,0.00044446773,0.03321761,0.000037640813,0.000264372,0.000022867518,0.00271044,0.013797835,0.024062429,0.23643807,0.6845261,0.0012525981],"about_ca_topic_score_codex":0.000035469406,"about_ca_topic_score_gemma":0.000009120585,"teacher_disagreement_score":0.6858043,"about_ca_system_score_codex":0.000010954748,"about_ca_system_score_gemma":0.000042767122,"threshold_uncertainty_score":0.67988515},"labels":[],"label_agreement":null},{"id":"W2026213374","doi":"10.1016/j.amc.2005.11.109","title":"Strength of preference in graph models for multiple-decision-maker conflicts","year":2006,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":101,"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; University of Waterloo","funders":"","keywords":"Preference; Graph; Decision maker; Revealed preference; Representation (politics); Mathematical economics; Mathematics; Context (archaeology); Computer science; Econometrics; Theoretical computer science; Operations research; Statistics; Political science; Geography","score_opus":0.1100702428146167,"score_gpt":0.34226114395873797,"score_spread":0.23219090114412128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026213374","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.46401748,0.000012759096,0.5336329,0.000019079627,0.000009659591,0.00031516797,0.000012761147,0.000009430737,0.001970766],"genre_scores_gemma":[0.87337524,0.0000030548613,0.12648109,0.0000127792255,0.000009041518,0.00007667336,0.000009733463,0.000006280664,0.000026099635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987397,0.000010044472,0.0005985113,0.00023488903,0.00030878186,0.00010803936],"domain_scores_gemma":[0.9963103,0.0030790528,0.00025807178,0.0001928428,0.00013120915,0.000028543092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762267,0.000093382216,0.00022714201,0.00015549503,0.000058799007,0.000053752417,0.000162645,0.00004960255,0.0000059995846],"category_scores_gemma":[0.00011868055,0.00007417638,0.000036678364,0.00030893998,0.00006314043,0.000075745105,0.00003858514,0.000041887994,0.000005625984],"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.000024856196,0.00019518372,0.000040959105,0.00002252414,0.0000031153718,8.033047e-8,0.00076207326,0.049613614,0.0014536877,0.8984468,0.00010065353,0.04933647],"study_design_scores_gemma":[0.00037326236,0.000012699461,0.00062083814,0.000014079444,0.000004364719,4.726544e-7,0.00028801628,0.31078288,0.0005071705,0.68728113,0.000060434944,0.000054641998],"about_ca_topic_score_codex":0.000008556021,"about_ca_topic_score_gemma":0.000028416309,"teacher_disagreement_score":0.40935776,"about_ca_system_score_codex":0.000005326793,"about_ca_system_score_gemma":0.000012688192,"threshold_uncertainty_score":0.3024825},"labels":[],"label_agreement":null},{"id":"W2027008307","doi":"10.1007/s11128-012-0515-3","title":"Evolutionarily stable sets in quantum penny flip games","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Quantum; Nash equilibrium; Set (abstract data type); Stochastic game; Evolutionarily stable strategy; Normal-form game; Quantum pseudo-telepathy; Game theory; Strategy","score_opus":0.07943651024095602,"score_gpt":0.3687942329603649,"score_spread":0.28935772271940885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027008307","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.93462497,0.0005090015,0.044048913,0.0008257714,0.0003570077,0.00034355075,0.000026693822,0.00015131863,0.019112784],"genre_scores_gemma":[0.9981873,0.000006045051,0.0009377725,0.00043096143,0.00006112642,0.00006384344,0.000028749873,0.000008193246,0.0002760127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971291,0.00012490385,0.0010903026,0.00018351767,0.00095340377,0.00051877263],"domain_scores_gemma":[0.99819934,0.00032244524,0.0005438374,0.0003988377,0.00037116744,0.000164343],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039568134,0.00016920711,0.00023453817,0.0005330364,0.00039506823,0.0004662192,0.00052404334,0.000107612344,0.00045164351],"category_scores_gemma":[0.0013520281,0.00013913208,0.00006027426,0.0015156687,0.00011246102,0.009314483,0.000099365105,0.00022336686,0.0025927324],"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.00014410738,0.00033549,0.060559273,0.00011794545,0.000012167448,8.053911e-7,0.04804069,0.003732029,0.00056992867,0.5955696,0.011347782,0.27957013],"study_design_scores_gemma":[0.0009849253,0.00005381818,0.18574916,0.00014002253,0.000016833072,0.000042970096,0.027202092,0.3349256,0.0007556595,0.23317891,0.21620159,0.00074842945],"about_ca_topic_score_codex":0.000017254233,"about_ca_topic_score_gemma":0.000003564582,"teacher_disagreement_score":0.36239073,"about_ca_system_score_codex":0.000096090436,"about_ca_system_score_gemma":0.00018109365,"threshold_uncertainty_score":0.99818385},"labels":[],"label_agreement":null},{"id":"W2027154380","doi":"10.1016/j.tcs.2014.10.037","title":"Improving the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games","year":2014,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"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 Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Upper and lower bounds; Stability (learning theory); Function (biology); Combinatorics; Mathematics; Algorithm; Computer science; Discrete mathematics; Mathematical economics; Machine learning; Mathematical analysis","score_opus":0.03073461169615029,"score_gpt":0.2641081378752692,"score_spread":0.2333735261791189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027154380","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.65979505,0.0002786048,0.038113605,0.001278868,0.0015054595,0.00007061463,0.00005211102,0.00012363415,0.29878208],"genre_scores_gemma":[0.9905171,0.0001305568,0.0058012437,0.0018820231,0.00096546917,0.00042274184,0.000040861913,0.00018779437,0.00005224879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9896425,0.0015390838,0.0016823236,0.0018809637,0.003174245,0.0020808778],"domain_scores_gemma":[0.9837076,0.010564235,0.0014730637,0.00320816,0.00026433918,0.0007826068],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.012731014,0.00057895493,0.0003039295,0.0003498087,0.002255188,0.0021237896,0.0049642753,0.00090900523,0.2523102],"category_scores_gemma":[0.005322411,0.00077619695,0.0008714784,0.002814319,0.008454869,0.0010868405,0.0028625554,0.0014068957,0.0012878352],"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.0008020045,0.00024312761,0.000015348562,0.00014904905,0.00016776308,0.00007678512,0.0024995082,0.0050557023,0.0019260296,0.9507092,0.0324065,0.0059489487],"study_design_scores_gemma":[0.0006184908,0.0011734408,0.000304349,0.00047198727,0.00024660694,0.000184444,0.0008098222,0.3235883,0.66082954,0.010667653,0.00039700477,0.0007083334],"about_ca_topic_score_codex":0.0004397806,"about_ca_topic_score_gemma":0.00028418523,"teacher_disagreement_score":0.9400416,"about_ca_system_score_codex":0.000017108465,"about_ca_system_score_gemma":0.0014692124,"threshold_uncertainty_score":0.9994898},"labels":[],"label_agreement":null},{"id":"W2028717431","doi":"10.1007/s10726-005-9003-9","title":"Integrating Uncertain Preferences into Status Quo Analysis with Applications to an Environmental Conflict","year":2005,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; Wilfrid Laurier University; University of Waterloo; University of Windsor","funders":"","keywords":"Status quo; Preference; Decision maker; Status quo bias; Flexibility (engineering); Conflict analysis; Computer science; Conflict resolution; Uncertainty analysis; Management science; Graph; Operations research; Environmental economics; Microeconomics; Economics; Mathematics; Sociology; Theoretical computer science; Simulation; Social science; Management","score_opus":0.055977886046850486,"score_gpt":0.3686982426353608,"score_spread":0.3127203565885103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028717431","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.5870598,0.000059478018,0.41184673,0.00027048468,0.000011587241,0.00031614554,0.000023005432,0.00003282071,0.00037997923],"genre_scores_gemma":[0.9518546,0.000037039055,0.047178157,0.0004269677,0.000068234556,0.00016031065,0.000095080926,0.000009140151,0.00017051055],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975042,0.00017098851,0.0005756593,0.00070816267,0.0008129495,0.00022808243],"domain_scores_gemma":[0.9978378,0.00088220095,0.00022772024,0.00063661276,0.00008469498,0.00033097583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011559525,0.00017922587,0.00026774174,0.00051369384,0.00044950016,0.0003692201,0.0003968136,0.00007251188,0.00051205925],"category_scores_gemma":[0.00018900936,0.00012260617,0.00006534446,0.0015164342,0.00010002891,0.00062082947,0.000087580265,0.00011694583,0.00026301196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112647846,0.00019618327,0.020267814,8.464958e-7,0.00004243826,2.558616e-7,0.00396221,0.0030596165,0.0026562717,0.013954166,0.0001505815,0.955597],"study_design_scores_gemma":[0.0015588085,0.001142044,0.5471317,0.00003028197,0.0004267345,0.00001236816,0.022934662,0.06475242,0.0014600181,0.093595795,0.2659199,0.0010352568],"about_ca_topic_score_codex":0.00009117802,"about_ca_topic_score_gemma":0.002001957,"teacher_disagreement_score":0.9545617,"about_ca_system_score_codex":0.000069793576,"about_ca_system_score_gemma":0.000022802406,"threshold_uncertainty_score":0.560669},"labels":[],"label_agreement":null},{"id":"W2028919822","doi":"10.1007/s11036-005-4452-6","title":"Strategyproof Mechanisms towards Dynamic Topology Formation in Autonomous Networks","year":2005,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"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":"Computer science; Relay; Network topology; Node (physics); Leverage (statistics); Incentive; Topology (electrical circuits); Distributed computing; Logical topology; Computer network; Power (physics); Microeconomics; Economics; Mathematics; Artificial intelligence","score_opus":0.023643058332181836,"score_gpt":0.33109261959424324,"score_spread":0.3074495612620614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028919822","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.028984206,0.0006804261,0.9641328,0.0009266451,0.0000512657,0.001131522,0.000013334121,0.00008898351,0.0039908495],"genre_scores_gemma":[0.9951919,0.00020223949,0.0009472827,0.0003469401,0.0001691388,0.002412494,0.000046720586,0.000014003739,0.0006693133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981181,0.00011047362,0.0006918712,0.00050110824,0.00021927171,0.00035919098],"domain_scores_gemma":[0.9986631,0.0003002144,0.00020887362,0.0006008645,0.000094911586,0.00013198954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026684,0.00017502716,0.0002628526,0.00015854718,0.0003058132,0.0001715957,0.00047802457,0.00017984852,0.00024263204],"category_scores_gemma":[0.000018386727,0.00015077263,0.00006523735,0.0008219247,0.0001444371,0.00031840388,0.000116895724,0.0002609779,0.00009426862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006017795,0.00007769036,0.000025255635,0.0000011796475,0.0000028217173,3.296828e-7,0.000039029783,0.47843385,0.0000732682,0.13908893,0.00019725952,0.38205436],"study_design_scores_gemma":[0.00030144493,0.000054217886,0.001982887,0.0000058573564,0.000011816483,0.000025250587,0.00051109534,0.80152285,0.000067282774,0.14464886,0.05065425,0.00021416633],"about_ca_topic_score_codex":0.000013762944,"about_ca_topic_score_gemma":0.00035589084,"teacher_disagreement_score":0.9662077,"about_ca_system_score_codex":0.00006598921,"about_ca_system_score_gemma":0.000027682692,"threshold_uncertainty_score":0.61483294},"labels":[],"label_agreement":null},{"id":"W2029184649","doi":"10.1007/s10726-005-9002-x","title":"The Graph Model for Conflict Resolution: Past, Present, and Future","year":2005,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":183,"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 Waterloo; Wilfrid Laurier University","funders":"","keywords":"Conflict resolution; Management science; Computer science; Graph; Operations research; Conflict analysis; Engineering; Sociology; Social science","score_opus":0.0771669332564439,"score_gpt":0.36432862451707126,"score_spread":0.28716169126062735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029184649","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.118034594,0.0024187122,0.8429049,0.034300294,0.00025769637,0.000810338,0.00003944496,0.00005802563,0.0011759739],"genre_scores_gemma":[0.98431504,0.000926931,0.009976913,0.00069937063,0.0018102035,0.00011993404,0.000013617002,0.000012832051,0.0021251682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998477,0.00008465628,0.00041565413,0.00037780136,0.00046760714,0.00017730349],"domain_scores_gemma":[0.9971106,0.0020278834,0.00016165318,0.00041248387,0.00017832684,0.00010907062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019690613,0.00011106994,0.00013247655,0.00009931383,0.0008928119,0.00033980215,0.00026449803,0.00008610781,0.000023566332],"category_scores_gemma":[0.00018044222,0.00006653899,0.00006553263,0.0002860908,0.00012070645,0.00034156005,0.000079564816,0.00008297632,0.00002629249],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017024188,0.00002896778,0.00014761525,0.0000010910053,0.000005666613,6.441307e-8,0.00055701414,0.0006938076,0.00016764896,0.1554948,0.04769513,0.795038],"study_design_scores_gemma":[0.00043268295,0.00002969785,0.0064622266,0.0000028143722,0.000008313461,0.0000048409775,0.00029692668,0.2408955,0.000023672597,0.20340508,0.5483649,0.00007334645],"about_ca_topic_score_codex":0.0000012268558,"about_ca_topic_score_gemma":0.000024093482,"teacher_disagreement_score":0.86628044,"about_ca_system_score_codex":0.0000107619135,"about_ca_system_score_gemma":0.000010826623,"threshold_uncertainty_score":0.68668777},"labels":[],"label_agreement":null},{"id":"W2029191936","doi":"10.1006/jeth.2000.2735","title":"Nash Equilibrium and the Evolution of Preferences","year":2001,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":113,"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":"Mathematical economics; Nash equilibrium; Economics; Action (physics); Population; Best response; Evolutionarily stable strategy; Aggregate (composite); Equilibrium selection; Repeated game; Microeconomics; Mathematics; Game theory; Medicine","score_opus":0.05873728306807544,"score_gpt":0.33744011531056667,"score_spread":0.2787028322424912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029191936","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.9784829,0.00073385524,0.0023237388,0.0007979487,0.00017865033,0.000056398752,0.0000030966296,0.000002166078,0.017421266],"genre_scores_gemma":[0.9985216,0.000056992347,0.00008392356,0.000036338057,0.0001222899,0.0000011172293,5.2862813e-8,0.000002532351,0.0011751527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870884,0.0003608668,0.0006365845,0.00008898135,0.00012864944,0.00007606614],"domain_scores_gemma":[0.996319,0.0025629504,0.000758191,0.00022724703,0.000088601206,0.000044040084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00776114,0.000053032643,0.00022396518,0.000107597865,0.000043728014,0.00005018048,0.00051369524,0.000028651853,0.00048246773],"category_scores_gemma":[0.0005839954,0.000027772445,0.000101738005,0.00008107719,0.00043395572,0.00026794072,0.000060599497,0.00009292905,0.00004802879],"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.00040403695,0.000018152841,0.0030221124,9.562851e-7,0.000026025173,3.9537403e-7,0.00054192037,0.0003464662,0.0006447399,0.98117375,0.0004620738,0.013359389],"study_design_scores_gemma":[0.00050925254,0.000038307095,0.0060006455,0.0000075120865,0.000016494176,0.00007838115,0.0026463482,0.00019438959,0.00022658115,0.98816067,0.0020895037,0.000031945026],"about_ca_topic_score_codex":0.0000047783997,"about_ca_topic_score_gemma":0.000005240351,"teacher_disagreement_score":0.020038722,"about_ca_system_score_codex":0.000031495878,"about_ca_system_score_gemma":0.00008383444,"threshold_uncertainty_score":0.52826834},"labels":[],"label_agreement":null},{"id":"W2029522890","doi":"10.1257/aer.99.4.1178","title":"Decentralized Organizational Learning: An Experimental Investigation","year":2009,"lang":"en","type":"article","venue":"American Economic Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stylized fact; Organizational learning; Microeconomics; Economics; Econometrics; Knowledge management; Computer science","score_opus":0.07440821648265081,"score_gpt":0.4035947385229564,"score_spread":0.32918652204030563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029522890","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.9738664,0.0060166134,0.00055437867,0.0074855075,0.000081430975,0.0004572721,0.00000542447,0.00011124683,0.011421745],"genre_scores_gemma":[0.9902483,0.002795757,0.0009973594,0.0054793726,0.000052803043,0.000015542577,0.000035250472,0.000007844307,0.00036774532],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985191,0.0003036496,0.0005207658,0.00035467386,0.00016283382,0.00013896127],"domain_scores_gemma":[0.99885136,0.00015542014,0.0003961813,0.00038860113,0.000049971462,0.00015849233],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009154736,0.00010486837,0.0003089613,0.00005087724,0.0001205184,0.000084392654,0.0004363673,0.000013853226,0.0025072307],"category_scores_gemma":[0.00033965925,0.000088612345,0.00006466916,0.0003538214,0.00018140113,0.00028288126,0.000021656908,0.0000685219,0.0022339255],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025321464,0.00023327213,0.016658084,0.00001468021,0.000024057112,0.0000016088989,0.0009635624,0.0005398849,0.00822209,0.35812157,0.019454958,0.5957409],"study_design_scores_gemma":[0.00083183125,0.0009279423,0.04890002,0.0002498983,0.000075305645,0.00007821961,0.0019970983,0.0021003368,0.009208207,0.23837975,0.6961266,0.0011248373],"about_ca_topic_score_codex":0.000007799065,"about_ca_topic_score_gemma":0.0000019906277,"teacher_disagreement_score":0.6766716,"about_ca_system_score_codex":0.00006199567,"about_ca_system_score_gemma":0.00007710076,"threshold_uncertainty_score":0.99854296},"labels":[],"label_agreement":null},{"id":"W20310138","doi":"10.2139/ssrn.619264","title":"A Model of Academic Journal Quality with Applications to Open-Access Journals","year":2004,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Download; Computer science; World Wide Web; Open access journal; Open science; Quality (philosophy); Internet privacy; Political science; MEDLINE; Scopus; Law","score_opus":0.2819255974764905,"score_gpt":0.5344272377599829,"score_spread":0.2525016402834924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20310138","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.29928288,0.0005406508,0.69156814,0.0066913455,0.00003178753,0.00039100193,0.00001218271,0.000011013637,0.001471022],"genre_scores_gemma":[0.99279356,0.0010112978,0.0040665176,0.0005252076,0.00021629361,0.000056398017,6.538978e-7,0.00002291978,0.0013071399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946348,0.00029826871,0.0015509601,0.00039244996,0.0015694246,0.0015540784],"domain_scores_gemma":[0.9960247,0.00032110827,0.0014462433,0.00064561126,0.0010945007,0.00046777897],"candidate_categories":["scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.019921826,0.00020826678,0.0004886098,0.00052306877,0.0008051366,0.0011941702,0.0064888857,0.00010688858,0.00012110496],"category_scores_gemma":[0.00069351064,0.0001398464,0.0001759308,0.0018006039,0.00015113976,0.0019806412,0.00047505615,0.003190774,0.000104837694],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002508714,0.00018459505,0.0011757659,0.0000018180177,0.000091103364,9.011429e-7,0.00045482896,0.06734832,0.0074467924,0.88914907,0.0001837811,0.03371216],"study_design_scores_gemma":[0.00094450853,0.00019419566,0.0008208469,0.000039408733,0.00003234233,0.00096136593,0.002042845,0.00008728442,0.00092526135,0.9923403,0.0014191723,0.00019243898],"about_ca_topic_score_codex":0.000029676756,"about_ca_topic_score_gemma":0.00030946403,"teacher_disagreement_score":0.6935107,"about_ca_system_score_codex":0.0006335733,"about_ca_system_score_gemma":0.0067706737,"threshold_uncertainty_score":0.9998427},"labels":[],"label_agreement":null},{"id":"W2032413283","doi":"10.1109/tfuzz.2012.2183603","title":"Fuzzy Preferences in the Graph Model for Conflict Resolution","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fuzzy logic; Fuzzy number; Satisficing; Defuzzification; Fuzzy set; Fuzzy set operations; Type-2 fuzzy sets and systems; Computer science; Conflict resolution; Fuzzy classification; Graph; Mathematics; Mathematical optimization; Artificial intelligence; Theoretical computer science","score_opus":0.20507309348754804,"score_gpt":0.37537125175992103,"score_spread":0.170298158272373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032413283","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.09601025,0.00027577032,0.8876719,0.000587526,0.0010461389,0.0015394363,0.00020476215,0.000074544856,0.012589706],"genre_scores_gemma":[0.9962847,0.00001891232,0.00022818876,0.0001222821,0.000117085205,0.0011621827,0.0000031184725,0.000011676521,0.002051854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974737,0.00046161193,0.0006269034,0.00033779352,0.000711395,0.0003885795],"domain_scores_gemma":[0.9971693,0.0016838737,0.00016924443,0.0007309226,0.00014394538,0.00010268065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004407828,0.0001663959,0.00024765256,0.00031645247,0.00043749335,0.00017936515,0.0007198266,0.00012364532,0.00001409112],"category_scores_gemma":[0.000053930587,0.00010420799,0.00017218344,0.00081732334,0.00011574528,0.00040921633,0.0000012612345,0.00021811922,0.00022973497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003785765,0.0014140629,0.00033332704,0.0000573053,0.00007424812,5.6071065e-7,0.02097229,0.68828315,0.0020872646,0.25722426,0.0098763015,0.019298624],"study_design_scores_gemma":[0.003631952,0.0006758358,0.0033351744,0.00026410693,0.00028570063,0.00010044928,0.040140092,0.45179263,0.0030142702,0.4311301,0.06392936,0.001700328],"about_ca_topic_score_codex":0.000078575125,"about_ca_topic_score_gemma":0.00012272618,"teacher_disagreement_score":0.90027446,"about_ca_system_score_codex":0.000038186685,"about_ca_system_score_gemma":0.000042171356,"threshold_uncertainty_score":0.42494786},"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":"W2033098199","doi":"10.1023/b:grup.0000045751.21207.35","title":"Strength of Preference in the Graph Model for Conflict Resolution","year":2004,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":146,"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; University of Waterloo","funders":"","keywords":"Preference; Stability (learning theory); Conflict resolution; Mathematical economics; Graph; Decision maker; Mathematics; Simple (philosophy); Computer science; Microeconomics; Economics; Operations research; Epistemology; Combinatorics; Political science; Machine learning","score_opus":0.1912153315142716,"score_gpt":0.3808573237261959,"score_spread":0.1896419922119243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033098199","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.56645525,0.0000612028,0.43264294,0.00031742099,0.000026667696,0.00027600917,0.000016142356,0.000006381414,0.00019797983],"genre_scores_gemma":[0.9939027,0.00005587084,0.0057844813,0.0001423596,0.000015422333,0.000050202296,0.000010479932,0.00000335071,0.000035173227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859023,0.000083153835,0.0004712603,0.0002635261,0.00047990246,0.00011191656],"domain_scores_gemma":[0.9978501,0.0014574351,0.0001865379,0.00035065852,0.00012256557,0.000032681575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023235646,0.00007624133,0.00013623298,0.00018889514,0.00012742326,0.00006294657,0.00033357265,0.00006251811,0.000010239671],"category_scores_gemma":[0.00094417913,0.000047291604,0.000055572684,0.0005246133,0.00007179677,0.00022282377,0.000031753352,0.00006935413,0.000007755861],"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.0002863158,0.00024531607,0.0007847519,0.000005191787,0.0000038512494,1.8229484e-7,0.005296421,0.024596184,0.0027855944,0.84330046,0.000530299,0.12216544],"study_design_scores_gemma":[0.0009069798,0.000084317304,0.04277466,0.000019502957,0.0000066816606,0.0000017687214,0.0006762426,0.07857341,0.00027090457,0.8759085,0.0007107981,0.000066210116],"about_ca_topic_score_codex":0.000013726727,"about_ca_topic_score_gemma":0.00015794634,"teacher_disagreement_score":0.42744738,"about_ca_system_score_codex":0.000013030842,"about_ca_system_score_gemma":0.000022426118,"threshold_uncertainty_score":0.19284956},"labels":[],"label_agreement":null},{"id":"W2033203612","doi":"10.1016/j.mathsocsci.2005.07.001","title":"Agreement and stochastic independence of belief functions","year":2005,"lang":"en","type":"article","venue":"Mathematical Social Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Independence (probability theory); Mathematical economics; Monotone polygon; Action (physics); Function (biology); Nash equilibrium; Foundation (evidence); Common knowledge (logic); Belief revision; Computer science; Mathematics; Economics; Artificial intelligence; Political science; Law; Statistics","score_opus":0.13975764654364783,"score_gpt":0.41723075277335114,"score_spread":0.27747310622970334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033203612","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.75095046,0.000058657763,0.1798861,0.0075600445,0.000052831423,0.00025258018,0.000013343737,0.000029690398,0.061196283],"genre_scores_gemma":[0.99630815,6.4571134e-7,0.0022791508,0.00010026772,0.00006844577,0.00001525736,1.5051141e-7,0.0000016623586,0.0012262524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980181,0.00006958138,0.00038625937,0.0002513102,0.0011013927,0.00017335569],"domain_scores_gemma":[0.9986104,0.00095509656,0.00014132827,0.0001330626,0.00009660501,0.00006354884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002895994,0.00006987314,0.0001742459,0.000075938224,0.0005411058,0.00010125758,0.00044818202,0.00004453461,0.0014357138],"category_scores_gemma":[0.0009896582,0.000046305166,0.000049272097,0.0006497351,0.001102298,0.00019266424,0.00012743902,0.00007148434,0.0004461098],"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.0000036925067,0.00016172887,0.00019355743,0.000004324129,0.000004860983,9.9259275e-8,0.0022797468,0.00020370673,0.00062284054,0.9395968,0.00074196863,0.0561867],"study_design_scores_gemma":[0.00010083525,0.00005880101,0.0032027212,0.000009423076,0.000012028058,0.0000035959447,0.0030516963,0.0033776257,0.00017638023,0.98858386,0.0013285463,0.00009450049],"about_ca_topic_score_codex":0.000004846716,"about_ca_topic_score_gemma":0.000014645405,"teacher_disagreement_score":0.2453577,"about_ca_system_score_codex":0.000011791757,"about_ca_system_score_gemma":0.00003968029,"threshold_uncertainty_score":0.9994771},"labels":[],"label_agreement":null},{"id":"W2034733755","doi":"10.1111/1468-0262.00243","title":"Common Knowledge with Monotone Statistics","year":2001,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Statistics; Sufficient statistic; Statistic; Mathematics; Probability and statistics; Ancillary statistic; Partition (number theory); Monotone polygon; Test statistic; Econometrics; Statistical hypothesis testing; Combinatorics","score_opus":0.1284950790698639,"score_gpt":0.3984201426890689,"score_spread":0.269925063619205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034733755","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.49788523,0.00025429195,0.11877023,0.0007496575,0.00010563588,0.00023334332,0.00009492219,0.000067969595,0.38183874],"genre_scores_gemma":[0.98359525,0.000022679593,0.0028823717,0.000095843716,0.00004901022,0.00002517009,0.00000611196,0.000007957971,0.013315606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989873,0.00006001245,0.00032455163,0.00028172968,0.00017220496,0.00017420608],"domain_scores_gemma":[0.9973801,0.0016991226,0.00013390092,0.0005529224,0.00010842441,0.0001255342],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007766508,0.0000851774,0.0001971848,0.0005346543,0.00014045689,0.00013165094,0.00050099473,0.000029217996,0.0027256552],"category_scores_gemma":[0.00040754894,0.000061232284,0.000029172685,0.0027133583,0.00010182415,0.00014258256,0.00006289334,0.00008302786,0.0063732564],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072906594,0.0004883053,0.09621101,0.0000023672947,0.000033799322,0.000013842336,0.0005723613,0.00028056273,0.000023649347,0.34617877,0.048439864,0.50768256],"study_design_scores_gemma":[0.00031043484,0.00012622209,0.08481712,0.0000020567609,0.000008926949,0.00001745099,0.00024284478,0.0012589773,0.000095437455,0.15202649,0.76092464,0.00016937431],"about_ca_topic_score_codex":0.000007970053,"about_ca_topic_score_gemma":0.00003397796,"teacher_disagreement_score":0.7124848,"about_ca_system_score_codex":0.000028241402,"about_ca_system_score_gemma":0.000030087902,"threshold_uncertainty_score":0.998186},"labels":[],"label_agreement":null},{"id":"W2035417355","doi":"10.1016/j.disc.2008.04.004","title":"The capture time of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":74,"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; Université du Québec à Montréal; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; McGill University","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Time complexity; Bounded function; Indifference graph; Graph","score_opus":0.06822045206016554,"score_gpt":0.34083261311603175,"score_spread":0.2726121610558662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035417355","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.7970381,0.0002586036,0.040742345,0.0021328952,0.00008477464,0.00044633888,0.000059758066,0.000068269954,0.15916894],"genre_scores_gemma":[0.9792139,0.0000146488255,0.0029348328,0.00004692997,0.000017997912,0.000014474588,0.0000014726584,0.000007707855,0.017748028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876064,0.000056357112,0.00040210516,0.00012041451,0.0005419019,0.00011856112],"domain_scores_gemma":[0.9974152,0.0014830801,0.00021560177,0.0007212568,0.00012205157,0.00004284504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042078,0.00007228831,0.00016156428,0.000040230367,0.00027081784,0.000033076536,0.0006803703,0.000032529508,0.00016897239],"category_scores_gemma":[0.0008416284,0.000035552745,0.00011285907,0.00041025304,0.0003495295,0.0000523307,0.00006851123,0.000066689274,0.0006014759],"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.000013615225,0.00012391669,0.00024673858,0.000011966999,0.00003698608,0.0000036624986,0.016921202,0.000074652766,0.003258332,0.9410167,0.036937073,0.0013551844],"study_design_scores_gemma":[0.0000878479,0.00001540786,0.00035806105,0.000009460578,0.000011099637,0.000028405351,0.0024667578,0.0016448821,0.0016196478,0.9834684,0.010208065,0.00008195505],"about_ca_topic_score_codex":0.0000014139545,"about_ca_topic_score_gemma":0.0000013344693,"teacher_disagreement_score":0.18217584,"about_ca_system_score_codex":0.0000029968016,"about_ca_system_score_gemma":0.00002007629,"threshold_uncertainty_score":0.7730956},"labels":[],"label_agreement":null},{"id":"W2036051641","doi":"10.1142/s0219525900000157","title":"Towards Computational Institutional Analysis: Discrete Simulation of a 3P Model","year":2000,"lang":"en","type":"article","venue":"Advances in Complex Systems","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":"Université du Québec en Outaouais","funders":"","keywords":"Predation; Neglect; Incentive; Institution; Production (economics); Economics; Microeconomics; Computer science; Ecology; Biology; Political science; Psychology","score_opus":0.12178772424602904,"score_gpt":0.4395648165759394,"score_spread":0.31777709232991036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036051641","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.16097428,0.00045912623,0.8193501,0.00007400358,0.000053283802,0.00024281307,0.00015561483,0.000025863696,0.018664883],"genre_scores_gemma":[0.995579,0.00001167075,0.0038682693,0.000031099906,0.00003366254,0.000035164627,0.00006549079,0.0000040044056,0.00037160458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975426,0.00017839184,0.00089812424,0.0003466893,0.00089072325,0.00014344536],"domain_scores_gemma":[0.9984586,0.0006605409,0.00024446475,0.0003657991,0.00021816103,0.000052422532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010319675,0.000109731875,0.00037068583,0.00033800676,0.00012249134,0.000057159938,0.0004644481,0.000039193834,0.00044496008],"category_scores_gemma":[0.00013536436,0.00008886708,0.00012322227,0.0017867562,0.00020133531,0.00055054267,0.00003220978,0.00006903369,0.000078753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002694883,0.00003721332,0.0013463685,0.0000052498062,0.000019521087,3.9099558e-7,0.00018279212,0.89114136,0.000016172211,0.10041681,0.000012750811,0.006794428],"study_design_scores_gemma":[0.00018654177,0.000010851413,0.0062755323,0.000011101196,0.000018533234,0.000001392196,0.00012206246,0.8371511,0.000002640478,0.15093488,0.0052038976,0.00008149641],"about_ca_topic_score_codex":0.00003465009,"about_ca_topic_score_gemma":0.000047209465,"teacher_disagreement_score":0.83460474,"about_ca_system_score_codex":0.00004081513,"about_ca_system_score_gemma":0.00006360456,"threshold_uncertainty_score":0.48720008},"labels":[],"label_agreement":null},{"id":"W2036618357","doi":"10.1017/s1355770x08004609","title":"Game theoretic applications to environmental and natural resource problems","year":2008,"lang":"en","type":"article","venue":"Environment and Development Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Natural resource; Game theory; Resource (disambiguation); Resource allocation; Public good; Environmental economics; Resource management (computing); Fishing; Common-pool resource; Public goods game; Cooperative game theory; Environmental resource management; Natural resource economics; Computer science; Economics; Microeconomics; Ecology","score_opus":0.03522234993404684,"score_gpt":0.24091718809833695,"score_spread":0.20569483816429013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036618357","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.99342835,0.00021427237,0.003962711,0.000539407,0.00001849438,0.00050357706,0.000010962519,0.000019165374,0.0013030783],"genre_scores_gemma":[0.99018395,0.0003899318,0.0045087324,0.0004260555,0.00003094911,0.00019926543,0.00002170866,0.000012639508,0.004226789],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866337,0.000036428755,0.00040845352,0.0005293919,0.00015843556,0.0002039104],"domain_scores_gemma":[0.999174,0.00019397851,0.00010256105,0.00033492906,0.0000022970655,0.0001922121],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051369716,0.00015855621,0.0001741985,0.000096034564,0.00036116928,0.0000656001,0.00025224139,0.000044399174,0.00026489256],"category_scores_gemma":[0.000009708511,0.00012426396,0.000023044797,0.000042825068,0.0003079678,0.00012008326,0.00028152435,0.000086896136,0.001130227],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001555045,0.00065588776,0.2056308,0.00002374866,0.00014365868,0.0000065955082,0.030863458,0.0029277883,0.004196637,0.06721378,0.0018499305,0.6863322],"study_design_scores_gemma":[0.00027038308,0.000023765755,0.114172265,0.000002438731,0.0000045653196,0.000034391564,0.00056969223,0.00014475033,0.0006564081,0.014619079,0.8692325,0.0002697992],"about_ca_topic_score_codex":4.1643443e-7,"about_ca_topic_score_gemma":9.628735e-7,"teacher_disagreement_score":0.8673825,"about_ca_system_score_codex":0.00006289031,"about_ca_system_score_gemma":0.000016337424,"threshold_uncertainty_score":0.9996475},"labels":[],"label_agreement":null},{"id":"W2037011093","doi":"10.1007/s10726-008-9154-6","title":"Perceptual Graph Model Systems","year":2009,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":36,"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; University of Waterloo","funders":"","keywords":"Perception; Computer science; Graph; Conflict resolution; Artificial intelligence; Management science; Theoretical computer science; Psychology; Engineering; Political science","score_opus":0.08354642610346615,"score_gpt":0.3660137352203822,"score_spread":0.2824673091169161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037011093","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.5686886,0.00017217596,0.42719954,0.00042959122,0.00014332663,0.00017823426,0.000007744153,0.000057156085,0.0031236464],"genre_scores_gemma":[0.99637806,0.000051096573,0.0023059521,0.00041374445,0.000068904774,0.000009393243,0.000008225405,0.000005407944,0.00075920735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979527,0.00010947592,0.0005155298,0.00044282767,0.0008080773,0.00017137386],"domain_scores_gemma":[0.9984429,0.00063535117,0.00015145654,0.00047382904,0.00015316549,0.0001432912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016297759,0.00012502904,0.0001984442,0.00026119608,0.00028840813,0.0003356029,0.0003235963,0.00009581714,0.00009982726],"category_scores_gemma":[0.000513959,0.00009123514,0.000074299205,0.0005616112,0.000052754753,0.00043407668,0.000039747396,0.00010029163,0.0003362695],"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.00010642814,0.00014231757,0.00046515578,0.0000012434684,0.000004551783,0.0000013536609,0.0011911893,0.008198723,0.0064358357,0.49891326,0.012432612,0.47210732],"study_design_scores_gemma":[0.0004783087,0.000113993454,0.04263498,0.000014032783,0.000011036085,0.000017250595,0.0009480597,0.18745399,0.000050616127,0.7635564,0.004530907,0.00019038137],"about_ca_topic_score_codex":0.0000034255293,"about_ca_topic_score_gemma":0.0000035143198,"teacher_disagreement_score":0.47191694,"about_ca_system_score_codex":0.000015924537,"about_ca_system_score_gemma":0.00001248158,"threshold_uncertainty_score":0.43221763},"labels":[],"label_agreement":null},{"id":"W2038221808","doi":"10.1111/j.1468-2354.2004.00132.x","title":"Comparative Learning Dynamics*","year":2004,"lang":"en","type":"article","venue":"International Economic Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dynamics (music); Introspection; Class (philosophy); Population; Computer science; Artificial intelligence; Cognitive psychology; Psychology; Sociology; Demography","score_opus":0.1384601205677477,"score_gpt":0.4488179419767366,"score_spread":0.3103578214089889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038221808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09920597,0.009195019,0.030992916,0.050574042,0.0014376878,0.00072407944,0.0000830027,0.0001158443,0.8076714],"genre_scores_gemma":[0.99084705,0.002539907,0.0004488391,0.0010305562,0.00009383069,0.00003868723,0.000026290732,0.000004546375,0.0049702623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894047,0.00006258258,0.00049114745,0.00025014643,0.00017615661,0.0000794786],"domain_scores_gemma":[0.99911433,0.00028234214,0.00024659248,0.00022412106,0.00008599535,0.000046610996],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001092011,0.000074177784,0.000233331,0.00006229395,0.00006581425,0.00008781855,0.0006987217,0.000017229333,0.0032588046],"category_scores_gemma":[0.0002655686,0.000059870017,0.00011178032,0.00007810065,0.000057024226,0.00021620585,0.00007325276,0.0001028732,0.014907189],"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.000003835049,0.000025904665,0.00038245987,0.000007837479,0.000030266414,0.0000010063676,0.00009392601,0.012010117,0.000010545063,0.9501977,0.0032582786,0.033978146],"study_design_scores_gemma":[0.00019649361,0.000014826756,0.0008346273,0.00022617207,0.000008687487,0.000025229005,0.00012011877,0.0032582297,0.000055252513,0.29785883,0.69727767,0.00012387673],"about_ca_topic_score_codex":0.0000137049565,"about_ca_topic_score_gemma":0.00003739723,"teacher_disagreement_score":0.8916411,"about_ca_system_score_codex":0.00020849645,"about_ca_system_score_gemma":0.000054904976,"threshold_uncertainty_score":0.99765235},"labels":[],"label_agreement":null},{"id":"W2039137793","doi":"10.5539/ijef.v6n9p228","title":"Information Signal Quality and Risky Project Evaluation in Organizations (Environment, Adoptability and Choice–Hierarchies and Polyarchies)","year":2014,"lang":"en","type":"article","venue":"International Journal of Economics and Finance","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quality (philosophy); Computer science; Organizational structure; Information quality; Variable (mathematics); Government (linguistics); Sensitivity (control systems); Risk analysis (engineering); Knowledge management; Information system; Process management; Business; Economics; Mathematics; Management; Engineering","score_opus":0.0597866644814627,"score_gpt":0.3579842126320156,"score_spread":0.2981975481505529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039137793","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.9948579,0.0001592757,0.002926634,0.0016243559,0.000054200293,0.00010962165,0.0000319748,0.0000011303097,0.00023492826],"genre_scores_gemma":[0.9968716,0.0017386929,0.0012128161,0.00010437615,0.000048726917,0.000004596475,0.000003996452,0.0000022726952,0.000012928702],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989252,0.00012426898,0.00060795806,0.0001214033,0.00015789765,0.00006328339],"domain_scores_gemma":[0.99860054,0.00062244496,0.00046698443,0.00008762617,0.00019181857,0.00003055678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921784,0.000067992085,0.00014968109,0.00021012717,0.00007885183,0.00019875211,0.00014611743,0.000032184693,0.000014270864],"category_scores_gemma":[0.00097070617,0.000058600494,0.000015115772,0.000077397315,0.00018242029,0.0008244031,0.00008758274,0.00009787178,0.0000016891729],"study_design_candidate":"observational","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.0001525059,0.00008776146,0.2244566,0.000007645514,0.0000320669,2.023468e-7,0.0035140547,0.0058341306,0.00012432145,0.17766133,0.000050781862,0.5880786],"study_design_scores_gemma":[0.000765328,0.000057937603,0.7474697,0.0000119543965,0.0000071919926,0.000025273275,0.00034321236,0.042383563,0.000049521124,0.19783758,0.010965755,0.000082952865],"about_ca_topic_score_codex":0.000041237003,"about_ca_topic_score_gemma":0.00005601888,"teacher_disagreement_score":0.58799565,"about_ca_system_score_codex":0.000027165152,"about_ca_system_score_gemma":0.00004960413,"threshold_uncertainty_score":0.23896587},"labels":[],"label_agreement":null},{"id":"W2039661659","doi":"10.1007/pl00004094","title":"Conformism and diversity under social learning","year":2001,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":147,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Diversity (politics); Public finance; Social learning; Microeconomics; Economics; Emerging technologies; Positive economics; Neoclassical economics; Sociology; Computer science; Knowledge management; Artificial intelligence","score_opus":0.09749753482890745,"score_gpt":0.3500213306348682,"score_spread":0.25252379580596074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039661659","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.9063634,0.000021836007,0.0027959521,0.0006002465,0.000073349824,0.000042690346,0.0000033685774,0.000029367242,0.09006974],"genre_scores_gemma":[0.98408014,0.000008961785,0.00001871337,0.00025833395,0.00008712793,0.000001815191,9.479343e-7,0.0000033828153,0.015540604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993465,0.00012575093,0.00015471406,0.0001917189,0.00006681331,0.00011450747],"domain_scores_gemma":[0.9990386,0.00068000535,0.00008638358,0.00013110404,0.00001388754,0.00005004082],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019673952,0.0000574418,0.00010839494,0.000051711464,0.0006524964,0.000075834774,0.00025443773,0.00004012684,0.0027719995],"category_scores_gemma":[0.00008366028,0.000050346054,0.000041826665,0.000043103115,0.00018572492,0.0001775271,0.00027250656,0.00009162579,0.0016491644],"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.000028564611,0.0000054942984,0.004127404,2.138167e-7,0.0000075905054,4.948459e-7,0.0012459793,0.00011719078,0.00003537933,0.9617289,0.0005653264,0.0321375],"study_design_scores_gemma":[0.00017926157,0.000007893794,0.025410766,4.976542e-7,0.000004693757,0.0000074575087,0.00372093,0.00012260133,0.000027343161,0.9258975,0.044549216,0.000071847775],"about_ca_topic_score_codex":0.0000073297615,"about_ca_topic_score_gemma":0.0000073933434,"teacher_disagreement_score":0.07771666,"about_ca_system_score_codex":0.000024816833,"about_ca_system_score_gemma":0.000015618598,"threshold_uncertainty_score":0.99912816},"labels":[],"label_agreement":null},{"id":"W2039786295","doi":"10.1007/s00453-007-9018-5","title":"Stackelberg Strategies for Selfish Routing in General Multicommodity Networks","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"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":"Price of anarchy; Stackelberg competition; Routing (electronic design automation); Computer science; Latency (audio); Nash equilibrium; Theory of computation; Mathematical optimization; Upper and lower bounds; Price of stability; Mathematical economics; Mathematics; Topology (electrical circuits); Computer network; Combinatorics; Economics; Telecommunications","score_opus":0.08005567828149378,"score_gpt":0.40284479965577813,"score_spread":0.32278912137428434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039786295","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.38578,0.000018591743,0.6106628,0.00027326905,0.00018427572,0.00028600002,0.000017464068,0.000044636978,0.0027329596],"genre_scores_gemma":[0.9745542,0.000001569192,0.024329226,0.00021587488,0.00035359527,0.00003387131,0.000011807682,0.00001160055,0.0004883026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981402,0.00009078534,0.00059893256,0.00039680378,0.00033147674,0.00044177764],"domain_scores_gemma":[0.9969862,0.0021672049,0.0001498351,0.0004394648,0.00015580536,0.000101493715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271779,0.00012740606,0.00021999452,0.00012626857,0.00019166587,0.00020747993,0.0005714403,0.00010102004,0.00006645022],"category_scores_gemma":[0.00039647598,0.00010765079,0.000092164264,0.000564194,0.00009386661,0.00027676934,0.00008747644,0.0001783925,0.00004480532],"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.0001283478,0.00034661163,0.0050213817,0.0000045501856,0.000026982005,0.000012854455,0.0017749821,0.015696377,0.00091321906,0.46165195,0.0058260853,0.50859666],"study_design_scores_gemma":[0.0010961688,0.00006837284,0.032285146,0.000011958412,0.00001299175,0.000008369254,0.0040588486,0.5316511,0.0011723413,0.4099798,0.01925885,0.000396057],"about_ca_topic_score_codex":0.00006494393,"about_ca_topic_score_gemma":0.0003362823,"teacher_disagreement_score":0.58877414,"about_ca_system_score_codex":0.00003944079,"about_ca_system_score_gemma":0.00004982338,"threshold_uncertainty_score":0.43898717},"labels":[],"label_agreement":null},{"id":"W2039815460","doi":"10.5539/jmr.v1n1p57","title":"Two-Person Non Zero-Sum Bimatrix Game with Fuzzy Payoffs and Its Equilibrium Strategy","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Zero (linguistics); Mathematical economics; Order (exchange); Mathematical optimization; Artificial intelligence; Computer science; Economics","score_opus":0.28272925870807825,"score_gpt":0.4887613829885471,"score_spread":0.20603212428046885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039815460","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.9800005,0.00034367162,0.0026919737,0.0024500058,0.00002685737,0.00025084923,0.0000056228732,0.00000882787,0.014221708],"genre_scores_gemma":[0.9930252,0.000044995362,0.0040228236,0.0000269616,0.00010487551,0.0000030330264,3.114843e-7,0.000012497928,0.0027593223],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569184,0.00028874815,0.000734037,0.00022923487,0.0026424136,0.00041372847],"domain_scores_gemma":[0.99559003,0.001896542,0.00044892894,0.0004412608,0.0013132697,0.0003099887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111059835,0.00014065106,0.00040710528,0.0005811807,0.00015116636,0.0005063102,0.00091747753,0.000069847,0.00014457326],"category_scores_gemma":[0.0012383297,0.00008205876,0.00008698951,0.0009999302,0.00016773601,0.0004713903,0.00007193951,0.00064630527,0.00016047349],"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.0010369836,0.003142883,0.00058942154,0.0003205385,0.00021937843,0.00047616605,0.016489394,0.0030334592,0.54237884,0.34507355,0.021864746,0.06537463],"study_design_scores_gemma":[0.0017770672,0.002311112,0.002158869,0.0003102071,0.000037974132,0.0009249563,0.010989525,0.011047447,0.013130382,0.9561437,0.0008903662,0.00027843693],"about_ca_topic_score_codex":0.000002058712,"about_ca_topic_score_gemma":0.000002134578,"teacher_disagreement_score":0.6110701,"about_ca_system_score_codex":0.00003823889,"about_ca_system_score_gemma":0.00020843587,"threshold_uncertainty_score":0.48823607},"labels":[],"label_agreement":null},{"id":"W2039937992","doi":"10.1007/s11518-007-5042-x","title":"Conflict analysis approaches for investigating attitudes and misperceptions in the War of 1812","year":2007,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":100,"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 Waterloo","funders":"","keywords":"Conflict resolution; Spanish Civil War; Order (exchange); Political science; Social psychology; Psychology; Sociology; Epistemology; Law; Economics","score_opus":0.20710599055367107,"score_gpt":0.376403802610839,"score_spread":0.16929781205716793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039937992","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.9359843,0.0012281401,0.062245958,0.000062767045,0.00012401033,0.00023031248,0.0000034486352,0.0000032600885,0.000117772724],"genre_scores_gemma":[0.99920803,0.000011776852,0.00066113414,0.0000059634413,0.00008195085,0.0000086390355,1.2427408e-7,0.0000029737866,0.000019386582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977561,0.00006376688,0.0009823128,0.00016802568,0.0008485192,0.00018125078],"domain_scores_gemma":[0.9974052,0.0013967253,0.00047396513,0.0002091699,0.0004114865,0.00010348888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02631762,0.00008332324,0.00036350833,0.0008220617,0.0001617964,0.00021265593,0.00048336637,0.00003735366,4.6636308e-7],"category_scores_gemma":[0.0014054999,0.00004873402,0.00006540669,0.0019969482,0.00025420354,0.00036819605,0.000028686696,0.00010369461,3.158383e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021046832,0.000115194205,0.2602535,0.00066547,0.00022302174,0.0000072960424,0.037999164,0.41868743,0.16132587,0.11787103,0.00012819283,0.002702772],"study_design_scores_gemma":[0.000598683,0.00018021371,0.36514145,0.00045962937,0.00018663713,0.00045091097,0.08178148,0.5483159,0.0005504943,0.00041521597,0.0016355505,0.00028386436],"about_ca_topic_score_codex":0.00003766867,"about_ca_topic_score_gemma":0.0000098130195,"teacher_disagreement_score":0.16077538,"about_ca_system_score_codex":0.000028010085,"about_ca_system_score_gemma":0.00005284003,"threshold_uncertainty_score":0.9121215},"labels":[],"label_agreement":null},{"id":"W2043979455","doi":"10.1016/j.dam.2006.04.021","title":"Generalized metarationalities in the graph model for conflict resolution","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":39,"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 Waterloo; Wilfrid Laurier University; Toronto Metropolitan University","funders":"Ministry of Education, Culture, Sports, Science and Technology; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Kagawa University","keywords":"Stability (learning theory); Mathematics; Graph; Tree (set theory); Set (abstract data type); Resolution (logic); Conflict resolution; Mathematical optimization; Mathematical economics; Computer science; Combinatorics; Artificial intelligence; Machine learning","score_opus":0.16254883111292573,"score_gpt":0.380060997582261,"score_spread":0.21751216646933524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043979455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060177956,0.000051981864,0.9092589,0.001054214,0.000018435017,0.0009255871,0.00009265317,0.00003385467,0.028386392],"genre_scores_gemma":[0.8898191,0.0000037363448,0.106413536,0.00034458516,0.00007151027,0.0009434574,0.000079488214,0.000013406505,0.002311207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982385,0.000049228867,0.0006518296,0.0002515968,0.00060563063,0.00020320204],"domain_scores_gemma":[0.99776083,0.001339051,0.00021299103,0.0005750021,0.000089667,0.000022451484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027038658,0.00013182183,0.00023335662,0.00011665818,0.00021433587,0.00017138122,0.00059861003,0.00005703279,0.000030589144],"category_scores_gemma":[0.00015270147,0.00007948536,0.00011958474,0.00039771703,0.00013431058,0.00009206404,0.000033701777,0.000073647585,0.00004294188],"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.000012809274,0.00005173387,0.0000023654236,0.0000066587645,0.0000040883565,6.942965e-8,0.0016726026,0.024794076,0.0013496907,0.96767306,0.0043818206,0.000051050094],"study_design_scores_gemma":[0.00024303794,0.0000041552057,0.00003828025,0.0000022867011,0.00001526023,9.892666e-7,0.0013145405,0.25517505,0.00029705424,0.74004304,0.0027852487,0.00008104518],"about_ca_topic_score_codex":0.000009911683,"about_ca_topic_score_gemma":0.0000500033,"teacher_disagreement_score":0.8296411,"about_ca_system_score_codex":0.000012909239,"about_ca_system_score_gemma":0.00002697017,"threshold_uncertainty_score":0.3241319},"labels":[],"label_agreement":null},{"id":"W2044137428","doi":"10.1007/978-1-4020-2936-3_11","title":"The Dynamic Stability of Coalitionist Behaviour for Two-Strategy Bimatrix Games","year":2004,"lang":"en","type":"book-chapter","venue":"Theory and decision library. Series C, Game theory, mathematical programming and operations research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University","funders":"","keywords":"Replicator equation; Nash equilibrium; Mathematical economics; Stability (learning theory); Mathematical optimization; Computer science; Mathematics; Sociology","score_opus":0.10413757650608219,"score_gpt":0.42298688244120636,"score_spread":0.31884930593512417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044137428","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.1895353,0.018404674,0.48178893,0.007435678,0.0005871091,0.023149112,0.0039302693,0.000973442,0.2741955],"genre_scores_gemma":[0.8307743,0.0008934883,0.016272549,0.000052649033,0.00013875971,0.0008432735,0.00015235577,0.00015520846,0.15071741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993239,0.0013668048,0.0019682215,0.0011367799,0.001589718,0.000699487],"domain_scores_gemma":[0.96862525,0.028116314,0.00028534196,0.001733293,0.00084992417,0.00038987212],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0236311,0.0005401794,0.0009747586,0.00045164584,0.0024139911,0.002600274,0.0013599251,0.00040066877,0.001507163],"category_scores_gemma":[0.0045668217,0.0003354171,0.00033049757,0.00041565468,0.0065732887,0.00096582936,0.0007478559,0.0008952577,0.000108952416],"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.0012653559,0.00013726059,0.0000018436039,0.000094762385,0.000044826393,0.0000025695822,0.0006787361,0.000038969352,0.000049250484,0.87496954,0.00005527582,0.12266162],"study_design_scores_gemma":[0.000615377,0.0005989676,0.0000102613485,0.000284455,0.00007931364,0.000049217546,0.004590568,0.00041669622,0.00047480897,0.9859414,0.006586024,0.0003529067],"about_ca_topic_score_codex":0.0000022771776,"about_ca_topic_score_gemma":0.000013633438,"teacher_disagreement_score":0.641239,"about_ca_system_score_codex":0.000044481192,"about_ca_system_score_gemma":0.00044307538,"threshold_uncertainty_score":0.99990976},"labels":[],"label_agreement":null},{"id":"W2046746658","doi":"10.1109/tsmcb.2010.2042108","title":"Special Issue on Game Theory","year":2010,"lang":"en","type":"editorial","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Game theory; Focus (optics); Computer science; Management science; State (computer science); Engineering ethics; Data science; Mathematical economics; Mathematics; Engineering; Algorithm","score_opus":0.03175290586044338,"score_gpt":0.31558939871396324,"score_spread":0.28383649285351986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046746658","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001131253,0.0002380841,0.009124057,0.00031010914,0.8672384,0.0016010837,0.001758005,0.00024906645,0.11834995],"genre_scores_gemma":[0.04440406,0.0006129815,0.00005909394,0.00015858265,0.69767344,0.00033393136,0.00006274552,0.00019772898,0.25649744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9897523,0.0011961858,0.002092866,0.0021906751,0.003808797,0.00095916993],"domain_scores_gemma":[0.9870498,0.007554334,0.0009810288,0.0028981995,0.00078230194,0.000734288],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0039085397,0.0011851825,0.0015424954,0.000811473,0.0006426341,0.0013872623,0.0020001717,0.0022838423,0.0029690068],"category_scores_gemma":[0.0004660454,0.001018013,0.0005494231,0.0007376789,0.00096544286,0.00015741003,0.000025170184,0.0035225768,0.009098056],"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.00026302435,0.00045314274,0.0000011897345,0.000049729,0.00013775293,0.00001867634,0.0007983176,0.0011260313,0.00004495702,0.008754099,0.9532427,0.035110384],"study_design_scores_gemma":[0.0008983806,0.00052215345,0.000011310917,0.0002680983,0.0002646255,0.000020437463,0.0004963913,0.00022150512,0.0005415705,0.009955611,0.98577505,0.0010248448],"about_ca_topic_score_codex":0.00008768417,"about_ca_topic_score_gemma":0.0002904413,"teacher_disagreement_score":0.16956496,"about_ca_system_score_codex":0.00013259474,"about_ca_system_score_gemma":0.00027317484,"threshold_uncertainty_score":0.9996494},"labels":[],"label_agreement":null},{"id":"W2047115169","doi":"10.1109/cdc.2013.6759944","title":"Strategic multi-layer network formation","year":2013,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise comparison; Generalization; Node (physics); Enhanced Data Rates for GSM Evolution; Computer science; Set (abstract data type); Stability (learning theory); Function (biology); Layer (electronics); Mathematical optimization; Mathematics; Artificial intelligence; Engineering","score_opus":0.34977045375700394,"score_gpt":0.4181039199062089,"score_spread":0.06833346614920494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047115169","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.60130554,0.000019033589,0.18493286,0.0014084292,0.000106334555,0.0003143041,0.000001165557,0.000088948495,0.21182339],"genre_scores_gemma":[0.978353,0.0000012384155,0.0071431547,0.00043108079,0.000058359736,0.000044313332,0.0000017961892,0.0000025982415,0.013964455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914235,0.00006322606,0.00026302758,0.0001379865,0.00025089926,0.0001425191],"domain_scores_gemma":[0.9991423,0.00026091913,0.00007073518,0.00032560964,0.0001377425,0.00006272246],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007142335,0.000052155654,0.00007117629,0.000034193137,0.00012729714,0.00023389701,0.00030867566,0.00003132715,0.008669658],"category_scores_gemma":[0.00006321023,0.000032140662,0.000036171234,0.0003460501,0.00002984193,0.0005013915,0.000036976442,0.000047992795,0.024150308],"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.0000030565695,0.00005392478,0.0009474389,0.0000010167976,0.000004362331,2.2527438e-7,0.00023959765,0.0024559947,0.0032983904,0.87095857,0.07978889,0.042248532],"study_design_scores_gemma":[0.00013134185,0.000011734709,0.011859568,0.0000014940484,0.0000018715494,0.000002652605,0.0010473422,0.057755467,0.00049521367,0.92086506,0.0077450834,0.000083183084],"about_ca_topic_score_codex":0.00001621159,"about_ca_topic_score_gemma":0.000021726071,"teacher_disagreement_score":0.37704748,"about_ca_system_score_codex":0.000005392339,"about_ca_system_score_gemma":0.000008599168,"threshold_uncertainty_score":0.99223655},"labels":[],"label_agreement":null},{"id":"W2048490690","doi":"10.1016/j.eswa.2014.02.002","title":"To compete or cooperate? This is the question in communities of autonomous services","year":2014,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University; Concordia University","funders":"","keywords":"Coopetition; Computer science; Competition (biology); Context (archaeology); Order (exchange); Game theory; Shapley value; Mechanism (biology); Cooperative game theory; Operations research; Microeconomics; Business; Economics; Mathematics","score_opus":0.05254115642723251,"score_gpt":0.3656151281304478,"score_spread":0.31307397170321527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048490690","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.47505102,0.0010315059,0.42230204,0.023670565,0.0003235488,0.010051494,0.00028077877,0.00042927486,0.06685978],"genre_scores_gemma":[0.99258167,0.000010237012,0.0010406567,0.0009626803,0.00006680689,0.002736764,0.000010666325,0.000013324743,0.0025771742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980275,0.00046255073,0.0006366029,0.0002608933,0.000440489,0.00017193238],"domain_scores_gemma":[0.9964415,0.0013808244,0.0002534253,0.0014540468,0.00038753616,0.00008268603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018603264,0.00014160821,0.0003004004,0.00016411704,0.00036480906,0.00016982097,0.0012314273,0.00005452152,0.0001687549],"category_scores_gemma":[0.000042123447,0.000074382886,0.000032566113,0.0011500617,0.0001734206,0.00013626405,0.00010065947,0.00011329072,0.00048649672],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017187427,0.00044296365,0.010086797,0.00007919317,0.000050484763,4.3615233e-7,0.07128828,0.011266469,0.0033802171,0.88519764,0.008646574,0.009389052],"study_design_scores_gemma":[0.00049123005,0.00019575488,0.0053966152,0.00022642614,0.000013041372,0.000026238724,0.03999831,0.015631007,0.0014987958,0.003994437,0.9321801,0.00034805335],"about_ca_topic_score_codex":0.002328358,"about_ca_topic_score_gemma":0.0020078092,"teacher_disagreement_score":0.9235335,"about_ca_system_score_codex":0.000031283857,"about_ca_system_score_gemma":0.000059041035,"threshold_uncertainty_score":0.62530935},"labels":[],"label_agreement":null},{"id":"W2051806646","doi":"10.1007/s11269-014-0550-1","title":"Water Diversion Conflicts in China: A Hierarchical Perspective","year":2014,"lang":"en","type":"article","venue":"Water Resources Management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":56,"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; Centre for International Governance Innovation; University of Waterloo","funders":"National Development and Reform Commission","keywords":"China; Central government; Conflict resolution; Population; Government (linguistics); Local government; Conflict analysis; Hydrogeology; Operations research; Environmental planning; Environmental resource management; Computer science; Geography; Political science; Environmental science; Engineering; Public administration; Sociology; Law","score_opus":0.03028465346815418,"score_gpt":0.30653995068130035,"score_spread":0.2762552972131462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051806646","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.8654223,0.0000063739963,0.0017916596,0.005659759,0.00006070442,0.00028467824,0.0000015359547,0.000044655175,0.12672836],"genre_scores_gemma":[0.98269874,0.0000025735171,0.000164745,0.00039696152,0.000055328237,0.00003918853,0.0000046811488,0.000009121746,0.016628686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977504,0.00031495315,0.0003240757,0.0005548605,0.00067607156,0.00037966605],"domain_scores_gemma":[0.9991353,0.000086678374,0.00003694444,0.00060225365,0.000044438573,0.000094352596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002167874,0.00014024414,0.00019436005,0.00034804994,0.00020050144,0.0001914658,0.0007832012,0.000036216836,0.0007787441],"category_scores_gemma":[0.000045337078,0.00007157216,0.00008012621,0.00020196423,0.00014209091,0.00011919141,0.00074743805,0.00014764328,0.002984823],"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.0008445971,0.001153662,0.008947505,0.000057525496,0.0001741277,0.00017421266,0.26570112,0.0053667324,0.0074685724,0.63363147,0.005762524,0.07071795],"study_design_scores_gemma":[0.00073832547,0.000070080336,0.017830504,0.000014400177,0.000014026548,0.000002657642,0.0031719196,0.00093948946,0.0040346705,0.27807623,0.6949102,0.00019748238],"about_ca_topic_score_codex":0.000067974746,"about_ca_topic_score_gemma":0.0000137935585,"teacher_disagreement_score":0.68914765,"about_ca_system_score_codex":0.0000499807,"about_ca_system_score_gemma":7.4731145e-7,"threshold_uncertainty_score":0.99779147},"labels":[],"label_agreement":null},{"id":"W2052441488","doi":"10.1007/s11238-005-2459-x","title":"Policy Stable States in the Graph Model for Conflict Resolution","year":2004,"lang":"en","type":"article","venue":"Theory and Decision","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":26,"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 Waterloo; Wilfrid Laurier University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Conflict resolution; Policy analysis; Mathematical economics; Computer science; Stability (learning theory); State (computer science); Action plan; Operations research; Microeconomics; Economics; Mathematics; Political science; Theoretical computer science; Public administration; Algorithm; Law","score_opus":0.10500785286603376,"score_gpt":0.41043910553120244,"score_spread":0.3054312526651687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052441488","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.45433477,0.00014449916,0.54336494,0.00076176453,0.000019774523,0.00028402172,0.000032714852,0.000014319156,0.0010431908],"genre_scores_gemma":[0.99524707,0.00009329692,0.003228287,0.0009195208,0.000042947893,0.00006727692,0.000006396456,0.000006878799,0.00038831617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983919,0.00023071047,0.00040025162,0.0003288737,0.0004158498,0.0002323814],"domain_scores_gemma":[0.9938782,0.0053174803,0.00009667839,0.0005431868,0.00010356341,0.000060902763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010453807,0.00010893161,0.00016475767,0.00027633965,0.00035397548,0.00016378876,0.00052087754,0.00006247319,0.000018297362],"category_scores_gemma":[0.0017584092,0.00006211303,0.00006794807,0.0007094647,0.00019103287,0.00024962449,0.000067493056,0.000101434925,0.000043488002],"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.0004702569,0.00005346273,0.000013012709,0.0000010373551,0.00000163501,4.258297e-7,0.0027158007,0.03517611,0.00022702756,0.9338288,0.00027948813,0.027233],"study_design_scores_gemma":[0.0006890739,0.000055820004,0.00047129433,0.000012730955,0.000004899192,0.000006158114,0.001717177,0.01220481,0.00019422981,0.9827035,0.0018590069,0.00008130956],"about_ca_topic_score_codex":0.00001953272,"about_ca_topic_score_gemma":0.000035879235,"teacher_disagreement_score":0.54091233,"about_ca_system_score_codex":0.000019220071,"about_ca_system_score_gemma":0.0000632928,"threshold_uncertainty_score":0.36231017},"labels":[],"label_agreement":null},{"id":"W2054476895","doi":"10.1007/s11238-009-9134-6","title":"Combining strength and uncertainty for preferences in the graph model for conflict resolution with multiple decision makers","year":2009,"lang":"en","type":"article","venue":"Theory and Decision","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":55,"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; University of Waterloo","funders":"","keywords":"Preference; Status quo; Stability (learning theory); Computer science; Conflict resolution; Mathematical optimization; Management science; Operations research; Artificial intelligence; Microeconomics; Mathematics; Economics; Machine learning; Political science","score_opus":0.0964554859682428,"score_gpt":0.37250009136491175,"score_spread":0.276044605396669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054476895","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.57054657,0.0001599825,0.42830133,0.00014462047,0.000018215283,0.00060272025,0.000034796078,0.000013444222,0.0001783552],"genre_scores_gemma":[0.98387563,0.000060063885,0.015519975,0.0003391201,0.00002031292,0.00010424947,0.000011413437,0.0000066145167,0.00006262951],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980699,0.00023392067,0.00047082256,0.0005254313,0.00045164736,0.0002482794],"domain_scores_gemma":[0.977971,0.021171348,0.00016569841,0.00045468318,0.00015806245,0.00007918899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008253896,0.00017396898,0.0002705085,0.00020351584,0.0005242083,0.00022156406,0.00043019294,0.00009368969,0.0000068429767],"category_scores_gemma":[0.0022713111,0.000092373404,0.0000625107,0.00038480468,0.0002218839,0.0002568412,0.00004159025,0.00012007294,0.000001909862],"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.007780202,0.00012157296,0.00031667136,0.0000030515912,0.0000057209286,4.726201e-7,0.0029392815,0.0126945935,0.00020125267,0.45651484,0.00037327036,0.5190491],"study_design_scores_gemma":[0.00179476,0.00041204318,0.003553537,0.000052122556,0.000015857677,0.000005864615,0.0026250551,0.16522373,0.000058983624,0.82547814,0.0006597779,0.00012015266],"about_ca_topic_score_codex":0.0000036240922,"about_ca_topic_score_gemma":0.00007971173,"teacher_disagreement_score":0.51892895,"about_ca_system_score_codex":0.000009918321,"about_ca_system_score_gemma":0.000029963301,"threshold_uncertainty_score":0.40318394},"labels":[],"label_agreement":null},{"id":"W2054588692","doi":"10.4284/0038-4038-2012.137","title":"Waiting for Signaling Quality","year":2013,"lang":"en","type":"article","venue":"Southern Economic Journal","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":"University of Manitoba","funders":"","keywords":"Pooling; Quality (philosophy); Signalling; Incentive; Microeconomics; Product (mathematics); Signaling game; Business; Economics; Industrial organization; Computer science; Mathematics; Artificial intelligence","score_opus":0.19837652386697247,"score_gpt":0.4210058320344304,"score_spread":0.22262930816745796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054588692","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.9765153,0.000020613832,0.018497694,0.0014578352,0.0002270069,0.0001645843,0.000032443695,0.000015727577,0.0030688248],"genre_scores_gemma":[0.99490315,5.818114e-7,0.0013776441,0.00019284386,0.00053446466,0.000024159852,7.7911403e-7,0.000010286361,0.0029560856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986244,0.00012728294,0.00070612034,0.00019259355,0.00012767522,0.00022193241],"domain_scores_gemma":[0.9978502,0.0012003278,0.0004609326,0.00023881203,0.00012194362,0.00012780685],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0047127632,0.00007774968,0.0001742849,0.00007062748,0.0003720004,0.00054342387,0.00052384665,0.000038070808,0.005147708],"category_scores_gemma":[0.0005174875,0.0000581622,0.00017547706,0.000041406118,0.000052284104,0.00025600064,0.000033806795,0.00013319573,0.008973494],"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.00011143577,0.00014077498,0.035150733,0.000010705947,0.00020992778,0.0000016510838,0.016843425,0.012416844,0.033544693,0.25254065,0.020897472,0.6281317],"study_design_scores_gemma":[0.00035263068,0.00001587935,0.00075755833,0.0000047216804,0.000005850859,0.000031306576,0.016490102,0.004644423,0.000568033,0.9675436,0.009454988,0.00013088169],"about_ca_topic_score_codex":0.000021567943,"about_ca_topic_score_gemma":0.000007011091,"teacher_disagreement_score":0.71500295,"about_ca_system_score_codex":0.00003401239,"about_ca_system_score_gemma":0.000059974904,"threshold_uncertainty_score":0.9957617},"labels":[],"label_agreement":null},{"id":"W2057129345","doi":"10.1142/s0219198905000648","title":"BECKMANN'S EDGEWORTH-BERTRAND DUOPOLY EXAMPLE REVISITED","year":2005,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"","keywords":"Economics; Duopoly; Bertrand competition; Microeconomics; Order (exchange); Limit price; Market price; Price level; Mathematical economics; Oligopoly; Monetary economics; Cournot competition","score_opus":0.11683686818367628,"score_gpt":0.4165286835842396,"score_spread":0.29969181540056333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057129345","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025572598,0.1809291,0.048908036,0.05765635,0.0012936073,0.0023755117,0.00026091465,0.0005019716,0.6825019],"genre_scores_gemma":[0.89307916,0.01813592,0.0012745094,0.016596658,0.0010504328,0.00017949005,0.00007875909,0.00004173141,0.06956334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99629784,0.00062948815,0.0010855489,0.00061887427,0.0011046847,0.00026356778],"domain_scores_gemma":[0.995949,0.0019251548,0.00041491134,0.001016746,0.00052546145,0.0001687372],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006882099,0.00023067457,0.00047396237,0.00019894494,0.00011024104,0.0001827138,0.0018081854,0.00007303111,0.018845115],"category_scores_gemma":[0.0026781447,0.0001703636,0.0003269977,0.00067034457,0.00019626365,0.00045110277,0.00017181793,0.00025787792,0.0106197735],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036584046,0.0000923971,0.00010692317,0.000032161603,0.00004745811,0.0000031043726,0.0001364773,0.000020822523,0.00013835906,0.543107,0.02561826,0.43066046],"study_design_scores_gemma":[0.00018652603,0.000014064405,0.00052385085,0.00045117977,0.00003629272,0.0000430588,0.000024707973,0.000059101367,0.0001671068,0.18564242,0.8126824,0.00016927344],"about_ca_topic_score_codex":0.0000048723473,"about_ca_topic_score_gemma":0.00000792193,"teacher_disagreement_score":0.86750656,"about_ca_system_score_codex":0.000057536912,"about_ca_system_score_gemma":0.00004623328,"threshold_uncertainty_score":0.9901506},"labels":[],"label_agreement":null},{"id":"W2057195120","doi":"10.1016/j.dam.2006.07.006","title":"Automorphisms and blocking in simple games","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Generalitat de Catalunya; European Regional Development Fund; Royal Canadian Geographical Society","keywords":"Mathematics; Simple (philosophy); Automorphism; Blocking (statistics); Combinatorics; Discrete mathematics; Arithmetic; Statistics","score_opus":0.043183217795595245,"score_gpt":0.33286524075159857,"score_spread":0.2896820229560033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057195120","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.8999288,0.000046643738,0.030644394,0.00026983555,0.000017039974,0.00032385404,0.000014979873,0.00007400265,0.068680435],"genre_scores_gemma":[0.9848559,0.0000033554998,0.0143889645,0.000066758264,0.000034151926,0.000058681304,0.0000066592693,0.000013840285,0.00057168223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844444,0.000019684501,0.0005532115,0.00030954165,0.0004495072,0.00022363596],"domain_scores_gemma":[0.99849737,0.00076300395,0.00017600521,0.00047970543,0.00003284867,0.000051043946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076309,0.00013468368,0.00026800545,0.00014162558,0.00010410752,0.00015691083,0.00033564866,0.00005828212,0.00011006425],"category_scores_gemma":[0.0001270771,0.00010249611,0.000038427803,0.00045885873,0.00014229311,0.00007427841,0.00012426844,0.00010165516,0.00015178027],"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.0000038238027,0.00006634383,0.00046265466,0.000009368337,0.0000027785813,0.000002021848,0.0007630989,0.00022331404,0.007111333,0.985513,0.0010645222,0.004777752],"study_design_scores_gemma":[0.00023425362,0.000006228731,0.0022646764,0.000008598981,0.000007924702,0.000005821797,0.0014376038,0.004680345,0.0033171352,0.98304844,0.0048430534,0.00014593916],"about_ca_topic_score_codex":0.000012840773,"about_ca_topic_score_gemma":0.000035266778,"teacher_disagreement_score":0.0849271,"about_ca_system_score_codex":0.0000130159115,"about_ca_system_score_gemma":0.000013564113,"threshold_uncertainty_score":0.417967},"labels":[],"label_agreement":null},{"id":"W2058744153","doi":"10.1007/s00199-010-0580-8","title":"Equilibrium existence and approximation of regular discontinuous games","year":2010,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":28,"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":"","keywords":"Mathematical economics; Sequence (biology); Stochastic game; Simple (philosophy); Mathematics; Space (punctuation); Equilibrium selection; Applied mathematics; Computer science; Repeated game; Game theory","score_opus":0.0325930183371092,"score_gpt":0.31853251156663065,"score_spread":0.28593949322952145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058744153","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.97686225,0.000047888196,0.0020037226,0.0002643696,0.00018138583,0.00011862063,0.000019406845,0.000019936057,0.02048239],"genre_scores_gemma":[0.9948385,0.0000021636313,0.0015651467,0.000029874953,0.00006701915,0.00001278913,0.0000018159197,0.0000062488202,0.0034764837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904716,0.00010725853,0.00037444694,0.00027776277,0.00008589177,0.000107492946],"domain_scores_gemma":[0.9982197,0.0008561069,0.00023501746,0.0006038714,0.000029881176,0.000055370125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886605,0.00007543798,0.00018027987,0.000077172896,0.000040690957,0.00006934268,0.00040647687,0.0000479621,0.00062797545],"category_scores_gemma":[0.0004330357,0.000059824422,0.0000505833,0.00005784435,0.00041920965,0.0002678543,0.00010315184,0.000088062945,0.00021613576],"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.000020482948,0.000012508107,0.0003809932,0.0000021157987,0.0000042089905,1.18403726e-7,0.00038855436,0.000009408449,0.027599946,0.93878955,0.00013955709,0.032652553],"study_design_scores_gemma":[0.00012009219,0.00001398844,0.0050085913,0.0000031098,0.0000052607747,0.000008562064,0.0007375972,0.000484091,0.014772379,0.975117,0.003654212,0.00007509892],"about_ca_topic_score_codex":0.000002962621,"about_ca_topic_score_gemma":0.0000070385486,"teacher_disagreement_score":0.036327463,"about_ca_system_score_codex":0.0000055589585,"about_ca_system_score_gemma":0.000021929056,"threshold_uncertainty_score":0.6875891},"labels":[],"label_agreement":null},{"id":"W2060304835","doi":"10.1007/s11518-008-5070-1","title":"Interrelationships among noncooperative and coalition stability concepts","year":2008,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":83,"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 Waterloo","funders":"","keywords":"Stability (learning theory); Mathematical economics; Nash equilibrium; Graph; Dilemma; Mathematics; Computer science; Theoretical computer science","score_opus":0.14219089402682014,"score_gpt":0.3543918697731231,"score_spread":0.21220097574630295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060304835","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.9700922,0.0006859716,0.027944503,0.000056612942,0.000618176,0.00020135661,0.0000045715065,0.0000118565795,0.00038479664],"genre_scores_gemma":[0.99961305,0.000021283135,0.00011263842,0.0000043570994,0.00013061523,0.000008620035,1.3085064e-7,0.0000042898514,0.00010500343],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745977,0.00016156434,0.00090686243,0.00023202144,0.0010666134,0.00017314067],"domain_scores_gemma":[0.997146,0.0007678712,0.0004377395,0.00021520726,0.0012091763,0.00022400904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009451439,0.000106987194,0.00033596277,0.00033598533,0.00039507108,0.00036504352,0.000324068,0.000049023274,0.000003982959],"category_scores_gemma":[0.0021741579,0.00007376057,0.000033702283,0.0007729404,0.00056331075,0.001342918,0.000055135588,0.00018563961,0.0000051511634],"study_design_candidate":"observational","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.000070781396,0.00018654476,0.5076888,0.00031861046,0.000114728144,0.00011091479,0.058507625,0.117879875,0.15223643,0.15939972,0.0019514638,0.0015344934],"study_design_scores_gemma":[0.0014695909,0.0005500623,0.3774173,0.0011901263,0.00004720913,0.0069135665,0.06784694,0.53389555,0.0025164497,0.0006381279,0.006734327,0.0007807591],"about_ca_topic_score_codex":0.00002653468,"about_ca_topic_score_gemma":0.0000017307586,"teacher_disagreement_score":0.41601565,"about_ca_system_score_codex":0.000083853025,"about_ca_system_score_gemma":0.00014105382,"threshold_uncertainty_score":0.35201234},"labels":[],"label_agreement":null},{"id":"W2061228493","doi":"10.1073/pnas.082249599","title":"Structure theorems for game trees","year":2002,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":30,"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":"Counterexample; Mathematics; Nash equilibrium; Game tree; Best response; Path (computing); Space (punctuation); Extensive-form game; Lawrence Kohlberg's stages of moral development; Graph; Normal-form game; Combinatorics; Discrete mathematics; Mathematical economics; Repeated game; Game theory; Computer science","score_opus":0.16826067191348698,"score_gpt":0.3960241226933662,"score_spread":0.2277634507798792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061228493","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.9665557,0.00011433239,0.000027060241,0.010356824,0.000028273047,0.00033302017,0.000096967575,0.000013830617,0.022473952],"genre_scores_gemma":[0.99668777,0.0000056907916,0.0015038924,0.000307397,0.00008593064,0.000014071204,4.64389e-8,0.0000027322928,0.0013924518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973922,0.000009562259,0.00044051348,0.0002925037,0.0017233661,0.0001418696],"domain_scores_gemma":[0.99792707,0.0009548651,0.000561439,0.000016115633,0.0005056123,0.00003492436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027854089,0.000081661536,0.00015952445,0.00017948814,0.00025760973,0.000065404456,0.0020289505,0.00006797588,0.00024311457],"category_scores_gemma":[0.00318956,0.000043544605,0.00012119699,0.0012866817,0.0012557114,0.00043713595,0.00011044498,0.00009831548,0.0000071358922],"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.0000071749405,0.000027669887,0.0010137795,0.0000051823436,0.000005131242,3.0727104e-10,0.0003406954,0.00014527464,0.14419456,0.84618574,0.004822309,0.003252512],"study_design_scores_gemma":[0.00009949194,0.000024618092,0.010714749,0.000011528394,0.000005213937,0.0000030263923,0.00026872288,0.002889012,0.11905351,0.86371595,0.0031625165,0.000051638024],"about_ca_topic_score_codex":4.8186524e-7,"about_ca_topic_score_gemma":5.663383e-8,"teacher_disagreement_score":0.030132046,"about_ca_system_score_codex":0.000010806308,"about_ca_system_score_gemma":0.000009132438,"threshold_uncertainty_score":0.4626721},"labels":[],"label_agreement":null},{"id":"W2061499312","doi":"10.1145/1978721.1978730","title":"The lemonade stand game competition","year":2011,"lang":"en","type":"article","venue":"ACM SIGecom Exchanges","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Competition (biology); Dilemma; Prisoner's dilemma; Computer science; Advertising; Operations research; Business; Engineering; Philosophy; Epistemology; Ecology","score_opus":0.32901957693058853,"score_gpt":0.3890606669279014,"score_spread":0.06004108999731289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061499312","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.8352837,0.00245206,0.007388006,0.017621793,0.00092259474,0.00066908816,0.00007350135,0.0002385465,0.13535069],"genre_scores_gemma":[0.9923629,0.00016496851,0.00047521846,0.00026999658,0.00011236667,0.000053628155,0.0000023732448,0.000008903389,0.006549617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860156,0.00018849506,0.00027130768,0.00026972106,0.0004376867,0.00023123006],"domain_scores_gemma":[0.9964629,0.0019956264,0.0001399132,0.0011879028,0.00013108313,0.000082582395],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016956001,0.0001008145,0.00012615962,0.0000659645,0.00039092868,0.0001394028,0.0014300536,0.000046461006,0.0017173556],"category_scores_gemma":[0.0010475906,0.000059134698,0.00006331426,0.0003149491,0.00022530693,0.00015397857,0.00023773753,0.00010474344,0.0015971009],"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.00010787619,0.00016596484,0.0038030564,0.000005409175,0.00003444617,0.000007150844,0.011192832,0.0000042257325,0.0020642716,0.67231095,0.04018872,0.2701151],"study_design_scores_gemma":[0.00010561056,0.000043545384,0.022659985,0.0000048992597,0.0000058464298,0.0000046344844,0.002329513,0.000021585005,0.0024619706,0.5997531,0.37251592,0.000093413284],"about_ca_topic_score_codex":0.0000184703,"about_ca_topic_score_gemma":0.00016546063,"teacher_disagreement_score":0.3323272,"about_ca_system_score_codex":0.000013601208,"about_ca_system_score_gemma":0.000020507328,"threshold_uncertainty_score":0.9991952},"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":"W2062134357","doi":"10.1006/jeth.2000.2655","title":"Switching Costs in Frequently Repeated Games","year":2000,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":63,"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":"Subgame perfect equilibrium; Stackelberg competition; Microeconomics; Incentive; Repeated game; Dominance (genetics); Economics; Dilemma; Stochastic game; Pareto principle; Strategic dominance; Coordination game; Game theory; Operations management; Mathematics","score_opus":0.04586147009671491,"score_gpt":0.35934501277050906,"score_spread":0.31348354267379414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062134357","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.95684993,0.0001817376,0.0003349075,0.0005229619,0.00016261455,0.000054075186,0.0000033106935,0.0000067065084,0.041883767],"genre_scores_gemma":[0.9965711,0.000046498793,0.00020831164,0.00025070764,0.000131853,0.0000014787231,2.2906106e-7,0.0000073275332,0.0027824766],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814975,0.0003638774,0.0010239037,0.00016667975,0.00014589634,0.00014991718],"domain_scores_gemma":[0.9976783,0.0013632958,0.0004835427,0.00033630346,0.00004593237,0.00009267036],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0073531047,0.00008570507,0.00028015196,0.00026059957,0.00005553573,0.000106970634,0.00066527154,0.000047821693,0.0071235443],"category_scores_gemma":[0.0004184615,0.0000642219,0.00013694291,0.00013618395,0.00005661844,0.00042522023,0.000022163882,0.00022744799,0.0010787515],"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.0004364267,0.00012634299,0.0073369564,0.000001329017,0.000045763416,0.000043024425,0.0016782598,0.007632129,0.003157177,0.30116245,0.0023699917,0.67601013],"study_design_scores_gemma":[0.0005414354,0.000042558542,0.009084532,0.000029473045,0.000007885666,0.00013658525,0.0010018079,0.0002529938,0.000785416,0.9736757,0.014341851,0.000099763965],"about_ca_topic_score_codex":0.000008465686,"about_ca_topic_score_gemma":0.000019197569,"teacher_disagreement_score":0.6759104,"about_ca_system_score_codex":0.0001354339,"about_ca_system_score_gemma":0.00008613579,"threshold_uncertainty_score":0.999699},"labels":[],"label_agreement":null},{"id":"W2062515972","doi":"10.1007/s10726-010-9188-4","title":"Matrix Representation of Conflict Resolution in Multiple-Decision-Maker Graph Models with Preference Uncertainty","year":2010,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":42,"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 Waterloo; Wilfrid Laurier University","funders":"","keywords":"Preference; Graph; Matrix representation; Extension (predicate logic); Computer science; Representation (politics); Decision maker; Coding (social sciences); Stability (learning theory); Theoretical computer science; Mathematics; Mathematical optimization; Machine learning; Operations research","score_opus":0.10734779349256454,"score_gpt":0.3661427879976759,"score_spread":0.25879499450511134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062515972","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.7291547,0.00004534435,0.26968756,0.0001177462,0.00012553082,0.00041134123,0.000019481266,0.000026746351,0.00041155584],"genre_scores_gemma":[0.9839085,0.00007432019,0.015766865,0.000045852514,0.000033668985,0.000047193553,0.000024695775,0.000012339984,0.00008656195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670184,0.00020326744,0.0009898377,0.00070599234,0.0011771398,0.00022193679],"domain_scores_gemma":[0.99356884,0.004524837,0.00048472756,0.00083670043,0.0004538771,0.0001310203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023145918,0.00018729955,0.00035682038,0.0006220045,0.00018866397,0.00013778717,0.0004140153,0.00018197612,0.00015050654],"category_scores_gemma":[0.0023938431,0.00013356036,0.00007904279,0.0016080289,0.00021161229,0.0008388275,0.00010683097,0.0002873062,0.000037221147],"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.0041173077,0.0006225167,0.06387081,0.000013647177,0.000025579544,0.0000063217167,0.0037032487,0.07933687,0.045184065,0.22905496,0.0010307977,0.57303387],"study_design_scores_gemma":[0.0021862756,0.00016101528,0.2433952,0.00007664446,0.000017212054,0.000017971064,0.0009366708,0.19799693,0.0010255586,0.55306464,0.0008729156,0.00024894235],"about_ca_topic_score_codex":0.00016163934,"about_ca_topic_score_gemma":0.0014636343,"teacher_disagreement_score":0.57278496,"about_ca_system_score_codex":0.000021134263,"about_ca_system_score_gemma":0.000039425762,"threshold_uncertainty_score":0.54464334},"labels":[],"label_agreement":null},{"id":"W2064303153","doi":"10.1177/0022343310396265","title":"100 Horsemen and the empty city: A game theoretic examination of deception in Chinese military legend","year":2011,"lang":"en","type":"article","venue":"Journal of Peace Research","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":"Queen's University","funders":"","keywords":"Adversary; Legend; Battle; Deception; Game theory; Mathematical economics; History; Computer security; Political science; Law; Economics; Computer science; Ancient history","score_opus":0.28326502757187516,"score_gpt":0.4767697036163691,"score_spread":0.19350467604449395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064303153","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.9919585,0.0010616961,0.0005288431,0.00081713835,0.000029458408,0.00019287762,0.0000021620363,0.0000015622031,0.0054077553],"genre_scores_gemma":[0.99874,0.0005530762,0.00018177257,0.000009419102,0.00005160367,0.0000069870716,2.3382825e-7,0.0000041535386,0.0004527583],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99557406,0.002147781,0.00063415774,0.0001448995,0.001326559,0.00017255673],"domain_scores_gemma":[0.9961525,0.002521982,0.00021959929,0.0003169602,0.00071086467,0.00007805374],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.038363747,0.00006390143,0.00022176423,0.0005738739,0.00008994378,0.000031427488,0.00062396284,0.000047077978,0.0004538763],"category_scores_gemma":[0.0031432179,0.000032707983,0.00007277555,0.0009974067,0.0008269914,0.00027770238,0.00013385837,0.0004132246,0.000017346118],"study_design_candidate":"observational","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.0057089785,0.0017982668,0.12196758,0.000091549984,0.0001280879,0.00006139989,0.23838231,0.00017277847,0.025805993,0.28084365,0.0027779965,0.32226142],"study_design_scores_gemma":[0.0010291432,0.00022271121,0.6004026,0.00003589037,0.00000721498,0.0000404204,0.009231295,0.0006559787,0.00077273493,0.38728046,0.00027361218,0.00004793307],"about_ca_topic_score_codex":0.0000629439,"about_ca_topic_score_gemma":0.00008250124,"teacher_disagreement_score":0.478435,"about_ca_system_score_codex":0.00003242376,"about_ca_system_score_gemma":0.000076021744,"threshold_uncertainty_score":0.9902069},"labels":[],"label_agreement":null},{"id":"W2066370008","doi":"10.1016/j.apm.2012.03.009","title":"Theory and application of conflict resolution with hybrid preference in colored graphs","year":2012,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"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 Waterloo; Wilfrid Laurier University; University of Guelph","funders":"","keywords":"Preference; Colored; Algebraic number; Stability (learning theory); Computer science; Mathematics; Mathematical optimization; Graph; Theoretical computer science; Artificial intelligence; Machine learning; Statistics; Materials science","score_opus":0.11661874846894192,"score_gpt":0.3295148791005811,"score_spread":0.21289613063163915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066370008","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.41230348,0.000041826854,0.58190936,0.000020314577,0.0000031792483,0.00034483563,0.0000027662568,0.0000162471,0.005358007],"genre_scores_gemma":[0.97875446,0.000009263808,0.020944962,0.000026833171,0.000011266724,0.00020376117,0.0000028460502,0.000010209664,0.000036378005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843144,0.00010095033,0.000528721,0.0002825264,0.00041811608,0.00023823309],"domain_scores_gemma":[0.997231,0.0019570186,0.0002036191,0.00043560902,0.000069937094,0.00010281314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003558663,0.00012211558,0.0002863254,0.00013874777,0.00007230427,0.00002742716,0.00025120378,0.000054756016,0.000032366042],"category_scores_gemma":[0.00011889731,0.00008538233,0.000026084073,0.00038584773,0.00027099956,0.0001455565,0.000059142916,0.0001248592,0.000054491855],"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.0001273123,0.00012497768,0.00013633887,0.000018537952,0.0000049059827,6.212901e-8,0.0010271957,0.005569682,0.0018502406,0.98803717,0.0000038748904,0.0030996767],"study_design_scores_gemma":[0.00022259919,0.00001790488,0.00019465155,0.000019064068,0.000015411113,0.0000042379424,0.00055449543,0.09306898,0.0036860462,0.90202856,0.00008914464,0.00009889995],"about_ca_topic_score_codex":0.0000027846,"about_ca_topic_score_gemma":8.590976e-7,"teacher_disagreement_score":0.566451,"about_ca_system_score_codex":0.000011640348,"about_ca_system_score_gemma":0.000013021845,"threshold_uncertainty_score":0.34817904},"labels":[],"label_agreement":null},{"id":"W2069930327","doi":"10.1109/tcss.2014.2377891","title":"Online Reputation and Polling Systems: Data Incest, Social Learning, and Revealed Preferences","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polling; Computer science; Overconfidence effect; Polling system; Parsing; Social learning; Reputation; Machine learning; Artificial intelligence; Social psychology; Psychology; Knowledge management","score_opus":0.15706332320321661,"score_gpt":0.398888945202926,"score_spread":0.2418256219997094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069930327","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.30325046,0.00011739896,0.69438696,0.00062258303,0.0004215867,0.00035882762,0.0002784485,0.00010261626,0.00046113183],"genre_scores_gemma":[0.9982596,0.0000130664985,0.00047049945,0.00004399344,0.00043375892,0.000042199517,0.00008379446,0.00001536497,0.0006377138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660057,0.00096408464,0.0007193568,0.00063868175,0.00088598666,0.00019132983],"domain_scores_gemma":[0.9970006,0.0019854326,0.0004203816,0.00018057626,0.0003163549,0.00009665717],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023392309,0.0001796605,0.0003639984,0.00019232265,0.0015910509,0.0005373606,0.0003671374,0.0001390467,0.000017303666],"category_scores_gemma":[0.00013060012,0.00016141299,0.00004775577,0.00047461854,0.00022715598,0.0003850693,0.000010914068,0.00027892366,0.00003266916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002729652,0.0008942844,0.0018824777,0.00026218206,0.00035183437,0.0000031581167,0.012578039,0.58337617,0.0003720718,0.12067792,0.0019792097,0.2773497],"study_design_scores_gemma":[0.0013051792,0.00022426086,0.014225312,0.00011302908,0.00012945966,0.000045974866,0.011243976,0.9138526,0.000010398648,0.04266179,0.015569668,0.0006183649],"about_ca_topic_score_codex":0.00019195012,"about_ca_topic_score_gemma":0.00005738985,"teacher_disagreement_score":0.6950092,"about_ca_system_score_codex":0.000040588926,"about_ca_system_score_gemma":0.00006630245,"threshold_uncertainty_score":0.9997088},"labels":[],"label_agreement":null},{"id":"W2070060452","doi":"10.1016/j.artint.2007.02.005","title":"A hierarchy of prescriptive goals for multiagent learning","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Alberta","funders":"","keywords":"Regret; Hierarchy; Computer science; Adversary; Multi-agent system; Mathematical optimization; Minification; Artificial intelligence; Mathematics; Machine learning; Economics; Computer security","score_opus":0.3355190226677535,"score_gpt":0.4874850102189569,"score_spread":0.15196598755120339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070060452","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.2896335,0.000032022355,0.7075385,0.00017909282,0.0001245391,0.00030730106,0.000008513156,0.000022552085,0.0021539973],"genre_scores_gemma":[0.9924872,0.0000027133399,0.006201555,0.000057154437,0.000078779696,0.000028779601,0.0000017688848,0.000007125675,0.001134916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981508,0.000092304166,0.0007636056,0.0003270596,0.00041585963,0.00025035167],"domain_scores_gemma":[0.9956357,0.0032624213,0.00024382478,0.00032900172,0.00044158747,0.0000874877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046134945,0.0000882699,0.00017691702,0.00015913465,0.00018016744,0.000051884548,0.0005213873,0.000050463725,0.0002856359],"category_scores_gemma":[0.00457586,0.00007188604,0.000120826095,0.0005728393,0.00023224483,0.00012554102,0.00007080656,0.00011121523,0.00032829805],"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.00016097323,0.00011584848,0.0003798169,0.000003059658,0.000008929238,8.1693804e-7,0.0028807751,0.0019147025,0.052218124,0.5172825,0.00013693079,0.42489752],"study_design_scores_gemma":[0.000014946966,0.000108119246,0.0004718765,0.000007178317,0.000005988984,7.6273267e-7,0.0037441344,0.00491879,0.49749514,0.48089382,0.012258588,0.000080651604],"about_ca_topic_score_codex":0.000029732315,"about_ca_topic_score_gemma":0.000058108984,"teacher_disagreement_score":0.7028537,"about_ca_system_score_codex":0.000015045865,"about_ca_system_score_gemma":0.000028037466,"threshold_uncertainty_score":0.54780626},"labels":[],"label_agreement":null},{"id":"W2071710911","doi":"10.1017/s026988891300009x","title":"Repeated games for multiagent systems: a survey","year":2013,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Formalism (music); Bounded function; Term (time); Artificial intelligence; Game theory; Repeated game; Economic model; Resource (disambiguation); Management science; Mathematical economics; Microeconomics; Mathematics; Economics","score_opus":0.1589873241313356,"score_gpt":0.3961363390141021,"score_spread":0.23714901488276652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071710911","genre_codex":"review","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.034416687,0.76739144,0.17592414,0.0035933766,0.0020186084,0.011661224,0.00012476403,0.00065032736,0.0042194338],"genre_scores_gemma":[0.9728511,0.00612891,0.00073418615,0.00018718335,0.00024405014,0.0036106275,0.00002616353,0.000051675,0.016166085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984034,0.0002852463,0.00060225895,0.00027766134,0.00021098362,0.00022050418],"domain_scores_gemma":[0.9945163,0.0037641898,0.00013739306,0.0009878326,0.0005029315,0.00009133947],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0063206395,0.00014938929,0.00037496092,0.000055956803,0.00010455355,0.00012778607,0.00084630895,0.000033755357,0.00026382727],"category_scores_gemma":[0.006212329,0.00008092391,0.00013538207,0.00068058353,0.00003298021,0.00009394398,0.00008352049,0.00009592304,0.003204189],"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.000013439992,0.00029828554,0.00038371276,0.0046639,0.0002192427,9.336269e-7,0.0013449048,0.0046681752,0.0020346958,0.05295734,0.5576212,0.3757942],"study_design_scores_gemma":[0.0001984987,0.00002965964,0.007876051,0.0017923388,0.000059579128,0.00001207617,0.000056922017,0.06157907,0.00010687221,0.0014561776,0.92652345,0.00030930666],"about_ca_topic_score_codex":0.000020319434,"about_ca_topic_score_gemma":0.000004719964,"teacher_disagreement_score":0.9384344,"about_ca_system_score_codex":0.000023176824,"about_ca_system_score_gemma":0.000023248307,"threshold_uncertainty_score":0.99757195},"labels":[],"label_agreement":null},{"id":"W2071854813","doi":"10.1007/s13235-012-0039-6","title":"Preface: Second DGAA Special Issue on Evolutionary Games","year":2012,"lang":"en","type":"article","venue":"Dynamic Games and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematical economics; Computer science; Economics","score_opus":0.027603658179769765,"score_gpt":0.34335310702414396,"score_spread":0.31574944884437417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071854813","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.5301807,0.002133426,0.025447126,0.008562955,0.00079613284,0.0027942017,0.0009867891,0.00036721668,0.42873147],"genre_scores_gemma":[0.9571955,0.00007012518,0.0010309785,0.00049597514,0.0022470562,0.00055757933,0.00004906725,0.000019424779,0.038334284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998162,0.00009176201,0.00044489218,0.00050096493,0.000430855,0.00036952787],"domain_scores_gemma":[0.9979834,0.00064832874,0.00018109195,0.0008287929,0.00010673105,0.000251649],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007009274,0.00019522918,0.0002321798,0.00016782792,0.00042822026,0.00012218389,0.0004967146,0.000103262486,0.003971081],"category_scores_gemma":[0.00010725407,0.00015840742,0.000094907016,0.0005552675,0.00028245576,0.00028163157,0.00013128063,0.0001936728,0.0032333378],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000277585,0.0005327486,0.0033794602,0.000012265797,0.000030571086,3.244685e-7,0.00097613235,0.0001014695,0.0008066988,0.48706707,0.07707846,0.429987],"study_design_scores_gemma":[0.00015023352,0.000024780265,0.054720324,0.000005359072,0.000014368057,0.000013081482,0.00076504966,0.0005691131,0.00006433045,0.07297389,0.87052,0.00017946617],"about_ca_topic_score_codex":0.000002683116,"about_ca_topic_score_gemma":0.000010537985,"teacher_disagreement_score":0.79344153,"about_ca_system_score_codex":0.00004182901,"about_ca_system_score_gemma":0.000031480988,"threshold_uncertainty_score":0.99754274},"labels":[],"label_agreement":null},{"id":"W2071889362","doi":"10.1007/s11238-013-9363-6","title":"Theory and implementation of coalitional analysis in cooperative decision making","year":2013,"lang":"en","type":"article","venue":"Theory and Decision","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"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 Waterloo; Wilfrid Laurier University; University of Guelph","funders":"","keywords":"Credibility; Transitive relation; Stability (learning theory); Algebraic number; Computer science; Conflict resolution; Mathematical economics; Graph; Range (aeronautics); Game theory; Mathematical optimization; Mathematics; Theoretical computer science; Combinatorics; Machine learning","score_opus":0.04309458511039922,"score_gpt":0.426392385656841,"score_spread":0.3832978005464418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071889362","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.77087986,0.00018770802,0.22797023,0.0000415518,0.000025751693,0.00024523807,0.000029052531,0.00000839268,0.00061219424],"genre_scores_gemma":[0.996928,0.000041059993,0.0027185634,0.00016535245,0.000015752914,0.000037121783,0.000008210922,0.0000061194974,0.00007983696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997055,0.0009472195,0.0007976537,0.0004585421,0.0005726463,0.00016894969],"domain_scores_gemma":[0.9812781,0.017746499,0.00023381569,0.00039242895,0.00026887632,0.000080268655],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010685907,0.00014213822,0.000366853,0.0006821979,0.00018874896,0.00015212392,0.0002631722,0.00007334924,0.003685487],"category_scores_gemma":[0.0015610481,0.00010013126,0.00008120187,0.0013365196,0.00026290637,0.000497054,0.00018220548,0.00010224881,0.00007684366],"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.00039712153,0.000037285285,0.008615874,0.0000013847688,0.000029061977,7.257851e-7,0.0010053029,0.00023782517,0.0007482786,0.6334837,0.00008102078,0.35536242],"study_design_scores_gemma":[0.0003869323,0.000046367477,0.22392294,0.000022389439,0.000040577514,0.000003792472,0.005692416,0.00043493556,0.0004071658,0.7689049,0.00005018602,0.00008739181],"about_ca_topic_score_codex":0.000017225397,"about_ca_topic_score_gemma":0.0000726473,"teacher_disagreement_score":0.35527503,"about_ca_system_score_codex":0.000015598709,"about_ca_system_score_gemma":0.000027060134,"threshold_uncertainty_score":0.9972253},"labels":[],"label_agreement":null},{"id":"W2074089254","doi":"10.1023/b:jota.0000026133.56615.cf","title":"Zero-Sum Stochastic Games with Partial Information","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":65,"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 Ottawa","funders":"","keywords":"Mathematics; Zero-sum game; Zero (linguistics); Theory of computation; Example of a game without a value; Mathematical economics; Space (punctuation); State (computer science); State space; Complete information; Mathematical optimization; Game theory; Repeated game; Combinatorial game theory; Computer science; Statistics; Algorithm","score_opus":0.020904524936494494,"score_gpt":0.3071967091041004,"score_spread":0.28629218416760593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074089254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010327405,0.00006609105,0.9872659,0.0009206442,0.00003414897,0.00027023087,0.000011001497,0.000019736237,0.0010848744],"genre_scores_gemma":[0.9782108,0.000028886428,0.021140616,0.00029742418,0.000104843275,0.000060167084,0.000008495413,0.000008011343,0.00014072888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842334,0.00012729519,0.0007196511,0.00013513879,0.00046936696,0.00012518738],"domain_scores_gemma":[0.9975559,0.0005935343,0.0007828707,0.000291368,0.00063288596,0.00014340361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021460988,0.000114198294,0.00019736745,0.0002583968,0.0003019989,0.0002292927,0.0003356407,0.00005507907,0.00013154172],"category_scores_gemma":[0.0004389373,0.000077163604,0.00005873074,0.00066261116,0.00021499135,0.0011649407,0.00003268041,0.00014859831,0.000054606757],"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.00009589277,0.000048935537,0.000018683244,0.0000016938711,0.000012055316,2.094424e-7,0.00031857193,0.5744827,0.000030266436,0.41854337,0.00004885148,0.0063987914],"study_design_scores_gemma":[0.0016273948,0.00023892746,0.00030399428,0.000047672125,0.00010285286,0.0002645916,0.002274515,0.0033421158,0.0006510087,0.9746274,0.016280463,0.00023908308],"about_ca_topic_score_codex":5.431846e-7,"about_ca_topic_score_gemma":3.2352716e-7,"teacher_disagreement_score":0.9678834,"about_ca_system_score_codex":0.000024677087,"about_ca_system_score_gemma":0.00011795313,"threshold_uncertainty_score":0.31466407},"labels":[],"label_agreement":null},{"id":"W2075488114","doi":"10.1007/s10107-006-0015-2","title":"Equilibria for networks with malicious users","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":30,"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":"Flow network; Routing (electronic design automation); Flow (mathematics); Mathematical optimization; Computer science; Social cost; Minimum-cost flow problem; Mathematics; Computer network; Economics; Microeconomics","score_opus":0.06679257091970953,"score_gpt":0.35932064478640446,"score_spread":0.29252807386669494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075488114","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.13265719,0.000023607841,0.8592287,0.0005636617,0.00002601495,0.0007085953,0.000002419537,0.00012903528,0.0066608223],"genre_scores_gemma":[0.8871397,9.331741e-8,0.1100576,0.00006465002,0.00012601109,0.00028095327,0.0000039936926,0.000019778548,0.002307268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.000046782206,0.00045848422,0.00032847762,0.00043842333,0.0003686711],"domain_scores_gemma":[0.99758935,0.0016051785,0.00013674331,0.00046399166,0.00011772911,0.00008701789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015395854,0.00012947632,0.00024053075,0.000057364236,0.00018122504,0.00033433942,0.00042286483,0.00006169682,0.0001413264],"category_scores_gemma":[0.00036981635,0.00008078326,0.00009899956,0.0004327833,0.000175981,0.000120266166,0.00005445885,0.00008372835,0.00016834732],"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.000052994063,0.0002281239,0.00039527705,0.000020278218,0.000012948565,0.0000029349183,0.00012250133,0.0013609903,0.00016619984,0.9302006,0.0018517233,0.06558548],"study_design_scores_gemma":[0.00036822655,0.00011558058,0.00015179231,0.000025887046,0.00003043125,0.00002128663,0.00030750295,0.048925214,0.00013706447,0.9141697,0.03555352,0.00019376873],"about_ca_topic_score_codex":0.0000031921963,"about_ca_topic_score_gemma":0.0000079217,"teacher_disagreement_score":0.75448245,"about_ca_system_score_codex":0.00001312981,"about_ca_system_score_gemma":0.0000138605565,"threshold_uncertainty_score":0.3294246},"labels":[],"label_agreement":null},{"id":"W2080876810","doi":"10.1016/j.jet.2012.11.002","title":"Large games with a bio-social typology","year":2013,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematical economics; Context (archaeology); Interval (graph theory); Matching (statistics); Space (punctuation); Mathematics; Type (biology); Typology; Strategy; Nash equilibrium; Sequence (biology); Game theory; Computer science; Combinatorics; Statistics; Sociology","score_opus":0.04301628117727971,"score_gpt":0.34370144842422556,"score_spread":0.30068516724694583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080876810","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.9751704,0.000064289765,0.0027207262,0.002311155,0.00018829828,0.00006802766,0.000006962116,0.0000061788464,0.019464007],"genre_scores_gemma":[0.9964155,0.000004630076,0.00026223503,0.0003931481,0.00030230742,0.00000416771,2.210575e-7,0.000006937776,0.0026108758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884415,0.0002416223,0.0005146514,0.0001249319,0.0001112852,0.000163386],"domain_scores_gemma":[0.99806136,0.00092828803,0.00060545636,0.00020054124,0.00012362529,0.0000807265],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029725034,0.000076678494,0.00025727742,0.0001657907,0.00011035455,0.00009523402,0.00054725376,0.000050950508,0.0074298196],"category_scores_gemma":[0.00019916751,0.0000468032,0.00010978761,0.000082412436,0.00014540821,0.00033133634,0.000045524273,0.00014552307,0.002232001],"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.00008949461,0.000051215553,0.0017951389,5.9602263e-7,0.00004591814,0.0000025552733,0.0009276165,0.000025969952,0.00034246748,0.9734558,0.014209662,0.009053583],"study_design_scores_gemma":[0.00045060876,0.00009207367,0.009850551,0.000003185155,0.000013979274,0.00010915603,0.005382117,0.000020258756,0.00023324683,0.9511703,0.032599725,0.00007476604],"about_ca_topic_score_codex":0.0000015583166,"about_ca_topic_score_gemma":0.000005948864,"teacher_disagreement_score":0.02228545,"about_ca_system_score_codex":0.0000333152,"about_ca_system_score_gemma":0.000087587134,"threshold_uncertainty_score":0.9985449},"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":"W2082720961","doi":"10.1142/s0219198907001692","title":"EVOLUTION AND THE COMPLEXITY OF FINITE AUTOMATA","year":2007,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Repeated game; Prisoner's dilemma; Mathematical economics; Automaton; Limit (mathematics); Finite-state machine; Dilemma; Measure (data warehouse); Mathematics; Game theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.16963203638993185,"score_gpt":0.4264736308364938,"score_spread":0.25684159444656196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082720961","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.04746587,0.075952925,0.53440326,0.03635145,0.0010636585,0.002097912,0.00019218994,0.0001526966,0.30232003],"genre_scores_gemma":[0.99488336,0.0021323757,0.00032701413,0.0010708839,0.000058852987,0.000014136778,0.0000050064036,0.0000042639626,0.001504112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979119,0.0004679017,0.0006934429,0.00020312762,0.00062202185,0.000101623875],"domain_scores_gemma":[0.9945846,0.004184823,0.00038802545,0.0004823482,0.00031658108,0.000043590506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01619865,0.00008439038,0.0002578822,0.00008119586,0.000059584672,0.000033495373,0.00086313445,0.000024488887,0.00082315825],"category_scores_gemma":[0.0045463177,0.0000467137,0.00011987974,0.0003230578,0.001348827,0.00012133934,0.00016534462,0.00009785623,0.00025176333],"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.00008030073,0.000022697435,0.00010950116,0.000019275732,0.000014205769,3.3284525e-7,0.00007447605,0.0000048223246,0.000028499624,0.9492443,0.00033263714,0.05006891],"study_design_scores_gemma":[0.00032903318,0.000008752742,0.0072759152,0.00022860082,0.000022392096,0.000018028333,0.000061326304,0.00041943128,0.00005053575,0.93808115,0.053452745,0.000052072395],"about_ca_topic_score_codex":0.0000056613544,"about_ca_topic_score_gemma":0.0000051663437,"teacher_disagreement_score":0.9474175,"about_ca_system_score_codex":0.000018956467,"about_ca_system_score_gemma":0.000019185385,"threshold_uncertainty_score":0.90130055},"labels":[],"label_agreement":null},{"id":"W2083467094","doi":"10.1006/game.1999.0716","title":"An Example of Dynamic (In)Consistency in Symmetric Extensive Form Evolutionary Games","year":2000,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"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; Subgame perfect equilibrium; Consistency (knowledge bases); Extensive-form game; Equilibrium selection; Markov perfect equilibrium; Subgame; Selection (genetic algorithm); Stability (learning theory); Computer science; Mathematics; Sequential game; Mathematical optimization; Nash equilibrium; Game theory; Repeated game; Artificial intelligence; Machine learning","score_opus":0.06133991525684419,"score_gpt":0.3326287466656262,"score_spread":0.271288831408782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083467094","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.9972919,0.00041932033,0.000010220933,0.00008771529,0.00005014461,0.00023941309,0.00004818853,0.000010624505,0.0018424336],"genre_scores_gemma":[0.9984016,0.00017396004,0.00036254607,0.00004058842,0.0000117797745,0.00007742087,0.000008275464,0.000007668238,0.00091616623],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985196,0.00006120872,0.00065001147,0.00045941037,0.00009712767,0.00021266633],"domain_scores_gemma":[0.99897254,0.0002829525,0.00012688566,0.00050381885,0.000032479624,0.00008131485],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069606426,0.00011481223,0.0003118713,0.0004132528,0.00005234945,0.000040824743,0.0002983332,0.00007225594,0.0016123721],"category_scores_gemma":[0.000031297503,0.00010383477,0.00006506885,0.00031284319,0.00016915174,0.0003540888,0.00003405516,0.00008933517,0.0001533595],"study_design_candidate":"observational","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.00004698042,0.00031838924,0.1646798,0.000003938043,0.000003786077,0.0000063703346,0.0011265535,0.00021288176,0.00041097455,0.00955695,0.00009888959,0.8235345],"study_design_scores_gemma":[0.00035910463,0.000065725435,0.96900135,0.000009474366,0.000011080315,0.000022872462,0.0015011989,0.0026946096,0.000032146927,0.02503807,0.0011335642,0.00013079877],"about_ca_topic_score_codex":0.0011823686,"about_ca_topic_score_gemma":0.001043239,"teacher_disagreement_score":0.8234037,"about_ca_system_score_codex":0.000068300295,"about_ca_system_score_gemma":0.000052678206,"threshold_uncertainty_score":0.9993003},"labels":[],"label_agreement":null},{"id":"W2085259781","doi":"10.1007/s10957-006-9070-3","title":"Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Theory of computation; Mathematics; Game theory; Mathematical economics; Combinatorics; Mathematical optimization; Algorithm","score_opus":0.04046932685072907,"score_gpt":0.332936384393702,"score_spread":0.2924670575429729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085259781","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.16435938,0.0022181827,0.82908344,0.0018687866,0.000040010884,0.0004716477,0.00002157588,0.000013202426,0.0019237425],"genre_scores_gemma":[0.99531686,0.00024361549,0.0035468705,0.00011288578,0.00012426137,0.000036083013,0.00000633009,0.000010785008,0.00060228154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975644,0.00068031554,0.0010446521,0.00020782302,0.00036807964,0.00013476748],"domain_scores_gemma":[0.99567693,0.0026688909,0.0009348777,0.0003517331,0.0003051988,0.00006235816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060309446,0.00012706543,0.00027349722,0.00031866715,0.00014213596,0.00014453921,0.0003910883,0.00007269277,0.00013150969],"category_scores_gemma":[0.00048640225,0.000082110055,0.00007862714,0.0007491354,0.00034581558,0.00042021132,0.000063182284,0.00015374181,0.0000050973526],"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.00013380527,0.00011363494,0.00066025264,0.0000052698942,0.000015220657,4.2519437e-7,0.0004462455,0.03764369,0.0034890291,0.9456608,0.00014149408,0.011690133],"study_design_scores_gemma":[0.0005737255,0.00005029682,0.0030071174,0.000019834992,0.0000631667,0.00006885108,0.0011553164,0.008652695,0.0011279549,0.97962916,0.005532837,0.000119044074],"about_ca_topic_score_codex":0.0000037836705,"about_ca_topic_score_gemma":0.0000030537567,"teacher_disagreement_score":0.83095753,"about_ca_system_score_codex":0.000014261247,"about_ca_system_score_gemma":0.00005398001,"threshold_uncertainty_score":0.33483508},"labels":[],"label_agreement":null},{"id":"W2085622378","doi":"10.1142/s021919890900242x","title":"A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES","year":2009,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Sequence (biology); Set (abstract data type); Mathematics; Nash equilibrium; Order (exchange); Combinatorics; Extreme point; Parametric statistics; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Statistics","score_opus":0.2541072843506172,"score_gpt":0.4350478281736562,"score_spread":0.18094054382303904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085622378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025151644,0.027055895,0.94054985,0.019584475,0.00021378504,0.0036984184,0.00018443608,0.000038900358,0.0061590937],"genre_scores_gemma":[0.8920091,0.016322548,0.057585403,0.014205167,0.0006087001,0.0014225697,0.00020847401,0.00003927719,0.017598776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801534,0.00009972078,0.00079362735,0.000394878,0.0005171573,0.00017925046],"domain_scores_gemma":[0.99603975,0.0022211964,0.00051689695,0.00049754,0.0006520867,0.00007253253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033553,0.00016635694,0.00035054376,0.00007563603,0.00008091732,0.00009995207,0.0008626856,0.000042937532,0.0002052142],"category_scores_gemma":[0.0023026585,0.0001009227,0.00022718582,0.00018265545,0.00010536278,0.00029724024,0.00007366729,0.00007165358,0.000012019383],"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.0001074995,0.00003312286,0.0000031378775,0.000050501407,0.000039476337,8.549164e-8,0.00030696995,0.000014409602,0.0016711878,0.527274,0.0046631256,0.46583647],"study_design_scores_gemma":[0.00039553543,0.00012377526,0.00013327353,0.0002334482,0.00008771741,0.000018765122,0.00011518202,0.0036920097,0.00048594447,0.7406505,0.253946,0.00011783577],"about_ca_topic_score_codex":0.0000028003858,"about_ca_topic_score_gemma":0.0000018247805,"teacher_disagreement_score":0.88949394,"about_ca_system_score_codex":0.000034568497,"about_ca_system_score_gemma":0.00006775327,"threshold_uncertainty_score":0.41155082},"labels":[],"label_agreement":null},{"id":"W2085667665","doi":"10.1006/game.2000.0836","title":"Cooperation, Secret Handshakes, and Imitation in the Prisoners' Dilemma","year":2001,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"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":"Handshake; Dilemma; Prisoner's dilemma; Imitation; Stochastic game; Mathematical economics; Superrationality; Repeated game; Limit (mathematics); Computer science; Adversary; SIGNAL (programming language); Microeconomics; Game theory; Economics; Computer security; Mathematics; Psychology; Social psychology; Telecommunications","score_opus":0.08203987794972302,"score_gpt":0.35174878228635326,"score_spread":0.26970890433663025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085667665","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.9968814,0.00010618434,0.00020235986,0.0015299277,0.000045441953,0.00020736775,0.000013657338,0.000007705298,0.001005928],"genre_scores_gemma":[0.9988837,0.000082159444,0.00007855228,0.00020596659,0.00003808969,0.00009290952,0.000008557661,0.0000035239398,0.0006065231],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992713,0.00006624508,0.00026493,0.00023181736,0.00006226634,0.00010348867],"domain_scores_gemma":[0.9994135,0.0002496466,0.00006644584,0.0002107738,0.0000213174,0.00003835213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009274419,0.000068051406,0.00010712422,0.00005998254,0.00013032493,0.00028217686,0.00015628466,0.000037902886,0.0002261224],"category_scores_gemma":[0.000053990596,0.000045355016,0.000018319537,0.00008723195,0.00008835475,0.00023339274,0.00002169717,0.00006106225,0.00007508548],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004550295,0.00012102783,0.6245688,0.0000022489962,0.0000054582233,0.000006388448,0.0074482006,0.00018332327,0.00061114907,0.068467915,0.0045926753,0.2939473],"study_design_scores_gemma":[0.00048761175,0.000045143704,0.9189312,0.000004276793,0.000018118748,0.000062636886,0.0043104235,0.001362491,0.00004999282,0.0068987343,0.06769202,0.00013734304],"about_ca_topic_score_codex":0.0000640432,"about_ca_topic_score_gemma":0.00043143806,"teacher_disagreement_score":0.2943624,"about_ca_system_score_codex":0.00001052266,"about_ca_system_score_gemma":0.000014579108,"threshold_uncertainty_score":0.2721038},"labels":[],"label_agreement":null},{"id":"W2086723411","doi":"10.1016/j.geb.2011.07.005","title":"Dynamic coordination with individual learning","year":2011,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":23,"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":"Coordination game; Computer science; Economics; Microeconomics","score_opus":0.09279793172436003,"score_gpt":0.3256794959273052,"score_spread":0.2328815642029452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086723411","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.9955706,0.000022644048,0.0005222636,0.0000812858,0.000045450764,0.00010625914,0.000010807511,0.000026079055,0.003614622],"genre_scores_gemma":[0.9961118,0.000005009262,0.000717417,0.00002354818,0.000009370159,0.00004821593,0.0000050107656,0.000006465558,0.0030731494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993352,0.00003326828,0.00019311043,0.00024980423,0.00007430449,0.00011429581],"domain_scores_gemma":[0.999555,0.00007548564,0.000113048176,0.00017549156,0.000021226897,0.000059738457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005491996,0.000072054354,0.00011341846,0.00007936575,0.0001245716,0.00009759855,0.00018963608,0.00003584421,0.0010429899],"category_scores_gemma":[0.000018204648,0.000053850392,0.000023872653,0.000056340108,0.000102290374,0.0002026833,0.00005048919,0.00008103162,0.00033834128],"study_design_candidate":"observational","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.000043214506,0.00009901754,0.4759803,0.0000015435909,0.000017128723,0.0000036483887,0.0037536523,0.000061390485,0.00026795265,0.02101036,0.0003115476,0.49845022],"study_design_scores_gemma":[0.0002994717,0.000114370814,0.984559,0.000003509096,0.000043796277,0.000030324798,0.0025681646,0.00058986444,0.00016624307,0.0063705994,0.0051029786,0.00015167097],"about_ca_topic_score_codex":0.00003341122,"about_ca_topic_score_gemma":0.000068607136,"teacher_disagreement_score":0.50857866,"about_ca_system_score_codex":0.000013498675,"about_ca_system_score_gemma":0.000016565175,"threshold_uncertainty_score":0.9998702},"labels":[],"label_agreement":null},{"id":"W2090478411","doi":"10.1007/s00199-010-0524-3","title":"A war of attrition with endogenous effort levels","year":2010,"lang":"en","type":"article","venue":"Economic 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":"HEC Montréal","funders":"","keywords":"Public finance; Attrition; Economics; Endogeny; Econometrics; Mathematical economics; Microeconomics; Macroeconomics; Medicine; Internal medicine","score_opus":0.10012541851040704,"score_gpt":0.3247885557039146,"score_spread":0.22466313719350758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090478411","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.9641049,0.000017872931,0.0020586487,0.00011927389,0.00014228279,0.00014296314,0.00005731188,0.000022127633,0.033334613],"genre_scores_gemma":[0.99803287,0.0000012685306,0.0006930801,0.00007188852,0.00007955081,0.000019603769,0.000002122295,0.00000834481,0.0010912529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991438,0.000063521744,0.0003256123,0.0002404398,0.00010214183,0.00012451774],"domain_scores_gemma":[0.9982903,0.0008145492,0.00018920313,0.0006038727,0.000043124604,0.00005895299],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00243223,0.000078004225,0.00017773276,0.00009219074,0.00008457512,0.00002198356,0.00045698776,0.000047573503,0.0031847118],"category_scores_gemma":[0.000117170086,0.00005636919,0.00006269231,0.00007845759,0.00024213656,0.00014084823,0.000040468432,0.00010842232,0.0012610822],"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.00009783601,0.000055162996,0.0014075506,0.0000021523097,0.000018680888,0.0000011984719,0.0006297236,0.0001013499,0.047940537,0.9264718,0.00027173068,0.023002258],"study_design_scores_gemma":[0.00032861976,0.000056271012,0.0059965793,0.0000035036055,0.000010267807,0.000036637106,0.0004935196,0.0000410374,0.05348579,0.93254745,0.006894365,0.00010596431],"about_ca_topic_score_codex":0.000006242872,"about_ca_topic_score_gemma":0.000031676827,"teacher_disagreement_score":0.03392798,"about_ca_system_score_codex":0.000011586265,"about_ca_system_score_gemma":0.00006253718,"threshold_uncertainty_score":0.99951655},"labels":[],"label_agreement":null},{"id":"W2090533394","doi":"10.1007/s11518-008-5088-4","title":"Fuzzy preferences in conflicts","year":2008,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":46,"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 Waterloo","funders":"","keywords":"Decision maker; Fuzzy logic; Preference; Conflict resolution; Stability (learning theory); Management science; Computer science; Operations research; Artificial intelligence; Mathematics; Mathematical economics; Engineering; Economics; Microeconomics; Machine learning; Political science; Law","score_opus":0.12764813088321209,"score_gpt":0.3302312966912754,"score_spread":0.2025831658080633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090533394","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.9935334,0.0014193296,0.0014300477,0.000056375422,0.0009985161,0.00015208934,0.0000015776233,0.000010349059,0.002398328],"genre_scores_gemma":[0.9994291,0.000053354386,0.0000795796,0.000006225422,0.00015624636,0.0000071085765,3.4436546e-8,0.0000043128884,0.00026401217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99676365,0.000076458055,0.0010593043,0.00021741835,0.0016326003,0.00025055758],"domain_scores_gemma":[0.9978639,0.0004909671,0.00044784107,0.0002500061,0.00074470503,0.00020260355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009503868,0.00010779393,0.00039840443,0.00081431033,0.00016336738,0.00030242893,0.000753225,0.00004814961,0.0000018818065],"category_scores_gemma":[0.0014822243,0.00007162483,0.000038400794,0.0014626562,0.00021032905,0.0008724984,0.000052085154,0.00017257058,0.000015969074],"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.000058350335,0.00022001001,0.12134876,0.0003070697,0.00006345167,0.00041543675,0.025771193,0.42843702,0.21845123,0.19845513,0.0024430074,0.0040293247],"study_design_scores_gemma":[0.0042785094,0.001273622,0.45453548,0.0041322596,0.000056266363,0.03131442,0.051079098,0.29924756,0.00414901,0.0057426444,0.14192086,0.0022702683],"about_ca_topic_score_codex":0.000043178123,"about_ca_topic_score_gemma":0.0000014690662,"teacher_disagreement_score":0.33318672,"about_ca_system_score_codex":0.00006323081,"about_ca_system_score_gemma":0.00018777499,"threshold_uncertainty_score":0.329387},"labels":[],"label_agreement":null},{"id":"W2090596035","doi":"10.1177/1043463106066379","title":"Coordination and Status Influence","year":2006,"lang":"en","type":"article","venue":"Rationality and Society","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":22,"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; HEC Montréal","funders":"","keywords":"Set (abstract data type); Coordination game; Microeconomics; Competence (human resources); Social psychology; Psychology; Economics; Computer science; Risk analysis (engineering); Business","score_opus":0.042633675244676525,"score_gpt":0.35963396257104013,"score_spread":0.3170002873263636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090596035","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.9903718,0.00007665412,0.0049919384,0.0021413395,0.000012038636,0.00006835461,0.000023338565,0.000015395188,0.0022991302],"genre_scores_gemma":[0.99722964,0.000013472144,0.0009723593,0.00035988557,0.00003569856,0.000008805975,0.0000131269435,0.0000013153095,0.0013657205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999241,0.0000582522,0.00017853148,0.00017529503,0.00027025823,0.00007668002],"domain_scores_gemma":[0.9991572,0.0004930989,0.000059905156,0.00010660135,0.0001466165,0.000036592977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010319732,0.000042883796,0.00006303174,0.000010357478,0.0002981218,0.00014134479,0.00005566564,0.000036789377,0.00005009929],"category_scores_gemma":[0.00017693761,0.000034967485,0.00002788704,0.00016269609,0.00018201495,0.00026005215,0.000029613653,0.000044776472,0.000014016712],"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.0000022088716,0.000025312838,0.05081772,0.0000024506755,0.0000031184393,4.9931163e-8,0.0005838536,0.0001599175,0.0017979508,0.93988186,0.0045217318,0.002203834],"study_design_scores_gemma":[0.00009114819,0.0000036731833,0.53804445,8.4453876e-7,0.0000021162011,9.296457e-7,0.00030837033,0.0014103984,0.00009499324,0.44500175,0.015004174,0.000037133777],"about_ca_topic_score_codex":0.00006714606,"about_ca_topic_score_gemma":0.000023520915,"teacher_disagreement_score":0.49488008,"about_ca_system_score_codex":0.000009642048,"about_ca_system_score_gemma":0.00002467103,"threshold_uncertainty_score":0.22929421},"labels":[],"label_agreement":null},{"id":"W2090640228","doi":"10.1111/1475-3995.00327","title":"A Note on Fantasy Team Selection Strategy","year":2001,"lang":"en","type":"article","venue":"International Transactions in Operational Research","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":"Royal Military College of Canada","funders":"","keywords":"Fantasy; Selection (genetic algorithm); Computer science; Psychology; Operations research; Artificial intelligence; Mathematics","score_opus":0.2822096772210426,"score_gpt":0.5484308002048266,"score_spread":0.266221122983784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090640228","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.212316,0.00002504599,0.25694558,0.02341581,0.00080597645,0.00092603965,0.000150874,0.00009935942,0.5053153],"genre_scores_gemma":[0.9669291,0.000051867293,0.0006844643,0.00022748412,0.00022960956,0.00025525942,0.000024789942,0.000012861537,0.031584572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951347,0.00048576045,0.0006120342,0.00058240915,0.0028548366,0.0003302549],"domain_scores_gemma":[0.99587554,0.0024310052,0.000051292613,0.0003101722,0.0012197206,0.00011230024],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00452325,0.00013075517,0.00013991001,0.0013155666,0.00052571204,0.00047649318,0.0008885023,0.0001097785,0.011876833],"category_scores_gemma":[0.0010337146,0.00011371291,0.00009234716,0.0019954308,0.00018771313,0.000619618,0.000019928288,0.0007728707,0.0026132138],"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.0007367275,0.0015561419,0.0033174772,0.0000019130077,0.00004621331,0.000021178104,0.0006860681,0.37893966,0.0077074333,0.4351281,0.0045445454,0.16731457],"study_design_scores_gemma":[0.0017592849,0.00044910036,0.03801396,0.000057182642,0.0000058363607,0.00021092409,0.0015698356,0.19524081,0.005991795,0.2566929,0.49952698,0.00048140634],"about_ca_topic_score_codex":0.00013741119,"about_ca_topic_score_gemma":0.0008398011,"teacher_disagreement_score":0.7546131,"about_ca_system_score_codex":0.0003645317,"about_ca_system_score_gemma":0.00033517694,"threshold_uncertainty_score":0.99816334},"labels":[],"label_agreement":null},{"id":"W2091484735","doi":"10.1016/j.jda.2005.06.009","title":"Utilitarian resource assignment","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Social cost; Price of anarchy; Mathematical optimization; Resource allocation; Resource (disambiguation); Mathematical economics; Computer science; Best response; Game theory; Total cost; Mathematics; Economics; Microeconomics; Price of stability","score_opus":0.07711950346725295,"score_gpt":0.39232270845129946,"score_spread":0.3152032049840465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091484735","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.3170391,0.0025110524,0.4633009,0.080354325,0.0010121302,0.0005269457,0.00009568566,0.000070869915,0.13508897],"genre_scores_gemma":[0.97724074,0.000013439449,0.017013865,0.0004358249,0.00077759876,0.0000023785944,8.530143e-7,0.000009321798,0.0045059556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723995,0.00020623149,0.00092758547,0.00018270503,0.0012415565,0.00020194768],"domain_scores_gemma":[0.99796885,0.0005789661,0.00056604785,0.0004366483,0.00022851325,0.0002209959],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038713769,0.000108432076,0.00026346472,0.000184455,0.00014215506,0.00014053151,0.0008905581,0.000052705658,0.0009790992],"category_scores_gemma":[0.00058794377,0.00006911154,0.00022670752,0.0003814706,0.00010486199,0.00039896707,0.00007964522,0.0002484182,0.000363205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120626,0.00024583263,0.0006176457,0.000001727622,0.00008132419,0.000028577,0.0017408337,0.0019880165,0.0015878999,0.017041314,0.07518918,0.9013656],"study_design_scores_gemma":[0.0005232893,0.00018906585,0.0036969187,0.000017652968,0.000029351526,0.00014018538,0.0019993125,0.0023182812,0.0014873793,0.05958063,0.9298817,0.00013626624],"about_ca_topic_score_codex":0.0000019132387,"about_ca_topic_score_gemma":0.000002357485,"teacher_disagreement_score":0.9012293,"about_ca_system_score_codex":0.000052937638,"about_ca_system_score_gemma":0.00006165825,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W2091890667","doi":"10.4018/ijdsst.2015010104","title":"Strategic Investigation of the Jackpine Mine Expansion Dispute in the Alberta Oil Sands","year":2015,"lang":"en","type":"article","venue":"International Journal of Decision Support System Technology","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Oil sands; Government (linguistics); Crude oil; Asphalt; Business; Fossil fuel; Environmental planning; Environmental resource management; Environmental science; Engineering; Geography; Petroleum engineering; Waste management; Archaeology","score_opus":0.09663798096798511,"score_gpt":0.37007296390758854,"score_spread":0.27343498293960344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091890667","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.9828525,0.00009188491,0.0022307213,0.010547032,0.0011262066,0.000100668934,0.000011287595,0.000009274253,0.0030304089],"genre_scores_gemma":[0.9985295,0.000009431617,0.0007471191,0.00014281731,0.00010643269,0.000010504146,0.0000026266268,0.000007275705,0.00044429125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951013,0.00032186398,0.0018840609,0.00022872811,0.0023168328,0.00014726169],"domain_scores_gemma":[0.9944833,0.0013625476,0.0016073714,0.0007228092,0.0017491322,0.000074826916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059317076,0.0001360515,0.0003638063,0.00091989915,0.00005676979,0.00008767119,0.0035790245,0.00016485753,0.000076005745],"category_scores_gemma":[0.0025120948,0.000066128545,0.00017189978,0.0014707356,0.00027135998,0.00027872145,0.00025670067,0.00032042424,0.00007759528],"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.0011916321,0.00067921134,0.18456605,0.000025287529,0.00023317426,0.0003971461,0.0066476515,0.002464815,0.021079537,0.597702,0.02679009,0.15822338],"study_design_scores_gemma":[0.0051260428,0.0008069781,0.02685196,0.00095624145,0.00008111829,0.008886913,0.043216135,0.0021103667,0.011966669,0.86643666,0.033164047,0.0003968526],"about_ca_topic_score_codex":0.000032875592,"about_ca_topic_score_gemma":0.00015194705,"teacher_disagreement_score":0.26873463,"about_ca_system_score_codex":0.00010172214,"about_ca_system_score_gemma":0.0003141744,"threshold_uncertainty_score":0.66507775},"labels":[],"label_agreement":null},{"id":"W2093000536","doi":"10.1016/s0899-8256(02)00010-6","title":"Calibration and Bayesian learning","year":2002,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Calibration; Measure (data warehouse); Stochastic game; Test (biology); Bayesian probability; Product (mathematics); Computer science; Mathematics; Econometrics; Mathematical economics; Statistics; Artificial intelligence; Data mining","score_opus":0.07888508849772863,"score_gpt":0.32010205174464207,"score_spread":0.24121696324691344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093000536","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.99599236,0.00012813749,0.00074495375,0.0006295569,0.0000458096,0.000074628944,0.000005104545,0.00001984739,0.00235961],"genre_scores_gemma":[0.99449366,0.000058284702,0.00016387142,0.000056242374,0.000037924197,0.000021443318,0.00000116773,0.000004270258,0.0051631304],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999425,0.000032917284,0.00018703555,0.0002224162,0.000043122538,0.00008950481],"domain_scores_gemma":[0.99961567,0.000109574175,0.0000627897,0.00013495375,0.000006807755,0.00007020278],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029801723,0.000056259276,0.00009778276,0.000047350095,0.00013728405,0.00018627063,0.00008065269,0.0000344905,0.0019094939],"category_scores_gemma":[0.000027731321,0.000047398153,0.000020419764,0.000033146254,0.00007053006,0.00020225706,0.00003798037,0.00005889048,0.00014704907],"study_design_candidate":"observational","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.0000048302727,0.000039254068,0.20895848,0.0000015944007,0.0000041706826,0.0000017466485,0.001373298,0.00010308252,0.00066347443,0.021545002,0.0022080294,0.765097],"study_design_scores_gemma":[0.001202754,0.00022107821,0.5832489,0.000014546633,0.00010084205,0.00016171127,0.005102154,0.17315902,0.00095857686,0.043687098,0.19133571,0.00080760615],"about_ca_topic_score_codex":0.000014130445,"about_ca_topic_score_gemma":0.000016435912,"teacher_disagreement_score":0.76428944,"about_ca_system_score_codex":0.0000066111584,"about_ca_system_score_gemma":0.000002738317,"threshold_uncertainty_score":0.9990029},"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":"W2093819078","doi":"10.5539/ass.v6n5p76","title":"A Game-Theoretic Analysis of Hezong and Lianheng-Simultaneous and Sequential Moves","year":2010,"lang":"en","type":"article","venue":"Asian Social Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"League; Battle; Mathematical economics; Nash equilibrium; Strategy; Game theory; Economics; Computer science; Microeconomics; History","score_opus":0.026941439187079114,"score_gpt":0.3670355589361465,"score_spread":0.34009411974906734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093819078","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.9613444,0.000012650949,0.0011683245,0.0005036017,0.00006598027,0.00008604944,0.000017686441,0.000015179729,0.036786113],"genre_scores_gemma":[0.9992234,0.000003178376,0.0004323324,0.000059149843,0.00004317594,0.0000038845087,5.88324e-7,0.0000029055218,0.00023136637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983264,0.000073128555,0.00027701838,0.0004227727,0.00068748504,0.00021320223],"domain_scores_gemma":[0.9986809,0.0005430013,0.00016431331,0.0002778621,0.0001903973,0.00014353982],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023042965,0.00008219923,0.00022746333,0.00031334916,0.0004364573,0.0002417737,0.0005720574,0.00005728387,0.00016024071],"category_scores_gemma":[0.0013888156,0.00006472844,0.000065804576,0.0029920863,0.0039339093,0.0002394667,0.00016078314,0.0001280901,0.000011747511],"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.000012223372,0.000037870464,0.004413943,0.0000024054889,0.000029862298,0.0000028040706,0.008931259,0.0000053051463,0.06658033,0.6255392,0.000012039486,0.29443276],"study_design_scores_gemma":[0.0002976598,0.000069005975,0.32941845,0.0000057250413,0.0003178021,0.000014901833,0.008522595,0.0061783087,0.005511823,0.6474847,0.0018315869,0.00034740684],"about_ca_topic_score_codex":0.000021833966,"about_ca_topic_score_gemma":0.00007486577,"teacher_disagreement_score":0.3250045,"about_ca_system_score_codex":0.000007753161,"about_ca_system_score_gemma":0.000068213754,"threshold_uncertainty_score":0.9987768},"labels":[],"label_agreement":null},{"id":"W2094787710","doi":"10.1016/j.automatica.2015.01.007","title":"Node-consistent core for games played over event trees","year":2015,"lang":"en","type":"article","venue":"Automatica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Core (optical fiber); Node (physics); Stochastic game; Event (particle physics); Mathematical economics; Computer science; Tree (set theory); Class (philosophy); Game tree; Repeated game; Mathematical optimization; Decomposition; Game theory; Mathematics; Engineering; Artificial intelligence; Combinatorics; Telecommunications","score_opus":0.23512545238992996,"score_gpt":0.43569168008557313,"score_spread":0.20056622769564317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094787710","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.95121664,0.000088057466,0.028518245,0.0038569367,0.000307664,0.0007222109,0.00007596261,0.0002121725,0.015002122],"genre_scores_gemma":[0.98801434,7.2875594e-7,0.006146028,0.0004849934,0.000056577595,0.00015804077,0.0000071443883,0.000010301686,0.0051218327],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833673,0.00006676997,0.00048714227,0.00029219274,0.00060849095,0.00020869848],"domain_scores_gemma":[0.9971917,0.0015904171,0.000171939,0.0006708392,0.00019723449,0.0001778376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015967081,0.00011349338,0.00023621101,0.000084730746,0.00010837985,0.0001162098,0.0005028979,0.00005263092,0.0004274837],"category_scores_gemma":[0.0021784783,0.0000784075,0.00013564122,0.00026376566,0.0001104381,0.00012261029,0.00007914522,0.000049611303,0.0012963181],"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.00014153517,0.0005187249,0.0026704182,0.000016983404,0.00009493891,0.0000046341925,0.0046545793,0.00084903894,0.0019672916,0.42673996,0.5091836,0.053158306],"study_design_scores_gemma":[0.0010709465,0.00014251006,0.022764718,0.000024382754,0.000048712758,0.000012002172,0.0016902703,0.0697516,0.000929874,0.75392395,0.14939265,0.0002483763],"about_ca_topic_score_codex":0.000004963673,"about_ca_topic_score_gemma":0.000015107803,"teacher_disagreement_score":0.35979095,"about_ca_system_score_codex":0.000028839826,"about_ca_system_score_gemma":0.000088485845,"threshold_uncertainty_score":0.99948126},"labels":[],"label_agreement":null},{"id":"W2095719083","doi":"10.1017/s026988891200015x","title":"Individual evolutionary learning with many agents","year":2012,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mechanism (biology); Convergence (economics); Quadratic equation; Population; Scaling; Computer science; Artificial intelligence; Mathematical economics; Mathematics; Epistemology; Economics; Philosophy; Medicine","score_opus":0.09998893076512351,"score_gpt":0.36524263024246517,"score_spread":0.2652536994773417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095719083","genre_codex":"review","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.09541017,0.8102238,0.0445124,0.0024178228,0.0009089054,0.0016558011,0.000015322466,0.0005629822,0.044292793],"genre_scores_gemma":[0.9921759,0.002093461,0.0006852387,0.00012538413,0.00026279528,0.000108096596,0.0000049347036,0.00002001508,0.0045242175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872816,0.00016857371,0.0002910668,0.00016120277,0.00038249695,0.00026852373],"domain_scores_gemma":[0.9985273,0.000713932,0.000091127644,0.00047447227,0.000085019106,0.00010814024],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003313359,0.00013011943,0.00021426276,0.000060262315,0.00017683415,0.000036445424,0.00067820324,0.00002582152,0.00053677865],"category_scores_gemma":[0.0008283164,0.000069186186,0.00007284951,0.0007790668,0.000047866655,0.00018266453,0.00014080014,0.00024259133,0.0034127557],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021099464,0.0006117611,0.015413822,0.0015518772,0.00031945945,0.000004382032,0.0071219555,0.0061955964,0.00031210785,0.2946096,0.12013861,0.55369973],"study_design_scores_gemma":[0.00007410733,0.00001744425,0.031679317,0.00064587465,0.00007179501,0.000041514853,0.00005983969,0.0011017943,0.000019573985,0.00042332275,0.9657087,0.0001567161],"about_ca_topic_score_codex":3.5793897e-7,"about_ca_topic_score_gemma":1.6514055e-7,"teacher_disagreement_score":0.8967657,"about_ca_system_score_codex":0.000021728527,"about_ca_system_score_gemma":0.000020160542,"threshold_uncertainty_score":0.9973632},"labels":[],"label_agreement":null},{"id":"W2095823527","doi":"10.1109/tac.2012.2228032","title":"Mean Field Stochastic Adaptive Control","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Population; Limit (mathematics); Nash equilibrium; Mathematics; Function (biology); Dynamical systems theory; Field (mathematics); Yield (engineering); Mathematical optimization; Applied mathematics; Control theory (sociology); Computer science; Control (management); Mathematical analysis; Physics","score_opus":0.046908412731097054,"score_gpt":0.32533126739782187,"score_spread":0.2784228546667248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095823527","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.018497422,0.000045405868,0.97632855,0.001632357,0.0006905772,0.00074464746,0.00008076851,0.00023218816,0.0017480868],"genre_scores_gemma":[0.9961584,6.1829815e-7,0.0004788208,0.0016874541,0.0001115168,0.0003351149,3.5642435e-7,0.000019614206,0.0012081029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972566,0.00039133662,0.00068958837,0.00034603325,0.00083016057,0.0004862992],"domain_scores_gemma":[0.99186724,0.0066396384,0.00021386101,0.00081491726,0.00015920516,0.00030516187],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018097274,0.0002389986,0.00044762672,0.0002752431,0.0003797389,0.00010666562,0.0005350456,0.00011741715,0.0035988253],"category_scores_gemma":[0.00022730799,0.00018426275,0.00027906624,0.0005057772,0.000110339184,0.00036753793,0.0000011916113,0.00024199836,0.003651122],"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.0006065727,0.001863681,0.000053180083,0.000010859173,0.00048438046,0.000004095897,0.004319736,0.056740463,0.0038821374,0.03053773,0.0027728812,0.89872426],"study_design_scores_gemma":[0.009801591,0.000978275,0.0018611006,0.00009376044,0.00078374374,0.00008232285,0.0028842909,0.93230516,0.005048198,0.041801076,0.0032241612,0.0011363516],"about_ca_topic_score_codex":0.00001576962,"about_ca_topic_score_gemma":0.000025747071,"teacher_disagreement_score":0.97766095,"about_ca_system_score_codex":0.000053887485,"about_ca_system_score_gemma":0.000054418124,"threshold_uncertainty_score":0.997312},"labels":[],"label_agreement":null},{"id":"W2095914169","doi":"10.2139/ssrn.2191093","title":"Influential Opinion Leaders","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Political science; Psychology","score_opus":0.09120858836806585,"score_gpt":0.4052775975605762,"score_spread":0.31406900919251035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095914169","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.8671779,0.0041836523,0.10663519,0.0043150545,0.0020816796,0.000173787,0.0000029292676,0.00006146873,0.015368357],"genre_scores_gemma":[0.99483144,0.00026848036,0.00007643879,0.00016268875,0.0008587932,0.000003887896,9.0014737e-7,0.000008526863,0.003788836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969049,0.00018481899,0.0003568398,0.00014043268,0.0006086874,0.0018042873],"domain_scores_gemma":[0.99910396,0.00020829822,0.00017580933,0.00026591768,0.000097747696,0.00014826008],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007667896,0.00009131448,0.00012058424,0.00014189848,0.00031295247,0.00010462798,0.0005907541,0.00005383354,0.0003346748],"category_scores_gemma":[0.0004248994,0.00006651404,0.0001197707,0.00037441496,0.00010167748,0.000584109,0.000045424888,0.0009732402,0.0016780564],"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.000023145221,0.00006303307,0.0042174375,3.3182232e-7,0.000026612757,1.0489245e-7,0.0004884233,0.000034541066,0.00063821883,0.9292148,0.0013094567,0.06398394],"study_design_scores_gemma":[0.00027242376,0.000058465837,0.0021204154,0.0000027850094,0.000008669057,0.0004150656,0.0068279994,0.000017881217,0.0002528006,0.88895047,0.10096035,0.00011269643],"about_ca_topic_score_codex":0.0000047455874,"about_ca_topic_score_gemma":0.000014772239,"teacher_disagreement_score":0.12765357,"about_ca_system_score_codex":0.00018072987,"about_ca_system_score_gemma":0.0005174653,"threshold_uncertainty_score":0.99909925},"labels":[],"label_agreement":null},{"id":"W2098412593","doi":"10.1016/j.jet.2014.06.008","title":"Communication in Cournot oligopoly","year":2014,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"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","keywords":"Cournot competition; Duopoly; Cheap talk; Microeconomics; Private information retrieval; Interim; Economics; Oligopoly; Pareto principle; Simple (philosophy); Construct (python library); Mathematical economics; Computer science","score_opus":0.058125969647833196,"score_gpt":0.3763462971087187,"score_spread":0.3182203274608855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098412593","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.95570225,0.00017646186,0.005783843,0.0015656076,0.0001857284,0.000042071533,0.0000018679883,0.0000040294995,0.036538165],"genre_scores_gemma":[0.99831885,0.000027861079,0.00054404803,0.00025118474,0.00010373704,0.0000013253845,2.2345044e-7,0.000005001977,0.00074774056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982588,0.00062759797,0.00080479967,0.00009158237,0.00012071126,0.00009649304],"domain_scores_gemma":[0.9957692,0.0029293485,0.00068096566,0.00048758794,0.0000683885,0.000064494176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013453289,0.0000585597,0.00022241117,0.0002342706,0.000057530855,0.000073527845,0.00095316005,0.00003895107,0.0006868781],"category_scores_gemma":[0.00091562537,0.000044547636,0.000094326984,0.00008776009,0.00011373863,0.00029452713,0.000056267818,0.000181811,0.0005209765],"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.000050083578,0.00003840988,0.0017613171,4.635225e-7,0.000006772757,3.7844896e-7,0.00042742334,0.0012589804,0.00029315212,0.9644733,0.0014745601,0.030215168],"study_design_scores_gemma":[0.00032298273,0.000028004706,0.00681249,0.000011442279,0.0000043432597,0.00002770866,0.00065740553,0.00040845518,0.00040927436,0.9667034,0.02456444,0.000050068713],"about_ca_topic_score_codex":0.0000027384485,"about_ca_topic_score_gemma":0.000017366341,"teacher_disagreement_score":0.04261665,"about_ca_system_score_codex":0.000056831992,"about_ca_system_score_gemma":0.000054150485,"threshold_uncertainty_score":0.75208336},"labels":[],"label_agreement":null},{"id":"W2100431587","doi":"","title":"Learning in hidden Markov models with bounded memory","year":2010,"lang":"en","type":"preprint","venue":"Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hidden Markov model; Bounded function; Computer science; Sequence (biology); Inference; Context (archaeology); Markov decision process; Cover (algebra); Markov chain; Markov model; Variable-order Markov model; Markov process; Artificial intelligence; Theoretical computer science; Mathematical economics; Machine learning; Mathematics; Statistics; Geography","score_opus":0.05121922474582818,"score_gpt":0.2794801199023155,"score_spread":0.22826089515648734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100431587","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.86851835,0.00015860097,0.0041963863,0.0015019787,0.00012994152,0.0008269087,0.00031383825,0.00013361471,0.124220364],"genre_scores_gemma":[0.9444854,0.00028516346,0.03325783,0.000076757206,0.000060192215,0.0000057929415,0.00016248068,0.000058412457,0.021607932],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99381006,0.0013301668,0.0007642446,0.0016263168,0.001786563,0.0006826587],"domain_scores_gemma":[0.99365306,0.0018924403,0.0009958321,0.0025535899,0.0005125817,0.0003924964],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030811166,0.00060734194,0.0011599467,0.0010675965,0.0007145906,0.00014339924,0.0047637415,0.00053481164,0.0010733225],"category_scores_gemma":[0.00059070764,0.0006123056,0.0005316995,0.0007332875,0.0019134834,0.0004106081,0.0039219637,0.0039333864,0.00010631845],"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.0110405125,0.0036630512,0.017988814,0.00078987825,0.0015473252,0.0017033062,0.343426,0.062108595,0.0062943776,0.0732608,0.0070701987,0.47110716],"study_design_scores_gemma":[0.0051406645,0.00072291296,0.032846775,0.0012961784,0.00039464398,0.00014789014,0.12995496,0.21699926,0.00018248182,0.5697291,0.039760232,0.0028248988],"about_ca_topic_score_codex":0.0031663731,"about_ca_topic_score_gemma":0.013372981,"teacher_disagreement_score":0.49646828,"about_ca_system_score_codex":0.00018680605,"about_ca_system_score_gemma":0.00097355124,"threshold_uncertainty_score":0.99983984},"labels":[],"label_agreement":null},{"id":"W2100449018","doi":"10.1109/icassp.2012.6288310","title":"Tracking correlated equilibria in clustered multi-agent networks via adaptive filtering algorithms","year":2012,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Computer science; Cluster (spacecraft); Set (abstract data type); Multi-agent system; Tracking (education); Simple (philosophy); Algorithm; Distributed computing; Artificial intelligence; Computer network","score_opus":0.23323589154306318,"score_gpt":0.39932629881729914,"score_spread":0.16609040727423596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100449018","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.24087515,0.00011915938,0.75539255,0.00007819239,0.0004166852,0.00025609907,0.0000030909735,0.000067802765,0.0027912755],"genre_scores_gemma":[0.9872152,0.0000033403132,0.010341805,0.00014353119,0.00011276708,0.00003169808,0.0000041680255,0.000013526442,0.0021339147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979981,0.00023466449,0.0006025417,0.00034060795,0.00035667905,0.00046736246],"domain_scores_gemma":[0.99833524,0.00079731544,0.00015333273,0.000457147,0.00008077359,0.00017618136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002295861,0.00015080925,0.00023187305,0.00015198455,0.00011296476,0.00010616145,0.0004908434,0.000111799905,0.0010955096],"category_scores_gemma":[0.00021916287,0.00011576917,0.00008226312,0.0007572262,0.00006965313,0.0005846824,0.00021324631,0.00022720653,0.0006928309],"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.00029182472,0.0013516769,0.037416115,0.000004999795,0.000082057566,0.000020721604,0.011450105,0.09129288,0.021558888,0.014406876,0.0023493585,0.8197745],"study_design_scores_gemma":[0.00052579364,0.000023751812,0.03947102,0.000015869347,0.000007018614,0.000012927318,0.0010444147,0.9548784,0.0006028126,0.0021353224,0.0010798743,0.00020278119],"about_ca_topic_score_codex":0.000041755757,"about_ca_topic_score_gemma":0.00004661096,"teacher_disagreement_score":0.86358553,"about_ca_system_score_codex":0.000045753797,"about_ca_system_score_gemma":0.000011657733,"threshold_uncertainty_score":0.9998176},"labels":[],"label_agreement":null},{"id":"W2101217556","doi":"10.1145/1807342.1807352","title":"Computing pure strategy nash equilibria in compact symmetric games","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nash equilibrium; Computer science; Best response; Mathematical economics; Mathematics","score_opus":0.09956290380254348,"score_gpt":0.4084795732469236,"score_spread":0.3089166694443801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101217556","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.8557447,0.000016242091,0.0012250285,0.00063557056,0.00013564811,0.00011877602,0.0000035506328,0.000055561264,0.14206493],"genre_scores_gemma":[0.9965087,6.419736e-7,0.00054697035,0.00014161422,0.00007604925,0.0000015288324,0.0000018894197,0.000006180817,0.0027164058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983352,0.0001157067,0.00046509036,0.0003527098,0.00047372348,0.00025757658],"domain_scores_gemma":[0.9973668,0.0017395911,0.000118451004,0.000562553,0.00009785147,0.000114747796],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002407184,0.00010650926,0.0002120754,0.00038634735,0.00009008401,0.00029586485,0.0008097249,0.00007722756,0.0020715357],"category_scores_gemma":[0.0009361619,0.00007461708,0.000065726046,0.0020756463,0.00010793788,0.00021774537,0.00009430108,0.00031871558,0.0011860795],"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.000010869329,0.0001489997,0.035788845,0.0000019840083,0.0000052823784,0.0000042317165,0.00021639935,0.0006721537,0.032453742,0.8220083,0.006419333,0.10226986],"study_design_scores_gemma":[0.00055575435,0.000057375266,0.380049,0.00000881131,0.000005001878,0.000025663643,0.001605015,0.050119866,0.0036434394,0.5485286,0.015077314,0.00032415954],"about_ca_topic_score_codex":0.000046235804,"about_ca_topic_score_gemma":0.00019798992,"teacher_disagreement_score":0.34426016,"about_ca_system_score_codex":0.000008156077,"about_ca_system_score_gemma":0.000050846564,"threshold_uncertainty_score":0.9995916},"labels":[],"label_agreement":null},{"id":"W2101419540","doi":"10.1109/cdc.2010.5717548","title":"Quickest time detection and constrained optimal social learning with variance penalty","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Herding; Variance (accounting); Computer science; Bayesian probability; Mathematical optimization; Artificial intelligence; Mathematics; Economics","score_opus":0.026790197138842252,"score_gpt":0.3202794013954425,"score_spread":0.29348920425660024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101419540","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.9230947,9.4103467e-7,0.05013822,0.00067429524,0.000028346412,0.000084205676,0.0000023141895,0.000051164643,0.025925811],"genre_scores_gemma":[0.98927766,1.9113986e-7,0.003838253,0.000055648114,0.00007642468,0.000008826272,8.5610856e-7,0.000004260136,0.0067378595],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999187,0.00006507381,0.0001490416,0.00023821207,0.00024291032,0.000117782285],"domain_scores_gemma":[0.99923617,0.00038919644,0.0000854691,0.00012255195,0.00010572212,0.000060872753],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010448982,0.000066111905,0.00010069157,0.00004479752,0.00042563776,0.00015558767,0.00014458041,0.000050404444,0.0015729435],"category_scores_gemma":[0.00028873223,0.000044074008,0.00001905259,0.00023962815,0.00029469127,0.00016481298,0.000031506348,0.00022457058,0.000414019],"study_design_candidate":"bench_or_experimental","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.00021803357,0.00010629754,0.0033853182,0.0000031446907,0.000025502528,0.0000050841804,0.0021056745,0.00028672794,0.6198614,0.15213075,0.00041382745,0.22145823],"study_design_scores_gemma":[0.0070015173,0.0017869782,0.3387423,0.000025616744,0.00016922058,0.0012859013,0.0156125575,0.1459311,0.08153033,0.20496336,0.20036875,0.002582384],"about_ca_topic_score_codex":0.0000071833488,"about_ca_topic_score_gemma":0.00004889198,"teacher_disagreement_score":0.5383311,"about_ca_system_score_codex":0.0000029599503,"about_ca_system_score_gemma":0.000030361025,"threshold_uncertainty_score":0.99933976},"labels":[],"label_agreement":null},{"id":"W2101482041","doi":"","title":"The Role of Middlemen inEfficient and Strongly Pairwise Stable Networks","year":2004,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pairwise comparison; Stability (learning theory); Network formation; Incentive; Power (physics); Complex network; Control (management); Component (thermodynamics); Network structure; Microeconomics; Computer science; Economics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.04773436479965467,"score_gpt":0.3490580772922394,"score_spread":0.30132371249258477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101482041","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.9563168,0.0003034235,0.0000710583,0.000514354,0.00003588263,0.0003037265,0.000010447888,0.000008013545,0.042436257],"genre_scores_gemma":[0.9981122,0.0007291634,0.00016815886,0.0000144652095,0.000031111238,0.000044809483,0.0000013347139,0.000007647174,0.0008910938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983341,0.00018453778,0.0004621582,0.00033230628,0.00029785963,0.00038905733],"domain_scores_gemma":[0.99668187,0.0023257188,0.00010767004,0.00066433643,0.00011516653,0.00010522495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005979538,0.00007632482,0.0001579495,0.00012561047,0.00029529363,0.00013545399,0.000627409,0.00005141428,0.000041342177],"category_scores_gemma":[0.00092352054,0.000053071733,0.000042290314,0.0002959671,0.0004944341,0.0000923954,0.00026795114,0.00024619073,0.000010237404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009799786,0.0001370794,0.008774358,0.0000022492654,0.000014860052,0.0000011072924,0.0006405934,0.17686905,0.00039015806,0.10844798,0.000033553155,0.70459104],"study_design_scores_gemma":[0.002239885,0.00049265806,0.03772542,0.000066619876,0.000008574628,0.000012209554,0.042857755,0.105820455,0.0033723065,0.42122456,0.38570997,0.0004695678],"about_ca_topic_score_codex":0.00003172713,"about_ca_topic_score_gemma":0.00024455902,"teacher_disagreement_score":0.7041215,"about_ca_system_score_codex":0.000096361255,"about_ca_system_score_gemma":0.00012720679,"threshold_uncertainty_score":0.22711897},"labels":[],"label_agreement":null},{"id":"W2101674550","doi":"10.1016/j.jmateco.2007.12.003","title":"A limit theorem for systems of social interactions","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"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":"Convergence (economics); Mathematical economics; Homogeneity (statistics); Limit (mathematics); Mathematics; Class (philosophy); Computer science; Economics; Mathematical analysis; Artificial intelligence","score_opus":0.1394832372931899,"score_gpt":0.4100161867334114,"score_spread":0.2705329494402215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101674550","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.6349123,0.000013254605,0.3519385,0.00072396005,0.00023626795,0.0001348993,0.000014881071,0.0000033367087,0.012022615],"genre_scores_gemma":[0.9935787,0.0000021091535,0.0055424133,0.000039578703,0.0002503333,0.000002924498,2.1419821e-7,0.0000066764596,0.0005770631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827176,0.000032338983,0.0013584556,0.000078606325,0.0001455375,0.00011328199],"domain_scores_gemma":[0.99365294,0.004694457,0.0010880955,0.00015705054,0.00033184997,0.0000755843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006154604,0.00006173088,0.00035970472,0.00015242986,0.00006908593,0.00006492287,0.00040120204,0.000045271776,0.0001782856],"category_scores_gemma":[0.0015331531,0.000043140055,0.0002588712,0.0000947217,0.00009935757,0.00017149573,0.000028485554,0.00010346848,0.000056744797],"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.00008245722,0.00012522958,0.000014575258,0.000012540185,0.00003110228,2.931953e-7,0.00059164845,0.00015592069,0.00033269866,0.99422455,0.0009547744,0.0034742197],"study_design_scores_gemma":[0.00028866038,0.00007571095,0.00015761254,0.000019678344,0.000032443688,0.00008149157,0.0036904402,0.002337615,0.00096796284,0.9760397,0.016252117,0.000056538855],"about_ca_topic_score_codex":1.5669166e-7,"about_ca_topic_score_gemma":0.000001300481,"teacher_disagreement_score":0.3586664,"about_ca_system_score_codex":0.000037099548,"about_ca_system_score_gemma":0.00004564128,"threshold_uncertainty_score":0.21330751},"labels":[],"label_agreement":null},{"id":"W2101795061","doi":"10.1109/icmla.2008.56","title":"Distributed Planning in Stochastic Games with Communication","year":2008,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computation; Computer science; Selection (genetic algorithm); Equilibrium selection; Mathematical optimization; Game theory; Distributed algorithm; Mathematical economics; Nash equilibrium; Distributed computing; Theoretical computer science; Repeated game; Mathematics; Artificial intelligence; Algorithm","score_opus":0.138641055932702,"score_gpt":0.38363046704667,"score_spread":0.24498941111396796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101795061","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.78036964,0.00003728457,0.211364,0.00065569405,0.000005347758,0.00009343848,0.000005436909,0.000034390145,0.0074347584],"genre_scores_gemma":[0.9977245,0.0000013231038,0.0012534318,0.00007282484,0.0000044434028,0.000023038529,0.000011132997,0.0000027599876,0.00090654235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991888,0.000083683684,0.00020919548,0.00014974955,0.00026951553,0.000099072226],"domain_scores_gemma":[0.9984659,0.00086282945,0.00006496325,0.00050140306,0.00006721055,0.000037722722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533666,0.00005153247,0.0000976182,0.00008437628,0.00013761074,0.000030200097,0.00040885148,0.000021052143,0.0001892044],"category_scores_gemma":[0.0002916436,0.000032789158,0.000013984046,0.0006119672,0.00013962016,0.00013402551,0.00004792422,0.000082948136,0.00017681989],"study_design_candidate":"observational","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.0004374252,0.00079936744,0.23741238,0.0000030955284,0.000031614738,0.000041240834,0.015952747,0.3092132,0.001050831,0.39372462,0.024497366,0.01683614],"study_design_scores_gemma":[0.0013202667,0.00011380729,0.76560706,0.00006091846,0.00000815305,0.00013123693,0.008396829,0.022405552,0.00060393946,0.1926412,0.008310264,0.00040077596],"about_ca_topic_score_codex":0.000018709597,"about_ca_topic_score_gemma":0.000031741452,"teacher_disagreement_score":0.52819467,"about_ca_system_score_codex":0.000011623069,"about_ca_system_score_gemma":0.000023878145,"threshold_uncertainty_score":0.22727208},"labels":[],"label_agreement":null},{"id":"W2103315867","doi":"10.7939/r3q23r282","title":"Regret Minimization in Games with Incomplete Information","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":510,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Counterfactual thinking; Nash equilibrium; Complete information; Computer science; Limit (mathematics); Domain (mathematical analysis); Mathematical optimization; Mathematical economics; Exploit; Repeated game; Correlated equilibrium; Best response; Minification; Game theory; Equilibrium selection; Mathematics; Machine learning","score_opus":0.060424007129280324,"score_gpt":0.36017560605424565,"score_spread":0.29975159892496533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103315867","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.52496016,0.0000037700952,0.3388018,0.00088907406,0.0000277668,0.0001757933,0.0000032636744,0.00003861333,0.13509974],"genre_scores_gemma":[0.99206924,7.721577e-7,0.0064392867,0.0004292942,0.00001168621,0.00000591582,0.0000098123,0.000001782935,0.0010322199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99900115,0.000032719254,0.0003695879,0.000103953666,0.00037998377,0.0001126212],"domain_scores_gemma":[0.99904156,0.0004286099,0.00011012109,0.00025136358,0.00012857013,0.000039757622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017774648,0.000050573988,0.000078118836,0.00026655206,0.000047373695,0.00008377623,0.00021236236,0.000028957958,0.0005190516],"category_scores_gemma":[0.00032867506,0.00003152631,0.000017041417,0.00094223465,0.000048801823,0.0007047402,0.00002490273,0.00004737811,0.00050000777],"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.00024557707,0.00007858936,0.08295858,0.0000036873055,0.0000062051954,0.0000024784335,0.0040917476,0.0023052483,0.00021608555,0.57851535,0.007369929,0.32420653],"study_design_scores_gemma":[0.0010803279,0.00011183744,0.55638427,0.000019272655,0.000005097484,0.000018162766,0.008328038,0.0055388906,0.0026902014,0.16735983,0.25817922,0.00028490002],"about_ca_topic_score_codex":0.000020818223,"about_ca_topic_score_gemma":0.00028004832,"teacher_disagreement_score":0.47342566,"about_ca_system_score_codex":0.000014749451,"about_ca_system_score_gemma":0.000018493312,"threshold_uncertainty_score":0.6426755},"labels":[],"label_agreement":null},{"id":"W2103448277","doi":"10.1287/mnsc.1100.1271","title":"Cooperation in Games with Forgetfulness","year":2010,"lang":"en","type":"article","venue":"Management Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Recall; Game theory; Computer science; Minimax; Microeconomics; Economics; Psychology; Cognitive psychology","score_opus":0.0372359645225242,"score_gpt":0.36215554236111125,"score_spread":0.32491957783858705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103448277","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.8948724,0.0000012852562,0.020335251,0.0010285799,0.00013047799,0.0002338771,6.4332806e-7,0.000024414388,0.08337303],"genre_scores_gemma":[0.99306744,5.478161e-7,0.0027807862,0.00018295541,0.00001275795,0.000055848355,3.621365e-7,0.0000023299342,0.0038969507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99842876,0.000021940416,0.00018389676,0.00041022303,0.00076047337,0.00019469588],"domain_scores_gemma":[0.99912983,0.00009171632,0.00005534699,0.00057611516,0.00009123398,0.000055730234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035070607,0.00006005254,0.0000700661,0.00033336622,0.00023891218,0.0003399549,0.001032866,0.000012856595,0.00024421915],"category_scores_gemma":[0.0001889244,0.000038728012,0.000010634193,0.00262959,0.00048920215,0.0005956042,0.00014732475,0.000086519736,0.0003181782],"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.000009213902,0.00005787017,0.009306325,0.000001459383,8.5340645e-7,0.000003758576,0.00022730771,0.0005903678,0.005115692,0.91125745,0.0003251947,0.07310451],"study_design_scores_gemma":[0.0009100445,0.00009187949,0.53993255,0.000021989392,0.000009590378,0.000011382555,0.0030478965,0.013523211,0.021661174,0.3096984,0.11061136,0.00048049656],"about_ca_topic_score_codex":0.0000057906427,"about_ca_topic_score_gemma":0.00017902549,"teacher_disagreement_score":0.60155904,"about_ca_system_score_codex":0.000010756183,"about_ca_system_score_gemma":0.000023141278,"threshold_uncertainty_score":0.40896434},"labels":[],"label_agreement":null},{"id":"W2103902366","doi":"","title":"Products of Several Relative Probabilities","year":2006,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Monomial; Consistency (knowledge bases); Mathematics; Product (mathematics); Binary number; Algebra over a field; Dispersion (optics); Pure mathematics; Mathematical economics; Applied mathematics; Discrete mathematics; Arithmetic; Geometry; Physics","score_opus":0.060312581751232136,"score_gpt":0.31939033438786735,"score_spread":0.25907775263663524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103902366","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.88516873,0.00063465204,0.001467784,0.0011641756,0.0018084511,0.0013097086,0.00064870465,0.00014472163,0.10765305],"genre_scores_gemma":[0.958071,0.000011291727,0.0072334614,0.000080762686,0.0004790813,0.00027613796,0.00006349332,0.00004254433,0.033742253],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940444,0.00066854263,0.002088487,0.0016780439,0.0010117104,0.0005088099],"domain_scores_gemma":[0.99212164,0.0022102152,0.0017804638,0.0026363914,0.0010782252,0.00017307761],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003685936,0.00057192723,0.0012442543,0.00057098246,0.00026017404,0.00019074716,0.0018248304,0.0005182017,0.0017876751],"category_scores_gemma":[0.0031117713,0.0005016842,0.0005031914,0.0005992988,0.0019291212,0.00045952425,0.0009851154,0.0010045624,0.0010524039],"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.00014059259,0.0008722105,0.54917985,0.00033069725,0.00034456913,0.000013724885,0.0050014984,0.004727105,0.00036945747,0.32487136,0.11097056,0.003178358],"study_design_scores_gemma":[0.00056421565,0.00010883469,0.11756673,0.00023955826,0.00012621138,0.000052580748,0.00070357067,0.00036857533,0.0022833315,0.835282,0.041612957,0.0010913945],"about_ca_topic_score_codex":0.00012158865,"about_ca_topic_score_gemma":0.00010604817,"teacher_disagreement_score":0.51041067,"about_ca_system_score_codex":0.0002520056,"about_ca_system_score_gemma":0.001355704,"threshold_uncertainty_score":0.99974346},"labels":[],"label_agreement":null},{"id":"W2104150068","doi":"10.1109/waina.2009.103","title":"A Multi-agent-based Approach to Improve Intrusion Detection Systems False Alarm Ratio by Using Honeypot","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Honeypot; Intrusion detection system; Computer science; Constant false alarm rate; False alarm; ALARM; Architecture; False positive rate; Scheme (mathematics); Artificial intelligence; Computer security; Data mining; Real-time computing; Engineering; Mathematics","score_opus":0.09399973267771922,"score_gpt":0.35476997044242625,"score_spread":0.26077023776470704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104150068","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.28296706,0.000028575285,0.7151511,0.00017721491,0.00016011538,0.0006307721,0.000013258311,0.00008488306,0.00078704447],"genre_scores_gemma":[0.98467267,5.6954855e-7,0.012707514,0.00059373135,0.00006991927,0.000058401547,0.000006198461,0.00000948249,0.0018815143],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977544,0.00021945464,0.0005470097,0.0006002773,0.0006263776,0.00025250143],"domain_scores_gemma":[0.99854344,0.00020060796,0.00017663176,0.000660553,0.0002184238,0.0002003497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017197354,0.0001659568,0.00023993377,0.00021781816,0.00034255942,0.00038840753,0.00044075883,0.00010048459,0.000044718054],"category_scores_gemma":[0.00043532558,0.0001224738,0.000083230814,0.0009322442,0.00003558021,0.00023276435,0.000046392364,0.00011403281,0.00035072048],"study_design_candidate":"bench_or_experimental","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.000035192224,0.00025009853,0.000017357528,0.0000023939147,0.000002991957,2.4524434e-7,0.00014399033,0.01089377,0.9547311,0.00093340344,0.0007317907,0.03225763],"study_design_scores_gemma":[0.00070300465,0.00015245589,0.00021884583,0.000011237023,0.00001724412,0.000006272991,0.0012422232,0.7862746,0.20486258,0.0009374975,0.0052732043,0.00030082813],"about_ca_topic_score_codex":0.00008417314,"about_ca_topic_score_gemma":0.000008660386,"teacher_disagreement_score":0.77538085,"about_ca_system_score_codex":0.00007653453,"about_ca_system_score_gemma":0.00003860126,"threshold_uncertainty_score":0.49943367},"labels":[],"label_agreement":null},{"id":"W2104516671","doi":"10.1109/hicss.1991.184198","title":"The graph model for conflicts as a negotiation support system","year":2002,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Negotiation; Computer science; Graph; Stability (learning theory); Outcome (game theory); Decision support system; Operations research; Management science; Knowledge management; Theoretical computer science; Artificial intelligence; Machine learning; Political science; Mathematical economics; Engineering; Mathematics; Law","score_opus":0.21974950807463994,"score_gpt":0.3886627703193874,"score_spread":0.16891326224474745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104516671","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.037353314,0.0000409682,0.6794674,0.005547246,0.00017360681,0.0008497845,0.000022614911,0.00015412894,0.27639094],"genre_scores_gemma":[0.9120161,0.0000036792696,0.0005084365,0.00035528882,0.00002790433,0.00012915216,0.0000014208726,0.000004395364,0.08695361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.00004489096,0.00031549518,0.00020632062,0.00037925618,0.0001504301],"domain_scores_gemma":[0.99803275,0.0011156931,0.00010962572,0.00047840492,0.00020027465,0.00006324902],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014775797,0.00006183381,0.000089113644,0.000047222333,0.0004380065,0.00019842989,0.00046163154,0.000035315534,0.0002919737],"category_scores_gemma":[0.00039117062,0.000032966975,0.000086321386,0.00025873826,0.000059243688,0.00012536248,0.000026515467,0.00003442215,0.0016716202],"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.000006459032,0.000013707769,0.000016659507,0.0000010915393,0.0000037987313,8.6790806e-8,0.0005244211,0.0008556534,0.00010657875,0.9657277,0.027007975,0.00573591],"study_design_scores_gemma":[0.00017661357,0.000026291833,0.000042783417,0.0000015389622,0.0000073129822,0.000005964338,0.0011929388,0.6904516,0.0003363349,0.2302909,0.077403575,0.00006414629],"about_ca_topic_score_codex":0.0000036332103,"about_ca_topic_score_gemma":0.0000118785665,"teacher_disagreement_score":0.8746628,"about_ca_system_score_codex":0.000010266401,"about_ca_system_score_gemma":0.000011785368,"threshold_uncertainty_score":0.9991057},"labels":[],"label_agreement":null},{"id":"W2105314806","doi":"10.1016/j.geb.2014.09.001","title":"Almost fully revealing cheap talk with imperfectly informed senders","year":2014,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Communication source; State (computer science); State space; Bounded function; Noise (video); Mathematical economics; Space (punctuation); Interval (graph theory); Principal (computer security); Computer science; Cheap talk; Mathematics; Telecommunications; Mathematical analysis; Combinatorics; Algorithm; Artificial intelligence; Statistics; Computer security","score_opus":0.04946268594684997,"score_gpt":0.3297721895888294,"score_spread":0.28030950364197943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105314806","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.99320036,0.000022785007,0.00045253712,0.00043997323,0.00008804477,0.00018750686,0.000017635588,0.000032895307,0.005558274],"genre_scores_gemma":[0.9973247,0.0000146855255,0.0005330915,0.00022523387,0.00007526681,0.00006427164,0.000005597251,0.0000108400645,0.0017462922],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99891895,0.00003628776,0.0003594589,0.0003515701,0.00010601275,0.00022770918],"domain_scores_gemma":[0.9989341,0.00030385895,0.0001593136,0.0004286262,0.00003050796,0.00014359102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084974006,0.00013124927,0.00022995216,0.00008180724,0.00017109013,0.00021337949,0.00026311952,0.00005999136,0.0005935454],"category_scores_gemma":[0.00006611124,0.000095280484,0.000052767802,0.000079517806,0.0001552375,0.00026134236,0.00006445979,0.0000942717,0.00029680587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019092037,0.00015291029,0.15788697,0.000021983818,0.00004867004,0.0000072913904,0.0033534463,0.0005780554,0.00433548,0.034810968,0.0072267596,0.79138654],"study_design_scores_gemma":[0.0032951527,0.0007244323,0.547123,0.0000682567,0.00023844226,0.00047344074,0.012491829,0.0036224164,0.006072871,0.01775474,0.40661585,0.0015195333],"about_ca_topic_score_codex":0.00007756842,"about_ca_topic_score_gemma":0.00021669688,"teacher_disagreement_score":0.78986704,"about_ca_system_score_codex":0.00002967248,"about_ca_system_score_gemma":0.000049444705,"threshold_uncertainty_score":0.6498906},"labels":[],"label_agreement":null},{"id":"W2105373009","doi":"","title":"Thinking before acting : intentions, logic, rational choice","year":2008,"lang":"en","type":"dissertation","venue":"UvA-DARE (University of Amsterdam)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Epistemology; Philosophy","score_opus":0.06913638550775851,"score_gpt":0.32907245672072055,"score_spread":0.259936071212962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105373009","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.79127455,0.00016262813,0.008426264,0.0018511483,0.0009874749,0.00063255825,0.00024421373,0.00017250558,0.19624864],"genre_scores_gemma":[0.9189727,0.000035973342,0.002584679,0.00010800744,0.00014215034,0.0000015879889,0.0008981751,0.000021737187,0.07723499],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99683154,0.00018161663,0.00044773918,0.0006435895,0.0016497235,0.00024578438],"domain_scores_gemma":[0.99652374,0.00068801787,0.0010078361,0.000667203,0.0009993202,0.00011388467],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008974408,0.00025172054,0.000471215,0.0005294783,0.0011948297,0.00011079968,0.0017355201,0.00031048912,0.0021282549],"category_scores_gemma":[0.0006960536,0.0002680799,0.0003931513,0.0007595464,0.00019060426,0.0006395953,0.00020112944,0.00045293279,0.00041130575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010241793,0.0012092522,0.019719303,0.00042581378,0.0008791386,0.00018109736,0.1370462,0.0006740389,0.0067382324,0.25697517,0.08653596,0.4885916],"study_design_scores_gemma":[0.00176874,0.00030172884,0.40500543,0.00075222907,0.00036963882,0.000051291896,0.19576877,0.000564732,0.00058561814,0.19810902,0.19536422,0.001358578],"about_ca_topic_score_codex":0.00014290698,"about_ca_topic_score_gemma":0.003122352,"teacher_disagreement_score":0.48723304,"about_ca_system_score_codex":0.00008829348,"about_ca_system_score_gemma":0.00025723822,"threshold_uncertainty_score":0.9999771},"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":"W2105888928","doi":"10.5555/2343896.2344007","title":"Detecting and identifying coalitions","year":2012,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Population; Risk analysis (engineering); Business","score_opus":0.39964016734424845,"score_gpt":0.4423090878843384,"score_spread":0.04266892054008997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105888928","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.9504225,0.0014170156,0.044473253,0.000064227315,0.0006872566,0.0005837023,0.00006517047,0.0000543071,0.0022325122],"genre_scores_gemma":[0.9955357,0.00004920459,0.0007338856,0.00009727835,0.00013618253,0.00007553087,0.0000035859819,0.000014878797,0.003353754],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99795514,0.00032788017,0.0004940006,0.00039998232,0.00045326393,0.00036974886],"domain_scores_gemma":[0.99847364,0.00049874425,0.00024785122,0.0003432373,0.00013682173,0.000299696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021223235,0.00016955298,0.0002526758,0.0001474619,0.00065417046,0.0003034175,0.0002215593,0.00007173748,0.000088166074],"category_scores_gemma":[0.00036626778,0.00013175755,0.000054805667,0.00027485527,0.00012468905,0.00056815584,0.00019874898,0.000117144555,0.0002660062],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001252159,0.0015700004,0.62489164,0.00017958262,0.00073034316,0.000032654727,0.052063826,0.00036182985,0.016907362,0.17304687,0.009824811,0.12026588],"study_design_scores_gemma":[0.002619103,0.00012059064,0.790402,0.00025909158,0.00019785675,0.00022083794,0.06607859,0.038963635,0.00073848746,0.0054907748,0.09380262,0.0011064362],"about_ca_topic_score_codex":0.0001847073,"about_ca_topic_score_gemma":0.000017037728,"teacher_disagreement_score":0.16755609,"about_ca_system_score_codex":0.000023365266,"about_ca_system_score_gemma":0.000009829195,"threshold_uncertainty_score":0.5372917},"labels":[],"label_agreement":null},{"id":"W2107402345","doi":"10.1109/ssst.2010.5442847","title":"Design of power controller for hybrid vehicle","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Automotive engineering; Controller (irrigation); Computer science; Power (physics); Hybrid power; Torque; Electric vehicle; Gasoline; Electric motor; Hybrid vehicle; Point (geometry); Control theory (sociology); Control (management); Engineering; Mathematics; Electrical engineering","score_opus":0.09676773474542517,"score_gpt":0.38358672744107014,"score_spread":0.286818992695645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107402345","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.2632134,0.0000040175955,0.7239871,0.0007617567,0.0000941678,0.00033190937,0.00000987817,0.0000178953,0.011579878],"genre_scores_gemma":[0.98317045,1.3516643e-7,0.010199276,0.00020727946,0.000016795246,0.00003606819,2.5563475e-7,0.0000031667764,0.006366554],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930274,0.000033541986,0.00023280985,0.00014281092,0.00019968789,0.00008839115],"domain_scores_gemma":[0.9972911,0.002085513,0.000076161785,0.00029633398,0.00020970471,0.000041198746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017674211,0.000040185507,0.000114874994,0.00004167466,0.000055258286,0.00002921786,0.0003382835,0.000020637868,0.0019345843],"category_scores_gemma":[0.00090267893,0.000025138716,0.000054827713,0.000107925254,0.000075789234,0.00006763074,0.000020395672,0.000043068914,0.00030727175],"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.00011614434,0.000089466965,0.00014844515,4.8034684e-7,0.000007844924,1.11208294e-7,0.00009645443,0.00012305827,0.5587162,0.39776447,0.023411535,0.019525811],"study_design_scores_gemma":[0.0007680758,0.00007901775,0.0009772147,6.7374503e-7,0.00000563494,0.0000018703339,0.0001350966,0.010318174,0.16754894,0.7739845,0.046104513,0.00007632049],"about_ca_topic_score_codex":0.0000013453667,"about_ca_topic_score_gemma":0.0000011192438,"teacher_disagreement_score":0.71995705,"about_ca_system_score_codex":0.0000010269791,"about_ca_system_score_gemma":0.000018108658,"threshold_uncertainty_score":0.9989778},"labels":[],"label_agreement":null},{"id":"W2107671063","doi":"10.1109/ijcnn.1991.155354","title":"On the complexity of computing equilibria for nonsymmetric analog networks","year":2002,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Vertex (graph theory); Simplex; Polynomial; Linear programming; Theoretical computer science; Computational complexity theory; Simplex algorithm; Time complexity; Algorithm; Mathematics; Mathematical optimization; Combinatorics","score_opus":0.40022235525284416,"score_gpt":0.40098340403341076,"score_spread":0.0007610487805665977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107671063","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.32115912,0.00003497822,0.56630003,0.0035477753,0.00010178558,0.0003995441,0.000013526857,0.000033970256,0.10840925],"genre_scores_gemma":[0.99652123,8.5130296e-7,0.0016516893,0.00051823887,0.000044863544,0.000005646887,9.807759e-7,0.0000033847991,0.0012530859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890757,0.00011776622,0.00034446004,0.00019196977,0.00029138094,0.00014684226],"domain_scores_gemma":[0.99099404,0.0082063805,0.00015614534,0.0004813698,0.00012463162,0.000037464426],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002048387,0.000062122075,0.00015405832,0.00010268856,0.00019387709,0.00005421058,0.00063418737,0.00002859579,0.0015858082],"category_scores_gemma":[0.0012888603,0.00003269633,0.00010151459,0.0012144467,0.0002802104,0.00003758143,0.00007744233,0.000067382585,0.0001571873],"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.0000055808528,0.000050882914,0.00013786672,4.7663414e-7,0.0000049377018,3.6212775e-8,0.00005605265,0.0017201708,0.000051877865,0.9587594,0.02481167,0.014401002],"study_design_scores_gemma":[0.000095680785,0.000040929495,0.00231274,0.00000241788,0.0000036306683,5.8004383e-7,0.00011476013,0.57041395,0.00016518093,0.4256282,0.0011808303,0.000041118405],"about_ca_topic_score_codex":0.000003785872,"about_ca_topic_score_gemma":0.000004955931,"teacher_disagreement_score":0.67536217,"about_ca_system_score_codex":0.0000052415744,"about_ca_system_score_gemma":0.000003373407,"threshold_uncertainty_score":0.9993269},"labels":[],"label_agreement":null},{"id":"W2110480729","doi":"10.2139/ssrn.4408035","title":"Common Assumption of Rationality","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Rationality; Mathematical economics; Economics; Positive economics; Epistemology; Philosophy","score_opus":0.15562195376423837,"score_gpt":0.4347131989142231,"score_spread":0.27909124514998473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110480729","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.86245793,0.0008332646,0.12676255,0.0064103086,0.0008992097,0.0003605484,0.00008373074,0.000076142525,0.0021163337],"genre_scores_gemma":[0.9912244,0.00078856864,0.0001237937,0.00003227714,0.0003026541,0.000017752422,0.000029604036,0.000016611539,0.007464341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957538,0.00058261905,0.0010819641,0.00037995144,0.0012809819,0.0009206634],"domain_scores_gemma":[0.99671215,0.0008788996,0.0011472702,0.00072580547,0.0004650115,0.00007085498],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.019194774,0.0001647876,0.00040570283,0.00029629486,0.0002074748,0.00015113219,0.001356345,0.00019847539,0.0001683009],"category_scores_gemma":[0.000979644,0.00013186249,0.00032281157,0.00039953482,0.00011568213,0.00012347219,0.00037546185,0.0030315712,0.00046793636],"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.000041532123,0.000086983295,0.0038414751,0.000007302747,0.00011840377,6.791133e-7,0.00015691503,0.0031832135,0.00037335837,0.9647031,0.0010184592,0.026468603],"study_design_scores_gemma":[0.00013074285,0.000040971412,0.008835761,0.000022428076,0.000030009256,0.000032939337,0.00063419965,0.0003564013,0.00015132307,0.98843884,0.0012124842,0.00011388705],"about_ca_topic_score_codex":0.000053236614,"about_ca_topic_score_gemma":0.0007382171,"teacher_disagreement_score":0.12876649,"about_ca_system_score_codex":0.00040360697,"about_ca_system_score_gemma":0.0024242795,"threshold_uncertainty_score":0.9992685},"labels":[],"label_agreement":null},{"id":"W2110830122","doi":"","title":"Bayesian Action-Graph Games","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bayesian game; Bayesian probability; Graph; Combinatorial game theory; Graphical model; Probabilistic logic; Bayesian programming; Theoretical computer science; Independence (probability theory); Artificial intelligence; Variable-order Bayesian network; Game theory; Bayesian inference; Mathematics; Mathematical economics; Repeated game","score_opus":0.09511594058823794,"score_gpt":0.4168386346687905,"score_spread":0.32172269408055254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110830122","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.6036786,0.0000034055672,0.07393008,0.0035592346,0.00040800808,0.0000890351,0.0000031934558,0.00010732944,0.31822112],"genre_scores_gemma":[0.97028095,9.731084e-7,0.0027804864,0.0003288615,0.000081361206,0.000011941398,5.5348374e-7,0.0000030918593,0.026511803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00003212176,0.00018002508,0.00020804188,0.00031103223,0.00010393074],"domain_scores_gemma":[0.998728,0.0005028245,0.000048788297,0.0005521127,0.00008378102,0.000084521904],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000847186,0.000051146646,0.000071515446,0.00010184833,0.00013383181,0.00012684535,0.00042807555,0.00004198018,0.013212403],"category_scores_gemma":[0.00043755828,0.000032657492,0.000060520484,0.0004548041,0.000096713455,0.00015761983,0.000032446627,0.0001277054,0.0031298632],"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.000005490067,0.000056302597,0.005230196,3.547973e-7,0.0000042759475,4.841394e-7,0.00014287847,0.000009072026,0.039857727,0.7652584,0.035685398,0.15374945],"study_design_scores_gemma":[0.000053525615,0.000006427703,0.011616628,3.086698e-7,0.000001917833,0.0000056335775,0.00042633002,0.00018658109,0.007485222,0.70109564,0.2790594,0.00006240801],"about_ca_topic_score_codex":0.0000098455685,"about_ca_topic_score_gemma":0.00018012682,"teacher_disagreement_score":0.36660233,"about_ca_system_score_codex":0.00000138414,"about_ca_system_score_gemma":0.000016132477,"threshold_uncertainty_score":0.99764633},"labels":[],"label_agreement":null},{"id":"W2111071057","doi":"10.1137/060660345","title":"Distributed Selfish Load Balancing","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Computer science; Convergence (economics); Binary logarithm; Martingale (probability theory); Distributed algorithm; Load balancing (electrical power); Resource allocation; Upper and lower bounds; Mathematical optimization; Distributed computing; Mathematics; Combinatorics; Applied mathematics; Economics","score_opus":0.05869518664568,"score_gpt":0.38548288483299764,"score_spread":0.3267876981873176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111071057","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.6218022,0.00003419864,0.36505982,0.0007636981,0.00047707776,0.000049442922,0.0000033128692,0.00004545929,0.011764808],"genre_scores_gemma":[0.99626714,0.0000014852992,0.0022404662,0.0005472607,0.0006938978,1.6288894e-7,0.0000010674785,0.000007933664,0.00024056261],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973463,0.00014446242,0.0007409467,0.00024970027,0.0011370463,0.00038157112],"domain_scores_gemma":[0.9963131,0.0023073398,0.00042961436,0.00030406067,0.00041033013,0.00023553308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011467338,0.00011560637,0.00019771022,0.00014449196,0.00066668,0.0003744749,0.0006486035,0.000051711406,0.00018017126],"category_scores_gemma":[0.0019690564,0.00008550731,0.00012756293,0.0007748207,0.000047392212,0.00012795968,0.00009207082,0.00048372356,0.0005489864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020268362,0.00040268805,0.028839866,0.0000058193914,0.00007270098,0.00035669337,0.0025273082,0.022224342,0.0059718145,0.06658234,0.040037457,0.8327763],"study_design_scores_gemma":[0.0023088583,0.00042800058,0.25729066,0.00032210935,0.00003811411,0.002326264,0.0051353136,0.028040053,0.007882068,0.28497916,0.4102496,0.0009997825],"about_ca_topic_score_codex":0.0000012254981,"about_ca_topic_score_gemma":0.0000027198278,"teacher_disagreement_score":0.8317765,"about_ca_system_score_codex":0.00012477684,"about_ca_system_score_gemma":0.00007700012,"threshold_uncertainty_score":0.70562935},"labels":[],"label_agreement":null},{"id":"W2111589951","doi":"10.2200/s00108ed1v01y200802aim003","title":"Essentials of Game Theory: A Concise Multidisciplinary Introduction","year":2008,"lang":"en","type":"article","venue":"Synthesis lectures on artificial intelligence and machine learning","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":381,"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":"Game theory; Field (mathematics); Multidisciplinary approach; Computer science; Notation; Data science; Epistemology; Management science; Sociology; Social science; Mathematical economics; Mathematics; Engineering","score_opus":0.12535343132650154,"score_gpt":0.36958904537933407,"score_spread":0.24423561405283253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111589951","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.87204057,0.0002593399,0.122753516,0.002615804,0.00018591783,0.00026762814,0.0000122553,0.00008352003,0.0017814579],"genre_scores_gemma":[0.99873656,0.00010486456,0.00031980028,0.00005874716,0.0002369131,0.000027006909,0.0000032906275,0.000015425188,0.00049738376],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99730504,0.0007637698,0.00065814727,0.0005328646,0.0005145208,0.0002256577],"domain_scores_gemma":[0.99517745,0.0038295418,0.0003327509,0.0004075639,0.00016154369,0.0000911272],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025113167,0.00018765354,0.00037199288,0.0003055862,0.00049853296,0.00006178091,0.00035387964,0.00008768167,0.0012442537],"category_scores_gemma":[0.0080735115,0.00013698034,0.0001286514,0.00053361413,0.0005299609,0.00013055047,0.00009772011,0.00032227868,0.0002864331],"study_design_candidate":"bench_or_experimental","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.00086922734,0.00031745274,0.0010618101,0.000012993376,0.000051268213,0.000010512568,0.005530635,0.033793777,0.071001396,0.22859338,0.00016682483,0.65859073],"study_design_scores_gemma":[0.00002911664,0.00020088252,0.0011536761,0.000024190196,0.000034118893,0.000037661226,0.0015362767,0.007816319,0.5940843,0.39200947,0.0028361736,0.00023778352],"about_ca_topic_score_codex":0.000030856016,"about_ca_topic_score_gemma":0.00002036685,"teacher_disagreement_score":0.6583529,"about_ca_system_score_codex":0.000011750503,"about_ca_system_score_gemma":0.0000323911,"threshold_uncertainty_score":0.9996687},"labels":[],"label_agreement":null},{"id":"W2111733430","doi":"10.2139/ssrn.556917","title":"Sequential Estimation of Dynamic Discrete Games","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":237,"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":"Sequential game; Estimation; Computer science; Discrete choice; Mathematical economics; Mathematical optimization; Mathematics; Economics; Game theory; Machine learning","score_opus":0.017367444902957323,"score_gpt":0.3451045171239644,"score_spread":0.32773707222100706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111733430","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.65303713,0.00037146386,0.3435562,0.0006917012,0.0000722552,0.000066253866,0.0000051289853,0.000014140292,0.0021857328],"genre_scores_gemma":[0.99512446,0.000064899396,0.0005429193,0.000011777595,0.00007114028,0.0000031767997,0.0000046033542,0.00000733646,0.004169715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784297,0.00014006822,0.0005260389,0.00017000185,0.00057329057,0.00074762484],"domain_scores_gemma":[0.99902904,0.00019032793,0.0003653039,0.00025307285,0.00012700036,0.000035279794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036469467,0.00008596683,0.0001562108,0.00016021087,0.00016159224,0.00008332482,0.0004705037,0.00004149038,0.00012537137],"category_scores_gemma":[0.0002056669,0.00006302898,0.00012690962,0.00037915146,0.00010484538,0.00025118087,0.000031254036,0.0004901326,0.00011232332],"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.000029048311,0.000043877597,0.00027285848,9.626394e-7,0.00001976243,5.3464333e-7,0.000054353433,0.0050972537,0.0046042744,0.8997349,0.00012999875,0.09001216],"study_design_scores_gemma":[0.00020109583,0.00006451463,0.0019402786,0.0000047419867,0.000015906691,0.00012109023,0.000442743,0.006986203,0.0006738764,0.98905075,0.00042981308,0.000069001726],"about_ca_topic_score_codex":0.000032247415,"about_ca_topic_score_gemma":0.00027411047,"teacher_disagreement_score":0.34301326,"about_ca_system_score_codex":0.00017991923,"about_ca_system_score_gemma":0.00056052674,"threshold_uncertainty_score":0.2570247},"labels":[],"label_agreement":null},{"id":"W2112471611","doi":"10.1007/0-8176-4501-2_1","title":"Stochastic Games with Imperfect Monitoring","year":2007,"lang":"en","type":"book-chapter","venue":"Annals of the International Society of Dynamic Games","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Imperfect; Exposition (narrative); Perfect information; Mathematical economics; Computer science; Mathematics; Philosophy; Art","score_opus":0.12119890746253802,"score_gpt":0.399267020477472,"score_spread":0.27806811301493395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112471611","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3679818,0.004046627,0.028994052,0.0297208,0.0035047003,0.0021360973,0.0015747966,0.00017782283,0.5618633],"genre_scores_gemma":[0.72362584,0.00019947768,0.0011109499,0.0002372036,0.00014933749,0.000008564052,0.00000917147,0.00003246664,0.27462697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965856,0.000022127851,0.0008065841,0.0004234732,0.0019639519,0.00019826838],"domain_scores_gemma":[0.9955274,0.0012725507,0.0012933168,0.00078015967,0.0010646494,0.000061961284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015806071,0.00027719693,0.0004705635,0.00012632216,0.000098974335,0.000054234675,0.0021766364,0.0001977438,0.000257353],"category_scores_gemma":[0.00025873454,0.00017439725,0.0008650817,0.0001232468,0.00068026205,0.000121657875,0.00034728306,0.00036222098,0.000036487083],"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.0008929401,0.0006591214,0.0030033097,0.00024197834,0.007540746,0.0000062218287,0.007527906,0.017263582,0.009625636,0.5604016,0.08278765,0.31004933],"study_design_scores_gemma":[0.0007567774,0.00031480024,0.012322724,0.0020716263,0.00023363663,0.000046931324,0.0018754875,0.0051614363,0.0059465324,0.90402913,0.066284336,0.000956605],"about_ca_topic_score_codex":0.000019844438,"about_ca_topic_score_gemma":0.000010841151,"teacher_disagreement_score":0.35564405,"about_ca_system_score_codex":0.000048321795,"about_ca_system_score_gemma":0.00013301361,"threshold_uncertainty_score":0.7111714},"labels":[],"label_agreement":null},{"id":"W2112488653","doi":"10.2139/ssrn.626641","title":"Hierarchies of Belief and Interim Rationalizability","year":2004,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":34,"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":"Rationalizability; Interim; Belief revision; Computer science; Political science; Epistemology; Philosophy; Rationality; Artificial intelligence; Law","score_opus":0.04346391125052802,"score_gpt":0.3661917563913416,"score_spread":0.3227278451408136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112488653","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.93291545,0.00065031333,0.06304486,0.002081638,0.000038353362,0.000061489874,0.000003158012,0.0000070963347,0.0011976222],"genre_scores_gemma":[0.99870175,0.00028030144,0.00037199495,0.000051139876,0.000049092952,0.0000026655107,6.007654e-7,0.000003436778,0.0005390396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998526,0.000108736014,0.00038335638,0.00015233782,0.00036176626,0.0004678449],"domain_scores_gemma":[0.9991779,0.00025631645,0.00017113026,0.00019335227,0.00014996412,0.000051393527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043632635,0.00006339262,0.00013299027,0.000106163505,0.00016069427,0.000053654057,0.0003200325,0.000026446693,0.000072313116],"category_scores_gemma":[0.0005830131,0.00004514207,0.000061516956,0.00024607783,0.00021745115,0.00018461158,0.00004949122,0.00044175924,0.000022777287],"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.000024588542,0.000039750732,0.00088037,7.4731327e-7,0.000013685159,1.3259208e-7,0.00032897084,0.00012371058,0.0018031326,0.9804321,0.000013344456,0.016339488],"study_design_scores_gemma":[0.00025654738,0.00013636981,0.0031284657,0.0000046155765,0.0000049445257,0.00012718696,0.0012659853,0.000011207908,0.0009775481,0.9930479,0.0009946058,0.00004461723],"about_ca_topic_score_codex":0.000013114421,"about_ca_topic_score_gemma":0.00015240628,"teacher_disagreement_score":0.06578626,"about_ca_system_score_codex":0.00014661199,"about_ca_system_score_gemma":0.000959835,"threshold_uncertainty_score":0.19192486},"labels":[],"label_agreement":null},{"id":"W2113496308","doi":"10.5555/1838206.1838234","title":"Pure Nash equilibria: complete characterization of hard and easy graphical games","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Treewidth; Bounded function; Mathematics; Discrete mathematics; Combinatorics; Nash equilibrium; Parameterized complexity; Complexity class; Partial k-tree; 1-planar graph; Time complexity; Pathwidth; Chordal graph; Graph; Mathematical economics; Line graph","score_opus":0.06612174915634916,"score_gpt":0.3348597164039826,"score_spread":0.26873796724763344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113496308","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.99052453,0.000002728561,0.004045305,0.0023557255,0.00009850151,0.000112658214,0.00003206523,0.000028345192,0.0028001193],"genre_scores_gemma":[0.99679947,0.000004045386,0.0011419455,0.00018709326,0.000045711855,0.000007756,0.000011938393,0.0000041486533,0.0017979011],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989673,0.00006026665,0.00030467685,0.00024166616,0.0003271977,0.00009890222],"domain_scores_gemma":[0.99894416,0.00033001433,0.00011827415,0.00039400518,0.00014081667,0.00007270565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078966166,0.000068251815,0.00015909008,0.000097878095,0.00006803345,0.00008681294,0.0003073129,0.00006556046,0.0008686122],"category_scores_gemma":[0.00031622636,0.000046677556,0.000045268942,0.00036115566,0.00026313518,0.00019114483,0.000089067566,0.0001085977,0.00009313649],"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.000006357711,0.00001370363,0.0032504117,0.0000011602641,0.0000021862793,1.5001397e-7,0.000047811798,6.3665055e-8,0.6536518,0.33902928,0.000106680614,0.0038904063],"study_design_scores_gemma":[0.0002715821,0.00004397816,0.46971908,0.0000053507188,0.0000095068735,0.000017940856,0.00012176233,0.00074710813,0.022511074,0.45558536,0.05081754,0.00014973099],"about_ca_topic_score_codex":0.000002295393,"about_ca_topic_score_gemma":0.000011204107,"teacher_disagreement_score":0.6311407,"about_ca_system_score_codex":9.567619e-7,"about_ca_system_score_gemma":0.000012887591,"threshold_uncertainty_score":0.9510694},"labels":[],"label_agreement":null},{"id":"W2113636442","doi":"10.1109/infocom.2006.255","title":"Asymptotics of Efficiency Loss in Competitive Market Mechanisms","year":2006,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounded function; Computer science; Mathematical optimization; Function (biology); Zero (linguistics); Mathematics","score_opus":0.028253922536088112,"score_gpt":0.32383778724874873,"score_spread":0.2955838647126606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113636442","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32171467,0.000008431167,0.14297742,0.00033826265,0.000047683734,0.00013080405,0.000014250253,0.000017694727,0.53475076],"genre_scores_gemma":[0.98871005,8.0886383e-7,0.0033332994,0.000055550692,0.000009695401,0.000004661419,0.0000010617794,0.0000028788918,0.007881996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871105,0.00010671953,0.0004159466,0.00020256883,0.00043512014,0.00012857217],"domain_scores_gemma":[0.99847007,0.0009737897,0.00010414275,0.00030606895,0.00012049174,0.000025439585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015893704,0.00006151676,0.00014993724,0.00014271881,0.00003571171,0.000023178056,0.00040958327,0.00003442982,0.0024104074],"category_scores_gemma":[0.00022246131,0.00004446677,0.00004499592,0.00071826903,0.00012335004,0.000062166626,0.000062934945,0.00005054677,0.00022288815],"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.000006721519,0.000119003205,0.0018587942,6.6786276e-7,6.199758e-7,0.0000011146934,0.000043892716,0.00023372394,0.0013771498,0.9952807,0.0005436367,0.0005340177],"study_design_scores_gemma":[0.00019691057,0.000028760012,0.040715877,0.000005657304,0.0000019837487,0.0000025096565,0.0006647109,0.0017568418,0.01444946,0.940455,0.0016498307,0.00007242361],"about_ca_topic_score_codex":0.000036063782,"about_ca_topic_score_gemma":0.00010073002,"teacher_disagreement_score":0.66699535,"about_ca_system_score_codex":0.000010408122,"about_ca_system_score_gemma":0.000022743401,"threshold_uncertainty_score":0.99850154},"labels":[],"label_agreement":null},{"id":"W2114238237","doi":"","title":"Strategic and extensive games","year":2006,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rationalizability; Equilibrium selection; Sequential equilibrium; Mathematical economics; Bayesian game; Nash equilibrium; Perfect information; Best response; Correlated equilibrium; Solution concept; Extensive-form game; Game theory; Complete information; Economics; Epsilon-equilibrium; Repeated game","score_opus":0.14758817208127145,"score_gpt":0.42016312985732024,"score_spread":0.2725749577760488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114238237","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.7465423,0.00017308931,0.0000075736475,0.00061455625,0.000118630785,0.00043120945,0.000063420586,0.00002112233,0.2520281],"genre_scores_gemma":[0.98801315,0.0015058881,0.00054383435,0.00007360424,0.00016119066,0.00016848418,0.00002162448,0.000025333886,0.009486874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964146,0.00050893315,0.0007998896,0.0012445349,0.000495703,0.0005363408],"domain_scores_gemma":[0.9950274,0.0027550582,0.00024429872,0.0014909566,0.00030378843,0.00017849139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005275432,0.0002340501,0.00050608045,0.0006030201,0.00019150406,0.0005931637,0.0011398748,0.00032913339,0.00019449899],"category_scores_gemma":[0.0010626075,0.0002094374,0.00012220175,0.00023564888,0.00074873265,0.00009866614,0.0013476496,0.0012515617,0.00008740904],"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.00010887386,0.00025314488,0.008143654,0.000054582943,0.00005715465,0.000060216695,0.0006874457,0.014868784,0.0003837878,0.07352186,0.0010705212,0.90079],"study_design_scores_gemma":[0.00029120952,0.000046689274,0.023664758,0.000060052967,0.000005377079,0.000016165724,0.0026263986,0.0066280398,0.00010178564,0.94337636,0.022823146,0.00036002084],"about_ca_topic_score_codex":0.00007189985,"about_ca_topic_score_gemma":0.00026218637,"teacher_disagreement_score":0.90042996,"about_ca_system_score_codex":0.00017076904,"about_ca_system_score_gemma":0.00038199336,"threshold_uncertainty_score":0.85406095},"labels":[],"label_agreement":null},{"id":"W2114282507","doi":"10.1007/s00224-013-9462-3","title":"Braess’s Paradox for Flows over Time","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"University of Waterloo","funders":"","keywords":"Transpose; Conjecture; Flow (mathematics); Network topology; Context (archaeology); Mathematics; Computer science; Flow network; Mathematical economics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Physics; Geometry; Geology; Quantum mechanics","score_opus":0.06699727172578591,"score_gpt":0.35278108489692356,"score_spread":0.28578381317113766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114282507","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.83976614,0.00011014423,0.15011881,0.0001143752,0.00037199628,0.00082043814,0.000015844227,0.00008011683,0.008602131],"genre_scores_gemma":[0.9925364,2.3566322e-7,0.00083430315,0.00006526922,0.0002060927,0.000037698937,0.0000028465254,0.000014402868,0.006302713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977383,0.00047899282,0.0007697273,0.00031652008,0.00045519244,0.00024127329],"domain_scores_gemma":[0.99302447,0.005446091,0.00043486,0.0007048006,0.00030814874,0.00008165709],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005869091,0.00012940736,0.0004005496,0.000119975084,0.00017308186,0.00015377671,0.00082164793,0.000064916174,0.00044655846],"category_scores_gemma":[0.00067374646,0.00009498246,0.00014575651,0.00029075364,0.00012102744,0.00013964686,0.000091411435,0.00006617502,0.0018011195],"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.000042301002,0.00008829107,0.00029589926,0.000040967036,0.000044124583,2.3258038e-7,0.0015234861,0.0056151273,0.012048214,0.9339414,0.017127145,0.029232794],"study_design_scores_gemma":[0.00052621344,0.00008749913,0.003457667,0.000098826626,0.000019725721,0.000011466751,0.00078004913,0.17460054,0.0009141671,0.80883694,0.010411493,0.00025541132],"about_ca_topic_score_codex":0.000014837721,"about_ca_topic_score_gemma":2.554672e-7,"teacher_disagreement_score":0.16898541,"about_ca_system_score_codex":0.000013406237,"about_ca_system_score_gemma":0.000026255191,"threshold_uncertainty_score":0.9989761},"labels":[],"label_agreement":null},{"id":"W2116308931","doi":"10.1016/j.jet.2013.09.014","title":"Optimal limited authority for principal","year":2013,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"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":"Principal (computer security); Stochastic game; Ex-ante; Preference; Mathematical economics; Principal–agent problem; Set (abstract data type); Microeconomics; Partition (number theory); State space; Economics; Mathematical optimization; Computer science; Mathematics; Statistics; Finance; Combinatorics","score_opus":0.10073542660256421,"score_gpt":0.37898491798298894,"score_spread":0.27824949138042476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116308931","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.96371514,0.000053150252,0.029840697,0.0011627629,0.00045719196,0.00018870686,0.000012175777,0.000007782875,0.0045624245],"genre_scores_gemma":[0.98992896,0.000003964061,0.0058620176,0.00013574425,0.00040389673,0.000014350298,4.448986e-7,0.0000078600015,0.0036427814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859136,0.00016904534,0.0008052089,0.0001493872,0.00012486229,0.00016013643],"domain_scores_gemma":[0.99599487,0.0026360212,0.0006906526,0.00030929988,0.00022399936,0.00014516935],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0060850214,0.00008335874,0.0002600925,0.00015920922,0.00010606295,0.00016134056,0.00073121616,0.00005698438,0.0025229559],"category_scores_gemma":[0.0011397403,0.00005897591,0.00023679827,0.00006327272,0.00010077239,0.00047008053,0.000055562057,0.00013802783,0.00096766144],"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.00016801342,0.00007953092,0.0006966869,0.0000020521177,0.000054458247,8.334469e-7,0.00044614798,0.0029183123,0.0013412451,0.94298995,0.013587311,0.037715483],"study_design_scores_gemma":[0.0004212403,0.0001075648,0.0044763032,0.0000045222264,0.000016152453,0.000040910953,0.0008920581,0.0015360627,0.00091692625,0.953004,0.038498286,0.00008598517],"about_ca_topic_score_codex":0.0000012667201,"about_ca_topic_score_gemma":9.4098505e-7,"teacher_disagreement_score":0.037629496,"about_ca_system_score_codex":0.000058816997,"about_ca_system_score_gemma":0.00011471456,"threshold_uncertainty_score":0.9998102},"labels":[],"label_agreement":null},{"id":"W2116536596","doi":"10.5167/uzh-174773","title":"Contagion through learning","year":2008,"lang":"en","type":"article","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Global game; Repeated game; Iterated function; Computer science; Mathematical economics; Complete information; Microeconomics; Economics; Game theory; Mathematics","score_opus":0.0909176969357741,"score_gpt":0.3076352428908783,"score_spread":0.21671754595510417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116536596","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.8194582,0.00008486978,0.03498983,0.00036960898,0.000062140025,0.00024164586,0.000009344999,0.00003150996,0.14475289],"genre_scores_gemma":[0.9718442,0.00009208953,0.0073368633,0.00005068384,0.000027947473,5.9820024e-7,0.000005372247,0.0000059148615,0.020636322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980433,0.0008032277,0.0002131378,0.0004290011,0.00035051515,0.00016081588],"domain_scores_gemma":[0.9976354,0.00147628,0.00028105648,0.00037489983,0.00012363534,0.00010872796],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010936741,0.00010981464,0.00028153037,0.000095322204,0.001470046,0.00006746535,0.0010137446,0.000047560712,0.00014905765],"category_scores_gemma":[0.00014432873,0.000106773,0.00008504957,0.00035763188,0.0005331047,0.0007064733,0.00067667576,0.00019015119,0.00009504361],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017904212,0.0012573464,0.26553106,0.000055737935,0.00035084996,0.0010266183,0.10199128,0.0010873424,0.10811671,0.3741713,0.122259624,0.022361718],"study_design_scores_gemma":[0.0022149088,0.00061367697,0.30477297,0.00006938069,0.00009390244,0.00060021237,0.028845118,0.0010399816,0.0033588447,0.15983659,0.49787918,0.00067525206],"about_ca_topic_score_codex":0.00032473708,"about_ca_topic_score_gemma":0.00002234327,"teacher_disagreement_score":0.37561956,"about_ca_system_score_codex":0.000010696119,"about_ca_system_score_gemma":0.000055853685,"threshold_uncertainty_score":0.9998299},"labels":[],"label_agreement":null},{"id":"W2116857805","doi":"10.1177/1059712314526261","title":"Decentralized strategy selection with learning automata for multiple pursuer–evader games","year":2014,"lang":"en","type":"article","venue":"Adaptive Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Royal Military College of Canada","funders":"","keywords":"Computer science; Pursuer; sort; Task (project management); Markov decision process; Learning automata; Automaton; Selection (genetic algorithm); Artificial intelligence; Process (computing); Order (exchange); Theoretical computer science; Markov process; Mathematical optimization; Mathematics","score_opus":0.12440097676812849,"score_gpt":0.3846298703034385,"score_spread":0.26022889353531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116857805","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.73573834,0.000016481697,0.2621995,0.00020857838,0.000060877217,0.0008164547,0.000019629895,0.00017587887,0.00076429365],"genre_scores_gemma":[0.9868211,0.0000017385194,0.009124255,0.00003852948,0.00005528169,0.0005280871,0.0000144406185,0.000022026055,0.0033945376],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99817014,0.00023201009,0.00031833796,0.0004954858,0.0004714447,0.00031257854],"domain_scores_gemma":[0.99786717,0.0011217359,0.00021452653,0.0003098716,0.00036859643,0.00011809628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010563012,0.00016371801,0.00023313536,0.000105860236,0.00035347286,0.00017155937,0.00035672446,0.0000763903,0.00021349624],"category_scores_gemma":[0.00054466375,0.00011771952,0.00008551004,0.0004152141,0.00012833912,0.00028770813,0.000033528126,0.00015558356,0.00019557295],"study_design_candidate":"observational","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.001429541,0.0010511201,0.12570773,0.000007943831,0.00007386581,0.0000033232304,0.0011593996,0.014676524,0.03959442,0.14832717,0.0031969426,0.66477203],"study_design_scores_gemma":[0.008218638,0.003906258,0.648148,0.00005784275,0.0004915177,0.00007202397,0.006450921,0.112928286,0.031276334,0.034348916,0.1527192,0.0013820749],"about_ca_topic_score_codex":0.000029817402,"about_ca_topic_score_gemma":0.00009501608,"teacher_disagreement_score":0.6633899,"about_ca_system_score_codex":0.000030680214,"about_ca_system_score_gemma":0.000051965322,"threshold_uncertainty_score":0.4800463},"labels":[],"label_agreement":null},{"id":"W2118448361","doi":"10.2139/ssrn.535763","title":"Comparative Cheap Talk","year":2005,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cheap talk; Business; Computer science; Economics; Mathematical economics","score_opus":0.07206379230641807,"score_gpt":0.3984019128855157,"score_spread":0.3263381205790976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118448361","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.90978813,0.0015154917,0.043380924,0.008229867,0.00011132743,0.00012993412,0.0000031475195,0.000039336806,0.03680184],"genre_scores_gemma":[0.98335254,0.00014291223,0.0002657443,0.00022525323,0.00040443998,0.000005144738,6.7681094e-7,0.000005708489,0.015597607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742955,0.00016784827,0.00040025671,0.00020992248,0.0005759897,0.0012164197],"domain_scores_gemma":[0.9989354,0.0003077482,0.00020116252,0.0002840924,0.00016746843,0.00010411488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005141949,0.000101727346,0.000194546,0.00012281242,0.00033841276,0.00014718155,0.00073305744,0.000040674324,0.0006791665],"category_scores_gemma":[0.00017564508,0.00007164411,0.000115689254,0.00042566238,0.00008917659,0.00032707257,0.000040628012,0.0011062387,0.0023091019],"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.000029341432,0.00008600358,0.00016599512,1.315727e-7,0.000036231493,6.102629e-7,0.00054343627,0.00034212184,0.0014160414,0.91064173,0.0019394911,0.084798895],"study_design_scores_gemma":[0.00023896844,0.00007370553,0.0005072489,0.0000017800683,0.0000076165265,0.00032386827,0.0032401143,0.00028839646,0.0009628339,0.86764354,0.12661898,0.00009294366],"about_ca_topic_score_codex":0.0000035353248,"about_ca_topic_score_gemma":0.00033304509,"teacher_disagreement_score":0.1246795,"about_ca_system_score_codex":0.00027708622,"about_ca_system_score_gemma":0.0007170243,"threshold_uncertainty_score":0.99846774},"labels":[],"label_agreement":null},{"id":"W2118461068","doi":"10.1109/acc.2005.1470513","title":"Efficient computation of fair communication equilibria in generalized coordination games","year":2005,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Computer science; Repeated game; Coordination game; Computation; Mathematical economics; Sequential game; Game theory; Joint (building); Action (physics); Non-cooperative game; Class (philosophy); Process (computing); Combinatorial game theory; Equilibrium selection; Mathematical optimization; Theoretical computer science; Distributed computing; Mathematics; Artificial intelligence; Algorithm; Engineering","score_opus":0.08007515558710172,"score_gpt":0.40042678360792755,"score_spread":0.32035162802082584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118461068","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.94204336,0.000074477444,0.043918688,0.002980049,0.000020693935,0.0002015647,0.000002892338,0.000030244793,0.010728029],"genre_scores_gemma":[0.98941946,0.0000026281555,0.00960273,0.000088509056,0.000012964779,0.000018433077,0.000008134372,0.0000040602567,0.0008430513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983811,0.00029575263,0.00061572634,0.00019296638,0.00041464306,0.0000998146],"domain_scores_gemma":[0.99850804,0.00058176706,0.00023118958,0.00042546802,0.0002213215,0.000032192947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020611063,0.00006668704,0.0001611101,0.00024130786,0.00005289905,0.00004333671,0.00040578222,0.000041194828,0.00027754405],"category_scores_gemma":[0.00033046913,0.000053551437,0.00004794698,0.00076852133,0.00009391382,0.00011758257,0.00008268838,0.000056544217,0.0001693279],"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.000060786424,0.00040198624,0.0027687722,0.0000042365486,0.000006767438,1.2373062e-7,0.0021209233,0.30442494,0.04178685,0.4891744,0.002680242,0.15656999],"study_design_scores_gemma":[0.0008045518,0.000021439328,0.02879062,0.000013641006,0.0000043208042,0.0000012834737,0.00066414225,0.87455386,0.0069138748,0.08574112,0.002384857,0.00010628509],"about_ca_topic_score_codex":0.000033246564,"about_ca_topic_score_gemma":0.00007941416,"teacher_disagreement_score":0.5701289,"about_ca_system_score_codex":0.000033927314,"about_ca_system_score_gemma":0.000023550363,"threshold_uncertainty_score":0.30389127},"labels":[],"label_agreement":null},{"id":"W2118852759","doi":"","title":"The Desire for Revenge and the Dynamics of Conflicts","year":2008,"lang":"en","type":"preprint","venue":"Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Adversary; State (computer science); Stock (firearms); Differential game; Economics; Political science; History; Computer security; Mathematics; Computer science","score_opus":0.08007642225953603,"score_gpt":0.3019202609211881,"score_spread":0.22184383866165208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118852759","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.8207673,0.0047269417,0.038349785,0.026068157,0.00054615084,0.006516507,0.0073658493,0.00012844305,0.095530875],"genre_scores_gemma":[0.9701376,0.0075479783,0.005969352,0.00010624147,0.000055486737,0.000011104637,0.00012724524,0.00003409358,0.016010877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962802,0.001080428,0.0006630019,0.0007158097,0.0009047301,0.0003558296],"domain_scores_gemma":[0.9860838,0.009895982,0.0011009285,0.002117605,0.0006409672,0.00016074075],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0036441253,0.000330972,0.0008120527,0.00019389774,0.0014800424,0.000058660844,0.003895266,0.0002188681,0.00004078874],"category_scores_gemma":[0.0018098458,0.00023137365,0.00067538343,0.0002723053,0.005874571,0.00009107781,0.002752714,0.0007849906,0.000007615086],"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.0050118687,0.00033357364,0.0005959041,0.0002566004,0.0007894741,0.000021609323,0.0678293,0.0007146715,0.00012580193,0.8145773,0.005821383,0.10392253],"study_design_scores_gemma":[0.004173743,0.0002442404,0.008045914,0.00036926242,0.00041970753,0.000065978675,0.05458969,0.11650302,0.00005546363,0.6489223,0.16591246,0.0006981956],"about_ca_topic_score_codex":0.0006355098,"about_ca_topic_score_gemma":0.0017743377,"teacher_disagreement_score":0.16565497,"about_ca_system_score_codex":0.00007335059,"about_ca_system_score_gemma":0.0003326116,"threshold_uncertainty_score":0.9998199},"labels":[],"label_agreement":null},{"id":"W2118985797","doi":"10.1109/isda.2010.5687277","title":"Towards a bounded-rationality model of multi-agent social learning in games","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounded rationality; Bounded function; Computer science; Rationality; Social learning; Artificial intelligence; Theoretical computer science; Human–computer interaction; Cognitive science; Knowledge management; Mathematics; Psychology; Epistemology","score_opus":0.21544746606165918,"score_gpt":0.44127697094677953,"score_spread":0.22582950488512035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118985797","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.90632445,0.0000022954098,0.07719393,0.0011906717,0.00003670358,0.000082096245,0.000006645356,0.000021053225,0.015142149],"genre_scores_gemma":[0.9852514,4.8988295e-7,0.0094296485,0.00008972739,0.000023514705,0.000016406953,0.0000018277832,0.0000028661511,0.0051841214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987943,0.00009134305,0.00036624505,0.00020127851,0.00044326176,0.00010355993],"domain_scores_gemma":[0.99928564,0.00022627237,0.00011195586,0.00018267607,0.00015814185,0.000035303186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002236581,0.00005622691,0.0001316699,0.00008233634,0.00011239381,0.000053458014,0.0003110441,0.000058306076,0.00079010514],"category_scores_gemma":[0.00090098317,0.000042431293,0.00006398904,0.00027969168,0.00014323079,0.0001272055,0.00007180157,0.00019235838,0.000091189686],"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.000016119322,0.00024626916,0.0076932595,0.0000020716066,0.0000043661325,1.7962978e-7,0.0030729922,0.0066307434,0.050516248,0.8983752,0.00039630255,0.033046264],"study_design_scores_gemma":[0.00036961105,0.000010703376,0.06535692,0.000001430076,0.000003260245,6.3948994e-7,0.0012551877,0.2964067,0.005568631,0.6276087,0.0033026717,0.00011555772],"about_ca_topic_score_codex":0.00005047323,"about_ca_topic_score_gemma":0.00046250614,"teacher_disagreement_score":0.28977594,"about_ca_system_score_codex":0.000009031071,"about_ca_system_score_gemma":0.000114899325,"threshold_uncertainty_score":0.86510974},"labels":[],"label_agreement":null},{"id":"W2119112198","doi":"10.1007/s00199-008-0349-5","title":"Mutually acceptable courses of action","year":2008,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McGill University","funders":"","keywords":"Mathematical economics; Action (physics); Bayesian game; Norm (philosophy); Rationalizability; Completeness (order theory); Social choice theory; Computer science; Bayesian probability; Game theory; Mathematics; Repeated game; Epistemology; Artificial intelligence; Nash equilibrium","score_opus":0.1884767170125537,"score_gpt":0.40088701841484325,"score_spread":0.21241030140228956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119112198","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.9294855,0.000044708457,0.0026609984,0.00011265994,0.00024130089,0.00007346497,0.000018760398,0.000026104539,0.0673365],"genre_scores_gemma":[0.984826,0.000020760841,0.00020507099,0.000070256145,0.00008880627,0.000008864873,0.0000015542771,0.0000061571773,0.014772496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990771,0.00013990696,0.00035528303,0.0002114625,0.00010462389,0.00011164415],"domain_scores_gemma":[0.998161,0.0010588693,0.0002131191,0.00047941538,0.0000400479,0.000047523015],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017083008,0.00006600829,0.00016823591,0.000097344724,0.00013022395,0.000019309644,0.0004649594,0.000038921356,0.00749692],"category_scores_gemma":[0.0002397675,0.000055054068,0.00008173914,0.00008636529,0.00024123536,0.00026097198,0.000052118918,0.0000563007,0.0029154562],"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.000097249715,0.00006754659,0.0023762304,0.0000014430087,0.000021637792,8.637964e-7,0.0010936713,0.0010924747,0.004406577,0.93783456,0.012220948,0.040786777],"study_design_scores_gemma":[0.0002619829,0.00003610494,0.015743505,0.0000026062912,0.00000833582,0.00002826267,0.0025576765,0.00015692411,0.027553838,0.8996644,0.053858027,0.00012834523],"about_ca_topic_score_codex":0.000007870105,"about_ca_topic_score_gemma":0.000008150519,"teacher_disagreement_score":0.05534053,"about_ca_system_score_codex":0.000025946738,"about_ca_system_score_gemma":0.00008188508,"threshold_uncertainty_score":0.9978609},"labels":[],"label_agreement":null},{"id":"W2119621836","doi":"10.2139/ssrn.2133302","title":"The Logic of Backward Induction","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.07901242858771615,"score_gpt":0.3779603423382767,"score_spread":0.2989479137505605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119621836","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.95345855,0.0036632668,0.030429723,0.003999799,0.0005043238,0.00010140227,0.0000010750538,0.000012721095,0.007829116],"genre_scores_gemma":[0.9958257,0.0006002117,0.000054538745,0.000037198643,0.00029016135,0.000002885756,1.7857268e-7,0.0000038803446,0.0031852364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979022,0.00022104979,0.00034054788,0.00008050942,0.00046069513,0.0009949536],"domain_scores_gemma":[0.998782,0.00047649798,0.00027434214,0.0002619683,0.00014612716,0.000059102575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012156449,0.00005664503,0.000091837865,0.00006040344,0.00037018783,0.000052919455,0.00054593274,0.000036122477,0.000088554094],"category_scores_gemma":[0.0006453203,0.000029141298,0.00008841996,0.00036035734,0.00011047493,0.00024345281,0.000034777066,0.0007036683,0.00028304337],"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.000013172935,0.000026165151,0.0011968571,1.1535659e-7,0.000013598119,1.7610759e-8,0.00011158809,0.000009935792,0.0008753287,0.913693,0.00029148223,0.08376871],"study_design_scores_gemma":[0.000077621495,0.00005163814,0.0029023886,0.0000010851015,0.0000074498807,0.00013685484,0.00369805,0.0000064941432,0.00054250815,0.9692274,0.02331163,0.000036891808],"about_ca_topic_score_codex":0.000003003781,"about_ca_topic_score_gemma":0.000027917438,"teacher_disagreement_score":0.083731815,"about_ca_system_score_codex":0.00010590777,"about_ca_system_score_gemma":0.00033169411,"threshold_uncertainty_score":0.42132068},"labels":[],"label_agreement":null},{"id":"W2121931511","doi":"10.1109/tsmcc.2003.809360","title":"A decision support system for interactive decision making-part II: analysis and output interpretation","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":222,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Interpretation (philosophy); Decision support system; Management science; Operations research; Decision analysis; Engineering; Computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.04684681912570904,"score_gpt":0.3549809404086376,"score_spread":0.30813412128292855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121931511","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.02057722,0.0020865619,0.9729696,0.00007436499,0.00036204717,0.0023081147,0.00017610657,0.00005226041,0.0013937193],"genre_scores_gemma":[0.9889361,0.002184918,0.004221595,0.00008947924,0.00005124258,0.0021036551,0.000010908318,0.00002390243,0.0023781797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965848,0.00032967963,0.0014190377,0.0009651091,0.0004342898,0.0002671324],"domain_scores_gemma":[0.9961863,0.0018186312,0.0005641453,0.0008593121,0.00033266636,0.00023890611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026273846,0.0003318868,0.0008140372,0.000581621,0.00094541284,0.0004270419,0.00026573,0.00016009204,0.00005243539],"category_scores_gemma":[0.000107775864,0.00025119574,0.00026381077,0.0011112486,0.00018525778,0.00021479746,0.00001107308,0.00018917932,0.00008568941],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020656927,0.00036084699,0.00019862328,0.00021567493,0.00035067185,9.963231e-7,0.0013752023,0.0015195855,0.00010317333,0.03985824,0.0021810455,0.9536294],"study_design_scores_gemma":[0.001041184,0.00041181067,0.00044908508,0.000849818,0.0015923892,0.00014104921,0.0027026467,0.020295633,0.000355104,0.008727289,0.9627363,0.00069766864],"about_ca_topic_score_codex":0.000007833157,"about_ca_topic_score_gemma":0.000059070273,"teacher_disagreement_score":0.96874803,"about_ca_system_score_codex":0.000055623983,"about_ca_system_score_gemma":0.00003262386,"threshold_uncertainty_score":0.99999404},"labels":[],"label_agreement":null},{"id":"W2123311380","doi":"10.1109/icsmc.1996.565440","title":"A new perspective an coalition analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; Toronto Metropolitan University; Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Conflict analysis; Perspective (graphical); Conflict resolution; Outcome (game theory); Computer science; Operations research; Similarity (geometry); Graph; Management science; Political science; Theoretical computer science; Mathematical economics; Artificial intelligence; Mathematics; Engineering; Image (mathematics)","score_opus":0.23671470218128993,"score_gpt":0.45237693967925674,"score_spread":0.2156622374979668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123311380","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.12003393,0.000034327844,0.47870642,0.0047290702,0.000024327474,0.0000859891,0.0000072754397,0.00008642857,0.39629224],"genre_scores_gemma":[0.94307244,0.0000013380195,0.0032314914,0.00023921044,0.000047927806,0.0000034933316,0.0000013047656,0.000001652134,0.053401154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906296,0.00009597269,0.00016199949,0.00025881812,0.00033900904,0.0000812436],"domain_scores_gemma":[0.9990199,0.00021893048,0.000047339992,0.00045349644,0.00014642433,0.000113902315],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005104868,0.000044148575,0.00010467219,0.00019802722,0.000093585186,0.00012415752,0.00028512036,0.000022114291,0.04368293],"category_scores_gemma":[0.00021359272,0.000030681207,0.00009321109,0.0017758003,0.00002810875,0.00023659057,0.000018381787,0.000034558707,0.0029345704],"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.0000036475162,0.00006483096,0.0013498665,4.5225722e-8,0.000040896844,3.5748351e-7,0.0017001505,0.00020521817,0.00017062668,0.9611908,0.018374791,0.016898775],"study_design_scores_gemma":[0.00014278322,0.000039397084,0.01644128,2.861755e-7,0.00008888686,0.0000015189252,0.010352207,0.017886898,0.00025086023,0.93981624,0.014867821,0.00011182616],"about_ca_topic_score_codex":0.00020015653,"about_ca_topic_score_gemma":0.00026834503,"teacher_disagreement_score":0.8230385,"about_ca_system_score_codex":0.000016641385,"about_ca_system_score_gemma":0.0000064657647,"threshold_uncertainty_score":0.9978418},"labels":[],"label_agreement":null},{"id":"W2125170054","doi":"10.1007/s40065-014-0101-x","title":"A note on bimatrix game maximal Selten subsets","year":2014,"lang":"de","type":"article","venue":"Arabian Journal of Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"King Fahd University of Petroleum and Minerals","keywords":"Nash equilibrium; Mathematics; Mathematical optimization; Combinatorics; Game theory; Mathematical economics","score_opus":0.05731555588686087,"score_gpt":0.34891668546520677,"score_spread":0.2916011295783459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125170054","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.75345314,0.0009691352,0.21530746,0.013274204,0.0023538773,0.0005582266,0.00006940158,0.000051099778,0.013963461],"genre_scores_gemma":[0.97013193,0.000119041535,0.026626917,0.0005339955,0.0009583629,0.00000315018,0.000001229075,0.000044796398,0.0015805748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948194,0.0004950588,0.0021268874,0.0003262566,0.0017559595,0.00047645412],"domain_scores_gemma":[0.9915849,0.0039873747,0.0022726152,0.0010395487,0.00064706506,0.00046850278],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00814884,0.00035171912,0.0009152329,0.0004768153,0.00021101457,0.00039343492,0.0017121377,0.00019433728,0.00072982395],"category_scores_gemma":[0.0045489087,0.0002539606,0.0005300301,0.0007144477,0.00029638398,0.0003034946,0.00011276002,0.0007231107,0.007655646],"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.0006139948,0.006149058,0.000808239,0.00045661753,0.00072953367,0.00028569007,0.038605023,0.0037668792,0.004331412,0.7224659,0.05879822,0.16298944],"study_design_scores_gemma":[0.0016840975,0.0012523409,0.00073132495,0.0008647579,0.000470881,0.0005810202,0.0016330802,0.015844095,0.0020930702,0.83828056,0.13599673,0.00056804257],"about_ca_topic_score_codex":6.825234e-7,"about_ca_topic_score_gemma":0.0000012517694,"teacher_disagreement_score":0.2166788,"about_ca_system_score_codex":0.00006301959,"about_ca_system_score_gemma":0.00017288653,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W2125467036","doi":"10.1007/s00199-009-0449-x","title":"Enumeration of Nash equilibria for two-player games","year":2009,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council","keywords":"Enumeration; Lexicographical order; Polytope; Polyhedron; Nash equilibrium; Vertex (graph theory); Computer science; Combinatorics; Best response; Implementation; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Mathematical optimization; Graph; Programming language","score_opus":0.06540925519319622,"score_gpt":0.3943663148526824,"score_spread":0.3289570596594862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125467036","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.94412124,0.0000683519,0.024885485,0.00067772594,0.00021495644,0.00026781828,0.000053450556,0.000028316537,0.029682672],"genre_scores_gemma":[0.994565,0.0000014742332,0.0007850586,0.00025492988,0.00015157071,0.000018956687,0.000005646907,0.0000055529968,0.004211785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897736,0.00011459997,0.00044679575,0.00025661103,0.000076516255,0.00012813484],"domain_scores_gemma":[0.9978171,0.0014143325,0.00021981381,0.00045961744,0.0000445748,0.00004456044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002791984,0.000078709476,0.00019042808,0.000089091925,0.00006991144,0.000058617097,0.0004110745,0.000036958852,0.0012054896],"category_scores_gemma":[0.00032579526,0.00006626736,0.0001117317,0.00006121262,0.000074770825,0.00023109255,0.000022682727,0.00003803363,0.00059956603],"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.000078929705,0.000020935164,0.00004325452,6.205261e-7,0.000006153448,4.0088544e-8,0.00025983714,0.00042659207,0.01546029,0.92949474,0.0023940261,0.051814612],"study_design_scores_gemma":[0.00031761613,0.00005258454,0.0008552715,0.000002554706,0.0000067070996,0.0000015523196,0.00020836228,0.001209633,0.01977954,0.96542305,0.012066451,0.000076651006],"about_ca_topic_score_codex":0.000001151711,"about_ca_topic_score_gemma":0.000003078692,"teacher_disagreement_score":0.05173796,"about_ca_system_score_codex":0.00002045645,"about_ca_system_score_gemma":0.000044190758,"threshold_uncertainty_score":0.9997075},"labels":[],"label_agreement":null},{"id":"W2127574131","doi":"10.1287/mnsc.47.2.280.9839","title":"Efficient Timing of Communication in Multiperiod Agencies","year":2001,"lang":"en","type":"article","venue":"Management Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Samfund og Erhverv, Det Frie Forskningsråd","keywords":"Outcome (game theory); Value (mathematics); Private information retrieval; Imperfect; Computer science; Economics; Consumption (sociology); Microeconomics; SIGNAL (programming language); Econometrics; Mathematical economics; Statistics; Mathematics; Computer security","score_opus":0.14144949172913288,"score_gpt":0.4021472512976396,"score_spread":0.2606977595685067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127574131","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.89630574,0.000032137075,0.009944929,0.00039477093,0.00003811971,0.00020035097,6.8549394e-7,0.000015349504,0.09306791],"genre_scores_gemma":[0.9941811,0.00001486559,0.004345502,0.00006287726,0.000002691736,0.00002056251,2.8674836e-7,0.0000019004004,0.001370234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982009,0.000068410496,0.0003701165,0.0003018914,0.0008689965,0.00018968995],"domain_scores_gemma":[0.99861425,0.00020859373,0.0001364997,0.0009108863,0.00008945851,0.00004030309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005061194,0.00005837514,0.00010075848,0.0004758742,0.00023163509,0.00009550955,0.0016550601,0.000011816903,0.00018645995],"category_scores_gemma":[0.0003479645,0.00004681804,0.00002773243,0.0031190133,0.0006363882,0.00014008327,0.0004515947,0.000047266494,0.00016444862],"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.000039991068,0.00055561407,0.031707786,0.000013993684,0.0000068261666,0.000011154512,0.010934221,0.20900576,0.016232504,0.5312235,0.00051007816,0.19975862],"study_design_scores_gemma":[0.0005487383,0.00003554659,0.50199735,0.00007418283,0.000009278733,0.000004344188,0.02345194,0.4081153,0.0031953997,0.050394874,0.011898975,0.000274081],"about_ca_topic_score_codex":0.000018972694,"about_ca_topic_score_gemma":0.000017443468,"teacher_disagreement_score":0.48082858,"about_ca_system_score_codex":0.00004752629,"about_ca_system_score_gemma":0.000016478607,"threshold_uncertainty_score":0.3075541},"labels":[],"label_agreement":null},{"id":"W2128076582","doi":"10.2139/ssrn.284204","title":"Probabilistic Representation of Complexity","year":2001,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Kellogg's (Canada)","funders":"","keywords":"Probabilistic logic; Representation (politics); Computer science; Artificial intelligence; Mathematics; Political science","score_opus":0.14172306151094538,"score_gpt":0.4105076396888624,"score_spread":0.268784578177917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128076582","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.93901944,0.00015432146,0.050975945,0.0013803309,0.00006251385,0.00011399413,0.0000019008485,0.000013252541,0.0082782805],"genre_scores_gemma":[0.9967428,0.00015953586,0.00019579976,0.00002739506,0.00008145096,0.0000036961985,0.0000011767488,0.0000044259905,0.0027837416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978989,0.00021986214,0.0004782322,0.00017308713,0.00055393105,0.0006760211],"domain_scores_gemma":[0.9986355,0.0003991532,0.00031475947,0.00032574782,0.00027155917,0.000053295564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043749944,0.000063383086,0.0001589508,0.00011332775,0.000161452,0.00004926424,0.0005122926,0.000028121847,0.0003035013],"category_scores_gemma":[0.0011707213,0.000046582514,0.00009937828,0.0007016094,0.00015267488,0.00017357859,0.00003369064,0.00048444973,0.00013140113],"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.000041499432,0.00006323348,0.0036594227,4.2614926e-7,0.0000139890935,5.251905e-7,0.00010595791,0.00015348323,0.0005232302,0.96164256,0.00010006026,0.03369559],"study_design_scores_gemma":[0.00018687392,0.00007848194,0.0060127643,0.000002582986,0.0000090006415,0.00026039034,0.001470892,0.00028661956,0.00016596579,0.99006975,0.0014090373,0.000047636633],"about_ca_topic_score_codex":0.000021091597,"about_ca_topic_score_gemma":0.00025086055,"teacher_disagreement_score":0.057723317,"about_ca_system_score_codex":0.00012640415,"about_ca_system_score_gemma":0.00047100848,"threshold_uncertainty_score":0.33231264},"labels":[],"label_agreement":null},{"id":"W2133413020","doi":"10.1006/game.1999.0797","title":"Cyclic Games: An Introduction and Some Examples","year":2001,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"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":"Mathematical economics; Repeated game; Oligopoly; Economics; Complete information; Extensive-form game; Global game; Game theory; Microeconomics; Computer science; Mathematics; Cournot competition","score_opus":0.09215908838217957,"score_gpt":0.3535597753645019,"score_spread":0.26140068698232233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133413020","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.99726176,0.00020700735,0.000075792945,0.0018374716,0.00018147317,0.00014092105,0.000018134284,0.000034617475,0.00024282688],"genre_scores_gemma":[0.99678755,0.00022469844,0.00022542613,0.00012893944,0.00042363725,0.00005570984,0.000007636233,0.0000086865375,0.0021377392],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99889725,0.00005069801,0.00031482137,0.00049610605,0.00007062189,0.00017050668],"domain_scores_gemma":[0.99920595,0.00010595102,0.00010339329,0.00042882538,0.00001745124,0.000138426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000671081,0.000108602435,0.00018695655,0.00010468282,0.00015624681,0.00025683214,0.00018400302,0.00007647244,0.0008868355],"category_scores_gemma":[0.000036028192,0.00009074881,0.000032834774,0.00005901284,0.00017712086,0.00060767523,0.000064832464,0.00009496293,0.00020074158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039164333,0.00014047632,0.1081657,0.0000022328725,0.000010483678,0.0000031600398,0.0009918866,0.00003977957,0.0053241136,0.06527462,0.00294279,0.8170656],"study_design_scores_gemma":[0.00043149912,0.00011381279,0.64010143,0.0000026321065,0.00005635913,0.00018628497,0.0026872254,0.00026323105,0.0005141257,0.057264265,0.29807937,0.00029973313],"about_ca_topic_score_codex":0.00006141117,"about_ca_topic_score_gemma":0.0000862054,"teacher_disagreement_score":0.81676584,"about_ca_system_score_codex":0.000017229773,"about_ca_system_score_gemma":0.0000126355535,"threshold_uncertainty_score":0.97102267},"labels":[],"label_agreement":null},{"id":"W2133700832","doi":"10.1109/taes.2007.4383578","title":"Network-Enabled Missile Deflection: Games and Correlation Equilibrium","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nash equilibrium; Sequential equilibrium; Missile; Computer science; Solution concept; Mathematical optimization; Epsilon-equilibrium; Correlated equilibrium; Game theory; Equilibrium point; Strategy; Telecommunications network; Equilibrium selection; Best response; Mathematical economics; Repeated game; Mathematics; Engineering; Computer network; Differential equation","score_opus":0.0351742560865688,"score_gpt":0.31306985059265063,"score_spread":0.2778955945060818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133700832","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.29409814,0.0015548501,0.7002552,0.00052187144,0.00061733805,0.00042877323,0.000004182567,0.000097851116,0.0024217954],"genre_scores_gemma":[0.98731685,0.00010883961,0.00006906752,0.00010640196,0.00016337914,0.000047831247,9.811201e-7,0.000017598371,0.012169068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978766,0.00015670588,0.0004688508,0.00051104225,0.00041278783,0.00057405065],"domain_scores_gemma":[0.998248,0.00089149136,0.0001707283,0.00038957165,0.0001179478,0.00018225994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024440417,0.0001951808,0.00027364498,0.00016572984,0.0004998899,0.00027270912,0.00016079903,0.00015396148,0.00007280493],"category_scores_gemma":[0.000024164821,0.00016427631,0.00006694826,0.00077181595,0.00011909266,0.0002319537,0.0000023283667,0.0003297135,0.000101451886],"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.0026198777,0.0011530897,0.009007156,0.00017120817,0.0006366429,0.000024835917,0.0065423017,0.4525642,0.09416554,0.15927885,0.03313309,0.24070318],"study_design_scores_gemma":[0.014398878,0.0064895786,0.025847973,0.00088216504,0.0011790361,0.0034395158,0.024230754,0.28601742,0.05776705,0.18843433,0.38515237,0.0061609317],"about_ca_topic_score_codex":0.000077749806,"about_ca_topic_score_gemma":0.000257634,"teacher_disagreement_score":0.70018613,"about_ca_system_score_codex":0.000084000196,"about_ca_system_score_gemma":0.00006912958,"threshold_uncertainty_score":0.66989934},"labels":[],"label_agreement":null},{"id":"W2133701583","doi":"10.1145/2488388.2488402","title":"Strategyproof mechanisms for competitive influence in networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competition (biology); Network topology; Computer science; Word of mouth; Diffusion; Network formation; Stochastic process; Process (computing); Network effect; Social network (sociolinguistics); Cascade; Game theory; Microeconomics; Mathematical economics; Advertising; Social media; Mathematics; Economics; Business; Computer network; World Wide Web; Engineering","score_opus":0.06370836313490728,"score_gpt":0.36774717601827245,"score_spread":0.30403881288336515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133701583","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.32571295,0.000009975184,0.6314361,0.0010503881,0.00004856424,0.0008850313,0.000005415888,0.00003794878,0.040813625],"genre_scores_gemma":[0.9910962,8.4054574e-7,0.005486693,0.00052060134,0.0000140468255,0.00029634297,0.0000016179946,0.0000035259973,0.0025801607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990601,0.000053099102,0.00028915534,0.00023914289,0.00018975454,0.00016872499],"domain_scores_gemma":[0.99834627,0.0010271487,0.00006342892,0.0002669506,0.00023873826,0.000057460504],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008920494,0.00006397097,0.000115439485,0.00006653188,0.000063489686,0.00015828574,0.00040549363,0.000042471278,0.0014229073],"category_scores_gemma":[0.0002808192,0.000044035885,0.000035446945,0.00036932438,0.000054637345,0.0003046577,0.000042820182,0.00006215328,0.00066068495],"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.000003531351,0.000021127193,0.00020954547,3.4677228e-7,0.0000010004588,9.7550156e-8,0.000045265795,0.0036319238,0.00093145407,0.9879736,0.00043261965,0.0067495336],"study_design_scores_gemma":[0.00014485001,0.000031408617,0.013692588,0.000003371007,9.1204345e-7,5.706248e-7,0.0010860995,0.020425947,0.0009248035,0.9627082,0.0009136974,0.000067564986],"about_ca_topic_score_codex":0.000038525843,"about_ca_topic_score_gemma":0.000102234015,"teacher_disagreement_score":0.6653832,"about_ca_system_score_codex":0.000008477662,"about_ca_system_score_gemma":0.000017990113,"threshold_uncertainty_score":0.9994899},"labels":[],"label_agreement":null},{"id":"W2135135030","doi":"10.1109/med.2011.5983135","title":"Decentralized learning in multiple pursuer-evader Markov games","year":2011,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Royal Military College of Canada","funders":"","keywords":"Pursuer; Computer science; Markov decision process; sort; Task (project management); Learning automata; Markov process; Automaton; Order (exchange); Process (computing); Markov chain; Artificial intelligence; Mathematical optimization; Theoretical computer science; Distributed computing; Machine learning; Mathematics; Engineering","score_opus":0.2059120859725308,"score_gpt":0.36878349271906513,"score_spread":0.16287140674653433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135135030","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.85191375,0.000060864062,0.009514018,0.00078754156,0.00009054455,0.00021561318,0.0000015165605,0.000110107925,0.13730603],"genre_scores_gemma":[0.97682095,0.000010731762,0.006499959,0.0001746771,0.000011753574,0.000027017102,0.0000011801675,0.000006688102,0.016447065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99849594,0.00022186128,0.00036410522,0.00031936972,0.0003525681,0.00024614227],"domain_scores_gemma":[0.99859136,0.0007991305,0.00008749557,0.00036400685,0.00006745778,0.00009055572],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015927588,0.00008877885,0.0001580943,0.00014894227,0.0000908366,0.00006616663,0.0005156495,0.000052473857,0.009315493],"category_scores_gemma":[0.0013948714,0.00006279146,0.0000619934,0.00055567437,0.00009272834,0.00020003694,0.00008489205,0.00014174018,0.0019727172],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021211643,0.00039743577,0.5915972,0.0000027892147,0.000014964549,0.000011829674,0.0059492085,0.0002441819,0.0037926116,0.14512719,0.0067877537,0.24586275],"study_design_scores_gemma":[0.0017899651,0.000069294605,0.5064219,0.000015387159,0.000010268416,0.000009813194,0.00824783,0.004937468,0.010667514,0.28957102,0.17781416,0.0004453504],"about_ca_topic_score_codex":0.00008031462,"about_ca_topic_score_gemma":0.00016661709,"teacher_disagreement_score":0.2454174,"about_ca_system_score_codex":0.00001129965,"about_ca_system_score_gemma":0.000021182701,"threshold_uncertainty_score":0.9988044},"labels":[],"label_agreement":null},{"id":"W2135384266","doi":"10.1002/jsc.647","title":"Go and Chess as prognosis instruments for understanding competitive positions","year":2003,"lang":"en","type":"article","venue":"Strategic Change","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Atlantic School of Theology","funders":"","keywords":"Competitor analysis; Offensive; Flexibility (engineering); Position (finance); Adversary; Marketing; Competitive advantage; Business; First-mover advantage; Industrial organization; Economics; Management; Computer science; Finance","score_opus":0.5239162965678131,"score_gpt":0.430985973211301,"score_spread":0.09293032335651213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135384266","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.7064038,0.000076120115,0.0023834957,0.0017352706,0.00014521768,0.0011022881,0.00014752778,0.000043413045,0.28796288],"genre_scores_gemma":[0.9984504,0.000009141063,0.00039943008,0.00018140505,0.000039430197,0.00030997425,0.000010352147,0.0000064716833,0.0005933971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906474,0.0000756916,0.00017861891,0.00028349643,0.00021643622,0.00018100222],"domain_scores_gemma":[0.9992542,0.00033495732,0.00008457263,0.00016160203,0.000073556956,0.000091061665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059639936,0.00009262783,0.00012636378,0.00008345069,0.00033046934,0.00018524023,0.00014273514,0.000045257868,0.00025945713],"category_scores_gemma":[0.00007285323,0.00007615315,0.000043187018,0.00031024174,0.00013129984,0.00018524879,0.000021502203,0.000055414752,0.000081109145],"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.000006831482,0.000039270526,0.00048981735,0.0000035484013,0.000007911822,4.2215132e-7,0.0006490324,1.520807e-7,0.00020999239,0.99810094,0.000047971804,0.00044413525],"study_design_scores_gemma":[0.00031951597,0.000097433825,0.0006858293,0.000016306207,0.000013848838,0.000010104562,0.022790095,0.000039273622,0.00068883476,0.97300786,0.0022305776,0.00010029523],"about_ca_topic_score_codex":0.000006370567,"about_ca_topic_score_gemma":0.000046769437,"teacher_disagreement_score":0.2920466,"about_ca_system_score_codex":0.00003779557,"about_ca_system_score_gemma":0.000030851228,"threshold_uncertainty_score":0.31054354},"labels":[],"label_agreement":null},{"id":"W2137224661","doi":"10.1109/isit.2011.6034066","title":"Mixed strategy Nash equilibrium in two-user resource allocation games","year":2011,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nash equilibrium; Computer science; Uniqueness; Resource allocation; Channel (broadcasting); Game theory; Selection (genetic algorithm); Strategy; Resource (disambiguation); Equilibrium selection; Mathematical optimization; Resource management (computing); Mathematical economics; Best response; Repeated game; Mathematics; Computer network; Artificial intelligence","score_opus":0.1988330265690854,"score_gpt":0.3803723356507712,"score_spread":0.1815393090816858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137224661","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.74043393,0.000017976758,0.0026905164,0.0003918273,0.00003980987,0.00013924326,0.000001914656,0.00005469739,0.25623006],"genre_scores_gemma":[0.9751029,8.729763e-7,0.0011791623,0.00022995498,0.000031609936,0.000029501072,0.0000031102381,0.0000075394305,0.023415362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983506,0.00021609385,0.00045306867,0.00037513612,0.00039561122,0.00020946193],"domain_scores_gemma":[0.9986343,0.00041446154,0.00010316485,0.00066486554,0.00009896466,0.00008424466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001914194,0.00009781563,0.00014425369,0.00017134214,0.000044130033,0.00009089267,0.0006846292,0.00004289339,0.0029180124],"category_scores_gemma":[0.00031141224,0.00007212366,0.000049005685,0.0007034796,0.00010562349,0.0002958516,0.00010106091,0.000097910066,0.0018092042],"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.00007123185,0.00024516205,0.008625731,0.0000019825152,0.000007233382,0.0000035706832,0.0019520165,0.00041874283,0.013117546,0.9183263,0.0137019195,0.04352855],"study_design_scores_gemma":[0.00083830307,0.00008938987,0.13446258,0.000013023544,0.000009287607,0.000009244009,0.009556336,0.002344561,0.048625063,0.74366546,0.059998035,0.0003886985],"about_ca_topic_score_codex":0.00011004064,"about_ca_topic_score_gemma":0.00035250557,"teacher_disagreement_score":0.23466894,"about_ca_system_score_codex":0.000013350084,"about_ca_system_score_gemma":0.000037545782,"threshold_uncertainty_score":0.998968},"labels":[],"label_agreement":null},{"id":"W2137978945","doi":"10.1109/icsmc.2004.1398450","title":"Integrating uncertain preferences into status quo analysis: an environmental conflict case study","year":2005,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Status quo; Preference; Status quo bias; Flexibility (engineering); Conflict analysis; Computer science; Conflict resolution; Management science; Graph; Operations research; Political science; Mathematics; Microeconomics; Economics; Theoretical computer science; Statistics","score_opus":0.14461602230670112,"score_gpt":0.43721963287889026,"score_spread":0.29260361057218914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137978945","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.98978335,0.0000344363,0.006412907,0.00012636824,0.000018070064,0.00029867922,0.000017640543,0.000054892233,0.0032536637],"genre_scores_gemma":[0.9938655,0.0000030740673,0.0041684275,0.00015261512,0.000047158162,0.000056960933,0.000015266422,0.0000054862303,0.0016855357],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99739724,0.00047432483,0.00062677544,0.00059724454,0.0006598191,0.0002445648],"domain_scores_gemma":[0.9981288,0.00064992404,0.00017374172,0.0007825008,0.000042777752,0.00022227266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019571325,0.0001598706,0.00027485425,0.00028065892,0.00037177352,0.00031235497,0.00054089463,0.00004176261,0.0035679184],"category_scores_gemma":[0.00018113697,0.00010298913,0.000099338315,0.0009096185,0.00013838593,0.0004948238,0.0001147765,0.00013776855,0.0005195155],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062886604,0.003778537,0.3149095,0.000001240179,0.0005694987,0.00016682904,0.13426572,0.009920392,0.0022107994,0.01042034,0.00047820926,0.52321607],"study_design_scores_gemma":[0.00059347076,0.00064229185,0.016179536,0.0000019597258,0.00035631214,0.00008109329,0.91362107,0.043244407,0.00058326236,0.009838227,0.014413852,0.000444548],"about_ca_topic_score_codex":0.0020597058,"about_ca_topic_score_gemma":0.021192838,"teacher_disagreement_score":0.7793553,"about_ca_system_score_codex":0.000051911476,"about_ca_system_score_gemma":0.000032506436,"threshold_uncertainty_score":0.99734294},"labels":[],"label_agreement":null},{"id":"W2139214692","doi":"10.2139/ssrn.2158067","title":"Inducible Games: Using Tit-for-Tat to Stabilize Outcomes","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Psychology; Computer science","score_opus":0.16166184962698005,"score_gpt":0.44320656882676546,"score_spread":0.2815447191997854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139214692","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.87838835,0.000539158,0.1181329,0.0014076241,0.00030617797,0.00023928209,0.0000065660925,0.000021734239,0.00095823675],"genre_scores_gemma":[0.99396676,0.000037122914,0.0019436848,0.0003395098,0.00031202286,0.000017002072,6.731548e-7,0.000018232018,0.003364972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963696,0.00015602427,0.0005012849,0.0002489234,0.00059361965,0.0021305715],"domain_scores_gemma":[0.9981644,0.00068995496,0.00021285132,0.00045780037,0.00021517395,0.00025977753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011012337,0.00014550528,0.0002574359,0.00023935152,0.00038946202,0.00016519219,0.00071557687,0.00006327346,0.00023686323],"category_scores_gemma":[0.0015291966,0.00010176665,0.00017725972,0.00058764237,0.0000480284,0.00049228256,0.00007501973,0.00066147273,0.00044263518],"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.00006555996,0.00017776423,0.026513655,0.0000019324534,0.00008803643,2.3090338e-7,0.0013281076,0.00038016896,0.01342075,0.9188733,0.00083744957,0.03831302],"study_design_scores_gemma":[0.00039360838,0.00013129869,0.0025567017,0.0000066062607,0.0000326022,0.00013709579,0.0071601695,0.000068742636,0.0014167166,0.94532174,0.042554248,0.00022046],"about_ca_topic_score_codex":0.0000110998735,"about_ca_topic_score_gemma":0.00008183248,"teacher_disagreement_score":0.11618921,"about_ca_system_score_codex":0.00043571767,"about_ca_system_score_gemma":0.0008360476,"threshold_uncertainty_score":0.5689328},"labels":[],"label_agreement":null},{"id":"W2139515132","doi":"","title":"Learning a value analysis tool for agent evaluation","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Variance (accounting); Estimator; Population; Limit (mathematics); Bellman equation; Function (biology); Domain (mathematical analysis); Monte Carlo method; Value (mathematics); Artificial intelligence; Machine learning; Mathematical optimization; Mathematics; Statistics","score_opus":0.178569046960018,"score_gpt":0.47740491863211654,"score_spread":0.2988358716720986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139515132","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.50909185,0.000011763236,0.47109905,0.0015578228,0.000022168471,0.0003112317,0.0000017360268,0.000036985246,0.017867405],"genre_scores_gemma":[0.9860689,7.6192697e-7,0.004456519,0.00034757765,0.000030950683,0.00004578329,0.00000893188,0.0000015059309,0.00903907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985847,0.00017093097,0.0002720176,0.00024929803,0.00061998994,0.00010306925],"domain_scores_gemma":[0.998593,0.00069075485,0.00009293406,0.0003019053,0.00028672384,0.00003473084],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005782506,0.000049785467,0.00012143131,0.00018858447,0.00017869026,0.00012194889,0.00022690375,0.000025078652,0.0015749421],"category_scores_gemma":[0.002041603,0.00003477451,0.00017013855,0.0011558175,0.000013243951,0.000106854604,0.000011866201,0.00003729802,0.0002933864],"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.000021062328,0.00007264509,0.0015330447,3.117282e-7,0.000063032436,8.513483e-8,0.000528014,0.11487649,0.0019685144,0.22293702,0.0025062468,0.65549356],"study_design_scores_gemma":[0.0002215793,0.00009100173,0.04589536,7.51327e-7,0.00029537335,3.4360903e-7,0.00047711778,0.40902823,0.00084287435,0.52478325,0.018270029,0.0000940911],"about_ca_topic_score_codex":0.000002077241,"about_ca_topic_score_gemma":0.0000032495852,"teacher_disagreement_score":0.65539944,"about_ca_system_score_codex":0.000018360171,"about_ca_system_score_gemma":0.000023316175,"threshold_uncertainty_score":0.99933773},"labels":[],"label_agreement":null},{"id":"W2140055652","doi":"10.1109/icsmc.2009.5346309","title":"Representations of status quo analysis in the graph model for strength of preference","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Status quo; Preference; Preference relation; Graph; Mathematical economics; Mathematics; Computer science; Econometrics; Microeconomics; Economics; Theoretical computer science","score_opus":0.21751804420561963,"score_gpt":0.44513936998213516,"score_spread":0.22762132577651553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140055652","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.6778226,0.000010935316,0.31243864,0.00046096242,0.0000030833426,0.0001989952,0.00007713282,0.0000045115544,0.008983121],"genre_scores_gemma":[0.9930146,0.000006960791,0.0062666694,0.00005223175,0.000001944284,0.00002125505,0.0000067977176,7.948623e-7,0.00062876026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988972,0.00008268134,0.00042899183,0.00016754812,0.00033261182,0.00009098263],"domain_scores_gemma":[0.99777156,0.0012947912,0.0001607764,0.00057220325,0.00017896839,0.000021724569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010682855,0.000041535146,0.0001537633,0.00027529456,0.000037162856,0.000017681465,0.0004610598,0.000018746756,0.00007902616],"category_scores_gemma":[0.00049461384,0.000023314156,0.00012232819,0.0020635014,0.00006247377,0.00008870888,0.000012923957,0.000032147203,0.0000016957654],"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.00003391017,0.00032156357,0.0095134275,0.0000013889539,0.000034509714,3.3570373e-8,0.0047605243,0.112205245,0.0011590808,0.85803,0.0007489881,0.0131912995],"study_design_scores_gemma":[0.00012591905,0.00003070236,0.08078236,0.0000010965907,0.00005498873,4.7570303e-8,0.002857316,0.1685163,0.0011766163,0.7463886,0.000033451983,0.000032596417],"about_ca_topic_score_codex":0.00005201604,"about_ca_topic_score_gemma":0.0003518887,"teacher_disagreement_score":0.31519198,"about_ca_system_score_codex":0.0000023733044,"about_ca_system_score_gemma":0.000028162602,"threshold_uncertainty_score":0.09914441},"labels":[],"label_agreement":null},{"id":"W2140997194","doi":"10.1002/cplx.20038","title":"The advantage of complexity in two 2 × 2 games","year":2004,"lang":"en","type":"article","venue":"Complexity","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":"McGill University","funders":"","keywords":"Earnings; Contrast (vision); Prisoner's dilemma; Dilemma; Computational complexity theory; Computer science; Constant (computer programming); Mathematical economics; Game theory; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Economics","score_opus":0.2940760080151845,"score_gpt":0.4699484978838769,"score_spread":0.17587248986869236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140997194","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.9683078,0.00009951044,0.005486876,0.002409428,0.000097506665,0.00021687942,0.000037421887,0.00002745677,0.023317153],"genre_scores_gemma":[0.9974644,0.0000063231405,0.002125774,0.000114120194,0.000027783206,0.0000130662775,0.0000028237303,0.000004416129,0.00024127077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982593,0.00020473798,0.0005469917,0.0002694717,0.0005023176,0.00021719978],"domain_scores_gemma":[0.9976851,0.0010560288,0.0001980099,0.0008689434,0.00012848647,0.000063457526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002246837,0.00009554985,0.0002296696,0.00007655048,0.00024338953,0.00006321954,0.0011051565,0.00001922057,0.00025495913],"category_scores_gemma":[0.0007580429,0.000059744278,0.00009070665,0.00067035697,0.0012603925,0.00011570843,0.00020396458,0.00014729313,0.00026595374],"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.000026937912,0.000093100316,0.004288544,0.0000013504547,0.0000025893673,0.0000010184867,0.00039039014,0.00015037936,0.00051682023,0.9884749,0.00016149662,0.005892455],"study_design_scores_gemma":[0.00039652255,0.000015121064,0.11683224,0.0000062885597,0.000001282968,0.0000031607572,0.00085188425,0.00014378168,0.0014043036,0.87279415,0.007489407,0.00006185786],"about_ca_topic_score_codex":0.00016143704,"about_ca_topic_score_gemma":0.0022319276,"teacher_disagreement_score":0.11568077,"about_ca_system_score_codex":0.00003417831,"about_ca_system_score_gemma":0.000054528246,"threshold_uncertainty_score":0.46439686},"labels":[],"label_agreement":null},{"id":"W2141401964","doi":"","title":"Tricks with Aggregate Games","year":2009,"lang":"en","type":"article","venue":"","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":"Booth University College","funders":"","keywords":"Cournot competition; Mathematical economics; Aggregate (composite); Generalization; Class (philosophy); Economics; Sequential game; Game theory; Function (biology); Set (abstract data type); Repeated game; Screening game; Combinatorial game theory; Property (philosophy); Extensive-form game; Microeconomics; Computer science; Mathematics; Artificial intelligence","score_opus":0.07245311572781833,"score_gpt":0.3764350968585833,"score_spread":0.30398198113076497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141401964","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4166476,0.00004226088,0.049157027,0.0069590975,0.00002164471,0.000117332536,0.0000015426994,0.000097715536,0.5269558],"genre_scores_gemma":[0.95314825,0.0000021892408,0.0019448464,0.0010122468,0.000022010634,0.0000034230052,3.3822215e-7,0.0000016067913,0.04386509],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991651,0.000034354893,0.00015309796,0.00019279264,0.00034836715,0.0001062525],"domain_scores_gemma":[0.9991608,0.00025298292,0.00005607673,0.00039183523,0.00007680301,0.00006148638],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005592063,0.000052328593,0.0000876944,0.000069958565,0.00007359127,0.00009891095,0.0003383569,0.000018001676,0.0012989575],"category_scores_gemma":[0.00014780303,0.000026758125,0.000028876202,0.00057623105,0.0000462427,0.000120277036,0.000011255792,0.00004250845,0.001466249],"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.00003085509,0.000060909624,0.00046641412,1.1881357e-7,0.0000027023927,0.0000030372212,0.0001939793,0.000033554017,0.0005985531,0.32005116,0.014148546,0.6644102],"study_design_scores_gemma":[0.00029370977,0.00015806776,0.016283216,0.0000035829476,0.000005255051,0.000017759221,0.00050744996,0.00020627191,0.005874537,0.7278077,0.24871615,0.00012632101],"about_ca_topic_score_codex":0.0000018032855,"about_ca_topic_score_gemma":0.0000034622442,"teacher_disagreement_score":0.6642839,"about_ca_system_score_codex":0.000003330587,"about_ca_system_score_gemma":0.000015275085,"threshold_uncertainty_score":0.999614},"labels":[],"label_agreement":null},{"id":"W2141806469","doi":"10.1007/s00355-011-0638-y","title":"A counterexample to a conjecture of Schwartz","year":2012,"lang":"en","type":"article","venue":"Social Choice and Welfare","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Tournament; Conjecture; Counterexample; Transitive relation; Constructive; Mathematics; Constructive proof; Combinatorics; Vertex (graph theory); Mathematical economics; Partition (number theory); Discrete mathematics; Probabilistic logic; Set (abstract data type); Graph; Computer science; Statistics","score_opus":0.11645567910200043,"score_gpt":0.42103913811631416,"score_spread":0.3045834590143137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141806469","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.98723674,0.00010806706,0.00040055014,0.006385693,0.000074658106,0.00012029004,0.00006956221,0.000015713189,0.005588699],"genre_scores_gemma":[0.99885046,8.155759e-7,0.00006867093,0.0004393316,0.00023899881,0.000012807382,0.0000023715152,0.00000412581,0.000382396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921626,0.000056852365,0.00017405531,0.00012937102,0.000267526,0.00015595612],"domain_scores_gemma":[0.9993647,0.00023066197,0.00006899602,0.00014726252,0.00009220277,0.00009618279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058340456,0.000060903163,0.0001430349,0.000048924117,0.000248283,0.000038168564,0.00018568049,0.000052250834,0.000649038],"category_scores_gemma":[0.00034423807,0.00004580295,0.000044580767,0.00032202576,0.00006937589,0.00012713847,0.00006513633,0.000060099675,0.00009564613],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044569122,0.00020608092,0.12922737,0.000024171643,0.00004067659,3.829412e-7,0.03220115,0.000003416212,0.004113308,0.7179148,0.02649998,0.089724064],"study_design_scores_gemma":[0.00016343681,0.000027639977,0.25543112,0.0000035045007,0.00001066927,0.0000015923524,0.0038237707,0.0000012568723,0.00029560653,0.017712748,0.72243893,0.0000897029],"about_ca_topic_score_codex":0.000056620378,"about_ca_topic_score_gemma":0.0000369878,"teacher_disagreement_score":0.7002021,"about_ca_system_score_codex":0.0000060966345,"about_ca_system_score_gemma":0.000009976596,"threshold_uncertainty_score":0.7106511},"labels":[],"label_agreement":null},{"id":"W2143451091","doi":"10.1007/978-3-642-22006-7_51","title":"Automatizability and Simple Stochastic Games","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Simple (philosophy); Time complexity; Computational complexity theory; Computer science; Discrete mathematics; Connection (principal bundle); Mathematics; Theoretical computer science; Algorithm","score_opus":0.0653638619749691,"score_gpt":0.33283740400414724,"score_spread":0.26747354202917817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143451091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030564303,0.00015682381,0.98894143,0.00024897442,0.00029807567,0.00032137308,0.000016255217,0.00006972758,0.0068909354],"genre_scores_gemma":[0.97757834,0.0000044974545,0.021179331,0.00042205278,0.00013851942,0.00001017865,0.0000018406552,0.000015400934,0.00064981397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967323,0.00005397278,0.00058331847,0.0012940331,0.000988568,0.0003477932],"domain_scores_gemma":[0.99547184,0.00249421,0.0002803167,0.0013297142,0.00025230553,0.0001716044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835783,0.00030371762,0.00045011265,0.0004968323,0.00025975937,0.00035259398,0.0017724597,0.00019117541,0.0004426051],"category_scores_gemma":[0.0010362671,0.00022591735,0.000080712925,0.00045529808,0.001938005,0.00025429807,0.0007785324,0.00041289756,0.0001871725],"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.0000065959052,0.00002024738,0.00010640076,0.0000071101654,0.0000036144852,0.000003865258,0.0010085397,0.0040624416,0.000044934244,0.0696527,0.00004164749,0.9250419],"study_design_scores_gemma":[0.000072871604,0.00005203398,0.0009975446,0.000038202736,0.000005860429,0.000020468837,5.247252e-7,0.037692066,0.00011251451,0.95932436,0.0014348383,0.00024868894],"about_ca_topic_score_codex":0.000014188192,"about_ca_topic_score_gemma":0.000054326632,"teacher_disagreement_score":0.97452193,"about_ca_system_score_codex":0.00006035826,"about_ca_system_score_gemma":0.00020246132,"threshold_uncertainty_score":0.92126423},"labels":[],"label_agreement":null},{"id":"W2144085792","doi":"10.1016/j.geb.2003.09.009","title":"Reinterpreting mixed strategy equilibria: a unification of the classical and Bayesian views","year":2004,"lang":"en","type":"article","venue":"Games and Economic Behavior","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":"Simon Fraser University","funders":"","keywords":"Mathematical economics; Unification; Bayesian game; Strategy; Interpretation (philosophy); Event (particle physics); Mathematics; Bayesian probability; Nash equilibrium; Von Neumann architecture; Type (biology); Computer science; Repeated game; Game theory; Statistics; Pure mathematics","score_opus":0.083668316898636,"score_gpt":0.3487462139057993,"score_spread":0.2650778970071633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144085792","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.9968228,0.00008107241,0.00053818576,0.0012660321,0.00007196738,0.00017500497,0.000016492497,0.000007894843,0.0010205462],"genre_scores_gemma":[0.99918854,0.000015421485,0.00020505679,0.000028616692,0.000023582172,0.000025823183,9.820358e-7,0.0000046056675,0.0005073641],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99913484,0.0000602333,0.00038543073,0.0002547926,0.00006436053,0.000100360165],"domain_scores_gemma":[0.99926335,0.00013265315,0.00018770322,0.00034298046,0.000017245655,0.00005607685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060938793,0.000073524854,0.0001588072,0.00003470838,0.00008666724,0.00009173953,0.00023352234,0.000049154285,0.00008873259],"category_scores_gemma":[0.00005065787,0.000048277376,0.00005298511,0.00006174597,0.00023007698,0.00012326844,0.00009131441,0.00007184022,0.00002146193],"study_design_candidate":"observational","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.000058193775,0.00018594222,0.04453237,0.000013392822,0.000018709497,0.0000012126482,0.0023079063,0.00039143467,0.058391254,0.37583777,0.0005624039,0.5176994],"study_design_scores_gemma":[0.0009913925,0.00014112092,0.835775,0.00006368867,0.000109909204,0.00006463681,0.0040904502,0.0025647995,0.009454582,0.13771369,0.0086947065,0.00033598967],"about_ca_topic_score_codex":0.000025584883,"about_ca_topic_score_gemma":0.00009478649,"teacher_disagreement_score":0.79124266,"about_ca_system_score_codex":0.000018329796,"about_ca_system_score_gemma":0.000036707366,"threshold_uncertainty_score":0.19686943},"labels":[],"label_agreement":null},{"id":"W2145075030","doi":"10.1109/gamenets.2009.5137398","title":"Nash equilibrium design and optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Mathematical optimization; Computer science; Epsilon-equilibrium; Best response; Maximization; Context (archaeology); Class (philosophy); Game theory; Mathematical economics; Correlated equilibrium; Equilibrium selection; Repeated game; Mathematics; Artificial intelligence","score_opus":0.12237324464206464,"score_gpt":0.37965888978376616,"score_spread":0.2572856451417015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145075030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017449362,0.000019451974,0.9537318,0.0024905098,0.00001671314,0.00009790124,3.7850276e-7,0.00004347661,0.026150448],"genre_scores_gemma":[0.8812939,0.000002792139,0.11233374,0.00063036766,0.000017661923,0.0000025561394,5.369932e-7,0.0000015777332,0.0057168966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993565,0.00006994119,0.00014541548,0.00016418677,0.00019039305,0.0000735783],"domain_scores_gemma":[0.99928844,0.00036071637,0.000034068464,0.00020848116,0.00005842404,0.000049867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009328113,0.000039477607,0.000059841856,0.000049384278,0.000054744367,0.00012431295,0.00016644542,0.000022444694,0.00067307113],"category_scores_gemma":[0.0002533875,0.00002695981,0.0000136724,0.0002619418,0.000032000567,0.00017950048,0.000018989243,0.000023361934,0.00017541306],"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.00004112381,0.000093400915,0.00013293442,4.7775814e-7,0.0000035627681,0.0000012471464,0.00038845715,0.38409224,0.011904356,0.41356117,0.025159415,0.16462162],"study_design_scores_gemma":[0.00018336723,0.00008700476,0.0014985037,0.0000017100272,0.000004134329,0.0000083416835,0.00016334743,0.30305114,0.0050778706,0.6852581,0.004554102,0.00011238883],"about_ca_topic_score_codex":3.7020342e-7,"about_ca_topic_score_gemma":9.3866575e-8,"teacher_disagreement_score":0.8638445,"about_ca_system_score_codex":0.0000025374834,"about_ca_system_score_gemma":0.000008899881,"threshold_uncertainty_score":0.7369657},"labels":[],"label_agreement":null},{"id":"W2145512846","doi":"10.5555/1283383.1283505","title":"The effectiveness of Stackelberg strategies and tolls for network congestion games","year":2007,"lang":"en","type":"article","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stackelberg competition; Price of anarchy; Nash equilibrium; Latency (audio); Computer science; Mathematical optimization; Routing (electronic design automation); Flow network; Fraction (chemistry); Mathematics; Mathematical economics; Price of stability; Computer network; Economics","score_opus":0.03752062540813494,"score_gpt":0.35363923998114605,"score_spread":0.3161186145730111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145512846","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.7555816,0.00063305075,0.24130867,0.0005904254,0.00030270295,0.0007906488,0.00007376777,0.00008954737,0.0006295366],"genre_scores_gemma":[0.9926812,0.000052722182,0.007062737,0.000009699312,0.00003547624,0.000093945186,0.000005300744,0.000009993649,0.0000489415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981365,0.000091263064,0.0007609599,0.00036599877,0.0003110051,0.00033425255],"domain_scores_gemma":[0.9957813,0.0025960144,0.0004369298,0.00066193455,0.00045914503,0.00006468834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009267842,0.00016160742,0.0004015343,0.00028524798,0.00034323244,0.000059554095,0.00072098215,0.0002893965,0.0000042430443],"category_scores_gemma":[0.0034446684,0.00010569117,0.00009886864,0.0012069908,0.0018880618,0.0002023001,0.0001618065,0.00019743545,0.000008771385],"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.0002923761,0.000032991025,0.0011355303,0.00003951722,0.000025659483,8.0118383e-7,0.00001746426,0.0005790679,0.008140866,0.9138022,0.00012851172,0.07580502],"study_design_scores_gemma":[0.00037515195,0.00017756638,0.0034699193,0.000088173954,0.000029739092,0.000009110269,0.00082044053,0.00020703042,0.05389201,0.86665606,0.07414765,0.00012714721],"about_ca_topic_score_codex":0.000006783775,"about_ca_topic_score_gemma":0.000048824284,"teacher_disagreement_score":0.23709954,"about_ca_system_score_codex":0.000021832298,"about_ca_system_score_gemma":0.00009466573,"threshold_uncertainty_score":0.6956642},"labels":[],"label_agreement":null},{"id":"W2145534428","doi":"","title":"Information Aggregation Under Strategic Delay","year":2008,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quality (philosophy); Product (mathematics); Imperfect; Private information retrieval; Perfect information; Business; Microeconomics; Marketing; Economics; Computer science; Mathematics; Computer security","score_opus":0.06462965619158653,"score_gpt":0.3307737722740997,"score_spread":0.2661441160825132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145534428","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.8921523,0.00020920219,0.09675783,0.0010861865,0.00010121029,0.0000827758,0.0000016679891,0.00002850507,0.009580309],"genre_scores_gemma":[0.99707496,0.00048353116,0.00008108957,0.00020478472,0.00011202638,0.000004737061,0.000004248517,0.0000046197765,0.00203002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977274,0.0001317202,0.0004897011,0.00009968454,0.00068727863,0.0008642081],"domain_scores_gemma":[0.99892426,0.00017462698,0.00030967145,0.00023918672,0.00027435864,0.00007788222],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003539061,0.00009173772,0.00011157217,0.00020252386,0.00053681445,0.00014853933,0.0004602864,0.000058964844,0.00015558225],"category_scores_gemma":[0.0001730381,0.000067493485,0.000087891625,0.00053745956,0.000076760945,0.0011480188,0.000022456736,0.0007937841,0.0013975638],"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.000018432716,0.000020553724,0.00029992167,2.2561271e-7,0.000015088189,5.381707e-7,0.00032833396,0.0011408124,0.00008175996,0.9833479,0.00020006791,0.014546382],"study_design_scores_gemma":[0.00025395805,0.000074587595,0.0008296279,0.000002037275,0.0000057617685,0.0011928934,0.004791004,0.00029846266,0.00012338624,0.989006,0.003338044,0.000084248735],"about_ca_topic_score_codex":0.000009120587,"about_ca_topic_score_gemma":0.000064731124,"teacher_disagreement_score":0.10492263,"about_ca_system_score_codex":0.0002588598,"about_ca_system_score_gemma":0.0013704489,"threshold_uncertainty_score":0.99938},"labels":[],"label_agreement":null},{"id":"W2146443647","doi":"10.1109/cdc.2009.5400496","title":"Auctions on networks: Efficiency, consensus, passivity, rates of convergence","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Common value auction; Combinatorial auction; Computer science; Mathematical optimization; Limit (mathematics); Nash equilibrium; Convergence (economics); Vertex (graph theory); Mathematical economics; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Economics; Statistics","score_opus":0.10550894235289797,"score_gpt":0.4120707234704191,"score_spread":0.30656178111752114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146443647","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.7920128,0.00006745045,0.11377406,0.008144267,0.00039325075,0.0003252806,0.000015540289,0.00010912146,0.08515819],"genre_scores_gemma":[0.9947955,0.000008222146,0.0005230101,0.0004669864,0.00003796557,0.000004651421,9.377782e-7,0.0000023750486,0.0041603297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985611,0.00013039754,0.000422257,0.00028823118,0.0004308215,0.00016718803],"domain_scores_gemma":[0.99742043,0.0015704659,0.00016220484,0.00055603834,0.00020990762,0.00008094409],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001158524,0.00008888901,0.00017542248,0.00010843307,0.00016824306,0.00004360027,0.00045725232,0.00004585789,0.0012541581],"category_scores_gemma":[0.00070106296,0.00006073347,0.00008054267,0.0008964647,0.00023455135,0.00005038679,0.00003115807,0.00008869341,0.000483338],"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.000039667775,0.00045361568,0.0026385675,7.7504194e-7,0.0000069736293,0.0000015830931,0.00012310118,0.020920848,0.0034120458,0.90381175,0.037885547,0.03070552],"study_design_scores_gemma":[0.0006089278,0.0006918066,0.13061951,0.00003559136,0.000025921843,0.00002508091,0.0013369035,0.08338355,0.038354065,0.72374713,0.020694058,0.00047746004],"about_ca_topic_score_codex":0.000007849765,"about_ca_topic_score_gemma":0.000007226994,"teacher_disagreement_score":0.20278268,"about_ca_system_score_codex":0.0000075225453,"about_ca_system_score_gemma":0.000035343404,"threshold_uncertainty_score":0.9996588},"labels":[],"label_agreement":null},{"id":"W2146578304","doi":"10.1007/s11408-008-0093-7","title":"Do German security analysts herd?","year":2008,"lang":"en","type":"article","venue":"Financial markets and portfolio management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Berger (Canada)","funders":"Eberhard Karls Universität Tübingen; Universiteit Maastricht; Deutsche Forschungsgemeinschaft","keywords":"German; Economics; Financial economics; Herd; Econometrics; Philosophy; Linguistics; Medicine","score_opus":0.040466041531314126,"score_gpt":0.33872627688379775,"score_spread":0.29826023535248364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146578304","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.7821721,0.00019468751,0.000588784,0.00034266504,0.00015754742,0.00025545526,0.000014948877,0.000038492522,0.21623534],"genre_scores_gemma":[0.9864183,0.00040785014,0.00020527774,0.00043732312,0.0001123524,0.000039108178,0.0000052269374,0.000007471911,0.012367055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980774,0.000104549494,0.0004545284,0.0004995127,0.0005984724,0.00026554536],"domain_scores_gemma":[0.9988782,0.00011982187,0.00016501044,0.00061778363,0.000080696635,0.00013852544],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015756559,0.00015458469,0.0002448628,0.0002379342,0.00041197968,0.00010227891,0.000416473,0.000046618432,0.0012749889],"category_scores_gemma":[0.00012223156,0.00012357383,0.00010015995,0.00071243366,0.00014106731,0.00016988002,0.0002583553,0.000099083554,0.0002645811],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015043856,0.0002596031,0.023642682,0.000022316684,0.000050857227,0.00049919117,0.0008932537,0.000007995932,0.000011961287,0.40756902,0.3631131,0.20377958],"study_design_scores_gemma":[0.00017845571,0.000015394602,0.35604718,0.000006161464,0.000015859887,0.000023841107,0.00006149288,0.000045074597,0.000009874346,0.123242214,0.5202265,0.00012797448],"about_ca_topic_score_codex":0.000011259427,"about_ca_topic_score_gemma":0.000010448746,"teacher_disagreement_score":0.3324045,"about_ca_system_score_codex":0.000013548945,"about_ca_system_score_gemma":0.000020634092,"threshold_uncertainty_score":0.99963796},"labels":[],"label_agreement":null},{"id":"W2146756943","doi":"10.1111/j.0008-4085.2006.00353.x","title":"Social interactions in small groups","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Economics/Revue canadienne d économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Peer group; Group (periodic table); Youth smoking; Range (aeronautics); Social psychology; Value (mathematics); Variation (astronomy); Degree (music); Social influence; Psychology; Ethnic group; Econometrics; Economics; Mathematics; Statistics; Physics; Sociology; Engineering; Medicine","score_opus":0.31389714312217487,"score_gpt":0.269935354368607,"score_spread":0.043961788753567876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146756943","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.98576456,0.000041730014,0.00019545523,0.0054109837,0.00066845055,0.0001273128,0.00007581746,0.000003623515,0.0077120736],"genre_scores_gemma":[0.9968286,0.0000034841778,0.00025394902,0.00032610938,0.0008327303,0.000012219979,0.0000065483387,0.000020686486,0.0017156599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977343,0.00012373063,0.001299625,0.0003091975,0.0000035676228,0.00052956125],"domain_scores_gemma":[0.99752027,0.00051102234,0.0007063023,0.00032806638,0.00022495094,0.00070938334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018385235,0.00017256405,0.0004666879,0.0012555233,0.00022854113,0.00025976458,0.00091916724,0.000091282294,0.0006059202],"category_scores_gemma":[0.0003812121,0.00019024101,0.00023178989,0.00035145474,0.0001757802,0.00045239148,0.00002001895,0.00037735584,0.000116786425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021896782,0.000016084983,0.0123831155,0.0000018772571,0.000014206732,0.000052997424,0.00071996794,0.0040042102,0.000026851272,0.9765201,0.0022046387,0.0040340107],"study_design_scores_gemma":[0.00034155912,0.00003770703,0.015613902,0.000013949135,0.000009489735,0.00023098732,0.0008611423,0.0005143902,0.000053726766,0.9192738,0.06285248,0.00019688389],"about_ca_topic_score_codex":0.1513575,"about_ca_topic_score_gemma":0.9975515,"teacher_disagreement_score":0.846194,"about_ca_system_score_codex":0.0012396849,"about_ca_system_score_gemma":0.0012491255,"threshold_uncertainty_score":0.8542937},"labels":[],"label_agreement":null},{"id":"W2147708265","doi":"10.1080/08850607.2013.807189","title":"Sharing Secrets: A Game Theoretic Analysis of International Intelligence Cooperation","year":2013,"lang":"en","type":"article","venue":"International Journal of Intelligence and CounterIntelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bachelor; George (robot); Schools of economic thought; Library science; Strategic studies; Political science; State (computer science); Game theory; Charter; Management; Treaty; Visitor pattern; Operations research; Media studies; Public administration; Sociology; Law; Engineering; History; Computer science; Economics; Art history","score_opus":0.0689659842742305,"score_gpt":0.3865906723520848,"score_spread":0.31762468807785427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147708265","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.3873591,0.00034040576,0.607877,0.0010581453,0.0010081559,0.00018726135,0.000034780554,0.000015106895,0.0021200427],"genre_scores_gemma":[0.99539614,0.0020529844,0.0015492437,0.00036065897,0.00018120272,0.000019952995,0.0000095723235,0.0000151416125,0.0004150892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99449134,0.00013891154,0.002596437,0.0005567234,0.0019403097,0.00027628717],"domain_scores_gemma":[0.99118394,0.0011686026,0.0015816938,0.0005868808,0.0052685007,0.00021037558],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027430623,0.0002881302,0.0006425334,0.001652207,0.000077575816,0.0006903675,0.0037247855,0.000118822645,0.0060687116],"category_scores_gemma":[0.0020420987,0.00022419415,0.00043335382,0.001529779,0.00058915484,0.0013394237,0.0004291864,0.00035017813,0.00022098533],"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.0005519334,0.00069259526,0.033198457,0.00001954281,0.0033097863,0.000054060914,0.008957058,0.05492359,0.012836472,0.3904071,0.00031761584,0.49473178],"study_design_scores_gemma":[0.00027013736,0.000716787,0.017023595,0.00043517002,0.0006980375,0.0006307447,0.01787257,0.32619587,0.07763513,0.5474078,0.010120181,0.0009939921],"about_ca_topic_score_codex":0.000102475184,"about_ca_topic_score_gemma":0.000029305864,"teacher_disagreement_score":0.60803705,"about_ca_system_score_codex":0.000098829,"about_ca_system_score_gemma":0.00009947174,"threshold_uncertainty_score":0.99483985},"labels":[],"label_agreement":null},{"id":"W2148055514","doi":"10.1214/07-aap456","title":"Mafia: A theoretical study of players and coalitions in a partial information environment","year":2008,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Microsoft Research; Natural Sciences and Engineering Research Council of Canada; Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; U.S. Department of Defense; National Science Foundation","keywords":"Identity (music); Order (exchange); Collective identity; Function (biology); Democracy; Computer security; Computer science; Political science; Law and economics; Internet privacy; Advertising; Social psychology; Public relations; Sociology; Business; Law; Psychology; Politics; Aesthetics; Art","score_opus":0.19284613128862585,"score_gpt":0.3716719498098492,"score_spread":0.17882581852122334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148055514","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.9947799,0.0000056739527,0.0005364446,0.0007354094,0.0000056064328,0.0008827179,0.00002349737,0.0000049314535,0.0030258354],"genre_scores_gemma":[0.9996456,0.000010269312,0.00013498231,0.00006270102,0.0000050853814,0.00013385613,0.0000017256849,0.0000017406342,0.000004066356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982489,0.00019903365,0.0007663679,0.00017341625,0.0004877899,0.00012451052],"domain_scores_gemma":[0.99824667,0.0008190255,0.00023265941,0.00059567293,0.000060903574,0.00004505918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003931679,0.000078199155,0.00021966544,0.00006483942,0.000108475215,0.000011816744,0.00031755285,0.000037140704,0.00018348088],"category_scores_gemma":[0.00027795832,0.000048631297,0.00003705398,0.00026656195,0.0010321579,0.0001203702,0.00013431902,0.00010115297,0.000028463734],"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.0006004271,0.0012449096,0.0076754587,0.000009339484,0.00001638625,2.0839346e-7,0.020276831,0.002725333,0.00027459755,0.9611752,0.00007623012,0.0059250495],"study_design_scores_gemma":[0.0004913711,0.00018081078,0.10122003,0.0000032120224,0.000008178585,0.0000017598351,0.005412251,0.00046387408,0.0022055192,0.8896056,0.0003372537,0.000070144684],"about_ca_topic_score_codex":0.00001825615,"about_ca_topic_score_gemma":0.0000064138762,"teacher_disagreement_score":0.09354457,"about_ca_system_score_codex":0.0000057356087,"about_ca_system_score_gemma":0.0000250222,"threshold_uncertainty_score":0.38030288},"labels":[],"label_agreement":null},{"id":"W2148660237","doi":"10.1109/91.940972","title":"Fuzzy approaches to the game of Chicken","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Fuzzy logic; Game theory; Computer science; Fuzzy set; Dimension (graph theory); Decision theory; Artificial intelligence; Sequential game; Complete information; Mathematics; Mathematical economics","score_opus":0.2623317297591256,"score_gpt":0.33469995368992267,"score_spread":0.07236822393079706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148660237","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.2647649,0.00015607738,0.640186,0.005538936,0.0017277928,0.0016423711,0.00016046183,0.00014358212,0.085679844],"genre_scores_gemma":[0.98929626,0.000010146196,0.00009840215,0.00011819678,0.0001236208,0.00027174683,8.666936e-7,0.00001615203,0.010064627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973169,0.00037899535,0.0006987745,0.00043843547,0.0009058536,0.0002610689],"domain_scores_gemma":[0.9973401,0.00091259513,0.00018719934,0.0012768972,0.00013064082,0.00015261021],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021559864,0.00017040179,0.00032117937,0.00027602812,0.00028482545,0.00014370545,0.0010235049,0.00008876736,0.00009207593],"category_scores_gemma":[0.00004772299,0.00010437166,0.00019370568,0.0015338607,0.00013209379,0.0001451094,0.0000032007645,0.0002093151,0.0019074549],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045814976,0.0013408909,0.0003082376,0.000046130484,0.00024445343,0.000007390703,0.010863205,0.6997354,0.004990116,0.12134841,0.0101091685,0.15054843],"study_design_scores_gemma":[0.0031464994,0.0015753594,0.006336794,0.00043523402,0.00042451522,0.000617216,0.04819642,0.01819695,0.030791517,0.15919793,0.72869533,0.0023862119],"about_ca_topic_score_codex":0.000100445766,"about_ca_topic_score_gemma":0.0000991393,"teacher_disagreement_score":0.72453135,"about_ca_system_score_codex":0.00003088768,"about_ca_system_score_gemma":0.000043563537,"threshold_uncertainty_score":0.99886966},"labels":[],"label_agreement":null},{"id":"W2149230698","doi":"10.1016/s0166-0462(01)00108-9","title":"Asymmetric information and product differentiation","year":2003,"lang":"en","type":"article","venue":"Regional Science and Urban Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"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; Center for Interuniversity Research and Analysis on Organizations","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Information asymmetry; Product differentiation; Distortion (music); Incentive; Asymmetry; Product (mathematics); Complete information; Yield (engineering); Microeconomics; Economics; Computer science; Mathematics; Telecommunications; Cournot competition","score_opus":0.05667768581986354,"score_gpt":0.29263471667906915,"score_spread":0.2359570308592056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149230698","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.98971486,0.000121657344,0.00075607095,0.001348501,0.000073542564,0.000110913024,0.0000029014832,0.0000090677495,0.007862482],"genre_scores_gemma":[0.998957,0.000121083875,0.00033560427,0.0003273826,0.000022764088,0.0000060472057,0.0000013915728,0.0000012800531,0.00022745194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991578,0.000025164081,0.00023127123,0.00023339124,0.00022576284,0.00012661787],"domain_scores_gemma":[0.9992448,0.00017252212,0.00013284331,0.0001901214,0.00016014471,0.00009954905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167108,0.000057353653,0.00008022254,0.0002870229,0.00033110453,0.00036488197,0.00019414695,0.00001821654,0.000015637195],"category_scores_gemma":[0.00094920094,0.000044622782,0.000013997272,0.00067403296,0.00037855798,0.0014719338,0.000038665396,0.00003985708,0.00005648258],"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.0000037423122,0.000013619957,0.018921781,0.0000012139071,0.0000015881078,2.3490669e-8,0.00020505385,0.000028939376,0.00009410665,0.89726096,0.002151454,0.081317484],"study_design_scores_gemma":[0.00024948944,0.000034179528,0.28182647,0.0000028645118,0.000005823406,0.000031062376,0.00043308435,0.0036559477,0.00081929343,0.30352288,0.4092339,0.00018499463],"about_ca_topic_score_codex":0.000002927087,"about_ca_topic_score_gemma":0.00000223336,"teacher_disagreement_score":0.5937381,"about_ca_system_score_codex":0.000031111147,"about_ca_system_score_gemma":0.000112185895,"threshold_uncertainty_score":0.3518565},"labels":[],"label_agreement":null},{"id":"W2149760726","doi":"10.1007/s10898-010-9585-x","title":"Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Game Theory and Applications","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Stackelberg competition; Oligopoly; Predatory pricing; Order (exchange); Competitor analysis; Microeconomics; Production (economics); Economics; Incentive; Linearization; Mathematical optimization; Mathematical economics; Cournot competition; Mathematics; Monopoly; Nonlinear system","score_opus":0.033877502786391935,"score_gpt":0.36451989184276096,"score_spread":0.330642389056369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149760726","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.71624887,0.00003740075,0.27968448,0.0002199655,0.00025226286,0.00026779904,0.000008890984,0.000011694899,0.0032686316],"genre_scores_gemma":[0.93684775,0.0000066391444,0.06282807,0.000086209926,0.00012858877,0.0000072640237,0.0000026095158,0.000006180576,0.00008666722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751645,0.0002911091,0.001055708,0.00021730282,0.00074735517,0.00017206883],"domain_scores_gemma":[0.99772483,0.00024521415,0.00087212824,0.00034455667,0.0006528679,0.00016040212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034853823,0.00011913028,0.00039856165,0.00016479677,0.000078497804,0.00023282216,0.00060191524,0.000115334056,0.00017919573],"category_scores_gemma":[0.0022729458,0.000085186024,0.000119443575,0.0008311374,0.00008181967,0.00091605977,0.00004110631,0.00029477384,0.000011937681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006796499,0.0005484709,0.012718845,0.0000024033507,0.000018223425,0.00000544422,0.00058593176,0.96855456,0.0014334266,0.009837913,0.00018286653,0.005432292],"study_design_scores_gemma":[0.008781761,0.00025745854,0.03017679,0.000020889074,0.00004404731,0.00018435613,0.0019686983,0.94503975,0.0001157032,0.011481897,0.0016669338,0.0002617053],"about_ca_topic_score_codex":0.0000069560456,"about_ca_topic_score_gemma":0.000037188624,"teacher_disagreement_score":0.22059889,"about_ca_system_score_codex":0.00007513544,"about_ca_system_score_gemma":0.00017951068,"threshold_uncertainty_score":0.34737852},"labels":[],"label_agreement":null},{"id":"W2152637167","doi":"10.1007/978-3-540-92185-1_55","title":"Efficiency, Fairness and Competitiveness in Nash Bargaining Games","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Bargaining problem; Mathematical economics; Nash equilibrium; Class (philosophy); Computer science; Property (philosophy); Game theory; Mathematical optimization; Microeconomics; Mathematics; Economics; Artificial intelligence","score_opus":0.04870399202765213,"score_gpt":0.31960528577446795,"score_spread":0.2709012937468158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152637167","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.01881972,0.00060202036,0.95821685,0.00032206636,0.00040880308,0.00037362557,0.000012218925,0.00004996327,0.021194763],"genre_scores_gemma":[0.9851369,0.000073399184,0.013581383,0.00047057433,0.00013708284,0.000011531936,0.0000024584858,0.000019876334,0.00056677544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957803,0.00010053849,0.0007258073,0.0015406734,0.0013608455,0.00049182255],"domain_scores_gemma":[0.99521357,0.0031834692,0.00028393505,0.00091197237,0.00026082958,0.0001462258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029746047,0.0003814628,0.0006289708,0.0011468685,0.0003339582,0.00036780257,0.0020610376,0.0002326305,0.00011242382],"category_scores_gemma":[0.0006094573,0.00031092716,0.000081501275,0.0011343533,0.002335498,0.00031062655,0.0008388639,0.0006428772,0.00008063549],"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.000015832618,0.000048249432,0.0023582089,0.000010243542,0.0000034148843,0.00009101952,0.0029977444,0.022863576,0.00014968324,0.06297425,0.000009123886,0.9084787],"study_design_scores_gemma":[0.0006665079,0.0001581723,0.011147221,0.0006667826,0.0000075079593,0.0002524942,0.0000153801,0.10679886,0.0012671949,0.8677506,0.010125167,0.0011441027],"about_ca_topic_score_codex":0.000017728536,"about_ca_topic_score_gemma":0.00011107662,"teacher_disagreement_score":0.9663172,"about_ca_system_score_codex":0.00010606731,"about_ca_system_score_gemma":0.00033599997,"threshold_uncertainty_score":0.99993426},"labels":[],"label_agreement":null},{"id":"W2152737273","doi":"","title":"CREDIBILITY FOR SALE - THE EFFECT OF DISCLOSURE ON INFORMATION ACQUISITION AND TRANSMISSION","year":2010,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Credibility; Reputation; Quality (philosophy); Source credibility; Cheap talk; Business; Transmission (telecommunications); Information transmission; Internet privacy; Actuarial science; Computer science; Telecommunications; Microeconomics; Economics","score_opus":0.04854067664773104,"score_gpt":0.39597564052051293,"score_spread":0.3474349638727819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152737273","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.98827213,0.0000179648,0.00026828208,0.001022756,0.000119102755,0.0016778843,0.0001761585,0.000009868975,0.008435837],"genre_scores_gemma":[0.9989443,0.00018562155,0.00019925465,0.000025274778,0.000061695086,0.00037789767,0.00004564678,0.0000082728475,0.00015203413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770665,0.00055727555,0.0006834362,0.00043104994,0.00039395285,0.00022766102],"domain_scores_gemma":[0.99117374,0.007252615,0.00027269215,0.0010618243,0.00015577709,0.00008337685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01350221,0.0001465417,0.000333882,0.00020976094,0.00022201195,0.00017633909,0.0007330543,0.00030781302,0.00006785044],"category_scores_gemma":[0.0021049625,0.00008965185,0.00014574868,0.00012548556,0.0004337434,0.00018275608,0.00028569717,0.00088015164,0.0000068088398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008165115,0.000049323775,0.0033333977,0.00014371662,0.000015321424,1.17272954e-7,0.00070702896,0.0036565673,0.00077672943,0.003709595,0.0000929272,0.98669875],"study_design_scores_gemma":[0.0038732642,0.0024841141,0.20575625,0.00054789276,0.00005857412,0.000008971828,0.0021743719,0.10547594,0.026046844,0.54212147,0.110591285,0.0008610315],"about_ca_topic_score_codex":0.000010028314,"about_ca_topic_score_gemma":0.000022805985,"teacher_disagreement_score":0.98583776,"about_ca_system_score_codex":0.000077169185,"about_ca_system_score_gemma":0.000111976784,"threshold_uncertainty_score":0.46796235},"labels":[],"label_agreement":null},{"id":"W2152855671","doi":"","title":"Hypergame Analysis in E-Commerce: A Preliminary Report","year":2002,"lang":"en","type":"preprint","venue":"Érudit documents and data repository (Érudit Consortium, University of Montreal)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Humanities; Political science; Philosophy","score_opus":0.05380133504300256,"score_gpt":0.3128088996845394,"score_spread":0.25900756464153685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152855671","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.9558682,0.0028144643,0.0018747491,0.0021703655,0.0005417512,0.0011174044,0.0022030915,0.000112475325,0.033297528],"genre_scores_gemma":[0.9655191,0.00154557,0.00080824946,0.000040137413,0.00008044705,0.0000047171175,0.0008202449,0.000019769983,0.031161817],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9939861,0.00061269803,0.0014466008,0.0022986056,0.0012415145,0.00041444757],"domain_scores_gemma":[0.990552,0.0011899808,0.0019315126,0.0056490623,0.0003620019,0.00031543043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020618297,0.0004788087,0.0013994217,0.0010582531,0.0004416944,0.00021525334,0.0034162065,0.00043774085,0.00046550928],"category_scores_gemma":[0.00062065513,0.00048607652,0.00035617358,0.0011067308,0.0006552625,0.0006841089,0.0049219606,0.00064823346,0.000044304266],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023024683,0.0044603995,0.561029,0.00051473104,0.008805987,0.020914696,0.0034365722,0.008667028,0.00063988235,0.0033269806,0.29080236,0.095099874],"study_design_scores_gemma":[0.0031776142,0.00027953344,0.5712659,0.00044835734,0.0061626835,0.00084216334,0.004515934,0.013459643,0.00011277673,0.015086813,0.3825728,0.0020757706],"about_ca_topic_score_codex":0.012174526,"about_ca_topic_score_gemma":0.0073104193,"teacher_disagreement_score":0.093024105,"about_ca_system_score_codex":0.0002448827,"about_ca_system_score_gemma":0.00016096966,"threshold_uncertainty_score":0.9997591},"labels":[],"label_agreement":null},{"id":"W2153512042","doi":"10.5539/ibr.v2n4p194","title":"Research on the Sino-us Trade Conflict and Countermeasures","year":2009,"lang":"en","type":"article","venue":"International Business Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pace; China; International trade; Competition (biology); Globalization; Economics; Trade barrier; Economic globalization; World economy; Economic integration; Capital (architecture); International economics; Business; Market economy; Political science; Law","score_opus":0.5035134762892266,"score_gpt":0.5610801632563265,"score_spread":0.05756668696709988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153512042","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.68812346,0.00014487293,0.00019110048,0.19440031,0.0001624784,0.00038135028,0.000032022148,0.000026743985,0.11653765],"genre_scores_gemma":[0.99434215,0.00010368848,0.000020281343,0.0010255963,0.00028781348,0.000051973155,0.00000473094,0.00000751557,0.004156279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9927732,0.0009591564,0.0003426524,0.00050302886,0.005019001,0.00040295647],"domain_scores_gemma":[0.9890404,0.0076885866,0.000054708904,0.0006652612,0.0024427394,0.000108320884],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015675949,0.00010336549,0.00013142044,0.00070717925,0.00076488534,0.00104564,0.0019888198,0.00007243813,0.0008681877],"category_scores_gemma":[0.006696408,0.000060730163,0.00004083729,0.001951149,0.0009080121,0.00022714706,0.00019359292,0.000712554,0.0009007901],"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.0004983976,0.0004664639,0.0034889642,0.0000034971006,0.00003357605,0.000035871537,0.00080697914,0.0002594486,0.0124575235,0.73542655,0.18808539,0.058437318],"study_design_scores_gemma":[0.00020611804,0.000069373884,0.48996466,0.000031794516,9.4556935e-7,0.000019641071,0.0006519127,0.00039209597,0.0012371379,0.15916324,0.34818357,0.000079491256],"about_ca_topic_score_codex":0.000046773635,"about_ca_topic_score_gemma":0.00001863778,"teacher_disagreement_score":0.57626337,"about_ca_system_score_codex":0.00007578615,"about_ca_system_score_gemma":0.00013056688,"threshold_uncertainty_score":0.99999136},"labels":[],"label_agreement":null},{"id":"W2153590377","doi":"","title":"E¢ cient Dynamic Coordination with Individual Learning","year":2007,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coordination game; Outcome (game theory); Investment (military); Contrast (vision); Microeconomics; Global game; Order (exchange); Private information retrieval; Action (physics); Value (mathematics); Economics; Mathematical economics; Computer science; Business; Mathematics; Artificial intelligence; Political science; Finance; Computer security; Statistics","score_opus":0.09689516098386793,"score_gpt":0.4229724124109885,"score_spread":0.3260772514271206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153590377","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.87888473,0.000046321155,0.0004971785,0.00084688765,0.00016884254,0.00074667914,0.000039793085,0.000051225412,0.11871834],"genre_scores_gemma":[0.9884145,0.00026584935,0.0010509682,0.00006159688,0.0000769171,0.00017272991,0.00007678555,0.000035888064,0.00984473],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952703,0.00066329405,0.0008714406,0.0012559879,0.0012340025,0.0007049865],"domain_scores_gemma":[0.99462736,0.0029793778,0.00041247846,0.0012370703,0.0005308304,0.00021290134],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.017287984,0.00025562156,0.0004477195,0.001374652,0.00037143295,0.0005772364,0.0017764743,0.00035660443,0.00027926848],"category_scores_gemma":[0.0029305385,0.00021889241,0.00012116465,0.00065866654,0.00056486594,0.00015045925,0.0014339742,0.0024469139,0.00013064168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012996535,0.00018878828,0.010328778,0.000020779937,0.000054992288,0.000019370742,0.0012654084,0.10103046,0.00010513037,0.0051237345,0.00010207301,0.88163054],"study_design_scores_gemma":[0.003165892,0.00092775817,0.24396765,0.0006325215,0.00005958523,0.00009802947,0.031015186,0.17776583,0.00067932485,0.253999,0.28502518,0.0026640703],"about_ca_topic_score_codex":0.000018665583,"about_ca_topic_score_gemma":0.0003002459,"teacher_disagreement_score":0.87896645,"about_ca_system_score_codex":0.00059365435,"about_ca_system_score_gemma":0.0005192546,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null},{"id":"W2153797239","doi":"10.5555/2484920.2484962","title":"A parameterized family of equilibrium profiles for three-player kuhn poker","year":2013,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Mathematical economics; Computer science; Sequential equilibrium; Equilibrium selection; Mathematics; Mathematical optimization; Game theory; Algorithm; Repeated game","score_opus":0.1687190440507259,"score_gpt":0.3888617398677378,"score_spread":0.2201426958170119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153797239","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.9189213,0.000019120022,0.06358401,0.0011059721,0.00007224492,0.0009694469,0.000029744082,0.00004069145,0.015257507],"genre_scores_gemma":[0.97381586,3.983368e-7,0.017774463,0.00027849915,0.00003052922,0.00043271107,0.0000034923362,0.000008392888,0.007655644],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985806,0.00005216762,0.0004973786,0.0002976999,0.00037458978,0.00019759519],"domain_scores_gemma":[0.997329,0.0014886296,0.00015819095,0.00060504035,0.00034339615,0.000075774136],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00091331755,0.00009774402,0.00024163722,0.000086640015,0.000049561746,0.00010555065,0.00057340984,0.000056428227,0.0025324835],"category_scores_gemma":[0.0006104833,0.000059886355,0.00013491373,0.00030906269,0.00013346811,0.0002659201,0.00009082133,0.00004090801,0.0012558586],"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.000087703265,0.00015202544,0.0020778738,0.000009799089,0.00002676667,1.4754661e-7,0.0001645627,0.000029269971,0.76484615,0.15392444,0.03925056,0.03943071],"study_design_scores_gemma":[0.00056262285,0.00012619275,0.021759879,0.000006457317,0.000012544199,0.0000015154849,0.00055044115,0.007120792,0.05167576,0.90396357,0.014048382,0.00017185009],"about_ca_topic_score_codex":0.000034942306,"about_ca_topic_score_gemma":0.000006121634,"teacher_disagreement_score":0.7500391,"about_ca_system_score_codex":0.0000040894215,"about_ca_system_score_gemma":0.00003152012,"threshold_uncertainty_score":0.9995218},"labels":[],"label_agreement":null},{"id":"W2154232706","doi":"10.5555/2031678.2031708","title":"A truth serum for sharing rewards","year":2011,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intuition; Incentive; Mechanism (biology); Computer science; Incentive compatibility; Microeconomics; Population; Mechanism design; Group decision-making; Bayesian probability; Aggregate (composite); Artificial intelligence; Psychology; Social psychology; Economics; Cognitive science","score_opus":0.4590567500065678,"score_gpt":0.4445953959181628,"score_spread":0.014461354088405043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154232706","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538471,0.000007289809,0.121570095,0.0003983664,0.00016103474,0.00022462054,0.000015875392,0.00009119402,0.52368444],"genre_scores_gemma":[0.9678566,3.0647607e-7,0.0077240206,0.00017599012,0.00003234488,0.000041577616,3.9332144e-7,0.0000038168014,0.024164977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927473,0.000013009014,0.00019096692,0.00023397908,0.00017009494,0.00011722008],"domain_scores_gemma":[0.99904245,0.00034433397,0.000044837743,0.00042996192,0.000084588864,0.00005381987],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013111613,0.000043347434,0.00007704961,0.000051674513,0.000096600816,0.000048337428,0.000526187,0.000023788774,0.0037689398],"category_scores_gemma":[0.00054256996,0.00002825505,0.000059903825,0.00020108825,0.000030980966,0.000114456365,0.00007035086,0.000026235257,0.0007938719],"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.000013257334,0.00002309493,0.0015711942,6.26764e-7,0.0000027288504,1.3310627e-7,0.00047698326,9.4239135e-7,0.00014298459,0.9740577,0.0024269803,0.021283409],"study_design_scores_gemma":[0.00010437722,0.00002295345,0.007972231,0.0000011733249,0.000003048773,0.0000013108365,0.00051160617,0.00043032545,0.006411454,0.96153224,0.022956315,0.000052945874],"about_ca_topic_score_codex":0.0000055380856,"about_ca_topic_score_gemma":0.000006691476,"teacher_disagreement_score":0.6140095,"about_ca_system_score_codex":0.0000038106446,"about_ca_system_score_gemma":0.000010483939,"threshold_uncertainty_score":0.99998415},"labels":[],"label_agreement":null},{"id":"W2156434939","doi":"10.1109/icsmc.1993.384736","title":"Multiattribute coalition formation analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preference; Computer science; Operations research; Similarity (geometry); Selection (genetic algorithm); Order (exchange); Data mining; Information retrieval; Mathematical economics; Artificial intelligence; Mathematics; Statistics; Economics","score_opus":0.311878123477398,"score_gpt":0.41287803097623743,"score_spread":0.10099990749883941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156434939","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.120172925,0.0000164497,0.8204391,0.0023214591,0.000028318425,0.00009105127,0.000021168793,0.00007162564,0.056837898],"genre_scores_gemma":[0.9872907,0.0000037806094,0.0012957469,0.0002542501,0.000017709108,0.000011696138,0.000013405409,0.0000013150357,0.011111428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989934,0.00008604521,0.00028988277,0.00015160254,0.0003877707,0.00009132434],"domain_scores_gemma":[0.99901855,0.0003479505,0.000089273606,0.00036090205,0.00013461831,0.0000487188],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009035352,0.000043444725,0.0001003939,0.00022989986,0.00012739869,0.000107775704,0.00022283083,0.0000262671,0.01171442],"category_scores_gemma":[0.00028687515,0.000030187226,0.00010733652,0.0017256816,0.000025169245,0.0003899633,0.000023244604,0.00003194159,0.005703812],"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.000014233906,0.00041890953,0.011621808,0.0000028179586,0.00021242653,0.0000018709378,0.0023355454,0.006996673,0.003333288,0.6081305,0.19030607,0.17662582],"study_design_scores_gemma":[0.00037494747,0.000027516575,0.032430064,0.0000014203964,0.00020868455,0.0000046724167,0.0013378803,0.6492584,0.005479929,0.16172656,0.14891593,0.00023405244],"about_ca_topic_score_codex":0.000006366625,"about_ca_topic_score_gemma":0.000027615954,"teacher_disagreement_score":0.86711776,"about_ca_system_score_codex":0.000010754951,"about_ca_system_score_gemma":0.0000011575622,"threshold_uncertainty_score":0.99507034},"labels":[],"label_agreement":null},{"id":"W2157400663","doi":"10.1142/s0219622014500886","title":"Choice Manipulation Through Comparability in Markets with Verifiable Multi-Attribute Products","year":2014,"lang":"en","type":"article","venue":"International Journal of Information Technology & Decision Making","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Verifiable secret sharing; Communication source; Computer science; Reputation; Set (abstract data type); Comparability; Order (exchange); Normative; Unobservable; Microeconomics; Business; Economics; Econometrics; Telecommunications; Mathematics","score_opus":0.060812182796973466,"score_gpt":0.3889951263887927,"score_spread":0.3281829435918192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157400663","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.48446342,0.000020625326,0.51253104,0.0018721506,0.00034456665,0.00014614547,0.000005021812,0.000029023935,0.0005880028],"genre_scores_gemma":[0.91847247,0.0000074544037,0.08114059,0.00026957048,0.00006136389,0.000009609047,0.0000050429358,0.0000056267695,0.000028277653],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99622834,0.00013360477,0.0017566085,0.00021543003,0.0014691742,0.00019682635],"domain_scores_gemma":[0.99373466,0.001402697,0.0016625228,0.0004902415,0.0026722944,0.0000376146],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0042069047,0.00015469793,0.00033232872,0.0014318185,0.000115108145,0.0002629539,0.0015825704,0.00014985955,0.00011857088],"category_scores_gemma":[0.009784168,0.00011297035,0.0000707431,0.0014360242,0.00015455547,0.0030822859,0.0001791203,0.0004123983,0.00016249437],"study_design_candidate":"observational","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.0010918295,0.00040828055,0.24659349,0.000012575954,0.00009269395,0.000013461873,0.0010279947,0.049139418,0.0005641645,0.082180925,0.002116164,0.616759],"study_design_scores_gemma":[0.004476863,0.0002587498,0.51653814,0.00056680717,0.000023869294,0.0005867155,0.0016354958,0.032899804,0.0036034167,0.3152331,0.12373713,0.0004399118],"about_ca_topic_score_codex":0.0000043085765,"about_ca_topic_score_gemma":0.000017147659,"teacher_disagreement_score":0.61631906,"about_ca_system_score_codex":0.00016614652,"about_ca_system_score_gemma":0.00009109287,"threshold_uncertainty_score":0.99855685},"labels":[],"label_agreement":null},{"id":"W2159441211","doi":"10.2139/ssrn.925626","title":"Abuse of a Dominant Position: Cases and Experiments","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Position (finance); Psychology; Business","score_opus":0.031272270827552996,"score_gpt":0.35103442286429065,"score_spread":0.31976215203673763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159441211","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.99145925,0.0018777063,0.004695623,0.00026071668,0.00003428483,0.000058638394,0.00000286617,0.000004517853,0.001606421],"genre_scores_gemma":[0.99785155,0.0002416873,0.00011124479,0.000023918457,0.00008213499,0.000004011105,6.4150305e-7,0.000004308257,0.001680503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985526,0.00008795766,0.00034431514,0.00013910285,0.00034146837,0.00053454837],"domain_scores_gemma":[0.9991982,0.00029361155,0.00019775657,0.00016668007,0.000104411956,0.000039332117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018740911,0.00006740819,0.00013014753,0.00010002155,0.00017309785,0.00005889584,0.00022511675,0.000026904674,0.00004614068],"category_scores_gemma":[0.00008927332,0.00004742261,0.000056149016,0.00020250649,0.0000922373,0.00015242168,0.000018985742,0.00025302824,0.000025735815],"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.000076957236,0.00017107783,0.0017093236,7.545008e-7,0.000019877985,0.0000052803493,0.0003077462,0.00001719254,0.026013644,0.9632418,0.0003008746,0.008135473],"study_design_scores_gemma":[0.0004393271,0.0001612422,0.0022256153,0.000007562132,0.000013051741,0.0017462319,0.0023883823,0.000020020998,0.01233206,0.97877336,0.0018188307,0.00007432829],"about_ca_topic_score_codex":0.000036101428,"about_ca_topic_score_gemma":0.000087296765,"teacher_disagreement_score":0.015531549,"about_ca_system_score_codex":0.000073280935,"about_ca_system_score_gemma":0.00022454333,"threshold_uncertainty_score":0.19338378},"labels":[],"label_agreement":null},{"id":"W2160021866","doi":"10.1109/icsmc.2007.4413988","title":"Matrix representation of conflicts with two decision-makers","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Representation (politics); Matrix representation; Matrix (chemical analysis); Computer science; Stability (learning theory); Graph; Mathematical optimization; Conflict resolution; Nash equilibrium; Graph theory; Theoretical computer science; Mathematics; Machine learning; Group (periodic table)","score_opus":0.08835224797110384,"score_gpt":0.47267276434033445,"score_spread":0.3843205163692306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160021866","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.68491006,0.000008497845,0.25042993,0.00017919377,0.000032809916,0.00012589335,0.000002274236,0.000021803688,0.064289525],"genre_scores_gemma":[0.97964305,0.0000012508261,0.01519031,0.00009493852,0.000020935957,0.00000326388,0.0000012268454,0.0000044269204,0.0050405767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998343,0.000039843882,0.00045946165,0.00025444615,0.000773123,0.00013016032],"domain_scores_gemma":[0.9954826,0.0033569676,0.00018703786,0.00057805475,0.0003103468,0.000084996704],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002163074,0.00006402616,0.00014760463,0.00016855403,0.000066120585,0.000042063784,0.00034381004,0.0000266012,0.0010764004],"category_scores_gemma":[0.00079936336,0.000038821818,0.00004711788,0.0010624551,0.00013428381,0.00015669111,0.00004074454,0.000047635,0.00038711107],"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.00075656106,0.00017814295,0.030424971,0.0000021115713,0.000029225748,0.000012774434,0.0014653783,0.002073239,0.02135803,0.6469326,0.0050615445,0.2917054],"study_design_scores_gemma":[0.0023562633,0.00022891819,0.10248362,0.000031473894,0.00003412064,0.000058497593,0.009575306,0.000998191,0.20044518,0.6275622,0.055879474,0.0003467349],"about_ca_topic_score_codex":0.00005005464,"about_ca_topic_score_gemma":0.00011437288,"teacher_disagreement_score":0.294733,"about_ca_system_score_codex":0.000007507183,"about_ca_system_score_gemma":0.000021103417,"threshold_uncertainty_score":0.99983674},"labels":[],"label_agreement":null},{"id":"W2162921429","doi":"10.1145/544741.544812","title":"A coalition formation mechanism based on inter-agent trust relationships","year":2002,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Vendor; Mechanism (biology); Computer science; Multi-agent system; Simple (philosophy); Software agent; Distributed computing; Risk analysis (engineering); Artificial intelligence; Business; Marketing","score_opus":0.28146844160746554,"score_gpt":0.35995460080943065,"score_spread":0.07848615920196511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162921429","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.046890702,0.0000028100596,0.79299957,0.005483879,0.000103254344,0.00025668752,0.000013901945,0.00010990732,0.15413928],"genre_scores_gemma":[0.987643,0.000001069362,0.0018446925,0.00089678605,0.000028823248,0.00005442072,0.000011405834,0.000005017189,0.009514799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984629,0.00028066148,0.00039516573,0.00022419878,0.00051626173,0.000120802906],"domain_scores_gemma":[0.99837494,0.000822767,0.00012714216,0.0004913065,0.00010816732,0.00007566298],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001736298,0.00008215241,0.00009181218,0.00021301606,0.00029231477,0.00013884845,0.00027119814,0.000056915593,0.008620275],"category_scores_gemma":[0.0007512227,0.000060262628,0.00007129288,0.00046038782,0.00002933109,0.0003404586,0.000022087688,0.00012376146,0.008350965],"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.0000134004795,0.00015821701,0.00010466943,0.0000015408093,0.000001853682,5.7972807e-7,0.00047786714,0.00058880437,0.0004090615,0.9638711,0.021589544,0.0127833625],"study_design_scores_gemma":[0.00031681827,0.00008354994,0.0007397742,0.000011068957,0.000006838542,0.000003675162,0.0010649356,0.50097346,0.0044319294,0.4649566,0.02728762,0.00012372505],"about_ca_topic_score_codex":0.0000021215828,"about_ca_topic_score_gemma":0.000009306665,"teacher_disagreement_score":0.94075227,"about_ca_system_score_codex":0.000041352807,"about_ca_system_score_gemma":0.000005190982,"threshold_uncertainty_score":0.99242115},"labels":[],"label_agreement":null},{"id":"W2163223286","doi":"10.1007/978-3-642-05282-8_1","title":"Cooperative Game Theory","year":2010,"lang":"en","type":"book-chapter","venue":"Theory and decision library. Series C, Game theory, mathematical programming and operations research","topic":"Game Theory and Applications","field":"Decision 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":"Queen's University","funders":"","keywords":"Game theory; Computer science; Mathematical economics; Economics","score_opus":0.10472360942216094,"score_gpt":0.40701501650550126,"score_spread":0.30229140708334035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163223286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025603672,0.0056706807,0.20995925,0.0026311858,0.00048369018,0.006064384,0.0005628168,0.00089555193,0.7481288],"genre_scores_gemma":[0.14273377,0.0012392343,0.024320703,0.00045986724,0.00061401183,0.000600855,0.00014416965,0.00031659455,0.8295708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98859966,0.0034027128,0.0021722931,0.0021065844,0.0025818024,0.0011369204],"domain_scores_gemma":[0.9619677,0.03321849,0.00026693955,0.0025990184,0.000966291,0.0009815481],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch","sts","insufficient_payload"],"category_scores_codex":[0.031355564,0.001025979,0.0015745374,0.0012529161,0.0023161275,0.004524996,0.0021331075,0.0011511472,0.013962875],"category_scores_gemma":[0.009903727,0.0007079006,0.00035885806,0.00075815426,0.00787242,0.002191859,0.0019913882,0.0032301922,0.0025933045],"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.0013871972,0.00015201073,8.4706085e-7,0.000047046233,0.000086072905,0.000024354225,0.0022283108,0.000014185491,0.0001115851,0.7817676,0.00026935848,0.21391143],"study_design_scores_gemma":[0.0004945265,0.0005162921,0.000005165307,0.00033131626,0.00008287409,0.00020235097,0.0034773487,0.00019441698,0.00058895396,0.8735286,0.119867325,0.0007108193],"about_ca_topic_score_codex":9.351448e-7,"about_ca_topic_score_gemma":0.000006128542,"teacher_disagreement_score":0.21320061,"about_ca_system_score_codex":0.000033110104,"about_ca_system_score_gemma":0.00039498834,"threshold_uncertainty_score":0.9995372},"labels":[],"label_agreement":null},{"id":"W2164609856","doi":"10.1023/a:1020922214711","title":"Axelrod Meets Cournot: Oligopoly and the Evolutionary Metaphor","year":2002,"lang":"en","type":"article","venue":"Computational Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"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":"Economic and Social Research Council; Nuffield Foundation; York University","keywords":"Cournot competition; Duopoly; Microeconomics; Economics; Outcome (game theory); Champion; Mathematical economics; Simple (philosophy); Profit (economics); Evolutionary dynamics; Econometrics","score_opus":0.08778315319928906,"score_gpt":0.30989100731099145,"score_spread":0.2221078541117024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164609856","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.8744422,0.0021591,0.018192232,0.066463724,0.00046106585,0.0005100152,0.00013391263,0.00006956352,0.037568174],"genre_scores_gemma":[0.99422497,0.00006571376,0.0031364958,0.00115923,0.00009340462,0.000022509912,0.0000062814465,0.000006134654,0.0012852403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989486,0.00011425186,0.0003898211,0.0002685067,0.00016543409,0.000113392794],"domain_scores_gemma":[0.9967593,0.0026377323,0.00016464334,0.00025928894,0.00011003968,0.000069009264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010159962,0.00008703682,0.00016893868,0.00007946878,0.00034419307,0.00015713624,0.0003895465,0.000032704353,0.00061466906],"category_scores_gemma":[0.00029271917,0.000059995597,0.00007839042,0.00015180552,0.0004534968,0.00019058252,0.000096293916,0.0000797207,0.00090217794],"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.000015681224,0.000026610584,0.00015468163,4.9643546e-7,0.000020983054,2.5906812e-7,0.0003163881,0.047601596,0.0000013909138,0.93200165,0.009050142,0.010810149],"study_design_scores_gemma":[0.00045874302,0.0000058613327,0.00466356,8.769584e-7,0.000008443714,0.000025313291,0.000107040716,0.31371713,0.000003118901,0.6279424,0.053003907,0.00006358836],"about_ca_topic_score_codex":0.0000029408327,"about_ca_topic_score_gemma":0.000003135425,"teacher_disagreement_score":0.3040592,"about_ca_system_score_codex":0.000023925337,"about_ca_system_score_gemma":0.000024274465,"threshold_uncertainty_score":0.9998757},"labels":[],"label_agreement":null},{"id":"W2164714071","doi":"10.2139/ssrn.921639","title":"When Does Coordination Require Centralization","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":59,"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":"","keywords":"Business; Economics","score_opus":0.02111404736942371,"score_gpt":0.3168111920904463,"score_spread":0.2956971447210226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164714071","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.485895,0.00056689046,0.49151948,0.0122827785,0.0003614486,0.00020392005,0.000007065693,0.00007434328,0.00908906],"genre_scores_gemma":[0.96856594,0.00008322049,0.00014539232,0.00006893246,0.0003597723,0.000004799861,0.000007262765,0.000009239946,0.030755442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974536,0.00019502218,0.00046566201,0.00022077111,0.0006359154,0.0010290492],"domain_scores_gemma":[0.9989706,0.00017636691,0.0002925467,0.00024466222,0.0002656346,0.000050138922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004446883,0.00009638522,0.0001227925,0.00015886384,0.0003807873,0.00024696233,0.0004900706,0.00005672284,0.0003514973],"category_scores_gemma":[0.00031253888,0.0000615731,0.00008923875,0.0004009266,0.000047756115,0.0006431879,0.000026221234,0.000478332,0.00023105292],"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.000011663646,0.000039693066,0.0025564986,3.7503608e-7,0.000007554594,4.0008277e-7,0.000065684384,0.00016434467,0.0012125362,0.97321445,0.0018375128,0.020889265],"study_design_scores_gemma":[0.00022574133,0.00003459826,0.001513086,0.0000030944454,0.000008641453,0.00006431072,0.0008124177,0.00026761528,0.00044316478,0.9602773,0.036265068,0.000084926076],"about_ca_topic_score_codex":0.000037550402,"about_ca_topic_score_gemma":0.00059552054,"teacher_disagreement_score":0.4913741,"about_ca_system_score_codex":0.00032051335,"about_ca_system_score_gemma":0.00044516072,"threshold_uncertainty_score":0.3848649},"labels":[],"label_agreement":null},{"id":"W2164740912","doi":"10.1016/j.jebo.2009.09.007","title":"Dynamic systems of social interactions","year":2009,"lang":"en","type":"article","venue":"Journal of Economic Behavior & Organization","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Uniqueness; Convergence (economics); Ergodicity; Aggregate (composite); Mathematical economics; Infinity; Mathematics; Population; Matching (statistics); Class (philosophy); Measure (data warehouse); Overlapping generations model; Economics; Econometrics; Computer science; Microeconomics; Mathematical analysis; Statistics","score_opus":0.05085425793227954,"score_gpt":0.3829890160216958,"score_spread":0.3321347580894163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164740912","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.9929448,0.000010704664,0.005449853,0.00058421737,0.00052972336,0.00008168387,0.000009846957,0.000007123976,0.00038204071],"genre_scores_gemma":[0.99921715,0.0000036782658,0.00014061482,0.000020321584,0.000100352314,7.6538595e-7,0.0000047429276,0.0000068686873,0.0005054756],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9986384,0.000071796705,0.0009413378,0.000099215475,0.00017055996,0.00007872553],"domain_scores_gemma":[0.9983574,0.00009331708,0.000876833,0.00015272864,0.0004747678,0.00004496168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080858415,0.0000647164,0.00023033017,0.00023954536,0.00010713123,0.00009234731,0.00034401633,0.000044671666,0.0007635991],"category_scores_gemma":[0.00013902843,0.000049572554,0.000077370954,0.00022656526,0.00003332685,0.00043746023,0.00001707361,0.000102278645,0.00016766971],"study_design_candidate":"observational","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.00010774776,0.0014944656,0.041077964,0.000008757957,0.00008927013,0.000010735157,0.007539042,0.011106267,0.71629983,0.17083335,0.008950627,0.04248194],"study_design_scores_gemma":[0.0017061947,0.00051273033,0.9047706,0.000048017217,0.0004897842,0.0008195509,0.008005041,0.0022085474,0.04119427,0.028831962,0.010875938,0.0005373669],"about_ca_topic_score_codex":0.0000021181825,"about_ca_topic_score_gemma":0.0000027659246,"teacher_disagreement_score":0.86369264,"about_ca_system_score_codex":0.00013675296,"about_ca_system_score_gemma":0.00006507247,"threshold_uncertainty_score":0.83608747},"labels":[],"label_agreement":null},{"id":"W2166717043","doi":"10.1016/j.geb.2007.02.002","title":"Iterated strict dominance in general games","year":2007,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Division of Mathematical Sciences; University of Hong Kong; National Science Council","keywords":"Iterated function; Risk dominance; Nash equilibrium; Mathematical economics; Spurious relationship; Best response; Class (philosophy); Epsilon-equilibrium; Mathematics; Dominance (genetics); Stochastic game; Correlated equilibrium; Set (abstract data type); Repeated game; Computer science; Equilibrium selection; Game theory; Artificial intelligence","score_opus":0.06196810361513819,"score_gpt":0.3641725447113662,"score_spread":0.302204441096228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166717043","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.997133,0.00015831475,0.0002393361,0.00015237629,0.00015159596,0.00016361482,0.000024244968,0.000015999905,0.001961498],"genre_scores_gemma":[0.9952636,0.000037617443,0.00044643722,0.000099715246,0.00007046555,0.000033238888,0.0000034621826,0.0000066549446,0.0040388326],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987734,0.000040036626,0.00049811986,0.0003690019,0.000076694705,0.00024272695],"domain_scores_gemma":[0.99919355,0.00026841933,0.00012090765,0.00030617922,0.000021108657,0.00008981977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017044729,0.00010501791,0.00020817203,0.00017119474,0.00006446635,0.00013871686,0.00025303167,0.00006368183,0.00052802556],"category_scores_gemma":[0.000049519378,0.000088279216,0.00004709739,0.00016484287,0.00009313449,0.00019919865,0.000059505666,0.00009059228,0.00029418556],"study_design_candidate":"observational","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.00009014158,0.00012868564,0.4010433,0.0000016058884,0.000004322605,0.000020761361,0.00076423417,0.00012531783,0.0031134207,0.016505858,0.0018126947,0.5763897],"study_design_scores_gemma":[0.00044009692,0.00002565631,0.9684088,0.000004535778,0.000007798556,0.000018373801,0.00042766787,0.00035072857,0.0015532151,0.0039711706,0.024633883,0.00015803118],"about_ca_topic_score_codex":0.00009640385,"about_ca_topic_score_gemma":0.00026824046,"teacher_disagreement_score":0.5762316,"about_ca_system_score_codex":0.000038692888,"about_ca_system_score_gemma":0.000022689857,"threshold_uncertainty_score":0.5781509},"labels":[],"label_agreement":null},{"id":"W2169088379","doi":"10.5555/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Resource allocation; Distributed computing; Distributed algorithm; Martingale (probability theory); Mathematical optimization; Load balancing (electrical power); Mathematics; Computer network","score_opus":0.02486666529941805,"score_gpt":0.31756466989913934,"score_spread":0.2926980045997213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169088379","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37292427,0.0002809304,0.19399688,0.026674874,0.0018827117,0.0014434559,0.0019430919,0.0010794675,0.3997743],"genre_scores_gemma":[0.9897242,0.0000067596525,0.001402101,0.00033289313,0.00046375924,0.00005993196,0.00010663261,0.000024763189,0.007878966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648136,0.00018376048,0.00067239115,0.0007446368,0.0014510663,0.0004667619],"domain_scores_gemma":[0.9975807,0.0006979263,0.00023250558,0.0010468618,0.00028003386,0.00016195828],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016222642,0.0002493523,0.00031484407,0.00012294739,0.0003598251,0.00036970017,0.000903874,0.00010925576,0.00039908223],"category_scores_gemma":[0.00025168905,0.00018703192,0.00019225603,0.0009797072,0.00015999281,0.00025289654,0.00013171042,0.00020817912,0.0021311706],"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.00030581138,0.0012239338,0.01320052,0.000023318764,0.00013133447,0.0001314335,0.0010402848,0.019613722,0.063990675,0.540624,0.31920803,0.040506925],"study_design_scores_gemma":[0.0016761158,0.00030893701,0.033650223,0.000057376343,0.000067879075,0.00005183988,0.00071098865,0.019853072,0.027322087,0.48023397,0.43486297,0.001204567],"about_ca_topic_score_codex":0.000114010596,"about_ca_topic_score_gemma":0.000039276376,"teacher_disagreement_score":0.6167999,"about_ca_system_score_codex":0.000118339376,"about_ca_system_score_gemma":0.000086666456,"threshold_uncertainty_score":0.9986458},"labels":[],"label_agreement":null},{"id":"W2169139983","doi":"10.1007/s00453-010-9482-1","title":"Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Theory of computation; Convergence (economics); Computer science; Extension (predicate logic); Mathematical optimization; Protocol (science); Matching (statistics); Set (abstract data type); Routing (electronic design automation); Mathematical economics; Algorithm; Mathematics; Statistics","score_opus":0.029436439220455333,"score_gpt":0.3356869945606882,"score_spread":0.3062505553402328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169139983","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.9380536,0.0000081831,0.05608904,0.0032830967,0.00015002539,0.000407924,0.00009521984,0.000080371596,0.0018325376],"genre_scores_gemma":[0.99073607,0.0000028017307,0.008273756,0.00020107717,0.0000824529,0.00012501309,0.000040472136,0.000010896835,0.0005274803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982048,0.00006298236,0.0003992638,0.0005206119,0.0005467696,0.0002655297],"domain_scores_gemma":[0.997854,0.00070743513,0.00012541316,0.0006748289,0.0004627017,0.00017562558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964225,0.00013403907,0.00018640303,0.00012096381,0.00010533952,0.00013667201,0.0007961925,0.000078101235,0.00040930175],"category_scores_gemma":[0.0009821915,0.000098001925,0.000022310896,0.0023148737,0.00012023843,0.00029696766,0.00009145825,0.00020378394,0.00068125967],"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.000939726,0.002158884,0.080453224,0.00010553893,0.00010455922,0.00009104559,0.008330899,0.00039088298,0.18731435,0.1601933,0.054567054,0.50535053],"study_design_scores_gemma":[0.0023371333,0.00057258,0.1543797,0.00013939249,0.00005855208,0.00014894833,0.002293071,0.022735748,0.10338622,0.39408907,0.31812,0.0017395908],"about_ca_topic_score_codex":0.0000582031,"about_ca_topic_score_gemma":0.0007229029,"teacher_disagreement_score":0.50361097,"about_ca_system_score_codex":0.000017684983,"about_ca_system_score_gemma":0.00021807176,"threshold_uncertainty_score":0.87564415},"labels":[],"label_agreement":null},{"id":"W2169825920","doi":"10.1109/jsac.2007.070818","title":"Efficiency of Market-Based Resource Allocation among Many Participants","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Bounded function; Resource allocation; Population; Mathematical optimization; Game theory; Resource (disambiguation); Distributed computing; Computer network; Mathematical economics; Mathematics; Artificial intelligence","score_opus":0.11777898714325213,"score_gpt":0.4035614868064709,"score_spread":0.2857824996632188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169825920","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.94109523,0.00010902532,0.033819184,0.0019759475,0.000090879985,0.00029072427,0.00000980021,0.000040436742,0.022568764],"genre_scores_gemma":[0.9972719,0.000030142524,0.0020081277,0.00019759548,0.000041821186,0.000021295627,0.0000056101194,0.000015001691,0.00040849627],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9957937,0.0011003076,0.001471931,0.00026054017,0.0009582694,0.0004152814],"domain_scores_gemma":[0.98956454,0.006335792,0.0008693705,0.0021198515,0.0008924917,0.00021796598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010074439,0.00015571868,0.0002939459,0.0008588981,0.00048322143,0.000108545726,0.0026266528,0.00011183048,0.00020703842],"category_scores_gemma":[0.0039688423,0.00013106082,0.00011109617,0.0034197797,0.00041124836,0.00019186371,0.00008185399,0.0007317371,0.000064288404],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027538936,0.017169584,0.48770842,0.00003881346,0.00027222442,0.00005277467,0.010176807,0.055997565,0.08558085,0.12373068,0.03764146,0.17887692],"study_design_scores_gemma":[0.0016464632,0.0003242553,0.8871095,0.00032239335,0.000058334885,0.00004161419,0.0020075045,0.039752856,0.02571179,0.024925902,0.01762582,0.00047352622],"about_ca_topic_score_codex":0.000016307684,"about_ca_topic_score_gemma":0.00026058962,"teacher_disagreement_score":0.3994011,"about_ca_system_score_codex":0.0001317134,"about_ca_system_score_gemma":0.00021768858,"threshold_uncertainty_score":0.53445053},"labels":[],"label_agreement":null},{"id":"W2172166633","doi":"10.1002/cjas.1223","title":"Job Classification for the Purpose of Making Optimal Decisions Concerning Management Control","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Administrative Sciences / Revue Canadienne des Sciences de l Administration","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Macro; Micro level; Control (management); Multidisciplinary approach; Human resources; Macro level; Human resource management; Computer science; Contrast (vision); Fuzzy logic; Simple (philosophy); Operations research; Knowledge management; Operations management; Management science; Artificial intelligence; Management; Mathematics; Economics; Microeconomics; Sociology","score_opus":0.3664761569379581,"score_gpt":0.4353495820338004,"score_spread":0.06887342509584232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172166633","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.81964284,0.0006411267,0.16848437,0.002418613,0.00071939593,0.0007047762,0.00014560974,0.000006694358,0.0072365943],"genre_scores_gemma":[0.97847277,0.000016072894,0.020792084,0.00017810246,0.00023602023,0.000046124456,0.0000017744318,0.000008433988,0.00024861458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9963667,0.0003814679,0.0013062863,0.00041390856,0.0005979108,0.00093375484],"domain_scores_gemma":[0.992141,0.004091706,0.0014652881,0.0003833294,0.000987577,0.0009310629],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.015529951,0.00021896942,0.00037546697,0.00066596037,0.0027620194,0.00061969255,0.0022214677,0.0000912622,0.00015107403],"category_scores_gemma":[0.0053012716,0.00015381118,0.00023595568,0.0021310004,0.005733103,0.0012981687,0.000025783122,0.00021217462,0.000007592522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014656119,0.00009006459,0.04699798,0.00002730324,0.000085434214,0.000026058573,0.018644389,0.007188898,0.0016519467,0.8867284,0.0008469261,0.03756602],"study_design_scores_gemma":[0.0020461981,0.008038794,0.3561301,0.00080414495,0.00061622827,0.0028537181,0.28538835,0.04157196,0.0038865043,0.24914983,0.048175,0.0013391585],"about_ca_topic_score_codex":0.0003074296,"about_ca_topic_score_gemma":0.030407265,"teacher_disagreement_score":0.6375786,"about_ca_system_score_codex":0.00039200002,"about_ca_system_score_gemma":0.0033318482,"threshold_uncertainty_score":0.9985362},"labels":[],"label_agreement":null},{"id":"W2179013871","doi":"10.1287/orsc.2015.1015","title":"Tipping Points: The Gender Segregating and Desegregating Effects of Network Recruitment","year":2015,"lang":"en","type":"article","venue":"Organization Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scholarship; Tipping point (physics); Sorting; Population; Network theory; Social psychology; Sociology; Psychology; Economics; Computer science; Demography","score_opus":0.23866940523629065,"score_gpt":0.4022199350703843,"score_spread":0.16355052983409363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179013871","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.9046738,0.00013277998,0.09101925,0.001102876,0.00023624962,0.0004602012,7.3306694e-7,0.000039693114,0.0023343824],"genre_scores_gemma":[0.9924892,0.0000028564332,0.007020007,0.00028340198,0.00006212816,0.000008681163,4.784119e-7,0.0000063796456,0.00012687492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980125,0.00018301848,0.00033823887,0.0003193341,0.000954637,0.00019230321],"domain_scores_gemma":[0.9969192,0.0013006729,0.00029639326,0.0004300441,0.0009359452,0.0001177468],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006571086,0.00007606719,0.00011631058,0.00008299452,0.00058500946,0.0002554856,0.00067857775,0.000023909119,0.000029303865],"category_scores_gemma":[0.015779091,0.00004639017,0.000012269343,0.0043944684,0.00053561083,0.00045085826,0.00030088576,0.000067495035,0.000048816622],"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.000011135367,0.00009734877,0.29472238,0.00003265803,0.000020125635,0.000002484198,0.039134946,0.008495845,0.07409052,0.46057305,0.0032003548,0.11961915],"study_design_scores_gemma":[0.001076212,0.00014752604,0.22181208,0.00018403347,0.00005242661,0.00008106413,0.017234022,0.021576254,0.17663811,0.55646867,0.0041487874,0.00058080093],"about_ca_topic_score_codex":0.000003671208,"about_ca_topic_score_gemma":0.0000014513138,"teacher_disagreement_score":0.11903835,"about_ca_system_score_codex":0.000034405,"about_ca_system_score_gemma":0.00016493675,"threshold_uncertainty_score":0.9925114},"labels":[],"label_agreement":null},{"id":"W2181323283","doi":"","title":"Essays on Decision Making with Information and Action Externalities","year":2012,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southwestern University of Finance and Economics; Queen's University","keywords":"Externality; Microeconomics; Economics; Herding; Action (physics); Irrational number; Private information retrieval; Sequential game; Order (exchange); Game theory; Mathematical economics; Computer science; Mathematics","score_opus":0.024405479300038443,"score_gpt":0.27718015490797904,"score_spread":0.2527746756079406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181323283","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.89741087,0.000022135579,0.004596783,0.0035179197,0.00037358206,0.00044942924,0.000094120725,0.00021558905,0.09331958],"genre_scores_gemma":[0.88771564,0.00010240675,0.0016170123,0.00011439467,0.00008007586,0.0000040065074,0.00020902272,0.00002211175,0.1101353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981036,0.00016653372,0.00027508807,0.00037058422,0.00083786814,0.00024630278],"domain_scores_gemma":[0.99779516,0.00083254447,0.0005697452,0.0005263847,0.00012935374,0.00014678993],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025052213,0.00027901947,0.00029509497,0.00080446317,0.00045339554,0.00044992147,0.00056011317,0.00026172097,0.0009154314],"category_scores_gemma":[0.00010450746,0.00023395104,0.00008642326,0.0006606531,0.00008535353,0.005601187,0.000102243685,0.00035814545,0.00035735552],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008560772,0.00027977227,0.021205451,0.00023861947,0.00018173485,0.000038617094,0.0139077725,0.00047173724,0.000020520663,0.40270835,0.20893714,0.3434495],"study_design_scores_gemma":[0.0012036642,0.00035369946,0.20894484,0.0010143237,0.00020493427,0.0000037151235,0.05626257,0.000035049856,0.0017210925,0.08196026,0.6470747,0.0012211644],"about_ca_topic_score_codex":0.0001992812,"about_ca_topic_score_gemma":0.00006656078,"teacher_disagreement_score":0.43813753,"about_ca_system_score_codex":0.000056570487,"about_ca_system_score_gemma":0.00011229973,"threshold_uncertainty_score":0.99999785},"labels":[],"label_agreement":null},{"id":"W219963577","doi":"10.1007/978-3-540-24722-7_3","title":"Games Against Nature","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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; University of Fredericton; University of New Brunswick","funders":"","keywords":"Section (typography); Simplicity; Certainty; Computer science; Adversary; Value (mathematics); Mathematical economics; Mathematics; Epistemology; Computer security; Machine learning","score_opus":0.06517598339046342,"score_gpt":0.36128794294398975,"score_spread":0.2961119595535263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W219963577","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007305363,0.00032759548,0.0004705162,0.0014755266,0.00020661896,0.00016745966,0.000043439577,0.00009079739,0.997145],"genre_scores_gemma":[0.044509187,0.000057662783,0.000502076,0.0021167747,0.00019768882,0.000006459973,0.000017877253,0.000022516611,0.9525698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798006,0.00001368851,0.000431135,0.000558348,0.0008695894,0.00014718997],"domain_scores_gemma":[0.99793273,0.0004661605,0.00021423801,0.0010742585,0.0002058227,0.0001067762],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00065466843,0.00022428768,0.00030626892,0.0001965509,0.00010893069,0.00015425296,0.001017164,0.0005960878,0.018208073],"category_scores_gemma":[0.00021546852,0.00014879306,0.0002328563,0.00007308592,0.00017038008,0.00008191938,0.00013911947,0.0006633425,0.01534448],"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.0000023234247,0.0000052966534,8.461284e-7,9.23382e-7,0.000008428184,0.0000040277077,0.000022647348,0.00001356935,0.000013564664,0.94625777,0.026360245,0.02731038],"study_design_scores_gemma":[0.000037333153,0.0000047261415,0.000009508705,0.000013401095,0.0000044595004,0.0000016580407,0.000013815024,0.000001398367,0.0000444264,0.5154618,0.48430663,0.00010085062],"about_ca_topic_score_codex":8.096779e-7,"about_ca_topic_score_gemma":0.00000894189,"teacher_disagreement_score":0.4579464,"about_ca_system_score_codex":0.00003416315,"about_ca_system_score_gemma":0.00010981817,"threshold_uncertainty_score":0.9854222},"labels":[],"label_agreement":null},{"id":"W2215115254","doi":"10.1016/j.amc.2015.07.068","title":"Computing equilibria in discounted dynamic games","year":2015,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Subgame perfect equilibrium; Markov perfect equilibrium; Repeated game; Markov chain; Mathematical economics; Combinatorial game theory; Extensive-form game; Computer science; Subgame; Sequential game; Mathematical optimization; Game theory; Normal-form game; Mathematics; Equilibrium selection; Nash equilibrium","score_opus":0.09299223267950588,"score_gpt":0.392885646866708,"score_spread":0.29989341418720217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215115254","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.67110455,0.00002277263,0.31989676,0.00017510983,0.000029311912,0.00016635105,0.0000015614519,0.000028849316,0.008574716],"genre_scores_gemma":[0.96376944,0.0000012924103,0.03606929,0.00005105608,0.000013258053,0.000010736824,0.0000073592437,0.0000065895133,0.000070999755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987887,0.000023192826,0.00044613532,0.00023977515,0.00037229594,0.00012990789],"domain_scores_gemma":[0.99886024,0.00063317927,0.00017596198,0.0001844174,0.00007459776,0.00007158836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001488274,0.00009473349,0.00019563815,0.00013011451,0.000055279306,0.00016637829,0.00017973995,0.000036828467,0.0000075333573],"category_scores_gemma":[0.00015281864,0.00007567089,0.000019339535,0.00042248855,0.00006605372,0.000087056906,0.000099549994,0.00007052524,0.00010077549],"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.000016768656,0.00017397408,0.00015570507,0.000019538382,0.0000069885114,0.000001445948,0.0069806,0.007964152,0.0026087086,0.8413462,0.000333836,0.14039208],"study_design_scores_gemma":[0.00024095456,0.0000092606,0.00066015724,0.000009122737,0.0000029942682,0.0000035813086,0.002874197,0.43434042,0.0000318132,0.56165606,0.000106300584,0.000065118395],"about_ca_topic_score_codex":0.0000032748578,"about_ca_topic_score_gemma":0.0000093983845,"teacher_disagreement_score":0.42637628,"about_ca_system_score_codex":0.000020911843,"about_ca_system_score_gemma":0.000026555368,"threshold_uncertainty_score":0.30857694},"labels":[],"label_agreement":null},{"id":"W2242697768","doi":"","title":"Additive Plausibility Characterizes the Supports of Consistent Assessments","year":2012,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Lemma (botany); Consistency (knowledge bases); Parallels; Relation (database); Mathematics; Mathematical economics; Set (abstract data type); Function (biology); Discrete mathematics; Pure mathematics; Computer science; Economics","score_opus":0.08955643979248569,"score_gpt":0.375161665746241,"score_spread":0.2856052259537553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242697768","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.9554379,0.00033165258,0.00046016442,0.00066444045,0.0037003567,0.0013703804,0.0035919358,0.00008258593,0.034360558],"genre_scores_gemma":[0.99483913,0.000047927177,0.0005039276,0.00032067322,0.0004178351,0.0003971291,0.00018024327,0.00003540017,0.0032577566],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99326426,0.0011387349,0.0022954734,0.0013915644,0.0012548529,0.0006551115],"domain_scores_gemma":[0.98782533,0.004789614,0.002802307,0.0034866584,0.00073230325,0.00036377925],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0071985126,0.0006202945,0.0013387016,0.00030551286,0.00041114408,0.00026186876,0.0022906908,0.0004961801,0.015444375],"category_scores_gemma":[0.0015324462,0.00043582026,0.0007873815,0.0003369745,0.0021146794,0.00038977276,0.0016399238,0.0011192483,0.0013930396],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015024764,0.0009910936,0.9325145,0.00007840284,0.00056278415,0.000012583438,0.0021156904,0.000019845273,0.0009555728,0.023448074,0.023861857,0.01528935],"study_design_scores_gemma":[0.0005378115,0.00007580069,0.8728957,0.00016326446,0.00029510123,0.00008550047,0.0020499283,0.000073966796,0.0029592633,0.043132383,0.07684555,0.0008857004],"about_ca_topic_score_codex":0.000057514284,"about_ca_topic_score_gemma":0.00008161497,"teacher_disagreement_score":0.059618767,"about_ca_system_score_codex":0.00024144439,"about_ca_system_score_gemma":0.0011452739,"threshold_uncertainty_score":0.9998094},"labels":[],"label_agreement":null},{"id":"W2253891240","doi":"10.1139/cjfas-2015-0491","title":"Johan Hjort Symposium on Recruitment Dynamics and Stock Variability","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Fisheries and Aquatic Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Bedford Institute of Oceanography","funders":"","keywords":"Biology; Oceanography; Geology","score_opus":0.11147436145670502,"score_gpt":0.33292728866952614,"score_spread":0.22145292721282112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253891240","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.9609747,0.00005932121,0.0026823075,0.029477723,0.0002596869,0.00013793109,0.000014655855,0.0000025912088,0.006391084],"genre_scores_gemma":[0.99805385,0.000030802643,0.0005665972,0.00028698822,0.00004388254,0.000004225051,1.02909134e-7,0.0000025381794,0.0010109985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855816,0.0001584817,0.00042102105,0.00023482296,0.00041394297,0.00021355327],"domain_scores_gemma":[0.99757606,0.0014194632,0.00024010318,0.00019520927,0.00008220608,0.00048698735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043935524,0.00009033261,0.00019142267,0.00018455206,0.0004727493,0.00035605565,0.0004300319,0.000035434838,0.00021578725],"category_scores_gemma":[0.0016580614,0.00004701889,0.000038513135,0.00033816556,0.0012170479,0.00035716276,0.000020657542,0.00006505137,0.0000075662565],"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.000027853672,0.000030620333,0.34968942,0.000004459626,0.000019840423,0.000015093103,0.0018029328,0.000009088613,0.00026019212,0.13876854,0.0031874354,0.5061845],"study_design_scores_gemma":[0.00061606953,0.0016170419,0.16855933,0.00018864122,0.000039808256,0.00022597965,0.004983162,0.0023822382,0.00026346685,0.763731,0.05700107,0.0003921859],"about_ca_topic_score_codex":0.00031589114,"about_ca_topic_score_gemma":0.0054801987,"teacher_disagreement_score":0.62496245,"about_ca_system_score_codex":0.00006271347,"about_ca_system_score_gemma":0.00054152706,"threshold_uncertainty_score":0.44842637},"labels":[],"label_agreement":null},{"id":"W2254712968","doi":"10.1109/cdc.2016.7799063","title":"Finite Model Approximations and Asymptotic Optimality of Quantized Policies in Decentralized Stochastic Control","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Approximations of π; Quantization (signal processing); Asymptotically optimal algorithm; Mathematics; Optimal control; Mathematical optimization; Gaussian; Stochastic control; Applied mathematics; Class (philosophy); Computer science; Discrete mathematics; Algorithm","score_opus":0.13008056587613695,"score_gpt":0.4042010146036928,"score_spread":0.2741204487275558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254712968","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.2694721,0.00006250756,0.7258119,0.0014374647,0.000040902127,0.0007000495,0.00030022772,0.000033196386,0.002141675],"genre_scores_gemma":[0.9923965,0.000021286745,0.0067228004,0.00010004016,0.0000119887145,0.0001569656,0.0000080161335,0.000011465476,0.0005709459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689096,0.00036276891,0.0012454223,0.0006079482,0.0006028543,0.00029004217],"domain_scores_gemma":[0.99413264,0.003845858,0.000571303,0.00101241,0.00030936277,0.00012843151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002643586,0.00024699577,0.00080082356,0.0004118091,0.00007771934,0.00012838133,0.00078025146,0.00020513468,0.00020033927],"category_scores_gemma":[0.0030332399,0.000163246,0.00015938048,0.00031608093,0.00041819463,0.00012837151,0.00043689532,0.00022980153,0.00003805611],"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.00015448318,0.00017735934,0.0010994882,0.000030202053,0.000038870356,2.4762255e-7,0.00089107343,0.39830977,0.0009149792,0.5973176,0.00008100449,0.0009849307],"study_design_scores_gemma":[0.00088803156,0.000007442444,0.002759266,0.00004990983,0.000024560506,6.7655276e-7,0.000102975,0.4558446,0.000057441026,0.5401335,0.000005320043,0.00012627957],"about_ca_topic_score_codex":0.00006528693,"about_ca_topic_score_gemma":0.000042260566,"teacher_disagreement_score":0.7229244,"about_ca_system_score_codex":0.00003076496,"about_ca_system_score_gemma":0.00019463213,"threshold_uncertainty_score":0.6656979},"labels":[],"label_agreement":null},{"id":"W2263931895","doi":"10.3982/te1687","title":"The folk theorem with imperfect public information in continuous time","year":2016,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Folk theorem; Imperfect; Mathematical economics; Computer science; Noise (video); Mathematics; Repeated game; Game theory; Artificial intelligence; Equilibrium selection","score_opus":0.01642328288345197,"score_gpt":0.26320368998517496,"score_spread":0.246780407101723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263931895","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.9122947,0.000008471225,0.0053513194,0.014438282,0.000053021,0.0002711083,0.000021615791,0.00004054357,0.06752093],"genre_scores_gemma":[0.99902874,0.00002189432,0.00010136892,0.000311075,0.00003385767,0.000041634332,0.0000018546363,0.0000082775905,0.00045131808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985071,0.00023086928,0.00055660604,0.00021419591,0.00016500689,0.00032621168],"domain_scores_gemma":[0.994041,0.0048665926,0.0001730872,0.000698324,0.000107115775,0.00011388171],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004524756,0.00012222576,0.00020592722,0.00009824207,0.0001765977,0.00038488006,0.00084406865,0.00006705166,0.0010865647],"category_scores_gemma":[0.0017644977,0.00005078393,0.000060825598,0.00019993656,0.0013723539,0.00065307674,0.00011484829,0.00009969825,0.0042058504],"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.00009656169,0.000012148161,0.00028717198,2.0551069e-7,0.000005014478,1.7019995e-7,0.0000950062,0.000008359899,0.000043133834,0.9071581,0.00011670707,0.09217742],"study_design_scores_gemma":[0.00046475366,0.0000726965,0.00070924126,0.0000052180108,0.000003451092,0.00000954121,0.0002749495,0.0010646357,0.00031933395,0.97300804,0.023955146,0.00011298397],"about_ca_topic_score_codex":0.0000010929691,"about_ca_topic_score_gemma":0.000008216577,"teacher_disagreement_score":0.09206443,"about_ca_system_score_codex":0.00005665314,"about_ca_system_score_gemma":0.00007718728,"threshold_uncertainty_score":0.99982655},"labels":[],"label_agreement":null},{"id":"W2266097679","doi":"10.1515/bejte-2014-0017","title":"Dynamic Information Revelation in Cheap Talk","year":2015,"lang":"en","type":"article","venue":"The B E Journal of Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Communication source; Sequence (biology); Computer science; Outcome (game theory); Cheap talk; Sobel operator; Stochastic game; Monotonic function; State (computer science); Test (biology); Binary number; Upper and lower bounds; State space; Private information retrieval; Mathematics; Algorithm; Statistics; Mathematical economics; Artificial intelligence; Computer security; Arithmetic; Telecommunications","score_opus":0.05031811203408015,"score_gpt":0.33901316038608964,"score_spread":0.2886950483520095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266097679","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.96460676,0.000028371931,0.01718119,0.007913285,0.00018845963,0.00008968287,0.0000041652643,0.0000037055459,0.009984408],"genre_scores_gemma":[0.9987762,0.000027021802,0.0007657325,0.00033013077,0.000034301698,0.0000010755269,9.2464387e-7,0.0000032873513,0.000061316234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984805,0.00024404807,0.00090657483,0.00005270953,0.00020752208,0.00010865019],"domain_scores_gemma":[0.99781626,0.0010618616,0.0005217374,0.00028268652,0.00021457669,0.000102874146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010448709,0.000063802785,0.00017595176,0.00016023664,0.000040639854,0.000089703186,0.0006851076,0.000051149043,0.000148379],"category_scores_gemma":[0.0025441616,0.00003735801,0.000063863255,0.00020870149,0.00028205448,0.000702187,0.00006595534,0.0002095638,0.00029165586],"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.00016971701,0.000021135995,0.0001253461,5.4450277e-7,0.0000046294394,2.679224e-7,0.0010459197,0.008636182,0.000022660364,0.97882843,0.0003234783,0.010821672],"study_design_scores_gemma":[0.00031916276,0.00005309329,0.0016592517,0.0000055170835,0.000008329873,0.00006554775,0.0014423436,0.02088154,0.0000744277,0.97100484,0.004438344,0.00004759317],"about_ca_topic_score_codex":0.0000014914687,"about_ca_topic_score_gemma":0.0000043883565,"teacher_disagreement_score":0.034169476,"about_ca_system_score_codex":0.000101304875,"about_ca_system_score_gemma":0.00010204711,"threshold_uncertainty_score":0.37487432},"labels":[],"label_agreement":null},{"id":"W2268298206","doi":"","title":"Concisely Specifying Choices in an Outcome-Set Form","year":2015,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","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":"Outcome (game theory); Set (abstract data type); Mathematical economics; Von Neumann architecture; Computer science; Game theory; Extensive-form game; Theoretical computer science; Mathematics; Sequential game; Programming language","score_opus":0.22297919587088247,"score_gpt":0.41581837870692373,"score_spread":0.19283918283604126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268298206","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.885087,0.0004184695,0.00033907712,0.00039994306,0.0029926188,0.00095818436,0.00053509156,0.00020285965,0.109066725],"genre_scores_gemma":[0.9924252,0.00003686622,0.0015292603,0.00042866595,0.00077401433,0.00027954488,0.00010399004,0.00006570376,0.0043567657],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99258417,0.0006045211,0.002683711,0.0020350674,0.0012510135,0.000841529],"domain_scores_gemma":[0.9920372,0.001996801,0.0015447818,0.0031012185,0.0005987318,0.00072128064],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008413952,0.000757795,0.0015989456,0.0011162844,0.00030357175,0.0008755201,0.0036616828,0.0007538627,0.0043481053],"category_scores_gemma":[0.0021687436,0.0006886535,0.00046424702,0.0006814284,0.000823424,0.0009931546,0.0013367502,0.001595539,0.00462523],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046949255,0.00015839864,0.9795225,0.000024673514,0.000032355325,0.00002872568,0.0018960332,0.00033431212,0.000039808474,0.006449638,0.00568106,0.005785527],"study_design_scores_gemma":[0.0027573258,0.00020852151,0.4675786,0.00025714282,0.00012931124,0.00016954508,0.0076166205,0.0025310405,0.000308152,0.3059992,0.20942627,0.003018298],"about_ca_topic_score_codex":0.00016299545,"about_ca_topic_score_gemma":0.0022644089,"teacher_disagreement_score":0.51194394,"about_ca_system_score_codex":0.0006053043,"about_ca_system_score_gemma":0.0010501718,"threshold_uncertainty_score":0.9995565},"labels":[],"label_agreement":null},{"id":"W2270077624","doi":"10.2139/ssrn.2695585","title":"Persuasion and Transparency","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"","keywords":"Persuasion; Transparency (behavior); Business; Internet privacy; Political science; Computer science; Computer security; Psychology; Social psychology","score_opus":0.11692472395022999,"score_gpt":0.380812238475767,"score_spread":0.26388751452553705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270077624","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.940453,0.0022425624,0.04666357,0.0032383658,0.00010965935,0.000064259744,0.0000014031901,0.000019062762,0.007208145],"genre_scores_gemma":[0.99579823,0.000422515,0.000103745784,0.00006222921,0.000102562924,0.000002055647,3.624545e-7,0.0000049406585,0.0035033366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821776,0.00012593363,0.00025612258,0.00016899429,0.0004870452,0.0007441521],"domain_scores_gemma":[0.99933684,0.00009848317,0.00009405556,0.0001751271,0.00013602026,0.0001594507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064300294,0.000068664485,0.00010665144,0.00009381886,0.00017488441,0.00010724466,0.00034700814,0.000035074045,0.000054536067],"category_scores_gemma":[0.00037825396,0.000046650548,0.000045886074,0.0002502614,0.000063522966,0.00021673315,0.000021304442,0.0005996402,0.00017552021],"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.00005083139,0.00004121642,0.002153162,3.1640326e-7,0.000014539154,0.000001222881,0.0011380113,0.000027527396,0.0004201822,0.78835577,0.0005117017,0.20728552],"study_design_scores_gemma":[0.00032703643,0.00014570869,0.0008142065,0.0000019945687,0.000007753324,0.00033633795,0.0072006388,0.00008319662,0.000046407713,0.9805217,0.010452844,0.00006222613],"about_ca_topic_score_codex":0.0000085115835,"about_ca_topic_score_gemma":0.00008791478,"teacher_disagreement_score":0.2072233,"about_ca_system_score_codex":0.00010897511,"about_ca_system_score_gemma":0.0007193831,"threshold_uncertainty_score":0.26051718},"labels":[],"label_agreement":null},{"id":"W2270478012","doi":"","title":"Specifying Nodes as Sets of Choices","year":2015,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Generality; Sequence (biology); Tree (set theory); Computer science; Node (physics); Set (abstract data type); Mathematical economics; Theoretical computer science; Game theory; Finite set; Mathematics; Combinatorics; Economics; Engineering; Programming language","score_opus":0.12558965499291955,"score_gpt":0.3846457213901411,"score_spread":0.25905606639722156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270478012","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.7936158,0.0013867096,0.00031522335,0.0004063433,0.0023111552,0.0005130234,0.0003939494,0.00012697812,0.20093082],"genre_scores_gemma":[0.98758334,0.000073266485,0.002611064,0.00020951823,0.00054001715,0.00011282857,0.00003969954,0.00005053468,0.008779711],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941617,0.00050984684,0.0019596987,0.0015044597,0.0013228663,0.0005414152],"domain_scores_gemma":[0.99143595,0.0025155484,0.0019588312,0.0027420772,0.0008794259,0.0004681462],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005404155,0.0005918194,0.0013660524,0.0007495226,0.00026013062,0.0003682253,0.0029699951,0.0005831092,0.00742874],"category_scores_gemma":[0.0029267585,0.0005283887,0.00057585165,0.0005229263,0.00116816,0.00039133415,0.0014889095,0.0009600723,0.006272421],"study_design_candidate":"observational","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.00015009877,0.0005845009,0.8272594,0.00016902915,0.00040094607,0.000037816666,0.0034482095,0.0014294244,0.0011787598,0.06949556,0.076397516,0.019448709],"study_design_scores_gemma":[0.0012369037,0.00013122443,0.07798363,0.00048312626,0.00021222862,0.000170684,0.0031437601,0.00062429253,0.005320389,0.7043236,0.20453693,0.0018332478],"about_ca_topic_score_codex":0.00012609687,"about_ca_topic_score_gemma":0.00011966964,"teacher_disagreement_score":0.7492758,"about_ca_system_score_codex":0.00021452292,"about_ca_system_score_gemma":0.0012990165,"threshold_uncertainty_score":0.99971676},"labels":[],"label_agreement":null},{"id":"W2274024707","doi":"10.1145/1978721.1978723","title":"Polynomial computation of exact correlated equilibrium in compact games","year":2011,"lang":"en","type":"article","venue":"ACM SIGecom Exchanges","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Oracle; Computation; Polynomial; Ellipsoid; Time complexity; Computer science; Algorithm; Applied mathematics; Mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.21700955410088427,"score_gpt":0.3850137129977094,"score_spread":0.16800415889682516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274024707","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.9894192,0.00018047115,0.00039106605,0.00050997414,0.00022220134,0.00021627531,0.000019296473,0.000042231964,0.00899928],"genre_scores_gemma":[0.99889827,0.000008459424,0.0004701179,0.00007566565,0.000040580686,0.00000862719,0.0000080742575,0.000011114984,0.00047912064],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998262,0.00025250443,0.00056457485,0.00032173668,0.00036995162,0.00022926755],"domain_scores_gemma":[0.9975793,0.0012476001,0.00031761575,0.0006512319,0.00012314659,0.00008110728],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012584984,0.00013490122,0.0003277935,0.0003510514,0.00004183724,0.00003374877,0.0008967107,0.00008952538,0.00096409],"category_scores_gemma":[0.0009341269,0.00011041854,0.000081145394,0.00072554627,0.00016602897,0.00024468746,0.00016171159,0.00012891459,0.0003145493],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016518483,0.0027210026,0.40687627,0.000076104785,0.00017236952,0.00004712338,0.07970083,0.0027235872,0.071756594,0.005741177,0.11221839,0.31631473],"study_design_scores_gemma":[0.0013899966,0.00037629937,0.87365603,0.00007743617,0.000028276163,0.000014610085,0.0042510233,0.004367646,0.035575785,0.0760155,0.0037949071,0.00045246264],"about_ca_topic_score_codex":0.00022397756,"about_ca_topic_score_gemma":0.000107881264,"teacher_disagreement_score":0.4667798,"about_ca_system_score_codex":0.000020907513,"about_ca_system_score_gemma":0.000032931002,"threshold_uncertainty_score":0.99994916},"labels":[],"label_agreement":null},{"id":"W2278155835","doi":"10.6084/m9.figshare.892417.v1","title":"Niche concepts and the interaction between environmental filtering and competitive exclusion","year":2014,"lang":"en","type":"article","venue":"Figshare","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Niche; Niche construction; Computer science; Environmental resource management; Economics; Ecology; Biology","score_opus":0.09537673363749523,"score_gpt":0.36892850628551427,"score_spread":0.27355177264801905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278155835","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.93162984,0.00022884968,0.00040782368,0.0019509256,0.00007517939,0.00066074525,0.039666794,0.000058689286,0.025321158],"genre_scores_gemma":[0.9983182,0.0000021956857,0.000031190935,0.0001507678,0.000068493966,0.000031626798,0.0011490459,0.0000031762602,0.0002453001],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993156,0.0001565854,0.00012867866,0.0001750271,0.0001592366,0.00006484705],"domain_scores_gemma":[0.9974216,0.002283631,0.00008083498,0.00016333486,0.000011350225,0.000039207927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032006606,0.00005605526,0.00009319822,0.000020330093,0.00019492843,0.00010365863,0.00015191962,0.00002487874,0.022965139],"category_scores_gemma":[0.0008345333,0.000033836353,0.000020505848,0.000045089128,0.000057553374,0.00012544561,0.00025733208,0.0000806692,0.00072022126],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002524513,0.000087510656,0.011289348,0.000048534537,0.00006709711,0.0000030686292,0.01575519,0.00008450632,0.0062468657,0.035949554,0.095539,0.83467686],"study_design_scores_gemma":[0.0012454143,0.000065333115,0.14213438,0.00026269135,0.000015015321,0.000019804003,0.0035210154,0.002607587,0.003113665,0.03275738,0.8140374,0.00022032646],"about_ca_topic_score_codex":0.0000011083321,"about_ca_topic_score_gemma":0.000001401771,"teacher_disagreement_score":0.83445656,"about_ca_system_score_codex":0.0000061134956,"about_ca_system_score_gemma":0.0000020016982,"threshold_uncertainty_score":0.977928},"labels":[],"label_agreement":null},{"id":"W2288719682","doi":"10.1287/moor.2015.0745","title":"Zero-Sum Polymatrix Games: A Generalization of Minmax","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Alfred P. Sloan Foundation; National Science Foundation","keywords":"Zero-sum game; Nash equilibrium; Mathematics; Generalization; Minimax; Zero (linguistics); Correlated equilibrium; Mathematical economics; Best response; Epsilon-equilibrium; Set (abstract data type); Mathematical optimization; Combinatorics; Game theory; Applied mathematics; Repeated game; Equilibrium selection; Computer science; Mathematical analysis","score_opus":0.3045281447897193,"score_gpt":0.5122618047219017,"score_spread":0.20773365993218246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288719682","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.7326681,0.000079170306,0.25829825,0.0018309638,0.000034705747,0.00047301062,0.0000848978,0.00001642348,0.006514465],"genre_scores_gemma":[0.96398956,0.000032236916,0.021156864,0.000008507477,0.000025815296,0.00007033784,0.000003411266,0.00001173631,0.014701541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675024,0.0003324344,0.0009079147,0.00024891866,0.001541705,0.00021876737],"domain_scores_gemma":[0.99506193,0.0019615525,0.00011539587,0.0010385044,0.0017403924,0.00008223159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054115457,0.0000862538,0.0002581659,0.0005587401,0.00019314945,0.00008629289,0.0008736021,0.00006699049,0.0011963991],"category_scores_gemma":[0.005488913,0.00005027822,0.00008467146,0.0013243968,0.00044458825,0.00025409137,0.00017844416,0.00007510471,0.0004454801],"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.000008756831,0.00031785923,0.00016021702,0.000026224461,0.000014978679,2.999162e-7,0.0018370466,0.0005065529,0.3077907,0.68008465,0.0035393746,0.005713343],"study_design_scores_gemma":[0.00064190105,0.00019226359,0.0003809248,0.00017188872,0.00001531765,0.000009096206,0.0026668664,0.014192228,0.35575807,0.6218275,0.0039480124,0.0001959334],"about_ca_topic_score_codex":0.000022788836,"about_ca_topic_score_gemma":0.000025276242,"teacher_disagreement_score":0.23714139,"about_ca_system_score_codex":0.000025915848,"about_ca_system_score_gemma":0.00016718238,"threshold_uncertainty_score":0.99971664},"labels":[],"label_agreement":null},{"id":"W2295660698","doi":"10.1016/j.jet.2016.03.004","title":"Dynamic commitment games, efficiency and coordination","year":2016,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Coordination game; Outcome (game theory); Set (abstract data type); Simple (philosophy); Mathematical economics; Microeconomics; Sequential game; Complete information; Repeated game; Economics; Computer science; Game theory","score_opus":0.03363031224102218,"score_gpt":0.34117597328276916,"score_spread":0.30754566104174696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295660698","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.9496807,0.00026776126,0.042117894,0.0033950696,0.00028537586,0.00006827488,0.0000094514435,0.000005472752,0.0041700406],"genre_scores_gemma":[0.99573535,0.00004088634,0.00023078527,0.00008123911,0.000043897173,0.0000016012241,9.602213e-8,0.0000044494595,0.003861705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888784,0.00020470493,0.00055337534,0.00013003408,0.00012676674,0.000097284516],"domain_scores_gemma":[0.9970903,0.0019800772,0.000543234,0.00022906765,0.00007575068,0.00008160482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005216472,0.000066541994,0.00018052397,0.00016970301,0.00007316276,0.000058571422,0.00037456158,0.000030164014,0.00063808064],"category_scores_gemma":[0.00046710586,0.000036345886,0.000074214106,0.000052209325,0.00016074747,0.00027742202,0.000049671784,0.0000577198,0.00025183128],"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.00008239861,0.0000594338,0.0012201746,0.0000010327319,0.000024702873,0.0000020053517,0.0002727822,0.00009393622,0.0042373515,0.7302888,0.0024859372,0.26123142],"study_design_scores_gemma":[0.00055268686,0.00008805311,0.0056696218,0.000016472852,0.00001196477,0.00007815133,0.00043829472,0.00023466277,0.00040826958,0.97400063,0.018432805,0.000068410816],"about_ca_topic_score_codex":3.1406807e-7,"about_ca_topic_score_gemma":0.0000018685397,"teacher_disagreement_score":0.26116303,"about_ca_system_score_codex":0.00008785357,"about_ca_system_score_gemma":0.00005087083,"threshold_uncertainty_score":0.6986536},"labels":[],"label_agreement":null},{"id":"W2312142720","doi":"10.1109/tsmca.2004.826282","title":"Preference Uncertainty in the Graph Model for Conflict Resolution","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":239,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Preference; Decision maker; Conflict resolution; Graph; Stability (learning theory); Computer science; Mathematics; Mathematical economics; Artificial intelligence; Theoretical computer science; Machine learning; Operations research; Statistics; Sociology","score_opus":0.18320365025826674,"score_gpt":0.3408655899617886,"score_spread":0.15766193970352188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312142720","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.33524364,0.00073417084,0.6589967,0.0003896538,0.00046485354,0.002059639,0.00024008263,0.00005109607,0.0018201511],"genre_scores_gemma":[0.9957043,0.00013762501,0.00003734873,0.00007605581,0.000069099544,0.0007461817,0.000003850356,0.000013134216,0.0032124303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977777,0.00022893246,0.0007101181,0.00051183556,0.0004903277,0.0002810768],"domain_scores_gemma":[0.99857384,0.00045072916,0.00018479713,0.00054780993,0.00013808966,0.00010472764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981964,0.00020896805,0.00034294836,0.00021026986,0.0005813937,0.0004712147,0.00033947369,0.00012843228,0.0000044049475],"category_scores_gemma":[0.000014208664,0.00014031396,0.00008926393,0.00027754944,0.00022016859,0.00012537272,0.0000026702528,0.00019754031,0.000016340873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007712181,0.00020079338,0.000028988188,0.00007697408,0.000029554947,0.0000013038738,0.010534138,0.66819614,0.00017045443,0.3193128,0.00057819264,0.0007935523],"study_design_scores_gemma":[0.0054821456,0.0010314467,0.0011722406,0.000921489,0.00023869901,0.0001453363,0.032384228,0.7692595,0.000110347624,0.1020691,0.085925214,0.0012602401],"about_ca_topic_score_codex":0.00046592345,"about_ca_topic_score_gemma":0.0010580658,"teacher_disagreement_score":0.66046065,"about_ca_system_score_codex":0.000035439818,"about_ca_system_score_gemma":0.00004114196,"threshold_uncertainty_score":0.5721837},"labels":[],"label_agreement":null},{"id":"W2317657874","doi":"10.1111/iere.12101","title":"STRUCTURAL HOMOPHILY","year":2015,"lang":"en","type":"article","venue":"International Economic Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Social Sciences and Humanities Research Council of Canada; Institute for New Economic Thinking","keywords":"Homophily; Friendship; Network formation; Identification (biology); Feature (linguistics); Social network (sociolinguistics); Economics; Empirical research; Computer science; Microeconomics; Econometrics; Social psychology; Psychology; Mathematics","score_opus":0.22815025675518052,"score_gpt":0.4463060583281767,"score_spread":0.2181558015729962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317657874","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2694604,0.025953159,0.00091556855,0.06924023,0.004755589,0.00070025976,0.00015903337,0.00010438017,0.6287114],"genre_scores_gemma":[0.98655653,0.0015924132,0.0004481067,0.0033454201,0.00038471134,0.000038524184,0.000019004616,0.0000072486487,0.0076080333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988931,0.00006286096,0.0004888976,0.00023157407,0.0002475463,0.00007602771],"domain_scores_gemma":[0.99901575,0.00019200156,0.00019547339,0.00035996636,0.00013774274,0.000099069395],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015429242,0.00006844791,0.00017524308,0.000055062006,0.000028045642,0.000099384444,0.0009491924,0.000017156544,0.0036712096],"category_scores_gemma":[0.00070771435,0.000050419414,0.00009476956,0.00006708593,0.000046922065,0.00026580275,0.000093772156,0.000052709413,0.0141597465],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099571225,0.0000127821995,0.0019135533,0.000010804177,0.000033333446,0.0000024040817,0.00007214145,0.00037760666,0.000009946776,0.54167247,0.2620574,0.19382761],"study_design_scores_gemma":[0.000092160044,0.000005707776,0.00087376026,0.000041569467,0.0000040847044,0.000028292612,0.000017941471,0.000642592,0.000009471572,0.2511004,0.74712217,0.00006188149],"about_ca_topic_score_codex":0.000009094403,"about_ca_topic_score_gemma":0.00000550436,"teacher_disagreement_score":0.71709615,"about_ca_system_score_codex":0.00007884844,"about_ca_system_score_gemma":0.00006948176,"threshold_uncertainty_score":0.9972396},"labels":[],"label_agreement":null},{"id":"W2323374361","doi":"10.1061/40927(243)213","title":"Strategic Insights into the Jordan River Conflict","year":2007,"lang":"en","type":"article","venue":"World Environmental and Water Resources Congress 2007","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of California, Davis; University of Waterloo","keywords":"Conflict resolution; Win-win game; Game theory; Politics; Conflict analysis; Social conflict; Management science; Resolution (logic); Value (mathematics); Operations research; Computer science; Economics; Political science; Microeconomics; Engineering; Artificial intelligence; Law","score_opus":0.03683656069350976,"score_gpt":0.2819840723467628,"score_spread":0.24514751165325305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323374361","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.978309,0.0007544501,0.000055485336,0.0004808898,0.00013531785,0.00018868204,0.0000039805623,0.00002180478,0.020050388],"genre_scores_gemma":[0.970712,0.000046713893,0.00004723724,0.0006533777,0.00012307856,0.000010519335,0.000007591368,0.00001163509,0.028387837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816185,0.00011821558,0.00040862433,0.00042074447,0.00056023843,0.0003303172],"domain_scores_gemma":[0.9989028,0.00033836765,0.00009061383,0.00048645455,0.000008243459,0.00017351689],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001134122,0.00018680227,0.00017733888,0.00014571995,0.0005506213,0.00019298491,0.000564666,0.000048738377,0.0016567702],"category_scores_gemma":[0.0000066259026,0.00008950707,0.000068818656,0.00013936331,0.0012310728,0.00014760527,0.0002709909,0.00018750655,0.001363117],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012416531,0.0011698696,0.21704237,0.000029530653,0.00036990628,0.00036796724,0.24793954,0.00056948,0.13271053,0.0837655,0.008410249,0.3063834],"study_design_scores_gemma":[0.00032494136,0.000035311863,0.03821985,0.00000573395,0.000015685584,0.000011914803,0.0036587163,0.0000701335,0.012357828,0.050607238,0.8944877,0.00020494468],"about_ca_topic_score_codex":0.000054589356,"about_ca_topic_score_gemma":0.0001589793,"teacher_disagreement_score":0.88607746,"about_ca_system_score_codex":0.000022286411,"about_ca_system_score_gemma":0.0000017323757,"threshold_uncertainty_score":0.99941444},"labels":[],"label_agreement":null},{"id":"W2336187745","doi":"10.14288/1.0135671","title":"Reinforcement learning in non-stationary games","year":2015,"lang":"en","type":"article","venue":"Open Collections","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":"University of British Columbia","funders":"","keywords":"Reinforcement; Reinforcement learning; Computer science; Psychology; Cognitive psychology; Artificial intelligence; Social psychology","score_opus":0.13053040303075686,"score_gpt":0.405381822823183,"score_spread":0.27485141979242617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336187745","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060596634,0.000008804823,0.014752387,0.0010619577,0.00013699831,0.0004949637,0.0000031786265,0.00002501523,0.97745705],"genre_scores_gemma":[0.49521735,0.0000021543726,0.0007203607,0.00010019824,0.000018753926,0.00018852773,0.0000047660164,0.0000037142017,0.5037442],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987704,0.00014106634,0.00034036406,0.00024115828,0.00037255196,0.00013443289],"domain_scores_gemma":[0.9988682,0.0004422544,0.00009780219,0.00028045883,0.00021065521,0.00010059311],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018888033,0.000064210995,0.0001247874,0.00015187947,0.0008807361,0.0010452477,0.0005722168,0.00003055132,0.0014535047],"category_scores_gemma":[0.0010568334,0.00005567124,0.000029336552,0.0024427339,0.000044302145,0.00040186933,0.0002147473,0.00013127658,0.00049643475],"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.000055409648,0.000110593865,0.0008587671,5.6214634e-7,0.000007800892,0.000002813448,0.0018055635,0.149952,0.00006900089,0.0062980913,0.8350417,0.0057976954],"study_design_scores_gemma":[0.0010521553,0.00015120077,0.002583653,0.000012597025,0.000005992956,0.000012256512,0.011560607,0.024169274,0.00024235032,0.21155557,0.7484639,0.00019043828],"about_ca_topic_score_codex":0.0011202166,"about_ca_topic_score_gemma":0.0007483798,"teacher_disagreement_score":0.4891577,"about_ca_system_score_codex":0.00007848013,"about_ca_system_score_gemma":0.00022394345,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W2341168876","doi":"10.1007/s10107-016-1013-7","title":"Nash equilibria in the two-player kidney exchange game","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Nash equilibrium; Outcome (game theory); Set (abstract data type); Integer programming; Mathematical economics; Game theory; Computer science; Medicine; Mathematics; Mathematical optimization","score_opus":0.13067816523714162,"score_gpt":0.4064818393004588,"score_spread":0.2758036740633172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341168876","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.70315987,0.00008547716,0.2028848,0.031649083,0.00017191787,0.0017748494,0.000016542193,0.00023401203,0.060023468],"genre_scores_gemma":[0.99197066,0.0000010675301,0.0047936263,0.00060085155,0.000105872976,0.00024681984,6.417172e-7,0.000012877943,0.0022675837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974822,0.00031652275,0.0005802019,0.0003682397,0.00083917845,0.0004136937],"domain_scores_gemma":[0.9954216,0.0033938822,0.00012128646,0.00084414665,0.00006292264,0.0001561958],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0055257864,0.00014094153,0.00023760759,0.0001062803,0.00009289449,0.00027627998,0.0011149973,0.00005765985,0.0018754152],"category_scores_gemma":[0.0046990933,0.00006017233,0.00010914371,0.0006778247,0.00023590396,0.00022770355,0.00016818778,0.00012762724,0.0039548404],"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.00001610901,0.00029358934,0.00039480385,0.000020504589,0.0000070800256,0.000011142502,0.0031820417,5.0306545e-7,0.003147434,0.5991387,0.0031878531,0.39060023],"study_design_scores_gemma":[0.00039454148,0.000031718446,0.00020227929,0.00006943065,0.000007753695,0.000023160865,0.00064771005,0.00034698818,0.00021929703,0.87401164,0.12391424,0.00013121196],"about_ca_topic_score_codex":0.0000021921976,"about_ca_topic_score_gemma":0.000005005673,"teacher_disagreement_score":0.39046904,"about_ca_system_score_codex":0.000020620488,"about_ca_system_score_gemma":0.000026085785,"threshold_uncertainty_score":0.999037},"labels":[],"label_agreement":null},{"id":"W2382996178","doi":"10.1142/s0219198916400028","title":"Strategic Support of Node-Consistent Cooperative Outcomes in Dynamic Games Played Over Event Trees","year":2016,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Subgame perfect equilibrium; Event (particle physics); Node (physics); Sequential game; Mathematical economics; Game tree; Subgame; Computer science; Extensive-form game; Tree (set theory); Backward induction; Non-cooperative game; Microeconomics; Repeated game; Operations research; Economics; Game theory; Mathematics; Equilibrium selection; Combinatorics; Engineering; Physics","score_opus":0.08526420958749709,"score_gpt":0.420012833805227,"score_spread":0.33474862421772994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2382996178","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.8871265,0.011165387,0.008853111,0.021596316,0.00096480054,0.002070677,0.00093970686,0.00009747609,0.06718601],"genre_scores_gemma":[0.9831356,0.0032878704,0.000069490765,0.0011282181,0.000015994408,0.00010853606,0.000011507028,0.000012034682,0.012230752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659324,0.0006170836,0.0013038721,0.0004521972,0.00083972956,0.0001938851],"domain_scores_gemma":[0.99594134,0.0024702926,0.00053027685,0.0006083499,0.00037285525,0.000076875076],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0036891573,0.00020998818,0.0006297735,0.00021756685,0.000025370471,0.00004044497,0.0010698957,0.000051618015,0.009047914],"category_scores_gemma":[0.0015918866,0.0001137864,0.0002903633,0.00033008738,0.00027655033,0.00025068974,0.00013840297,0.00010363712,0.0008029756],"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.00017588968,0.0005249246,0.007499588,0.00006431573,0.00019801619,0.000014620421,0.00029453292,0.0000871997,0.0036936665,0.9076626,0.00093661074,0.07884805],"study_design_scores_gemma":[0.0019232491,0.0002012278,0.051784568,0.0027807795,0.00009904841,0.000047182733,0.0004354157,0.00021020652,0.0010375275,0.8849497,0.055949923,0.0005811878],"about_ca_topic_score_codex":0.000004500238,"about_ca_topic_score_gemma":0.00004291542,"teacher_disagreement_score":0.09600908,"about_ca_system_score_codex":0.00009116656,"about_ca_system_score_gemma":0.000103151724,"threshold_uncertainty_score":0.999975},"labels":[],"label_agreement":null},{"id":"W2399884099","doi":"10.4086/toc.2013.v009a003","title":"","year":2013,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Nash equilibrium; Epsilon-equilibrium; Best response; Risk dominance; Correlated equilibrium; Trembling hand perfect equilibrium; Mathematics; Mathematical economics; Symmetric equilibrium; Combinatorics; Equilibrium selection; Mathematical optimization; Game theory; Repeated game","score_opus":0.11232443874160188,"score_gpt":0.3821212525641821,"score_spread":0.26979681382258025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399884099","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.7590806,0.000027804092,0.23550104,0.0005973293,0.00007228821,0.00027194293,0.0000012406357,0.00007219295,0.0043755677],"genre_scores_gemma":[0.9934006,4.2717454e-7,0.0058277813,0.00035123882,0.000081768,0.000009904106,6.535825e-7,0.0000103425045,0.00031729357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573964,0.0012059148,0.001269533,0.00047092716,0.00093124976,0.00038274788],"domain_scores_gemma":[0.9838649,0.013369691,0.00071964256,0.0011947693,0.0006884704,0.00016254837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013251771,0.00016773106,0.00044562778,0.00024719027,0.00036926847,0.00017708243,0.0019002199,0.000055296747,0.00062412827],"category_scores_gemma":[0.0036438326,0.000122905,0.00018276145,0.0010498284,0.00054092245,0.00047221017,0.00042287624,0.00016445295,0.00045087174],"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.000020564737,0.000072729395,0.0038652152,0.0000027012961,0.000011943351,2.8875195e-7,0.004145347,0.002464962,0.023232754,0.7268167,0.00009737539,0.23926939],"study_design_scores_gemma":[0.00023016286,0.000044583994,0.10024011,0.000016322969,0.000005830012,0.000007814114,0.0068672886,0.0048834193,0.012331944,0.87517893,0.00007028714,0.00012329475],"about_ca_topic_score_codex":0.000019929812,"about_ca_topic_score_gemma":8.369404e-7,"teacher_disagreement_score":0.2391461,"about_ca_system_score_codex":0.000009635572,"about_ca_system_score_gemma":0.00002863121,"threshold_uncertainty_score":0.68337667},"labels":[],"label_agreement":null},{"id":"W2399951836","doi":"","title":"A General Framework for Computing Optimal Correlated Equilibria in Compact Games (Extended Abstract)","year":2011,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.18477523655561276,"score_gpt":0.41518866185415143,"score_spread":0.23041342529853867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399951836","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.82876724,0.000019618168,0.15163797,0.00018835308,0.00015863171,0.0003196404,0.00001045606,0.000080803766,0.01881727],"genre_scores_gemma":[0.92188233,7.0275206e-7,0.07658601,0.00019427082,0.000062381136,0.000009504992,0.000004891875,0.0000118078315,0.0012480923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814075,0.00007560337,0.00067506946,0.0004353253,0.00031595706,0.00035726494],"domain_scores_gemma":[0.9971484,0.0018953208,0.00020979925,0.0004981125,0.00012459182,0.00012378712],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017602261,0.0001476495,0.0002911578,0.00017016377,0.00011469161,0.00011834558,0.00068561005,0.00013109676,0.002207995],"category_scores_gemma":[0.0008967812,0.00011071222,0.00012707496,0.0005545704,0.00012180916,0.00020293034,0.00007885127,0.00022149642,0.00041275646],"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.00033650227,0.00046008293,0.0073480303,0.000004427747,0.000029601788,0.000007123522,0.004423905,0.0025118177,0.0029264812,0.94890106,0.0045682243,0.028482761],"study_design_scores_gemma":[0.000615189,0.000096734206,0.17935808,0.000028281893,0.000009862796,0.000010319132,0.0012653552,0.12362402,0.0023296596,0.6908427,0.001545775,0.0002740386],"about_ca_topic_score_codex":0.00005916988,"about_ca_topic_score_gemma":0.000014206794,"teacher_disagreement_score":0.25805837,"about_ca_system_score_codex":0.000019646655,"about_ca_system_score_gemma":0.000044884164,"threshold_uncertainty_score":0.99870414},"labels":[],"label_agreement":null},{"id":"W2401718076","doi":"10.65109/uttv9040","title":"Detecting and identifying coalitions","year":2012,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Collusion; Reputation; Computer science; Identification (biology); Cluster analysis; Space (punctuation); Population; Face (sociological concept); Order (exchange); Multi-agent system; Computer security; Stability (learning theory); Risk analysis (engineering); Data science; Artificial intelligence; Business; Machine learning; Industrial organization; Political science; Law","score_opus":0.33371061996013135,"score_gpt":0.47548827645806985,"score_spread":0.1417776564979385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401718076","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.8670944,0.00007156769,0.07265072,0.00040320208,0.000077062105,0.000047421116,0.0000015844312,0.000040488125,0.059613563],"genre_scores_gemma":[0.9942142,0.0000012212882,0.0021489824,0.0001321856,0.000053091324,0.0000072422554,2.0873883e-7,0.0000018900498,0.0034410243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999439,0.00005025992,0.00013833719,0.000092413655,0.00016624706,0.00011373199],"domain_scores_gemma":[0.99898326,0.00069943455,0.000034211287,0.00017238507,0.00003384408,0.0000768584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016190937,0.000029772527,0.000046540787,0.00005076082,0.0002190297,0.00010310225,0.00010463466,0.0000148117315,0.0008630076],"category_scores_gemma":[0.00056939275,0.000021108055,0.000017606933,0.0002101173,0.00003984664,0.0003006238,0.00005771274,0.00003655823,0.0007114324],"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.0000017897077,0.000035911125,0.039703947,0.0000014148579,0.000004415146,1.3844058e-7,0.0017034726,0.0000028425306,0.011307394,0.8667559,0.0017157452,0.07876704],"study_design_scores_gemma":[0.0001391886,0.000008119739,0.1278436,0.000005070253,0.000011343441,0.000041511325,0.010604265,0.0002719655,0.013216643,0.7996811,0.04801677,0.00016036617],"about_ca_topic_score_codex":0.000005643282,"about_ca_topic_score_gemma":0.000006145055,"teacher_disagreement_score":0.12711976,"about_ca_system_score_codex":0.0000029344603,"about_ca_system_score_gemma":0.000002899599,"threshold_uncertainty_score":0.9449328},"labels":[],"label_agreement":null},{"id":"W2403173752","doi":"","title":"Asymmetric Cycle Avoidance Online Ramsey Games in Random Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06419502591758303,"score_gpt":0.35272492735197,"score_spread":0.28852990143438695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403173752","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.987299,0.00055516895,0.00012957523,0.0007989623,0.0009331226,0.0002475817,0.000012903687,0.00006397226,0.009959677],"genre_scores_gemma":[0.9983175,0.000023943861,0.00032358937,0.00022732117,0.000010936241,0.000036117148,0.0000068913487,0.00001219054,0.0010415377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745435,0.00037802535,0.00058167585,0.00044953046,0.0008399758,0.00029642775],"domain_scores_gemma":[0.9970051,0.0015361749,0.00018962909,0.0007816628,0.00026765204,0.00021975163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003577757,0.00015009394,0.00035056393,0.00049041695,0.00008164607,0.00012302103,0.0009535758,0.000087678374,0.000057267185],"category_scores_gemma":[0.0040623127,0.000121576726,0.00009736313,0.0034721328,0.00013572477,0.0002883418,0.00013922884,0.00024506397,0.0007229933],"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.00014187627,0.0006271032,0.02138396,0.00000202821,0.000010240518,0.000011121391,0.00068378705,0.00024695465,0.00010088352,0.9380973,0.012524619,0.026170105],"study_design_scores_gemma":[0.0030624932,0.00005151427,0.019759431,0.000008958003,0.000004965907,0.000003705828,0.00045165562,0.00051021046,0.0003103795,0.9629916,0.012697343,0.00014773456],"about_ca_topic_score_codex":0.00006515677,"about_ca_topic_score_gemma":0.000037496153,"teacher_disagreement_score":0.02602237,"about_ca_system_score_codex":0.00004616113,"about_ca_system_score_gemma":0.00010540632,"threshold_uncertainty_score":0.9292857},"labels":[],"label_agreement":null},{"id":"W2407490704","doi":"","title":"A Priority-based Model of Routing","year":2008,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Price of anarchy; Traverse; Routing (electronic design automation); Upper and lower bounds; Computer science; Latency (audio); Mathematical optimization; Polynomial; Mathematics; Price of stability; Mathematical economics; Economics; Computer network","score_opus":0.26394409621386766,"score_gpt":0.40283732576099707,"score_spread":0.1388932295471294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407490704","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.62136406,0.0000020228279,0.33761603,0.00027689748,0.000007854876,0.000042024778,0.0000027104822,0.00001940365,0.040668968],"genre_scores_gemma":[0.9823698,3.0169645e-7,0.013519099,0.00016480684,0.000007123249,0.0000031459645,2.7561956e-7,0.0000018216494,0.0039336677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991868,0.00003340185,0.00023986772,0.00013002963,0.000337714,0.00007216719],"domain_scores_gemma":[0.99904037,0.00040825937,0.00007476137,0.00032949547,0.000112979826,0.000034166245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080927403,0.00003433128,0.00009009577,0.00005173038,0.000091098314,0.000008412376,0.00028334738,0.000019438601,0.00022989366],"category_scores_gemma":[0.0003867193,0.000023450748,0.000049455546,0.00028708624,0.00008448626,0.000057502788,0.00002779928,0.00003475013,0.0001682021],"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.000026878542,0.00020804,0.0144791575,0.0000021107742,0.000004523267,0.0000011025336,0.0012635883,0.06994805,0.0296747,0.8735637,0.0021659227,0.008662224],"study_design_scores_gemma":[0.00022813327,0.000016960956,0.0028888832,0.000002620326,0.000002788029,0.0000021965325,0.00019544883,0.7253673,0.026955506,0.24348338,0.0007763269,0.00008045384],"about_ca_topic_score_codex":0.0000058987325,"about_ca_topic_score_gemma":0.0000043818422,"teacher_disagreement_score":0.65541923,"about_ca_system_score_codex":0.0000034116183,"about_ca_system_score_gemma":0.00006546357,"threshold_uncertainty_score":0.25171745},"labels":[],"label_agreement":null},{"id":"W2415746836","doi":"","title":"Stochastic Adaptive Nash Certainty Equivalence Control: Self-Identification Case","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Nash equilibrium; Population; Mathematical optimization; Dynamical systems theory; Equivalence (formal languages); Applied mathematics","score_opus":0.06737136997965631,"score_gpt":0.37208738128663427,"score_spread":0.30471601130697795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415746836","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.60497797,0.0000064565365,0.38664696,0.0008503587,0.000323109,0.00037882445,0.00003345408,0.00015963567,0.0066232225],"genre_scores_gemma":[0.99401975,3.1565588e-7,0.0016068512,0.00018294614,0.00009472154,0.00007423267,0.0000015748913,0.000007761795,0.0040118564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808556,0.00015142228,0.0004939056,0.0004900833,0.0005561394,0.00022286849],"domain_scores_gemma":[0.99605614,0.0021718086,0.000215382,0.000922633,0.00047142836,0.00016260074],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027484219,0.000120735225,0.00016671236,0.00012348715,0.00033579546,0.00021959537,0.0006407258,0.00007814773,0.0018139322],"category_scores_gemma":[0.0016299005,0.00008810862,0.00008415817,0.00048878713,0.0001776855,0.0003036847,0.00006825489,0.00023190034,0.0030722306],"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.00006827318,0.0002685942,0.0001922362,0.0000020113562,0.000029416296,0.000060429567,0.0011727132,0.0014378027,0.040884733,0.92741627,0.0025674284,0.025900118],"study_design_scores_gemma":[0.0014821754,0.00013774974,0.0053020474,0.000007237969,0.00010713004,0.0017481523,0.0048662242,0.19623671,0.0052474886,0.77796036,0.0062275277,0.0006771913],"about_ca_topic_score_codex":0.00004521746,"about_ca_topic_score_gemma":0.00020545555,"teacher_disagreement_score":0.38904175,"about_ca_system_score_codex":0.0000148429845,"about_ca_system_score_gemma":0.000056089157,"threshold_uncertainty_score":0.99909854},"labels":[],"label_agreement":null},{"id":"W2466482888","doi":"10.1007/s00453-016-0169-0","title":"Strategyproof Mechanisms for Competitive Influence in Networks","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; David and Lucile Packard Foundation; National Science Foundation","keywords":"Computer science; Competition (biology); Theory of computation; Class (philosophy); Mathematical economics; Mechanism design; Mechanism (biology); Mathematical optimization; Greedy algorithm; Microeconomics; Mathematics; Economics; Artificial intelligence","score_opus":0.051681884203119866,"score_gpt":0.36067185616539643,"score_spread":0.30898997196227657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466482888","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.056129865,0.00002082404,0.93838066,0.001826604,0.0001058854,0.00046206676,0.00005845988,0.00003973057,0.00297592],"genre_scores_gemma":[0.9909063,0.000003477884,0.007587753,0.00022836971,0.00005445811,0.00015169455,0.0000018606388,0.000007672971,0.0010584258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868286,0.000085487845,0.0003544135,0.0003675774,0.00026190563,0.00024775576],"domain_scores_gemma":[0.9973319,0.0019039013,0.000106531224,0.00037526462,0.00020865799,0.0000737151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012428818,0.000094829666,0.00016644057,0.00009378522,0.00008135029,0.000064422835,0.0005455189,0.00006442905,0.00018461102],"category_scores_gemma":[0.0005280601,0.000057152552,0.000057364578,0.0003876296,0.00011092723,0.00023151249,0.00006151612,0.000061866755,0.00023633595],"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.000022593904,0.000037357146,0.00009208388,5.495035e-7,0.0000038552676,0.0000013527874,0.000050770206,0.0002536674,0.0033079917,0.8514871,0.00022605654,0.14451663],"study_design_scores_gemma":[0.00046423337,0.00006712227,0.0036239603,0.000020190027,0.0000032196776,0.0000027007698,0.00021530602,0.003573099,0.004704666,0.98126566,0.0059355833,0.00012427148],"about_ca_topic_score_codex":0.0000054131556,"about_ca_topic_score_gemma":0.000026190643,"teacher_disagreement_score":0.9347764,"about_ca_system_score_codex":0.000023687628,"about_ca_system_score_gemma":0.00003646868,"threshold_uncertainty_score":0.30376995},"labels":[],"label_agreement":null},{"id":"W2476806688","doi":"10.1257/mic.20140135","title":"Strategic Information Acquisition and Transmission","year":2016,"lang":"en","type":"article","venue":"American Economic Journal Microeconomics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decision maker; Delegation; Cheap talk; Information transmission; Computer science; Knowledge management; Advice (programming); Business; Microeconomics; Management science; Economics; Management","score_opus":0.031767160774572034,"score_gpt":0.31100127037470426,"score_spread":0.27923410960013223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476806688","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.9714366,0.00003908589,0.019414905,0.004572979,0.0001442433,0.00008393981,0.000039889823,0.000017310293,0.004251045],"genre_scores_gemma":[0.9970531,0.00049526733,0.0014184355,0.0006760311,0.00012467017,0.0000043793316,0.0000018732665,0.0000082699335,0.00021796822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862343,0.000090475914,0.0007875784,0.00021147329,0.00006821417,0.00021883268],"domain_scores_gemma":[0.99831825,0.00043131938,0.0007230555,0.0002576052,0.00005591958,0.00021386372],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001316829,0.0001298322,0.00025378334,0.00023856264,0.00020967,0.00041545133,0.00037842873,0.000036509504,0.0009484374],"category_scores_gemma":[0.000029037561,0.000086468055,0.000090631715,0.00006770009,0.00033045717,0.0015220139,0.00004014896,0.00010265321,0.0017603958],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007786548,0.000012530991,0.001969036,8.692824e-7,0.000021779255,5.988418e-7,0.00023997175,0.00010942692,0.0055152997,0.026597973,0.001499675,0.963955],"study_design_scores_gemma":[0.0017803464,0.00033915677,0.015309092,0.000030948115,0.000031220796,0.001015965,0.005193056,0.0010273157,0.0036022167,0.6431888,0.32787722,0.000604682],"about_ca_topic_score_codex":0.0000118675025,"about_ca_topic_score_gemma":0.000004241369,"teacher_disagreement_score":0.9633503,"about_ca_system_score_codex":0.00016330522,"about_ca_system_score_gemma":0.00011389134,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W2480793474","doi":"10.1609/aaai.v30i1.10045","title":"Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Office of Naval Research Global; Sino-Danish Center; Alberta Innovates; Grantová Agentura České Republiky; Office of Naval Research; National Natural Science Foundation of China; National Research Foundation; České Vysoké Učení Technické v Praze; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Stackelberg competition; Computer science; Perfect information; Extensive-form game; Best response; Game theory; Imperfect; Algorithmic game theory; Mathematical optimization; Mathematical economics; Algorithm; Sequential game; Mathematics","score_opus":0.32910523418623444,"score_gpt":0.4314764942199643,"score_spread":0.10237126003372987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480793474","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.95508456,0.00001077567,0.03820223,0.0016852074,0.00023885803,0.0005694512,0.000018413702,0.000034470726,0.004156009],"genre_scores_gemma":[0.998194,0.00000613593,0.0012623108,0.00008033612,0.000052920124,0.000017240242,2.5813333e-7,0.000013139693,0.0003736515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974839,0.000032404332,0.0010028983,0.0005360132,0.0005638421,0.00038095334],"domain_scores_gemma":[0.99631387,0.001281359,0.00066832354,0.0003062511,0.001357885,0.000072290386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019469104,0.00020135146,0.0003481434,0.00021386897,0.00019796427,0.00028632328,0.0013863697,0.00010060729,0.00015941852],"category_scores_gemma":[0.0029395898,0.00011331602,0.00013715288,0.00086857285,0.00052223844,0.0005511537,0.00023550929,0.00015670176,0.00008566491],"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.00014198534,0.00005709804,0.00037700872,0.0000069480493,0.000005382186,1.037442e-7,0.001010945,0.00012793134,0.2266883,0.7192172,0.000067953755,0.052299142],"study_design_scores_gemma":[0.000053339096,0.00008128965,0.000364301,0.0002538966,0.000008509461,0.0000024702658,0.0056860535,0.05277873,0.14843994,0.79208803,0.0000919532,0.00015149258],"about_ca_topic_score_codex":0.00002606479,"about_ca_topic_score_gemma":0.000023363555,"teacher_disagreement_score":0.07824836,"about_ca_system_score_codex":0.00005198911,"about_ca_system_score_gemma":0.00016308625,"threshold_uncertainty_score":0.46208933},"labels":[],"label_agreement":null},{"id":"W2484076663","doi":"10.1017/cbo9781139507684.007","title":"On the purpose and limitations of game-theoretic models","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"Simon Fraser University","funders":"","keywords":"Mathematical economics; Game theory; Computer science; Economics","score_opus":0.14033075980741386,"score_gpt":0.2640888373604913,"score_spread":0.12375807755307747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484076663","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014197719,0.00003634844,0.012960808,0.00013190573,0.000043423355,0.00038968746,0.00015180394,0.000027695627,0.98483855],"genre_scores_gemma":[0.2780237,0.000047303223,0.000035979094,0.00008974542,0.00001760156,0.0000013146432,0.0000041692206,0.000012887847,0.7217673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985626,0.00014666776,0.00026311068,0.0004179554,0.000477522,0.00013214431],"domain_scores_gemma":[0.9935351,0.0047329417,0.00035063407,0.0009996878,0.0002801535,0.000101484955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068285136,0.00020225669,0.00031296836,0.0001863293,0.00020154328,0.000060239592,0.0009051502,0.00016271535,0.000011371549],"category_scores_gemma":[0.0003077928,0.00015107196,0.00015610435,0.000019097644,0.000941319,0.000050403713,0.00021657159,0.00027363433,0.00004047745],"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.000039357143,0.0000059488466,8.5724125e-8,0.000005263698,0.000022768036,0.0000027177018,0.00015201072,0.00008076174,0.000019028676,0.98795104,0.006796671,0.004924332],"study_design_scores_gemma":[0.00024042788,0.00007867485,0.000006620127,0.00007490189,0.00013646888,0.000005121222,0.00020556981,0.0016055616,0.0001863438,0.22104952,0.776172,0.00023881414],"about_ca_topic_score_codex":0.000005957913,"about_ca_topic_score_gemma":0.0000011625048,"teacher_disagreement_score":0.7693753,"about_ca_system_score_codex":0.000022466715,"about_ca_system_score_gemma":0.000043607113,"threshold_uncertainty_score":0.6160536},"labels":[],"label_agreement":null},{"id":"W2490970495","doi":"10.1007/978-3-319-29254-0_12","title":"Kant-Nash Equilibria in a Quantity-Setting Oligopoly","year":2016,"lang":"en","type":"book-chapter","venue":"Springer series in game theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nash equilibrium; Oligopoly; Conjecture; Mathematical economics; Norm (philosophy); Economics; Categorical variable; Categorical imperative; Microeconomics; Philosophy; Epistemology; Mathematics; Cournot competition; Pure mathematics","score_opus":0.05840808012058098,"score_gpt":0.3392691409840883,"score_spread":0.2808610608635073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490970495","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0678145,0.0010864747,0.0007543016,0.0007573055,0.00083771977,0.0006416069,0.000083875646,0.00016942626,0.9278548],"genre_scores_gemma":[0.4865094,0.00017010536,0.00041859513,0.00022125781,0.00033583422,0.00006281759,0.000003330352,0.00010495794,0.51217365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949929,0.00041408397,0.0016291662,0.0012506965,0.0010058223,0.00070733426],"domain_scores_gemma":[0.99403685,0.0028480818,0.00069147797,0.0021136913,0.00014878922,0.00016111674],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0077795302,0.00059662515,0.0009844381,0.0010613276,0.0001107328,0.0002382939,0.0021844243,0.0005268117,0.003434274],"category_scores_gemma":[0.0015442289,0.00047477696,0.00029783795,0.00030232483,0.001068385,0.0006433569,0.0010233307,0.0008539499,0.0032420994],"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.0001779273,0.00002423498,0.00049621036,0.000017188018,0.000019330022,0.00006402293,0.0010232957,0.000006585289,0.0006835727,0.96313787,0.00013843321,0.034211334],"study_design_scores_gemma":[0.00031794424,0.000040127223,0.00047794665,0.00043898134,0.000013104706,0.000026873146,0.00045727522,0.000008053941,0.000268301,0.880194,0.117224894,0.00053250446],"about_ca_topic_score_codex":0.00001542841,"about_ca_topic_score_gemma":0.00029721056,"teacher_disagreement_score":0.4186949,"about_ca_system_score_codex":0.00015920812,"about_ca_system_score_gemma":0.00021144241,"threshold_uncertainty_score":0.9997704},"labels":[],"label_agreement":null},{"id":"W2493453559","doi":"10.1016/j.geb.2016.07.004","title":"Identification of payoffs in repeated games","year":2016,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Repeated game; Mathematical economics; Affine transformation; Best response; Identification (biology); Symmetric game; Mathematics; Computer science; Game theory; Normal-form game; Pure mathematics","score_opus":0.06084493792174564,"score_gpt":0.34706316818657135,"score_spread":0.28621823026482573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493453559","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.99873596,0.00004108998,0.00017345593,0.00043554185,0.000078461984,0.00012627542,0.00004190085,0.000010576622,0.000356722],"genre_scores_gemma":[0.9961808,0.000050717386,0.000036149122,0.000013929745,0.000015453887,0.000051271556,0.0000010700461,0.0000043398527,0.0036462739],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998916,0.000043940774,0.00058604515,0.00028390036,0.00006709911,0.00010306946],"domain_scores_gemma":[0.9991028,0.00021813568,0.0002195819,0.0003897896,0.000027652271,0.00004209193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009729615,0.00006237467,0.00016280792,0.00012372049,0.000026245163,0.00003878362,0.00021284912,0.00004261312,0.00051538536],"category_scores_gemma":[0.0000969759,0.000040355815,0.000041075116,0.00007889737,0.00012377076,0.0001823942,0.000045241126,0.000026886439,0.00026921363],"study_design_candidate":"observational","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.000019304269,0.00010611609,0.37823313,0.0000019001236,0.0000038216053,9.0441745e-7,0.00040912713,0.000007240154,0.0656452,0.010909958,0.00052653364,0.54413676],"study_design_scores_gemma":[0.00034289877,0.00001788326,0.96175206,0.000010762085,0.000010753042,0.000004976032,0.00034478065,0.00004644653,0.017921828,0.015967358,0.0034864354,0.00009380865],"about_ca_topic_score_codex":0.000029416513,"about_ca_topic_score_gemma":0.000057022677,"teacher_disagreement_score":0.5835189,"about_ca_system_score_codex":0.000021213948,"about_ca_system_score_gemma":0.000017314225,"threshold_uncertainty_score":0.5643108},"labels":[],"label_agreement":null},{"id":"W2498881781","doi":"10.1142/9789814289238_0004","title":"Game Theory: Static and Dynamic Games","year":2011,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Sequential game; Mathematical economics; Game theory; Computer science; Combinatorial game theory; Economics","score_opus":0.10010849822619633,"score_gpt":0.3349502185713095,"score_spread":0.2348417203451132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498881781","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010916169,0.00036302797,0.001374982,0.00011848787,0.0008217699,0.0005044033,0.00016025342,0.00010914634,0.99545634],"genre_scores_gemma":[0.13512747,0.0000021125154,0.00025576644,0.00015686562,0.000040169954,0.00002945978,0.000019834959,0.000045776753,0.86432254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959308,0.00016192392,0.00083697296,0.0014359297,0.001224586,0.00040976738],"domain_scores_gemma":[0.9955738,0.0012600966,0.0005712759,0.0020136985,0.0002938369,0.0002872703],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005506674,0.00042092934,0.0005792941,0.0011081283,0.0005112671,0.0009565058,0.00135592,0.00015008416,0.0037170788],"category_scores_gemma":[0.00012480639,0.00032488734,0.00021495941,0.00015316272,0.0026022806,0.00011208041,0.0004009927,0.00044734144,0.0040189805],"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.000016597794,0.000009112985,0.00000319825,0.000008800934,0.000022376615,0.0000065212243,0.0010536652,6.025837e-7,0.000090285095,0.91441745,0.0076508294,0.07672056],"study_design_scores_gemma":[0.00006633123,0.000010366805,0.000019931387,0.000055734625,0.000034033255,0.0000058158867,0.000044833767,0.000026795142,0.00004388077,0.5413553,0.45813403,0.0002029494],"about_ca_topic_score_codex":0.0000012230932,"about_ca_topic_score_gemma":0.0005439364,"teacher_disagreement_score":0.4504832,"about_ca_system_score_codex":0.000041461615,"about_ca_system_score_gemma":0.0001453633,"threshold_uncertainty_score":0.9999203},"labels":[],"label_agreement":null},{"id":"W2516220549","doi":"10.1016/j.jebo.2016.09.011","title":"Learning correlated equilibria: An evolutionary approach","year":2016,"lang":"en","type":"article","venue":"Journal of Economic Behavior & Organization","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":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Generalization; Mathematical economics; Computer science; Equilibrium selection; Pareto principle; Correlated equilibrium; Best response; Evolutionary algorithm; Repeated game; Mathematical optimization; Mathematics; Game theory; Artificial intelligence","score_opus":0.063736683347442,"score_gpt":0.33831975876577586,"score_spread":0.2745830754183339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516220549","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.9771737,0.000011979031,0.021613361,0.0003164679,0.00033759352,0.00008849332,0.000004646327,0.000025418618,0.00042833152],"genre_scores_gemma":[0.9971618,0.000009713546,0.0010924706,0.000017359243,0.00021499406,0.000002066985,0.000009502633,0.000019854182,0.0014722075],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983884,0.00020214065,0.000823,0.0002097024,0.0002352121,0.00014153],"domain_scores_gemma":[0.9983193,0.00019693997,0.0006319965,0.0002627313,0.00046017233,0.00012880815],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015146828,0.000095377705,0.00020917167,0.00022546749,0.00016798908,0.000101246005,0.0005010388,0.00009504192,0.0022722387],"category_scores_gemma":[0.0005093741,0.000056611243,0.0000632478,0.0002460566,0.00007433278,0.0011944418,0.00006223234,0.0001413025,0.0007347893],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010492149,0.00072865235,0.464416,0.0000020484476,0.000046722744,0.000009865679,0.0017207911,0.0067866184,0.4435289,0.024908287,0.0031741236,0.054573067],"study_design_scores_gemma":[0.0045220703,0.0012951655,0.87313914,0.000061081744,0.00047426866,0.0022918042,0.0046319026,0.0062234537,0.036709476,0.05518673,0.014367213,0.0010976803],"about_ca_topic_score_codex":0.0000015566517,"about_ca_topic_score_gemma":3.3421307e-7,"teacher_disagreement_score":0.40872315,"about_ca_system_score_codex":0.0001847716,"about_ca_system_score_gemma":0.00011457845,"threshold_uncertainty_score":0.9986398},"labels":[],"label_agreement":null},{"id":"W2516380029","doi":"10.1109/isit.2016.7541575","title":"Dynamic signaling games under Nash and Stackelberg equilibria","year":2016,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Stackelberg competition; Nash equilibrium; Best response; Mathematical optimization; Mathematical economics; Computer science; Sequential game; Equilibrium selection; Repeated game; Affine transformation; Game theory; Mathematics","score_opus":0.07341663773517468,"score_gpt":0.38086752991072415,"score_spread":0.30745089217554944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516380029","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.894481,0.000049977665,0.08829587,0.0039491863,0.000046866124,0.00007270254,0.0000073794595,0.0000518018,0.013045225],"genre_scores_gemma":[0.96358943,0.000008082134,0.0014117965,0.0002583996,0.000014919998,0.000006537564,3.6586226e-7,0.000005833401,0.03470461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887955,0.00007985664,0.000249901,0.00031330241,0.0003189356,0.00015844645],"domain_scores_gemma":[0.99774396,0.0016501653,0.00006399206,0.0003793045,0.00007222733,0.00009036134],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001001157,0.00007683378,0.00011551482,0.00007382108,0.00008781099,0.000120407785,0.00029891744,0.00003642836,0.0028978381],"category_scores_gemma":[0.0003027115,0.000038441223,0.000036849942,0.00021307699,0.00015729244,0.0002479822,0.000117944575,0.00003136566,0.0010612977],"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.00001972262,0.000031639123,0.0014697273,0.0000012953831,0.000013281341,8.9535416e-7,0.00015579603,0.000023831215,0.32476366,0.5704663,0.0027924674,0.100261375],"study_design_scores_gemma":[0.0002407686,0.000021736329,0.0047100373,0.000009564517,0.0000049083073,0.000005410904,0.0005563403,0.00071732566,0.0047793016,0.9783687,0.010464991,0.00012089076],"about_ca_topic_score_codex":0.0000029786618,"about_ca_topic_score_gemma":0.000018927529,"teacher_disagreement_score":0.40790242,"about_ca_system_score_codex":0.000011017931,"about_ca_system_score_gemma":0.00002092133,"threshold_uncertainty_score":0.9997165},"labels":[],"label_agreement":null},{"id":"W2517446547","doi":"10.1016/j.ejor.2016.08.014","title":"A general hierarchical graph model for conflict resolution with application to greenhouse gas emission disputes between USA and China","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation; Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Greenhouse gas; Hierarchical database model; Graph; China; Conflict resolution; Computer science; Operations research; Theoretical computer science; Mathematics; Political science; Data mining; Geology; Law","score_opus":0.18617372860610062,"score_gpt":0.4356804138662638,"score_spread":0.2495066852601632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517446547","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.49731222,0.00001619123,0.49299628,0.008973095,0.000008110485,0.00026112373,0.000036742287,0.0000041671374,0.00039206966],"genre_scores_gemma":[0.97277725,0.000031027448,0.023889715,0.0000839769,0.00041297066,0.000023827968,0.0000043408045,0.000019756066,0.0027571588],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9962491,0.0009225584,0.00063563196,0.00035803142,0.0015632105,0.00027150236],"domain_scores_gemma":[0.9960949,0.0016753032,0.00016359445,0.00031804774,0.0013289846,0.00041920107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011334662,0.00011249374,0.00019522567,0.00044334686,0.0005348713,0.00023928723,0.00065472856,0.000027511553,0.00003841617],"category_scores_gemma":[0.0023894245,0.000058944006,0.00006429299,0.00048709442,0.00028985902,0.00037611413,0.0001456931,0.00024457785,0.00006150805],"study_design_candidate":"observational","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.0040099113,0.00043056047,0.015538204,0.000017462891,0.000110105815,0.000024236255,0.0032402652,0.014552296,0.24317089,0.19372901,0.032636218,0.49254084],"study_design_scores_gemma":[0.007854626,0.006350817,0.47967553,0.00043278225,0.0000645118,0.00031813467,0.00026368827,0.1417696,0.010153682,0.2464497,0.10575784,0.000909083],"about_ca_topic_score_codex":0.0000031996763,"about_ca_topic_score_gemma":0.000005956735,"teacher_disagreement_score":0.49163178,"about_ca_system_score_codex":0.000041195235,"about_ca_system_score_gemma":0.00018325914,"threshold_uncertainty_score":0.41138515},"labels":[],"label_agreement":null},{"id":"W2518570066","doi":"10.1257/aer.20161492","title":"Certified Random: A New Order for Coauthorship","year":2018,"lang":"en","type":"article","venue":"American Economic Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Social Sciences and Humanities Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Alphabet; Order (exchange); Computer science; Certification; Norm (philosophy); First order; Mathematical economics; Operations research; Economics; Mathematics; Linguistics; Political science; Law; Management; Philosophy; Applied mathematics","score_opus":0.22767566107192516,"score_gpt":0.46646203195891683,"score_spread":0.23878637088699167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518570066","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.11462857,0.047866352,0.35499814,0.1928148,0.0028396929,0.013092599,0.00022367,0.00054739934,0.2729888],"genre_scores_gemma":[0.8795254,0.0127951335,0.016548915,0.036793064,0.0020007167,0.0009133596,0.000026574107,0.00007923827,0.051317606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834096,0.00017504192,0.0007030655,0.00045109837,0.00010561868,0.00022422851],"domain_scores_gemma":[0.9969431,0.0014553865,0.00048471402,0.0008276923,0.000116362506,0.00017271437],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026245231,0.00012655609,0.0005962613,0.000055985278,0.00012260329,0.000078718884,0.0007198954,0.000018595463,0.0025452902],"category_scores_gemma":[0.0017113499,0.00009280937,0.00018588775,0.000382583,0.00040521685,0.000119024844,0.000051403982,0.000049974096,0.009241344],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049615355,0.0000103504,0.00006961637,0.000016050735,0.00001609975,6.4006294e-8,0.00007089038,0.0000023685839,0.000023058154,0.018366685,0.2175865,0.7637887],"study_design_scores_gemma":[0.0003389501,0.00007778431,0.00017539576,0.00006756762,0.000032988883,0.000004212955,0.000055620665,0.00016171037,0.00007393385,0.05256034,0.94632095,0.0001305599],"about_ca_topic_score_codex":0.000061903724,"about_ca_topic_score_gemma":0.00006360729,"teacher_disagreement_score":0.7648968,"about_ca_system_score_codex":0.000029438674,"about_ca_system_score_gemma":0.00016585233,"threshold_uncertainty_score":0.99836653},"labels":[],"label_agreement":null},{"id":"W2526647779","doi":"10.2139/ssrn.2843112","title":"Bayesian Learning in Markets with Common Value.","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Bayesian probability; Value (mathematics); Econometrics; Computer science; Artificial intelligence; Economics; Statistics; Machine learning; Mathematics","score_opus":0.018597907312568395,"score_gpt":0.31569864168080036,"score_spread":0.297100734368232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526647779","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.8741511,0.0002587624,0.1087092,0.006290125,0.000041997282,0.00009648523,7.10874e-7,0.0000288514,0.010422732],"genre_scores_gemma":[0.9910314,0.00021471397,0.00009652389,0.000063422274,0.00006613546,0.0000053601766,1.7918894e-7,0.000011173702,0.008511063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997155,0.0004728141,0.00035838303,0.0002317014,0.0005464101,0.0012356688],"domain_scores_gemma":[0.9986295,0.0007578752,0.00020238712,0.00025455034,0.00007021482,0.000085453605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008544458,0.000102886035,0.00017144931,0.00020399915,0.00021616834,0.000089144116,0.0005784243,0.000043861262,0.00023046814],"category_scores_gemma":[0.00041404174,0.000052468866,0.000056463206,0.0004884507,0.00008371382,0.00027171112,0.000038373473,0.0010043167,0.00023832214],"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.0002107148,0.00005948476,0.0690733,4.2315608e-7,0.000023816137,0.0000072573675,0.00016127301,0.00016019936,0.0010383587,0.52940214,0.000102034115,0.399761],"study_design_scores_gemma":[0.00064750266,0.00018639799,0.016071636,0.000027117301,0.000005580241,0.0003476889,0.0011316922,0.00012420518,0.00014228649,0.9746823,0.0065206196,0.00011298334],"about_ca_topic_score_codex":0.000008524704,"about_ca_topic_score_gemma":0.0005670063,"teacher_disagreement_score":0.44528013,"about_ca_system_score_codex":0.00028765658,"about_ca_system_score_gemma":0.0006958052,"threshold_uncertainty_score":0.43633124},"labels":[],"label_agreement":null},{"id":"W2544501254","doi":"10.1109/allerton.2008.4797658","title":"Local dynamics for network formation games","year":2008,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Locality; Computer science; Node (physics); Focus (optics); Dynamics (music); Key (lock); Network formation; Class (philosophy); Property (philosophy); Range (aeronautics); Network dynamics; Complex network; Evolving networks; Theoretical computer science; Distributed computing; Computer network; Artificial intelligence; Mathematics; Computer security; World Wide Web; Engineering","score_opus":0.1107692987290476,"score_gpt":0.36968057296000234,"score_spread":0.2589112742309547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544501254","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.043110564,0.000011755357,0.930838,0.0008854544,0.00006363568,0.00015857542,0.000006505235,0.000041326748,0.024884202],"genre_scores_gemma":[0.9824714,0.0000032652044,0.00719453,0.0003101362,0.00006169392,0.000039580675,0.000010673687,0.0000032185033,0.009905484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923444,0.000028207302,0.00024886304,0.00013050598,0.00022632784,0.00013165445],"domain_scores_gemma":[0.99883085,0.00068549113,0.00006658305,0.0002515309,0.00012223239,0.000043329645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007340211,0.000046718797,0.00008396917,0.000033543252,0.00024262072,0.0000322956,0.00025254316,0.000031868134,0.00023046219],"category_scores_gemma":[0.00017112985,0.000032118405,0.000058823898,0.00028149935,0.00008917812,0.00021548489,0.000027718632,0.000030163104,0.00045076018],"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.000019131296,0.000022109885,0.0003855681,9.612241e-7,0.0000023785567,2.449555e-7,0.00017194859,0.006396481,0.000011166427,0.8118884,0.092743635,0.088357955],"study_design_scores_gemma":[0.00014960956,0.0000285417,0.0016104274,0.0000014349456,0.0000026324683,0.000016977536,0.0005374412,0.28700292,0.0002493141,0.61610776,0.09421921,0.00007372448],"about_ca_topic_score_codex":0.0000020445273,"about_ca_topic_score_gemma":0.000053948406,"teacher_disagreement_score":0.93936086,"about_ca_system_score_codex":0.00001702733,"about_ca_system_score_gemma":0.000015786427,"threshold_uncertainty_score":0.57937604},"labels":[],"label_agreement":null},{"id":"W2560085046","doi":"10.2139/ssrn.2873888","title":"Identifying the Best Agent in a Network","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Business; Computer science","score_opus":0.07885315764026328,"score_gpt":0.3745514537078977,"score_spread":0.2956982960676344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560085046","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.8542143,0.002807262,0.12556116,0.01309163,0.0003563962,0.00017445699,0.000001187038,0.000015836258,0.0037777503],"genre_scores_gemma":[0.99046767,0.0010104047,0.000038436265,0.00013474734,0.0003285259,0.000009825078,6.819933e-8,0.000006354306,0.008003963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726987,0.00030315734,0.0004040273,0.00018532592,0.0004961522,0.0013414894],"domain_scores_gemma":[0.9985779,0.0007788238,0.00018154795,0.00034066563,0.0000686072,0.000052441952],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011747944,0.000077665754,0.000112205926,0.000083769424,0.00033084073,0.00015003669,0.0009370426,0.000032074022,0.00017315755],"category_scores_gemma":[0.00046780892,0.0000334702,0.000092927556,0.0005648962,0.00008050445,0.00020178287,0.00007501746,0.0006667412,0.0010330452],"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.000019043013,0.000029874258,0.005535176,1.4100479e-7,0.000015739743,0.0000019018663,0.00017283314,0.00009501988,0.0005280017,0.77301,0.00056139595,0.22003083],"study_design_scores_gemma":[0.00021086862,0.000034402015,0.0021343168,0.000016075297,0.0000053270305,0.00013299503,0.0020515812,0.000016434497,0.000034434754,0.9816108,0.013696441,0.00005637084],"about_ca_topic_score_codex":0.000008896163,"about_ca_topic_score_gemma":0.0008346151,"teacher_disagreement_score":0.21997447,"about_ca_system_score_codex":0.00025453034,"about_ca_system_score_gemma":0.00047888805,"threshold_uncertainty_score":0.9997448},"labels":[],"label_agreement":null},{"id":"W2560660664","doi":"10.1016/j.geb.2018.06.008","title":"Multilateral limit pricing in price-setting games","year":2018,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"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":"Stackelberg competition; Oligopoly; Limit (mathematics); Mathematical economics; Economics; Bertrand competition; Constant (computer programming); Microeconomics; Strategy; Set (abstract data type); Game theory; Mathematics; Computer science; Cournot competition","score_opus":0.06923152673119372,"score_gpt":0.35879406318750195,"score_spread":0.28956253645630825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560660664","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.9963055,0.00004329984,0.000103819184,0.00035601444,0.00017523963,0.0001857626,0.000010274643,0.000025357269,0.0027947219],"genre_scores_gemma":[0.9968459,0.00001090566,0.00089753116,0.00013800635,0.0001424814,0.000049744278,0.0000013987645,0.0000090481935,0.001904989],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99874073,0.00004299594,0.00046287375,0.00042178915,0.000078923375,0.00025267072],"domain_scores_gemma":[0.9991825,0.00022782042,0.00014431526,0.00033390505,0.00002731288,0.00008412637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009856886,0.00011123978,0.00020027615,0.0001477571,0.00012245141,0.00019360975,0.00028231106,0.000060536706,0.00078478665],"category_scores_gemma":[0.00007756555,0.00009256308,0.000047389567,0.000101639496,0.00015585634,0.00025750752,0.00012600797,0.0000948142,0.00072888384],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027525793,0.00008434003,0.5422778,0.0000027561564,0.000005036869,0.000004274712,0.0036276826,0.000039554663,0.0025917208,0.0031892944,0.000845838,0.4473042],"study_design_scores_gemma":[0.0004298731,0.000057577276,0.9685599,0.000017375529,0.000013339639,0.000020310048,0.001421307,0.0026596375,0.0017783643,0.0047096624,0.020102099,0.00023051816],"about_ca_topic_score_codex":0.00007332562,"about_ca_topic_score_gemma":0.00015375037,"teacher_disagreement_score":0.44707367,"about_ca_system_score_codex":0.00003745369,"about_ca_system_score_gemma":0.000023768876,"threshold_uncertainty_score":0.93685704},"labels":[],"label_agreement":null},{"id":"W2566289651","doi":"10.1017/s0012217316000731","title":"30 Years After ‘<i>Morals by Agreement</i>’","year":2016,"lang":"en","type":"article","venue":"Dialogue","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":"York University","funders":"","keywords":"Agreement; Psychology; Political science; Philosophy; Linguistics","score_opus":0.05945718632486247,"score_gpt":0.34341386899455856,"score_spread":0.2839566826696961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566289651","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.9784234,0.00009742527,0.004384251,0.0030509261,0.00021540727,0.00015509823,0.00027820017,0.00004210711,0.01335314],"genre_scores_gemma":[0.98783064,0.000009023083,0.000095734744,0.0008227038,0.00008303752,0.000056807658,0.000004864868,0.000005700702,0.011091482],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988219,0.00010089939,0.0002436096,0.00027766865,0.00037812613,0.00017780671],"domain_scores_gemma":[0.99877405,0.0004908743,0.000069587964,0.00052198104,0.00005426695,0.00008925626],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00085585174,0.000071059185,0.00011546895,0.000051488703,0.000043143034,0.00006285994,0.0004378691,0.00004160188,0.0072526135],"category_scores_gemma":[0.00035795488,0.00004130565,0.000061290644,0.00019881394,0.00012938974,0.00013872948,0.000078445475,0.00003316016,0.025051009],"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.00003883782,0.00013673543,0.014214429,9.885908e-7,0.000016726202,0.000011374805,0.0005138605,9.814688e-7,0.05908593,0.032072138,0.6499017,0.2440063],"study_design_scores_gemma":[0.0002973711,0.000025774232,0.023352584,0.000007011827,0.000005226839,0.0000011867569,0.0000442957,0.0000013284723,0.005237872,0.20028432,0.77060956,0.00013349067],"about_ca_topic_score_codex":0.0000074737122,"about_ca_topic_score_gemma":0.0000097687425,"teacher_disagreement_score":0.24387282,"about_ca_system_score_codex":0.000010948008,"about_ca_system_score_gemma":0.000013583129,"threshold_uncertainty_score":0.9936549},"labels":[],"label_agreement":null},{"id":"W2566978476","doi":"10.1007/s10726-016-9520-8","title":"Symmetric Sequential Stability in the Graph Model for Conflict Resolution with Multiple Decision Makers","year":2016,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":91,"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":"Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Government of Canada; Australian Government","keywords":"Stability (learning theory); Probabilistic logic; Conflict resolution; Mathematics; Mathematical economics; Mathematical optimization; Graph; Computer science; Combinatorics; Machine learning; Statistics; Political science","score_opus":0.13007635231850964,"score_gpt":0.35653551218420587,"score_spread":0.22645915986569623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566978476","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.47115973,0.000045678116,0.5275851,0.0004764359,0.000055659435,0.00054748723,0.000034785062,0.000016684333,0.000078460616],"genre_scores_gemma":[0.9900184,0.0000566311,0.009436946,0.00022773446,0.000039569677,0.00014452265,0.000011052323,0.000010986062,0.0000541517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997035,0.00028213466,0.0006985494,0.0006697086,0.0010430495,0.00027155186],"domain_scores_gemma":[0.98844665,0.010209743,0.00025616647,0.00071418926,0.0002788462,0.000094381496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058941985,0.00017242144,0.00023567797,0.0004754686,0.00035184054,0.0001965408,0.000480704,0.00011968847,0.000043319284],"category_scores_gemma":[0.0038294324,0.000081195874,0.00010165813,0.0013332451,0.00016604802,0.000539611,0.00006948398,0.00009957852,0.000032679574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004095306,0.00039240415,0.02400564,0.000006925114,0.000014625965,0.0000017653426,0.0021238073,0.0023245714,0.006681004,0.096682265,0.0023317498,0.8613399],"study_design_scores_gemma":[0.0054763416,0.00033911646,0.16451386,0.00007106408,0.000031554697,0.000015516309,0.0010512603,0.2693327,0.0005120281,0.5534147,0.0049055875,0.00033624563],"about_ca_topic_score_codex":0.000017400074,"about_ca_topic_score_gemma":0.00046944476,"teacher_disagreement_score":0.8610037,"about_ca_system_score_codex":0.00006183555,"about_ca_system_score_gemma":0.00003633938,"threshold_uncertainty_score":0.4584465},"labels":[],"label_agreement":null},{"id":"W2573406330","doi":"10.15353/rea.v10i2.1444","title":"Availability of better data on communication networks can undermine community enforcement","year":2018,"lang":"en","type":"article","venue":"Review of Economic Analysis","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Obfuscation; Ignorance; Computer science; Computer security; Enforcement; Vulnerability (computing); Internet privacy; Political science; Law","score_opus":0.23367243862969897,"score_gpt":0.4484511826835833,"score_spread":0.21477874405388434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573406330","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.8812299,0.012664886,0.028612839,0.007888449,0.000103180624,0.0012564926,0.0008916043,0.000034104534,0.06731856],"genre_scores_gemma":[0.99392164,0.0044207647,0.00040654768,0.0008146587,0.00002077851,0.000007966565,0.00024764604,0.0000032813564,0.0001566953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735403,0.00096450356,0.0011893024,0.00024071081,0.00016002811,0.00009142604],"domain_scores_gemma":[0.9915136,0.0015528598,0.0009318104,0.0057847872,0.00017015381,0.00004676974],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009419156,0.00009097375,0.0006521462,0.00012894171,0.00014081175,0.000016332713,0.0023287714,0.000031558713,0.0035888012],"category_scores_gemma":[0.0005184651,0.000069839305,0.00020964448,0.00060462573,0.00039879442,0.000103899016,0.0005088562,0.000119515054,0.00013724709],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013613071,0.0018208901,0.117516905,0.0014864996,0.0060941363,1.8749698e-7,0.0013483608,0.019849956,0.00007370685,0.18625864,0.105472095,0.5599425],"study_design_scores_gemma":[0.0011338989,0.0006444834,0.083049186,0.003111854,0.009781888,0.000002418338,0.0018819114,0.4598738,0.0009511599,0.14021169,0.29814857,0.0012091388],"about_ca_topic_score_codex":0.0005945744,"about_ca_topic_score_gemma":0.00079997425,"teacher_disagreement_score":0.55873334,"about_ca_system_score_codex":0.00004930116,"about_ca_system_score_gemma":0.00003892606,"threshold_uncertainty_score":0.9973221},"labels":[],"label_agreement":null},{"id":"W2585136924","doi":"10.1299/jsmekansai.2004.79._11-19_","title":"1110 Reinforcement Learning in Consideration of Symmetry","year":2004,"lang":"en","type":"article","venue":"The Proceedings of Conference of Kansai Branch","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":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Homogeneous space; Symmetry (geometry); Formalism (music); Markov decision process; Reinforcement; Computer science; Theoretical physics; Markov process; Mathematics; Pure mathematics; Artificial intelligence; Physics; Geometry; Engineering","score_opus":0.079890098860958,"score_gpt":0.33430927799012533,"score_spread":0.25441917912916734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585136924","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.9697171,0.00002979732,0.0035627836,0.0013261416,0.00002192541,0.00023796581,0.0000016877087,0.000010661355,0.02509195],"genre_scores_gemma":[0.9992362,0.000018238325,0.0003678202,0.000035007422,0.000010979625,0.000013659926,6.3993843e-7,0.000004485236,0.00031292386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820197,0.000018010182,0.00081982644,0.0001895777,0.0006308213,0.00013980233],"domain_scores_gemma":[0.9977974,0.00036464172,0.00066519174,0.0001581484,0.0009816494,0.0000329332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021852674,0.00009574996,0.00031096817,0.00020101492,0.00006334578,0.000041293675,0.0005716989,0.000053975236,0.00015525572],"category_scores_gemma":[0.00139922,0.00006622924,0.00006462073,0.00068492605,0.0003454215,0.0002930232,0.000070067916,0.00016591059,0.000013659925],"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.00006454637,0.00006227838,0.0038495865,0.000036855945,0.000009636056,5.1372567e-8,0.004237874,0.002628907,0.17507212,0.80771255,0.00003586533,0.006289725],"study_design_scores_gemma":[0.00059340784,0.00014894616,0.009295052,0.00015491573,0.000012428693,0.0000028905285,0.0037062606,0.00045356952,0.3936389,0.59178334,0.00012391833,0.00008637037],"about_ca_topic_score_codex":0.00006007021,"about_ca_topic_score_gemma":0.000011207563,"teacher_disagreement_score":0.21856678,"about_ca_system_score_codex":0.000014070248,"about_ca_system_score_gemma":0.00012473828,"threshold_uncertainty_score":0.270075},"labels":[],"label_agreement":null},{"id":"W2590970332","doi":"10.3982/te1934","title":"Attaining efficiency with imperfect public monitoring and one-sided Markov adverse selection","year":2017,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Stochastic game; Pairwise comparison; Mathematical economics; Imperfect; Constructive; Private information retrieval; Markov chain; Adverse selection; Folk theorem; Repeated game; Perfect information; Markov process; Computer science; Continuation; Selection (genetic algorithm); Economics; Process (computing); Mathematics; Microeconomics; Game theory; Equilibrium selection; Statistics; Artificial intelligence","score_opus":0.06835838086256651,"score_gpt":0.33864199859931865,"score_spread":0.27028361773675214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590970332","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.96731716,0.000007540001,0.0033644226,0.0017859385,0.00009028133,0.00014832822,0.000004138958,0.00004135904,0.027240803],"genre_scores_gemma":[0.99780715,0.000018460805,0.001822202,0.000035201338,0.00013306156,0.000018999139,7.250586e-7,0.000014095138,0.00015012144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986711,0.000101132486,0.00032247635,0.00045853647,0.00014988502,0.0002968274],"domain_scores_gemma":[0.99765706,0.0011049779,0.00023359929,0.00071354606,0.00009731035,0.00019350837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024506028,0.00013420246,0.000234769,0.00009514606,0.00089980033,0.00061480404,0.00064483477,0.00007424678,0.00031513363],"category_scores_gemma":[0.0019238234,0.00010414703,0.000048570022,0.00009127326,0.0011552641,0.00047194035,0.00019947987,0.00017335765,0.00013744867],"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.000065254724,0.000028699758,0.015581482,0.0000012654564,0.000011064861,4.879548e-7,0.0001442851,0.000069021735,0.00028380053,0.9660931,0.000004304307,0.01771723],"study_design_scores_gemma":[0.0007485701,0.00021083003,0.040708024,0.000024984303,0.00003257606,0.00003235417,0.0008659384,0.011444172,0.0034614294,0.9418618,0.00028102138,0.00032829682],"about_ca_topic_score_codex":0.0000046519795,"about_ca_topic_score_gemma":0.0000064892965,"teacher_disagreement_score":0.030489944,"about_ca_system_score_codex":0.000043431177,"about_ca_system_score_gemma":0.000076669654,"threshold_uncertainty_score":0.69206274},"labels":[],"label_agreement":null},{"id":"W2594652624","doi":"10.1016/j.geb.2017.02.017","title":"Information revelation through bunching","year":2017,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Private information retrieval; Herding; Externality; Microeconomics; Economics; Focus (optics); Bayesian game; Rest (music); Information asymmetry; Information cascade; Mathematical economics; Sequential game; Computer science; Game theory; Psychology; Social psychology","score_opus":0.11907770030287596,"score_gpt":0.3923268641538337,"score_spread":0.27324916385095777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594652624","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.98228854,0.000013247542,0.00216615,0.00079776836,0.00020130101,0.00012145497,0.000017437396,0.000015048821,0.014379064],"genre_scores_gemma":[0.9979952,0.00001630028,0.0006677424,0.0000903811,0.00005230277,0.000029445788,0.0000049295027,0.0000024574636,0.0011412249],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994121,0.00001582509,0.0002938441,0.00011943365,0.00006881085,0.00008996018],"domain_scores_gemma":[0.9990663,0.00007222823,0.00029049127,0.0005105007,0.000023693163,0.00003679668],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064694806,0.000059221828,0.000104302686,0.000034059492,0.00050762086,0.0007277271,0.00030541682,0.000041493942,0.0003542453],"category_scores_gemma":[0.00012674031,0.000048633992,0.00003518847,0.000012497223,0.000081862534,0.0021458,0.00009205072,0.00005258974,0.0010054879],"study_design_candidate":"observational","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.000010158817,0.00001656751,0.10322144,0.0000017703419,0.000004175577,2.5730716e-7,0.0023849322,0.00004102846,0.00014957502,0.10682096,0.0025786024,0.78477055],"study_design_scores_gemma":[0.00023145905,0.000013503291,0.81962436,0.000004943185,0.000015437892,0.0000090540925,0.00079578866,0.00048620545,0.00019627072,0.06523489,0.113266595,0.00012150333],"about_ca_topic_score_codex":0.0000995285,"about_ca_topic_score_gemma":0.000021631817,"teacher_disagreement_score":0.784649,"about_ca_system_score_codex":0.00001642536,"about_ca_system_score_gemma":0.000014461632,"threshold_uncertainty_score":0.99977237},"labels":[],"label_agreement":null},{"id":"W2594916712","doi":"10.1090/stml/080/02","title":"Normal-play games","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.062117703232180896,"score_gpt":0.351095297855194,"score_spread":0.2889775946230131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594916712","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001705113,0.00017243571,0.0018819185,0.002539387,0.00015109136,0.00044435446,0.00016317659,0.0002036973,0.9942734],"genre_scores_gemma":[0.005458119,0.00005099599,0.0010964995,0.00058607676,0.00040924715,0.000049566806,0.0000123973105,0.00007773519,0.9922594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611217,0.00006463092,0.0011287056,0.00071091397,0.0016603725,0.00032322254],"domain_scores_gemma":[0.9948514,0.0029025676,0.00040965946,0.0015007358,0.00005916347,0.00027647422],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007850643,0.00040614186,0.00072278944,0.00023791134,0.00011333406,0.00040730883,0.0021392691,0.0002857778,0.07311891],"category_scores_gemma":[0.00020660313,0.00023569723,0.00039419995,0.00008244437,0.00037766233,0.00056226295,0.00097390165,0.0003196946,0.06675277],"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.000007770034,0.000053332253,0.00001934451,0.000012192279,0.000041147414,0.0000136212075,0.00014954034,1.478811e-7,0.000009980913,0.9325298,0.06068095,0.0064821853],"study_design_scores_gemma":[0.00008604538,0.0000230368,0.000033950873,0.00011066201,0.000022599788,0.000009147293,0.00002817672,0.000001614349,0.00003998918,0.6167212,0.3827222,0.0002013447],"about_ca_topic_score_codex":2.1515186e-8,"about_ca_topic_score_gemma":8.2975454e-8,"teacher_disagreement_score":0.32204127,"about_ca_system_score_codex":0.000013682572,"about_ca_system_score_gemma":0.00006828677,"threshold_uncertainty_score":0.9611454},"labels":[],"label_agreement":null},{"id":"W2599521091","doi":"10.1016/j.econlet.2017.02.028","title":"Conservative vs optimistic rationality in games: A revisitation","year":2017,"lang":"en","type":"article","venue":"Economics Letters","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":"University of Ottawa","funders":"","keywords":"Rationality; Status quo; Mathematical economics; Irrational number; Set (abstract data type); Nash equilibrium; Class (philosophy); Core (optical fiber); Economics; Computer science; Epistemology; Mathematics; Philosophy; Artificial intelligence","score_opus":0.16291507030598507,"score_gpt":0.4034625065800938,"score_spread":0.24054743627410874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599521091","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.9378815,0.0000041880594,0.0045284457,0.052673344,0.00011408748,0.00015168783,0.000021707174,0.000008233711,0.0046167923],"genre_scores_gemma":[0.99374807,0.000004734877,0.0017075212,0.0040218723,0.00006354176,0.000032061078,0.0000072858556,0.0000044528106,0.00041043534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99898916,0.00010079934,0.00040344382,0.00030642533,0.000087356864,0.00011282588],"domain_scores_gemma":[0.9979113,0.0008946513,0.0003734163,0.0007253772,0.000052198844,0.000043094882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018086161,0.000074367395,0.00016473558,0.00007542444,0.00024617635,0.00041031343,0.0006286795,0.000028101977,0.0002262861],"category_scores_gemma":[0.0017848059,0.00007113416,0.000049149465,0.00005016798,0.00019369829,0.0004671021,0.00006267065,0.000100116675,0.00054673967],"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.00022382803,0.00012765104,0.13447611,0.000011603095,0.00004502574,0.000009968608,0.0034562983,0.024928482,0.0033767794,0.78341544,0.03436166,0.015567152],"study_design_scores_gemma":[0.000601475,0.000014007013,0.6898338,0.000016140357,0.0000061151927,0.000002388869,0.0003404562,0.008928845,0.00034213887,0.2798013,0.019891502,0.00022179169],"about_ca_topic_score_codex":0.000037351645,"about_ca_topic_score_gemma":0.000094155046,"teacher_disagreement_score":0.5553577,"about_ca_system_score_codex":0.000058445265,"about_ca_system_score_gemma":0.000046540183,"threshold_uncertainty_score":0.70274144},"labels":[],"label_agreement":null},{"id":"W2600665131","doi":"","title":"A strategic model for network formation","year":2014,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"Brock University; University of Calgary","funders":"","keywords":"Network formation; Pairwise comparison; Nash equilibrium; Outcome (game theory); Computer science; Game theory; Evolving networks; Set (abstract data type); Mathematical economics; Process (computing); Complex network; Economics; Artificial intelligence","score_opus":0.24554931518963996,"score_gpt":0.44096669829480345,"score_spread":0.1954173831051635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600665131","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.57675374,0.00010010935,0.047831595,0.0020045007,0.0006558485,0.0043873466,0.00029830943,0.000112860675,0.36785567],"genre_scores_gemma":[0.98865587,0.0003887419,0.0046471083,0.00011036951,0.00034534783,0.0010356377,0.000071423,0.000030339446,0.0047151684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965664,0.00039094887,0.0010398781,0.0008776341,0.00044841605,0.0006767283],"domain_scores_gemma":[0.9946061,0.0029617222,0.00037406746,0.0015662992,0.0003257944,0.00016601644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012787033,0.00021172172,0.0004758448,0.00037296247,0.00029634358,0.00048872264,0.0016323023,0.00036665943,0.00006580032],"category_scores_gemma":[0.0010952862,0.00019437735,0.00022768506,0.00020393975,0.00021414581,0.000165245,0.0007752768,0.0008768956,0.00007323191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006190498,0.00003647217,0.00004780877,0.000027469594,0.000009873713,2.7302704e-7,0.0002150237,0.84601206,0.000016834441,0.063037105,0.00048702615,0.09004813],"study_design_scores_gemma":[0.00012771093,0.00001678331,0.000035774094,0.00002205695,0.0000019748995,8.52912e-7,0.00020936868,0.5239275,0.000008425508,0.47077805,0.004766138,0.00010534634],"about_ca_topic_score_codex":0.0000042985703,"about_ca_topic_score_gemma":0.00016067416,"teacher_disagreement_score":0.4119021,"about_ca_system_score_codex":0.0002764029,"about_ca_system_score_gemma":0.00042827948,"threshold_uncertainty_score":0.79264784},"labels":[],"label_agreement":null},{"id":"W2603386347","doi":"","title":"Feasibility and individual rationality in two-person Bayesian games","year":2014,"lang":"en","type":"article","venue":"Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine)","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":"Toronto Metropolitan University","funders":"","keywords":"Rationality; Bayesian probability; Mathematical economics; Psychology; Economics; Computer science; Cognitive psychology; Artificial intelligence; Epistemology; Philosophy","score_opus":0.252855906305602,"score_gpt":0.370992661409177,"score_spread":0.11813675510357502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603386347","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.78811044,0.00020364525,0.19390942,0.007032838,0.00014405188,0.0007372052,0.00014544756,0.00045447637,0.009262452],"genre_scores_gemma":[0.9758794,0.00029728687,0.021729298,0.0005278251,0.00016413466,0.0000073743977,0.00006170497,0.000046883786,0.0012861079],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9911348,0.0044050855,0.0007309019,0.0016376185,0.0011341032,0.0009574533],"domain_scores_gemma":[0.9928751,0.0037635164,0.00056302035,0.001466333,0.0004951981,0.00083685445],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015392375,0.0006130477,0.0008791061,0.0010452352,0.0013745166,0.00029050437,0.0017617856,0.00076296483,0.00094386167],"category_scores_gemma":[0.003344907,0.0006765596,0.00035567064,0.0030531879,0.0009880651,0.0016535688,0.00060995785,0.0019220578,0.0003233135],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011881121,0.00126226,0.7163992,0.000085346524,0.00020321095,0.00026040908,0.012254257,0.01210775,0.0023553444,0.21930552,0.00957969,0.024998907],"study_design_scores_gemma":[0.009573372,0.00022266169,0.7181195,0.00014633963,0.00039523,0.0002123701,0.025898501,0.081187084,0.0008600305,0.13422701,0.027386151,0.0017717527],"about_ca_topic_score_codex":0.007624498,"about_ca_topic_score_gemma":0.010076803,"teacher_disagreement_score":0.18776892,"about_ca_system_score_codex":0.0019394179,"about_ca_system_score_gemma":0.0009752032,"threshold_uncertainty_score":0.9999694},"labels":[],"label_agreement":null},{"id":"W2604384918","doi":"10.1609/aaai.v31i1.10618","title":"Resource Graph Games: A Compact Representation for Games with Structured Strategy Spaces","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multilinear map; Computer science; Leverage (statistics); Theoretical computer science; Common value auction; Representation (politics); Graph; Key (lock); Range (aeronautics); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.2702547147049079,"score_gpt":0.4295086686081825,"score_spread":0.15925395390327457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604384918","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.96052766,0.000013215773,0.00595635,0.0074944543,0.000121205754,0.0010476621,0.000048822603,0.00004740595,0.024743203],"genre_scores_gemma":[0.9979891,0.0000067283077,0.00052011426,0.00006978244,0.00007553688,0.000047667418,0.0000012617083,0.000013457153,0.0012763432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997605,0.000032497188,0.00061461754,0.00062326377,0.00083207054,0.00029254527],"domain_scores_gemma":[0.99613875,0.00053146016,0.0012861941,0.00080735836,0.001133438,0.00010277748],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012515715,0.00021953823,0.0003529519,0.00014850745,0.0008346699,0.0013298049,0.0026620422,0.00008145538,0.00014495284],"category_scores_gemma":[0.0026909413,0.00012873019,0.00015563586,0.00039885897,0.0010368271,0.00048989896,0.00012936143,0.00020373386,0.0000361251],"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.0006940257,0.00009353506,0.0019956362,0.000015836447,0.00002845398,1.8516764e-7,0.0015949083,0.00053905783,0.026363375,0.9146495,0.001126672,0.052898824],"study_design_scores_gemma":[0.00005660271,0.00023625343,0.004585047,0.000096755466,0.000024681576,0.0000032200817,0.007833352,0.00327162,0.26382712,0.7193102,0.00058980193,0.00016532079],"about_ca_topic_score_codex":0.000057835205,"about_ca_topic_score_gemma":0.00006664492,"teacher_disagreement_score":0.23746374,"about_ca_system_score_codex":0.000016080403,"about_ca_system_score_gemma":0.000078687466,"threshold_uncertainty_score":0.9997069},"labels":[],"label_agreement":null},{"id":"W2607705686","doi":"10.1109/tsmc.2017.2690619","title":"First-Level Hypergame for Investigating Misperception in Conflicts","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Construct (python library); Conflict resolution; Computer science; Graph; Operations research; Political science; Management science; Theoretical computer science; Economics; Mathematics; Law","score_opus":0.23247633206243074,"score_gpt":0.3731402562381766,"score_spread":0.14066392417574586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607705686","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.70732665,0.00019223834,0.2832564,0.000618947,0.0020792522,0.001975543,0.00024407811,0.00007829518,0.0042285784],"genre_scores_gemma":[0.9873015,0.000032440388,0.00017900001,0.000044962915,0.00014492121,0.00048629026,0.0000021566436,0.000027675427,0.011781018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973856,0.00019726189,0.00091012544,0.00061200926,0.00057274033,0.00032223403],"domain_scores_gemma":[0.99717766,0.0008295763,0.00048094444,0.0010848714,0.00022173442,0.00020518887],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020640783,0.00024035027,0.0004699597,0.00025515127,0.0009780829,0.0011334601,0.00065801834,0.00019466583,0.000016727383],"category_scores_gemma":[0.00015345344,0.00020639203,0.000106889114,0.00016237424,0.00025712053,0.00025944805,0.0000053105105,0.00020086298,0.0001627228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006995975,0.0021314179,0.017145313,0.0026084105,0.00056325784,0.000043497297,0.049981456,0.49889123,0.047162067,0.2842798,0.008389058,0.08810492],"study_design_scores_gemma":[0.009526278,0.0010982814,0.050769687,0.0034301148,0.0002578974,0.0003923018,0.029297508,0.70602065,0.00422031,0.01910192,0.17294717,0.002937916],"about_ca_topic_score_codex":0.00092313555,"about_ca_topic_score_gemma":0.00067534886,"teacher_disagreement_score":0.28307742,"about_ca_system_score_codex":0.000062853636,"about_ca_system_score_gemma":0.000032551485,"threshold_uncertainty_score":0.99990344},"labels":[],"label_agreement":null},{"id":"W2607895357","doi":"10.1109/tsmc.2017.2689004","title":"Behavioral Analysis in the Graph Model for Conflict Resolution","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Nanjing University of Aeronautics and Astronautics; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Graph; Representation (politics); Matrix representation; Conflict resolution; Stability (learning theory); Nash equilibrium; Computer science; Matrix (chemical analysis); Mathematical economics; Mathematics; Mathematical optimization; Theoretical computer science; Machine learning; Group (periodic table); Political science; Law","score_opus":0.18678086726965476,"score_gpt":0.39625337849263653,"score_spread":0.20947251122298177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607895357","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.23126838,0.0001734777,0.7652018,0.00021610245,0.00046061707,0.0011565933,0.00022008101,0.00002814413,0.0012747837],"genre_scores_gemma":[0.9932277,0.00003021246,0.00005435937,0.000026075497,0.00005454433,0.00059835176,0.0000036896229,0.000012967419,0.005992064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746764,0.00033290917,0.00075390766,0.00050455355,0.0006717926,0.00026918793],"domain_scores_gemma":[0.9973121,0.0005057008,0.00041034396,0.001486274,0.00018854471,0.0000970013],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031036905,0.00019144577,0.00043560588,0.0004459897,0.0010147721,0.0011892953,0.00091849617,0.00014378072,0.0000049434984],"category_scores_gemma":[0.00002315549,0.00013099579,0.00023934527,0.00043241784,0.0002155948,0.00018241335,0.0000033186998,0.00018142715,0.000027093329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001639069,0.000579058,0.001097365,0.000062716404,0.0002704214,0.000005073228,0.0077799107,0.9143363,0.00050541543,0.06863227,0.0012902176,0.0052773403],"study_design_scores_gemma":[0.0007024181,0.0001255054,0.0018858205,0.000049223167,0.0004179158,0.000018757077,0.0062100193,0.98444647,0.000049163536,0.0021855105,0.0036383453,0.00027086784],"about_ca_topic_score_codex":0.00091831223,"about_ca_topic_score_gemma":0.0010827632,"teacher_disagreement_score":0.76514745,"about_ca_system_score_codex":0.000032191805,"about_ca_system_score_gemma":0.000024836103,"threshold_uncertainty_score":0.9998476},"labels":[],"label_agreement":null},{"id":"W2610957984","doi":"","title":"Generalized Satisfaction Equilibrium: A Model for Service-Level Provisioning in Networks","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Provisioning; Generalization; Computer science; Bayesian game; Service (business); Set (abstract data type); Mathematical optimization; Relevance (law); Game theory; Theoretical computer science; Distributed computing; Sequential game; Mathematical economics; Mathematics; Computer network","score_opus":0.08979335449816221,"score_gpt":0.3265648784940908,"score_spread":0.2367715239959286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610957984","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.18920043,0.00021454848,0.7878988,0.014910337,0.00019190271,0.0011601106,0.00020618497,0.00014480943,0.0060728793],"genre_scores_gemma":[0.91389805,0.00008322831,0.072957054,0.00026175356,0.000051287654,0.0006828926,0.00021222359,0.000058908503,0.011794585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916443,0.004303904,0.0012998395,0.0014035745,0.00081352965,0.0005348077],"domain_scores_gemma":[0.986566,0.0056484267,0.0010282113,0.0031108872,0.00342863,0.0002178265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.017136056,0.00040754626,0.00061007764,0.00042587036,0.00032282228,0.0007519697,0.0021802178,0.00046415185,0.00012908052],"category_scores_gemma":[0.0041131424,0.0003467161,0.00030288522,0.00081465306,0.00016627525,0.00034261183,0.0017098682,0.000563945,0.000069435584],"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.00016891585,0.0005213863,0.0044659185,0.00012757622,0.00007842929,0.000001716077,0.011804213,0.08696471,0.010749538,0.61902183,0.0038317158,0.26226404],"study_design_scores_gemma":[0.0006621145,2.1825986e-7,0.00237648,0.000627213,0.00001802797,0.0000021538663,0.000060811042,0.6722185,0.0018772894,0.32083836,0.0009995218,0.00031931725],"about_ca_topic_score_codex":0.00043382304,"about_ca_topic_score_gemma":0.0043134326,"teacher_disagreement_score":0.72469765,"about_ca_system_score_codex":0.00016916293,"about_ca_system_score_gemma":0.00044865394,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W2611291372","doi":"10.1145/1993574.1993593","title":"Polynomial-time computation of exact correlated equilibrium in compact games","year":2011,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computation; Ellipsoid; Time complexity; Polynomial; Computer science; Applied mathematics; Ellipsoid method; Mathematical optimization; Mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.12545034078795375,"score_gpt":0.3607398527758049,"score_spread":0.23528951198785114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611291372","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.8903062,0.000020753227,0.0017822281,0.00011635852,0.000053991676,0.0001376812,0.0000054124253,0.00003335813,0.10754401],"genre_scores_gemma":[0.99654317,6.2362466e-7,0.0005390788,0.000037391408,0.000008296439,0.0000018531072,0.0000026900202,0.0000051846646,0.0028617173],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9986287,0.00016659482,0.0005549846,0.00021981791,0.000292041,0.0001378914],"domain_scores_gemma":[0.99874884,0.0005906801,0.00019990525,0.0002968585,0.00010301457,0.00006071889],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001156555,0.00008161198,0.00022963514,0.0002292369,0.000021700474,0.000024470435,0.00036939152,0.000051832052,0.00299669],"category_scores_gemma":[0.0002565996,0.00006035258,0.0000614145,0.00069374486,0.00012610089,0.00020831458,0.000043974018,0.000071815375,0.001320022],"study_design_candidate":"observational","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.0018674366,0.0040455507,0.20260756,0.000033822478,0.000150842,0.000025383131,0.029514318,0.019723943,0.35643685,0.038112562,0.21286376,0.13461798],"study_design_scores_gemma":[0.0017454238,0.00031959213,0.72541493,0.000059806825,0.00002395184,0.000016794787,0.0021640596,0.11212936,0.07494235,0.08050743,0.0021980095,0.0004783198],"about_ca_topic_score_codex":0.0001348885,"about_ca_topic_score_gemma":0.000010176432,"teacher_disagreement_score":0.52280736,"about_ca_system_score_codex":0.000011902847,"about_ca_system_score_gemma":0.000033919092,"threshold_uncertainty_score":0.99945754},"labels":[],"label_agreement":null},{"id":"W2618717009","doi":"10.1145/2344422.2344426","title":"The effectiveness of stackelberg strategies and tolls for network congestion games","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Price of anarchy; Nash equilibrium; Latency (audio); Computer science; Routing (electronic design automation); Mathematical optimization; Fraction (chemistry); Flow network; Mathematics; Mathematical economics; Price of stability; Computer network; Economics","score_opus":0.06770159463362163,"score_gpt":0.3755214159717994,"score_spread":0.30781982133817776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618717009","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.14882858,0.0005096503,0.84849226,0.00044921908,0.0004905565,0.0006454312,0.000058048212,0.000034378983,0.0004918519],"genre_scores_gemma":[0.99406207,0.00006997499,0.0052912817,0.000018756313,0.00007448275,0.00021828395,0.000001908082,0.000008602796,0.00025464033],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986433,0.00037381361,0.00028501678,0.00019350005,0.0002706656,0.00023374878],"domain_scores_gemma":[0.98602766,0.013089204,0.000105486164,0.00053809985,0.00016524602,0.00007430511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988065,0.000104885876,0.00017551806,0.000052722182,0.00046698484,0.0001361996,0.0003473328,0.000060644576,0.000029562661],"category_scores_gemma":[0.0003728335,0.00006603134,0.00008452478,0.00034331775,0.00024183326,0.00039946128,0.000007088428,0.00009792005,0.000017478207],"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.00046726863,0.0002198351,0.00032616543,0.0000229368,0.000089299596,1.0209067e-7,0.0004789812,0.007854429,0.0010333806,0.16280426,0.00016850827,0.8265348],"study_design_scores_gemma":[0.0010157978,0.0003973406,0.07438804,0.00006233516,0.0001100858,0.000013054836,0.0049439175,0.001428712,0.013370911,0.8843587,0.019623669,0.0002874198],"about_ca_topic_score_codex":0.0000091653055,"about_ca_topic_score_gemma":0.000012975606,"teacher_disagreement_score":0.8452335,"about_ca_system_score_codex":0.0000127167905,"about_ca_system_score_gemma":0.000032788485,"threshold_uncertainty_score":0.35917172},"labels":[],"label_agreement":null},{"id":"W2619822963","doi":"10.1016/j.ifacol.2017.08.1449","title":"Static teams with common information","year":2017,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","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":"McGill University","funders":"","keywords":"Affine transformation; Mathematical optimization; Information structure; Computer science; Quadratic equation; Gaussian; Common knowledge (logic); Mathematics; Artificial intelligence","score_opus":0.06022542335187727,"score_gpt":0.3999059872325354,"score_spread":0.33968056388065815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619822963","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.9437688,0.000008853545,0.0064684786,0.010710003,0.00010662423,0.00027128446,0.000095409996,0.00006836693,0.038502183],"genre_scores_gemma":[0.9559346,0.0000041706676,0.04051126,0.00085349573,0.00006301266,0.000021072274,0.000030111145,0.0000064112573,0.0025758827],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986093,0.00005184517,0.00034761633,0.00018445445,0.00062174344,0.0001850298],"domain_scores_gemma":[0.9978525,0.00032218263,0.00039360728,0.0011598321,0.00016606468,0.000105786705],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090901274,0.00011746585,0.00019099556,0.00008057033,0.0006801857,0.0005752561,0.0009711062,0.000045392888,0.00043937704],"category_scores_gemma":[0.0006629709,0.00007398269,0.00004616311,0.0001407641,0.00022460963,0.0012374144,0.00009575416,0.00013186477,0.0018689741],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033294602,0.0003186475,0.03460161,0.000022765906,0.00006651024,0.000013309319,0.006817283,0.0010041568,0.001814739,0.06582154,0.00096912024,0.8882174],"study_design_scores_gemma":[0.0055124904,0.0009781738,0.4291486,0.00017821118,0.00014449745,0.00012414994,0.020825652,0.033841997,0.00423581,0.17885233,0.3245468,0.001611247],"about_ca_topic_score_codex":0.0000697552,"about_ca_topic_score_gemma":0.00017708557,"teacher_disagreement_score":0.8866061,"about_ca_system_score_codex":0.000019231442,"about_ca_system_score_gemma":0.000050521932,"threshold_uncertainty_score":0.99890816},"labels":[],"label_agreement":null},{"id":"W2619903152","doi":"","title":"Evolutionary Game Theory 2000: Special issue of International Game Theory Review","year":2003,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Game theory; Mathematical economics; Evolutionary game theory; Economics; Positive political theory; Computer science","score_opus":0.058462116642595055,"score_gpt":0.3237005235993043,"score_spread":0.26523840695670925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619903152","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3399481,0.003432857,0.004876541,0.0012166512,0.0003060851,0.0014151449,0.0037629148,0.000059068287,0.64498264],"genre_scores_gemma":[0.80763274,0.0015948542,0.0011980041,0.000060791954,0.0002143018,4.8043194e-7,0.00005149418,0.00003996767,0.18920735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99223936,0.0026879753,0.0006589176,0.00084952434,0.002973513,0.0005907307],"domain_scores_gemma":[0.9931494,0.0021664149,0.0009678454,0.0013066215,0.0020470852,0.00036264962],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010947103,0.00030975934,0.00081669044,0.0009931353,0.0004521815,0.000028756156,0.0032922053,0.00027832255,0.1450485],"category_scores_gemma":[0.0019255219,0.0003411368,0.00065349124,0.0018007695,0.0032411234,0.00037062564,0.0007211845,0.00065979536,0.0071186605],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010729641,0.0050054532,0.051805392,0.0014185545,0.003132541,0.0011501578,0.12715833,0.00042346146,0.004370033,0.4190788,0.25349677,0.12223089],"study_design_scores_gemma":[0.0023561507,0.000255419,0.003159127,0.00088256644,0.000280363,0.000056153745,0.49742615,0.000104992694,0.00019029393,0.16151062,0.33308133,0.0006968518],"about_ca_topic_score_codex":0.00025335382,"about_ca_topic_score_gemma":0.00018917536,"teacher_disagreement_score":0.4676847,"about_ca_system_score_codex":0.000121269506,"about_ca_system_score_gemma":0.0006762096,"threshold_uncertainty_score":0.99990404},"labels":[],"label_agreement":null},{"id":"W2624754555","doi":"","title":"An Empirical Evaluation of Fair-Division Algorithms","year":2009,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Fair division; Division (mathematics); Economic Justice; Algorithm; Empirical research; Genetic algorithm; Computer science; Mathematics; Mathematical economics; Artificial intelligence; Operations research; Arithmetic; Law; Political science; Machine learning; Statistics","score_opus":0.10759653446749334,"score_gpt":0.38896040232588835,"score_spread":0.281363867858395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624754555","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.96251136,0.00008183355,0.005899759,0.0015512832,0.00006600431,0.00037008026,0.0009123044,0.00018237921,0.028425012],"genre_scores_gemma":[0.9969853,0.0000015577889,0.0017445837,0.00054681825,0.000090004716,0.000012834124,0.00027848556,0.000019910221,0.00032046813],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525505,0.0005201955,0.00089675817,0.0006520713,0.0023688811,0.00030701613],"domain_scores_gemma":[0.99741954,0.00054372376,0.00030425782,0.0010587528,0.00033171178,0.00034202388],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0032892728,0.00021904452,0.000319332,0.00030040176,0.00016301355,0.0012331704,0.0012593166,0.00015022747,0.0017361232],"category_scores_gemma":[0.0018708906,0.00016657141,0.0001929157,0.0013364467,0.00013168389,0.005515881,0.00011071268,0.00026987965,0.0029031173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009575524,0.001006291,0.06568897,0.0000030238168,0.000013333029,0.0000032275875,0.00012079122,0.00036391034,0.0018881982,0.010133283,0.004527708,0.9161555],"study_design_scores_gemma":[0.000595259,0.0003669674,0.112865224,0.000022293425,0.000024524154,0.0000057647653,0.00015123382,0.008942882,0.00689649,0.8347374,0.035084225,0.00030774463],"about_ca_topic_score_codex":3.310355e-7,"about_ca_topic_score_gemma":1.7891037e-7,"teacher_disagreement_score":0.9158478,"about_ca_system_score_codex":0.000022742573,"about_ca_system_score_gemma":0.00015512732,"threshold_uncertainty_score":0.99980366},"labels":[],"label_agreement":null},{"id":"W2625881458","doi":"10.1007/s11518-017-5351-7","title":"Analyzing market competition between Airbus and Boeing using a duo hierarchical graph model for conflict resolution","year":2017,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":23,"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; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Graph; Competition (biology); Operations research; Resolution (logic); Computer science; Industrial organization; Engineering; Business; Artificial intelligence; Theoretical computer science","score_opus":0.1383296318253618,"score_gpt":0.3670021812419475,"score_spread":0.2286725494165857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625881458","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.5295495,0.00045757586,0.46930954,0.00007826607,0.000307201,0.00019295284,0.000010615475,0.000007892998,0.000086473796],"genre_scores_gemma":[0.9976843,0.000023692959,0.0018783127,0.000002787085,0.00032192614,0.0000074132013,1.9505391e-7,0.000008373322,0.00007300218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975511,0.000071799244,0.00091090566,0.000289902,0.00088955305,0.00028676164],"domain_scores_gemma":[0.9971634,0.000591959,0.00088978186,0.00036228017,0.00074640266,0.00024618488],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013689308,0.0001334367,0.00048035276,0.0006233036,0.0011603159,0.0015846606,0.0006229637,0.00006907817,4.7798073e-7],"category_scores_gemma":[0.0017828502,0.00010210456,0.00007341356,0.00031175607,0.00029829718,0.0012523334,0.00010000779,0.00016971992,3.9627835e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079168065,0.000035394896,0.027515795,0.0004885196,0.00010922834,0.000015122463,0.00235834,0.75354356,0.11729216,0.09552646,0.00022182913,0.0028144394],"study_design_scores_gemma":[0.00027390762,0.00004133306,0.007099797,0.00045488923,0.000029056784,0.00019752745,0.0004605413,0.99019283,0.00005036533,0.00066065585,0.00041868468,0.00012038895],"about_ca_topic_score_codex":0.000033174787,"about_ca_topic_score_gemma":0.0000011916952,"teacher_disagreement_score":0.46813482,"about_ca_system_score_codex":0.000076380915,"about_ca_system_score_gemma":0.000117014344,"threshold_uncertainty_score":0.9994518},"labels":[],"label_agreement":null},{"id":"W2690475796","doi":"","title":"Essays in Political Economy and the Economics of Organisations","year":2011,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; University of Toronto","keywords":"Politics; Political science; Economics; Political economy; Neoclassical economics; Economy; Law","score_opus":0.040316136981640015,"score_gpt":0.299314530481885,"score_spread":0.258998393500245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2690475796","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40061796,0.00009547661,0.00010158393,0.000724571,0.00004019316,0.00016023891,0.000021689413,0.0000044550675,0.5982338],"genre_scores_gemma":[0.98998415,0.00006589871,0.000260305,0.000015628102,0.000009415589,7.915692e-7,0.000014898604,0.000004858796,0.009644036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928534,0.00010797645,0.00019580203,0.00021363114,0.00008603096,0.00011119106],"domain_scores_gemma":[0.9985429,0.00056298054,0.00033684296,0.00038075075,0.00011967535,0.000056848665],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006539029,0.00008858094,0.00032687886,0.00006708513,0.000094619296,0.000013595346,0.0005469984,0.00011966112,0.008301034],"category_scores_gemma":[0.00009283513,0.00008017024,0.00008529145,0.000059845606,0.00034795917,0.00023396208,0.00006415995,0.00008846046,0.000022610135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011187974,0.000028224464,0.00026822544,0.000008703958,0.000016812972,1.9120259e-7,0.015064326,0.0000019354768,0.000012162904,0.9801803,0.00007196072,0.0042352783],"study_design_scores_gemma":[0.0012709923,0.000044858807,0.1697693,0.000027715027,0.00010195564,0.000001489972,0.2555768,0.0002607307,0.00013252975,0.5706463,0.0019721854,0.00019514089],"about_ca_topic_score_codex":0.031560704,"about_ca_topic_score_gemma":0.10296449,"teacher_disagreement_score":0.5893662,"about_ca_system_score_codex":0.000063396124,"about_ca_system_score_gemma":0.00012728418,"threshold_uncertainty_score":0.9926055},"labels":[],"label_agreement":null},{"id":"W2726989136","doi":"10.1007/978-3-319-63004-5_6","title":"A Deterministic Actor-Critic Approach to Stochastic Reinforcements","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Reinforcement learning; Variance (accounting); Function (biology); Computer science; Reinforcement; Artificial intelligence; Temporal difference learning; Mathematical optimization; Mathematics; Psychology; Economics; Social psychology","score_opus":0.10029967253347143,"score_gpt":0.3690955365600705,"score_spread":0.26879586402659905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726989136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021479565,0.0000297471,0.9557107,0.00022732218,0.00079250504,0.0006491864,0.000020443547,0.00004540493,0.042309877],"genre_scores_gemma":[0.95387775,0.0000011935201,0.037674695,0.0010551278,0.00039061633,0.00004268268,0.0000053735544,0.000029553034,0.0069230213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494046,0.000040322335,0.0007539953,0.001652643,0.0020027352,0.0006098652],"domain_scores_gemma":[0.99446386,0.0015761948,0.00040718075,0.0028253796,0.00037993214,0.00034743588],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024312357,0.00044887618,0.00060818397,0.0009462024,0.00068163953,0.0012673998,0.0055977292,0.0002268051,0.00011101855],"category_scores_gemma":[0.0024358297,0.0003583283,0.00014337816,0.00033697515,0.0011977123,0.00032921764,0.0012473692,0.0005548595,0.0008155481],"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.000030365167,0.000059653885,0.000012334007,0.000023145105,0.0000124608005,0.000023907383,0.0016143735,0.11907037,0.00018001281,0.06672387,0.00012054769,0.81212896],"study_design_scores_gemma":[0.00023694328,0.00016791909,0.00015309587,0.00025569584,0.000021117672,0.00006135381,0.0000013617918,0.1608779,0.00010928442,0.83317107,0.0042082337,0.0007360302],"about_ca_topic_score_codex":0.000006976353,"about_ca_topic_score_gemma":0.000015271491,"teacher_disagreement_score":0.95366293,"about_ca_system_score_codex":0.00015450045,"about_ca_system_score_gemma":0.0003994204,"threshold_uncertainty_score":0.99996245},"labels":[],"label_agreement":null},{"id":"W2747466735","doi":"","title":"Knowledge Accumulation within an Organization","year":2012,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Knowledge management; Business; Computer science","score_opus":0.31862659297707924,"score_gpt":0.4804959849248018,"score_spread":0.16186939194772254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747466735","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.881728,0.000011096659,0.08748841,0.00014865251,0.00017242903,0.000081779624,0.0000010109164,0.00008842566,0.03028021],"genre_scores_gemma":[0.9917968,2.359144e-7,0.0017875817,0.000100927966,0.00014891414,0.000003200133,0.000009481628,0.00000595259,0.0061469274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99919885,0.000121429,0.0002238573,0.00013531305,0.000216079,0.00010446995],"domain_scores_gemma":[0.99899024,0.00023337024,0.000073173964,0.00035778192,0.00023987221,0.0001055693],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017256802,0.000048577913,0.000060096525,0.000076365286,0.00014160229,0.000092475646,0.00025042662,0.000036924946,0.0029620295],"category_scores_gemma":[0.00080759387,0.00003363953,0.0000129473765,0.0008862066,0.000026504105,0.0008951987,0.000038784947,0.00003496022,0.0054456447],"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.0000033973315,0.00022482919,0.08885562,5.6118375e-7,0.0000023692273,2.4085415e-8,0.0071357666,0.00023197543,0.007090791,0.87489873,0.0025832911,0.018972628],"study_design_scores_gemma":[0.00028131285,0.000039082835,0.67677426,0.000002751564,0.000015083567,0.000009351692,0.0036475048,0.007935152,0.043892328,0.23945746,0.027637634,0.00030804233],"about_ca_topic_score_codex":0.0000032356836,"about_ca_topic_score_gemma":0.000012650652,"teacher_disagreement_score":0.6354413,"about_ca_system_score_codex":0.00001066904,"about_ca_system_score_gemma":0.00001680654,"threshold_uncertainty_score":0.9979494},"labels":[],"label_agreement":null},{"id":"W2752523716","doi":"10.1007/978-3-319-67810-8_4","title":"Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Duopoly; Quality (philosophy); Computer science; Market segmentation; Product differentiation; Product (mathematics); Variance (accounting); Microeconomics; Marketing; Industrial organization; Business; Economics; Mathematics","score_opus":0.17459267778383067,"score_gpt":0.3713541399553001,"score_spread":0.19676146217146942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752523716","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.035890944,0.0005333797,0.95132273,0.00034021048,0.00095714367,0.00067094725,0.000042737054,0.000031686715,0.0102102375],"genre_scores_gemma":[0.99459964,0.000044927263,0.004604243,0.00017020738,0.00016645559,0.000012535656,0.000008127601,0.00001125308,0.0003826319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956471,0.00020128815,0.0010850524,0.0011528098,0.0014701629,0.0004436188],"domain_scores_gemma":[0.9933207,0.0033589413,0.0010939755,0.0017346607,0.0003901115,0.00010163458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004482452,0.0003336858,0.00075098226,0.0004889117,0.00030336148,0.00034176727,0.0029036028,0.00027717932,0.00017804853],"category_scores_gemma":[0.00070935796,0.00025044876,0.0001397763,0.00037169602,0.0016503059,0.00025129283,0.00059818896,0.00052919093,0.00004919298],"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.000060808026,0.00010144501,0.005840925,0.000027664457,0.000021539896,0.0000071958416,0.0014244071,0.25631216,0.0004731305,0.11098879,0.000026141766,0.6247158],"study_design_scores_gemma":[0.00021166948,0.00004809663,0.010841359,0.00017887984,0.000008886894,0.000005761011,0.0000018538389,0.011036276,0.00027362476,0.9767379,0.0003665615,0.00028913218],"about_ca_topic_score_codex":0.00016878579,"about_ca_topic_score_gemma":0.002376129,"teacher_disagreement_score":0.9587087,"about_ca_system_score_codex":0.000114602655,"about_ca_system_score_gemma":0.00043585402,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W2759362947","doi":"10.2139/ssrn.3035565","title":"Extended Proper Equilibrium","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Kellogg's (Canada)","funders":"","keywords":"Mathematical economics; Economics","score_opus":0.07245494149778611,"score_gpt":0.39033504614446946,"score_spread":0.31788010464668337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759362947","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.91104263,0.000642672,0.015117962,0.010480461,0.0004077223,0.00018801248,0.0000029204741,0.000041047366,0.062076587],"genre_scores_gemma":[0.956671,0.00010438974,0.000090777285,0.00008606731,0.00033253815,0.0000063484613,2.8982515e-7,0.000010551027,0.04269805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711156,0.00013140499,0.00036331103,0.00026936887,0.00066339487,0.0014609863],"domain_scores_gemma":[0.99810404,0.00012638525,0.00040674297,0.001037891,0.00021079407,0.000114168804],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007926858,0.00010716596,0.00016496553,0.00008849449,0.001011082,0.00083435554,0.0021898623,0.000050699826,0.00035445832],"category_scores_gemma":[0.0014677898,0.00006881033,0.0001352647,0.00010173568,0.00018122442,0.00063702755,0.00016604488,0.0010503203,0.0013789202],"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.000041429008,0.000058036094,0.0010838727,3.5772428e-7,0.000030559422,0.0000026944138,0.00009575223,0.000008423407,0.0040981933,0.8403478,0.0008202224,0.15341264],"study_design_scores_gemma":[0.00026418577,0.00008500521,0.0047376533,0.0000034289706,0.000009108815,0.00028452816,0.0005869208,0.00007899727,0.00059076195,0.9724312,0.02082931,0.000098935496],"about_ca_topic_score_codex":0.000008236127,"about_ca_topic_score_gemma":0.0000772993,"teacher_disagreement_score":0.1533137,"about_ca_system_score_codex":0.00013874294,"about_ca_system_score_gemma":0.0010922785,"threshold_uncertainty_score":0.99939865},"labels":[],"label_agreement":null},{"id":"W2766724300","doi":"10.1016/j.ifacol.2017.08.1326","title":"On Synchronous Binary Log-Linear Learning and Second Order Q-learning","year":2017,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary number; Computer science; Focus (optics); Artificial intelligence; Algorithm; Log-linear model; Q-learning; Binary search algorithm; Binary classification; Order (exchange); Mathematics; Machine learning; Linear model; Search algorithm; Reinforcement learning; Arithmetic","score_opus":0.05183597797220337,"score_gpt":0.38172926138962043,"score_spread":0.3298932834174171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766724300","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.9769777,0.00013473311,0.00078828784,0.0021977143,0.0001439013,0.00015697615,0.000016646718,0.00008798041,0.019496057],"genre_scores_gemma":[0.945557,0.000027708185,0.016837886,0.0002839854,0.00021389677,0.000012671208,0.000013608457,0.000024129671,0.037029095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802274,0.00019377482,0.00035333057,0.00063026504,0.00047743204,0.00032247556],"domain_scores_gemma":[0.99742854,0.0011824623,0.00035190358,0.0007002267,0.00016512515,0.00017171694],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001461659,0.00020993444,0.00030985966,0.0001305988,0.001692007,0.00036862906,0.00068568095,0.00012096105,0.0028749641],"category_scores_gemma":[0.0039222194,0.00016252587,0.00007802414,0.00018135217,0.00033742652,0.00028758857,0.00026048665,0.0005797062,0.0013823706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008314922,0.0010987335,0.065243,0.00008129235,0.00024883208,0.00028644552,0.007935498,0.021718644,0.095311284,0.036666613,0.000595017,0.7699832],"study_design_scores_gemma":[0.007824146,0.004034689,0.17588048,0.00039836508,0.0002046733,0.00034110792,0.016774673,0.2285293,0.0054360074,0.06515373,0.49193266,0.0034901781],"about_ca_topic_score_codex":0.000015279104,"about_ca_topic_score_gemma":0.00003460554,"teacher_disagreement_score":0.76649296,"about_ca_system_score_codex":0.000020219939,"about_ca_system_score_gemma":0.000049656548,"threshold_uncertainty_score":0.9996077},"labels":[],"label_agreement":null},{"id":"W2776102123","doi":"10.1007/s10700-017-9279-7","title":"Interval fuzzy preferences in the graph model for conflict resolution","year":2017,"lang":"en","type":"article","venue":"Fuzzy Optimization and Decision Making","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Centre for International Governance Innovation; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Central Florida","keywords":"Fuzzy logic; Mathematics; Interval (graph theory); Fuzzy number; Fuzzy set; Preference; Defuzzification; Stability (learning theory); Fuzzy set operations; Mathematical optimization; Artificial intelligence; Computer science; Statistics; Combinatorics; Machine learning","score_opus":0.19699951962371387,"score_gpt":0.4254552836346813,"score_spread":0.22845576401096745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776102123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050103743,0.000096441705,0.93960094,0.00073277164,0.00013551484,0.0004901843,0.00002378988,0.000022523749,0.008794093],"genre_scores_gemma":[0.91621876,0.000054803757,0.0830204,0.00035616418,0.000049769857,0.000083731844,0.0000060706498,0.000007762128,0.00020255223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807644,0.00012508963,0.00056405173,0.00045718133,0.00057819264,0.00019905911],"domain_scores_gemma":[0.99670935,0.0017341786,0.00039836793,0.00085955183,0.0002495122,0.000049037088],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0036798296,0.00013379897,0.00020777353,0.00025030994,0.0011081704,0.0012060533,0.001105119,0.00009547223,0.00003861673],"category_scores_gemma":[0.0027410116,0.00008471238,0.000086396154,0.0002510755,0.00017934108,0.000575084,0.00017562596,0.0001200597,0.000015125505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020980347,0.000054587796,0.0011797559,0.0000034164523,0.0000044893777,6.5625227e-7,0.0016414316,0.7497329,0.000013159575,0.12402015,0.0024586683,0.12068097],"study_design_scores_gemma":[0.00030497188,0.000020956393,0.002751621,0.00003279429,0.0000054185048,0.0000025976076,0.000421965,0.5775076,0.0000021502078,0.41830978,0.00056624116,0.00007387139],"about_ca_topic_score_codex":0.0000050804347,"about_ca_topic_score_gemma":0.00007354879,"teacher_disagreement_score":0.86611503,"about_ca_system_score_codex":0.000011960691,"about_ca_system_score_gemma":0.000030770603,"threshold_uncertainty_score":0.9998308},"labels":[],"label_agreement":null},{"id":"W2777241338","doi":"10.3178/hrl.11.194","title":"Water pricing conflict in British Columbia","year":2017,"lang":"en","type":"article","venue":"Hydrological Research Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Government (linguistics); Conflict resolution; Sustainability; Order (exchange); Conflict analysis; Commodification; Political science; Business; Environmental economics; Economics; Law; Economy; Finance","score_opus":0.3119408241995651,"score_gpt":0.4695521548736853,"score_spread":0.1576113306741202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777241338","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.9670386,0.0000114231825,0.00011326302,0.025593458,0.000044461893,0.0002753412,0.0000040585296,0.000023002096,0.006896399],"genre_scores_gemma":[0.99535406,0.000010101404,0.0000653214,0.0017029934,0.000076108976,0.000081108716,0.0000019336019,0.0000060969196,0.0027023086],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9962173,0.0007199471,0.00036901975,0.000605475,0.0013370164,0.0007512385],"domain_scores_gemma":[0.9969097,0.0016304448,0.000061196304,0.001092466,0.00013196186,0.00017423539],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.012402556,0.00006186099,0.00021874231,0.00010373503,0.0011212729,0.0032411686,0.0021802192,0.000095421885,0.0025983586],"category_scores_gemma":[0.007512346,0.000056282075,0.0000713015,0.00020044191,0.0011638603,0.00027595923,0.0007271707,0.0006409356,0.0018133066],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010270581,0.00042640755,0.52689457,0.00000848738,0.000020238298,0.0014943004,0.00130617,0.0003557455,0.26265204,0.0015619078,0.10227936,0.10289804],"study_design_scores_gemma":[0.00065736164,0.00011620828,0.7742609,0.000022766553,0.0000017003335,0.00003018598,0.00019750741,0.00080584496,0.00167541,0.103080094,0.11893589,0.00021613619],"about_ca_topic_score_codex":0.005171338,"about_ca_topic_score_gemma":0.008534233,"teacher_disagreement_score":0.26097664,"about_ca_system_score_codex":0.000039560993,"about_ca_system_score_gemma":0.000016311484,"threshold_uncertainty_score":0.9989639},"labels":[],"label_agreement":null},{"id":"W2779842520","doi":"10.2139/ssrn.3175335","title":"Selecting Equilibria Using Best-Response Dynamics","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Best response; Simple (philosophy); Selection (genetic algorithm); Equilibrium selection; Computer science; Dynamics (music); Mathematical optimization; Mathematical economics; Mathematics; Nash equilibrium; Game theory; Repeated game; Machine learning; Physics","score_opus":0.10188187465568764,"score_gpt":0.4276990976266861,"score_spread":0.32581722297099847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779842520","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.933467,0.00015957598,0.062435675,0.0016647251,0.00018878502,0.00012198471,0.0000036053077,0.000020882697,0.0019377823],"genre_scores_gemma":[0.9922035,0.000045870518,0.00049400073,0.000041668278,0.00027351355,0.0000036968345,4.0965347e-7,0.000019587389,0.006917761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962577,0.00040074383,0.0005211846,0.0003242741,0.0007021839,0.0017938757],"domain_scores_gemma":[0.99718064,0.00072002126,0.000751937,0.00093573495,0.00027702298,0.00013461946],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017158212,0.00015152126,0.00023039166,0.00018131536,0.0024190992,0.0011644479,0.0020151795,0.0000826386,0.000095859315],"category_scores_gemma":[0.0049509075,0.000121583595,0.00016397421,0.00023834348,0.0001620396,0.00073390873,0.00019960411,0.0014103896,0.00027547684],"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.00078939646,0.0001460064,0.013415711,0.0000013799523,0.000119557604,0.000011896083,0.00038524772,0.00070335605,0.032773994,0.7560624,0.00009803945,0.19549301],"study_design_scores_gemma":[0.00037039584,0.00014118153,0.0012822502,0.00001465534,0.000025044917,0.00095651334,0.002458537,0.022001788,0.00031178672,0.9709801,0.0012775797,0.00018013504],"about_ca_topic_score_codex":0.000038382677,"about_ca_topic_score_gemma":0.00047042014,"teacher_disagreement_score":0.21491772,"about_ca_system_score_codex":0.0007384082,"about_ca_system_score_gemma":0.002168149,"threshold_uncertainty_score":0.99987245},"labels":[],"label_agreement":null},{"id":"W2790085650","doi":"10.1007/978-3-319-71583-4_2","title":"Existence of Nash Equilibria on Integer Programming Games","year":2018,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"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","funders":"","keywords":"Nash equilibrium; Integer programming; Polyhedron; Integer (computer science); Class (philosophy); Hierarchy; Set (abstract data type); Mathematical economics; Mathematics; Mathematical optimization; Computer science; Discrete mathematics; Combinatorics; Programming language; Artificial intelligence; Economics","score_opus":0.10560123945626214,"score_gpt":0.36900615540957676,"score_spread":0.2634049159533146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790085650","genre_codex":"other","genre_gemma":"methods","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.012093684,0.0001296195,0.04282115,0.00011898726,0.00043257212,0.0017819162,0.0004189772,0.00015530836,0.9420478],"genre_scores_gemma":[0.02306314,0.00009221268,0.5887941,0.00007950087,0.00033714075,0.00012221969,0.000016799087,0.00021029913,0.38728458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949818,0.000012918859,0.0019715244,0.000844092,0.0017531898,0.00043646412],"domain_scores_gemma":[0.9944298,0.0016988775,0.0017919737,0.0007450644,0.0011936189,0.00014065171],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0030308408,0.0005257339,0.0010142876,0.0006137716,0.0000928223,0.0002821117,0.0015571368,0.00032959174,0.0010940244],"category_scores_gemma":[0.0038093536,0.00044070734,0.00015791689,0.00023713677,0.0008091977,0.00015311255,0.0004538294,0.0006161922,0.0009391552],"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.000021197679,0.00011072206,0.000027937218,0.00032145518,0.00002807877,0.000005495278,0.0031377822,0.0000010396209,0.0001346728,0.98130375,0.0025730396,0.0123348255],"study_design_scores_gemma":[0.00014784058,0.00017203613,0.000025204667,0.0011012235,0.000050624443,0.000008008007,0.00068475463,0.0006909504,0.0003867167,0.94342256,0.052908976,0.00040109843],"about_ca_topic_score_codex":0.0000017852693,"about_ca_topic_score_gemma":0.000007304403,"teacher_disagreement_score":0.5547632,"about_ca_system_score_codex":0.00009744858,"about_ca_system_score_gemma":0.00010788047,"threshold_uncertainty_score":0.9998387},"labels":[],"label_agreement":null},{"id":"W2790369493","doi":"10.1016/j.ejor.2018.03.007","title":"Matrix representations of the inverse problem in the graph model for conflict resolution","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Nanjing University of Aeronautics and Astronautics; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Decision maker; Inverse; Matrix (chemical analysis); Preference; Graph; Mathematical economics; Stability (learning theory); Mathematics; Conflict resolution; Computer science; Mathematical optimization; Operations research; Combinatorics; Political science; Law; Statistics; Machine learning","score_opus":0.4206229275895411,"score_gpt":0.5233741400698904,"score_spread":0.10275121248034924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790369493","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.7850217,0.00012630169,0.12490166,0.040270038,0.000171435,0.0015749016,0.000083614344,0.0000053297226,0.04784499],"genre_scores_gemma":[0.9905013,0.000011077924,0.005978511,0.00015738091,0.00019587995,0.000012003459,0.000001483843,0.000006518215,0.0031358614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468297,0.002637203,0.00076185644,0.0001504579,0.001610106,0.00015742244],"domain_scores_gemma":[0.9947341,0.0018996644,0.00024829016,0.00041434733,0.0026559844,0.00004758116],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.029887699,0.000052472584,0.0000999525,0.00029627833,0.00051221554,0.00016150744,0.001409413,0.0000149468715,0.000084046354],"category_scores_gemma":[0.004686525,0.000026185726,0.00011145256,0.0010923994,0.00058427145,0.00026010314,0.00011553917,0.00030096815,0.000053233372],"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.0005679765,0.000376383,0.0017364923,0.000008669978,0.000033033994,0.0000058000196,0.019393397,0.101559155,0.025575265,0.62562466,0.22254731,0.002571834],"study_design_scores_gemma":[0.0027711613,0.0010291866,0.05967882,0.0001422689,0.000027436648,0.00014145004,0.010505249,0.31490508,0.0033453207,0.5047642,0.102469996,0.00021986364],"about_ca_topic_score_codex":0.0000052336404,"about_ca_topic_score_gemma":0.000040560233,"teacher_disagreement_score":0.21334592,"about_ca_system_score_codex":0.000021851878,"about_ca_system_score_gemma":0.0002879558,"threshold_uncertainty_score":0.99893475},"labels":[],"label_agreement":null},{"id":"W2791114690","doi":"","title":"Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement","year":2017,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Nash equilibrium; Mathematical economics; Combinatorics; Undirected graph; Mathematics; Graph","score_opus":0.06277427040974615,"score_gpt":0.3533896939836715,"score_spread":0.29061542357392534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791114690","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.70762444,0.00070566445,0.0028452363,0.00027228263,0.0010656861,0.00068185973,0.00007651853,0.000106081505,0.28662226],"genre_scores_gemma":[0.7941498,0.00008167697,0.000908807,0.000010863865,0.000030089823,0.0000010592231,0.00013594073,0.000015711923,0.20466602],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99754936,0.00017693001,0.0002687286,0.0006857793,0.0010170221,0.0003021832],"domain_scores_gemma":[0.9967086,0.00021225527,0.0011276791,0.0013604927,0.00041395007,0.00017706265],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008300899,0.00028078567,0.00053930347,0.00014748369,0.000563615,0.00010325395,0.0018699619,0.00028391238,0.03658371],"category_scores_gemma":[0.00015950027,0.00031028283,0.00038095945,0.00013842282,0.00016858982,0.0006228223,0.00017900729,0.00019422901,0.00036371386],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014641923,0.0014950813,0.005047996,0.0002665341,0.0012383021,0.00010193684,0.1119463,0.00013518365,0.14718811,0.012506671,0.024917642,0.693692],"study_design_scores_gemma":[0.0015237256,0.00013605748,0.91910726,0.00021535729,0.00034927094,0.000002392014,0.044421244,0.0021363914,0.00094046444,0.0033627248,0.02693912,0.0008659889],"about_ca_topic_score_codex":0.034986664,"about_ca_topic_score_gemma":0.16043909,"teacher_disagreement_score":0.9140593,"about_ca_system_score_codex":0.00021942263,"about_ca_system_score_gemma":0.0001221659,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W2791685529","doi":"10.3982/ecta12536","title":"Equilibrium Selection in Auctions and High Stakes Games","year":2018,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Common value auction; Mathematical economics; Selection (genetic algorithm); Economics; Equilibrium selection; Microeconomics; Game theory; Computer science; Repeated game; Artificial intelligence","score_opus":0.09761977457778857,"score_gpt":0.36032510611456137,"score_spread":0.2627053315367728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791685529","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.97545063,0.000054443128,0.0016809906,0.0011781463,0.00011811286,0.00009523827,0.000010182397,0.00003318172,0.02137904],"genre_scores_gemma":[0.99554485,0.000007297136,0.00080259907,0.000075788244,0.00013876386,0.000019346458,9.218704e-7,0.0000044870376,0.003405924],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990683,0.00005994525,0.0002914436,0.00031329578,0.000119592325,0.00014743149],"domain_scores_gemma":[0.9989363,0.0006389384,0.00008952293,0.00019029969,0.00007785386,0.00006706863],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00087254884,0.00006235002,0.00013111006,0.0010220212,0.00008689656,0.00014125208,0.00019766213,0.00003826621,0.0017654153],"category_scores_gemma":[0.0009367802,0.000053702628,0.000023926883,0.003068722,0.00015963698,0.00030423925,0.000052200226,0.00006579792,0.00087040354],"study_design_candidate":"observational","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.00008586222,0.00043555137,0.21272391,0.0000061417113,0.000040697596,0.0000014380978,0.0022751556,0.00021906276,0.005978285,0.33612752,0.028040502,0.4140659],"study_design_scores_gemma":[0.00033298664,0.00018216704,0.5768793,0.0000032115533,0.0000059508197,0.000010782591,0.0006798558,0.0019424885,0.0031420093,0.24332783,0.17330115,0.0001922622],"about_ca_topic_score_codex":0.00003833734,"about_ca_topic_score_gemma":0.0000638546,"teacher_disagreement_score":0.4138736,"about_ca_system_score_codex":0.000028712184,"about_ca_system_score_gemma":0.00002132038,"threshold_uncertainty_score":0.99990755},"labels":[],"label_agreement":null},{"id":"W2793434302","doi":"10.1111/caje.12316","title":"Delegation to a possibly ignorant agent","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Economics/Revue canadienne d économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Delegation; Principal (computer security); Principal–agent problem; Incentive; Limiting; Set (abstract data type); Payment; Microeconomics; Economics; Mathematical economics; Computer science; Computer security; Engineering","score_opus":0.3187887762656011,"score_gpt":0.2720710439131818,"score_spread":0.04671773235241927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793434302","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.9854415,0.000030918585,0.001990534,0.007684731,0.001310358,0.00024546584,0.00012235026,0.000005151751,0.0031689596],"genre_scores_gemma":[0.99374694,0.0000047273766,0.0019657623,0.0018333249,0.0010610633,0.000013420625,0.0000030878534,0.000025030513,0.0013466433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766904,0.000111843205,0.0012026767,0.00040487642,0.000007626839,0.0006039655],"domain_scores_gemma":[0.99482924,0.00033241755,0.0006589068,0.0006668006,0.0007701215,0.0027425268],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026503147,0.00019668075,0.00045359496,0.0011808632,0.00033130645,0.00039089765,0.0012772983,0.000113584334,0.0012870353],"category_scores_gemma":[0.0012004271,0.00019876764,0.0001979668,0.0004557159,0.0002250856,0.0004872077,0.00003051398,0.0001958908,0.000930619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009999802,0.000015506892,0.004185953,0.000003440022,0.00006629373,0.00005694232,0.004758441,0.003273493,0.00023241233,0.9331832,0.010887778,0.043236565],"study_design_scores_gemma":[0.00033715632,0.0004902819,0.004154589,0.000032140033,0.00002044669,0.00033209767,0.0011998707,0.0008025568,0.0009584406,0.8090837,0.18228275,0.00030599395],"about_ca_topic_score_codex":0.04924533,"about_ca_topic_score_gemma":0.9758318,"teacher_disagreement_score":0.92658645,"about_ca_system_score_codex":0.0011065565,"about_ca_system_score_gemma":0.00229019,"threshold_uncertainty_score":0.9998473},"labels":[],"label_agreement":null},{"id":"W2794420812","doi":"","title":"The independence number of the competition graph of a bipartite tournament.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Bipartite graph; Mathematics; Independence (probability theory); Independence number; Competition (biology); Graph; Combinatorics; Mathematical economics; Discrete mathematics; Statistics","score_opus":0.03637645098151386,"score_gpt":0.3473419640278946,"score_spread":0.3109655130463807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794420812","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.98717666,0.000020061469,0.00007689101,0.0007402752,0.00076128927,0.00013020493,0.000005918955,0.000007331267,0.011081345],"genre_scores_gemma":[0.99928063,0.00000742357,0.000041710624,0.00005326771,0.0000067678743,0.0000105116915,2.2209514e-7,0.0000035068529,0.0005959492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983574,0.00022638172,0.0003980818,0.00014633828,0.0007514827,0.00012031844],"domain_scores_gemma":[0.99755836,0.0008081036,0.00036199606,0.00077247043,0.00046513494,0.00003396856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019131876,0.0000616931,0.00011867142,0.000029025083,0.00030758773,0.000044093234,0.0010165882,0.000039097395,0.00026379828],"category_scores_gemma":[0.00053865387,0.000031347998,0.000090772584,0.000787933,0.00070583244,0.00009667855,0.00015836472,0.000102126374,0.00017976934],"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.000012942769,0.00004999545,0.016682621,8.0381176e-7,0.0000072374205,6.027545e-8,0.00028347626,0.0000018400614,0.002294108,0.9786304,0.0012438251,0.00079267484],"study_design_scores_gemma":[0.00015935485,0.000029132736,0.028343745,0.000014503991,0.0000068236964,0.0000027164078,0.0002961776,0.000041026564,0.017201949,0.94889563,0.0049724225,0.000036497353],"about_ca_topic_score_codex":0.000018992516,"about_ca_topic_score_gemma":0.000022860931,"teacher_disagreement_score":0.029734764,"about_ca_system_score_codex":0.000008723761,"about_ca_system_score_gemma":0.00004012887,"threshold_uncertainty_score":0.28884062},"labels":[],"label_agreement":null},{"id":"W2799605057","doi":"10.1007/s13235-018-0263-9","title":"Preface: Special issue of Dynamic Games and Applications in Memory of Professor Engelbert J. Dockner","year":2018,"lang":"en","type":"article","venue":"Dynamic Games and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Mathematical economics; Media studies; Sociology; Computer science; Epistemology; Philosophy; Economics","score_opus":0.018995239500472414,"score_gpt":0.34994096284204135,"score_spread":0.3309457233415689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799605057","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.9418422,0.00087069924,0.02789293,0.0023965721,0.000103561106,0.0034582329,0.00047677913,0.00007010486,0.022888945],"genre_scores_gemma":[0.9904892,0.00021704784,0.0015342504,0.000062705665,0.00023957578,0.00097517006,0.000036961646,0.000021268128,0.0064238315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975997,0.00011787878,0.00093972223,0.00069900183,0.00036937828,0.00027428736],"domain_scores_gemma":[0.99727964,0.0007750687,0.00047812692,0.0010113706,0.0003266716,0.00012910228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088360853,0.00022728193,0.0004830887,0.0003405235,0.00021486894,0.00005323241,0.00062829955,0.00014381719,0.0003419292],"category_scores_gemma":[0.0001332307,0.00018861916,0.000081361046,0.0011175674,0.0011655397,0.00017585701,0.00023297867,0.00018231942,0.000072883675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009284267,0.0010772255,0.006464059,0.0001787753,0.00007878014,4.2718088e-7,0.0061909757,0.00006939845,0.019117257,0.21327838,0.0020196796,0.7514322],"study_design_scores_gemma":[0.0017795487,0.00027122736,0.1740913,0.00012503909,0.0001699993,0.000025641368,0.015550593,0.01015519,0.0033518497,0.41352865,0.38002273,0.0009282412],"about_ca_topic_score_codex":0.000036469053,"about_ca_topic_score_gemma":0.00038947145,"teacher_disagreement_score":0.75050396,"about_ca_system_score_codex":0.000028611312,"about_ca_system_score_gemma":0.00007220544,"threshold_uncertainty_score":0.7691666},"labels":[],"label_agreement":null},{"id":"W2800049969","doi":"10.1007/978-3-319-77670-5_1","title":"Conflict Resolution in Practice","year":2018,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University; Wilfrid Laurier University; Centre for International Governance Innovation; University of Waterloo; Balsillie School of International Affairs","funders":"","keywords":"Conflict resolution; Management science; Scope (computer science); Operations research; Engineering; Computer science; Political science; Law","score_opus":0.2044131817973958,"score_gpt":0.4568690069447365,"score_spread":0.25245582514734066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800049969","genre_codex":"other","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.0017115187,0.09576018,0.0056493822,0.0015652518,0.0029972987,0.0029456122,0.00015512983,0.00007676755,0.8891389],"genre_scores_gemma":[0.66457516,0.0074268966,0.00029829744,0.0009862392,0.00080921623,0.00030305868,0.000005733246,0.00005657926,0.32553884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951492,0.0004413397,0.0018716869,0.00095483504,0.001278898,0.00030406233],"domain_scores_gemma":[0.98451036,0.012661527,0.00084523775,0.0009465849,0.00093743886,0.000098878365],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0095161265,0.00036452274,0.0012259241,0.00066182675,0.00020481185,0.00018350934,0.00057165336,0.0003463992,0.0001583723],"category_scores_gemma":[0.00856606,0.00026622685,0.000110752175,0.00022084719,0.0006011358,0.00022443604,0.00026305582,0.0004139352,0.0010961661],"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.0018002836,0.000111344816,0.00025541484,0.000054870186,0.00032762342,0.0001863921,0.0061446913,0.0001464699,0.000021203168,0.83271766,0.0908956,0.06733843],"study_design_scores_gemma":[0.001481948,0.000101551355,0.0001370147,0.00061312236,0.000049021866,0.000047396254,0.0061904304,0.00038031288,3.7444104e-7,0.13054305,0.8601912,0.00026454974],"about_ca_topic_score_codex":0.000027394923,"about_ca_topic_score_gemma":0.00016648925,"teacher_disagreement_score":0.76929563,"about_ca_system_score_codex":0.0001478146,"about_ca_system_score_gemma":0.000064303495,"threshold_uncertainty_score":0.999979},"labels":[],"label_agreement":null},{"id":"W2802788158","doi":"10.1016/j.jet.2021.105365","title":"Discovery and Equilibrium in Games with Unawareness","year":2018,"lang":"en","type":"preprint","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; University of California Berkeley; National Science Foundation","keywords":"Mathematical economics; Extensive-form game; Computer science; Process (computing); Representation (politics); State (computer science); Repeated game; Sequential game; Complete information; Game theory; Mathematics; Algorithm","score_opus":0.06272907394044636,"score_gpt":0.3609895349047538,"score_spread":0.2982604609643074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802788158","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.9915825,0.0004913843,0.003275709,0.00045005634,0.0005342776,0.000115976414,0.00003292234,0.00000463728,0.00351252],"genre_scores_gemma":[0.99778944,0.00005809848,0.00034744386,0.00007606174,0.00039092335,0.000005381563,0.0000010485389,0.000015442973,0.0013161475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978748,0.0003850112,0.0010176741,0.00036073575,0.00019464093,0.00016712301],"domain_scores_gemma":[0.9960895,0.0017468763,0.0013622456,0.00060162786,0.00010805751,0.00009167554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006696222,0.0001879698,0.00061463006,0.00042083056,0.000034112043,0.00041224388,0.0009955652,0.00013209032,0.00023086736],"category_scores_gemma":[0.00033271956,0.00012274104,0.00012920555,0.000076647615,0.00043374716,0.0005374088,0.00050600234,0.0004350706,0.000053396998],"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.004613999,0.00047306655,0.09537491,0.00012749385,0.00061691354,0.00012967346,0.0065686125,0.03250257,0.0011837177,0.8007346,0.006154938,0.05151951],"study_design_scores_gemma":[0.0003866612,0.000083274324,0.011821614,0.00015362704,0.000027606335,0.00010469207,0.000978243,0.00012809686,0.0004340052,0.9845758,0.0011394452,0.00016693208],"about_ca_topic_score_codex":0.0000052832097,"about_ca_topic_score_gemma":0.000026729074,"teacher_disagreement_score":0.18384121,"about_ca_system_score_codex":0.00008963887,"about_ca_system_score_gemma":0.00042183633,"threshold_uncertainty_score":0.50052345},"labels":[],"label_agreement":null},{"id":"W2802993073","doi":"10.1007/978-3-319-77670-5_7","title":"Stability Definitions: Hybrid Preference","year":2018,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University; Wilfrid Laurier University; Centre for International Governance Innovation; University of Waterloo; Balsillie School of International Affairs","funders":"","keywords":"Preference; Stability (learning theory); Simple (philosophy); Mathematics; Mathematical economics; Computer science; Machine learning; Statistics; Epistemology","score_opus":0.4580500930909115,"score_gpt":0.4131753154848574,"score_spread":0.04487477760605407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802993073","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017376164,0.070987575,0.01860506,0.0005843784,0.004027929,0.0047599915,0.001747327,0.00020324961,0.8817083],"genre_scores_gemma":[0.9361884,0.0028463586,0.00013155212,0.00021230892,0.0002931287,0.00031238285,0.000007715084,0.000029856197,0.059978295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949803,0.0003106513,0.0019036715,0.0011768616,0.0013138806,0.00031465958],"domain_scores_gemma":[0.98659605,0.009949347,0.0006866147,0.0014423807,0.0011804746,0.0001451572],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00571664,0.00044467713,0.0013904958,0.0003592434,0.00037639763,0.00023065614,0.00079283054,0.00021298895,0.00093434425],"category_scores_gemma":[0.004517211,0.00031122717,0.00017624637,0.00013802317,0.0010843233,0.00014741078,0.0003690113,0.00035839688,0.0016549393],"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.00060659385,0.00011688245,0.0005025133,0.00011498475,0.00033981257,0.000051291783,0.002090884,0.0000138205605,0.000019731804,0.86118466,0.05990268,0.07505617],"study_design_scores_gemma":[0.00082890596,0.0000968256,0.00013918607,0.00049572566,0.00004929885,0.000028161052,0.0021564278,0.00009196148,0.000003044585,0.780322,0.21548186,0.0003066046],"about_ca_topic_score_codex":0.000006595993,"about_ca_topic_score_gemma":0.00007295162,"teacher_disagreement_score":0.9188122,"about_ca_system_score_codex":0.00010790531,"about_ca_system_score_gemma":0.00008561308,"threshold_uncertainty_score":0.99997896},"labels":[],"label_agreement":null},{"id":"W2806001487","doi":"10.1016/j.dam.2019.07.023","title":"How long does it take for all users in a social network to choose their communities?","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerul Cercetării şi Inovării; Ontario Ministry of Research, Innovation and Science; Université Côte d’Azur; Columbia University","keywords":"Combinatorics; Cardinality (data modeling); Partition (number theory); Mathematics; Upper and lower bounds; Omega; Discrete mathematics; Graph; Convergence (economics); Time complexity; Computer science; Physics","score_opus":0.09479917451953324,"score_gpt":0.359663279146061,"score_spread":0.26486410462652776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806001487","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.864311,0.000012749299,0.10005675,0.009235334,0.00016850635,0.003293421,0.0001687726,0.00009894079,0.02265454],"genre_scores_gemma":[0.98144805,0.0000028350703,0.012495353,0.0013668649,0.00014969206,0.00054189214,0.0000336154,0.000037337224,0.0039243405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998215,0.00005618303,0.0005320808,0.00029687563,0.0004489378,0.00045091173],"domain_scores_gemma":[0.9966505,0.0020104514,0.00026441348,0.00088900054,0.000084790816,0.00010085414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020556126,0.00022632786,0.0004820337,0.0001208081,0.00022776879,0.00040725796,0.0011706738,0.000108557375,0.00012491326],"category_scores_gemma":[0.00012595663,0.00014617329,0.00014132094,0.0005315677,0.00009125049,0.0001353293,0.00025060875,0.00018424289,0.00023905688],"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.00010004791,0.00015294095,0.0003299728,0.00008279357,0.00005075559,4.9355054e-7,0.044481363,0.0008274362,0.0011682741,0.93207854,0.015328411,0.0053989724],"study_design_scores_gemma":[0.0006030546,0.000029237961,0.00045535175,0.000042178694,0.000020140847,0.0000010017603,0.07622705,0.0021720836,0.00045222774,0.8700688,0.049591016,0.0003378594],"about_ca_topic_score_codex":0.0000036438473,"about_ca_topic_score_gemma":0.000204247,"teacher_disagreement_score":0.11713708,"about_ca_system_score_codex":0.000034136265,"about_ca_system_score_gemma":0.000026377304,"threshold_uncertainty_score":0.5960773},"labels":[],"label_agreement":null},{"id":"W2808095563","doi":"10.1007/s11590-018-1285-3","title":"Improved price of anarchy for machine scheduling games with coordination mechanisms","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Price of anarchy; Upper and lower bounds; Computational intelligence; Computer science; Scheduling (production processes); Nash equilibrium; Mathematical optimization; Job shop scheduling; Game theory; Mathematical economics; Operations research; Mathematics; Artificial intelligence; Price of stability; Economics; Computer network","score_opus":0.030898114886665475,"score_gpt":0.31826128258026365,"score_spread":0.28736316769359815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808095563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029988652,0.000004444049,0.9634992,0.0056406483,0.000059957394,0.00038696552,0.00001957881,0.000032104865,0.00036843788],"genre_scores_gemma":[0.624825,6.4285e-7,0.37416795,0.0007027719,0.000037567286,0.000041010266,0.000017900293,0.00000962259,0.00019755504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890035,0.00006161897,0.00032038204,0.00028201242,0.0002995849,0.00013607577],"domain_scores_gemma":[0.99843955,0.00037040908,0.00031455397,0.00031869864,0.0005118266,0.000044965698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009707422,0.00009045724,0.0001429743,0.00017929799,0.00016946389,0.000069619105,0.00029588072,0.00003411323,0.00019728421],"category_scores_gemma":[0.00041163084,0.0000675963,0.000041899853,0.00065030996,0.00014845935,0.0002539514,0.000029292256,0.000040255545,0.000009786816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032132774,0.000106566906,0.00016850399,0.000014358274,0.000041304396,2.3304334e-7,0.00079994067,0.73474115,0.1922725,0.06159624,0.0010140075,0.00892386],"study_design_scores_gemma":[0.00063449715,0.00019376053,0.0000763332,0.000011319764,0.000018591378,0.0000015891418,0.00021462062,0.9603597,0.03168796,0.0058332235,0.0008415266,0.00012690164],"about_ca_topic_score_codex":0.0000046089203,"about_ca_topic_score_gemma":0.000003634217,"teacher_disagreement_score":0.5948363,"about_ca_system_score_codex":0.000015801423,"about_ca_system_score_gemma":0.000024081828,"threshold_uncertainty_score":0.2756497},"labels":[],"label_agreement":null},{"id":"W2897263669","doi":"10.3982/te2266","title":"A complete characterization of equilibria in an intrinsic common agency screening game","year":2018,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Agency (philosophy); Mathematical economics; Characterization (materials science); Microeconomics; Game theory; Economics; Computer science; Sociology; Physics","score_opus":0.09506391575617952,"score_gpt":0.35832213897336096,"score_spread":0.26325822321718145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897263669","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.98286694,0.0000016197588,0.0107282875,0.00035040083,0.00006915517,0.00015790644,0.00005410632,0.000019870384,0.005751691],"genre_scores_gemma":[0.99901533,0.00000340785,0.000590739,0.00020562632,0.00010699453,0.0000073781234,0.000033796678,0.0000109742905,0.00002577777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843764,0.00024250393,0.0007071836,0.00030956988,0.00010947968,0.00019362764],"domain_scores_gemma":[0.99847007,0.00050016324,0.00021741954,0.0006186601,0.00009171133,0.000101948775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017690355,0.00009953897,0.0002992295,0.00015629557,0.000048640606,0.0000758883,0.0006378115,0.00006762464,0.0014676844],"category_scores_gemma":[0.00025869926,0.00008890414,0.000051807343,0.0002877581,0.0011174597,0.00028999386,0.00015427783,0.000097025375,0.00029005212],"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.00010453863,0.000049524788,0.0017371569,0.0000010537507,0.000002427105,2.3236947e-7,0.0005509665,0.000009557729,0.02276237,0.9397514,0.0000015931531,0.03502921],"study_design_scores_gemma":[0.00024570126,0.00013518045,0.04991105,0.000008860323,0.0000045806496,0.0000022382578,0.00007462729,0.028744796,0.002504736,0.91784734,0.000411773,0.000109101864],"about_ca_topic_score_codex":0.0000039163288,"about_ca_topic_score_gemma":0.000017009896,"teacher_disagreement_score":0.04817389,"about_ca_system_score_codex":0.00001699254,"about_ca_system_score_gemma":0.00002248565,"threshold_uncertainty_score":0.9994451},"labels":[],"label_agreement":null},{"id":"W2899399651","doi":"10.1016/j.ijindorg.2018.10.005","title":"Strengthening a weak rival for a fight","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Organization","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Incentive; Attrition; Competition (biology); Industrial organization; Productivity; Microeconomics; Barriers to entry; Business; Economics; Raising (metalworking); Market economy; Market structure; Macroeconomics","score_opus":0.14224167352790534,"score_gpt":0.40191648350254805,"score_spread":0.2596748099746427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899399651","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.70794004,0.000012580502,0.27465296,0.009936432,0.005194515,0.00023920495,0.000060474118,0.000026740217,0.0019370589],"genre_scores_gemma":[0.99206984,0.0000022116858,0.0019283859,0.00017518832,0.005179386,0.0000015400456,0.0000105362915,0.000012257877,0.00062065636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978851,0.000090484995,0.0008564098,0.00014441804,0.0009225064,0.000101075806],"domain_scores_gemma":[0.9930823,0.0007902698,0.0009014435,0.00014280324,0.0050078044,0.00007538036],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017282151,0.00008105277,0.00015627456,0.00032554206,0.0001245115,0.0002612142,0.0009756713,0.00009512075,0.0013066779],"category_scores_gemma":[0.012996643,0.000061567705,0.00008345295,0.00063516566,0.00007518745,0.0004299256,0.00006464312,0.0001319888,0.000120800265],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014444352,0.0006237677,0.050034415,0.0000016277332,0.0005823364,0.000011899936,0.003933739,0.000840508,0.05048228,0.2673116,0.30693877,0.31779462],"study_design_scores_gemma":[0.007083558,0.000989463,0.0033553396,0.00014310435,0.000111723304,0.00034838775,0.0020515737,0.0011355473,0.16628787,0.16035487,0.65770936,0.000429181],"about_ca_topic_score_codex":0.0000017607061,"about_ca_topic_score_gemma":0.0000021535457,"teacher_disagreement_score":0.35077062,"about_ca_system_score_codex":0.00006940999,"about_ca_system_score_gemma":0.00019682421,"threshold_uncertainty_score":0.99960625},"labels":[],"label_agreement":null},{"id":"W2908258","doi":"10.1007/978-0-387-98026-3_1","title":"Cheap Talk in Operations: Role of Intentional Vagueness","year":2009,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Kellogg's (Canada)","funders":"","keywords":"Vagueness; Service (business); Business; Service provider; Stockout; Process (computing); Marketing; Computer science","score_opus":0.120717838250314,"score_gpt":0.4754162418551074,"score_spread":0.3546984036047934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908258","genre_codex":"other","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.028375559,0.0002522691,0.0011519367,0.019476898,0.0019221286,0.005592554,0.0004196005,0.00009716468,0.9427119],"genre_scores_gemma":[0.59240633,0.0028719641,0.009729396,0.00016814718,0.0002513587,0.0016759476,0.0003523717,0.00006602059,0.3924785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9719962,0.00074685906,0.0036868972,0.0035899307,0.018050527,0.0019295813],"domain_scores_gemma":[0.9887825,0.0006339727,0.00021804994,0.0026702248,0.0072550047,0.00044022957],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.040602237,0.00077435904,0.0008580237,0.023261053,0.0026702692,0.005002155,0.014975537,0.00030660225,0.0050471425],"category_scores_gemma":[0.004511128,0.0007643917,0.00026065405,0.0111042205,0.01177804,0.010151407,0.0061813938,0.002168248,0.0007524126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020121741,0.00061730505,0.0003211105,0.000025134706,0.00005721194,0.0001068335,0.00082722894,0.16045819,0.00189297,0.8235074,0.00039659452,0.0115887625],"study_design_scores_gemma":[0.0025277124,0.0004961334,0.025012927,0.0017392498,0.000027998367,0.00008992243,0.023054695,0.115901396,0.0023164807,0.5983305,0.22864409,0.0018588834],"about_ca_topic_score_codex":0.0012530762,"about_ca_topic_score_gemma":0.018310104,"teacher_disagreement_score":0.56403077,"about_ca_system_score_codex":0.0042281565,"about_ca_system_score_gemma":0.0013927759,"threshold_uncertainty_score":0.99960315},"labels":[],"label_agreement":null},{"id":"W2908948862","doi":"10.1109/smc.2018.00085","title":"Option Effectiveness in Conflict Resolution","year":2018,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Ranking (information retrieval); Conflict resolution; Extension (predicate logic); Computer science; Operations research; China; Resolution (logic); Management science; Risk analysis (engineering); Economics; Engineering; Artificial intelligence; Business; Political science","score_opus":0.1828050421486521,"score_gpt":0.4624986567086867,"score_spread":0.2796936145600346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908948862","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.8442929,0.000006695324,0.10857102,0.00018967256,0.00007642924,0.00012819559,9.5204916e-7,0.000026931131,0.04670721],"genre_scores_gemma":[0.99784344,8.8740336e-7,0.00039161823,0.00007371503,0.000057509606,0.00002011167,7.5576384e-7,0.000001936697,0.0016100163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907184,0.00024179298,0.00017341984,0.00019866526,0.00022215344,0.00009211294],"domain_scores_gemma":[0.9989132,0.0006326108,0.00003689013,0.00027130364,0.00011789602,0.00002808744],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002407719,0.000038809925,0.000073127245,0.00011429898,0.0000706632,0.000044673427,0.00020421566,0.000033497647,0.00040109723],"category_scores_gemma":[0.0005185337,0.000027579123,0.00002148804,0.00055260456,0.00011466663,0.00013929456,0.000034268076,0.000038814025,0.0027248522],"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.000082751314,0.00005860993,0.0062457155,9.217009e-7,0.0000015340921,4.2018704e-7,0.00025658638,0.00009705153,0.022433734,0.9335365,0.0006830072,0.036603156],"study_design_scores_gemma":[0.00036724584,0.000090322785,0.42102593,0.00001081743,0.0000017173863,0.0000032025532,0.00035818986,0.004688638,0.021680895,0.51027507,0.041401472,0.00009647727],"about_ca_topic_score_codex":0.000028855091,"about_ca_topic_score_gemma":0.000067248766,"teacher_disagreement_score":0.42326143,"about_ca_system_score_codex":0.00001851808,"about_ca_system_score_gemma":0.000011253964,"threshold_uncertainty_score":0.99805164},"labels":[],"label_agreement":null},{"id":"W2911915087","doi":"10.1080/03155986.2018.1533211","title":"A hierarchical graph model for conflict resolution with sequential moves","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo; Balsillie School of International Affairs; Centre for International Governance Innovation","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subsidy; Status quo; China; Government (linguistics); Graph; Conflict resolution; Operations research; Economics; Computer science; Political science; Mathematics; Law","score_opus":0.21131388205111884,"score_gpt":0.4419908434225433,"score_spread":0.23067696137142446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911915087","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.4659638,0.0000811309,0.4876995,0.002026878,0.00018414756,0.0040910468,0.0004893093,0.000060934337,0.039403234],"genre_scores_gemma":[0.99179757,0.0000088898305,0.00134667,0.00020121362,0.000074085,0.000497007,0.0001323719,0.000005677274,0.005936522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681455,0.00013574255,0.0007183551,0.00021086265,0.0018319014,0.0002886102],"domain_scores_gemma":[0.99631506,0.0010894629,0.00013325404,0.00033987666,0.0019783918,0.00014397805],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061223553,0.00010779468,0.00018661878,0.0005217586,0.0005753198,0.0012700604,0.0003312597,0.00009979888,0.0000631748],"category_scores_gemma":[0.0006386032,0.000071604605,0.000048429603,0.00054332474,0.00020356377,0.002363982,0.0000868614,0.00021120625,0.00038751963],"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.00026580892,0.000012232099,0.0003448204,0.000027988719,0.000012916315,6.7293854e-8,0.0016087219,0.076150395,0.00020988288,0.9168501,0.0029651928,0.0015518559],"study_design_scores_gemma":[0.00081546593,0.00015706095,0.00079335034,0.000025100891,0.0000023484818,0.000014919487,0.001695646,0.85631436,0.000061245744,0.010193305,0.1298073,0.00011990399],"about_ca_topic_score_codex":0.00004723983,"about_ca_topic_score_gemma":0.000010441042,"teacher_disagreement_score":0.9066568,"about_ca_system_score_codex":0.0000425576,"about_ca_system_score_gemma":0.00035471006,"threshold_uncertainty_score":0.9997667},"labels":[],"label_agreement":null},{"id":"W2913163507","doi":"10.2139/ssrn.5263345","title":"A Formal Separation between Strategic and Nonstrategic Behavior","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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 British Columbia; University of Alberta","funders":"","keywords":"Bounded rationality; Rationality; Hierarchy; Mathematical economics; Bounded function; Computer science; Characterization (materials science); Work (physics); Private information retrieval; Boundary (topology); Property (philosophy); Artificial intelligence; Economics; Epistemology; Mathematics; Computer security","score_opus":0.10503768929340944,"score_gpt":0.42469475875755364,"score_spread":0.3196570694641442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913163507","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.9526536,0.0012841728,0.032228958,0.00071492756,0.0002523409,0.0005135842,0.00008226497,0.000044456392,0.012225698],"genre_scores_gemma":[0.9933283,0.00077758485,0.0001792914,0.00003494145,0.00037074098,0.00006986742,0.000029842486,0.000010982497,0.005198501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562675,0.00034883164,0.0009584462,0.0005972339,0.00077162165,0.0016971173],"domain_scores_gemma":[0.9979163,0.00039439945,0.00065346604,0.000568397,0.00031103787,0.00015643275],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00804438,0.00031391083,0.00048758846,0.00042329027,0.0005500138,0.0008411577,0.0011090694,0.00035103696,0.000084701576],"category_scores_gemma":[0.000103573904,0.00025083128,0.00022938306,0.0004098581,0.00015007258,0.00036723324,0.0004230039,0.0043687946,0.00008103187],"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.000032464923,0.0000685771,0.003884579,0.000008270751,0.00010896835,0.0000027701185,0.00017021468,0.00020083348,0.00008208735,0.934167,0.000050711886,0.061223466],"study_design_scores_gemma":[0.00028636918,0.00012360563,0.002339777,0.000029019213,0.00017850121,0.00015978988,0.0024185888,0.00023222786,0.00003939662,0.9936015,0.00035462782,0.00023657164],"about_ca_topic_score_codex":0.00002707458,"about_ca_topic_score_gemma":0.0003170917,"teacher_disagreement_score":0.060986895,"about_ca_system_score_codex":0.00035154657,"about_ca_system_score_gemma":0.0054864152,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W2913334655","doi":"10.1287/moor.1120.0557","title":"Lipschitz Games","year":2012,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Lipschitz continuity; Constant (computer programming); Mathematical proof; Mathematics; Stochastic game; Mathematical economics; Probabilistic logic; Function (biology); Pure mathematics; Computer science; Statistics; Geometry","score_opus":0.5498980570001545,"score_gpt":0.581616604163756,"score_spread":0.03171854716360156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913334655","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.906349,0.00015063841,0.01989253,0.0013053402,0.00005922208,0.00037627592,0.000018386105,0.000021734939,0.071826845],"genre_scores_gemma":[0.9623752,0.000007765882,0.02640229,0.000014736178,0.00008062734,0.00007613254,0.0000022641398,0.000008316061,0.01103267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972959,0.00029114404,0.00052857655,0.0001499513,0.001428854,0.00030555556],"domain_scores_gemma":[0.9960778,0.0020290324,0.000038039438,0.00089773344,0.0008226287,0.00013480514],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010544272,0.0000654315,0.00017053874,0.00036299566,0.0003362781,0.00016579352,0.00077373674,0.000045805307,0.0019328996],"category_scores_gemma":[0.0059813745,0.00004574416,0.00006089826,0.0011364486,0.00028461815,0.0003569577,0.00019973738,0.0001859261,0.0027856412],"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.0000022627128,0.0004795577,0.00041562354,0.000009873621,0.000008167084,1.09928855e-7,0.0045405934,0.00035302222,0.010838179,0.9750352,0.0047394433,0.0035779886],"study_design_scores_gemma":[0.0004752287,0.00016018095,0.005340044,0.000070273694,0.00002033202,0.00003218052,0.027235178,0.029217303,0.08963996,0.7857896,0.061622474,0.0003972232],"about_ca_topic_score_codex":0.000009169413,"about_ca_topic_score_gemma":0.000010741956,"teacher_disagreement_score":0.18924555,"about_ca_system_score_codex":0.000015136757,"about_ca_system_score_gemma":0.00006873099,"threshold_uncertainty_score":0.99897945},"labels":[],"label_agreement":null},{"id":"W2913723619","doi":"10.1007/978-3-662-54110-4_4","title":"Multilinear Games","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of British Columbia","funders":"","keywords":"Multilinear map; Polynomial; Polytope; Dimension (graph theory); Computer science; Computation; Mathematics; Mathematical optimization; Theoretical computer science; Discrete mathematics; Algorithm; Combinatorics; Pure mathematics","score_opus":0.06418146451005746,"score_gpt":0.35177276249072426,"score_spread":0.2875912979806668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913723619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002951384,0.0001489661,0.9585803,0.0012942184,0.00078902923,0.00025029242,0.000021375208,0.000065124405,0.038555566],"genre_scores_gemma":[0.8549613,0.000040379004,0.10544891,0.0025544513,0.0015876468,0.00002192238,0.000003110049,0.000058987203,0.035323292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588275,0.000047128768,0.0006500666,0.001402552,0.0015873313,0.00043018768],"domain_scores_gemma":[0.994503,0.0029283112,0.0003167884,0.00170345,0.00038255527,0.00016585251],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027451029,0.0003321491,0.00044294805,0.00072146964,0.00023377182,0.00037918755,0.0031789253,0.00023476657,0.0007038426],"category_scores_gemma":[0.0009783225,0.00020777936,0.00015166968,0.0005079397,0.0015594879,0.0002776117,0.000713866,0.00042134314,0.0014909769],"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.000005540798,0.000010914255,0.00003999232,0.000001855533,0.0000025081404,0.000008870917,0.00018833797,0.0017125303,0.00023046999,0.059230532,0.00006975865,0.9384987],"study_design_scores_gemma":[0.0001405264,0.00004100032,0.000102910824,0.00010394409,0.000003750819,0.000018203962,2.497962e-7,0.015664602,0.0014119392,0.93165356,0.050534874,0.00032443745],"about_ca_topic_score_codex":0.0000023118844,"about_ca_topic_score_gemma":0.000023790955,"teacher_disagreement_score":0.93817425,"about_ca_system_score_codex":0.00008963231,"about_ca_system_score_gemma":0.00026965237,"threshold_uncertainty_score":0.9992865},"labels":[],"label_agreement":null},{"id":"W2913811578","doi":"10.1109/cdc.2018.8619367","title":"Graphon Mean Field Games and the GMFG Equations","year":2018,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Uniqueness; Sketch; Generalization; Game theory; Dynamical systems theory; Nash equilibrium; Mathematical economics; Computer science; Field (mathematics); Dynamical system (definition); Mathematics; Applied mathematics; Discrete mathematics; Theoretical computer science; Pure mathematics; Algorithm; Mathematical analysis; Physics","score_opus":0.1007480457693853,"score_gpt":0.3966995229109854,"score_spread":0.29595147714160014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913811578","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2715464,0.000087314445,0.26511776,0.041604105,0.00019883906,0.00031371528,0.000003995323,0.00007553124,0.42105234],"genre_scores_gemma":[0.9872975,0.0000054581224,0.00043941673,0.0018413328,0.00006981899,0.000015566227,2.4230144e-7,0.0000017058288,0.01032896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927896,0.0001030303,0.00016717745,0.00015726736,0.0002149823,0.0000786069],"domain_scores_gemma":[0.9958112,0.0035890946,0.000045539844,0.00041181044,0.000106048356,0.000036276793],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015839838,0.000042128348,0.000070793976,0.00004906996,0.0002919077,0.00013182078,0.00031455682,0.000021712036,0.0019948971],"category_scores_gemma":[0.0012218418,0.000019548213,0.000036400746,0.00034365378,0.0004269663,0.00008578998,0.000066623674,0.000043394335,0.0006971619],"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.000012258106,0.0000066377215,0.00014801399,1.0327283e-7,0.0000027754108,3.297651e-8,0.0010089275,5.024959e-7,0.00012328709,0.9610009,0.010173972,0.027522558],"study_design_scores_gemma":[0.00021671697,0.000026556503,0.000845327,0.0000011270573,0.0000056885965,0.0000014843671,0.0014458597,0.0010229088,0.0023896333,0.9599596,0.034043513,0.000041582378],"about_ca_topic_score_codex":0.00003730748,"about_ca_topic_score_gemma":0.00020565373,"teacher_disagreement_score":0.7157511,"about_ca_system_score_codex":0.0000012069436,"about_ca_system_score_gemma":0.000008599193,"threshold_uncertainty_score":0.9989174},"labels":[],"label_agreement":null},{"id":"W2914307045","doi":"10.1145/3308558.3313680","title":"Gaps in Information Access in Social Networks?","year":2019,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Information access; Social network (sociolinguistics); Access to information; Maximization; Value (mathematics); Social network analysis; Information system","score_opus":0.08241007768002624,"score_gpt":0.42547788245980417,"score_spread":0.34306780477977794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914307045","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.8452873,0.0000026918576,0.0034191902,0.0007782904,0.00006599889,0.00015047012,8.1906876e-7,0.000012451795,0.15028279],"genre_scores_gemma":[0.998309,0.0000013631595,0.000042390453,0.0004990461,0.000023956605,0.000012823625,0.0000028228412,0.0000010932957,0.0011075097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991964,0.000057873098,0.00031724543,0.00009101052,0.00022936272,0.000108096836],"domain_scores_gemma":[0.9994621,0.000264074,0.000066578315,0.00015308477,0.00003750096,0.000016619728],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001335037,0.000037530433,0.00008627594,0.00018478032,0.000029665207,0.00019959261,0.00044705186,0.000042098676,0.0015863719],"category_scores_gemma":[0.000113039845,0.000028028922,0.000020152802,0.00094605616,0.000016982174,0.0013882712,0.00008821474,0.000079133446,0.0020190494],"study_design_candidate":"observational","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.000047243277,0.00006639154,0.26491648,0.0000029150578,0.0000014784091,3.7370305e-7,0.0018794305,0.015918523,0.0000454236,0.58539677,0.012208601,0.11951637],"study_design_scores_gemma":[0.0004922573,0.000008639249,0.6919745,0.0000051567918,5.3457586e-7,5.033863e-7,0.0015295253,0.020670254,0.00006904179,0.2541574,0.030981911,0.00011023593],"about_ca_topic_score_codex":0.000028848657,"about_ca_topic_score_gemma":0.00012640715,"teacher_disagreement_score":0.42705804,"about_ca_system_score_codex":0.00001561688,"about_ca_system_score_gemma":0.000016164277,"threshold_uncertainty_score":0.9993263},"labels":[],"label_agreement":null},{"id":"W2914876990","doi":"10.1109/isit.2019.8849498","title":"On the Number of Bins in Equilibria for Signaling Games","year":2019,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Ontario Lung Association","funders":"","keywords":"Context (archaeology); Gaussian; Countable set; Exponential function; Upper and lower bounds; Mathematics; Quadratic equation; Computer science; Parametric statistics; Sobel operator; Applied mathematics; Mathematical optimization; Mathematical economics; Discrete mathematics; Statistics; Mathematical analysis; Artificial intelligence","score_opus":0.11603114558815264,"score_gpt":0.41862221366648666,"score_spread":0.302591068078334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914876990","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.92810893,0.0000017337243,0.0017268633,0.0009960524,0.00003384545,0.00023183782,0.000004474605,0.0000059160225,0.06889037],"genre_scores_gemma":[0.98913515,1.7815013e-7,0.00038421628,0.00024799292,0.000008791824,0.000021687001,3.3339305e-7,0.0000026054468,0.010199056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993137,0.000052447664,0.00021636946,0.00013424408,0.00020441954,0.00007879594],"domain_scores_gemma":[0.9948288,0.004715333,0.00006276199,0.00033086113,0.000048760703,0.000013459372],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015778269,0.000036382145,0.00009081798,0.000036084257,0.000019602074,0.000026023163,0.00034916715,0.0000193043,0.0047620195],"category_scores_gemma":[0.0005318574,0.000017867085,0.00005042112,0.00026826857,0.000033753884,0.000051499224,0.000031426836,0.00003266323,0.0012001498],"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.000018482762,0.000025700956,0.0031100544,8.6717694e-7,0.0000015540583,1.7160271e-8,0.00016505462,0.0001456564,0.018529296,0.97539806,0.0013725751,0.0012326648],"study_design_scores_gemma":[0.0001553513,0.000020288926,0.0015518643,0.0000075358803,0.0000011976515,2.6056225e-7,0.00091223884,0.0022358333,0.023326656,0.96768415,0.004064774,0.00003985098],"about_ca_topic_score_codex":0.000005348552,"about_ca_topic_score_gemma":0.000004070034,"teacher_disagreement_score":0.06102623,"about_ca_system_score_codex":0.0000032670355,"about_ca_system_score_gemma":0.000013767771,"threshold_uncertainty_score":0.9995775},"labels":[],"label_agreement":null},{"id":"W2917799162","doi":"10.1016/j.ejor.2019.02.043","title":"Mixed stabilities for analyzing opponents’ heterogeneous behavior within the graph model for conflict resolution","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"National Science Foundation","keywords":"Conflict resolution; Stability (learning theory); Decision maker; Graph; Resolution (logic); Conflict analysis; Mixed model; Mixed graph; Computer science; Mathematical economics; Mathematics; Operations research; Artificial intelligence; Theoretical computer science; Sociology; Machine learning","score_opus":0.4733390425696968,"score_gpt":0.470154653480243,"score_spread":0.0031843890894537874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917799162","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.892533,0.00012908975,0.10391482,0.001858038,0.00015624918,0.0008835875,0.000097419455,0.000004698652,0.00042311134],"genre_scores_gemma":[0.99020207,0.000008818543,0.0054310746,0.00008428317,0.00018819771,0.000055264885,0.000010115941,0.000018974231,0.0040011792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956531,0.0014603235,0.00089986855,0.00025953923,0.0014718439,0.00025532168],"domain_scores_gemma":[0.9928092,0.0032833305,0.0002799344,0.00040797974,0.0030974878,0.00012210466],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03089422,0.00009642705,0.00018650999,0.00030833323,0.0007008271,0.00048295187,0.0010702882,0.000022351891,0.000116154886],"category_scores_gemma":[0.0034419785,0.000057888967,0.0002218688,0.0003298906,0.00023299512,0.00032239212,0.00010523967,0.00029191579,0.00007955703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020222233,0.00042696946,0.0022473165,0.000022959483,0.00012915205,0.000009871219,0.0058606495,0.5875946,0.07858336,0.30274454,0.013360689,0.0069976025],"study_design_scores_gemma":[0.0045367614,0.0026921062,0.013714375,0.000110856956,0.00009464899,0.00021962431,0.007557273,0.8138307,0.00995728,0.10468965,0.042054296,0.00054246123],"about_ca_topic_score_codex":0.0000013083832,"about_ca_topic_score_gemma":0.0000047869808,"teacher_disagreement_score":0.22623602,"about_ca_system_score_codex":0.000049406113,"about_ca_system_score_gemma":0.00027200053,"threshold_uncertainty_score":0.99789834},"labels":[],"label_agreement":null},{"id":"W2921883679","doi":"10.1109/tfuzz.2019.2905222","title":"Graph Model Under Unknown and Fuzzy Preferences","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Wilfrid Laurier University; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Preference; Fuzzy logic; Computer science; Stability (learning theory); Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.0866269897133851,"score_gpt":0.3276374947189205,"score_spread":0.2410105050055354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921883679","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.6373767,0.00014987423,0.32080248,0.00036360574,0.0010641557,0.00071875536,0.00008993133,0.00013979625,0.039294653],"genre_scores_gemma":[0.9812951,0.000027890464,0.00013245537,0.00009833832,0.000032701977,0.00011670955,0.000001230821,0.000016515498,0.01827907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975658,0.00022507794,0.0005457844,0.0006271975,0.0007654922,0.00027065212],"domain_scores_gemma":[0.99773645,0.00094396254,0.00015395883,0.00082643796,0.00016641068,0.00017275714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010733363,0.0002085497,0.00034019852,0.0003329126,0.00029794485,0.00029935676,0.0004976188,0.0001386492,0.00012143808],"category_scores_gemma":[0.000014246043,0.00015424288,0.00012619986,0.00067830697,0.0001366735,0.00034589475,0.0000029083785,0.00023788483,0.0013959653],"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.00010983982,0.00033131093,0.00022043403,0.00004536769,0.000102508246,0.000001018532,0.0011360677,0.8139267,0.007051238,0.16099693,0.0012634866,0.014815104],"study_design_scores_gemma":[0.0020929205,0.00053545466,0.0014876908,0.00023125637,0.00015965072,0.000084568055,0.008861545,0.13666908,0.004439626,0.8351849,0.008878198,0.0013751461],"about_ca_topic_score_codex":0.0000632096,"about_ca_topic_score_gemma":0.000059010144,"teacher_disagreement_score":0.6772576,"about_ca_system_score_codex":0.000026662618,"about_ca_system_score_gemma":0.00006122471,"threshold_uncertainty_score":0.99938154},"labels":[],"label_agreement":null},{"id":"W2924012729","doi":"10.1016/j.geb.2019.07.006","title":"Limiting Sender's information in Bayesian persuasion","year":2019,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Communication source; Corollary; Outcome (game theory); Computer science; Mathematical economics; Persuasion; Signaling game; Complete information; Action (physics); Best response; Bayesian game; Limiting; Bayesian probability; Nash equilibrium; Game theory; Theoretical computer science; Economics; Repeated game; Mathematics; Artificial intelligence; Discrete mathematics; Psychology; Computer network; Social psychology","score_opus":0.045457698751297224,"score_gpt":0.31888247633844996,"score_spread":0.2734247775871527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924012729","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.99357325,0.000012906816,0.00015862797,0.0002989652,0.000115882256,0.00017848123,0.000010041168,0.000013507002,0.005638363],"genre_scores_gemma":[0.99912053,0.000009282786,0.00016266803,0.00010358178,0.00001929944,0.00002442232,0.0000049166,0.0000030324202,0.0005522618],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992761,0.000025687279,0.00033560643,0.00017003829,0.00006898248,0.0001236021],"domain_scores_gemma":[0.9994868,0.00012308898,0.000106652806,0.00022164332,0.000013242456,0.00004859035],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006584946,0.0000645615,0.0001246667,0.00013204459,0.000047780002,0.00015596802,0.000145211,0.00004693437,0.0008636792],"category_scores_gemma":[0.000028286226,0.00005543463,0.000033660548,0.000061509716,0.000026678012,0.0006367809,0.000057616136,0.0000695598,0.0013836559],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017456756,0.000031537216,0.5257555,0.0000037739944,0.0000019587644,6.062941e-7,0.0020711678,0.0003453527,0.00038453558,0.014394646,0.0003226614,0.4566708],"study_design_scores_gemma":[0.0008304856,0.000058509995,0.9323233,0.000017602764,0.000011703999,0.000024626823,0.01355391,0.012974381,0.0003403852,0.0100444015,0.029537687,0.0002830378],"about_ca_topic_score_codex":0.000039406514,"about_ca_topic_score_gemma":0.000033012202,"teacher_disagreement_score":0.45638776,"about_ca_system_score_codex":0.000029561164,"about_ca_system_score_gemma":0.000017695791,"threshold_uncertainty_score":0.9993939},"labels":[],"label_agreement":null},{"id":"W2937261171","doi":"10.3390/g10020019","title":"Ideal Reactive Equilibrium","year":2019,"lang":"en","type":"article","venue":"Games","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":"University of Guelph","funders":"","keywords":"Mathematical economics; Subgame perfect equilibrium; Ideal (ethics); Subgame; Nash equilibrium; Perfection; Trembling hand perfect equilibrium; Sequential equilibrium; Complete information; Equilibrium selection; Extensive-form game; Markov perfect equilibrium; Computer science; Economics; Epsilon-equilibrium; Game theory; Best response; Sequential game; Epistemology; Repeated game; Philosophy","score_opus":0.06814157462283109,"score_gpt":0.3783683144727049,"score_spread":0.3102267398498738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937261171","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.85418755,0.000030460043,0.0003628931,0.0009104653,0.00014501471,0.0001096047,0.000007971311,0.0000372646,0.14420877],"genre_scores_gemma":[0.97312933,7.420524e-7,0.0002105571,0.00021528879,0.00005503816,0.000009810053,0.0000016661361,0.0000044961007,0.026373064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989702,0.00006751006,0.00019331898,0.0002587888,0.00037501447,0.00013513566],"domain_scores_gemma":[0.9986001,0.00064377545,0.00008278858,0.0005400416,0.00008007206,0.00005317712],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006202294,0.000058473088,0.00012276719,0.00006328535,0.000027479395,0.000079148,0.00042903115,0.000032109347,0.0024839109],"category_scores_gemma":[0.00031731228,0.000041499163,0.000058880796,0.00028830016,0.000054589113,0.00018606892,0.00008774799,0.00007048335,0.017161477],"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.0001411835,0.00021986233,0.011576141,0.0000041788467,0.000029015075,0.000003639216,0.0026420616,0.000102280115,0.21530236,0.48086584,0.057958312,0.23115513],"study_design_scores_gemma":[0.00044304223,0.00008997025,0.024348916,0.000005498233,0.000005203713,0.0000071052355,0.0015052109,0.0004192652,0.013662433,0.5509206,0.40844327,0.00014945774],"about_ca_topic_score_codex":0.000004954208,"about_ca_topic_score_gemma":0.0000011866398,"teacher_disagreement_score":0.35048497,"about_ca_system_score_codex":0.000008298446,"about_ca_system_score_gemma":0.000024024659,"threshold_uncertainty_score":0.9984279},"labels":[],"label_agreement":null},{"id":"W2937589491","doi":"10.1007/978-3-030-16989-3_9","title":"Community Structures in Information Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Community structure; Nash equilibrium; Computer science; Game theory; Mathematical economics; Information networks; Network structure; Complete information; Theoretical computer science; Mathematics; World Wide Web; Combinatorics","score_opus":0.056466265007757394,"score_gpt":0.30055117552653365,"score_spread":0.24408491051877626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937589491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022152336,0.00015885777,0.98608303,0.00079814973,0.00052054215,0.0008236486,0.00012114808,0.000034782297,0.009244619],"genre_scores_gemma":[0.40809205,0.00009226999,0.5904621,0.00066425174,0.00016689124,0.00004027633,0.00016245877,0.00002402719,0.00029569148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982343,0.000044098855,0.0010387984,0.000099806166,0.00039080714,0.00019224337],"domain_scores_gemma":[0.99683625,0.0012644726,0.000741931,0.00088617316,0.00023520127,0.000035972498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016942588,0.00023111595,0.00040737307,0.00036048368,0.0008745457,0.00030102293,0.0024727709,0.00024932448,0.0000047396884],"category_scores_gemma":[0.00030899336,0.00016886697,0.00017554167,0.00038679456,0.00050244195,0.00059321476,0.00078804186,0.00079543516,0.0000031475313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020681323,0.000005386252,0.000011357113,0.000035882353,0.000014508005,5.646743e-9,0.0013115441,0.84739083,9.848776e-7,0.13277543,0.00008683083,0.0183652],"study_design_scores_gemma":[0.00033096672,0.00006250285,0.0008955687,0.0001681902,0.000034042372,0.000007194985,0.000061178696,0.8599306,0.000022284083,0.05027966,0.08782656,0.00038129248],"about_ca_topic_score_codex":0.000049058115,"about_ca_topic_score_gemma":0.00018832048,"teacher_disagreement_score":0.40587682,"about_ca_system_score_codex":0.00005468777,"about_ca_system_score_gemma":0.00014526275,"threshold_uncertainty_score":0.6886195},"labels":[],"label_agreement":null},{"id":"W2941855156","doi":"10.1007/s00199-019-01193-9","title":"Strategic experimentation with asymmetric players","year":2019,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"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","keywords":"Public finance; Economics; Mathematical economics; Microeconomics; Macroeconomics","score_opus":0.06763458230974723,"score_gpt":0.3518900481794111,"score_spread":0.2842554658696639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941855156","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.7999398,0.00003390794,0.0010784364,0.000060550552,0.00014540236,0.00015700627,0.0000066034668,0.000027532196,0.19855075],"genre_scores_gemma":[0.98987085,0.0000015760212,0.00022543823,0.00014156441,0.00004417863,0.000021740761,0.0000036192735,0.000009355442,0.009681666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990147,0.00013468483,0.000253638,0.00033074387,0.00012875143,0.000137482],"domain_scores_gemma":[0.9983573,0.0009115241,0.0001524934,0.00049841247,0.000020558564,0.00005972336],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015601517,0.00008967211,0.00014148331,0.00018257278,0.00006710732,0.00012560506,0.0003992645,0.000032949618,0.005741596],"category_scores_gemma":[0.000025961817,0.000064715314,0.00004439448,0.00019637337,0.000069593734,0.00025269616,0.00003014791,0.00006346991,0.017817276],"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.00007562407,0.000015922402,0.0010456275,5.1361707e-7,0.000011072879,3.1670197e-7,0.00031092615,0.0011097526,0.00065820426,0.9905888,0.00019224752,0.0059909998],"study_design_scores_gemma":[0.00068691,0.00013212503,0.0034847911,0.0000038721273,0.0000080104455,0.000009862083,0.013328332,0.0007742846,0.00763973,0.9692082,0.004507953,0.00021595326],"about_ca_topic_score_codex":0.0000045588667,"about_ca_topic_score_gemma":0.0000031046404,"teacher_disagreement_score":0.18993104,"about_ca_system_score_codex":0.00005268338,"about_ca_system_score_gemma":0.000057612422,"threshold_uncertainty_score":0.9951673},"labels":[],"label_agreement":null},{"id":"W2942161359","doi":"10.1109/tsmc.2018.2876589","title":"Inverse Engineering Preferences in the Graph Model for Conflict Resolution","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observable; Computer science; Graph; Inverse; Conflict resolution; Preference; Decision maker; Set (abstract data type); Stability (learning theory); Mathematical optimization; Resolution (logic); Process (computing); Reduction (mathematics); Management science; Operations research; Theoretical computer science; Artificial intelligence; Mathematics; Machine learning; Engineering; Political science; Statistics","score_opus":0.08993451194551573,"score_gpt":0.3043777798751,"score_spread":0.2144432679295843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942161359","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.41818935,0.00022603663,0.57726914,0.000092823044,0.0008001786,0.0018079061,0.00008756343,0.00004785335,0.0014791508],"genre_scores_gemma":[0.99466175,0.000034981014,0.00007327462,0.00003544852,0.000042588174,0.00049160473,0.0000020410905,0.000013967642,0.004644317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979552,0.00022376582,0.0006213887,0.00041304546,0.000543178,0.00024343647],"domain_scores_gemma":[0.99814546,0.00092211727,0.00016170947,0.00058143475,0.00011566273,0.00007362043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021440042,0.00017695656,0.0003008202,0.0002880428,0.00014888524,0.00032928181,0.00044713967,0.00012356028,0.0000065318163],"category_scores_gemma":[0.000019235944,0.0001203175,0.00009326293,0.00042479965,0.000057420257,0.00013803276,0.0000020020234,0.00018394555,0.00008723912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037967417,0.0000667659,0.00007803495,0.00007753798,0.000019872929,3.9638994e-7,0.002864441,0.9645962,0.0006925986,0.030589003,0.00044207295,0.00053509086],"study_design_scores_gemma":[0.00047228465,0.0000986283,0.00013722708,0.00010995113,0.000020685564,0.000017049575,0.005706864,0.9870192,0.00006841229,0.0011828945,0.0049905,0.00017634309],"about_ca_topic_score_codex":0.00015415851,"about_ca_topic_score_gemma":0.00011330802,"teacher_disagreement_score":0.5771959,"about_ca_system_score_codex":0.000029548268,"about_ca_system_score_gemma":0.000026774256,"threshold_uncertainty_score":0.49064052},"labels":[],"label_agreement":null},{"id":"W2946264095","doi":"10.1007/s11518-019-5412-1","title":"Theory and Implementation of Sensitivity Analyses Based on Their Algebraic Representation in the Graph Model","year":2019,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Robustness (evolution); Sensitivity (control systems); Algebraic number; Preference; Ranking (information retrieval); Representation (politics); Graph; Stability (learning theory); Mathematics; Computer science; Management science; Mathematical optimization; Theoretical computer science; Artificial intelligence; Machine learning; Engineering; Political science; Statistics","score_opus":0.092651408927795,"score_gpt":0.3960892609317907,"score_spread":0.3034378520039957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946264095","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.9623311,0.00016019278,0.03691314,0.00006666805,0.00015005848,0.0002560205,0.0000046699197,0.0000030408253,0.00011510123],"genre_scores_gemma":[0.99988425,0.0000069359503,0.00004784585,0.000015640344,0.000025753421,0.000005452495,1.6720298e-7,0.000003086309,0.000010878045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997659,0.00037546514,0.000666456,0.00017769719,0.000997546,0.00012382863],"domain_scores_gemma":[0.997022,0.0018490658,0.00047205127,0.00026789765,0.00033987954,0.000049151848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022371585,0.00008367015,0.00027450308,0.0006412663,0.00007447405,0.00020688657,0.00025452577,0.000025164061,0.0000010032169],"category_scores_gemma":[0.00048100855,0.00004575303,0.00004422401,0.001050493,0.00008739423,0.0004773554,0.000020842037,0.00009775141,7.79171e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017899385,0.000016659325,0.007820568,0.00004217473,0.000008310842,0.0000019687134,0.0024922937,0.80137396,0.1522356,0.035333414,0.000018186274,0.0006389876],"study_design_scores_gemma":[0.00031833895,0.000094295625,0.031371217,0.00016830265,0.0000114403365,0.00008761033,0.029238217,0.9346782,0.0024020951,0.0015318665,0.000016679865,0.000081763814],"about_ca_topic_score_codex":0.000039471786,"about_ca_topic_score_gemma":0.0000030161284,"teacher_disagreement_score":0.1498335,"about_ca_system_score_codex":0.000025553367,"about_ca_system_score_gemma":0.000077380784,"threshold_uncertainty_score":0.7753589},"labels":[],"label_agreement":null},{"id":"W2949349208","doi":"","title":"Computing Nash Equilibria of Action-Graph Games","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of British Columbia; University of Toronto","funders":"","keywords":"Stochastic game; Nash equilibrium; Mathematics; Combinatorial game theory; Exponential function; Bottleneck; Graph; Bounded function; Speedup; Jacobian matrix and determinant; Mathematical economics; Computer science; Discrete mathematics; Game theory; Repeated game; Applied mathematics","score_opus":0.32713167296990053,"score_gpt":0.3054930029610973,"score_spread":0.021638670008803207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949349208","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.9056064,0.00007154702,0.08371239,0.000051565137,0.00048994215,0.00020373358,0.000039256425,0.00008054784,0.009744642],"genre_scores_gemma":[0.9963186,0.00003457502,0.00031405027,0.000028082104,0.00012757604,4.130265e-7,0.000010659905,0.000013706994,0.0031523858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979173,0.00031742934,0.000450059,0.00078161806,0.00023568024,0.0002979351],"domain_scores_gemma":[0.99626845,0.0010690376,0.00076031376,0.0013946524,0.0003339798,0.00017354228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001482516,0.00023172672,0.00044841834,0.00041017515,0.00015877686,0.00007516799,0.0016517421,0.00025018989,0.00057906494],"category_scores_gemma":[0.00027110332,0.00022798963,0.00036539588,0.0010585043,0.0003357848,0.00025767717,0.0013500069,0.00043244104,0.00041947744],"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.00016380973,0.00049094745,0.065175764,0.00010537035,0.00027641313,0.000020163316,0.0014512311,0.16349918,0.0040531643,0.75126666,0.0028384996,0.010658802],"study_design_scores_gemma":[0.00046313732,0.000031081017,0.02609234,0.00010277725,0.00019269633,0.0000055127857,0.0020982747,0.035502832,0.0017736501,0.9270126,0.006112547,0.0006125065],"about_ca_topic_score_codex":0.000045057328,"about_ca_topic_score_gemma":0.000017160946,"teacher_disagreement_score":0.17574598,"about_ca_system_score_codex":0.000048906113,"about_ca_system_score_gemma":0.00010884058,"threshold_uncertainty_score":0.92971474},"labels":[],"label_agreement":null},{"id":"W2949630205","doi":"10.48550/arxiv.1404.1404","title":"On the Existence of Optimal Policies for a Class of Static and Sequential Dynamic Teams","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Counterexample; Linear-quadratic-Gaussian control; Class (philosophy); Mathematical optimization; Computer science; Gaussian; Optimal control; Stochastic control; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.1672781236571483,"score_gpt":0.2928390473530608,"score_spread":0.1255609236959125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949630205","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.8890545,0.0000067983297,0.10869321,0.00019873044,0.000053776796,0.00035322114,0.00014246503,0.000010185256,0.0014871458],"genre_scores_gemma":[0.9982518,0.000015279704,0.0003321252,0.000047178346,0.000009491888,0.000002655086,0.0000045105676,0.00000678309,0.0013302028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987867,0.00019578,0.0002889048,0.00044526346,0.00014371348,0.00013963343],"domain_scores_gemma":[0.9959355,0.0024543519,0.00051280693,0.000814727,0.00023092517,0.000051678253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010750158,0.00013778453,0.00030952075,0.00016645438,0.00010800739,0.000034238215,0.0009844428,0.00009886988,0.000035576497],"category_scores_gemma":[0.000491101,0.00010057692,0.00015487632,0.00027321366,0.00066104886,0.000051952084,0.0004435611,0.00016513873,0.000010619381],"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.00010952141,0.000048364804,0.00013846021,0.000038627237,0.000033905275,7.1579586e-7,0.00050380605,0.09367086,0.00047653168,0.90458524,0.00011120147,0.00028276807],"study_design_scores_gemma":[0.00024042305,0.00011661485,0.000615625,0.000059090766,0.00007081256,8.677826e-7,0.0017406989,0.17140028,0.0005745799,0.8248995,0.0001583758,0.00012314825],"about_ca_topic_score_codex":0.00005041323,"about_ca_topic_score_gemma":0.000025854733,"teacher_disagreement_score":0.1091973,"about_ca_system_score_codex":0.00003019283,"about_ca_system_score_gemma":0.00008751153,"threshold_uncertainty_score":0.4101408},"labels":[],"label_agreement":null},{"id":"W2950418112","doi":"10.48550/arxiv.1207.0043","title":"Routing Regardless of Network Stability","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McGill University","funders":"","keywords":"Network packet; Cardinality (data modeling); Computer science; Path (computing); Hop (telecommunications); Routing (electronic design automation); Node (physics); Combinatorics; Constant (computer programming); Filter (signal processing); Computer network; Mathematics; Discrete mathematics; Physics","score_opus":0.3382813095999753,"score_gpt":0.27628781150557985,"score_spread":0.06199349809439547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950418112","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.89305395,0.00005372153,0.0846831,0.000048514226,0.00037418757,0.00026468126,0.0000455928,0.000056342204,0.021419903],"genre_scores_gemma":[0.9978636,0.00001569811,0.0002700538,0.000022061633,0.00016197591,8.4519326e-7,0.000008262198,0.000011300738,0.0016462016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754226,0.00053197483,0.0005002334,0.00084635126,0.00022336554,0.00035578327],"domain_scores_gemma":[0.9953675,0.0012815368,0.0007607391,0.0020167811,0.00040017065,0.0001732169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038207676,0.00021222657,0.00048269395,0.000113353286,0.00017884799,0.000052683383,0.0017520159,0.00025901129,0.0007225397],"category_scores_gemma":[0.0005268851,0.00020379505,0.0003063927,0.0009004411,0.00033339654,0.00018121644,0.0016092749,0.00047674647,0.00024091773],"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.00009001478,0.0001752531,0.10522939,0.000030582607,0.0000611916,0.000006461614,0.0005883246,0.15690748,0.000082508275,0.73478484,0.00060384447,0.0014401072],"study_design_scores_gemma":[0.00025559322,0.000016603251,0.022829236,0.00007073952,0.00013019056,0.0000013095657,0.0011883721,0.017813379,0.00051591377,0.95471513,0.0020560736,0.00040748506],"about_ca_topic_score_codex":0.000060236256,"about_ca_topic_score_gemma":0.000041532774,"teacher_disagreement_score":0.21993028,"about_ca_system_score_codex":0.00007941354,"about_ca_system_score_gemma":0.00012359688,"threshold_uncertainty_score":0.8310521},"labels":[],"label_agreement":null},{"id":"W2951160244","doi":"","title":"The price of re-establishing perfect, almost perfect or public monitoring in games with arbitrary monitoring","year":2011,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science","score_opus":0.07976379573191911,"score_gpt":0.29391966680053505,"score_spread":0.21415587106861594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951160244","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.92039293,0.00050972047,0.006995103,0.0020991035,0.00013098055,0.00032967373,0.000006571349,0.00008622448,0.06944969],"genre_scores_gemma":[0.98396933,0.00018919008,0.01184063,0.000011692951,0.000027395217,0.000079313395,0.0000034374846,0.00002454238,0.0038544857],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99346894,0.003939593,0.0007256551,0.0005893188,0.00084458804,0.00043190905],"domain_scores_gemma":[0.9860674,0.00954287,0.0005423306,0.0020648863,0.001614654,0.00016781843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016362391,0.00020788904,0.0002880499,0.00026529576,0.0006732967,0.0006179549,0.0022050107,0.00008888234,0.00014403024],"category_scores_gemma":[0.007691346,0.00013395048,0.00009692818,0.002018754,0.00041731828,0.00082290405,0.0004144528,0.0004154775,0.000030419238],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023716337,0.0011602426,0.5880225,0.000048273225,0.000078490084,0.000016380905,0.07122807,0.0000349604,0.012110709,0.1455028,0.00026037206,0.18130009],"study_design_scores_gemma":[0.0014609932,0.000009785739,0.47368452,0.0018131818,0.000047366488,0.000055949404,0.026280016,0.0020053932,0.44974232,0.026066223,0.01797107,0.00086317735],"about_ca_topic_score_codex":0.0004574757,"about_ca_topic_score_gemma":0.0007483777,"teacher_disagreement_score":0.4376316,"about_ca_system_score_codex":0.00006217254,"about_ca_system_score_gemma":0.0002303567,"threshold_uncertainty_score":0.92078155},"labels":[],"label_agreement":null},{"id":"W2951278380","doi":"10.48550/arxiv.1206.3261","title":"Learning When to Take Advice: A Statistical Test for Achieving A\\n Correlated Equilibrium","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Advice (programming); Mediator; Test (biology); Computer science; Relation (database); Limit (mathematics); Artificial intelligence; Machine learning; Mathematics; Data mining; Medicine","score_opus":0.17420875427374777,"score_gpt":0.29092690823734163,"score_spread":0.11671815396359386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951278380","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.4515531,0.00002601932,0.53952044,0.000310916,0.00040915428,0.00085116376,0.00030075383,0.00025695545,0.006771453],"genre_scores_gemma":[0.9745378,0.000004142179,0.0032003573,0.0001204502,0.00015417437,0.000009354062,0.00008163337,0.000034880683,0.021857193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971506,0.00030653135,0.00048823684,0.0012380569,0.00024689865,0.0005696918],"domain_scores_gemma":[0.9922129,0.0053546457,0.000415765,0.0010863001,0.00044476596,0.00048561668],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020274646,0.00032966194,0.0004956345,0.00034866706,0.0003264538,0.00022952336,0.0016261924,0.0003327944,0.00091820187],"category_scores_gemma":[0.0044652475,0.0003339769,0.00022253019,0.00070004625,0.00016964287,0.00025868692,0.0014909328,0.00080829335,0.0017575218],"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.000748765,0.00076580106,0.05699402,0.0001385056,0.00022664251,0.000080137346,0.004097958,0.43184742,0.002773068,0.46764117,0.022166133,0.012520352],"study_design_scores_gemma":[0.0014657035,0.0004400301,0.018325288,0.00023410964,0.00061445247,0.000013858439,0.0030887874,0.31914487,0.00019043648,0.5675693,0.08711837,0.0017947811],"about_ca_topic_score_codex":0.000040141134,"about_ca_topic_score_gemma":0.000022879925,"teacher_disagreement_score":0.5363201,"about_ca_system_score_codex":0.00012894576,"about_ca_system_score_gemma":0.00015749093,"threshold_uncertainty_score":0.9999951},"labels":[],"label_agreement":null},{"id":"W2951316052","doi":"10.48550/arxiv.1109.6064","title":"A General Framework for Computing Optimal Correlated Equilibria in Compact Games","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of British Columbia","funders":"","keywords":"Mathematical optimization; Singleton; Computer science; Optimization problem; Mathematics; Mathematical economics","score_opus":0.2736022596017071,"score_gpt":0.30769659708317476,"score_spread":0.034094337481467674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951316052","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.63909703,0.000026682896,0.3575158,0.000050960116,0.0003241426,0.00043199322,0.000046668,0.00007681977,0.0024298604],"genre_scores_gemma":[0.991444,0.000011507108,0.0060581416,0.000073399766,0.00011361264,0.0000014600427,0.000029654986,0.000025464951,0.0022427598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720895,0.00032434703,0.00055873353,0.0012792626,0.00015987284,0.00046882886],"domain_scores_gemma":[0.9958336,0.0018893265,0.00057608384,0.0012619738,0.00024516278,0.00019389312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015131094,0.00033299497,0.0006208113,0.00046828957,0.00017785787,0.00015818495,0.0019674485,0.00049926655,0.00035554002],"category_scores_gemma":[0.00066904817,0.00033745536,0.00036437626,0.0009985829,0.0002614296,0.00018269398,0.000903837,0.0008414344,0.00026013766],"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.00023483727,0.00014113488,0.007792894,0.000012532544,0.00004977718,0.000030801693,0.00073506916,0.39983827,0.000060435494,0.5898905,0.0006277635,0.00058600685],"study_design_scores_gemma":[0.0003636885,0.00003459072,0.004889362,0.00008121814,0.000039140465,0.000002140251,0.00032090544,0.424903,0.00006148921,0.56862795,0.000388747,0.00028779666],"about_ca_topic_score_codex":0.00011615614,"about_ca_topic_score_gemma":0.000023810522,"teacher_disagreement_score":0.35234696,"about_ca_system_score_codex":0.00011688734,"about_ca_system_score_gemma":0.00016540583,"threshold_uncertainty_score":0.99990773},"labels":[],"label_agreement":null},{"id":"W2951447937","doi":"10.48550/arxiv.1109.6182","title":"Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of British Columbia","funders":"","keywords":"Rank (graph theory); Mathematics; Bilinear interpolation; Nash equilibrium; Combinatorics; Time complexity; Bayesian game; Constant (computer programming); Game theory; Mathematical economics; Sequential game; Computer science; Statistics","score_opus":0.28405265272718155,"score_gpt":0.28447957063642715,"score_spread":0.00042691790924559436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951447937","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.47839853,0.000048840448,0.50689834,0.00032539456,0.0007484991,0.0015065273,0.0006897023,0.00030566414,0.011078498],"genre_scores_gemma":[0.97432065,0.000015464677,0.0026743838,0.00015137505,0.00023846398,0.000010118568,0.00007294259,0.000034457673,0.022482147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971017,0.00028716444,0.0004764792,0.0015150917,0.00021133685,0.00040817793],"domain_scores_gemma":[0.99501956,0.0018672158,0.00050255615,0.0018513129,0.00050818705,0.00025115188],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016562081,0.0003699304,0.0005836672,0.00047887748,0.00027042488,0.0001644024,0.0023118844,0.00040605862,0.0015457687],"category_scores_gemma":[0.00065406715,0.00034908924,0.00059429806,0.0007387887,0.0003753507,0.00020587372,0.0006156844,0.00039611003,0.0018933441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007096814,0.0042550554,0.007970274,0.0003940379,0.0012825947,0.00039077204,0.0022619932,0.393865,0.0060941535,0.36813384,0.17647716,0.031778336],"study_design_scores_gemma":[0.0023176095,0.00020438682,0.00077180483,0.000069725866,0.00035378366,0.0000033125646,0.0004029399,0.47527218,0.0035964681,0.45396778,0.061882094,0.0011579302],"about_ca_topic_score_codex":0.000058768415,"about_ca_topic_score_gemma":0.00001805036,"teacher_disagreement_score":0.50422394,"about_ca_system_score_codex":0.000094576615,"about_ca_system_score_gemma":0.0004346093,"threshold_uncertainty_score":0.9998961},"labels":[],"label_agreement":null},{"id":"W2951851225","doi":"10.1287/moor.2020.1107","title":"Terminal Ranking Games","year":2019,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Tournament; Ranking (information retrieval); Mathematical economics; Yield (engineering); Price of anarchy; Welfare; Value (mathematics); Terminal (telecommunication); Mathematics; Economics; Field (mathematics); Mathematical optimization; Computer science; Microeconomics; Statistics; Combinatorics; Artificial intelligence; Price of stability; Pure mathematics; Physics","score_opus":0.4655700130287429,"score_gpt":0.5634740402351454,"score_spread":0.09790402720640246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951851225","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.87129146,0.00021459954,0.06509782,0.0018074658,0.00024258856,0.0019048335,0.00017878815,0.0000421236,0.059220325],"genre_scores_gemma":[0.9507419,0.0000284014,0.028826155,0.000013222725,0.00009425345,0.00022870595,0.000023006152,0.000023773742,0.02002059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943704,0.0005799982,0.0012016598,0.0005946959,0.0029170807,0.00033619243],"domain_scores_gemma":[0.99155545,0.0033987719,0.00016550692,0.0025867717,0.0022012766,0.00009222584],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.013355672,0.00018397011,0.00055910746,0.00091280194,0.00033999162,0.00078671443,0.0026038068,0.00022462088,0.0015683952],"category_scores_gemma":[0.0063007907,0.00013978878,0.00020074092,0.0008335363,0.00044030003,0.00015111324,0.0019260594,0.0009922463,0.0020439273],"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.00003189983,0.0015026528,0.00048819502,0.0008378186,0.00014697573,0.000010007926,0.019509017,0.14057072,0.012013022,0.7911937,0.014928828,0.01876716],"study_design_scores_gemma":[0.00024414924,0.00007129134,0.0003875135,0.00042247018,0.000025494139,0.000016170005,0.0047116373,0.15285715,0.0063920533,0.8309467,0.003617638,0.00030771003],"about_ca_topic_score_codex":0.000027623946,"about_ca_topic_score_gemma":0.000029876093,"teacher_disagreement_score":0.079450436,"about_ca_system_score_codex":0.000051220406,"about_ca_system_score_gemma":0.0005521989,"threshold_uncertainty_score":0.9993443},"labels":[],"label_agreement":null},{"id":"W2952034745","doi":"10.1016/j.disc.2016.12.019","title":"Cops and Robbers ordinals of cop-win trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université de Montréal; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Graph; Product (mathematics); Geometry","score_opus":0.13995372355013674,"score_gpt":0.42885959388119516,"score_spread":0.2889058703310584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952034745","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.91230506,0.000058618592,0.016703367,0.0012337777,0.00005433405,0.00021114388,0.000042674103,0.000020284497,0.069370724],"genre_scores_gemma":[0.98789394,0.00001040079,0.00794776,0.000023159177,0.000017744476,0.000008984457,0.0000011222644,0.0000071594427,0.0040897354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988696,0.00003821444,0.00040406905,0.00018230989,0.0003883189,0.00011747611],"domain_scores_gemma":[0.9975724,0.00072483753,0.00046779806,0.0010661241,0.0000989541,0.00006986335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013484658,0.000090995745,0.0002745489,0.00005348867,0.0002777112,0.00022449638,0.00073948735,0.000039354833,0.00021440873],"category_scores_gemma":[0.0018595733,0.00006110156,0.00006485392,0.000079488855,0.00039322485,0.0001729057,0.0001818668,0.00005205004,0.00009714057],"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.00001830639,0.00011842701,0.0054820534,0.00004736649,0.00004258594,0.0000027297513,0.0053735897,0.00004379427,0.0043651834,0.9663155,0.005477676,0.012712803],"study_design_scores_gemma":[0.00029041502,0.000044045348,0.009521018,0.00006369836,0.000036470996,0.000008927624,0.003953852,0.0029383467,0.0044032275,0.9746359,0.0039492003,0.0001549131],"about_ca_topic_score_codex":0.000007573314,"about_ca_topic_score_gemma":0.000015965978,"teacher_disagreement_score":0.07558886,"about_ca_system_score_codex":0.0000036920735,"about_ca_system_score_gemma":0.000014407682,"threshold_uncertainty_score":0.24916492},"labels":[],"label_agreement":null},{"id":"W2952084589","doi":"10.1016/j.ejor.2019.05.036","title":"The return function: A new computable perspective on Bayesian–Nash equilibria","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Bayesian probability; Mathematical economics; Computer science; Outcome (game theory); Function (biology); Mathematical optimization; Bayesian game; Convergence (economics); Best response; Perspective (graphical); Mathematics; Economics; Game theory; Artificial intelligence; Repeated game","score_opus":0.20200591777418922,"score_gpt":0.4604277054761807,"score_spread":0.25842178770199153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952084589","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3267274,0.0006699938,0.018660473,0.06670425,0.0010191838,0.000554641,0.000008808318,0.000017845587,0.5856374],"genre_scores_gemma":[0.937362,0.000016573986,0.00045388652,0.00032257938,0.00093596353,0.0000010252072,8.094375e-7,0.000014676762,0.060892455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932264,0.0027210067,0.0006348646,0.0002755224,0.0028688542,0.00027334294],"domain_scores_gemma":[0.9921893,0.004192054,0.00020158339,0.0004989309,0.0026872554,0.0002308975],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.022226304,0.00009494111,0.00015874964,0.0002468281,0.0007047158,0.0010641254,0.0013523843,0.000018985553,0.0025517982],"category_scores_gemma":[0.003798178,0.000052679625,0.00012564451,0.00085377856,0.0001879143,0.00040349402,0.00019086341,0.0007612091,0.005435074],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009156166,0.00010129589,0.00040872875,8.9438663e-7,0.000053573145,0.000028701279,0.00086362445,0.0043982966,0.0052030897,0.6988397,0.274452,0.014734488],"study_design_scores_gemma":[0.0012827584,0.0019580454,0.014618803,0.000058842255,0.0000073676906,0.00015246884,0.0050343308,0.0056254156,0.00041694162,0.2229211,0.7477581,0.0001658142],"about_ca_topic_score_codex":0.0000030929314,"about_ca_topic_score_gemma":0.000001899202,"teacher_disagreement_score":0.6106346,"about_ca_system_score_codex":0.00011384299,"about_ca_system_score_gemma":0.0006044397,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2952250066","doi":"10.1145/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Distributed computing; Resource allocation; Distributed algorithm; Mathematical optimization; Load balancing (electrical power); Martingale (probability theory); Multi-agent system; Mathematics; Computer network; Artificial intelligence","score_opus":0.015425297057347168,"score_gpt":0.28647595615258414,"score_spread":0.27105065909523696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952250066","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.9316576,0.00023506154,0.0032402715,0.021782335,0.00085208664,0.0021747455,0.0046661,0.0005012463,0.034890566],"genre_scores_gemma":[0.9876739,0.000015993804,0.0023379377,0.00034182126,0.0005462998,0.000104966486,0.000078499346,0.00005758542,0.008842991],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99363214,0.00008716414,0.0014409383,0.0011364166,0.002833466,0.00086984964],"domain_scores_gemma":[0.995555,0.00055825134,0.0011419615,0.0010067594,0.0014725479,0.00026548092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025753386,0.0005540891,0.000705285,0.00022664641,0.00068857113,0.0004048674,0.0038850363,0.00021597849,0.0001054771],"category_scores_gemma":[0.0011755624,0.0003728855,0.00060918235,0.0018685303,0.00046066352,0.0008327718,0.001114332,0.0005195237,0.0003306142],"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.000684799,0.0037303534,0.0595573,0.0002749593,0.0005493303,0.000014451261,0.0060575204,0.0019203367,0.04693817,0.12061463,0.7266488,0.03300935],"study_design_scores_gemma":[0.004476578,0.0008879933,0.08070387,0.00074426265,0.00048074604,0.00016220384,0.013920694,0.007289282,0.14767268,0.36995468,0.37098047,0.0027265565],"about_ca_topic_score_codex":0.00010168669,"about_ca_topic_score_gemma":0.000007803882,"teacher_disagreement_score":0.35566834,"about_ca_system_score_codex":0.00021665923,"about_ca_system_score_gemma":0.00010820774,"threshold_uncertainty_score":0.9998723},"labels":[],"label_agreement":null},{"id":"W2952508571","doi":"10.48550/arxiv.1011.0253","title":"Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Oracle; Computation; Time complexity; Polynomial; Ellipsoid; Algorithm; Computer science; Mathematics; Product (mathematics); Applied mathematics; Mathematical optimization","score_opus":0.12872411835140268,"score_gpt":0.27288816604308913,"score_spread":0.14416404769168645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952508571","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.9847666,0.000027619502,0.0062048156,0.000114021896,0.00030229127,0.00036535366,0.00007068938,0.00006390996,0.008084706],"genre_scores_gemma":[0.99686396,0.00000904097,0.000084109975,0.000018176188,0.000034693057,4.200149e-7,0.000033098793,0.000015945021,0.0029405728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976236,0.00040731512,0.0006117486,0.00087565137,0.00021966752,0.00026198762],"domain_scores_gemma":[0.9966761,0.0010943655,0.0007853199,0.0010132818,0.00028647284,0.00014444867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013586718,0.000261215,0.0006098869,0.00069258176,0.000060968665,0.000080659716,0.0013824566,0.00042243878,0.0005403459],"category_scores_gemma":[0.00037845375,0.00026563244,0.00024713296,0.0011972995,0.00036857583,0.00023670294,0.0005631009,0.00081253855,0.000624014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028295143,0.00034647476,0.012514801,0.000027057491,0.000057939644,0.000042886542,0.0005461289,0.9686823,0.0077629443,0.0052536167,0.0033028026,0.0011800912],"study_design_scores_gemma":[0.0012078485,0.000078729405,0.049313203,0.00016692832,0.00009482157,0.0000056927843,0.00044070702,0.83011323,0.002072227,0.11495023,0.0009466152,0.00060976285],"about_ca_topic_score_codex":0.0002049269,"about_ca_topic_score_gemma":0.0000495929,"teacher_disagreement_score":0.13856907,"about_ca_system_score_codex":0.0000821901,"about_ca_system_score_gemma":0.0002077341,"threshold_uncertainty_score":0.9999796},"labels":[],"label_agreement":null},{"id":"W2952573423","doi":"10.48550/arxiv.1305.5170","title":"A Truth Serum for Sharing Rewards","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Intuition; Incentive; Mechanism (biology); Incentive compatibility; Microeconomics; Group decision-making; Population; Mechanism design; Computer science; Economics; Psychology; Social psychology; Cognitive science; Medicine","score_opus":0.315247369855961,"score_gpt":0.28854124564586925,"score_spread":0.026706124210091775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952573423","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.8498894,0.000019862247,0.1336197,0.00023685006,0.0005043142,0.0006902202,0.00016151785,0.00013745794,0.014740708],"genre_scores_gemma":[0.9699343,0.000016677588,0.00047785425,0.00008291385,0.000130812,0.000010506799,0.000015901207,0.000020621706,0.029310431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762666,0.00010033702,0.00035421274,0.0014055918,0.00017154343,0.00034162973],"domain_scores_gemma":[0.99621016,0.000954673,0.00038446742,0.0018385488,0.00041367314,0.000198491],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013544956,0.00025497525,0.00039276673,0.00030591726,0.00027250528,0.00027531263,0.0025468494,0.00028203343,0.0009323185],"category_scores_gemma":[0.00065262994,0.000243873,0.0003740229,0.0005972322,0.00015173938,0.00025485462,0.0015395844,0.00036890508,0.0011783671],"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.00005071551,0.000069747635,0.0025789707,0.000026744594,0.00005681532,0.000009323657,0.00020355295,0.037242778,0.00003880478,0.95443386,0.0031026334,0.0021860397],"study_design_scores_gemma":[0.00029163968,0.000022781449,0.0017888023,0.000029027931,0.00005747713,0.0000012246627,0.00036791957,0.07110431,0.00013901477,0.91749495,0.008418576,0.00028428732],"about_ca_topic_score_codex":0.000039058745,"about_ca_topic_score_gemma":0.000015345813,"teacher_disagreement_score":0.13314185,"about_ca_system_score_codex":0.00009310332,"about_ca_system_score_gemma":0.00011098545,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W2952884488","doi":"10.48550/arxiv.1501.00994","title":"Online Reputation and Polling Systems: Data Incest, Social Learning and Revealed Preferences","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polling; Overconfidence effect; Polling system; Computer science; Reputation; Parsing; Social learning; Misinformation; Graph; Machine learning; Social psychology; Artificial intelligence; Psychology; Computer security; Theoretical computer science; Knowledge management","score_opus":0.5043780155849001,"score_gpt":0.3403517486627036,"score_spread":0.16402626692219652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952884488","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.9826729,0.0003790022,0.0146567365,0.0001265402,0.00012617542,0.00026304307,0.0002105518,0.00007372107,0.001491298],"genre_scores_gemma":[0.99660873,0.00025995015,0.00021452704,0.000012206462,0.00013817546,7.810333e-7,0.00018156499,0.0000094590005,0.002574629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752825,0.0005917652,0.00034858708,0.0011544941,0.00020836681,0.00016854606],"domain_scores_gemma":[0.99763596,0.00067452213,0.0005711262,0.00065072224,0.0003324894,0.00013520221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025426492,0.00018837384,0.00036493645,0.00022150247,0.00037180193,0.00033521382,0.0010014687,0.0002155146,0.000017271996],"category_scores_gemma":[0.0008693999,0.00017864986,0.000032913114,0.0004536414,0.00026513607,0.000422285,0.002053038,0.00048200713,0.000020128156],"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.000744845,0.0007077473,0.17789027,0.00067452114,0.0005960366,0.00020573392,0.014157461,0.27923435,0.00025915555,0.4654296,0.0045659225,0.055534348],"study_design_scores_gemma":[0.00073692284,0.00007434963,0.01157898,0.00020497998,0.0002618003,0.000013896125,0.021475827,0.45450643,0.0000037892685,0.5033421,0.007149206,0.0006517525],"about_ca_topic_score_codex":0.00015314437,"about_ca_topic_score_gemma":0.00010021197,"teacher_disagreement_score":0.17527206,"about_ca_system_score_codex":0.00004369523,"about_ca_system_score_gemma":0.00015451568,"threshold_uncertainty_score":0.728513},"labels":[],"label_agreement":null},{"id":"W2953243100","doi":"10.1609/aaai.v24i1.7623","title":"An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Hypercube; Subgame perfect equilibrium; Discounting; Set (abstract data type); Stochastic game; Computation; Point (geometry); Integer (computer science); Mathematical optimization; Computer science; Mathematics; Mathematical economics; Algorithm; Discrete mathematics; Nash equilibrium","score_opus":0.06554374621527588,"score_gpt":0.40725136163083653,"score_spread":0.34170761541556066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953243100","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.46197596,0.0000019249874,0.5296347,0.00040252897,0.00010082804,0.00071909855,0.000016143367,0.00020393504,0.006944881],"genre_scores_gemma":[0.9450585,2.2481927e-7,0.052662775,0.00013685926,0.00007330986,0.000329213,0.000029374427,0.0000145173435,0.001695207],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984151,0.000113012204,0.00043078634,0.00049604697,0.00032875998,0.00021626402],"domain_scores_gemma":[0.9977789,0.00085816236,0.00015521198,0.0007384494,0.0003517491,0.0001175057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032286502,0.00012260045,0.00018680892,0.00015857168,0.00014154032,0.00025096166,0.00059866125,0.00010803094,0.0003956655],"category_scores_gemma":[0.0006974654,0.00008766398,0.00008973645,0.00048866443,0.00013730099,0.00037573426,0.000045511926,0.0001424859,0.00013954459],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035586065,0.00009402314,0.00035396364,0.0000031854906,0.0000035401376,2.9551728e-7,0.000143077,0.00013146827,0.9236635,0.056171075,0.0016780248,0.01772225],"study_design_scores_gemma":[0.00027858344,0.00016086486,0.0013199531,0.0000032665318,0.000009583887,0.000018990728,0.00025012923,0.04638037,0.48169976,0.46336943,0.00629069,0.00021836426],"about_ca_topic_score_codex":0.000009944022,"about_ca_topic_score_gemma":0.000019472505,"teacher_disagreement_score":0.48308256,"about_ca_system_score_codex":0.0000066039534,"about_ca_system_score_gemma":0.00003675953,"threshold_uncertainty_score":0.433226},"labels":[],"label_agreement":null},{"id":"W2963350743","doi":"10.1016/j.tcs.2018.10.004","title":"Hyperopic Cops and Robbers","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Mount Saint Vincent University; St. Francis Xavier University; Acadia University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Swedish Foundation for International Cooperation in Research and Higher Education; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Countable set; Graph; Discrete mathematics","score_opus":0.049682151329604775,"score_gpt":0.36727250725716903,"score_spread":0.31759035592756424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963350743","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.61164373,0.000007975864,0.3647285,0.0015543328,0.0002365076,0.000077744495,0.0000012892266,0.00004765423,0.021702247],"genre_scores_gemma":[0.982138,9.519217e-7,0.016774112,0.0008080137,0.00017755218,0.00000269248,1.02229244e-7,0.0000032673704,0.0000953383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803513,0.00010559336,0.0002354621,0.00056143984,0.00076612615,0.0002962403],"domain_scores_gemma":[0.99805033,0.00073478743,0.000047615456,0.0006451702,0.0002823784,0.00023970788],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033315697,0.000088786626,0.00013191321,0.00013076524,0.0005966291,0.00041135473,0.0012860844,0.000027914532,0.0005867999],"category_scores_gemma":[0.0005349762,0.00005858091,0.000025924704,0.0011497937,0.012457889,0.00026238605,0.00054691115,0.0000860377,0.0010308586],"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.000004887032,0.000011845428,0.00018339464,2.5757262e-7,5.921158e-7,5.5852644e-7,0.00027033346,0.0000026917062,0.0007837351,0.94741327,0.00016870759,0.05115974],"study_design_scores_gemma":[0.00009632947,0.000143496,0.005539655,0.000004450923,0.0000026464136,0.000025076186,0.000039754297,0.033218354,0.0032787772,0.95495325,0.0025945383,0.00010366687],"about_ca_topic_score_codex":9.3794335e-7,"about_ca_topic_score_gemma":6.7594686e-7,"teacher_disagreement_score":0.37049425,"about_ca_system_score_codex":0.000011410193,"about_ca_system_score_gemma":0.0000445691,"threshold_uncertainty_score":0.999747},"labels":[],"label_agreement":null},{"id":"W2965766684","doi":"10.3982/te4782","title":"Value‐based distance between information structures","year":2022,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada; Agence Nationale de la Recherche","keywords":"Sequence (biology); Information structure; Countable set; Value (mathematics); Mathematics; Convergence (economics); Zero (linguistics); Space (punctuation); Computer science; Relation (database); Theoretical computer science; Discrete mathematics; Data mining; Statistics","score_opus":0.040701817455639125,"score_gpt":0.3246616254124349,"score_spread":0.28395980795679576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965766684","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.83411676,0.000008098717,0.101870716,0.0039420673,0.00019515592,0.00024217801,0.0004914222,0.00006954415,0.05906405],"genre_scores_gemma":[0.9977109,6.376601e-7,0.00093731855,0.00114608,0.000054254044,0.000035299512,0.00004579212,0.000006101119,0.000063654166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986804,0.0001992956,0.0004975465,0.00020033849,0.0002445729,0.00017781196],"domain_scores_gemma":[0.9978434,0.0012991838,0.00017319141,0.000545554,0.000038992213,0.00009967682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019037724,0.00009126093,0.00017811942,0.00009745698,0.00036849198,0.00015667215,0.00083302706,0.00003152036,0.0050062006],"category_scores_gemma":[0.0004286605,0.0000788596,0.000082539256,0.00022126155,0.00041957735,0.00024333854,0.00019818994,0.00018373494,0.00040327298],"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.000030121117,0.000007772929,0.00034470594,6.394787e-7,0.0000032672783,7.872065e-8,0.00011697772,0.009334422,0.000002554758,0.9754269,0.00027851018,0.014454017],"study_design_scores_gemma":[0.0001618226,0.000030774714,0.0014280466,3.4947587e-7,0.0000063672624,8.3814837e-7,0.00029162856,0.010595399,0.00014380642,0.9102107,0.07703442,0.00009584087],"about_ca_topic_score_codex":0.0000013521626,"about_ca_topic_score_gemma":3.001854e-7,"teacher_disagreement_score":0.1635941,"about_ca_system_score_codex":0.00007121806,"about_ca_system_score_gemma":0.00006306151,"threshold_uncertainty_score":0.9959034},"labels":[],"label_agreement":null},{"id":"W2972117706","doi":"10.14288/1.0380773","title":"Essays in econometrics","year":2019,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","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":"University of British Columbia","funders":"","keywords":"Econometrics; Economics","score_opus":0.03772798151722331,"score_gpt":0.23874132984965846,"score_spread":0.20101334833243514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972117706","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.9553382,0.000033313445,0.0004105971,0.00009814209,0.00007301841,0.00013694548,0.00005833856,0.000015834694,0.04383565],"genre_scores_gemma":[0.99342674,0.00001691233,0.00021497991,0.000030995987,0.00000627381,3.162978e-7,0.0000025683512,0.0000034735313,0.006297768],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99903405,0.000063735344,0.00015308392,0.00033232803,0.00027749245,0.00013928553],"domain_scores_gemma":[0.99895287,0.000335037,0.00012101412,0.00040911452,0.00011711972,0.00006484559],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00094945374,0.000020025316,0.0001894952,0.00015239023,0.00006844181,0.00010666357,0.00068347796,0.000058957598,0.0021165852],"category_scores_gemma":[0.00015006683,0.000071909446,0.00007653891,0.0012461141,0.00012031295,0.00033490424,0.00013593753,0.0000860358,0.001163596],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042639394,0.000101096935,0.25872537,0.000006028372,0.0000049096093,0.0000149739535,0.00015543838,0.00007433518,0.000068005036,0.00026452407,0.0029129523,0.7376681],"study_design_scores_gemma":[0.00040027604,0.000020856094,0.96278185,0.000013006752,0.0000026117284,0.000006667951,0.001987334,0.00025227098,3.9876176e-7,0.032008156,0.0024485125,0.00007806617],"about_ca_topic_score_codex":0.012324726,"about_ca_topic_score_gemma":0.08780644,"teacher_disagreement_score":0.73759,"about_ca_system_score_codex":0.00003232666,"about_ca_system_score_gemma":0.000039951177,"threshold_uncertainty_score":0.9996141},"labels":[],"label_agreement":null},{"id":"W2973207532","doi":"10.1016/j.ejc.2021.103405","title":"Bounds on expected propagation time of probabilistic zero forcing","year":2021,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"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":"National Sanitarium Association; Division of Mathematical Sciences; National Security Agency; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Graph; Probabilistic logic; Binary logarithm; Discrete mathematics; Connectivity; Mathematical analysis; Statistics","score_opus":0.07555647171697927,"score_gpt":0.33018314496774315,"score_spread":0.2546266732507639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973207532","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.94471097,0.00021949729,0.035163093,0.00032858577,0.0011920152,0.00028474582,0.000010245234,0.000023380535,0.018067453],"genre_scores_gemma":[0.99801373,0.000016457847,0.00053384935,0.000034217224,0.00011938807,0.0000024085537,0.000008291325,0.000034334298,0.0012372949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941628,0.0018887909,0.0018260016,0.00035895026,0.001587388,0.00017605511],"domain_scores_gemma":[0.9925476,0.0010240168,0.0029643814,0.0009198947,0.0023961305,0.00014799039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006982738,0.00023216645,0.0006420468,0.00040252143,0.00012320041,0.00033759145,0.0014690382,0.00007159479,0.00013884154],"category_scores_gemma":[0.00547457,0.00018149223,0.00035124025,0.0007486809,0.00012745676,0.00015706701,0.0004640627,0.0008416647,0.00010858654],"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.0015173315,0.008941654,0.0027773292,0.00093864865,0.0010931367,0.0016965303,0.031903047,0.09934065,0.038690742,0.6907727,0.045959733,0.07636848],"study_design_scores_gemma":[0.0017822126,0.0015824708,0.010732249,0.0016922792,0.00024127342,0.0001752906,0.0010901347,0.002001013,0.008088933,0.9665365,0.005353013,0.0007246039],"about_ca_topic_score_codex":3.8589178e-7,"about_ca_topic_score_gemma":9.496294e-8,"teacher_disagreement_score":0.2757638,"about_ca_system_score_codex":0.000109146094,"about_ca_system_score_gemma":0.00033473413,"threshold_uncertainty_score":0.74010384},"labels":[],"label_agreement":null},{"id":"W2973606980","doi":"10.48550/arxiv.1909.09320","title":"Discerning Solution Concepts","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Counterfactual thinking; Nash equilibrium; Identification (biology); Mathematical economics; Set (abstract data type); Solution concept; Stochastic game; Covariate; Computer science; Risk dominance; Best response; Epsilon-equilibrium; Econometrics; Mathematics; Social psychology; Psychology","score_opus":0.2712411035894527,"score_gpt":0.29917621612132544,"score_spread":0.027935112531872752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973606980","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.6836089,0.000035242665,0.2818251,0.00018927708,0.000568895,0.00030343223,0.0000498988,0.000106219304,0.03331305],"genre_scores_gemma":[0.96716285,0.000024155492,0.00009722576,0.000066555964,0.00009014186,9.890076e-7,0.00002301694,0.000013038728,0.03252202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978423,0.0003002918,0.00028969548,0.0010883481,0.00021255552,0.00026679068],"domain_scores_gemma":[0.9971115,0.00061820535,0.00042773748,0.0014845011,0.0002282189,0.00012981394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010669827,0.00021605962,0.00033042667,0.00022210777,0.00022013001,0.00015396049,0.0016212199,0.0002532967,0.0008870685],"category_scores_gemma":[0.00030142904,0.00020816986,0.0002594786,0.0005615982,0.00023070825,0.00022402506,0.0013100007,0.0005099688,0.004771057],"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.00006822696,0.00009530683,0.0127052115,0.000018441224,0.00005755802,0.000030304862,0.0005486129,0.46060252,0.00031588145,0.5180774,0.004648372,0.002832196],"study_design_scores_gemma":[0.00047774287,0.00003552431,0.007355539,0.00007148331,0.00009436565,0.0000030945312,0.0011766455,0.19226927,0.00020787405,0.77779335,0.01993383,0.00058129],"about_ca_topic_score_codex":0.000044798842,"about_ca_topic_score_gemma":0.000023423558,"teacher_disagreement_score":0.28355396,"about_ca_system_score_codex":0.00011243909,"about_ca_system_score_gemma":0.0001367112,"threshold_uncertainty_score":0.99600387},"labels":[],"label_agreement":null},{"id":"W2979153413","doi":"10.3982/qe1735","title":"Imposing equilibrium restrictions in the estimation of dynamic discrete games","year":2021,"lang":"en","type":"preprint","venue":"Quantitative Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada; McGill University; Rice University; Ohio State University","keywords":"Estimator; Computation; Jacobian matrix and determinant; Convergence (economics); Mathematical optimization; Mathematics; Selection (genetic algorithm); Applied mathematics; Algorithm; Computer science; Statistics; Economics","score_opus":0.1219102559219155,"score_gpt":0.42645773280542904,"score_spread":0.3045474768835135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979153413","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.9545066,0.0002581605,0.040148348,0.001741234,0.0002946806,0.00036924906,0.00016517972,0.00001265439,0.002503918],"genre_scores_gemma":[0.98663443,0.00010271887,0.012908954,0.000051729905,0.000016227646,0.00007295096,0.00009100579,0.0000126092045,0.00010936621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750054,0.0005586277,0.0010329583,0.00054796564,0.00019479572,0.0001651189],"domain_scores_gemma":[0.99432987,0.0036433914,0.00082875957,0.0010083353,0.00015710294,0.00003256968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026157792,0.00017781202,0.00042638092,0.00031991504,0.000086762215,0.000370449,0.0009880791,0.00013152158,0.000048714395],"category_scores_gemma":[0.0015314508,0.00013866814,0.00020236932,0.0004757617,0.00025850808,0.0003041608,0.00038569252,0.0004056733,0.000043039698],"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.00004737047,0.00015303453,0.0010225158,0.00003832954,0.00006521167,0.000002523181,0.013225349,0.542837,0.0005763535,0.43107718,0.00019428131,0.010760795],"study_design_scores_gemma":[0.00013434283,0.000041897973,0.021752538,0.000077458884,0.000031323576,0.0000040601244,0.015233816,0.4178458,0.00020959876,0.5443153,0.0001589317,0.00019498494],"about_ca_topic_score_codex":0.00009381819,"about_ca_topic_score_gemma":0.000345646,"teacher_disagreement_score":0.12499125,"about_ca_system_score_codex":0.00008822049,"about_ca_system_score_gemma":0.00023021662,"threshold_uncertainty_score":0.56547225},"labels":[],"label_agreement":null},{"id":"W2988565380","doi":"10.1109/tsmc.2019.2950673","title":"Mixed Coalitional Stabilities With Full Participation of Sanctioning Opponents Within the Graph Model for Conflict Resolution","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Nanjing University of Aeronautics and Astronautics; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Conflict resolution; Set (abstract data type); Computer science; Sanctions; Conflict analysis; Graph; Mathematical economics; Solution concept; Resolution (logic); Mathematical optimization; Operations research; Game theory; Mathematics; Theoretical computer science; Political science; Artificial intelligence; Law","score_opus":0.12683047127016733,"score_gpt":0.31938817817568366,"score_spread":0.19255770690551632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988565380","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.47972226,0.000076526354,0.51800233,0.000059659804,0.0004927844,0.0011101182,0.00018623425,0.00002667763,0.00032343343],"genre_scores_gemma":[0.99454194,0.000007705746,0.00016174222,0.000017291823,0.00004675805,0.000653954,0.000009187437,0.000019466554,0.0045419713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725604,0.0003838871,0.0009059801,0.00042333128,0.00081644213,0.00021434105],"domain_scores_gemma":[0.99725014,0.0010612075,0.0005137997,0.0005882731,0.0004912676,0.00009529118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165043,0.0001889937,0.00036474463,0.00018199705,0.0003661927,0.0002161316,0.00024580662,0.00010330716,0.000013579029],"category_scores_gemma":[0.000025483001,0.00012352745,0.00010055552,0.00031456113,0.00023606744,0.00017941788,0.000002561237,0.00013564249,0.000025289799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035995452,0.000112619215,0.00015907965,0.00011953583,0.00007301687,7.846619e-8,0.002357411,0.90233207,0.0022275785,0.091932446,0.00015380215,0.00017239181],"study_design_scores_gemma":[0.0011404024,0.00046855042,0.00038970012,0.00024756335,0.00010063843,0.000019486728,0.015930671,0.97627664,0.0013203988,0.0032178082,0.00063863845,0.00024949532],"about_ca_topic_score_codex":0.00015402416,"about_ca_topic_score_gemma":0.00013096478,"teacher_disagreement_score":0.51784056,"about_ca_system_score_codex":0.000042466505,"about_ca_system_score_gemma":0.00006511547,"threshold_uncertainty_score":0.5037303},"labels":[],"label_agreement":null},{"id":"W2989503433","doi":"10.4230/dagsemproc.06461.16","title":"On Comparison of Mechanisms of Economic and Social Exchanges: The Times Model","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Implementation; Common value auction; Negotiation; Argument (complex analysis); Computer science; Focus (optics); Information system; Information exchange; Institution; Conceptual framework; Social system; Management science; Industrial organization; Data science; Economics; Microeconomics; Artificial intelligence; Sociology; Engineering; Software engineering; Telecommunications","score_opus":0.1652570236081611,"score_gpt":0.4306334308769982,"score_spread":0.26537640726883704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989503433","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.72997016,0.000011774195,0.22129013,0.00093258807,0.00002438655,0.00010731602,0.000011661774,0.000007684673,0.047644287],"genre_scores_gemma":[0.99770606,5.677377e-7,0.00087684044,0.00009424447,0.000009168542,0.0000018364433,3.427005e-7,0.0000018893019,0.0013090794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939346,0.00002631659,0.00025616918,0.00010333747,0.0001581551,0.000062546795],"domain_scores_gemma":[0.99884933,0.00080708467,0.00013492034,0.00016388838,0.00003001479,0.0000147572655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015207393,0.000038432067,0.00012769918,0.000048344395,0.00007099802,0.000011031236,0.0002301485,0.000027188675,0.00028167813],"category_scores_gemma":[0.000030044679,0.000021474125,0.000032367538,0.00005630347,0.000113431095,0.000030683823,0.000042375068,0.000031619533,0.000045271783],"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.000016715374,0.000023122104,0.000027502128,6.2013925e-7,0.0000026696387,7.1512445e-9,0.0009700417,0.00059136585,0.0017473623,0.9898967,0.0013065833,0.0054172915],"study_design_scores_gemma":[0.00007582559,0.000032105803,0.00032402485,9.146162e-7,0.000003872804,1.4477217e-7,0.0032599543,0.028703263,0.03354273,0.93389505,0.00013466533,0.000027427852],"about_ca_topic_score_codex":0.0000067364035,"about_ca_topic_score_gemma":0.000050303843,"teacher_disagreement_score":0.26773584,"about_ca_system_score_codex":0.000004394546,"about_ca_system_score_gemma":0.000010197356,"threshold_uncertainty_score":0.3084178},"labels":[],"label_agreement":null},{"id":"W2989692589","doi":"10.3982/ecta15712","title":"Strategic Communication With Minimal Verification","year":2019,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"Alfred P. Sloan Foundation","keywords":"Communication source; Submodular set function; Stochastic game; Dimension (graph theory); Monotone polygon; Computer science; Function (biology); Mechanism (biology); Mathematical economics; Theoretical computer science; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.1436237595699629,"score_gpt":0.3497570043712482,"score_spread":0.20613324480128528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989692589","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.76476616,0.00011615289,0.0005309524,0.0007775005,0.000030248222,0.00017961604,0.0000070819888,0.00002933787,0.23356295],"genre_scores_gemma":[0.99362725,0.0000138616115,0.001881219,0.00008238851,0.000015131219,0.000027971328,0.000012025865,0.000006199966,0.0043339343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989764,0.00008628308,0.00030086644,0.0002942837,0.00022298559,0.00011918566],"domain_scores_gemma":[0.9977086,0.0008187356,0.00021061845,0.0010895631,0.00011093351,0.00006152381],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010622948,0.000071443996,0.00014007346,0.00040023302,0.000093742936,0.00017602704,0.00071023696,0.000036080404,0.003230831],"category_scores_gemma":[0.00010907252,0.00005293425,0.000036629615,0.0018356135,0.00006503846,0.00028095677,0.00004485717,0.0000841164,0.00994809],"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.00010664184,0.00026616262,0.045745302,0.000004910903,0.000032737382,4.4580446e-7,0.00056852004,0.0005837983,0.0006161607,0.8760182,0.0022149046,0.073842205],"study_design_scores_gemma":[0.0013653999,0.00053965655,0.35284472,0.000014099489,0.00002474541,0.000017057457,0.005869694,0.0062314547,0.0013609461,0.34683073,0.28427038,0.0006311446],"about_ca_topic_score_codex":0.0000052975365,"about_ca_topic_score_gemma":0.0000031723894,"teacher_disagreement_score":0.5291875,"about_ca_system_score_codex":0.00002689198,"about_ca_system_score_gemma":0.000036710262,"threshold_uncertainty_score":0.99768037},"labels":[],"label_agreement":null},{"id":"W2995283531","doi":"10.1007/s10726-019-09648-z","title":"The Graph Model for Conflict Resolution: Reflections on Three Decades of Development","year":2019,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Toronto Metropolitan University; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conflict resolution; Management science; Preference; Realm; Conflict analysis; Tracing; Computer science; Operations research; Artificial intelligence; Sociology; Economics; Mathematics; Political science; Social science; Microeconomics; Law","score_opus":0.18533767148109556,"score_gpt":0.41633001726068225,"score_spread":0.2309923457795867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995283531","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.40315485,0.00011662346,0.59413147,0.00049301336,0.00017105599,0.0005071473,0.000009593489,0.000020159368,0.001396082],"genre_scores_gemma":[0.9878963,0.000049782186,0.010807795,0.00015457103,0.000027514374,0.000077718614,0.0000070568776,0.0000074279073,0.00097180816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982838,0.000059037975,0.0005706485,0.00034130918,0.00059528556,0.00014994445],"domain_scores_gemma":[0.99573815,0.003216071,0.00025191903,0.0004746699,0.0002586915,0.000060521794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023390919,0.00010204953,0.00015824648,0.00018300967,0.0006020562,0.000112654394,0.00032286617,0.00007645233,0.000031953816],"category_scores_gemma":[0.0006555968,0.00006257556,0.00008126779,0.0004638946,0.00007956132,0.00015450956,0.000056034212,0.00007942814,0.00008775943],"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.00056795595,0.00009764599,0.0011179302,0.0000039849374,0.000019267074,4.3509484e-8,0.0011585269,0.006193648,0.0030505483,0.7220692,0.0028003592,0.26292092],"study_design_scores_gemma":[0.0009303455,0.00019546026,0.038178388,0.0000336119,0.000013204403,0.0000026400517,0.00055922836,0.13079607,0.0014004734,0.73802906,0.089692175,0.00016932415],"about_ca_topic_score_codex":0.000001858591,"about_ca_topic_score_gemma":0.000113298745,"teacher_disagreement_score":0.5847415,"about_ca_system_score_codex":0.000022818602,"about_ca_system_score_gemma":0.000042862208,"threshold_uncertainty_score":0.46305907},"labels":[],"label_agreement":null},{"id":"W2997427396","doi":"10.1016/j.dam.2019.12.007","title":"Limited visibility Cops and Robber","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; University of Prince Edward Island; Mount Saint Vincent University; Memorial University of Newfoundland; University of Saskatchewan; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotonic function; Visibility; Graph; Simple (philosophy); Variation (astronomy); Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Geography","score_opus":0.05360467367792884,"score_gpt":0.3479797151712505,"score_spread":0.29437504149332167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997427396","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.8407299,0.00001866335,0.016748816,0.00029365844,0.000042782314,0.0005751343,0.000018837556,0.00007247041,0.14149973],"genre_scores_gemma":[0.98300475,0.0000036601655,0.013964935,0.00018492297,0.00002154312,0.00003948428,0.0000063558737,0.000015349,0.0027590268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982635,0.000029944391,0.00051048707,0.00044191288,0.00054544245,0.0002087634],"domain_scores_gemma":[0.99726295,0.001249553,0.00019716042,0.0010987429,0.00007960923,0.00011197496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015855143,0.00015268814,0.00031763193,0.00007534627,0.00010228757,0.00017318164,0.000456744,0.00007593886,0.0008331119],"category_scores_gemma":[0.0002837092,0.00010641386,0.000061502236,0.0004003914,0.00013446578,0.00010489673,0.0002007469,0.00012523509,0.002568255],"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.000016388072,0.000088082,0.0006235761,0.000032632848,0.000014100478,3.3251916e-7,0.001542067,0.00003527927,0.011763231,0.98031217,0.0010614016,0.0045107226],"study_design_scores_gemma":[0.00035280982,0.00002325127,0.002137964,0.000011582502,0.000020323887,0.000005198105,0.0032094799,0.0033405302,0.002212789,0.9811082,0.0073569394,0.00022093568],"about_ca_topic_score_codex":0.0000010490935,"about_ca_topic_score_gemma":0.0000015207104,"teacher_disagreement_score":0.14227481,"about_ca_system_score_codex":0.00001150631,"about_ca_system_score_gemma":0.000017077748,"threshold_uncertainty_score":0.99820834},"labels":[],"label_agreement":null},{"id":"W3002211633","doi":"10.1109/tac.2020.2968861","title":"Stochastic Control Approach to Reputation Games","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Stochastic game; Bayesian game; Mathematical economics; Markov perfect equilibrium; Mathematical optimization; Sequential equilibrium; Complete information; Computer science; Dynamic programming; Upper and lower bounds; Markov decision process; Reputation; Markov chain; Repeated game; Markov process; Equilibrium selection; Nash equilibrium; Mathematics; Game theory","score_opus":0.05516070542309009,"score_gpt":0.32089454084874447,"score_spread":0.2657338354256544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002211633","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.015966699,0.000010651775,0.97191757,0.008623784,0.00018658122,0.0013418,0.00011050546,0.00037057148,0.001471841],"genre_scores_gemma":[0.9910769,3.0088827e-7,0.0022166981,0.005569517,0.000070364564,0.000576133,0.000001342245,0.000024148936,0.00046461436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688613,0.0003516118,0.0008330608,0.0006637845,0.00095086097,0.0003145425],"domain_scores_gemma":[0.9963916,0.0021242239,0.00020797372,0.0006502247,0.00021096172,0.00041500948],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010710027,0.0002402362,0.00051418005,0.00025107496,0.00029873435,0.00023579488,0.0006228041,0.00008651549,0.0006517627],"category_scores_gemma":[0.00051586225,0.00019522134,0.00023790706,0.0010745564,0.00008614058,0.0002208152,0.0000014441224,0.00019256667,0.002947738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024246576,0.00041932592,0.000003146412,0.000013076966,0.00010738893,0.0000018634922,0.0028460107,0.7818266,0.0037734546,0.0025368808,0.0014794017,0.20675033],"study_design_scores_gemma":[0.0023915323,0.00024134823,0.0003146137,0.000014416635,0.0001290122,0.00000996611,0.0007803475,0.9896946,0.00044216073,0.005025541,0.00069183693,0.00026463403],"about_ca_topic_score_codex":0.0000051584434,"about_ca_topic_score_gemma":0.0000027473625,"teacher_disagreement_score":0.9751102,"about_ca_system_score_codex":0.000044211964,"about_ca_system_score_gemma":0.00007717284,"threshold_uncertainty_score":0.9978286},"labels":[],"label_agreement":null},{"id":"W3002919848","doi":"10.1080/0952813x.2020.1716857","title":"Communicative bottlenecks lead to maximal information transfer","year":2020,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Partition (number theory); Information transfer; Signalling; Theoretical computer science; Simple (philosophy); Stability (learning theory); Property (philosophy); Empirical evidence; Mathematical economics; Machine learning; Mathematics; Telecommunications","score_opus":0.16713581174209288,"score_gpt":0.41773369890913226,"score_spread":0.25059788716703935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002919848","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.38160267,0.000085854634,0.5936683,0.015692798,0.00017924569,0.0002591904,0.000018352604,0.000020583597,0.008472991],"genre_scores_gemma":[0.9927682,0.0000064375586,0.0039812853,0.003073336,0.00014398356,0.000008950701,0.0000011864912,0.000008007857,0.000008606686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967738,0.00030335755,0.0014605474,0.00018297118,0.001046405,0.00023295378],"domain_scores_gemma":[0.99771684,0.0008269601,0.00020448174,0.0003399621,0.0004895529,0.00042217784],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017003111,0.0001610901,0.0003431893,0.00013455274,0.00016857765,0.00025339858,0.0014541716,0.00007679629,0.003009385],"category_scores_gemma":[0.0015804808,0.00011681146,0.00022177518,0.0006786085,0.0007131463,0.00067891047,0.00017635358,0.00039116558,0.0020782624],"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.00065354817,0.00015594278,0.0000066911716,8.768721e-7,0.000011394972,0.0000028864006,0.009514542,0.00023412479,0.07140709,0.8849811,0.00022869342,0.03280311],"study_design_scores_gemma":[0.000043609918,0.0007380012,0.000013238156,0.000012971736,0.0000092131695,0.000016506307,0.014929085,0.002096054,0.6331732,0.34581435,0.003027865,0.0001258546],"about_ca_topic_score_codex":0.0000018971693,"about_ca_topic_score_gemma":4.8584405e-7,"teacher_disagreement_score":0.6111655,"about_ca_system_score_codex":0.000043542073,"about_ca_system_score_gemma":0.00005534402,"threshold_uncertainty_score":0.9986987},"labels":[],"label_agreement":null},{"id":"W3008936904","doi":"10.1016/j.automatica.2020.108883","title":"Dynamic signaling games with quadratic criteria under Nash and Stackelberg equilibria","year":2020,"lang":"en","type":"article","venue":"Automatica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Stackelberg competition; Mathematical optimization; Mathematical economics; Nash equilibrium; Computer science; Mathematics; Sequential game; Affine transformation; Applied mathematics; Game theory; Pure mathematics","score_opus":0.07699215175101645,"score_gpt":0.37367931859605985,"score_spread":0.29668716684504337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008936904","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.94812554,0.000060388465,0.039966263,0.009210094,0.000025572035,0.00020453818,0.000010560299,0.00015504798,0.0022420154],"genre_scores_gemma":[0.98765624,0.0000017264921,0.010739789,0.0011401196,0.00001979022,0.000020222966,0.0000031698303,0.000015106178,0.00040383896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983494,0.00016684455,0.00040756864,0.00039132265,0.00048150963,0.00020334906],"domain_scores_gemma":[0.9980688,0.0011472662,0.00013327126,0.0003876565,0.00007686485,0.00018613791],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005887054,0.00014038719,0.00026188203,0.000056314555,0.00014024247,0.0003592216,0.00037739033,0.00004167213,0.0011206457],"category_scores_gemma":[0.00046585558,0.000095477546,0.00003685896,0.0004898418,0.00019794669,0.00027454508,0.00011024353,0.000091723196,0.0005452792],"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.0003876536,0.00044967444,0.0027884918,0.00032941793,0.0003861462,0.000071141665,0.03750756,0.0027215388,0.37862742,0.50022167,0.017070841,0.05943848],"study_design_scores_gemma":[0.00073298905,0.0003279871,0.009662171,0.00008028813,0.00007964533,0.00003440612,0.006195828,0.55310494,0.0016936356,0.42518228,0.0024263838,0.00047947705],"about_ca_topic_score_codex":0.0000021638077,"about_ca_topic_score_gemma":0.0000059849694,"teacher_disagreement_score":0.5503834,"about_ca_system_score_codex":0.000009880767,"about_ca_system_score_gemma":0.000051868847,"threshold_uncertainty_score":0.99979246},"labels":[],"label_agreement":null},{"id":"W3010722613","doi":"10.1109/cdc40024.2019.9029322","title":"Belief Estimation by Agents in Major Minor LQG Mean Field Games","year":2019,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Minor (academic); Linear-quadratic-Gaussian control; Nash equilibrium; Recursion (computer science); Game theory; Mathematics; Mathematical economics; Computer science; Optimal control; Mathematical optimization; Algorithm","score_opus":0.06474286748134317,"score_gpt":0.38424404217411706,"score_spread":0.3195011746927739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010722613","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.91790193,0.000019644032,0.009431825,0.002222824,0.00008927039,0.00023256616,0.0000060130137,0.000027870192,0.07006803],"genre_scores_gemma":[0.9414357,0.0000013945238,0.0013067662,0.0009245148,0.000009671929,0.000016890603,0.0000053102026,0.0000034801587,0.056296296],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887055,0.000061939034,0.00029948854,0.00026739918,0.00036902036,0.00013162609],"domain_scores_gemma":[0.9987149,0.0006935107,0.00007151957,0.00043016524,0.00004090286,0.000048993155],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007915072,0.00006888313,0.000118316995,0.000099011384,0.000037449838,0.00008375699,0.00040512925,0.000049583665,0.008003426],"category_scores_gemma":[0.00032244175,0.000049997656,0.000037620775,0.00034835527,0.000020085068,0.00019798063,0.00005735879,0.00006553585,0.006348955],"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.00006597516,0.00041725827,0.0635195,0.00001011431,0.000014647436,0.00000208806,0.0022134194,0.00058468344,0.008349471,0.10780944,0.40887943,0.40813398],"study_design_scores_gemma":[0.0022454269,0.00030693877,0.06602243,0.00004912048,0.000019692752,0.000008063453,0.0037578978,0.060600128,0.06250941,0.6152645,0.18845148,0.0007649278],"about_ca_topic_score_codex":0.000066460954,"about_ca_topic_score_gemma":0.00007294232,"teacher_disagreement_score":0.50745505,"about_ca_system_score_codex":0.000010881276,"about_ca_system_score_gemma":0.00001198172,"threshold_uncertainty_score":0.9944247},"labels":[],"label_agreement":null},{"id":"W3013920237","doi":"10.1109/ieeeconf44664.2019.9048800","title":"On the Role of Information in Learning in Games over Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Leverage (statistics); Exploit; Stochastic game; Artificial intelligence; Focus (optics); Information exchange; Theoretical computer science; Machine learning; Computer security; Mathematical economics; Mathematics","score_opus":0.019564450260588742,"score_gpt":0.30639304579442567,"score_spread":0.28682859553383694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013920237","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.8926113,0.000005941841,0.0006883076,0.00019249466,0.000013254917,0.00009443719,1.8563006e-7,0.0000048142847,0.10638925],"genre_scores_gemma":[0.99872,0.0000015850188,0.000018913735,0.00016824997,0.0000030378912,0.000006014631,5.450206e-7,8.4376444e-7,0.0010807933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993761,0.000083680774,0.00022815619,0.000056108638,0.00019353663,0.00006241851],"domain_scores_gemma":[0.9984686,0.0012475783,0.00007770164,0.00017647579,0.000021474581,0.0000081801545],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001497081,0.000028221759,0.00006232168,0.00009799306,0.000014016478,0.000030147752,0.00020000088,0.000023865368,0.0012874551],"category_scores_gemma":[0.00036063892,0.000015182872,0.000017078884,0.00041627334,0.000017293272,0.00020714184,0.00003192398,0.00010622182,0.0004998375],"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.000019325937,0.000016895548,0.092447564,3.5299217e-7,6.593417e-7,1.7886453e-8,0.0010497845,0.16349992,0.00016589505,0.7015328,0.00022383114,0.041042976],"study_design_scores_gemma":[0.00025597535,0.00004146936,0.2325276,0.000018067882,5.615656e-7,2.167262e-7,0.008034121,0.30756152,0.00089245674,0.42808542,0.022513907,0.00006868891],"about_ca_topic_score_codex":0.000024383984,"about_ca_topic_score_gemma":0.00002545238,"teacher_disagreement_score":0.27344736,"about_ca_system_score_codex":0.000005805396,"about_ca_system_score_gemma":0.00000785043,"threshold_uncertainty_score":0.9996255},"labels":[],"label_agreement":null},{"id":"W3033028885","doi":"10.1111/jems.12469","title":"On the Paradox of Mediocracy","year":2020,"lang":"en","type":"preprint","venue":"Journal of Economics & Management Strategy","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Concordia University; Center for Interuniversity Research and Analysis on Organizations","funders":"National Natural Science Foundation of China","keywords":"Reputation; Competence (human resources); Outcome (game theory); Business; Aside; Action (physics); Private information retrieval; Microeconomics; Public relations; Economics; Management; Political science; Computer science; Computer security","score_opus":0.2117238885494301,"score_gpt":0.380949792602558,"score_spread":0.1692259040531279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033028885","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.8461654,0.00014339916,0.004825999,0.024368359,0.0009516162,0.0005799309,0.000056005127,0.000008568176,0.12290072],"genre_scores_gemma":[0.997548,0.00048415893,0.0004463469,0.0005661127,0.00020931332,0.000009640986,0.000002058644,0.000012242294,0.00072213117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973019,0.00019355545,0.0016821602,0.00031865787,0.00035667125,0.0001470808],"domain_scores_gemma":[0.99465716,0.0012471881,0.0029443176,0.0008725969,0.00017229936,0.00010644724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037210456,0.00019602211,0.0005760833,0.0002580523,0.00007443,0.0002669151,0.002561209,0.00008716843,0.0007422601],"category_scores_gemma":[0.0002646416,0.00012308662,0.00041216766,0.00016621992,0.00012564217,0.00012210793,0.0005678235,0.00059855514,0.00019337647],"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.00008191689,0.00007916338,0.000023476608,0.000017715423,0.00024204719,0.000009504565,0.000110983965,0.057522643,0.000009467267,0.9157128,0.014197046,0.011993243],"study_design_scores_gemma":[0.00019021549,0.00010460872,0.0010360036,0.00004524388,0.00007910846,0.0000041626363,0.0009486261,0.0013109668,0.00011208078,0.9863456,0.009718521,0.00010487911],"about_ca_topic_score_codex":0.0000024643389,"about_ca_topic_score_gemma":0.0000028695779,"teacher_disagreement_score":0.15138258,"about_ca_system_score_codex":0.00004743415,"about_ca_system_score_gemma":0.00010699437,"threshold_uncertainty_score":0.81272274},"labels":[],"label_agreement":null},{"id":"W3033502170","doi":"10.1007/978-3-030-44625-3_3","title":"Equilibria of Parametrized N-Player Nonlinear Games Using Inequalities and Nonsmooth Dynamics","year":2020,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Guelph","funders":"","keywords":"Nash equilibrium; Mathematical economics; Variational inequality; Nonlinear system; Mathematics; Best response; Mathematical optimization; Applied mathematics; Game theory; Physics","score_opus":0.10792164435792591,"score_gpt":0.34423371846884343,"score_spread":0.23631207411091754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033502170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022949174,0.0022168343,0.8974163,0.002205426,0.00009887069,0.002291465,0.0014065881,0.00017153253,0.09189808],"genre_scores_gemma":[0.26025286,0.009514351,0.4151066,0.0014323929,0.00096749753,0.0006054396,0.0013548628,0.0005468459,0.31021917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755913,0.00004970134,0.0010030422,0.0007136618,0.00050902506,0.00016544544],"domain_scores_gemma":[0.9972713,0.000677326,0.00078220165,0.0005960514,0.00048164537,0.00019146186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005723045,0.00031617502,0.0006048646,0.00039349703,0.00021760128,0.00018662325,0.0003987646,0.0002579256,0.0003977664],"category_scores_gemma":[0.00028658722,0.0002922489,0.000107640284,0.00035289727,0.0002806058,0.00021186045,0.00029045012,0.0002406615,0.000037759753],"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.000020714508,0.000028316832,0.00002461208,0.000048861206,0.0000484481,2.8740664e-7,0.00017233184,0.0082185175,0.00027844592,0.987111,0.00007344029,0.0039750407],"study_design_scores_gemma":[0.00046071317,0.00004580979,0.000015476608,0.000078506986,0.00018319036,0.000009525073,0.000261028,0.82593685,0.00018890273,0.0860743,0.08620344,0.0005422739],"about_ca_topic_score_codex":0.0000041312105,"about_ca_topic_score_gemma":0.0000043934547,"teacher_disagreement_score":0.9010367,"about_ca_system_score_codex":0.00003208882,"about_ca_system_score_gemma":0.00010636305,"threshold_uncertainty_score":0.999953},"labels":[],"label_agreement":null},{"id":"W3035283082","doi":"","title":"Linear Lower Bounds and Conditioning of Differentiable Games","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Differentiable function; Upper and lower bounds; Convexity; Mathematics; Saddle point; Leverage (statistics); Complement (music); Regular polygon; Saddle; Convex function; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.11423283619060517,"score_gpt":0.3897468339893966,"score_spread":0.2755139977987914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035283082","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.9223749,0.000034557837,0.020638501,0.009642295,0.00012544988,0.00009081409,0.00004720239,0.000056158107,0.04699014],"genre_scores_gemma":[0.9962481,0.000015704869,0.00045995667,0.00041816116,0.000077897574,0.0000063595153,0.000026521737,0.0000073366,0.002739937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985735,0.00011609201,0.00034259018,0.00030500017,0.00056128367,0.00010155672],"domain_scores_gemma":[0.9988305,0.00045341268,0.00023091288,0.0001281561,0.0002688406,0.000088199085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004163426,0.00010210882,0.00017833889,0.000105382576,0.00011894413,0.00015852676,0.00041746142,0.000036688405,0.0045608827],"category_scores_gemma":[0.0014040922,0.00008292026,0.000053961798,0.00016985329,0.00012511764,0.00015923486,0.00012435715,0.0002798979,0.00019427582],"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.00024160693,0.000114097915,0.051893,0.000009629213,0.00007189846,0.000006081604,0.0015612938,0.0039065816,0.027422192,0.8949152,0.00059507065,0.019263346],"study_design_scores_gemma":[0.0013391396,0.00067289,0.027114686,0.00011354689,0.000028308763,0.0000132271125,0.0016294081,0.7170057,0.00661876,0.17806593,0.066954635,0.00044376036],"about_ca_topic_score_codex":0.000014270305,"about_ca_topic_score_gemma":0.0000031543443,"teacher_disagreement_score":0.71684927,"about_ca_system_score_codex":0.000007404386,"about_ca_system_score_gemma":0.000025433746,"threshold_uncertainty_score":0.9963491},"labels":[],"label_agreement":null},{"id":"W3035874454","doi":"10.48550/arxiv.2006.10716","title":"Market Graph Clustering Via QUBO and Digital Annealing","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Medoid; Cluster analysis; Computer science; Clustering coefficient; Quadratic equation; Graph; Index (typography); Replicate; Data mining; Theoretical computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.17943413946857387,"score_gpt":0.2508226628580395,"score_spread":0.07138852338946564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035874454","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.59014803,0.00004308774,0.38912618,0.00033710225,0.00018928084,0.00024148104,0.00010804047,0.00012519359,0.019681579],"genre_scores_gemma":[0.9968588,0.00004596332,0.00018961188,0.000098501514,0.00007661822,8.581137e-7,0.000012712082,0.000015446196,0.0027015372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980446,0.00012982503,0.00029837646,0.0011289745,0.00016526398,0.00023293162],"domain_scores_gemma":[0.9979511,0.0005760061,0.0002709221,0.0008182932,0.00012868286,0.00025501085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005980434,0.00024204368,0.00034066715,0.0002432435,0.00022273678,0.00042365034,0.0010947248,0.00017783276,0.00023297533],"category_scores_gemma":[0.00026360506,0.00024663558,0.00018578568,0.0007144842,0.00023313239,0.00034879035,0.001962045,0.0004157429,0.00019189855],"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.001701665,0.00052427175,0.096585065,0.00046307902,0.00090379035,0.0016004451,0.0054410202,0.46304005,0.0011768899,0.32697248,0.01931169,0.082279555],"study_design_scores_gemma":[0.00027823338,0.000027483398,0.0038195087,0.000042160784,0.000055049873,0.000009447427,0.0007866717,0.21310562,0.000032066622,0.77815485,0.0032774068,0.00041150852],"about_ca_topic_score_codex":0.000020873435,"about_ca_topic_score_gemma":0.000019765605,"teacher_disagreement_score":0.45118237,"about_ca_system_score_codex":0.000033151882,"about_ca_system_score_gemma":0.00004503542,"threshold_uncertainty_score":0.99999857},"labels":[],"label_agreement":null},{"id":"W3039107198","doi":"10.1007/s00199-020-01261-5","title":"Dynamic coordination via organizational routines","year":2020,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"Directorate for Social, Behavioral and Economic Sciences","keywords":"Ranking (information retrieval); Action (physics); Computer science; Overconfidence effect; Stochastic game; Organizational learning; Task (project management); Knowledge management; Microeconomics; Artificial intelligence; Psychology; Economics; Social psychology; Management","score_opus":0.03385124125760292,"score_gpt":0.31223514285385223,"score_spread":0.2783839015962493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039107198","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.691417,0.000054125103,0.26577592,0.01707834,0.00034218695,0.00021956216,0.00006237581,0.00015862887,0.024891878],"genre_scores_gemma":[0.995475,0.0000011790459,0.00037991055,0.0010585673,0.00011224641,0.000007780016,0.000018043946,0.000011649329,0.0029356359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897075,0.00014866701,0.00034383428,0.0003172881,0.00011346861,0.000105969215],"domain_scores_gemma":[0.9986906,0.0007500767,0.00015073115,0.0002584721,0.00005969513,0.00009041769],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011470729,0.00008372597,0.00013455444,0.000056412173,0.00013092694,0.000090130525,0.0005042305,0.0000389284,0.007864862],"category_scores_gemma":[0.00066445814,0.00007320998,0.000050803625,0.00020060517,0.00008723417,0.00020626759,0.00008602069,0.00006363406,0.011880894],"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.000027470818,0.000014207293,0.0009641936,9.009508e-7,0.000010395235,3.6058174e-7,0.0005655471,0.00125456,0.0021587997,0.9798947,0.0028174461,0.012291445],"study_design_scores_gemma":[0.00018104972,0.000015472633,0.0034371722,8.9552975e-7,0.000005892744,0.00000398141,0.00041144554,0.022282775,0.0006300522,0.95933664,0.0135816,0.000113028385],"about_ca_topic_score_codex":9.041935e-7,"about_ca_topic_score_gemma":0.000002788697,"teacher_disagreement_score":0.304058,"about_ca_system_score_codex":0.000039684986,"about_ca_system_score_gemma":0.000047431542,"threshold_uncertainty_score":0.9930421},"labels":[],"label_agreement":null},{"id":"W3042525782","doi":"10.3982/qe923","title":"Estimating local interactions among many agents who observe their neighbors","year":2020,"lang":"en","type":"article","venue":"Quantitative Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Stochastic game; Network formation; Computer science; Best response; Set (abstract data type); Complete information; Inference; Fraction (chemistry); Simple (philosophy); Mathematical economics; Game theory; Process (computing); Artificial intelligence; Mathematics","score_opus":0.26629974362384917,"score_gpt":0.40475384490161137,"score_spread":0.1384541012777622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042525782","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.72620183,0.000011819802,0.26530144,0.0020672707,0.00022473485,0.00015081312,0.000073749805,0.000041884876,0.0059264293],"genre_scores_gemma":[0.98853123,0.0000042484476,0.009937726,0.0009467902,0.00009487259,0.000027882146,0.000011699777,0.000017757902,0.0004277689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983964,0.00016220803,0.00062861666,0.0004965413,0.00011068255,0.00020558246],"domain_scores_gemma":[0.99711293,0.0018288622,0.00038416835,0.0003558459,0.00012663078,0.00019156851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006832402,0.00016351198,0.000302538,0.000082168095,0.00026055123,0.00025218382,0.00065869745,0.000043360105,0.00082562445],"category_scores_gemma":[0.0010626303,0.0001400634,0.0001484397,0.00033881838,0.00027631427,0.0007206463,0.00016208594,0.00020793782,0.0019585078],"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.00007751481,0.00009139819,0.0145895835,0.000008395648,0.000107011525,0.000003562693,0.014430457,0.14225052,0.0001611627,0.79291904,0.008191892,0.02716948],"study_design_scores_gemma":[0.00017057407,0.000066864064,0.018105168,0.000011932159,0.000009605865,0.0000013917703,0.010187909,0.87091583,0.00040406734,0.09021666,0.009727279,0.00018271182],"about_ca_topic_score_codex":0.000020198764,"about_ca_topic_score_gemma":0.00006084591,"teacher_disagreement_score":0.7286653,"about_ca_system_score_codex":0.000050643233,"about_ca_system_score_gemma":0.00004222149,"threshold_uncertainty_score":0.9988186},"labels":[],"label_agreement":null},{"id":"W3042700203","doi":"10.1007/s13235-020-00362-z","title":"Dynamic Games and Applications: Special Issue in Memory of Chris Cannings—Introduction","year":2020,"lang":"en","type":"article","venue":"Dynamic Games and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Mathematical economics; Operations research; Economics; Mathematics","score_opus":0.018454825947763476,"score_gpt":0.3172286359644808,"score_spread":0.2987738100167173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042700203","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.57367605,0.0062637585,0.30326995,0.08682587,0.00029242825,0.0082356,0.0009505871,0.00041186504,0.020073896],"genre_scores_gemma":[0.99289733,0.00064235955,0.0020490084,0.00037099334,0.0009649392,0.0011387818,0.000071882445,0.000027073382,0.0018376347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976319,0.00008936991,0.00080225145,0.0008769201,0.00034761123,0.0002519149],"domain_scores_gemma":[0.9982447,0.00036355518,0.00036658536,0.0006622823,0.0001691425,0.00019371886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006365832,0.00022024414,0.00042194442,0.00024011836,0.00020938828,0.000109349734,0.0004965696,0.00011173686,0.00032040576],"category_scores_gemma":[0.00017801202,0.00020421747,0.00007432344,0.0013133436,0.0004878766,0.0002100677,0.00016932294,0.00023039665,0.00012248264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006416553,0.0002796941,0.0018966679,0.000100888195,0.000039562357,0.0000010103045,0.0032343343,0.0012021206,0.008936889,0.08216477,0.0058862087,0.8961937],"study_design_scores_gemma":[0.0009350001,0.00011021502,0.02814517,0.000027156122,0.00008168409,0.00003003552,0.009836936,0.030703064,0.0004040298,0.10804873,0.82110083,0.00057714345],"about_ca_topic_score_codex":0.000042499563,"about_ca_topic_score_gemma":0.00009965903,"teacher_disagreement_score":0.89561653,"about_ca_system_score_codex":0.00003667686,"about_ca_system_score_gemma":0.00005578078,"threshold_uncertainty_score":0.8327747},"labels":[],"label_agreement":null},{"id":"W3045016350","doi":"10.3982/ecta17105","title":"Statistical Inference in Games","year":2020,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Statistical inference; Inference; Sampling distribution; Sample (material); Econometrics; Nash equilibrium; Matching (statistics); Fiducial inference; Computer science; Indirect Inference; Frequentist inference; Mathematical economics; Economics; Mathematics; Statistics; Artificial intelligence; Bayesian inference; Estimator","score_opus":0.26355886114892807,"score_gpt":0.43211046638217404,"score_spread":0.16855160523324597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045016350","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.7009511,0.00013003575,0.13158652,0.0176168,0.00010798664,0.00026752756,0.000122001606,0.00007685921,0.14914119],"genre_scores_gemma":[0.99732226,0.000005643391,0.0015877717,0.00078311283,0.000031679116,0.000012472576,0.0000019254567,0.0000028308468,0.00025228443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990189,0.0000625459,0.00034089424,0.0002868492,0.00016368847,0.00012709726],"domain_scores_gemma":[0.9955977,0.003952721,0.000064960404,0.00021531392,0.000029376864,0.00013991202],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00057593064,0.00005277999,0.00015601405,0.00030389227,0.000028534234,0.00009484982,0.0004467109,0.000023997123,0.00525801],"category_scores_gemma":[0.011342349,0.000043500946,0.000024949835,0.0023976644,0.000060572314,0.00012885033,0.000081627106,0.00009248243,0.0057459455],"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.000023151808,0.00010055968,0.13386315,0.0000027445324,0.0000053124545,0.000007768856,0.0009692266,0.0005564785,0.00007778613,0.6176538,0.009383752,0.23735628],"study_design_scores_gemma":[0.00035864962,0.000103262355,0.38682938,0.0000020596613,0.0000028689408,7.6700246e-7,0.0005998611,0.0077921175,0.00026283375,0.32179996,0.28203377,0.00021447256],"about_ca_topic_score_codex":0.0000043429263,"about_ca_topic_score_gemma":0.00000294062,"teacher_disagreement_score":0.2963712,"about_ca_system_score_codex":0.000012565033,"about_ca_system_score_gemma":0.000028604058,"threshold_uncertainty_score":0.99698555},"labels":[],"label_agreement":null},{"id":"W3046093443","doi":"10.48550/arxiv.2007.14515","title":"Stable Community Structures and Social Exclusion","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto","funders":"","keywords":"Nash equilibrium; Outcome (game theory); Social exclusion; Community structure; Norm (philosophy); Class (philosophy); Stability (learning theory); Mathematical economics; Microeconomics; Sociology; Economics; Computer science; Mathematics; Epistemology; Combinatorics; Artificial intelligence; Economic growth","score_opus":0.30766611761721047,"score_gpt":0.2885566090287008,"score_spread":0.019109508588509683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046093443","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.97023726,0.000019928819,0.022161782,0.00061628286,0.00012087164,0.0001999902,0.00011595456,0.00008539694,0.006442563],"genre_scores_gemma":[0.9980969,0.00002073592,0.00012015603,0.00020647988,0.000071165334,5.0745444e-7,0.0000268676,0.000010479248,0.0014467159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980541,0.00075476913,0.00022426095,0.0006119192,0.00017182494,0.00018316552],"domain_scores_gemma":[0.9980084,0.0006350926,0.00027157454,0.0007911384,0.0001668496,0.00012698269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009674873,0.00019950359,0.00033596985,0.00013881757,0.0009989247,0.00018676993,0.0014362254,0.00023050165,0.00034329333],"category_scores_gemma":[0.0002156244,0.00019273665,0.00012747887,0.0004573746,0.00033561935,0.00015340178,0.003380587,0.0009854118,0.00011838754],"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.00015671544,0.00010075091,0.0027610231,0.000053795105,0.00006414702,0.000033715733,0.0047148652,0.009885244,0.00067370204,0.9740257,0.004647257,0.0028830306],"study_design_scores_gemma":[0.00021075741,0.000018961742,0.009372839,0.000007113816,0.00004395497,0.0000012380717,0.002885493,0.0055773077,0.000106921856,0.97691464,0.0046503744,0.00021038772],"about_ca_topic_score_codex":0.00018220914,"about_ca_topic_score_gemma":0.00007994987,"teacher_disagreement_score":0.027859662,"about_ca_system_score_codex":0.000051066974,"about_ca_system_score_gemma":0.00008425402,"threshold_uncertainty_score":0.7859573},"labels":[],"label_agreement":null},{"id":"W3080579124","doi":"10.1287/moor.2022.1296","title":"Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Representation theorem; Mathematical economics; Representation (politics); Stochastic control; Mathematical optimization; Function (biology); Argument (complex analysis); Optimal control; Discrete mathematics; Economics","score_opus":0.2265578077688728,"score_gpt":0.4777485362270733,"score_spread":0.2511907284582005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080579124","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.5697761,0.0000874034,0.42396733,0.00043077354,0.000030510126,0.0024735075,0.0002213054,0.000013825362,0.002999233],"genre_scores_gemma":[0.94330925,0.000006173735,0.052497495,0.00001402551,0.000014932379,0.0014590236,0.00001342644,0.000018066294,0.002667626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946022,0.000690927,0.0011520077,0.00034144853,0.0028907012,0.0003227139],"domain_scores_gemma":[0.98186105,0.015116637,0.00022546115,0.00095190783,0.0017522355,0.000092679176],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.022241732,0.0001293769,0.0006563255,0.001494647,0.00082769257,0.00017200268,0.001194592,0.000046710553,0.0007583895],"category_scores_gemma":[0.012062963,0.00009046338,0.00016212794,0.003326365,0.00058265054,0.00018432685,0.00050606916,0.00027786428,0.00002742197],"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.0051683905,0.0011144294,0.000026711057,0.000081496975,0.00009591038,7.5943507e-7,0.0063410136,0.2479327,0.0017229252,0.7342334,0.00085990585,0.002422387],"study_design_scores_gemma":[0.0318693,0.0009362784,0.00010953137,0.00008787764,0.0000875857,0.00002957068,0.03669788,0.40373006,0.0039365,0.52162236,0.0005764879,0.00031655215],"about_ca_topic_score_codex":0.00010974342,"about_ca_topic_score_gemma":0.000041917247,"teacher_disagreement_score":0.37353313,"about_ca_system_score_codex":0.00007264452,"about_ca_system_score_gemma":0.00030838273,"threshold_uncertainty_score":0.99625885},"labels":[],"label_agreement":null},{"id":"W3080807709","doi":"10.1177/0004867420951251","title":"Jumping off the bandwagon: Does the Basaglian de-hospitalised model work outside Trieste?","year":2020,"lang":"en","type":"article","venue":"Australian & New Zealand Journal of Psychiatry","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Western University","funders":"","keywords":"Bandwagon effect; Jumping; Psychology; Medicine; Social psychology","score_opus":0.07422138899706819,"score_gpt":0.34246665492060036,"score_spread":0.26824526592353215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080807709","genre_codex":"commentary","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.4042949,0.00023761638,0.0026010156,0.59097385,0.0008907426,0.00020222226,0.000014435082,0.000020181502,0.0007650177],"genre_scores_gemma":[0.97348326,0.000050891693,0.0022801594,0.005696895,0.0018442697,0.0000037580419,8.1454107e-7,0.000019855317,0.016620062],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971656,0.00030124577,0.0010499827,0.00027363785,0.00083890604,0.00037062005],"domain_scores_gemma":[0.9974265,0.0005443796,0.00081689924,0.00058687694,0.00017408335,0.00045124665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024429194,0.0002106529,0.00034831316,0.00007484293,0.00039106325,0.00046290015,0.0018771951,0.00010125064,0.00046634916],"category_scores_gemma":[0.00038647826,0.00008949076,0.00038973617,0.0008472959,0.0001839625,0.00031869631,0.00006803455,0.0006627742,0.00010741508],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003124601,0.00006859973,0.053227793,0.000004066864,0.00008616761,0.0000064796122,0.005753419,0.0061683757,0.000104833016,0.0059228647,0.91938347,0.008961463],"study_design_scores_gemma":[0.0020786314,0.00033958207,0.05616449,0.00014073869,0.0002605351,0.00012217695,0.010535519,0.0007740932,0.00030103204,0.5065821,0.42228478,0.0004163553],"about_ca_topic_score_codex":0.000015798436,"about_ca_topic_score_gemma":0.00004705343,"teacher_disagreement_score":0.58527696,"about_ca_system_score_codex":0.000022263193,"about_ca_system_score_gemma":0.00048720656,"threshold_uncertainty_score":0.51061964},"labels":[],"label_agreement":null},{"id":"W3085629878","doi":"10.1037/xap0000337","title":"“Only your first yes will count”: The impact of prelineup instructions on sequential lineup decisions.","year":2020,"lang":"en","type":"article","venue":"Journal of Experimental Psychology Applied","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Queen Margaret University","keywords":"Psychology; Computer science","score_opus":0.1761945528374423,"score_gpt":0.4774459319076463,"score_spread":0.301251379070204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085629878","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.98515624,0.00020859411,0.0031615128,0.004179059,0.0004851213,0.0002795864,0.000043194374,0.000014182661,0.006472488],"genre_scores_gemma":[0.99737144,0.000036576756,0.0007689391,0.0012656037,0.0004778233,0.000012762898,0.0000022900724,0.000016173488,0.00004837787],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972539,0.00015691663,0.001288166,0.00033903966,0.0007500268,0.00021195073],"domain_scores_gemma":[0.9971241,0.00088208035,0.0010097574,0.00054944167,0.0002228865,0.00021175195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001069615,0.00020862883,0.00047260823,0.00018850889,0.0002716476,0.00006599637,0.0012837405,0.00013120403,0.0011682645],"category_scores_gemma":[0.0004403066,0.00011800676,0.00043648225,0.00066450186,0.0004507187,0.00019014342,0.0001098411,0.0004699852,0.00018334315],"study_design_candidate":"bench_or_experimental","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.0071501466,0.0028674188,0.003249999,0.000003073459,0.0005844614,0.000027427346,0.008909535,0.009357556,0.7302547,0.05565201,0.16601945,0.015924174],"study_design_scores_gemma":[0.029407859,0.02304699,0.15452944,0.0002250783,0.00046937456,0.0042978944,0.038612567,0.0023097217,0.28988674,0.2952216,0.15959838,0.0023943572],"about_ca_topic_score_codex":0.000004038865,"about_ca_topic_score_gemma":0.0000013128154,"teacher_disagreement_score":0.440368,"about_ca_system_score_codex":0.000045684243,"about_ca_system_score_gemma":0.000112180336,"threshold_uncertainty_score":0.99974483},"labels":[],"label_agreement":null},{"id":"W3090497192","doi":"10.1257/aer.104.3.898","title":"Strategic Interaction and Networks","year":2014,"lang":"en","type":"article","venue":"American Economic Review","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":470,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Nash equilibrium; Economics; Mathematical economics; Microeconomics; Eigenvalues and eigenvectors; Class (philosophy); Game theory; Graph; Social network (sociolinguistics); Strategic interaction; Econometrics; Computer science; Mathematics; Physics; Combinatorics","score_opus":0.10121408255617904,"score_gpt":0.40676588526191687,"score_spread":0.30555180270573784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090497192","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.56026876,0.02214908,0.02280002,0.012927348,0.00060248224,0.0009051086,0.0000075744083,0.00012158373,0.38021803],"genre_scores_gemma":[0.98377323,0.013447187,0.00015802964,0.002238292,0.000077500335,0.00002214847,0.0000016400871,0.00000455275,0.00027743596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990601,0.00018452584,0.00035784394,0.00025356835,0.000049691822,0.00009430492],"domain_scores_gemma":[0.998644,0.0005832514,0.00030461486,0.000383876,0.000016494852,0.00006778101],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014583108,0.000069245834,0.00028109585,0.000029627474,0.00005104433,0.00007159038,0.0002225069,0.000009135282,0.00045860064],"category_scores_gemma":[0.000103889826,0.000051751573,0.000050675317,0.00011848155,0.00015828272,0.00011779166,0.000036865014,0.00006317868,0.0012074654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016053086,0.0000045334587,0.0003510889,0.000007634954,0.0000041529665,5.0477784e-8,0.000007993145,0.00014583406,0.0000029734272,0.0605349,0.0027641703,0.93617505],"study_design_scores_gemma":[0.000089639696,0.00008961106,0.0037372997,0.00016497383,0.000029591543,0.000029109402,0.00032515574,0.014949301,0.000004311189,0.076573856,0.90379745,0.00020969054],"about_ca_topic_score_codex":0.00002227068,"about_ca_topic_score_gemma":0.000015934405,"teacher_disagreement_score":0.93596536,"about_ca_system_score_codex":0.00001457826,"about_ca_system_score_gemma":0.000010334753,"threshold_uncertainty_score":0.9995702},"labels":[],"label_agreement":null},{"id":"W3099896668","doi":"10.1145/2701615","title":"A Bounded Budget Network Creation Game","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Nash equilibrium; Bounded function; Neighbourhood (mathematics); Undirected graph; Graph; Best response; Discrete mathematics; Mathematical optimization","score_opus":0.14643101472649359,"score_gpt":0.3982721749475645,"score_spread":0.25184116022107095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099896668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018882787,0.00004341285,0.96505755,0.004141791,0.00068183383,0.0003043254,0.000037943482,0.00019837134,0.01065196],"genre_scores_gemma":[0.9538248,0.000013968185,0.03433277,0.0007040947,0.0002743563,0.00013861616,0.0000098847595,0.00002250879,0.010678989],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975775,0.00022934853,0.0004741535,0.0004825665,0.00092359487,0.0003128408],"domain_scores_gemma":[0.9969852,0.000924386,0.00013197697,0.0013496,0.0003221489,0.00028666973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018733997,0.00016932144,0.00022938315,0.00018283242,0.00031087102,0.00025579875,0.00091314653,0.00011107081,0.0007777867],"category_scores_gemma":[0.00050883286,0.00013888489,0.00014094528,0.0012918672,0.00015834592,0.00033390566,0.0000122300435,0.0002444048,0.0032129714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016113701,0.0005473851,0.00009590032,0.0000018172025,0.00006662428,0.000007195935,0.0022174146,0.045655977,0.00011750043,0.018084463,0.011747375,0.9212972],"study_design_scores_gemma":[0.00083587354,0.00020900027,0.0011598933,0.000011056994,0.00004043494,0.00002978123,0.0011182465,0.009590411,0.0008195586,0.8228446,0.16306143,0.00027967463],"about_ca_topic_score_codex":0.000033710843,"about_ca_topic_score_gemma":0.000035761776,"teacher_disagreement_score":0.934942,"about_ca_system_score_codex":0.00007234596,"about_ca_system_score_gemma":0.00011079671,"threshold_uncertainty_score":0.9975631},"labels":[],"label_agreement":null},{"id":"W3103192925","doi":"10.3982/ecta14953","title":"Cheap Talk With Endogenous Conflict of Interest","year":2020,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Communication source; Cheap talk; Mathematical economics; Principal (computer security); Competitive equilibrium; Economics; Microeconomics; Signaling game; Sign (mathematics); Information transmission; Inverse demand function; Set (abstract data type); Complete information; Computer science; Econometrics; Demand curve; Mathematics; Computer security","score_opus":0.5451282260273954,"score_gpt":0.37053165832389007,"score_spread":0.17459656770350535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103192925","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.8846893,0.00018626759,0.0038283141,0.0028926472,0.000035050412,0.00018483457,0.00005141566,0.00003374221,0.10809846],"genre_scores_gemma":[0.9987623,0.000006101538,0.00041009372,0.00038878716,0.0000408628,0.000010320795,0.0000018849453,0.0000059766935,0.00037369257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990839,0.000037070724,0.0003531976,0.00027668674,0.0001330825,0.00011608265],"domain_scores_gemma":[0.99843884,0.0007749352,0.00020158736,0.00035593536,0.000085065076,0.00014362663],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042920216,0.00007139043,0.00022688182,0.0002592172,0.00004425094,0.000050153176,0.00057939626,0.000025065377,0.0030754162],"category_scores_gemma":[0.0009313281,0.000050505958,0.00005849059,0.0020252946,0.000114213,0.00010357641,0.000076249016,0.00007223453,0.0008242248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076737785,0.0011403614,0.05141384,0.00006218044,0.0004000718,0.00006508953,0.013780849,0.0010533973,0.031990964,0.50314426,0.024119599,0.372062],"study_design_scores_gemma":[0.0010137619,0.0010133334,0.014809603,0.000007804331,0.00002765384,0.00004035243,0.0021739565,0.0005867878,0.04281381,0.0150878895,0.9220674,0.00035763677],"about_ca_topic_score_codex":0.0000074332575,"about_ca_topic_score_gemma":0.000003143922,"teacher_disagreement_score":0.8979478,"about_ca_system_score_codex":0.000008734339,"about_ca_system_score_gemma":0.0000266363,"threshold_uncertainty_score":0.99995375},"labels":[],"label_agreement":null},{"id":"W3106705281","doi":"10.1137/20m1381873","title":"Continuous-Time Convergence Rates in Potential and Monotone Games","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Monotonic function; Convergence (economics); Nash equilibrium; Dual (grammatical number); Descent (aeronautics); Space (punctuation); Characterization (materials science); Mathematical economics; Combinatorics; Applied mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.01393125534008791,"score_gpt":0.28772056245212557,"score_spread":0.27378930711203764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106705281","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.83515096,0.0008635701,0.15629855,0.0061557726,0.0002792801,0.00040341448,0.000035047633,0.000023089251,0.00079033786],"genre_scores_gemma":[0.9977973,0.00015487558,0.0006113621,0.00051387964,0.000053933578,0.000020975125,0.0000026798523,0.0000060750995,0.0008389175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845535,0.0003819756,0.00040493044,0.00022433691,0.0003900742,0.00014332402],"domain_scores_gemma":[0.99906206,0.00038689177,0.00023595357,0.00011455476,0.000107910426,0.00009263328],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018433086,0.00009150968,0.00021280657,0.00020709987,0.00042635348,0.00021453558,0.00017761177,0.000027965796,0.0010382615],"category_scores_gemma":[0.00027697545,0.00007248366,0.000037371177,0.0002667092,0.00007237164,0.00022675123,0.00004961018,0.00021381161,0.000016318472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004529311,0.00009920883,0.0033641427,9.626165e-7,0.000014525196,0.00002017571,0.00028045068,0.9786513,0.002193408,0.0039722454,0.0005386299,0.010412059],"study_design_scores_gemma":[0.0032356256,0.0003604158,0.011307238,0.00000994046,0.000021495924,0.00017701567,0.00091056764,0.95353466,0.00009369102,0.027094422,0.0030637493,0.00019116577],"about_ca_topic_score_codex":0.0000025479887,"about_ca_topic_score_gemma":8.704277e-7,"teacher_disagreement_score":0.16264637,"about_ca_system_score_codex":0.000018339482,"about_ca_system_score_gemma":0.00003048592,"threshold_uncertainty_score":0.99987495},"labels":[],"label_agreement":null},{"id":"W3111594854","doi":"10.3982/qe944","title":"Specification and estimation of network formation and network interaction models with the exponential probability distribution","year":2020,"lang":"en","type":"article","venue":"Quantitative Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; University of North Carolina at Chapel Hill; National Institute of Child Health and Human Development; Social Sciences and Humanities Research Council of Canada; Gillings School of Public Health","keywords":"Friendship; Computer science; Interaction network; Exponential random graph models; Interaction model; Network formation; Econometrics; Theoretical computer science; Mathematics; Psychology; Social psychology","score_opus":0.17961362273666767,"score_gpt":0.34191561339381416,"score_spread":0.16230199065714648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111594854","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.5232535,0.000025311736,0.47458348,0.0017015688,0.000020322506,0.0002193959,0.000018238617,0.000007244695,0.00017092173],"genre_scores_gemma":[0.9905378,0.000029105759,0.00924596,0.00005007484,0.000053105057,0.000025432815,0.000050157607,0.000003859371,0.000004497755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905294,0.00015904671,0.0003873622,0.00022498771,0.00008894543,0.00008668699],"domain_scores_gemma":[0.9984722,0.00077100645,0.0004363273,0.00015987424,0.00011878546,0.000041794214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011092396,0.000076836855,0.00014722993,0.000013974719,0.00018669879,0.00010666048,0.00010969865,0.000029283914,0.000010677075],"category_scores_gemma":[0.00016555518,0.0000526695,0.000021800643,0.0002011665,0.00018462523,0.0008758507,0.000041182553,0.00007259918,0.000008873271],"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.00018843451,0.000009906292,0.00025104685,0.0000054959646,0.000007940816,1.2052315e-8,0.0016647999,0.44818905,0.00003095778,0.54105014,0.0003530907,0.008249135],"study_design_scores_gemma":[0.00012415575,0.000091529866,0.004919375,0.0000062127733,0.000012159766,0.0000011717332,0.0013220034,0.6851678,0.00012006497,0.30769312,0.0004901724,0.00005224509],"about_ca_topic_score_codex":0.0000033335282,"about_ca_topic_score_gemma":0.000029151932,"teacher_disagreement_score":0.4672843,"about_ca_system_score_codex":0.000021601558,"about_ca_system_score_gemma":0.000014980519,"threshold_uncertainty_score":0.21477999},"labels":[],"label_agreement":null},{"id":"W3112432176","doi":"10.1080/1350178x.2020.1868774","title":"Economic methodology: a bibliometric perspective","year":2021,"lang":"en","type":"article","venue":"Journal of Economic Methodology","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Sherbrooke; Université du Québec à Montréal","funders":"Social Sciences and Humanities Research Council of Canada; Canada Research Chairs","keywords":"Library science; Philosophy of science; Sociology; Humanities; Philosophy; Computer science; Epistemology","score_opus":0.6187696830018693,"score_gpt":0.5565729480956149,"score_spread":0.062196734906254436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112432176","genre_codex":"empirical","genre_gemma":"methods","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.7238261,0.002364168,0.23968619,0.009433393,0.003664053,0.00011641928,0.000030453315,0.000015943246,0.02086328],"genre_scores_gemma":[0.42279145,0.00052670686,0.569944,0.0011771516,0.0014653221,0.000009954408,0.0000014430731,0.00003220656,0.004051707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897799,0.0072846795,0.0018414606,0.00055111386,0.0001997697,0.00034311437],"domain_scores_gemma":[0.95769644,0.03879565,0.001871787,0.0007544553,0.0006355694,0.0002460892],"candidate_categories":["metaresearch","bibliometrics","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.036327165,0.00018581949,0.0011848806,0.012669264,0.00012665626,0.00014522663,0.0011834322,0.00020706504,0.007592477],"category_scores_gemma":[0.023173938,0.00015318283,0.0005488491,0.0052056876,0.0002699944,0.00042030952,0.00023195322,0.00046819737,0.0014584052],"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.00032662696,0.00011389077,0.0043404233,0.000003734742,0.00046589915,0.000097362456,0.0014038627,0.0042751958,0.011349948,0.8912426,0.018955085,0.06742535],"study_design_scores_gemma":[0.0006576437,0.00016619473,0.008023344,0.0000037963073,0.00007290667,0.0021190948,0.005455873,0.0001586693,0.009785775,0.9348748,0.038514458,0.00016744742],"about_ca_topic_score_codex":0.000029447492,"about_ca_topic_score_gemma":0.00006609028,"teacher_disagreement_score":0.33025786,"about_ca_system_score_codex":0.00037002453,"about_ca_system_score_gemma":0.0008820456,"threshold_uncertainty_score":0.9993191},"labels":[],"label_agreement":null},{"id":"W3113980133","doi":"10.1109/tsmc.2020.3041462","title":"The Graph Model for Conflict Resolution and Decision Support","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preference; Conflict resolution; Management science; Probabilistic logic; Operations research; Computer science; Artificial intelligence; Mathematics; Engineering; Political science; Statistics","score_opus":0.10870109598455466,"score_gpt":0.3303278015462849,"score_spread":0.22162670556173023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113980133","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.02787759,0.00070505554,0.9679066,0.00066376594,0.00059461105,0.0012441211,0.00017308968,0.00006970445,0.0007654774],"genre_scores_gemma":[0.995349,0.00024812733,0.00024162527,0.00012705488,0.00009762858,0.0003148684,0.0000020694915,0.00002317034,0.0035964618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974789,0.0001764663,0.00083186437,0.00057326833,0.000659709,0.00027978703],"domain_scores_gemma":[0.99706393,0.0016405066,0.00024546916,0.0005184947,0.0002467554,0.00028485645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018213001,0.00021229323,0.00034974958,0.00011301172,0.0008711187,0.00070244016,0.00038070627,0.00013702523,0.0000046934715],"category_scores_gemma":[0.00005773588,0.0001416885,0.000114633745,0.00032809062,0.00021441646,0.0001250744,0.0000051911106,0.0001693934,0.00006190196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013520678,0.0002411349,0.000079898535,0.00027946,0.00025555518,0.0000054686675,0.01019035,0.6039675,0.003546815,0.2453289,0.033445857,0.10130701],"study_design_scores_gemma":[0.0007010772,0.00024897984,0.000031293595,0.000049747778,0.000052863772,0.00003858601,0.002820963,0.9350758,0.00011395973,0.0051159635,0.055531908,0.00021885369],"about_ca_topic_score_codex":0.000034247947,"about_ca_topic_score_gemma":0.000029339091,"teacher_disagreement_score":0.96766496,"about_ca_system_score_codex":0.000020657102,"about_ca_system_score_gemma":0.00003824087,"threshold_uncertainty_score":0.67736465},"labels":[],"label_agreement":null},{"id":"W3119266102","doi":"10.1109/cdc42340.2020.9304211","title":"On the Rate of Convergence of Continuous-Time Game Dynamics in N-Player Potential Games","year":2020,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Convergence (economics); Best response; Mathematical economics; Potential game; Computer science; Game theory; Dynamics (music); Rate of convergence; Mathematical optimization; Mathematics; Economics; Physics; Telecommunications","score_opus":0.044722215469285426,"score_gpt":0.3114452418871306,"score_spread":0.2667230264178452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119266102","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.9753108,0.0000061815367,0.008516921,0.0058274837,0.000036318914,0.00016452333,0.000029280898,0.0000105455365,0.010097944],"genre_scores_gemma":[0.9972294,0.0000031774903,0.00008716378,0.00070760766,0.000008832931,0.0000055775695,0.0000012962345,0.000003689299,0.0019532572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987139,0.00020588249,0.00047072134,0.00020595381,0.00030189866,0.00010163383],"domain_scores_gemma":[0.9979493,0.0013409258,0.00020176705,0.0003371739,0.00012773226,0.00004312329],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011931274,0.00007069643,0.00021773495,0.000049835126,0.000020719128,0.000018739638,0.00062618626,0.000033637334,0.0042439806],"category_scores_gemma":[0.0010433672,0.00004017891,0.00007340361,0.0005003303,0.00018630634,0.000061043895,0.00007837862,0.00008443978,0.0005814468],"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.0001864378,0.00011216866,0.002030341,0.0000035063947,0.0000138327805,0.0000022201864,0.00072728266,0.0021560849,0.055658326,0.9327311,0.004135456,0.0022432578],"study_design_scores_gemma":[0.00084663427,0.0003453741,0.017406192,0.000030100722,0.000021118909,0.0000025426746,0.005191489,0.34802276,0.11298428,0.51333326,0.0015452106,0.0002710744],"about_ca_topic_score_codex":0.000022400645,"about_ca_topic_score_gemma":0.000011977949,"teacher_disagreement_score":0.41939783,"about_ca_system_score_codex":0.000007172995,"about_ca_system_score_gemma":0.000027613685,"threshold_uncertainty_score":0.99666625},"labels":[],"label_agreement":null},{"id":"W3119854094","doi":"10.3390/jrfm14010034","title":"Market Graph Clustering via QUBO and Digital Annealing","year":2021,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Medoid; Cluster analysis; Computer science; Quadratic equation; Simulated annealing; Clustering coefficient; Graph; Binary number; Theoretical computer science; Data mining; Algorithm; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.0209712461692916,"score_gpt":0.2847927307988203,"score_spread":0.2638214846295287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119854094","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.62941176,0.00091993157,0.36426112,0.00027894176,0.00021951292,0.000059071608,0.000012708489,0.0000048022184,0.004832176],"genre_scores_gemma":[0.9960905,0.0010284843,0.0021356298,0.000080710866,0.00010496518,0.0000010978442,3.053151e-7,0.0000033768122,0.0005549757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900115,0.00005209019,0.0003938132,0.00014861223,0.00029979087,0.000104566054],"domain_scores_gemma":[0.9992172,0.00021359,0.00024033795,0.00013577295,0.000115801486,0.00007730455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011914973,0.00006879875,0.00016833158,0.00013946084,0.00016462964,0.00027279733,0.00014135029,0.000020851068,0.00004069695],"category_scores_gemma":[0.0003072373,0.000052577136,0.00006658273,0.00029993276,0.000052023584,0.00025476475,0.00017052928,0.00010625096,0.000004653987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063509004,0.00003712438,0.00804558,0.000009006152,0.000011828986,0.0001093318,0.00033030042,0.00009620825,0.000021100692,0.004467049,0.0014557203,0.98535323],"study_design_scores_gemma":[0.00088227796,0.0000990559,0.27150145,0.00007452881,0.00007907169,0.00026796517,0.0023819024,0.0007309722,0.00006257861,0.48021206,0.24351123,0.00019689386],"about_ca_topic_score_codex":0.0000014146626,"about_ca_topic_score_gemma":0.000008173048,"teacher_disagreement_score":0.98515636,"about_ca_system_score_codex":0.000006041451,"about_ca_system_score_gemma":0.000010059379,"threshold_uncertainty_score":0.26305908},"labels":[],"label_agreement":null},{"id":"W3121554704","doi":"","title":"Non-Deteriorating Choice without Full Transitivity","year":2006,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"Université de Montréal","funders":"","keywords":"Rationalizability; Rationality; Transitive relation; Status quo; Mathematical economics; Element (criminal law); Ecological rationality; Social choice theory; Rational choice theory (criminology); Economics; Microeconomics; Mathematics; Epistemology; Nash equilibrium; Political science; Philosophy; Combinatorics; Law","score_opus":0.1005339546856504,"score_gpt":0.4172882519807251,"score_spread":0.3167542972950747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121554704","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.843723,0.000019869482,0.00026729965,0.00050486723,0.0002096881,0.000754506,0.00010110083,0.000039420396,0.15438022],"genre_scores_gemma":[0.9932337,0.00011954401,0.0015419754,0.00006489488,0.00035753322,0.00032551156,0.00003272286,0.000046249967,0.004277894],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.994874,0.00072271546,0.0012357408,0.0015772172,0.00078511296,0.0008052096],"domain_scores_gemma":[0.9938317,0.0031282615,0.00039755288,0.002130265,0.00029013545,0.00022209428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010694868,0.00034190412,0.0007558336,0.00064492534,0.0003614644,0.00069159194,0.0019611928,0.00045194983,0.00019306812],"category_scores_gemma":[0.0016760336,0.00032576552,0.00027428634,0.00040121618,0.00056645955,0.00021686345,0.0010828177,0.0020260653,0.00015001169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001712619,0.0003896773,0.040327087,0.00008210008,0.00005264981,0.000025829426,0.0011373397,0.030696582,0.0059218802,0.0009428346,0.0003013175,0.91995144],"study_design_scores_gemma":[0.0032603398,0.00048307073,0.35281155,0.00086571736,0.000054425574,0.000065188375,0.0038351887,0.20497599,0.003587226,0.28161734,0.14480111,0.003642851],"about_ca_topic_score_codex":0.00021247592,"about_ca_topic_score_gemma":0.0020318863,"teacher_disagreement_score":0.9163086,"about_ca_system_score_codex":0.00038944476,"about_ca_system_score_gemma":0.0005527042,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W3121592419","doi":"","title":"Relative Importance, Specific Investment and Ownership in Interorganizational Systems","year":2007,"lang":"en","type":"article","venue":"Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University)","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Calgary; McGill University","funders":"","keywords":"Business; Investment (military); Industrial organization; Accounting; Finance; Political science; Law","score_opus":0.05606769936892223,"score_gpt":0.27946111225679887,"score_spread":0.22339341288787665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121592419","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12614582,0.0007928546,0.0533924,0.00044357433,0.0012705568,0.0016408559,0.00011563343,0.0002719457,0.8159264],"genre_scores_gemma":[0.88419366,0.0003366378,0.0026133112,0.00012557248,0.00021091974,0.000004153925,0.0003822994,0.00003531555,0.11209813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939448,0.00048324405,0.0011791984,0.001997751,0.001424528,0.0009704324],"domain_scores_gemma":[0.9964198,0.00061516964,0.0006291352,0.00097120454,0.00079270557,0.00057199097],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033863913,0.00076886156,0.0007067533,0.004557139,0.0027525465,0.00027850247,0.0018544459,0.00032892925,0.0003586392],"category_scores_gemma":[0.00014496235,0.0008410992,0.0002912744,0.0062636966,0.002341441,0.0020298937,0.0025591888,0.000619725,0.001004772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043145244,0.00093505206,0.011402051,0.0001341125,0.00031606702,0.0016983566,0.0009548542,0.0019752102,0.000035359848,0.9735375,0.0047025057,0.0038774475],"study_design_scores_gemma":[0.003404998,0.0000746736,0.043749094,0.00041343088,0.0002136412,0.00007861018,0.0066336836,0.0010609159,0.000029845653,0.01446939,0.92891175,0.0009599751],"about_ca_topic_score_codex":0.000029775416,"about_ca_topic_score_gemma":0.00078345917,"teacher_disagreement_score":0.9590681,"about_ca_system_score_codex":0.004773836,"about_ca_system_score_gemma":0.00031736892,"threshold_uncertainty_score":0.9997731},"labels":[],"label_agreement":null},{"id":"W3121755293","doi":"","title":"The Simple Analytics of Price Signaling Quality","year":2011,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"HEC Montréal","funders":"","keywords":"Monopoly; Microeconomics; Economics; Analytics; Profit (economics); Quality (philosophy); Economic surplus; Diagrammatic reasoning; Welfare; Outcome (game theory); Econometrics; Computer science; Data science","score_opus":0.2706160977361596,"score_gpt":0.47279918834188395,"score_spread":0.20218309060572437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121755293","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.8157919,0.000095628704,0.00016805329,0.0003239049,0.00015925226,0.0006131548,0.000085200736,0.00001765894,0.18274526],"genre_scores_gemma":[0.9956334,0.0010680191,0.00041986443,0.000027275903,0.000083133484,0.000089881076,0.000008648506,0.000019418,0.0026503298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494725,0.0012688298,0.001642584,0.0008363144,0.0007515426,0.0005534715],"domain_scores_gemma":[0.9841887,0.011677378,0.00075249077,0.0026914962,0.0005357055,0.00015428371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027731635,0.0001886315,0.000546664,0.0003437003,0.00034090533,0.00024811504,0.003047659,0.000261651,0.00028212974],"category_scores_gemma":[0.007905027,0.00013718494,0.00026216733,0.0004156237,0.00085982896,0.00007693809,0.0018921719,0.0012356292,0.000049247905],"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.00040465957,0.00051684905,0.024956826,0.00011575494,0.0002537702,0.000006135815,0.0034491357,0.043635186,0.0017056286,0.25505573,0.00045250388,0.66944784],"study_design_scores_gemma":[0.00021537108,0.00004617041,0.014024314,0.000043164473,0.000009132393,0.0000014641231,0.004454839,0.00436803,0.0021185111,0.9398231,0.034590576,0.00030534927],"about_ca_topic_score_codex":0.00011067228,"about_ca_topic_score_gemma":0.00028790947,"teacher_disagreement_score":0.68476737,"about_ca_system_score_codex":0.00020147573,"about_ca_system_score_gemma":0.00057565345,"threshold_uncertainty_score":0.96112865},"labels":[],"label_agreement":null},{"id":"W3122134399","doi":"10.2139/ssrn.3381563","title":"Robust Non-Bayesian Social Learning","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Computer science; Bayesian network; Class (philosophy); Artificial intelligence; Independent and identically distributed random variables; Focus (optics); Bayesian probability; Simple (philosophy); Machine learning; Theoretical computer science; Mathematics","score_opus":0.03594684648396415,"score_gpt":0.32461745270962383,"score_spread":0.28867060622565965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122134399","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.85272753,0.00015263286,0.11652997,0.0025381176,0.0002128922,0.00013231448,8.729303e-7,0.00003493304,0.027670726],"genre_scores_gemma":[0.9654306,0.000051370178,0.00008370692,0.00009119921,0.00034780713,0.0000030692618,9.581454e-7,0.000013235833,0.033978038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970553,0.00020932333,0.0003751582,0.00026461668,0.0006649242,0.0014306834],"domain_scores_gemma":[0.999035,0.0002712567,0.0002651471,0.0002077142,0.00014511644,0.000075774355],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006802939,0.000111210626,0.00019471464,0.00015133004,0.0005658242,0.00021709544,0.0007560252,0.0000729643,0.0008991545],"category_scores_gemma":[0.00024252712,0.000085318134,0.00016453817,0.0004958194,0.00005123053,0.00024672985,0.000055939534,0.001980986,0.0027608806],"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.0000682252,0.000077025165,0.012610138,0.0000014029288,0.000070667294,0.0000018049495,0.0010080596,0.003549744,0.0027529986,0.8456354,0.00097335054,0.13325119],"study_design_scores_gemma":[0.00044839675,0.00015992502,0.0032060347,0.0000040942273,0.000012045729,0.0001497351,0.007823205,0.0015745154,0.00007366509,0.9697747,0.016607385,0.00016625383],"about_ca_topic_score_codex":0.000006210651,"about_ca_topic_score_gemma":0.000054935277,"teacher_disagreement_score":0.13308492,"about_ca_system_score_codex":0.00023088657,"about_ca_system_score_gemma":0.000878075,"threshold_uncertainty_score":0.9980156},"labels":[],"label_agreement":null},{"id":"W3122400387","doi":"10.3982/te1204","title":"Dynamics of information exchange in endogenous social networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Office of the Chief Medical Examiner","funders":"","keywords":"Aggregate (composite); Private information retrieval; Information exchange; Computer science; Action (physics); Social learning; Network formation; Telecommunications network; Microeconomics; Welfare; Mathematical economics; Economics; Computer network; Telecommunications","score_opus":0.037174213512228424,"score_gpt":0.28745042933268455,"score_spread":0.2502762158204561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122400387","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.7474041,0.0000052432674,0.12793379,0.0014764979,0.00010638583,0.00016641425,0.000032501834,0.000018919116,0.12285614],"genre_scores_gemma":[0.9993512,0.000009387373,0.00027884566,0.00024539567,0.00006452617,0.000010565417,0.000015757814,0.0000047086905,0.000019587756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.00014203713,0.0005824425,0.0001261074,0.00009573892,0.00017240822],"domain_scores_gemma":[0.9985002,0.0009330134,0.0001879244,0.0002721089,0.00005616722,0.000050536637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026167769,0.000075068136,0.00022388002,0.00011801444,0.00005741615,0.000052116473,0.0004420099,0.00009351123,0.00049943087],"category_scores_gemma":[0.00047472774,0.000065848864,0.00006384063,0.0001912717,0.0004583323,0.00019930361,0.0000958833,0.00010718938,0.00017954971],"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.000027632146,0.000018728442,0.00014705508,0.0000016172191,0.0000017260473,3.3162276e-8,0.0003968748,0.0017575829,0.000003180344,0.9414817,0.000019134186,0.056144707],"study_design_scores_gemma":[0.00017645214,0.000022277836,0.00071461353,0.0000013323931,0.0000027637525,0.0000015344913,0.0002286412,0.20262145,0.00003659741,0.79545236,0.00068190857,0.00006005063],"about_ca_topic_score_codex":0.0000043311143,"about_ca_topic_score_gemma":0.000022338296,"teacher_disagreement_score":0.2519471,"about_ca_system_score_codex":0.00004484285,"about_ca_system_score_gemma":0.00001754213,"threshold_uncertainty_score":0.5468418},"labels":[],"label_agreement":null},{"id":"W3122762319","doi":"","title":"Competing for Consumer's Attention","year":2008,"lang":"en","type":"article","venue":"SSRN Electronic Journal","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":"HEC Montréal","funders":"","keywords":"Stochastic game; Nash equilibrium; Differential game; Bounded rationality; Mathematical economics; Best response; Strategy; Computer science; Economics; Microeconomics; Game theory; Mathematics; Mathematical optimization","score_opus":0.07418484695322355,"score_gpt":0.363072036492105,"score_spread":0.2888871895388815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122762319","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.8330971,0.0005613599,0.16298468,0.0012591876,0.00013781794,0.00014623663,0.0000035429023,0.000024261275,0.0017857935],"genre_scores_gemma":[0.9954791,0.0003025184,0.0005153939,0.00008244631,0.0001822803,0.000011768803,0.0000020048442,0.000008274719,0.0034162172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978624,0.000119210425,0.0003953897,0.00019016536,0.0003976583,0.0010351933],"domain_scores_gemma":[0.9986097,0.00062798505,0.00024324765,0.00020423347,0.00024807194,0.00006675868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055793896,0.000078930236,0.00014152254,0.00011010367,0.0007888707,0.000065138054,0.00044744046,0.000036781606,0.00007375107],"category_scores_gemma":[0.00067861035,0.000060195383,0.00015413469,0.00025677463,0.00009635807,0.00017265957,0.000024615552,0.00054587284,0.00027809833],"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.00007569695,0.000090432346,0.010115929,0.0000010870406,0.000065444096,0.0000016123875,0.00035112552,0.00007261664,0.0034402804,0.91929287,0.0010771035,0.0654158],"study_design_scores_gemma":[0.0004993057,0.00009862868,0.0017375142,0.0000039174042,0.000012427766,0.00093902875,0.003314558,0.0002750756,0.00013388786,0.97464585,0.01824183,0.000097996424],"about_ca_topic_score_codex":0.0000031468778,"about_ca_topic_score_gemma":0.000043212494,"teacher_disagreement_score":0.1624693,"about_ca_system_score_codex":0.00013342957,"about_ca_system_score_gemma":0.0006386801,"threshold_uncertainty_score":0.6067435},"labels":[],"label_agreement":null},{"id":"W3122839107","doi":"","title":"Conformism and Diversity Under Social Learning","year":2001,"lang":"en","type":"article","venue":"EUR Research Repository (Erasmus University Rotterdam)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Diversity (politics); Social learning; Microeconomics; Knowledge management; Sociology; Economics; Computer science","score_opus":0.24472839052685558,"score_gpt":0.4135302400978058,"score_spread":0.16880184957095024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122839107","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.8959091,0.000020676896,0.0010166363,0.0020320374,0.00007766329,0.0002106789,0.0000037072894,0.000077599776,0.100651935],"genre_scores_gemma":[0.91762066,0.000022891007,0.000041632335,0.00007836524,0.00013572643,9.0216986e-7,0.0000023858076,0.000007842585,0.08208961],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594355,0.001270153,0.00022307158,0.00058970036,0.0014850887,0.00048844767],"domain_scores_gemma":[0.9976494,0.0010398523,0.000115607516,0.00039811843,0.0005193462,0.00027772537],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030392124,0.00013878773,0.00021391048,0.000478726,0.005921365,0.00032519837,0.0010073609,0.00012295961,0.0002260497],"category_scores_gemma":[0.00024506196,0.0001365305,0.00010241285,0.0009986436,0.0007745716,0.0005880096,0.0016892923,0.00074857567,0.00034225135],"study_design_candidate":"observational","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.002953009,0.0008231464,0.5428956,0.00004385659,0.00032900603,0.0029310817,0.033954524,0.00056391937,0.041442294,0.25955454,0.06628984,0.048219163],"study_design_scores_gemma":[0.0028602718,0.00028179117,0.32224357,0.000023207122,0.000036445224,0.000250749,0.035538476,0.00066984945,0.0011792268,0.031158805,0.60516983,0.00058778346],"about_ca_topic_score_codex":0.00024537081,"about_ca_topic_score_gemma":0.00003541824,"teacher_disagreement_score":0.53888,"about_ca_system_score_codex":0.00014997402,"about_ca_system_score_gemma":0.00009862651,"threshold_uncertainty_score":0.9953728},"labels":[],"label_agreement":null},{"id":"W3123224329","doi":"","title":"Cooperative vs. Non-Cooperative Truels: Little Agreement, But Does That Matter?","year":2000,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nash equilibrium; Mathematical economics; Core (optical fiber); Unification; Stability (learning theory); Yield (engineering); Best response; Game theory; Economics; Computer science; Physics","score_opus":0.0916967525627015,"score_gpt":0.39726607603058217,"score_spread":0.3055693234678807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123224329","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.6523283,0.00006431283,0.000054079388,0.0022054035,0.00039072285,0.0015942535,0.0006192492,0.000032648783,0.34271103],"genre_scores_gemma":[0.9101353,0.002968186,0.00036120144,0.0005405462,0.00027519595,0.0009439076,0.00008822729,0.00005766303,0.084629744],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932297,0.001302447,0.0013442679,0.0021594986,0.0009493249,0.0010147758],"domain_scores_gemma":[0.99287474,0.00321401,0.0003829967,0.0027147878,0.00045557396,0.00035787153],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0062515573,0.0005456567,0.0010464475,0.0008055012,0.00056571956,0.001194415,0.002988186,0.00050424464,0.010627457],"category_scores_gemma":[0.0008961119,0.00040637498,0.00030116274,0.0004461408,0.0010462146,0.00037879747,0.0018817855,0.0020939468,0.0026913385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019476458,0.0020735683,0.035199024,0.00019633089,0.00078459317,0.00015604876,0.01889763,0.06798685,0.0030805639,0.009421448,0.013801947,0.8464543],"study_design_scores_gemma":[0.0055556213,0.0009941402,0.07552515,0.0012605344,0.00009444392,0.00006869705,0.049168468,0.029251106,0.03488226,0.29609507,0.5014737,0.005630776],"about_ca_topic_score_codex":0.00011481909,"about_ca_topic_score_gemma":0.000401436,"teacher_disagreement_score":0.8408236,"about_ca_system_score_codex":0.0006000274,"about_ca_system_score_gemma":0.0007920813,"threshold_uncertainty_score":0.99984246},"labels":[],"label_agreement":null},{"id":"W3123460849","doi":"","title":"Enumeration of Nash Equilibria for Two-Player Games","year":2009,"lang":"en","type":"article","venue":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","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":"McGill University","funders":"","keywords":"Enumeration; Polytope; Lexicographical order; Polyhedron; Nash equilibrium; Vertex (graph theory); Computer science; Implementation; Best response; Combinatorics; Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Mathematical optimization; Graph; Programming language","score_opus":0.11373391436001518,"score_gpt":0.44633680411319204,"score_spread":0.33260288975317687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123460849","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.98185116,0.00013621396,0.00018871666,0.009979725,0.000145206,0.0006753015,0.0005017323,0.0000095465175,0.006512411],"genre_scores_gemma":[0.9952445,0.0002564507,0.0033959353,0.0005128438,0.00028512158,0.000017677117,0.000009313523,0.000013481127,0.00026469093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931381,0.00019963058,0.0020941128,0.0013673824,0.00073777104,0.0024630027],"domain_scores_gemma":[0.98971313,0.003547845,0.0004974615,0.0010503922,0.001675278,0.0035158803],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.018600008,0.0003149598,0.0009775741,0.0013172176,0.0006019207,0.00073743,0.0021343865,0.00017346644,0.0002287703],"category_scores_gemma":[0.012353673,0.00026315384,0.00022438243,0.0013369417,0.008458352,0.0018498049,0.00062136946,0.00045980874,0.000036490655],"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.00012886533,0.00019992517,0.0033053237,0.000014499013,0.000008323788,2.6070984e-7,0.0000305934,0.00013808679,0.011924458,0.98036957,0.00007392732,0.0038061726],"study_design_scores_gemma":[0.0012454785,0.0009728638,0.04210584,0.000039915092,0.000020050093,0.000016636164,0.00062525796,0.032047436,0.02743148,0.89262867,0.0025240702,0.00034232534],"about_ca_topic_score_codex":0.00057108345,"about_ca_topic_score_gemma":0.00013112753,"teacher_disagreement_score":0.08774092,"about_ca_system_score_codex":0.00033309174,"about_ca_system_score_gemma":0.003142668,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W3123481608","doi":"10.3982/te2177","title":"A model of weighted network formation","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Economics","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":"McGill University","funders":"","keywords":"Reciprocal; Pairwise comparison; Network formation; Mathematical economics; Link (geometry); Microeconomics; Externality; Graph; Reciprocal inhibition; Investment (military); Economics; Computer science; Mathematics; Combinatorics; Artificial intelligence; Theoretical computer science","score_opus":0.1008492685250206,"score_gpt":0.33688891748781324,"score_spread":0.23603964896279264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123481608","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.7196899,0.000047535257,0.24631767,0.0007901081,0.0001934601,0.00022696336,0.00009631915,0.000027992732,0.03261003],"genre_scores_gemma":[0.9850264,0.0000924759,0.014279538,0.0002195498,0.00012139615,0.00003521642,0.00006376951,0.000015730138,0.00014589365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778247,0.00020722633,0.0011131304,0.00046979688,0.00019896096,0.0002284402],"domain_scores_gemma":[0.9967893,0.0010301411,0.0005402928,0.0012792402,0.00024402844,0.00011699106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025923583,0.00018368455,0.0005733213,0.00008539308,0.00007075727,0.00018624148,0.001033972,0.00029079293,0.0011407288],"category_scores_gemma":[0.0004195165,0.00015811481,0.00027574837,0.00015054221,0.00060148933,0.0001335469,0.0009755492,0.00036442076,0.00013132684],"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.00002600625,0.000030658884,0.0000073389556,0.000008222036,0.00001353177,1.292333e-7,0.00025545087,0.13935356,0.00004039958,0.8573323,0.00018614261,0.0027462924],"study_design_scores_gemma":[0.000054306955,0.000005387829,0.0000088848565,0.000014915406,0.000016103044,0.0000010319009,0.000092377704,0.449593,0.00045494284,0.54959476,0.00007792104,0.00008634267],"about_ca_topic_score_codex":0.0000010816586,"about_ca_topic_score_gemma":0.0000044323638,"teacher_disagreement_score":0.31023946,"about_ca_system_score_codex":0.00004669763,"about_ca_system_score_gemma":0.00018462914,"threshold_uncertainty_score":0.99977237},"labels":[],"label_agreement":null},{"id":"W3123488262","doi":"","title":"Sequential Equilibrium in Monotone Games: Theory-Based Analysis of Experimental Data","year":2006,"lang":"en","type":"preprint","venue":"UCL Discovery (University College London)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Yale University; National Science Foundation","keywords":"Mathematical economics; Monotone polygon; Game theory; Computer science; Mathematics; Economics","score_opus":0.08454988993108781,"score_gpt":0.34175521587883545,"score_spread":0.25720532594774764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123488262","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.93709403,0.00015649926,0.03586754,0.00023335715,0.00020485291,0.0006507955,0.021516519,0.000045681743,0.004230696],"genre_scores_gemma":[0.984414,0.000004725648,0.0008733396,0.000055590932,0.000039103,0.0000055918144,0.0016414498,0.000019822946,0.012946377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499017,0.0009848353,0.00078696036,0.0016404119,0.0012097446,0.00038788657],"domain_scores_gemma":[0.9936962,0.0011976513,0.0008291041,0.0039794026,0.0001721546,0.00012546974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023265798,0.0003985409,0.001189222,0.0024273323,0.00014949708,0.00016886972,0.004865855,0.00032773122,0.00080625096],"category_scores_gemma":[0.00018661917,0.00041864207,0.00064783666,0.004225917,0.0005922526,0.0011851386,0.0044568037,0.00045975807,0.000057146117],"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.006321221,0.006096134,0.034217987,0.00013594836,0.0037324713,0.0006980231,0.0020673783,0.4220872,0.018709315,0.48707795,0.017722769,0.0011336063],"study_design_scores_gemma":[0.008250461,0.00028508643,0.103346094,0.00032804508,0.006245986,0.000006757886,0.021724746,0.75208,0.0135395825,0.079119705,0.011670333,0.0034031542],"about_ca_topic_score_codex":0.0010669448,"about_ca_topic_score_gemma":0.0013245429,"teacher_disagreement_score":0.40795824,"about_ca_system_score_codex":0.00024790567,"about_ca_system_score_gemma":0.00067426474,"threshold_uncertainty_score":0.99982655},"labels":[],"label_agreement":null},{"id":"W3123503807","doi":"10.2139/ssrn.3564451","title":"Information Design in Coordination Games with Risk Dominant Equilibrium Selection","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Alberta","funders":"","keywords":"Intuition; Equilibrium selection; Information structure; Computer science; Coordination game; Pareto principle; Set (abstract data type); Sequential equilibrium; Mathematical economics; Pareto optimal; Class (philosophy); Complete information; Selection (genetic algorithm); Mathematical optimization; Game theory; Repeated game; Economics; Mathematics; Artificial intelligence","score_opus":0.029037631144427457,"score_gpt":0.29783515741860056,"score_spread":0.2687975262741731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123503807","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.37067944,0.000079768004,0.62542814,0.00313826,0.000028333036,0.0002067463,0.0000016453417,0.000021638225,0.00041604703],"genre_scores_gemma":[0.9988681,0.00010698861,0.00056612183,0.00014643665,0.00008772309,0.000016000839,0.0000020319576,0.000007303263,0.00019927477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745715,0.00042870213,0.0005292824,0.00015971143,0.0005937006,0.0008314842],"domain_scores_gemma":[0.9987041,0.00035667143,0.0004700546,0.00012415448,0.00025315842,0.00009190848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063071777,0.0001172915,0.00017212007,0.00024127575,0.00017533774,0.00023176795,0.00038334838,0.000055855075,0.00005571648],"category_scores_gemma":[0.0011300736,0.00008155153,0.000051418436,0.0012899021,0.000045319037,0.001443163,0.000026449849,0.0010479005,0.00022490969],"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.0026973053,0.00019786721,0.028553206,0.000007860269,0.00012698057,0.0000028042639,0.008301665,0.063520305,0.009405579,0.42435902,0.002236721,0.4605907],"study_design_scores_gemma":[0.0021097232,0.0014016947,0.0065165274,0.000016320932,0.000040280334,0.00028870028,0.010954007,0.044240195,0.0033778236,0.92356616,0.007176969,0.00031162283],"about_ca_topic_score_codex":0.000020147572,"about_ca_topic_score_gemma":0.00012020508,"teacher_disagreement_score":0.62818867,"about_ca_system_score_codex":0.00030895285,"about_ca_system_score_gemma":0.0009832355,"threshold_uncertainty_score":0.45526648},"labels":[],"label_agreement":null},{"id":"W3123506665","doi":"10.1016/b978-0-444-53766-9.00003-3","title":"Games on Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Handbook of game theory and economic applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":313,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Computer science","score_opus":0.04201341203048288,"score_gpt":0.3036036612163156,"score_spread":0.26159024918583274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123506665","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027884246,0.0016664303,0.23438348,0.00017807235,0.0000982741,0.0008274944,0.00018477981,0.000067432215,0.7623152],"genre_scores_gemma":[0.21966843,0.001641871,0.0003340321,0.00059779413,0.0006714025,0.00041340734,0.00007141574,0.00009261006,0.77650905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975439,0.0001248649,0.0010347032,0.00084988656,0.00021196417,0.00023473304],"domain_scores_gemma":[0.9933059,0.0038898038,0.00091994123,0.0016065447,0.00008853334,0.00018926982],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0028112228,0.00037976124,0.0007698797,0.00028324535,0.00020882634,0.000094987576,0.0008783739,0.00034327665,0.0026413694],"category_scores_gemma":[0.00007682139,0.00033130535,0.00026225677,0.000037805108,0.0008783406,0.00006702256,0.00017339694,0.0003367268,0.0031173655],"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.00007933683,0.00001342273,0.000004802908,0.0000062714494,0.000044709832,1.268172e-7,0.00005849205,0.00047447358,0.000013830058,0.8949596,0.0023292215,0.102015704],"study_design_scores_gemma":[0.00013859282,0.000048553306,0.000013207913,0.000064014006,0.00004799535,0.000004769068,0.000023006973,0.00019722182,0.00010099397,0.60710114,0.39205754,0.00020298788],"about_ca_topic_score_codex":0.0000014554624,"about_ca_topic_score_gemma":0.0000058016367,"teacher_disagreement_score":0.3897283,"about_ca_system_score_codex":0.0000446519,"about_ca_system_score_gemma":0.000062340616,"threshold_uncertainty_score":0.9999139},"labels":[],"label_agreement":null},{"id":"W3123605421","doi":"","title":"Games on Networks","year":2012,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Focus (optics); Computer science; Network structure; Peer effects; Network formation; Game theory; Diffusion; Industrial organization; Microeconomics; Business; Theoretical computer science; Economics; Psychology; World Wide Web; Social psychology","score_opus":0.14710075155292449,"score_gpt":0.4314537999426549,"score_spread":0.2843530483897304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123605421","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3777521,0.0002312428,0.000112701964,0.0016277473,0.00096520956,0.000948902,0.00006026922,0.00006218787,0.61823964],"genre_scores_gemma":[0.9855881,0.0016915784,0.0002445179,0.0002479914,0.00061538204,0.0003158735,0.000021737116,0.000038974067,0.01123588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955773,0.00081011665,0.000895332,0.0011632652,0.000679415,0.0008746103],"domain_scores_gemma":[0.9898673,0.0067217583,0.00028363074,0.0026460413,0.00017251757,0.00030872572],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011748246,0.00026974943,0.0005343605,0.0006386024,0.00021762746,0.00040144226,0.0022987209,0.00048464094,0.00092310307],"category_scores_gemma":[0.0030265774,0.00023436404,0.00023097423,0.00031531297,0.00046521932,0.00011312576,0.0017098746,0.00226442,0.0006028116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087214896,0.00021688137,0.0035642167,0.000008862945,0.00002935181,0.0000050124645,0.0003235439,0.07872796,0.000014999016,0.024869336,0.0015493322,0.8906033],"study_design_scores_gemma":[0.00057977665,0.0001142859,0.031712625,0.00019682762,0.0000117431355,0.000010628719,0.0016808633,0.038859036,0.0001807556,0.3215972,0.60409355,0.00096273003],"about_ca_topic_score_codex":0.000012922638,"about_ca_topic_score_gemma":0.00005585298,"teacher_disagreement_score":0.88964057,"about_ca_system_score_codex":0.0003495366,"about_ca_system_score_gemma":0.00024252031,"threshold_uncertainty_score":0.99999017},"labels":[],"label_agreement":null},{"id":"W3123609882","doi":"","title":"Asymmetric Information And Product Differentiation","year":2002,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Information asymmetry; Product differentiation; Humanities; Political science; Economics; Philosophy; Microeconomics","score_opus":0.09333454318742225,"score_gpt":0.3776260537379148,"score_spread":0.28429151055049257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123609882","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.8310033,0.00022422094,0.0001337958,0.0014791717,0.0003523144,0.0012165385,0.00008803584,0.000044600543,0.16545802],"genre_scores_gemma":[0.99309975,0.0036863612,0.00035130777,0.000042108233,0.00011076406,0.00019271974,0.00004375362,0.000011858537,0.0024614069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703366,0.000402648,0.00092279614,0.00066757534,0.00060246646,0.0003708861],"domain_scores_gemma":[0.9966515,0.0013953816,0.00035644212,0.0011857519,0.00027651407,0.00013441537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055069043,0.00017877223,0.00034160056,0.0015865891,0.00019574577,0.0006915078,0.0008454489,0.00020841318,0.00020026624],"category_scores_gemma":[0.0045847,0.00016104618,0.000080754435,0.00058417406,0.00021657483,0.00044693355,0.0010358182,0.0009431224,0.00016669751],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014598592,0.00005234153,0.004426087,0.000025043779,0.000011219134,4.17101e-7,0.0003132851,0.0012199987,0.000013813402,0.0028455162,0.00023667038,0.99084103],"study_design_scores_gemma":[0.0009827439,0.00010921603,0.29146618,0.00011692556,0.000015776284,0.000016828233,0.0014011263,0.084728695,0.0004995558,0.35317868,0.26659286,0.00089141104],"about_ca_topic_score_codex":0.000016915823,"about_ca_topic_score_gemma":0.000029120178,"teacher_disagreement_score":0.9899496,"about_ca_system_score_codex":0.000230832,"about_ca_system_score_gemma":0.00012218261,"threshold_uncertainty_score":0.6668226},"labels":[],"label_agreement":null},{"id":"W3123621892","doi":"","title":"Delegating Decisions to Experts","year":2004,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Delegation; Pooling; Order (exchange); Decision maker; Process (computing); Business; Knowledge management; Value (mathematics); Decision-making; Public relations; Computer science; Management science; Political science; Economics; Marketing; Law; Artificial intelligence","score_opus":0.06677038200456795,"score_gpt":0.38904114734907236,"score_spread":0.3222707653445044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123621892","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.6626128,0.0002002189,0.32736853,0.005345897,0.00013833198,0.00015512736,0.0000014109993,0.000031478055,0.0041462006],"genre_scores_gemma":[0.9948047,0.00010264772,0.0020861505,0.0006144161,0.00023050526,0.000020712754,4.1280072e-7,0.000013191005,0.0021272663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660593,0.000103194674,0.00053899066,0.00030668275,0.0008314776,0.001613696],"domain_scores_gemma":[0.99832064,0.00060258596,0.00016009886,0.00044107792,0.00023256513,0.00024305377],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0057264376,0.00012223184,0.00017257922,0.00024911808,0.00062479806,0.00025140072,0.0010239934,0.00004929238,0.00019295931],"category_scores_gemma":[0.0029416431,0.00008822541,0.00013670558,0.0009153854,0.000041721607,0.00027968863,0.000095034186,0.00075610034,0.0016957436],"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.00001908861,0.000052480304,0.00012234728,6.3436936e-8,0.0000140958,0.000002490782,0.0006030027,0.0021809964,0.003195356,0.8153849,0.00036341458,0.17806172],"study_design_scores_gemma":[0.00028937418,0.00011977905,0.00026296437,0.000010736106,0.000004987095,0.00040368954,0.0056829057,0.000014850982,0.0007114964,0.97638184,0.016003005,0.0001143863],"about_ca_topic_score_codex":0.000016386342,"about_ca_topic_score_gemma":0.00052130467,"teacher_disagreement_score":0.33219188,"about_ca_system_score_codex":0.00047513674,"about_ca_system_score_gemma":0.0013589887,"threshold_uncertainty_score":0.99908155},"labels":[],"label_agreement":null},{"id":"W3123626961","doi":"10.2139/ssrn.2506643","title":"Stability in a Network Economy: The Role of Institutions","year":2014,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Business; Economics","score_opus":0.03999263065643434,"score_gpt":0.3255896122705721,"score_spread":0.28559698161413777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123626961","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.921895,0.00078921585,0.03589526,0.0022655807,0.00007020403,0.00014486226,0.0000015130015,0.000008448796,0.038929887],"genre_scores_gemma":[0.999566,0.000054633532,0.000043747965,0.00007185091,0.00012531618,0.000008100398,2.730097e-7,0.0000027636795,0.00012731696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811655,0.00038402426,0.00045012406,0.00014268848,0.00016203926,0.00074459607],"domain_scores_gemma":[0.99853975,0.00072794687,0.00020923807,0.0003862955,0.000097500124,0.00003929931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0138193285,0.00006106978,0.00014297916,0.00005847468,0.00023777132,0.00005145899,0.00070088974,0.00003183616,0.00009428318],"category_scores_gemma":[0.00064818934,0.000036430265,0.00008366346,0.0004917585,0.00016700047,0.00015316595,0.00004870804,0.0007645364,0.000060479226],"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.000010446076,0.000028863842,0.0088110855,1.4868033e-7,0.000006051442,1.8374267e-8,0.00013185646,0.0012959957,0.000054909906,0.96218723,0.000017461605,0.027455952],"study_design_scores_gemma":[0.00011978648,0.000041407166,0.0028072624,0.000002433326,0.000004123712,0.000019079076,0.0017795356,0.0007411244,0.00008624298,0.95949095,0.034870006,0.000038044633],"about_ca_topic_score_codex":0.00002756483,"about_ca_topic_score_gemma":0.0024844247,"teacher_disagreement_score":0.07767097,"about_ca_system_score_codex":0.00015670942,"about_ca_system_score_gemma":0.0011589298,"threshold_uncertainty_score":0.47895312},"labels":[],"label_agreement":null},{"id":"W3123697233","doi":"","title":"Indirect Information Exchange","year":2004,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Foreclosure; Subgame perfect equilibrium; Information exchange; Information sharing; Computer science; Perfect information; Microeconomics; Business; Economics; Game theory; Finance; World Wide Web; Telecommunications","score_opus":0.03463451738931014,"score_gpt":0.3288248725154183,"score_spread":0.29419035512610814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123697233","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.75302863,0.000803582,0.21339487,0.0059068194,0.00030462092,0.00020505548,0.0000058683863,0.000073601914,0.026276963],"genre_scores_gemma":[0.99770916,0.00035142398,0.00014477622,0.00028267197,0.00014136461,0.000007000693,0.0000020748366,0.00000435822,0.0013571866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978216,0.00007805489,0.00038806477,0.00010558548,0.00060454087,0.0010021528],"domain_scores_gemma":[0.999181,0.000109563196,0.00023714859,0.00023531204,0.0001593149,0.00007769831],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0058576954,0.00008186618,0.00011598581,0.00024452817,0.00030412432,0.0002109672,0.0005652658,0.00004806333,0.00018849762],"category_scores_gemma":[0.00049026293,0.000059254642,0.00008738097,0.00057683315,0.000043434004,0.000983315,0.000038144342,0.00080287654,0.0020858336],"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.00001794615,0.000027378834,0.0001865771,5.163207e-7,0.000017030214,4.376073e-7,0.00077699416,0.00024100616,0.000097683565,0.78702706,0.00025803506,0.21134932],"study_design_scores_gemma":[0.00036098255,0.00007913837,0.00080724526,0.0000030844176,0.0000054579273,0.00023605415,0.001972215,0.000008307041,0.00027607175,0.9564528,0.03972545,0.000073237425],"about_ca_topic_score_codex":0.000010982971,"about_ca_topic_score_gemma":0.00014877073,"teacher_disagreement_score":0.24468052,"about_ca_system_score_codex":0.0003926741,"about_ca_system_score_gemma":0.0010210685,"threshold_uncertainty_score":0.99869114},"labels":[],"label_agreement":null},{"id":"W3124101834","doi":"","title":"A Limit Theorem for Systems of Social Interactions","year":2006,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Convergence (economics); Homogeneity (statistics); Mathematical economics; Class (philosophy); Mathematics; Limit (mathematics); Benchmark (surveying); Central limit theorem; Statistical physics; Computer science; Economics; Physics; Mathematical analysis; Artificial intelligence; Geography; Statistics","score_opus":0.15124389743320715,"score_gpt":0.4446054272658684,"score_spread":0.2933615298326612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124101834","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.61497426,0.000076906865,0.000824128,0.0011046121,0.0009996922,0.0025084177,0.0009532793,0.000043907883,0.3785148],"genre_scores_gemma":[0.98565006,0.00008263736,0.0004614729,0.000014310475,0.00036195922,0.0009127067,0.000052189163,0.000029634964,0.012435053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965684,0.0005332003,0.0012275645,0.0007896244,0.00044249534,0.0004387545],"domain_scores_gemma":[0.99207723,0.005716906,0.00054663443,0.0010698941,0.000507869,0.00008143817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073787984,0.00018753982,0.0006041825,0.0006993744,0.00025555457,0.00027938935,0.001485682,0.00027597838,0.00010641422],"category_scores_gemma":[0.0018961984,0.00017276825,0.0003410612,0.00025734294,0.00048487852,0.00009576406,0.00076668727,0.0008389747,0.000030112433],"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.0004626102,0.00079059973,0.0022522665,0.00025312856,0.00018579335,0.0000034411107,0.002258236,0.04799817,0.00081374677,0.519351,0.005759462,0.41987157],"study_design_scores_gemma":[0.0009172369,0.00012304418,0.0070074974,0.0002082773,0.000029221397,0.000009607211,0.0074440506,0.0438976,0.00047864756,0.55626947,0.38297287,0.0006424995],"about_ca_topic_score_codex":0.00006560738,"about_ca_topic_score_gemma":0.00022595456,"teacher_disagreement_score":0.41922906,"about_ca_system_score_codex":0.00032301812,"about_ca_system_score_gemma":0.00039067763,"threshold_uncertainty_score":0.7045285},"labels":[],"label_agreement":null},{"id":"W3124561747","doi":"10.5167/uzh-174751","title":"Communication, timing, and common learning","year":2011,"lang":"en","type":"preprint","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Common knowledge (logic); Computer science; Common sense; Common cause and special cause; Common ground; Artificial intelligence; Psychology; Communication; Engineering; Operations management","score_opus":0.09839434299701874,"score_gpt":0.32387773606035997,"score_spread":0.22548339306334123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124561747","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.8030695,0.0007260831,0.009716626,0.0005212676,0.00009530762,0.00071438414,0.000051546347,0.00005549263,0.1850498],"genre_scores_gemma":[0.97522783,0.00042876005,0.0132554425,0.00003216806,0.000020068677,0.0000024016226,0.000035998397,0.000013141814,0.010984188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641037,0.0020212724,0.00036768295,0.0006963833,0.00032917372,0.00017513635],"domain_scores_gemma":[0.9955403,0.0021047834,0.0008172595,0.0011602048,0.00019258584,0.00018486874],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029525133,0.00021528408,0.00055504066,0.00022845775,0.0013487311,0.00028387023,0.0025836902,0.000155743,0.00013532524],"category_scores_gemma":[0.00015750901,0.00022468365,0.00010174848,0.00020739205,0.0008509736,0.00036101928,0.0075064977,0.0007022225,0.000029952425],"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.0015690294,0.0017579178,0.27206212,0.0005272157,0.0010785018,0.00020217078,0.15343748,0.0013519007,0.007979623,0.40534365,0.061245337,0.093445055],"study_design_scores_gemma":[0.0009557659,0.0002391061,0.21231453,0.00038470307,0.0003004457,0.00009432191,0.01739509,0.001914194,0.0004494742,0.68974966,0.07537294,0.0008297738],"about_ca_topic_score_codex":0.0013153035,"about_ca_topic_score_gemma":0.00016984246,"teacher_disagreement_score":0.284406,"about_ca_system_score_codex":0.0000146879265,"about_ca_system_score_gemma":0.00008263309,"threshold_uncertainty_score":0.99995136},"labels":[],"label_agreement":null},{"id":"W3124586607","doi":"10.1561/2000000048","title":"Interactive Sensing and Decision Making in Social Networks","year":2014,"lang":"en","type":"article","venue":"Foundations and Trends® in Signal Processing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stylized fact; Computer science; Variety (cybernetics); Social media; Data science; Reputation; Microblogging; Social network analysis; Social network (sociolinguistics); Management science; Artificial intelligence; World Wide Web; Social science; Engineering; Sociology","score_opus":0.06437555810217523,"score_gpt":0.4102390331691072,"score_spread":0.345863475066932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124586607","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.47577453,0.00007582489,0.51772606,0.00028070397,0.000033398996,0.00004904693,0.0000012226296,0.00001606551,0.0060431687],"genre_scores_gemma":[0.9960611,0.000002103536,0.0036927823,0.000080623075,0.00009386955,0.0000047379344,0.000003948657,0.0000070506144,0.000053807875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873537,0.00012403759,0.00040000788,0.00035420962,0.00021424108,0.00017212423],"domain_scores_gemma":[0.9984817,0.001157791,0.0001572029,0.0000888208,0.00007928953,0.00003520497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013787211,0.00010239573,0.00018065456,0.0005232967,0.00047740733,0.00052593835,0.00010672679,0.000059980237,0.00007785444],"category_scores_gemma":[0.00016786135,0.00008783012,0.000023103154,0.0011136179,0.00013464557,0.00049883843,0.00008348662,0.00019413356,0.0000054530465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002768281,0.000021336158,0.0022948023,0.0000015332971,0.0000012076042,9.550132e-7,0.0010948484,0.000787819,0.000032735406,0.003400876,0.0000273913,0.9923088],"study_design_scores_gemma":[0.00041349063,0.000019664554,0.08330047,0.00011310379,0.0000069926305,0.000014670077,0.0012116501,0.5470702,0.0000063940543,0.36644787,0.0012431713,0.00015231779],"about_ca_topic_score_codex":0.0000129535165,"about_ca_topic_score_gemma":0.00025843884,"teacher_disagreement_score":0.9921565,"about_ca_system_score_codex":0.000021745022,"about_ca_system_score_gemma":0.000014328977,"threshold_uncertainty_score":0.5071636},"labels":[],"label_agreement":null},{"id":"W3124730826","doi":"10.1287/mnsc.2015.2160","title":"Liking and Following and the Newsvendor: Operations and Marketing Policies Under Social Influence","year":2015,"lang":"en","type":"article","venue":"Management Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":130,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Newsvendor model; Microeconomics; Monopolistic competition; Postponement; Business; Economics; Production (economics); Incentive; Product (mathematics); Industrial organization; Profit (economics); Leverage (statistics); Marketing; Monopoly; Supply chain","score_opus":0.08990532899199445,"score_gpt":0.39234658703537817,"score_spread":0.30244125804338373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124730826","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.974643,0.00010614698,0.002926283,0.007918399,0.000049131868,0.0002128548,7.419372e-7,0.000019227524,0.014124248],"genre_scores_gemma":[0.9972652,0.000016039725,0.0010020367,0.00084008137,0.000021060512,0.00002008242,9.4352316e-8,0.0000024511507,0.0008329233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985156,0.00014733529,0.00019521853,0.00033959423,0.0006133216,0.0001889429],"domain_scores_gemma":[0.9991248,0.00046375697,0.0000506991,0.0002176136,0.000058641897,0.00008449052],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008972727,0.00007338087,0.00010089072,0.0001370812,0.0014493286,0.0011717754,0.00044686685,0.000012736665,0.0000037957377],"category_scores_gemma":[0.00084787776,0.00004589583,0.000016988643,0.0008005697,0.0014010634,0.0006159922,0.0007016334,0.000055807468,0.000008246044],"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.000020457755,0.000010930337,0.007435083,0.000003921415,0.0000096953345,0.0000013928868,0.00667941,0.00081877434,0.00043660088,0.95414126,0.00028785688,0.030154625],"study_design_scores_gemma":[0.0017514705,0.000023848082,0.51082444,0.000035448073,0.00006120735,0.000016005695,0.055957,0.016544752,0.000073690455,0.40446517,0.009915359,0.00033160832],"about_ca_topic_score_codex":0.00004594903,"about_ca_topic_score_gemma":0.000027474118,"teacher_disagreement_score":0.5496761,"about_ca_system_score_codex":0.000015037605,"about_ca_system_score_gemma":0.000019595534,"threshold_uncertainty_score":0.9998651},"labels":[],"label_agreement":null},{"id":"W3125263929","doi":"10.1111/j.1467-9396.2011.00950.x","title":"International R&amp;D Networks","year":2011,"lang":"en","type":"article","venue":"Review of International Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise comparison; Spillover effect; Stability (learning theory); Product (mathematics); Economics; Welfare; Microeconomics; Contrast (vision); Mathematical economics; Industrial organization; Computer science; Mathematics; Market economy","score_opus":0.19357615477449114,"score_gpt":0.3994959583872476,"score_spread":0.20591980361275647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125263929","genre_codex":"other","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.017027669,0.010099629,0.033008117,0.00454887,0.0032791242,0.00039087055,0.00013512922,0.000041232102,0.9314694],"genre_scores_gemma":[0.5634432,0.38676986,0.028993402,0.00786093,0.000993165,0.00011332441,0.00018226121,0.00004010323,0.011603782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985732,0.000046965913,0.0008443429,0.00024247909,0.00020623079,0.00008678864],"domain_scores_gemma":[0.998366,0.00026215307,0.0005264996,0.0004229154,0.00036776246,0.00005465761],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016042117,0.00008667337,0.00022708898,0.00011163885,0.00002616612,0.000031049956,0.0014455807,0.00003499441,0.011378859],"category_scores_gemma":[0.00075389206,0.000072154195,0.0001848196,0.0001151989,0.000079147016,0.00024769022,0.00016057292,0.0000777563,0.00086866895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029385505,0.00014445082,0.003598219,0.000037438167,0.00011571269,5.2414265e-7,0.00011349648,0.0002492613,0.000018415096,0.84506184,0.018247673,0.13238357],"study_design_scores_gemma":[0.00010749727,0.000008540773,0.0024990186,0.00031465644,0.000010399104,0.000013210769,0.000025671277,0.00184379,0.000060063325,0.054309104,0.9407067,0.00010134759],"about_ca_topic_score_codex":0.000006910532,"about_ca_topic_score_gemma":0.0000055639953,"teacher_disagreement_score":0.922459,"about_ca_system_score_codex":0.0000382249,"about_ca_system_score_gemma":0.000029632649,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W3125715386","doi":"10.1007/978-3-642-16170-4_23","title":"Braess’s Paradox for Flows over Time","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"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 Waterloo","funders":"","keywords":"Conjecture; Context (archaeology); Network topology; Flow (mathematics); Symmetry (geometry); Flow network","score_opus":0.04601507177148041,"score_gpt":0.33944348014179604,"score_spread":0.29342840837031564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125715386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012915888,0.00007462819,0.98894554,0.0010381069,0.0011733961,0.00064504496,0.000054526652,0.00006479241,0.006712365],"genre_scores_gemma":[0.3424372,0.000016010037,0.6137324,0.006754731,0.0035353897,0.0001455655,0.00003933757,0.00014449423,0.033194903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959788,0.000031331827,0.00067136646,0.0014714249,0.0013580711,0.0004890155],"domain_scores_gemma":[0.9937705,0.0036141297,0.0003471373,0.001724255,0.00036524588,0.0001787766],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003176126,0.00037608197,0.0005344992,0.00061699,0.00039669077,0.0006022552,0.0034009314,0.00040801073,0.00095082255],"category_scores_gemma":[0.0008428201,0.00028424535,0.00022206736,0.0005217645,0.0009843378,0.00030080316,0.00054381456,0.00070587423,0.0009405297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002843438,0.00004189068,0.000031485735,0.0000084468575,0.0000083774,0.0000074529808,0.000430303,0.006010155,0.004418505,0.058108274,0.00047821229,0.93042845],"study_design_scores_gemma":[0.00016951446,0.000057949186,0.000090222435,0.00004074332,0.0000073833876,0.000014690593,7.9581255e-8,0.07100398,0.0015549532,0.8616674,0.06504361,0.00034945883],"about_ca_topic_score_codex":0.0000034254122,"about_ca_topic_score_gemma":0.00006132643,"teacher_disagreement_score":0.930079,"about_ca_system_score_codex":0.000061251696,"about_ca_system_score_gemma":0.00031286734,"threshold_uncertainty_score":0.99996245},"labels":[],"label_agreement":null},{"id":"W3128422846","doi":"10.22331/q-2022-12-22-882","title":"Quantum game theory and the complexity of approximating quantum Nash equilibria","year":2022,"lang":"en","type":"preprint","venue":"Quantum","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada First Research Excellence Fund","keywords":"Nash equilibrium; Class (philosophy); Game theory; Mathematical economics; Quantum; Quantum complexity theory; Computational complexity theory; Normal-form game; Quantum pseudo-telepathy; Computer science; Extension (predicate logic); Mathematics; Quantum information; Repeated game; Quantum channel; Algorithm; Quantum mechanics; Artificial intelligence; Physics","score_opus":0.20144905272152383,"score_gpt":0.39976957924550244,"score_spread":0.1983205265239786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128422846","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.95672554,0.0017615756,0.026326716,0.003687113,0.0012127688,0.0017047898,0.0005384899,0.00017701183,0.00786599],"genre_scores_gemma":[0.9978515,0.00006936701,0.0005134513,0.00025120482,0.00015028457,0.00031490639,0.00005373194,0.000050673214,0.00074486464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892822,0.004777257,0.0021838613,0.0013243033,0.0018857068,0.00054668356],"domain_scores_gemma":[0.98380286,0.010596122,0.002115721,0.0030031863,0.00031317165,0.00016896032],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.026830008,0.00051690947,0.0014187625,0.0003112056,0.00061936065,0.00040908065,0.0035124563,0.00024627973,0.001732986],"category_scores_gemma":[0.0060351444,0.00033736764,0.0005437297,0.00078630465,0.004521158,0.0001700883,0.0050989254,0.0014773842,0.00011581849],"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.00037819005,0.00011616426,0.00016239678,0.00008030042,0.00007085452,0.0000023408563,0.0033909755,0.00023428455,0.00041570148,0.9927527,0.0008267825,0.0015693665],"study_design_scores_gemma":[0.00065024686,0.00004965508,0.0011546,0.0000611607,0.00007618922,0.000014750079,0.0059479745,0.10123266,0.00010263122,0.88717544,0.0031987617,0.00033594135],"about_ca_topic_score_codex":0.00013620143,"about_ca_topic_score_gemma":0.000010181637,"teacher_disagreement_score":0.105577216,"about_ca_system_score_codex":0.000050315713,"about_ca_system_score_gemma":0.0002463583,"threshold_uncertainty_score":0.99990785},"labels":[],"label_agreement":null},{"id":"W3128482301","doi":"10.1007/s00267-021-01429-2","title":"Will Peaceful Waters Flow Again? A Game-Theoretic Insight into a Tripartite Environmental Conflict in the Middle East","year":2021,"lang":"en","type":"article","venue":"Environmental Management","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":"Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"","keywords":"Conflict resolution; Status quo; Diplomacy; Politics; Game theory; Conflict analysis; Win-win game; Environmental resource management; Economics; Political science; Business; Microeconomics; Law","score_opus":0.047645456573103304,"score_gpt":0.26524406645739523,"score_spread":0.21759860988429192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128482301","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.97844833,0.0005023317,0.0015035651,0.0023328494,0.000152519,0.00083664776,0.0000422177,0.000028360102,0.016153174],"genre_scores_gemma":[0.9906443,0.0002494009,0.00057680166,0.0017287158,0.000047886395,0.00025908469,0.000077853394,0.000023524768,0.006392477],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.996254,0.00061970815,0.0006555223,0.00084123726,0.0011992226,0.00043027638],"domain_scores_gemma":[0.99824494,0.00023041773,0.00014573618,0.0012495057,0.0000029037337,0.00012648702],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014136423,0.00028922546,0.00027591072,0.00016112572,0.0002368994,0.00022384153,0.0010091064,0.000054394088,0.003012077],"category_scores_gemma":[0.00002738015,0.00020662318,0.00018273923,0.00038506815,0.00049462484,0.00036336062,0.0006102978,0.00022680144,0.0037758728],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089814706,0.014124878,0.034013506,0.0001541059,0.00080110383,0.0040267273,0.39566216,0.017171632,0.049228,0.15884481,0.008764693,0.31631023],"study_design_scores_gemma":[0.0027040285,0.00016592782,0.048333585,0.000054368087,0.000121681194,0.00006339399,0.095375836,0.0028236923,0.0025918654,0.047514267,0.7994544,0.0007969726],"about_ca_topic_score_codex":0.0000034601549,"about_ca_topic_score_gemma":0.000007508235,"teacher_disagreement_score":0.7906897,"about_ca_system_score_codex":0.00019036401,"about_ca_system_score_gemma":0.000006604866,"threshold_uncertainty_score":0.9978993},"labels":[],"label_agreement":null},{"id":"W3130255400","doi":"10.26686/ajl.v18i1.6539","title":"Ehrenfeucht-Fraïssé games without identity","year":2021,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Identity (music); Relation (database); Binary relation; Mathematics; Identity function; Binary number; Linguistics; Computer science; Discrete mathematics; Arithmetic; Philosophy; Data mining","score_opus":0.13659996050845932,"score_gpt":0.4161479154486735,"score_spread":0.2795479549402142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130255400","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.9511466,0.00044295148,0.017511927,0.018601181,0.00046683176,0.00008467263,0.0000064143337,0.000015531448,0.011723881],"genre_scores_gemma":[0.99205464,0.000029664703,0.0014727253,0.00038317445,0.00025250384,0.0000014592498,3.802726e-7,0.0000060036673,0.0057994355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974618,0.0004868939,0.000745158,0.00017956493,0.0009123676,0.0002142065],"domain_scores_gemma":[0.9974334,0.0005844946,0.00062916544,0.00065484695,0.000556284,0.00014176525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037272118,0.00011371424,0.00030046116,0.00010077103,0.00020197421,0.00033164443,0.0014314204,0.000054756536,0.002121122],"category_scores_gemma":[0.0016208522,0.000060285638,0.00025763744,0.0007542083,0.00024464636,0.0005128593,0.00011857283,0.00038158585,0.00055859156],"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.00023760399,0.0007573499,0.060355946,0.00001566754,0.00033080368,0.00074246817,0.0052710767,0.0016591817,0.04773475,0.73190755,0.050128616,0.100859],"study_design_scores_gemma":[0.00026274758,0.00006896154,0.04911023,0.000018941873,0.000047163412,0.0011697722,0.0024177225,0.000015837108,0.003661842,0.93277884,0.0103616305,0.00008632145],"about_ca_topic_score_codex":9.688649e-7,"about_ca_topic_score_gemma":0.000010287556,"teacher_disagreement_score":0.20087129,"about_ca_system_score_codex":0.000019886946,"about_ca_system_score_gemma":0.0001363429,"threshold_uncertainty_score":0.9987911},"labels":[],"label_agreement":null},{"id":"W3131275138","doi":"10.2139/ssrn.4441814","title":"The Interplay of Reciprocity Propensity and Inequality Aversion in Two-Person Games","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Windsor","funders":"","keywords":"Reciprocity (cultural anthropology); Inequity aversion; Inequality; Economics; Mathematical economics; Microeconomics; Positive economics; Social psychology; Psychology; Mathematics; Mathematical analysis","score_opus":0.10248126193289427,"score_gpt":0.4035793254539504,"score_spread":0.30109806352105617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131275138","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.9921835,0.00067473226,0.0034660066,0.0026969523,0.00023947269,0.00032344478,0.000011477762,0.000016908853,0.0003874838],"genre_scores_gemma":[0.9961175,0.0018757423,0.000054217362,0.000024891908,0.00008255223,0.000013918695,0.0000022877546,0.000011684085,0.0018172449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959657,0.0009930243,0.000804581,0.00047903802,0.0007784035,0.000979241],"domain_scores_gemma":[0.99678594,0.0014232426,0.00082179054,0.00061486353,0.00028292573,0.00007125284],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.028748125,0.00018413166,0.0004279292,0.00021512533,0.00032015756,0.00020283002,0.0011958097,0.00011789543,0.000014868878],"category_scores_gemma":[0.0024603955,0.00010999895,0.00015787693,0.00042438193,0.0002635147,0.00012566235,0.0006708438,0.0035409406,0.000036180903],"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.0013005644,0.00030356413,0.124491446,0.00005978515,0.0003346371,0.000010235228,0.008062986,0.0011349488,0.0018480852,0.4010561,0.0011113888,0.46028623],"study_design_scores_gemma":[0.00029667228,0.00007167681,0.020177467,0.00007755023,0.000016805143,0.00004014574,0.006829904,0.00041371695,0.00023859287,0.9712888,0.0004189886,0.00012970518],"about_ca_topic_score_codex":0.00035171057,"about_ca_topic_score_gemma":0.006576497,"teacher_disagreement_score":0.5702326,"about_ca_system_score_codex":0.00040397138,"about_ca_system_score_gemma":0.001323213,"threshold_uncertainty_score":0.99875796},"labels":[],"label_agreement":null},{"id":"W3135117498","doi":"10.1007/s00199-021-01346-9","title":"Persuasion with costly precision","year":2021,"lang":"en","type":"article","venue":"Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; National Circus School; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Fonds de Recherche du Québec-Société et Culture","keywords":"Communication source; Discretion; Cheap talk; Persuasion; Stochastic game; Computer science; Lying; Private information retrieval; Class (philosophy); Ex-ante; Microeconomics; Economics; Computer security; Computer network; Social psychology; Psychology; Political science; Artificial intelligence","score_opus":0.06297313119548337,"score_gpt":0.3525489887461278,"score_spread":0.2895758575506444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135117498","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.87963444,0.00013426419,0.010569404,0.0007240717,0.00021245703,0.00010297012,0.000019314177,0.000043067437,0.10855999],"genre_scores_gemma":[0.97733337,0.000010251199,0.00080503034,0.00028266423,0.00009208934,0.000013958726,0.0000052725964,0.000010912462,0.021446452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863786,0.00030596406,0.00029342753,0.0004463088,0.00016707138,0.00014934577],"domain_scores_gemma":[0.99719137,0.0017234697,0.0001181396,0.00080155657,0.00007575516,0.000089733316],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0024715709,0.00009458438,0.00017100222,0.00006789435,0.00016411759,0.00015132001,0.0004233365,0.000045215114,0.007924669],"category_scores_gemma":[0.00039047693,0.000066766406,0.00007269038,0.00014395958,0.00011702756,0.00021176664,0.00011125024,0.00009358627,0.0068283705],"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.00016999528,0.000049381073,0.0006042267,8.191601e-7,0.000015451347,0.000007337685,0.0005709597,0.0005421951,0.0020003403,0.8817039,0.0040927622,0.11024261],"study_design_scores_gemma":[0.000369965,0.00004267731,0.0030252945,0.000009623501,0.000009846646,0.000049986418,0.002547857,0.00021247136,0.010170321,0.8701147,0.11329991,0.00014737283],"about_ca_topic_score_codex":0.0000012675878,"about_ca_topic_score_gemma":0.000013540594,"teacher_disagreement_score":0.11009524,"about_ca_system_score_codex":0.000047471087,"about_ca_system_score_gemma":0.00012251835,"threshold_uncertainty_score":0.99394494},"labels":[],"label_agreement":null},{"id":"W3140798861","doi":"10.1016/j.jmateco.2023.102892","title":"Common assumption of rationality","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"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":"Lexicographical order; Impossibility; Rationality; Iterated function; Type (biology); Mathematical economics; Mathematics; Computer science; Combinatorics; Philosophy; Epistemology; Biology; Political science","score_opus":0.21185990613665406,"score_gpt":0.42890268902350537,"score_spread":0.2170427828868513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140798861","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.9838956,0.000005146479,0.009706993,0.0020783865,0.00007554449,0.000045674304,0.000009036113,0.0000056510994,0.004177947],"genre_scores_gemma":[0.9975749,0.000013671267,0.001866876,0.0000502649,0.00006373129,0.0000012375633,8.3230077e-7,0.0000035935195,0.00042489724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847543,0.00006988011,0.0010877479,0.00006936086,0.00022784281,0.00006972496],"domain_scores_gemma":[0.9965653,0.0022323132,0.000744719,0.00022231975,0.00017260217,0.000062746985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052290014,0.000045825276,0.00028252281,0.00013708493,0.000035721507,0.000040507628,0.00036126332,0.000038003516,0.00057513313],"category_scores_gemma":[0.0013591888,0.000032839063,0.00014338846,0.00019399675,0.00007917873,0.00018970715,0.00004429278,0.000085334446,0.00065549515],"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.000031172138,0.00013169606,0.0007991924,0.000013217532,0.000025159374,9.997325e-7,0.0003022403,0.002954232,0.0007720315,0.98237437,0.003385416,0.009210284],"study_design_scores_gemma":[0.00013045038,0.000027916483,0.005127926,0.00000976528,0.000008910295,0.000018204228,0.00025636159,0.0054833693,0.0009819461,0.98597664,0.0019466293,0.000031898362],"about_ca_topic_score_codex":1.8263381e-7,"about_ca_topic_score_gemma":8.280474e-7,"teacher_disagreement_score":0.013679275,"about_ca_system_score_codex":0.000019220044,"about_ca_system_score_gemma":0.000043126383,"threshold_uncertainty_score":0.8425282},"labels":[],"label_agreement":null},{"id":"W3157655028","doi":"10.2139/ssrn.3671882","title":"A Generalization of Quantal Response Equilibrium via Perturbed Utility","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Western University","funders":"","keywords":"Generalization; Mathematical economics; Mathematics; Applied mathematics; Statistical physics; Economics; Econometrics; Physics; Mathematical analysis","score_opus":0.07304161682351165,"score_gpt":0.3557523638893071,"score_spread":0.28271074706579546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157655028","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.83093315,0.0003692236,0.16273825,0.005523647,0.00005282593,0.000091641465,0.000006491343,0.000019933193,0.00026484247],"genre_scores_gemma":[0.99885696,0.000049241276,0.00014880953,0.00027851664,0.00013086782,0.000002618446,0.0000021159483,0.000009532337,0.0005213508],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692434,0.0007311545,0.00061467616,0.0002657008,0.00067226466,0.00079186127],"domain_scores_gemma":[0.9984977,0.0004903108,0.00033806128,0.00028783764,0.00024537576,0.0001406719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007193205,0.00010678815,0.00021887563,0.00009552693,0.00012886633,0.0000632957,0.0006781612,0.000057764544,0.00031232685],"category_scores_gemma":[0.0020491006,0.00008096332,0.00015845845,0.00070649653,0.00010325974,0.00024270793,0.00007261529,0.0006087709,0.00011904037],"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.0062029343,0.0002690927,0.0053139436,0.000006283896,0.00012807682,0.000004627007,0.0033962824,0.00074176077,0.5452306,0.3846903,0.0013303438,0.052685745],"study_design_scores_gemma":[0.00066771056,0.00057686266,0.0036623266,0.0000044072403,0.000025572477,0.00018216316,0.0024789695,0.017380906,0.009058969,0.96111906,0.0046735024,0.00016956209],"about_ca_topic_score_codex":0.000006937131,"about_ca_topic_score_gemma":0.000022235829,"teacher_disagreement_score":0.5764287,"about_ca_system_score_codex":0.00010291751,"about_ca_system_score_gemma":0.001055568,"threshold_uncertainty_score":0.34197602},"labels":[],"label_agreement":null},{"id":"W3157706596","doi":"10.48550/arxiv.2105.01040","title":"Is More Precise Word of Mouth Better for a High Quality Firm? ... Not Always","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto","funders":"","keywords":"Quality (philosophy); Monopoly; Product (mathematics); Word of mouth; Business; Range (aeronautics); Marketing; Advertising; Industrial organization; Microeconomics; Economics","score_opus":0.3273399406588461,"score_gpt":0.3215230344734781,"score_spread":0.005816906185368009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157706596","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.9353497,0.000020948784,0.061479717,0.00083222386,0.00022397858,0.0005596986,0.0007667097,0.00004749434,0.00071951543],"genre_scores_gemma":[0.99010456,0.000018923442,0.001433654,0.0003593226,0.000072338255,0.0000084382755,0.000062216815,0.000018960576,0.007921577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969955,0.00030948146,0.0006579387,0.001410217,0.00032835995,0.00029850748],"domain_scores_gemma":[0.99435216,0.0016671913,0.00078056456,0.002257877,0.0007773398,0.00016484146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001602931,0.00029814662,0.0006986549,0.0002597317,0.00017294103,0.00012094503,0.0018848173,0.00034253902,0.00086229254],"category_scores_gemma":[0.0006044692,0.00029373865,0.0005799947,0.0008194158,0.00030921912,0.00020983919,0.0012307359,0.00038221377,0.00009131412],"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.0041093817,0.0034901751,0.048777673,0.0011730747,0.0019617013,0.00020381923,0.025934348,0.15004905,0.008665894,0.6403769,0.03722688,0.078031056],"study_design_scores_gemma":[0.0017267973,0.00004761699,0.06937477,0.00018600485,0.00040565038,0.0000018116694,0.0053616525,0.007857473,0.015158729,0.8941113,0.0046887267,0.001079517],"about_ca_topic_score_codex":0.0001915388,"about_ca_topic_score_gemma":0.00005053364,"teacher_disagreement_score":0.2537343,"about_ca_system_score_codex":0.000072800234,"about_ca_system_score_gemma":0.00019111086,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W3160282874","doi":"10.2139/ssrn.3809655","title":"Information Aggregation in Large Collective Purchases","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Business","score_opus":0.025886934076531955,"score_gpt":0.33198011224690416,"score_spread":0.3060931781703722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160282874","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.89514685,0.00091948465,0.0899107,0.002855755,0.0001558534,0.00015872516,0.0000121963685,0.000021513531,0.010818934],"genre_scores_gemma":[0.99575514,0.00035996197,0.00006126659,0.00019766795,0.000060807954,0.000011128121,0.000007781096,0.0000036110625,0.0035426181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776095,0.00025130194,0.00047037072,0.00011434487,0.00051857776,0.000884435],"domain_scores_gemma":[0.99879867,0.00033578492,0.0002236151,0.00019607617,0.00039621236,0.00004965649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052351165,0.00007462802,0.00013068061,0.00026567615,0.00025929266,0.00021089523,0.0002785187,0.00005012692,0.00023747153],"category_scores_gemma":[0.0020683692,0.00006197482,0.00007144615,0.0013403817,0.000025766343,0.00093006704,0.00004366741,0.0007735207,0.00033274578],"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.000046422283,0.00010476808,0.00351004,7.525656e-7,0.000019463228,0.000002530706,0.0018322384,0.00025108532,0.00019617043,0.8686672,0.00035688002,0.12501243],"study_design_scores_gemma":[0.0005527808,0.000047420974,0.0037677544,0.000007088775,0.0000043061254,0.00021312274,0.014493331,0.00036225092,0.00061724207,0.965497,0.014363135,0.00007456265],"about_ca_topic_score_codex":0.000005800843,"about_ca_topic_score_gemma":0.00086650555,"teacher_disagreement_score":0.12493787,"about_ca_system_score_codex":0.0006004652,"about_ca_system_score_gemma":0.002962647,"threshold_uncertainty_score":0.52556086},"labels":[],"label_agreement":null},{"id":"W3161618299","doi":"10.3982/qe1960","title":"Discordant relaxations of misspecified models","year":2024,"lang":"en","type":"article","venue":"Quantitative Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Econometrics; Computer science; Mathematics","score_opus":0.35079981714834135,"score_gpt":0.44430711863382794,"score_spread":0.09350730148548658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161618299","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.6715849,0.0003334645,0.25883645,0.0016464648,0.0003366816,0.00016836938,0.00019442852,0.000045722623,0.06685351],"genre_scores_gemma":[0.9880796,0.00006179833,0.009024381,0.000033778877,0.000025715935,0.000017303044,0.0000066439707,0.000010288665,0.002740469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887055,0.000076341494,0.00053151586,0.0003125022,0.00010478893,0.00010427634],"domain_scores_gemma":[0.9972631,0.0020611433,0.00014488939,0.00038190148,0.000099294535,0.000049695635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010796469,0.00008109469,0.00018548625,0.00018713772,0.000072843526,0.00012745499,0.0003630946,0.000023290868,0.0003555554],"category_scores_gemma":[0.00031250346,0.00006459998,0.000113836155,0.0003529533,0.00017535475,0.00045689323,0.00004962336,0.000081059625,0.0009653944],"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.000011566885,0.000020902115,0.000017612416,0.0000027229646,0.000017166827,5.578504e-7,0.0010910272,0.0071827173,0.00040642207,0.98703855,0.0011200476,0.0030906755],"study_design_scores_gemma":[0.00004651918,0.00002924139,0.0002713962,0.000009229409,0.0000075574126,0.00000193498,0.0019519363,0.108764656,0.0008891869,0.8746206,0.013334889,0.00007285301],"about_ca_topic_score_codex":0.0000075705657,"about_ca_topic_score_gemma":0.000025847463,"teacher_disagreement_score":0.31649473,"about_ca_system_score_codex":0.00002416429,"about_ca_system_score_gemma":0.000064421634,"threshold_uncertainty_score":0.9998125},"labels":[],"label_agreement":null},{"id":"W3164712124","doi":"10.1093/restud/rdac040","title":"Belief Convergence under Misspecified Learning: A Martingale Approach","year":2022,"lang":"en","type":"article","venue":"The Review of Economic Studies","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Western Hospital","funders":"National Science Foundation","keywords":"Martingale (probability theory); Convergence (economics); Social learning; Computer science; Econometrics; Artificial intelligence; Machine learning; Mathematics; Economics; Applied mathematics","score_opus":0.24836972363365292,"score_gpt":0.42551671805315705,"score_spread":0.17714699441950413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164712124","genre_codex":"review","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.1665371,0.68488187,0.0006160501,0.02334965,0.00075145136,0.0016852518,0.000042979707,0.00008009946,0.122055575],"genre_scores_gemma":[0.9390994,0.04875771,0.00017224108,0.0013225732,0.00007388775,0.0003306318,0.00000263113,0.000010698024,0.010230235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981236,0.0005415464,0.00068844116,0.00028166917,0.00022942315,0.00013533502],"domain_scores_gemma":[0.9972418,0.0015562301,0.00053203653,0.00057566346,0.000068463545,0.000025828525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0061556133,0.00009692641,0.0004493822,0.00002728586,0.00054282905,0.000013187501,0.0008669615,0.000007969219,0.0020902439],"category_scores_gemma":[0.00071166776,0.000059860293,0.00015689766,0.00024250083,0.00026276396,0.000045402594,0.000545801,0.00015408058,0.00039860385],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056964145,0.00024726585,0.0017642158,0.0010264827,0.0005585588,8.162617e-7,0.006071457,0.012706071,0.00018721526,0.7223829,0.20155706,0.053441],"study_design_scores_gemma":[0.00021939438,0.000089602836,0.001064734,0.00019205932,0.0000974226,0.000020721849,0.025649749,0.00050444325,0.00011705932,0.12158749,0.8502219,0.00023544038],"about_ca_topic_score_codex":0.000004520564,"about_ca_topic_score_gemma":0.000001101306,"teacher_disagreement_score":0.77256227,"about_ca_system_score_codex":0.000050059945,"about_ca_system_score_gemma":0.00003263158,"threshold_uncertainty_score":0.998822},"labels":[],"label_agreement":null},{"id":"W3170671676","doi":"10.1007/978-3-031-15714-1_14","title":"An Improved Bound for the Tree Conjecture in Network Creation Games","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Conjecture; Vertex (graph theory); Nash equilibrium; Combinatorics; Game tree; Computer science; Alpha (finance); Tree (set theory); Spanning tree; Mathematics; Discrete mathematics; Game theory; Mathematical economics; Sequential game; Graph; Statistics","score_opus":0.04664564556279533,"score_gpt":0.3433433622714432,"score_spread":0.29669771670864786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170671676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006484254,0.00050624256,0.99163276,0.0024048407,0.0009860368,0.0011392857,0.000030216002,0.00004137113,0.0026108448],"genre_scores_gemma":[0.9493412,0.000050934723,0.042346474,0.0041875714,0.001656532,0.00031157414,0.000038443646,0.0000571405,0.0020101566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659556,0.00010768174,0.00063617807,0.0012376773,0.0009594024,0.00046350723],"domain_scores_gemma":[0.99157226,0.0062737563,0.0003786405,0.001508039,0.00018079844,0.00008650722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050330535,0.00031596143,0.00041520095,0.00041051648,0.0007216587,0.00072215125,0.003252612,0.00019179352,0.0003284076],"category_scores_gemma":[0.0005222841,0.00020591558,0.00013920502,0.0009794079,0.0009109557,0.00033151114,0.00039319627,0.00066393905,0.000012454917],"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.000038988186,0.000024396446,0.00008213071,0.000003361615,0.0000052965856,0.0000026449322,0.0012116228,0.22891143,0.00010909793,0.067067534,0.00011378435,0.7024297],"study_design_scores_gemma":[0.00020533554,0.00016442666,0.00048758113,0.000023743447,0.000009336464,0.0000095033565,0.000003344276,0.2624984,0.0000753683,0.6874039,0.048877466,0.0002415546],"about_ca_topic_score_codex":0.000035223602,"about_ca_topic_score_gemma":0.0009452741,"teacher_disagreement_score":0.9492863,"about_ca_system_score_codex":0.00015785366,"about_ca_system_score_gemma":0.00035688726,"threshold_uncertainty_score":0.8396994},"labels":[],"label_agreement":null},{"id":"W3175803426","doi":"10.2139/ssrn.2429087","title":"Ordinal Dominance and Risk Aversion","year":2014,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Western University","funders":"","keywords":"Risk aversion (psychology); Stochastic dominance; Dominance (genetics); Economics; Psychology; Econometrics; Actuarial science; Financial economics; Expected utility hypothesis; Biology","score_opus":0.016758576999859075,"score_gpt":0.3074129919223098,"score_spread":0.29065441492245075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175803426","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.877709,0.00045878618,0.1176721,0.0007592174,0.00007783568,0.000044743996,0.0000012434739,0.000011311014,0.0032657706],"genre_scores_gemma":[0.9940039,0.0014834923,0.00022973769,0.00004936291,0.00016077438,0.000001771016,2.2079145e-7,0.000005338037,0.004065407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804276,0.0002720346,0.00025613623,0.00021739607,0.00038497173,0.000826727],"domain_scores_gemma":[0.9988516,0.0004905496,0.00023403631,0.00024159854,0.00009639929,0.000085800835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009142362,0.00008198357,0.00013445143,0.000095469644,0.0004704742,0.00011644518,0.00040536487,0.000039663388,0.00008286572],"category_scores_gemma":[0.00087847054,0.00005698516,0.00006160183,0.0002482504,0.00008573972,0.0001979123,0.000053784108,0.0008664537,0.00031089206],"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.000049247796,0.00001900377,0.0076803784,3.1030112e-7,0.000013163116,2.9673004e-7,0.00008949706,0.00003068768,0.00029881543,0.66007507,0.0003825239,0.33136103],"study_design_scores_gemma":[0.0003570871,0.00013637282,0.004921143,0.000003416464,0.000014551041,0.00022654423,0.0006879359,0.00045824522,0.00010658633,0.952792,0.040220868,0.00007525979],"about_ca_topic_score_codex":0.000012138288,"about_ca_topic_score_gemma":0.00010632004,"teacher_disagreement_score":0.33128577,"about_ca_system_score_codex":0.00008258208,"about_ca_system_score_gemma":0.0002098105,"threshold_uncertainty_score":0.39959922},"labels":[],"label_agreement":null},{"id":"W3176917115","doi":"10.5539/ibr.v14n5p78","title":"Feedback Nash Equilibrium of N Agents Fishery Problem","year":2021,"lang":"en","type":"article","venue":"International Business Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Overexploitation; Differential game; Excludability; Nash equilibrium; Mathematical economics; Stock (firearms); Resource (disambiguation); Economics; Microeconomics; Fishery; Operations research; Computer science; Mathematics; Mathematical optimization; Geography; Biology; Public good","score_opus":0.31108727822564086,"score_gpt":0.499245521862514,"score_spread":0.1881582436368731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176917115","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.79037684,0.000066554574,0.0016468908,0.016053278,0.0003997487,0.00017245013,0.00006582871,0.000021008249,0.19119738],"genre_scores_gemma":[0.95803094,0.000018242894,0.00092310325,0.00008732311,0.00015644405,0.000035328863,0.000031903845,0.0000097409675,0.040706966],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574363,0.00032169104,0.00050804764,0.00041756948,0.0027688013,0.00024027846],"domain_scores_gemma":[0.9906788,0.0014691327,0.0001126271,0.00056490995,0.007096412,0.00007815472],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031729953,0.00007702548,0.00015906063,0.00034352747,0.000085756605,0.00027866336,0.0013899264,0.000058976493,0.0071379337],"category_scores_gemma":[0.0049369214,0.00006428848,0.000073325886,0.0023022986,0.00026179384,0.0003512173,0.00071141444,0.00019635337,0.0012708935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043394792,0.0023092923,0.099704415,0.00010952581,0.0002681344,0.00020969982,0.0014725901,0.0029290565,0.3041244,0.16766842,0.3117608,0.10900972],"study_design_scores_gemma":[0.000552351,0.000016987979,0.33003736,0.00008959704,0.0000038649373,0.000039461585,0.0006403758,0.0007569246,0.03476796,0.38476288,0.248165,0.00016725309],"about_ca_topic_score_codex":0.000035969493,"about_ca_topic_score_gemma":0.000017191696,"teacher_disagreement_score":0.26935643,"about_ca_system_score_codex":0.000046667246,"about_ca_system_score_gemma":0.00028696685,"threshold_uncertainty_score":0.9995067},"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":"W3194511393","doi":"10.1007/s10726-021-09755-w","title":"An Integer Programming Approach to Solving the Inverse Graph Model for Conflict Resolution with Two Decision Makers","year":2021,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Integer programming; Conflict resolution; Resolution (logic); Graph; Computer science; Mathematical optimization; Inverse; Mathematics; Theoretical computer science; Artificial intelligence; Political science","score_opus":0.10282520826118534,"score_gpt":0.37297834936538826,"score_spread":0.2701531411042029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194511393","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.26701623,0.00005787648,0.731484,0.00035759763,0.00008107624,0.0006837248,0.000010934321,0.00004445832,0.0002641443],"genre_scores_gemma":[0.7901349,0.000015969275,0.2085818,0.00075952086,0.00006588098,0.0001948673,0.00004124916,0.00001916573,0.00018661571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708563,0.00020893307,0.00060242694,0.00086332794,0.0009277062,0.0003119815],"domain_scores_gemma":[0.996197,0.0018394424,0.0002209641,0.00089661,0.0006121185,0.00023388659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034924997,0.00020639895,0.00025746977,0.00026708547,0.0008042311,0.0006953887,0.00047427748,0.00009869537,0.000019528927],"category_scores_gemma":[0.0014046006,0.00012649242,0.00010803896,0.0012692733,0.00011766484,0.0006260556,0.00012674578,0.0001653749,0.000026421587],"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.0011815846,0.00037540123,0.00074584165,0.00000687493,0.00002485016,0.0000017225501,0.0058637774,0.0995137,0.003911627,0.080507085,0.0044979374,0.8033696],"study_design_scores_gemma":[0.001295496,0.0001663568,0.0025678994,0.000044137396,0.00003911887,0.00002931212,0.004254272,0.87633735,0.0002390244,0.101328164,0.013449052,0.00024984128],"about_ca_topic_score_codex":0.00001279988,"about_ca_topic_score_gemma":0.0004288421,"teacher_disagreement_score":0.8031198,"about_ca_system_score_codex":0.000042859177,"about_ca_system_score_gemma":0.00006401785,"threshold_uncertainty_score":0.67056495},"labels":[],"label_agreement":null},{"id":"W3194795045","doi":"10.1177/1536867x251341145","title":"netivreg: Estimation of peer effects in endogenous social networks","year":2025,"lang":"en","type":"article","venue":"The Stata Journal Promoting communications on statistics and Stata","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Estimation; Endogeny; Computer science; Economics; Biology; Endocrinology","score_opus":0.11036322647690112,"score_gpt":0.419005568832524,"score_spread":0.3086423423556229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194795045","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.04677633,0.0008218317,0.937114,0.009989002,0.00013543632,0.0006495833,0.0004257904,0.00001832346,0.0040697213],"genre_scores_gemma":[0.98228395,0.00022874419,0.016995672,0.0001417458,0.000016854015,0.00002023102,0.000038698046,0.000008955754,0.0002651411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970449,0.0011531605,0.0008564302,0.000191295,0.00053425547,0.0002199567],"domain_scores_gemma":[0.98920476,0.008607615,0.0005359148,0.001139186,0.0004585361,0.000054009583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062800897,0.0001300479,0.00027662126,0.00024242084,0.0011242228,0.00029567728,0.0016470971,0.00004585353,0.000018228031],"category_scores_gemma":[0.0040006097,0.00009024291,0.000040611787,0.0007536909,0.00044537007,0.00012244713,0.0004283479,0.0006098569,0.0000064851065],"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.000057402947,0.00025126402,0.00038302157,0.000019187815,0.000039687784,0.0000028711922,0.004430822,0.0035087697,0.00008710708,0.6350558,0.0036398112,0.35252425],"study_design_scores_gemma":[0.0006379387,0.0001283214,0.010453038,0.00011974595,0.000049705162,0.000023835513,0.0015143654,0.23997591,0.000051588308,0.744028,0.0028905077,0.0001270645],"about_ca_topic_score_codex":0.000030566836,"about_ca_topic_score_gemma":0.000045188663,"teacher_disagreement_score":0.93550766,"about_ca_system_score_codex":0.000036697806,"about_ca_system_score_gemma":0.000110460045,"threshold_uncertainty_score":0.8646726},"labels":[],"label_agreement":null},{"id":"W3199832108","doi":"10.37236/11859","title":"Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Generalization; Random graph; Induced subgraph isomorphism problem; Graph; Process (computing); Mathematics; Combinatorics; Computer science; Theoretical computer science; Discrete mathematics; Line graph; Voltage graph; Programming language","score_opus":0.024049792321890272,"score_gpt":0.34112266150921117,"score_spread":0.3170728691873209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199832108","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.96919584,0.014248231,0.008711099,0.006906963,0.00021021157,0.0002428571,0.0000013808842,0.000011766619,0.00047163363],"genre_scores_gemma":[0.9982665,0.0011963577,0.0000015633809,0.00026946422,0.000057115885,0.000015633146,3.3253437e-7,0.0000088745655,0.00018416898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783516,0.00040806658,0.0005037661,0.00016565966,0.00079043565,0.00029690703],"domain_scores_gemma":[0.9980651,0.0012020757,0.00016132391,0.00024259291,0.00027152422,0.000057356687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006584874,0.000113715585,0.00020027296,0.00040460072,0.00016520772,0.00026609428,0.0009743997,0.000041929106,0.000012310305],"category_scores_gemma":[0.000464723,0.00005445794,0.00010088833,0.0032661315,0.00005581857,0.00023450196,0.000031065425,0.0004593943,0.000011355258],"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.000044986096,0.00004674668,0.00030726285,0.0000054102184,0.000021101843,0.000003604763,0.002425573,0.0006693382,0.00043585157,0.9941352,0.00074623,0.0011587174],"study_design_scores_gemma":[0.00031470627,0.00016403213,0.00070584257,0.000025689786,0.000032576154,0.00015439636,0.0009254297,0.0006384007,0.00072373694,0.9883843,0.007856821,0.000074042524],"about_ca_topic_score_codex":0.0000017510692,"about_ca_topic_score_gemma":0.000011238249,"teacher_disagreement_score":0.029070633,"about_ca_system_score_codex":0.00002694884,"about_ca_system_score_gemma":0.0001788076,"threshold_uncertainty_score":0.2565953},"labels":[],"label_agreement":null},{"id":"W3201586842","doi":"10.3982/ecta16729","title":"An Axiomatic Model of Persuasion","year":2021,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Communication source; Prior probability; Computer science; Axiom; Action (physics); Representation (politics); Preference; Persuasion; Axiomatic system; Planner; Bayesian probability; Theoretical computer science; Mathematical economics; Artificial intelligence; Mathematics; Statistics; Psychology; Social psychology","score_opus":0.26181362138470826,"score_gpt":0.42444015247948297,"score_spread":0.1626265310947747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201586842","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.9220518,0.00008856329,0.035224456,0.00042572917,0.000039918537,0.000045327433,0.00002054775,0.000015207756,0.042088483],"genre_scores_gemma":[0.9934073,0.0000061197916,0.004727745,0.00007412501,0.000014277309,0.000005668157,0.0000031781003,0.0000037415384,0.0017578406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906754,0.0000620067,0.00034475222,0.00023765191,0.0002005547,0.00008750687],"domain_scores_gemma":[0.9984819,0.0005216196,0.0001280765,0.00064887566,0.0001402043,0.00007927326],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008390559,0.000046690777,0.00015841605,0.00037967722,0.000058723574,0.000054766548,0.00038416218,0.000028147564,0.0014752112],"category_scores_gemma":[0.0010450085,0.000038821247,0.000068878464,0.0018336911,0.000043110642,0.0001980332,0.000049916594,0.000035308545,0.0004728545],"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.000019297302,0.0009631783,0.005610471,0.000012261867,0.000028790517,0.000002776324,0.0021818352,0.028334528,0.031747214,0.70615023,0.0025364775,0.22241291],"study_design_scores_gemma":[0.0002688496,0.00007440781,0.009518427,0.000004291179,0.0000123053715,0.0000055453434,0.0018983731,0.33652785,0.017843492,0.62973344,0.003943322,0.00016968022],"about_ca_topic_score_codex":0.0000011412869,"about_ca_topic_score_gemma":0.0000010551219,"teacher_disagreement_score":0.30819333,"about_ca_system_score_codex":0.000011788693,"about_ca_system_score_gemma":0.00005153535,"threshold_uncertainty_score":0.9994376},"labels":[],"label_agreement":null},{"id":"W3207183500","doi":"10.48550/arxiv.1908.01008","title":"Value-based distance between the information structures","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Sequence (biology); Value (mathematics); Mathematics; Relation (database); Combinatorics; Characterization (materials science); Zero (linguistics); Computer science; Discrete mathematics; Data mining; Statistics; Physics","score_opus":0.1548032440367312,"score_gpt":0.2590868003923236,"score_spread":0.10428355635559242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207183500","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.46676195,0.000015031485,0.51976085,0.00047855935,0.00029339988,0.00048143786,0.00022782524,0.00007376849,0.011907178],"genre_scores_gemma":[0.99816066,0.000005584763,0.00010883427,0.00024145374,0.0000714268,0.0000013894261,0.00006391526,0.0000070703486,0.0013396661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834037,0.00029958572,0.00035005194,0.0005086221,0.00029435684,0.0002070309],"domain_scores_gemma":[0.9960018,0.0012828582,0.000554461,0.0018153221,0.00025968178,0.00008590373],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011426489,0.0002102121,0.0002737669,0.00019545127,0.00028839102,0.00028959726,0.0024022986,0.00020377364,0.0002134161],"category_scores_gemma":[0.00032807677,0.00014997233,0.00021757318,0.00070782215,0.0002524376,0.00039126188,0.00059358316,0.00050913,0.001078002],"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.000028673523,0.000008096338,0.0117152305,0.00001154848,0.00002256722,0.0000011965125,0.00014679323,0.5421644,0.0000015437842,0.44301027,0.0011080048,0.0017816896],"study_design_scores_gemma":[0.00025967482,0.00001474011,0.042389818,0.000020027323,0.000072161325,2.2223689e-7,0.0003635941,0.05519288,0.000063870604,0.8668163,0.0345501,0.00025663513],"about_ca_topic_score_codex":0.000037278485,"about_ca_topic_score_gemma":0.000008000945,"teacher_disagreement_score":0.5313987,"about_ca_system_score_codex":0.00008441324,"about_ca_system_score_gemma":0.0001838281,"threshold_uncertainty_score":0.9996998},"labels":[],"label_agreement":null},{"id":"W3208051161","doi":"10.3982/te2889","title":"The implications of finite‐order reasoning","year":2021,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leonard N. Stern School of Business, New York University; McGill University; New York University Shanghai; National University of Singapore; Washington University in St. Louis; Pennsylvania State University; Florida State University; University of Chicago; New York University; National Sleep Foundation","keywords":"Rationalizability; Rationality; Sequence (biology); Disjoint sets; Class (philosophy); Mathematical economics; Interpretation (philosophy); Order (exchange); Set (abstract data type); Type (biology); Backward induction; Computer science; Mathematics; Combinatorics; Artificial intelligence; Epistemology; Game theory; Economics; Philosophy; Nash equilibrium","score_opus":0.048458645713261375,"score_gpt":0.3493198526859673,"score_spread":0.30086120697270596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208051161","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.62313133,0.00015600197,0.042665176,0.025700612,0.00017212625,0.00015946048,0.00007081278,0.000033144395,0.30791134],"genre_scores_gemma":[0.9967635,0.000074069605,0.0018708517,0.00034407098,0.000041677125,0.000017438124,0.000004210852,0.000007184975,0.0008769945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988562,0.00015875419,0.0004889965,0.00023952141,0.00009331744,0.0001632167],"domain_scores_gemma":[0.9916131,0.0068987897,0.00014294086,0.0009729299,0.00029450713,0.00007774973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018845652,0.00006773099,0.00015581034,0.00002537634,0.00025962267,0.000121781566,0.0006343397,0.000046149584,0.001270344],"category_scores_gemma":[0.0055793724,0.00004498456,0.00008858581,0.00033367623,0.0009185451,0.000058927144,0.00016473354,0.00010266722,0.00037088964],"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.000007772707,0.00002104313,0.0001773385,3.2350897e-7,0.00000690886,9.4687884e-8,0.000077357916,0.00030703188,0.00012515833,0.98327166,0.00019941182,0.0158059],"study_design_scores_gemma":[0.000071939816,0.000007954987,0.001420224,0.0000020027824,0.000007517042,0.000005228385,0.00046841093,0.0021738003,0.0019079405,0.9744838,0.019396689,0.000054502263],"about_ca_topic_score_codex":6.361884e-7,"about_ca_topic_score_gemma":0.0000065201707,"teacher_disagreement_score":0.3736322,"about_ca_system_score_codex":0.000013522256,"about_ca_system_score_gemma":0.00011934935,"threshold_uncertainty_score":0.9996426},"labels":[],"label_agreement":null},{"id":"W3209619328","doi":"10.4324/9781003249023-20","title":"Some Rules of the Game","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematical economics; Economics","score_opus":0.12762752085587167,"score_gpt":0.356460576669505,"score_spread":0.2288330558136333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209619328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072483363,0.00044108013,0.00016604438,0.0011936842,0.00017339674,0.000108666325,0.000058730657,0.000012885108,0.9971207],"genre_scores_gemma":[0.01714659,0.00004251267,0.00013498886,0.00034120207,0.000119663266,0.0000034632585,0.0000029442224,0.000009123851,0.9821995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985195,0.00003271586,0.00041248105,0.00027321358,0.00068774796,0.000074354684],"domain_scores_gemma":[0.99762857,0.00069569953,0.0002612386,0.0011939536,0.00018644378,0.000034096374],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005917214,0.0001093227,0.00024857247,0.00005810715,0.00005163291,0.000048589605,0.0010075645,0.000117473945,0.011860056],"category_scores_gemma":[0.00022842626,0.000055428674,0.00026505152,0.00004219663,0.00023631722,0.00004678213,0.00028673786,0.00014968633,0.0018039894],"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":[8.6598556e-7,0.0000047849862,0.0000021231454,0.0000011400116,0.000007835715,3.3981252e-7,0.000025810128,0.000002060107,0.000093750736,0.98882216,0.0057003987,0.0053387485],"study_design_scores_gemma":[0.000016999707,0.0000022738973,0.000060178187,0.000013177246,0.0000074783156,0.0000016098298,0.000020668425,0.0000024221474,0.0003847064,0.60856396,0.39088386,0.000042662723],"about_ca_topic_score_codex":0.0000019234355,"about_ca_topic_score_gemma":0.000005624951,"teacher_disagreement_score":0.38518345,"about_ca_system_score_codex":0.00000667467,"about_ca_system_score_gemma":0.00007572392,"threshold_uncertainty_score":0.99897325},"labels":[],"label_agreement":null},{"id":"W3213005320","doi":"10.1007/s13235-021-00405-z","title":"Asymmetric Information and Differentiated Durable Goods Monopoly: Intra-Period Versus Intertemporal Discrimination","year":2021,"lang":"en","type":"article","venue":"Dynamic Games and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Durable good; Economics; Microeconomics; Stackelberg competition; Monopoly; Commit; Quality (philosophy); Markov perfect equilibrium; Markov chain; Nash equilibrium; Computer science","score_opus":0.02944505984267562,"score_gpt":0.32708043870935927,"score_spread":0.2976353788666837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213005320","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.6726592,0.0010549629,0.30984807,0.0058603548,0.00020297815,0.0007966793,0.00021744949,0.00015002466,0.009210292],"genre_scores_gemma":[0.9973613,0.0002732232,0.0009566742,0.00010019422,0.000022477714,0.00025604578,0.00024802375,0.000007975691,0.0007740886],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998577,0.00008015102,0.000503138,0.0003584174,0.0002808939,0.0002004067],"domain_scores_gemma":[0.9986267,0.000343111,0.00020801461,0.0004662584,0.00022834967,0.00012752811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040007854,0.00014904013,0.00020384224,0.00023932058,0.00040454976,0.00050651276,0.00023221462,0.000080683676,0.00008275016],"category_scores_gemma":[0.0002871702,0.00012647419,0.000051305153,0.0011040247,0.00015407134,0.0005912195,0.0001699207,0.00013305811,0.00008061567],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037015354,0.0001383394,0.0012518099,0.000023537537,0.00003696074,6.6807195e-7,0.0011216833,0.000026214135,0.0013245379,0.17684714,0.00043449056,0.8187576],"study_design_scores_gemma":[0.0052160905,0.00028616693,0.2275624,0.000076441436,0.00034027884,0.00014133372,0.043152846,0.13305283,0.0024453227,0.34607327,0.24018295,0.0014700794],"about_ca_topic_score_codex":0.00002313864,"about_ca_topic_score_gemma":0.000084803185,"teacher_disagreement_score":0.8172875,"about_ca_system_score_codex":0.000034833196,"about_ca_system_score_gemma":0.00004764403,"threshold_uncertainty_score":0.5157468},"labels":[],"label_agreement":null},{"id":"W3214154353","doi":"10.1287/opre.2023.0327","title":"The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations","year":2025,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Polyhedron; Convex hull; Correctness; Cutting-plane method; Nash equilibrium; Mathematical optimization; Integer programming; Leverage (statistics); Computer science; Extreme point; Mathematics; Hull; Regular polygon; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.23782802143130977,"score_gpt":0.5207650283026936,"score_spread":0.2829370068713838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214154353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045488268,0.00097336073,0.8626502,0.03363721,0.0010900361,0.0037379817,0.00057875586,0.00017936519,0.05166482],"genre_scores_gemma":[0.6943399,0.0004043201,0.07611086,0.00040053416,0.0011314582,0.0019805494,0.00034928694,0.00005794327,0.22522515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936917,0.0019314225,0.00097495393,0.0010174034,0.0018164908,0.0005680555],"domain_scores_gemma":[0.98937243,0.0062139495,0.00008696872,0.002163273,0.001985526,0.0001778283],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013944233,0.00023623143,0.00033524737,0.0005689992,0.0043506864,0.004015723,0.002550711,0.00025649258,0.00021965853],"category_scores_gemma":[0.0032670675,0.00015743358,0.0001387631,0.0015428278,0.00081460597,0.00022895499,0.0042115925,0.0016935269,0.00076763076],"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.000016806234,0.00022099397,0.00010328697,0.00003105704,0.00013757471,0.0000045140446,0.0047859363,0.020602116,0.0007975496,0.2962144,0.034881234,0.6422045],"study_design_scores_gemma":[0.00014687593,0.000020016723,0.00033566722,0.000057716665,0.000013971744,0.000008058447,0.0011691807,0.7494182,0.0002519755,0.17474443,0.073621765,0.0002121269],"about_ca_topic_score_codex":0.00013807775,"about_ca_topic_score_gemma":0.00027834854,"teacher_disagreement_score":0.7865393,"about_ca_system_score_codex":0.00009445856,"about_ca_system_score_gemma":0.0008285207,"threshold_uncertainty_score":0.9970182},"labels":[],"label_agreement":null},{"id":"W3214706726","doi":"10.2139/ssrn.3422624","title":"A Dynamic Game with Interaction between Kantian Players and Nashian Players","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Sequential game; Psychology; Mathematical economics; Game theory; Social psychology; Economics","score_opus":0.01992299246037838,"score_gpt":0.32558075921527246,"score_spread":0.3056577667548941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214706726","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.980406,0.00014981569,0.016686223,0.00095745287,0.000088149856,0.00015656323,0.0000040117443,0.000022243195,0.0015295724],"genre_scores_gemma":[0.99537015,0.00012221355,0.0001040274,0.000067447094,0.00005671894,0.0000037087868,0.0000026686798,0.000015625297,0.004257461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759513,0.00013434875,0.00035389487,0.00033717274,0.0005346925,0.0010447771],"domain_scores_gemma":[0.99879825,0.00038351255,0.00029081455,0.00030250318,0.00009318843,0.00013173328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028660228,0.00014774053,0.00022671887,0.00025301668,0.00019236209,0.0002441869,0.00044906535,0.00006480643,0.00015748943],"category_scores_gemma":[0.00008765393,0.000101879,0.00006889034,0.00039542606,0.000083298364,0.00049860746,0.000041821724,0.0012869167,0.0004439954],"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.00084026105,0.0001418203,0.18693489,0.0000096917665,0.0006459245,0.000009403765,0.0029853021,0.0012155023,0.006287842,0.44781762,0.00021100942,0.35290074],"study_design_scores_gemma":[0.0027676236,0.0017974061,0.0627651,0.00009108154,0.00013698729,0.0022064457,0.03939255,0.0039213155,0.00039350323,0.86931026,0.016481372,0.0007363386],"about_ca_topic_score_codex":0.000017461534,"about_ca_topic_score_gemma":0.00047613314,"teacher_disagreement_score":0.42149264,"about_ca_system_score_codex":0.0002673295,"about_ca_system_score_gemma":0.0005305755,"threshold_uncertainty_score":0.5706811},"labels":[],"label_agreement":null},{"id":"W3215500762","doi":"10.48550/arxiv.2111.13735","title":"Resilient Nash Equilibrium Seeking in the Partial Information Setting","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Computer science; Misinformation; Best response; Graph; Adversarial system; Mathematical economics; Core (optical fiber); Correlated equilibrium; Action (physics); Computer security; Game theory; Mathematical optimization; Theoretical computer science; Equilibrium selection; Repeated game; Artificial intelligence; Mathematics","score_opus":0.1443530811351068,"score_gpt":0.2664230518273936,"score_spread":0.12206997069228681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215500762","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.9510788,0.00001631602,0.038076106,0.00056036055,0.00025150558,0.00030984957,0.000017293074,0.00004256012,0.009647223],"genre_scores_gemma":[0.999068,0.000009565953,0.00009039704,0.000292804,0.000068012145,0.0000030068559,0.000038297287,0.000005297208,0.0004245824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769634,0.00067549595,0.00047742744,0.00056045025,0.00031903462,0.00027124956],"domain_scores_gemma":[0.99710965,0.0009408142,0.00041681307,0.0012472444,0.00021873316,0.00006671781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00319974,0.000176794,0.00023102305,0.00027847153,0.00018348852,0.00051902636,0.0016757514,0.0001802706,0.00016289133],"category_scores_gemma":[0.0007614831,0.00014784136,0.00017748501,0.0012126766,0.00012002066,0.0007177261,0.001183746,0.0006043091,0.0002645796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008965817,0.00014955483,0.016706087,0.000045545254,0.000036597827,0.00012854653,0.011350623,0.7856928,0.00030163486,0.17985833,0.0017083442,0.0039322586],"study_design_scores_gemma":[0.0009486234,0.000047164624,0.028813472,0.00029171843,0.00010916099,0.000019256016,0.04829885,0.5563113,0.00068945193,0.3441288,0.019411407,0.0009308179],"about_ca_topic_score_codex":0.00005987482,"about_ca_topic_score_gemma":0.000069507965,"teacher_disagreement_score":0.22938152,"about_ca_system_score_codex":0.00008865791,"about_ca_system_score_gemma":0.00017720068,"threshold_uncertainty_score":0.6028796},"labels":[],"label_agreement":null},{"id":"W3216186171","doi":"10.1109/tit.2021.3130672","title":"Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Computer science; Combinatorics","score_opus":0.05892772905386916,"score_gpt":0.32781759948506356,"score_spread":0.2688898704311944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216186171","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.3441148,0.000033639866,0.654254,0.0001369004,0.00009681684,0.00019794916,0.00032964099,0.000019467152,0.00081675587],"genre_scores_gemma":[0.9980476,0.000019234167,0.0013255867,0.00007401389,0.000009697145,0.00008873825,0.00001138366,0.0000046823966,0.000419088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852675,0.0001461506,0.0007703725,0.00013097415,0.00030580314,0.00011996326],"domain_scores_gemma":[0.99755985,0.0011078948,0.00030026905,0.00032980242,0.00065174093,0.000050430965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013159543,0.00009915925,0.00021983797,0.000112525566,0.00017205108,0.00006451147,0.00017689099,0.00006936639,0.0003839731],"category_scores_gemma":[0.0003202487,0.00007874177,0.00013234314,0.00043715283,0.00026823967,0.0008251191,0.0000035156456,0.00008333476,0.000054390603],"study_design_candidate":"bench_or_experimental","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.0007238835,0.00036435822,0.000058171925,0.0002186594,0.00016271853,2.1710846e-7,0.007874971,0.0060439375,0.13797303,0.7045756,0.00029659754,0.14170787],"study_design_scores_gemma":[0.00048307292,0.000047033205,0.000057049187,0.00006358435,0.000044079196,0.000011565349,0.005794154,0.0016158982,0.8144408,0.17582433,0.0015076249,0.000110812],"about_ca_topic_score_codex":0.000002115183,"about_ca_topic_score_gemma":0.000001447356,"teacher_disagreement_score":0.6764678,"about_ca_system_score_codex":0.000016335447,"about_ca_system_score_gemma":0.00010350225,"threshold_uncertainty_score":0.4204236},"labels":[],"label_agreement":null},{"id":"W3217738327","doi":"10.1016/j.ejor.2021.11.034","title":"Choice stabilities in the graph model for conflict resolution","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game 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":"Wilfrid Laurier University; University of Waterloo","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Graph; Conflict resolution; Preference; Theoretical computer science; Mathematics","score_opus":0.5684971917734002,"score_gpt":0.5286760944054057,"score_spread":0.03982109736799444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217738327","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.8024746,0.00077303447,0.12596361,0.037544765,0.000121354155,0.00044573593,0.000065085704,0.0000047581416,0.032607038],"genre_scores_gemma":[0.9929336,0.000032600125,0.0024322758,0.00033208012,0.00023122515,0.000009612489,0.0000044147955,0.0000066941984,0.004017547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.993845,0.003387316,0.00065572537,0.00017511165,0.001747207,0.00018968033],"domain_scores_gemma":[0.99047077,0.0060759536,0.000100615536,0.00030942983,0.002979307,0.00006392289],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.037508387,0.000053430093,0.00011187094,0.0002424744,0.00037977204,0.0004237165,0.00084764085,0.000013306007,0.000177111],"category_scores_gemma":[0.014360852,0.000032246753,0.00009591435,0.0007206107,0.00019515309,0.00030926193,0.000074979136,0.00038070217,0.000055549466],"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.0003043184,0.000426734,0.0009402873,0.000009104687,0.00002397212,0.000058894162,0.011653189,0.11977631,0.012293485,0.77801317,0.06845995,0.008040575],"study_design_scores_gemma":[0.002304616,0.00055522495,0.05080397,0.00007748198,0.00001143075,0.00023084578,0.019297307,0.14131045,0.0015504067,0.34850794,0.43510872,0.00024158935],"about_ca_topic_score_codex":0.0000016936146,"about_ca_topic_score_gemma":0.000020762776,"teacher_disagreement_score":0.42950523,"about_ca_system_score_codex":0.00003056358,"about_ca_system_score_gemma":0.00042362098,"threshold_uncertainty_score":0.9939416},"labels":[],"label_agreement":null},{"id":"W37361839","doi":"10.1007/978-3-642-41392-6_10","title":"Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Reputation; Computer science; Price of anarchy; Operator (biology); Complete information; Routing (electronic design automation); Order (exchange); Trustworthiness; Game theory; Commodity; Mathematical economics; Computer security; Computer network; Economics; Price of stability","score_opus":0.07362549245182819,"score_gpt":0.32760947868987556,"score_spread":0.25398398623804735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37361839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0664748,0.000013589966,0.92728925,0.0001369606,0.00016147025,0.00050271215,0.000009464737,0.000028617313,0.0053831665],"genre_scores_gemma":[0.8955567,0.000001802107,0.10404802,0.00025104775,0.000045198467,0.000005867003,0.0000094291645,0.000009821022,0.000072120594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658644,0.00007333838,0.001180554,0.0006159593,0.0012614026,0.00028232974],"domain_scores_gemma":[0.99641657,0.0009821394,0.0010284956,0.00081946707,0.0006858482,0.000067467925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002775306,0.00025047432,0.00045702638,0.0012267445,0.00014997201,0.00036736423,0.0011213514,0.00017705902,0.000070686125],"category_scores_gemma":[0.00065027527,0.00019013973,0.000054664713,0.0014765024,0.00053059123,0.0013961293,0.00031896116,0.00039285928,0.000045961304],"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.000028765087,0.000022627219,0.001282656,0.000021848706,0.000006606773,0.0000054821694,0.004205022,0.3920574,0.00055810995,0.0152501855,0.000007194531,0.5865541],"study_design_scores_gemma":[0.0004219624,0.000121396886,0.0027022709,0.0006367376,0.000009316241,0.00004770532,0.000013444505,0.6694643,0.0015593169,0.3241699,0.00041728787,0.00043638458],"about_ca_topic_score_codex":0.00011981029,"about_ca_topic_score_gemma":0.00011986482,"teacher_disagreement_score":0.8290819,"about_ca_system_score_codex":0.00017155173,"about_ca_system_score_gemma":0.00032155524,"threshold_uncertainty_score":0.7753673},"labels":[],"label_agreement":null},{"id":"W4210572393","doi":"10.1109/cdc45484.2021.9683223","title":"Second-order mirror descent: exact convergence beyond strictly stable equilibria in concave games","year":2021,"lang":"en","type":"article","venue":"2021 60th IEEE Conference on Decision and Control (CDC)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Huawei Technologies","keywords":"Convergence (economics); Nash equilibrium; Regret; Descent (aeronautics); Applied mathematics; Mathematics; Mathematical optimization; Order (exchange); Mathematical economics; Physics; Economics","score_opus":0.07465558757424609,"score_gpt":0.3503567232363893,"score_spread":0.27570113566214316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210572393","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.95138854,0.0008284169,0.01917122,0.0024419634,0.0009125914,0.0006767454,0.00027514983,0.000048402155,0.024256978],"genre_scores_gemma":[0.9873305,0.00034353757,0.00071256125,0.001739589,0.00007363815,0.00008320819,0.000014041502,0.00002494993,0.009677989],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945748,0.0006632802,0.0013000978,0.0014407557,0.0013248404,0.0006962694],"domain_scores_gemma":[0.9928634,0.0038465904,0.00038658624,0.0013171135,0.0011202703,0.00046600067],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002200926,0.00043883309,0.0009264185,0.00038097138,0.00026856258,0.00081997114,0.00094559265,0.00025401576,0.024617553],"category_scores_gemma":[0.0024268122,0.0003622185,0.00017996499,0.0015829977,0.0002881572,0.0005376703,0.00018691969,0.0005004548,0.0014003918],"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.0020618208,0.0010125423,0.008681923,0.00003289516,0.00015230721,0.00046796337,0.0017398729,0.00025095965,0.2002175,0.19605152,0.013712638,0.575618],"study_design_scores_gemma":[0.022371281,0.00088040467,0.07696209,0.000596139,0.00016239802,0.00013389015,0.010560477,0.091280736,0.031335104,0.5763821,0.1866089,0.0027264494],"about_ca_topic_score_codex":0.0000412685,"about_ca_topic_score_gemma":0.0005874015,"teacher_disagreement_score":0.5728916,"about_ca_system_score_codex":0.00006490547,"about_ca_system_score_gemma":0.0006727382,"threshold_uncertainty_score":0.999883},"labels":[],"label_agreement":null},{"id":"W4210625983","doi":"10.1109/cdc45484.2021.9683060","title":"Distributed Nash equilibrium seeking resilient to adversaries","year":2021,"lang":"en","type":"article","venue":"2021 60th IEEE Conference on Decision and Control (CDC)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Computer science; Best response; Correlated equilibrium; Computer security; Epsilon-equilibrium; Core (optical fiber); Adversarial system; Game theory; Mathematical optimization; Mathematical economics; Equilibrium selection; Repeated game; Artificial intelligence; Mathematics","score_opus":0.07272509218434094,"score_gpt":0.3584789924408153,"score_spread":0.2857539002564744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210625983","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.61995584,0.00025005706,0.35281643,0.013955799,0.0010208614,0.00059576205,0.00046584356,0.00008720447,0.010852224],"genre_scores_gemma":[0.992259,0.000041346237,0.00059581455,0.0021480261,0.00013118781,0.000058660244,0.00001912701,0.000016143067,0.0047306735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956876,0.00040866956,0.00086964323,0.0011644723,0.0013722174,0.0004974118],"domain_scores_gemma":[0.993904,0.002997724,0.0002187702,0.0013171877,0.0010431914,0.00051912095],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017201088,0.0003129678,0.00062555075,0.00022885016,0.00037489732,0.0010007073,0.0008014315,0.00015354721,0.0026886351],"category_scores_gemma":[0.004372213,0.00024766897,0.00017757982,0.0011320091,0.0001813023,0.00026045684,0.0002552214,0.00028852432,0.0017084008],"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.0019758733,0.0005292484,0.0018933157,0.000010647474,0.000110603316,0.00022834336,0.0010713926,0.0021866043,0.1366852,0.18806297,0.045794137,0.6214517],"study_design_scores_gemma":[0.008576365,0.0008133292,0.039803,0.00051601796,0.00016456726,0.00009842335,0.007527167,0.04283422,0.022030765,0.46530667,0.4104782,0.0018512793],"about_ca_topic_score_codex":0.000009036356,"about_ca_topic_score_gemma":0.00007889955,"teacher_disagreement_score":0.6196004,"about_ca_system_score_codex":0.000046904297,"about_ca_system_score_gemma":0.0002926439,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W4214673652","doi":"10.3386/w15748","title":"The Political Economy of Indirect Control","year":2010,"lang":"en","type":"report","venue":"National Bureau of Economic Research","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":"Kellogg's (Canada)","funders":"Economic and Social Research Council","keywords":"Politics; Control (management); Political science; Economic system; Political economy; Economics; Economy; Management; Law","score_opus":0.5887726365194359,"score_gpt":0.6214647063193358,"score_spread":0.032692069799899914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214673652","genre_codex":"other","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.0016888839,0.00019011482,0.000020617654,0.008052797,0.00033657855,0.00051302626,0.00027662914,0.000006129112,0.9889152],"genre_scores_gemma":[0.988755,0.00003906048,0.00004752581,0.000053788062,0.00072066276,0.00014225912,0.00004035431,0.000017482636,0.0101839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942343,0.00057245797,0.0016011493,0.00053489406,0.0025813163,0.0004758551],"domain_scores_gemma":[0.9643595,0.02852078,0.00076631433,0.0009044553,0.0052762013,0.00017274148],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.034519915,0.00015454499,0.0006070312,0.0007513482,0.00029438996,0.00015878545,0.0021779602,0.00040171208,0.0010229284],"category_scores_gemma":[0.016126797,0.000104267645,0.00031105845,0.00028466072,0.0016109694,0.00012286514,0.00022225268,0.0010893884,0.00055244763],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033784792,0.000037872924,0.00034138386,0.000008208202,0.000069365815,2.2526434e-7,0.000010704846,0.000013015996,0.00008060141,0.95829964,0.038575407,0.0025298055],"study_design_scores_gemma":[0.00016821048,0.000030313837,0.00053098134,0.000008943145,0.000006403783,0.000007836198,0.00008552751,0.000115560586,0.0005855709,0.7764437,0.22194974,0.00006717924],"about_ca_topic_score_codex":0.00018567151,"about_ca_topic_score_gemma":0.00017737907,"teacher_disagreement_score":0.9870661,"about_ca_system_score_codex":0.0004463699,"about_ca_system_score_gemma":0.0065367427,"threshold_uncertainty_score":0.99989027},"labels":[],"label_agreement":null},{"id":"W4214822736","doi":"10.2139/ssrn.4048747","title":"Impact of External Influence on Unilateral Improvements in the Graph Model for Conflict Resolution","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Conflict resolution; Psychology; Computer science; Social psychology; Political science; Law","score_opus":0.060153884492497256,"score_gpt":0.3916705250880942,"score_spread":0.33151664059559693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214822736","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.9659102,0.00011101851,0.03330133,0.00026211992,0.000027584154,0.00026107742,0.0000249088,0.0000036617748,0.000098118944],"genre_scores_gemma":[0.99922335,0.00004422959,0.000046158308,0.00014336119,0.000026389109,0.000058583297,0.0000016712637,0.000005905307,0.00045034225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755746,0.00027608802,0.0004632041,0.00018377815,0.0007084285,0.0008110197],"domain_scores_gemma":[0.99891764,0.00031548337,0.00033001965,0.0002957666,0.000107946005,0.000033122866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008486283,0.00009117808,0.00013919118,0.00023223052,0.00038092444,0.000056607634,0.0010110586,0.000021672387,0.000027896442],"category_scores_gemma":[0.00017001333,0.00005598768,0.00019302712,0.00047729362,0.000054362743,0.0001632069,0.000054968605,0.0009087244,0.0000031341192],"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.00077380135,0.00029921802,0.0050339205,9.2493434e-7,0.00003822139,7.5050406e-7,0.0016981765,0.44082588,0.014746391,0.52514905,0.00012249524,0.011311175],"study_design_scores_gemma":[0.0006871936,0.0009638018,0.011449445,0.0000036815863,0.000008958013,0.00005508734,0.00087631436,0.039262526,0.000060513314,0.9464714,0.000093689465,0.00006738032],"about_ca_topic_score_codex":0.000055283846,"about_ca_topic_score_gemma":0.000059081685,"teacher_disagreement_score":0.42132238,"about_ca_system_score_codex":0.00035359606,"about_ca_system_score_gemma":0.0007634485,"threshold_uncertainty_score":0.39480057},"labels":[],"label_agreement":null},{"id":"W4220752472","doi":"10.1016/j.ejor.2022.03.048","title":"Computing equilibria for integer programming games","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":22,"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; Université de Montréal","funders":"","keywords":"Nash equilibrium; Knapsack problem; Mathematical optimization; Computer science; Mathematical economics; Stochastic game; Class (philosophy); Integer (computer science); Integer programming; Game theory; Computation; Set (abstract data type); Outcome (game theory); Mathematics; Algorithm; Artificial intelligence","score_opus":0.39841379435210134,"score_gpt":0.5235232665533408,"score_spread":0.12510947220123947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220752472","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.82973933,0.0003136493,0.13417792,0.012844214,0.00047085976,0.00063584046,0.00003492326,0.000016808359,0.021766443],"genre_scores_gemma":[0.98630226,0.0000013812479,0.009321901,0.00014207896,0.00045716256,0.000009093983,0.000004242496,0.000014523651,0.0037473426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99357,0.0028752473,0.00077540433,0.00020982746,0.0023163185,0.00025315685],"domain_scores_gemma":[0.99434,0.0032867698,0.00022023826,0.00022094008,0.0018089646,0.00012307269],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.048209913,0.00006265517,0.00014143072,0.00038871542,0.0010737116,0.0004965089,0.0012721065,0.0000064151827,0.0011023534],"category_scores_gemma":[0.0058872513,0.000047005844,0.00012553675,0.0007313333,0.00014199816,0.00024053143,0.00047599268,0.0005437194,0.00011868927],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000707931,0.0005321542,0.0010446563,0.000008831342,0.00007732742,0.000114425595,0.005224069,0.0271554,0.027108766,0.30769387,0.1503661,0.4799665],"study_design_scores_gemma":[0.0006972458,0.00087355654,0.0021507372,0.000015715827,0.000004343946,0.00021725627,0.005160393,0.009569791,0.00038153422,0.021636542,0.9591844,0.000108470194],"about_ca_topic_score_codex":5.4683784e-7,"about_ca_topic_score_gemma":2.6087045e-7,"teacher_disagreement_score":0.8088183,"about_ca_system_score_codex":0.000060770864,"about_ca_system_score_gemma":0.0002882079,"threshold_uncertainty_score":0.99981076},"labels":[],"label_agreement":null},{"id":"W4225343237","doi":"10.1287/opre.2021.2209","title":"Learning Manipulation Through Information Dissemination","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Misinformation; Dissemination; Computer science; Social learning; Process (computing); Private information retrieval; Incentive; Control (management); Information Dissemination; Knowledge management; Perspective (graphical); Economics; Microeconomics; Artificial intelligence; World Wide Web; Computer security","score_opus":0.2914305467021117,"score_gpt":0.543846843305784,"score_spread":0.2524162966036723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225343237","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.82048875,0.00003254886,0.07040357,0.008014939,0.00019801689,0.00094184274,0.0000430898,0.000109905675,0.09976736],"genre_scores_gemma":[0.98113537,0.0000052884484,0.00083145354,0.00006250077,0.000045815676,0.0005071263,0.00020139938,0.000005797595,0.01720526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957181,0.0012159348,0.0004374782,0.00022739143,0.002179471,0.00022158593],"domain_scores_gemma":[0.9977551,0.00092071143,0.000043795084,0.00042538458,0.00080751796,0.00004748184],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007706259,0.00006176287,0.00008227221,0.00044738146,0.003898722,0.00066504645,0.0005758302,0.000028708904,0.0053423205],"category_scores_gemma":[0.0030665146,0.000056140147,0.000040425086,0.0024575463,0.00008306148,0.0017552596,0.00033872007,0.0005381715,0.0018355823],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025216154,0.00010178798,0.0006884249,0.000001990765,0.000005289329,7.3692104e-7,0.0109809395,0.37451583,0.0037433163,0.5307681,0.013432081,0.06573628],"study_design_scores_gemma":[0.00025714075,0.00023792949,0.0073026326,0.000004562668,0.0000039597767,0.000017278271,0.0396876,0.24910603,0.0013611569,0.08022515,0.6215952,0.00020136317],"about_ca_topic_score_codex":0.00007246679,"about_ca_topic_score_gemma":0.000026582054,"teacher_disagreement_score":0.6081631,"about_ca_system_score_codex":0.00014127042,"about_ca_system_score_gemma":0.00009551066,"threshold_uncertainty_score":0.9989416},"labels":[],"label_agreement":null},{"id":"W4230785229","doi":"10.1090/stml/080/07","title":"General games","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.07494761521922791,"score_gpt":0.3631716084985609,"score_spread":0.288223993279333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230785229","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003058859,0.00018011231,0.0018056141,0.0027534163,0.00014925258,0.00039371368,0.00013478163,0.00018929406,0.99408793],"genre_scores_gemma":[0.002321714,0.00004467019,0.0019796723,0.0006158323,0.00060035114,0.00004315286,0.000011029822,0.00007443838,0.9943091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963681,0.00006251347,0.0010046313,0.0006936665,0.0015837249,0.00028736974],"domain_scores_gemma":[0.996135,0.0018344537,0.00034226567,0.0013878071,0.00005325675,0.0002472002],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00062689406,0.00037074205,0.00067096995,0.00020483513,0.000092546616,0.00037566782,0.001908836,0.00025607494,0.054730255],"category_scores_gemma":[0.00016368627,0.00021152104,0.00038816134,0.00006937669,0.00034007063,0.0003956523,0.0008874797,0.0002663379,0.044757318],"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.0000060216203,0.00004389699,0.000013384177,0.000008727679,0.000036502508,0.000011203978,0.00008120095,1.465145e-7,0.000015118132,0.92611694,0.06587513,0.0077917497],"study_design_scores_gemma":[0.00007727269,0.000018958008,0.000026334947,0.00007469417,0.00001959921,0.0000067477554,0.0000147224955,0.000003448259,0.00003192926,0.62761164,0.37193206,0.0001825918],"about_ca_topic_score_codex":1.9338971e-8,"about_ca_topic_score_gemma":4.9301224e-8,"teacher_disagreement_score":0.30605695,"about_ca_system_score_codex":0.000013117375,"about_ca_system_score_gemma":0.00006257674,"threshold_uncertainty_score":0.95598644},"labels":[],"label_agreement":null},{"id":"W4232236877","doi":"10.23952/jnva.4.2020.1.04","title":"Nonsmooth dynamics of generalized Nash games","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Best response; Epsilon-equilibrium; Mathematical economics; Dynamical systems theory; Mathematical optimization; Context (archaeology); Computer science; Normal-form game; Sequential game; Mathematics; Game theory","score_opus":0.06348100485838679,"score_gpt":0.3580243514068142,"score_spread":0.2945433465484274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232236877","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.5957543,0.0001547529,0.38595572,0.017317815,0.000046566623,0.00004735732,0.00018142458,0.00000484315,0.00053717993],"genre_scores_gemma":[0.96969575,0.00004196241,0.029454384,0.00038050296,0.00019760286,4.8456985e-7,0.000015654476,0.0000033245287,0.00021031464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815893,0.0001294367,0.0008148754,0.00013310106,0.0006970645,0.00006661784],"domain_scores_gemma":[0.9977416,0.000541753,0.0007632066,0.00012345424,0.0007033947,0.00012659734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012648413,0.00007025376,0.0004012875,0.000295601,0.000060060305,0.00005562287,0.0002977835,0.000038088376,0.0005522818],"category_scores_gemma":[0.0009052573,0.000047580153,0.0003293666,0.0015212036,0.00005486417,0.00015030641,0.000043666896,0.000099388904,0.000009756703],"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.0009442435,0.0009542699,0.20472854,0.000029328887,0.00740551,0.000020404117,0.004034346,0.14576907,0.0070356955,0.58589965,0.003906703,0.039272226],"study_design_scores_gemma":[0.00076116604,0.00013866396,0.069728725,0.0000052582236,0.001309242,0.000014011445,0.0004933938,0.84549373,0.00018699441,0.07481551,0.0069162566,0.00013704464],"about_ca_topic_score_codex":0.0000060539437,"about_ca_topic_score_gemma":0.000011737993,"teacher_disagreement_score":0.6997247,"about_ca_system_score_codex":0.00001001002,"about_ca_system_score_gemma":0.0000786812,"threshold_uncertainty_score":0.6047098},"labels":[],"label_agreement":null},{"id":"W4232947741","doi":"10.2139/ssrn.1703170","title":"Search Committees","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Political science","score_opus":0.13496554915450665,"score_gpt":0.3778886923023547,"score_spread":0.24292314314784808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232947741","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.8879908,0.0005611712,0.049516696,0.0011957972,0.00013068542,0.000090504225,0.000001843047,0.000034560566,0.060477976],"genre_scores_gemma":[0.99032587,0.00019952198,0.00023950559,0.00011099001,0.000118175056,0.0000030710019,2.8421897e-7,0.000007857292,0.008994706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973042,0.00024378036,0.00032681387,0.00018211157,0.00059906713,0.001344004],"domain_scores_gemma":[0.99899524,0.0002443736,0.00010523429,0.00037220566,0.0001793903,0.000103523336],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009147931,0.00008081512,0.00012495654,0.00015099075,0.0003407013,0.00009402295,0.001077269,0.00004061286,0.0010765062],"category_scores_gemma":[0.00025144216,0.000055656223,0.00010366744,0.00042809066,0.000107130196,0.00021488685,0.00006927131,0.0012122276,0.0018857662],"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.000022060163,0.000052496194,0.004269016,1.5060733e-7,0.00001940921,0.0000011785339,0.0005973202,0.0000033909814,0.00022069238,0.9162836,0.00038474452,0.07814592],"study_design_scores_gemma":[0.00014412805,0.000105321276,0.004489207,0.000001550956,0.0000056297113,0.0002356931,0.005117992,0.000023832348,0.0007048595,0.9825047,0.0065955385,0.00007153636],"about_ca_topic_score_codex":0.000023330198,"about_ca_topic_score_gemma":0.00013044698,"teacher_disagreement_score":0.10233512,"about_ca_system_score_codex":0.0001172916,"about_ca_system_score_gemma":0.0006996191,"threshold_uncertainty_score":0.9998366},"labels":[],"label_agreement":null},{"id":"W4235778759","doi":"10.1007/978-1-4614-6170-8_110087","title":"Bayesian Games","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Calgary","funders":"","keywords":"Bayesian probability; Computer science; Artificial intelligence","score_opus":0.09277595891872456,"score_gpt":0.358590339433418,"score_spread":0.2658143805146934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235778759","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048556044,0.000035677294,0.09203332,0.001246781,0.00010863578,0.00010513591,0.000011606898,0.00006587982,0.9063881],"genre_scores_gemma":[0.01926751,0.000008383436,0.0011916776,0.0006490119,0.00021023402,0.000006564021,0.000005470067,0.000019793706,0.97864133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824864,0.000026127844,0.0004432902,0.0004734057,0.000681654,0.00012690721],"domain_scores_gemma":[0.99751616,0.0008773386,0.00021066061,0.0011446115,0.0001391446,0.000112093076],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011080944,0.0001777196,0.00030732952,0.00016642558,0.000089278365,0.00013964094,0.0008805665,0.00019065554,0.04797523],"category_scores_gemma":[0.0001884179,0.00011824498,0.00018492251,0.000039587543,0.00014959364,0.000036522444,0.000114612885,0.00017346625,0.033707336],"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.0000012459803,0.0000015837065,0.00000206404,5.310924e-7,0.00000439991,5.212213e-7,0.000014957006,0.0000014988042,0.000004812778,0.8349775,0.08313793,0.08185296],"study_design_scores_gemma":[0.000018630966,0.000006666137,0.0000074163445,0.0000042703737,0.0000049340365,0.0000020599393,0.000006713288,0.000021372702,0.000017957098,0.49677533,0.5030545,0.00008016067],"about_ca_topic_score_codex":0.0000022450663,"about_ca_topic_score_gemma":0.000016917127,"teacher_disagreement_score":0.41991657,"about_ca_system_score_codex":0.000010357867,"about_ca_system_score_gemma":0.00003299108,"threshold_uncertainty_score":0.967045},"labels":[],"label_agreement":null},{"id":"W4236307997","doi":"10.11647/obp.0211.15","title":"Strategic games","year":2020,"lang":"en","type":"book-chapter","venue":"Open Book Publishers","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":"University of Toronto","funders":"","keywords":"Business","score_opus":0.258278539831579,"score_gpt":0.3844367346129897,"score_spread":0.12615819478141072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236307997","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069156654,0.00033793607,0.000062366096,0.010244652,0.00028649927,0.00076080556,0.000082886116,0.00007617555,0.9881418],"genre_scores_gemma":[0.0022346415,0.000019724395,0.00029004214,0.00448549,0.00023130637,0.00005603773,0.000075382755,0.00006268009,0.9925447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963478,0.00007902771,0.0008297829,0.0012073265,0.0012542354,0.0002818674],"domain_scores_gemma":[0.99643844,0.00056529476,0.0006030428,0.0016512257,0.00033896056,0.00040303363],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017404153,0.00039215988,0.00068327866,0.00020429508,0.00022702638,0.01025319,0.0061195795,0.00033579968,0.05993605],"category_scores_gemma":[0.0003597879,0.0003137955,0.00026940805,0.00018664348,0.00030824973,0.0031080612,0.0011796296,0.00062850304,0.016391924],"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.000011078437,0.0000056823105,9.146053e-7,0.000001438023,0.000022430953,0.0000078464955,0.000042368538,0.0000027115527,0.0000047943713,0.5585703,0.4359061,0.0054242853],"study_design_scores_gemma":[0.000098403936,0.000024319486,0.0000025313132,0.000013943218,0.000016102556,0.0000031780253,0.00018419941,0.000007817619,0.000005176094,0.46731108,0.5321338,0.00019945951],"about_ca_topic_score_codex":0.000017734517,"about_ca_topic_score_gemma":0.00002329344,"teacher_disagreement_score":0.09622768,"about_ca_system_score_codex":0.00005813249,"about_ca_system_score_gemma":0.0005381648,"threshold_uncertainty_score":0.9999314},"labels":[],"label_agreement":null},{"id":"W4236515952","doi":"10.1007/978-1-4939-7131-2_100052","title":"Bayesian Games","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Calgary","funders":"","keywords":"Bayesian probability; Computer science; Artificial intelligence","score_opus":0.1161834061189696,"score_gpt":0.37601833472115825,"score_spread":0.25983492860218865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236515952","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021215285,0.00004176005,0.01583939,0.0008537684,0.00015046092,0.00012330785,0.000023279881,0.00007093536,0.9828759],"genre_scores_gemma":[0.005509221,0.000009381112,0.0016453891,0.00046640472,0.00034419363,0.0000059555177,0.0000052574137,0.000019597466,0.9919946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823946,0.000018717723,0.0004269468,0.0004975125,0.0006854931,0.00013185276],"domain_scores_gemma":[0.99778533,0.0005424286,0.00019775791,0.0011475364,0.00021883627,0.000108103246],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009157384,0.0001751703,0.00026261937,0.00016989486,0.000103573664,0.00015028544,0.0009157082,0.00019484166,0.20819636],"category_scores_gemma":[0.0001597282,0.000116109855,0.00016761363,0.000050372157,0.0002823432,0.000069206464,0.00014211913,0.00014038033,0.07239598],"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.0000019001166,0.000002706337,0.0000015873896,3.7301547e-7,0.000005732616,8.425885e-7,0.00004755023,1.6604604e-7,0.0000056878157,0.75788784,0.21963975,0.022405878],"study_design_scores_gemma":[0.000016513062,0.000010298504,0.00000591654,0.0000045286974,0.000004945926,0.0000024310245,0.00002046425,0.000007945218,0.000037847523,0.5034295,0.49638164,0.00007796787],"about_ca_topic_score_codex":0.0000018337726,"about_ca_topic_score_gemma":0.000023081804,"teacher_disagreement_score":0.2767419,"about_ca_system_score_codex":0.000012343651,"about_ca_system_score_gemma":0.000047481866,"threshold_uncertainty_score":0.92832625},"labels":[],"label_agreement":null},{"id":"W4238105167","doi":"10.1002/rsa.20199","title":"Nash equilibria in random games","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nash equilibrium; Las vegas; Mathematics; Stochastic game; Best response; Combinatorics; Simple (philosophy); Epsilon-equilibrium; Polytope; Mathematical economics","score_opus":0.03935174806480356,"score_gpt":0.362859618645556,"score_spread":0.3235078705807524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238105167","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.967072,0.0009232177,0.024924714,0.00041718307,0.00029963307,0.0003788264,0.000019787978,0.00004238155,0.0059222686],"genre_scores_gemma":[0.9963397,0.000050108574,0.0022664056,0.00019025763,0.00022268461,0.000010934481,0.0000041463645,0.000010448735,0.000905337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978352,0.00015529404,0.0006420108,0.0004661281,0.0005452947,0.00035604846],"domain_scores_gemma":[0.9968817,0.0023517737,0.00014556771,0.00039371557,0.00007262986,0.00015458163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038864717,0.00017563837,0.00044125222,0.00024223441,0.00015126797,0.00020467557,0.00040883673,0.0000998071,0.0003961732],"category_scores_gemma":[0.0007492288,0.0001161427,0.00010785984,0.0005656225,0.00020616638,0.00018175477,0.000103172424,0.00018619496,0.000030785242],"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.0025797477,0.00006499233,0.0053714537,0.000010508969,0.000038710154,0.000050028644,0.0021445,0.0001813705,0.009101199,0.0727631,0.0018385844,0.9058558],"study_design_scores_gemma":[0.020503715,0.000057813337,0.07785823,0.000018822147,0.00001962914,0.00008223549,0.0013948345,0.00293909,0.0034134556,0.85156626,0.041748356,0.00039756915],"about_ca_topic_score_codex":0.000034216657,"about_ca_topic_score_gemma":0.000054143333,"teacher_disagreement_score":0.9054582,"about_ca_system_score_codex":0.0000113901315,"about_ca_system_score_gemma":0.000027234559,"threshold_uncertainty_score":0.47361618},"labels":[],"label_agreement":null},{"id":"W4238414584","doi":"10.1002/9780470400531.eorms0256","title":"Differential Games","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","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":"McGill University","funders":"","keywords":"Mathematical economics; Differential (mechanical device); Computer science; Differential game; Management science; Calculus (dental); Mathematics; Mathematical optimization; Economics; Physics; Thermodynamics; Medicine","score_opus":0.114003217345246,"score_gpt":0.4203985179793489,"score_spread":0.3063953006341029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238414584","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010918499,0.00029239614,0.003359341,0.00018181799,0.00021529905,0.0008805159,0.000051649375,0.000043465687,0.99388367],"genre_scores_gemma":[0.018197693,0.010550865,0.0039896793,0.000019211971,0.00012204617,0.0002154294,0.000009284507,0.0000526741,0.9668431],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956768,0.00015867202,0.00044808243,0.00089504325,0.0023488617,0.00047251192],"domain_scores_gemma":[0.99790245,0.00017347292,0.00008777722,0.0012312974,0.00035980486,0.00024517885],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028836085,0.00017792468,0.00027712257,0.002176121,0.0005318832,0.00035213778,0.0021317652,0.000081348095,0.009209251],"category_scores_gemma":[0.0005653482,0.00013097624,0.000046676443,0.0023163112,0.0031283977,0.00029834593,0.00107076,0.00022139132,0.0007582491],"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.00000938115,0.00021957172,0.00014298971,0.000037652244,0.000022629267,0.000003884276,0.00033812504,0.0000060385128,0.0001584586,0.45208624,0.4963941,0.050580934],"study_design_scores_gemma":[0.00018745496,0.000108265864,0.0013172053,0.00012274357,0.000014141577,0.000001681455,0.00056443963,0.00022115876,0.00012254297,0.024084384,0.9730446,0.00021138205],"about_ca_topic_score_codex":0.00020888312,"about_ca_topic_score_gemma":0.00028608035,"teacher_disagreement_score":0.4766505,"about_ca_system_score_codex":0.000020168976,"about_ca_system_score_gemma":0.00013603536,"threshold_uncertainty_score":0.9995845},"labels":[],"label_agreement":null},{"id":"W4238547632","doi":"10.1002/9781118785317.weom120219","title":"Game Theory","year":2015,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Management","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":"University of Toronto","funders":"","keywords":"Computer science; Mathematical economics; Psychology; Mathematics","score_opus":0.04347513790954386,"score_gpt":0.3382525028380429,"score_spread":0.29477736492849904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238547632","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017042134,0.0011983362,0.0023301227,0.00007949353,0.0005352863,0.0005636567,0.0001260962,0.00012617857,0.9950238],"genre_scores_gemma":[0.00061457034,0.0017012092,0.0013042671,0.00011783999,0.00027042357,0.00008247173,0.000041054518,0.0001556603,0.9957125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698025,0.0002700575,0.000603292,0.0005791993,0.0013274301,0.0002397492],"domain_scores_gemma":[0.9972721,0.00028343126,0.0005721913,0.0016368922,0.00010004164,0.0001353443],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029683753,0.00025918035,0.00046334296,0.00058296835,0.000024313125,0.00003722944,0.001588913,0.00011958282,0.010373003],"category_scores_gemma":[0.00023191793,0.0001980135,0.0001289711,0.00062701845,0.00020348957,0.00005006193,0.0004423743,0.00013143262,0.0060007465],"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.000009415127,0.0000639357,0.0000150766955,0.000025768995,0.00005549393,0.0000066487023,0.00009435501,0.0000067526353,1.8985256e-7,0.09465936,0.82400024,0.08106275],"study_design_scores_gemma":[0.00015349459,0.00001725598,0.000051308016,0.00009471358,0.000056237262,7.7698684e-7,0.00028264837,0.0000025560441,0.0000010875824,0.23069285,0.7684894,0.0001576314],"about_ca_topic_score_codex":0.0000104199635,"about_ca_topic_score_gemma":0.000017837323,"teacher_disagreement_score":0.13603349,"about_ca_system_score_codex":0.000022203805,"about_ca_system_score_gemma":0.00004132176,"threshold_uncertainty_score":0.9947732},"labels":[],"label_agreement":null},{"id":"W4240001493","doi":"10.1017/cbo9780511811654.008","title":"Learning and Teaching","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Surprise; Variety (cybernetics); Rationality; Key (lock); Subject (documents); Cognitive science; Computer science; Psychology; Artificial intelligence; Epistemology; Social psychology; World Wide Web","score_opus":0.06459679505690953,"score_gpt":0.28167763653948963,"score_spread":0.2170808414825801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240001493","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015742807,0.00008253937,0.00071810145,0.000026630287,0.00005708495,0.00016738653,0.00004203623,0.00009488291,0.9972371],"genre_scores_gemma":[0.024332566,0.000091024085,0.00014136756,0.000033420183,0.00007362895,3.109772e-7,0.000007320876,0.000019946981,0.97530043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984772,0.00012081957,0.00021432956,0.0005661378,0.00044875967,0.00017270996],"domain_scores_gemma":[0.998401,0.00060563843,0.00026578768,0.00044554746,0.00012329123,0.00015873487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053732627,0.00022203868,0.00032095687,0.00021389805,0.00070083374,0.00009085909,0.0005788659,0.00021463355,0.000013766609],"category_scores_gemma":[0.00013555902,0.00022423996,0.00013352218,0.000005859228,0.00037714248,0.00009736904,0.00048065284,0.00077721727,0.00008272655],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018527944,0.0000029543114,0.0000066750326,0.000003549599,0.00002116762,0.00005888999,0.00014235875,0.0000030186552,0.000030100073,0.96354204,0.02108636,0.015084376],"study_design_scores_gemma":[0.0001664605,0.000027535278,0.00002411423,0.000030003168,0.000039989634,0.00004227918,0.00014330343,0.000052872678,0.000030711082,0.00024939608,0.998961,0.00023233664],"about_ca_topic_score_codex":0.000020902886,"about_ca_topic_score_gemma":5.0502325e-7,"teacher_disagreement_score":0.97787464,"about_ca_system_score_codex":0.000041722007,"about_ca_system_score_gemma":0.000043760454,"threshold_uncertainty_score":0.91442406},"labels":[],"label_agreement":null},{"id":"W4240038541","doi":"10.2139/ssrn.3692371","title":"Probabilistic Network Values","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Computer science; Statistics; Mathematics","score_opus":0.06454629600573372,"score_gpt":0.3445697481870682,"score_spread":0.2800234521813345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240038541","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.625191,0.0040874146,0.29024416,0.05425373,0.0005179952,0.0005546417,0.0000062447302,0.00020411554,0.02494071],"genre_scores_gemma":[0.9958122,0.00015491995,0.0002092591,0.0008050268,0.00093719317,0.000005560965,6.421776e-7,0.000010213196,0.0020649887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970558,0.00024923746,0.0004286255,0.0002669427,0.00059681304,0.001402571],"domain_scores_gemma":[0.99876904,0.00046258396,0.00019863612,0.0002444884,0.00015012451,0.00017513384],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054254513,0.00010274744,0.00017832627,0.00003565328,0.000353697,0.00017976006,0.0008802019,0.000040502597,0.00030850797],"category_scores_gemma":[0.0015963987,0.00007224115,0.0001244898,0.000685248,0.000081248276,0.00017138723,0.00006777322,0.001105346,0.0011130502],"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.000034924393,0.000020542502,0.00051151897,6.057751e-7,0.000024754776,0.0000011918935,0.00024305031,0.002838924,0.00008273941,0.9615745,0.0039173868,0.030749884],"study_design_scores_gemma":[0.00014790606,0.00014778461,0.0002892511,0.0000025404777,0.000013230939,0.00008463706,0.0009606203,0.00096499757,0.000014478999,0.9776041,0.019684365,0.00008612567],"about_ca_topic_score_codex":0.0000014184486,"about_ca_topic_score_gemma":0.000022281649,"teacher_disagreement_score":0.37062123,"about_ca_system_score_codex":0.00011723222,"about_ca_system_score_gemma":0.0008861491,"threshold_uncertainty_score":0.9996647},"labels":[],"label_agreement":null},{"id":"W4241798539","doi":"10.1007/978-3-030-49629-6_13","title":"Conflict Resolution Using the Graph Model: Individuals and Coalitions","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision 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 Waterloo; Toronto Metropolitan University; Wilfrid Laurier University","funders":"","keywords":"Conflict resolution; Outcome (game theory); Graph; Management science; Conflict analysis; Computer science; Extension (predicate logic); Flexibility (engineering); Operations research; Theoretical computer science; Mathematical economics; Mathematics; Political science; Engineering; Economics; Management; Law","score_opus":0.3185951462933854,"score_gpt":0.40987830577638695,"score_spread":0.09128315948300153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241798539","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010159859,0.0008835564,0.116784796,0.0020940725,0.0000776763,0.00038706127,0.00036242648,0.000055538705,0.8783389],"genre_scores_gemma":[0.037657395,0.00024431662,0.0034171252,0.0010279368,0.000115926654,0.000021958434,0.000054829874,0.00002841315,0.9574321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980709,0.00009140746,0.0004998638,0.00048198097,0.00070512627,0.00015075532],"domain_scores_gemma":[0.9975468,0.00097580196,0.0002509643,0.000860273,0.000280695,0.000085493695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017125444,0.0001852919,0.00027249553,0.00017574643,0.0005634946,0.00033376177,0.00044539498,0.0001998329,0.0015451327],"category_scores_gemma":[0.00017440898,0.00011535639,0.00014513893,0.00012579231,0.00044894285,0.00011576235,0.00024430978,0.00026907417,0.00008774485],"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.0000012143048,0.0000047787753,0.000005188473,0.0000010509508,0.000018852117,5.656763e-7,0.0001318419,0.00078971597,0.000048107784,0.99504983,0.0032914756,0.00065738667],"study_design_scores_gemma":[0.000060372124,0.00000540478,0.00001866828,0.000024127405,0.00005936267,0.000020967844,0.00025026716,0.006839705,0.000017859082,0.80215573,0.19040638,0.00014115116],"about_ca_topic_score_codex":0.000011344619,"about_ca_topic_score_gemma":0.00002613504,"teacher_disagreement_score":0.19289409,"about_ca_system_score_codex":0.000015229707,"about_ca_system_score_gemma":0.000102759805,"threshold_uncertainty_score":0.9993676},"labels":[],"label_agreement":null},{"id":"W4242901191","doi":"10.1002/sys.20104","title":"Coalition analysis in the graph model for conflict resolution","year":2008,"lang":"en","type":"article","venue":"Systems Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conflict resolution; Stability (learning theory); Graph; Operations research; Computer science; Conflict analysis; Management science; Mathematical economics; Political science; Mathematics; Economics; Theoretical computer science; Law","score_opus":0.17916789186257684,"score_gpt":0.3544746350789112,"score_spread":0.17530674321633435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242901191","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.17861554,0.00010490552,0.8205237,0.00008491427,0.00005239335,0.00026690887,0.000019833311,0.000028645749,0.00030318118],"genre_scores_gemma":[0.9988461,0.0000043377067,0.0005062579,0.000015597077,0.00004424009,0.00021127534,0.0000089730365,0.000004245667,0.00035896563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899423,0.000061534185,0.00033236147,0.00017194713,0.00030887898,0.00013105843],"domain_scores_gemma":[0.99895024,0.0005353549,0.00006469681,0.00035239165,0.000072468196,0.000024829671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021593808,0.0000635398,0.00015493907,0.00032334393,0.000106019805,0.000047293845,0.00028153154,0.000037930276,0.0000024505878],"category_scores_gemma":[0.00023723472,0.00004321036,0.00010723266,0.0012407682,0.000018564204,0.00009750453,0.000009813984,0.00005544656,0.000011553054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025781878,0.000007033515,0.00020174764,0.0000033842682,0.0000125653,3.5769602e-7,0.0008939653,0.9403998,0.0003469439,0.057800397,0.0003124384,0.000018750816],"study_design_scores_gemma":[0.00008781406,0.0000048822376,0.002395732,0.0000046747728,0.00001917732,0.000005787776,0.00032737144,0.9933271,0.000019987872,0.0013238753,0.0024292942,0.000054332308],"about_ca_topic_score_codex":0.0000318443,"about_ca_topic_score_gemma":0.000011315916,"teacher_disagreement_score":0.82023054,"about_ca_system_score_codex":0.00001823421,"about_ca_system_score_gemma":0.000009967455,"threshold_uncertainty_score":0.17620674},"labels":[],"label_agreement":null},{"id":"W4243225086","doi":"10.4086/cjtcs.2008.001","title":"","year":2008,"lang":"en","type":"article","venue":"Chicago Journal of Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Price of anarchy; Upper and lower bounds; Traverse; Routing (electronic design automation); Price of stability; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Economics; Computer network","score_opus":0.07155792032468704,"score_gpt":0.3597169142286344,"score_spread":0.28815899390394734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243225086","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.5444537,0.000031396474,0.44992736,0.004596975,0.0004817056,0.00007878848,0.0000012683834,0.000016388876,0.0004124087],"genre_scores_gemma":[0.93446136,0.000015518794,0.06373061,0.0012223654,0.000546293,0.0000019655188,7.8645634e-8,0.000009230124,0.000012575582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893665,0.00073694036,0.002380909,0.000830195,0.005869427,0.00081603776],"domain_scores_gemma":[0.98699576,0.0054503274,0.0012714667,0.0015735896,0.0034678294,0.0012410131],"candidate_categories":["metaresearch","sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.026401099,0.00028858872,0.0007894088,0.0010471476,0.0020279565,0.00063583744,0.009931075,0.00008726483,0.00016374353],"category_scores_gemma":[0.008896552,0.00017464317,0.0004892854,0.005070315,0.021463575,0.0021183265,0.0011501072,0.00080162025,0.000072776675],"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.00014633249,0.00026660913,0.002734146,9.70868e-7,0.000009597237,0.00011945099,0.001986895,0.0017483969,0.005860863,0.9679953,0.00021549285,0.018915951],"study_design_scores_gemma":[0.0007327384,0.0007763744,0.036243312,0.00002842133,0.000013938806,0.006377496,0.00016010675,0.01563862,0.014894809,0.92436194,0.0005157179,0.00025651895],"about_ca_topic_score_codex":5.0501455e-7,"about_ca_topic_score_gemma":2.3574046e-7,"teacher_disagreement_score":0.39000764,"about_ca_system_score_codex":0.00007450709,"about_ca_system_score_gemma":0.0005902607,"threshold_uncertainty_score":0.99945194},"labels":[],"label_agreement":null},{"id":"W4244634353","doi":"10.1017/cbo9780511805127.002","title":"Introduction","year":2000,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"McGill University","funders":"","keywords":"Environmental science","score_opus":0.05721396684623274,"score_gpt":0.2645872171086928,"score_spread":0.20737325026246006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244634353","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014956787,0.0000362974,0.00063637516,0.00019669475,0.00023034558,0.00025143364,0.00018805702,0.00011375754,0.9981975],"genre_scores_gemma":[0.0013732355,0.000042707637,0.00006191509,0.00006187104,0.00064168643,6.0126916e-7,0.000031191204,0.000022298957,0.99776447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811846,0.00007149543,0.00028586382,0.00074078096,0.0005929027,0.00019047793],"domain_scores_gemma":[0.99795115,0.00021148864,0.0002577441,0.0012135585,0.0002169105,0.0001491352],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004261012,0.00024858286,0.00033484967,0.0002762125,0.00027207195,0.00010503338,0.0010454812,0.00026972572,0.00043500462],"category_scores_gemma":[0.000042987926,0.00025246167,0.00023107689,0.000021264304,0.00033223943,0.00012195853,0.00021373118,0.00038066384,0.0013521699],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004411063,0.0000045068455,1.2918665e-7,0.0000017351176,0.000019202987,0.000015852065,0.00001603509,0.000006981984,0.000023541099,0.754454,0.23342621,0.011987692],"study_design_scores_gemma":[0.00015230813,0.000019632778,0.0000073423757,0.000011465093,0.00006825398,0.000015441647,0.000027612788,0.000016392247,0.00017297165,0.0033217322,0.9959373,0.00024954544],"about_ca_topic_score_codex":0.00001521044,"about_ca_topic_score_gemma":7.9886627e-7,"teacher_disagreement_score":0.7625111,"about_ca_system_score_codex":0.00008312213,"about_ca_system_score_gemma":0.00006455821,"threshold_uncertainty_score":0.9999928},"labels":[],"label_agreement":null},{"id":"W4245414594","doi":"10.1002/9781118785317.weom080236","title":"Predatory Pricing","year":2015,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Predatory pricing; Zoology; Geography; Biology; Economics; Microeconomics","score_opus":0.044834878288921805,"score_gpt":0.33455823679466584,"score_spread":0.28972335850574404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245414594","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047515554,0.00089262053,0.0011745032,0.00006451363,0.00051993964,0.0005960245,0.00009796173,0.000118800235,0.9964881],"genre_scores_gemma":[0.00045241558,0.0011652895,0.002491372,0.00007068476,0.00027201592,0.00007099891,0.000025229028,0.00013307642,0.9953189],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972239,0.00012760542,0.0005816043,0.00053782965,0.0013160454,0.00021298892],"domain_scores_gemma":[0.99766546,0.00015262453,0.00058194884,0.0013865017,0.00009538823,0.000118101154],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017362592,0.00022195964,0.00040321608,0.00055897085,0.000031623716,0.00003363977,0.0012922158,0.00010658357,0.0065327375],"category_scores_gemma":[0.00021250629,0.00017753914,0.00009284046,0.00059439574,0.0001204907,0.000058816233,0.00043854798,0.000121855286,0.0027978546],"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.0000040844125,0.00005688001,0.00006263097,0.000041186464,0.000045095367,0.00000523629,0.00009138766,0.000013850808,5.462032e-7,0.009748889,0.95457935,0.035350867],"study_design_scores_gemma":[0.00015681927,0.000018009303,0.0001530343,0.00012715817,0.00004824441,6.6933836e-7,0.0002836045,0.000007718943,0.0000018808674,0.018739635,0.98029137,0.00017187075],"about_ca_topic_score_codex":0.000024510275,"about_ca_topic_score_gemma":0.000034337376,"teacher_disagreement_score":0.035178993,"about_ca_system_score_codex":0.000030677715,"about_ca_system_score_gemma":0.000049370283,"threshold_uncertainty_score":0.99797857},"labels":[],"label_agreement":null},{"id":"W4247985919","doi":"10.1002/9781118785317.weom080229","title":"Game Theory","year":2015,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Management","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":"University of Toronto","funders":"","keywords":"Game theory; Mathematical economics; Computer science; Mathematics","score_opus":0.04347513790954386,"score_gpt":0.3382525028380429,"score_spread":0.29477736492849904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247985919","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017042134,0.0011983362,0.0023301227,0.00007949353,0.0005352863,0.0005636567,0.0001260962,0.00012617857,0.9950238],"genre_scores_gemma":[0.00061457034,0.0017012092,0.0013042671,0.00011783999,0.00027042357,0.00008247173,0.000041054518,0.0001556603,0.9957125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698025,0.0002700575,0.000603292,0.0005791993,0.0013274301,0.0002397492],"domain_scores_gemma":[0.9972721,0.00028343126,0.0005721913,0.0016368922,0.00010004164,0.0001353443],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029683753,0.00025918035,0.00046334296,0.00058296835,0.000024313125,0.00003722944,0.001588913,0.00011958282,0.010373003],"category_scores_gemma":[0.00023191793,0.0001980135,0.0001289711,0.00062701845,0.00020348957,0.00005006193,0.0004423743,0.00013143262,0.0060007465],"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.000009415127,0.0000639357,0.0000150766955,0.000025768995,0.00005549393,0.0000066487023,0.00009435501,0.0000067526353,1.8985256e-7,0.09465936,0.82400024,0.08106275],"study_design_scores_gemma":[0.00015349459,0.00001725598,0.000051308016,0.00009471358,0.000056237262,7.7698684e-7,0.00028264837,0.0000025560441,0.0000010875824,0.23069285,0.7684894,0.0001576314],"about_ca_topic_score_codex":0.0000104199635,"about_ca_topic_score_gemma":0.000017837323,"teacher_disagreement_score":0.13603349,"about_ca_system_score_codex":0.000022203805,"about_ca_system_score_gemma":0.00004132176,"threshold_uncertainty_score":0.9947732},"labels":[],"label_agreement":null},{"id":"W4249558969","doi":"10.1108/03684920410514328","title":"Learning systems","year":2004,"lang":"en","type":"article","venue":"Kybernetes","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"","keywords":"Disequilibrium; Computer science; Mathematical economics; Cybernetics; Artificial intelligence; Contrast (vision); Management science; Mathematics; Economics","score_opus":0.08270452992648503,"score_gpt":0.36757451591267615,"score_spread":0.2848699859861911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249558969","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.5214896,0.00034329368,0.0014392745,0.0008457203,0.0002382233,0.00014845698,0.000002543293,0.00016036673,0.4753325],"genre_scores_gemma":[0.9841399,0.0000027890069,0.00020409109,0.000044806948,0.00008164429,0.00001491651,0.0000010473678,0.0000049039068,0.01550587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990418,0.00006630405,0.00020901576,0.00019825599,0.00035618307,0.00012845638],"domain_scores_gemma":[0.9991097,0.00041447263,0.00007940667,0.0002689055,0.00007056768,0.00005695919],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009034854,0.00005574925,0.00009705289,0.00005835563,0.00012574742,0.00016622678,0.00034704345,0.000029867813,0.00020477673],"category_scores_gemma":[0.00068802276,0.0000401017,0.00004054778,0.00031407148,0.0000549914,0.00010428563,0.000043442313,0.00008685551,0.005328761],"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.0000012157127,0.0000114562,0.0017179888,5.964324e-7,0.0000023711082,8.714442e-7,0.0002974681,0.01399399,0.00029424403,0.9793653,0.0004591859,0.0038553362],"study_design_scores_gemma":[0.000109908215,0.000023196868,0.0010236371,0.0000063729335,0.000002398152,0.000005971868,0.0007453096,0.00022564176,0.00066939637,0.90528995,0.09183519,0.00006301533],"about_ca_topic_score_codex":0.00003706807,"about_ca_topic_score_gemma":0.0000037019515,"teacher_disagreement_score":0.4626503,"about_ca_system_score_codex":0.000014114313,"about_ca_system_score_gemma":0.000018974883,"threshold_uncertainty_score":0.9954457},"labels":[],"label_agreement":null},{"id":"W4250950228","doi":"10.2139/ssrn.3959937","title":"Cross-Examination","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Medicine","score_opus":0.04535383868891672,"score_gpt":0.39132296489799584,"score_spread":0.3459691262090791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250950228","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.89838994,0.0009277146,0.0772213,0.0018136721,0.00020302396,0.00004165709,0.0000022099143,0.000022704857,0.02137777],"genre_scores_gemma":[0.9469673,0.00023903651,0.00011114867,0.000119424774,0.000188702,0.000002791665,0.0000019872411,0.000006166443,0.052363463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760485,0.0002634139,0.0003501642,0.00022075593,0.0006191598,0.00094163534],"domain_scores_gemma":[0.9986173,0.0003453233,0.0001578934,0.00031195182,0.0005007872,0.00006672942],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008386967,0.00006967277,0.00010739223,0.00009011013,0.0003482118,0.00036380484,0.00045918053,0.000045405148,0.000995138],"category_scores_gemma":[0.001442023,0.000054369935,0.00010160381,0.0006093526,0.00005847051,0.0003047471,0.00004974258,0.0008091398,0.00084474764],"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.000004715507,0.000037841677,0.0018120953,2.0535188e-7,0.00001328869,0.0000028587624,0.00008415204,0.00005635438,0.0014892728,0.80027133,0.00010984082,0.19611801],"study_design_scores_gemma":[0.00019609307,0.00003150826,0.013734481,0.0000017135116,0.000005493258,0.000578642,0.0014345857,0.00007141648,0.001511425,0.96176046,0.020606376,0.00006778339],"about_ca_topic_score_codex":0.0000014771803,"about_ca_topic_score_gemma":0.00008996246,"teacher_disagreement_score":0.19605023,"about_ca_system_score_codex":0.00020798377,"about_ca_system_score_gemma":0.0013215817,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W4253745053","doi":"10.1145/544805.544812","title":"A coalition formation mechanism based on inter-agent trust relationships","year":2002,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Vendor; Mechanism (biology); Computer science; Multi-agent system; Simple (philosophy); Software agent; Distributed computing; Term (time); Artificial intelligence; Business; Marketing","score_opus":0.28146844160746554,"score_gpt":0.35995460080943065,"score_spread":0.07848615920196511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253745053","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.046890702,0.0000028100596,0.79299957,0.005483879,0.000103254344,0.00025668752,0.000013901945,0.00010990732,0.15413928],"genre_scores_gemma":[0.987643,0.000001069362,0.0018446925,0.00089678605,0.000028823248,0.00005442072,0.000011405834,0.000005017189,0.009514799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984629,0.00028066148,0.00039516573,0.00022419878,0.00051626173,0.000120802906],"domain_scores_gemma":[0.99837494,0.000822767,0.00012714216,0.0004913065,0.00010816732,0.00007566298],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001736298,0.00008215241,0.00009181218,0.00021301606,0.00029231477,0.00013884845,0.00027119814,0.000056915593,0.008620275],"category_scores_gemma":[0.0007512227,0.000060262628,0.00007129288,0.00046038782,0.00002933109,0.0003404586,0.000022087688,0.00012376146,0.008350965],"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.0000134004795,0.00015821701,0.00010466943,0.0000015408093,0.000001853682,5.7972807e-7,0.00047786714,0.00058880437,0.0004090615,0.9638711,0.021589544,0.0127833625],"study_design_scores_gemma":[0.00031681827,0.00008354994,0.0007397742,0.000011068957,0.000006838542,0.000003675162,0.0010649356,0.50097346,0.0044319294,0.4649566,0.02728762,0.00012372505],"about_ca_topic_score_codex":0.0000021215828,"about_ca_topic_score_gemma":0.000009306665,"teacher_disagreement_score":0.94075227,"about_ca_system_score_codex":0.000041352807,"about_ca_system_score_gemma":0.000005190982,"threshold_uncertainty_score":0.99242115},"labels":[],"label_agreement":null},{"id":"W4255460808","doi":"10.2139/ssrn.1595511","title":"Persuasive Signalling","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Concordia University; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"","keywords":"Business; Psychology; Computer science","score_opus":0.10995300807662567,"score_gpt":0.3826648521708223,"score_spread":0.27271184409419663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255460808","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.7429339,0.001921879,0.22586457,0.0043540914,0.00029913284,0.00012416989,0.0000020000275,0.000046668127,0.024453534],"genre_scores_gemma":[0.99100435,0.000102265185,0.00021823261,0.00013378618,0.0003009626,0.0000033086187,4.835775e-7,0.000008149298,0.008228469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973113,0.00018745451,0.00033237002,0.0001982523,0.0007825193,0.0011881221],"domain_scores_gemma":[0.99871993,0.0003009622,0.00018613607,0.000223248,0.00038248432,0.00018725103],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010220467,0.0000874633,0.00013593174,0.0001322698,0.00022412492,0.00017462266,0.00073906797,0.000041915093,0.00012755443],"category_scores_gemma":[0.0011638314,0.00006191003,0.00010311745,0.00041992147,0.000061285544,0.00025414448,0.00004514633,0.0009871868,0.001285329],"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.000044079843,0.000041719817,0.0005359061,1.4798763e-7,0.00003172011,0.000002549644,0.00083169626,0.00042195467,0.00069881236,0.936756,0.0011930915,0.059442308],"study_design_scores_gemma":[0.0002708417,0.00012435736,0.000043829783,0.0000019583356,0.000008541043,0.00029333067,0.015708787,0.00020055824,0.00017960697,0.97066265,0.012425278,0.00008028111],"about_ca_topic_score_codex":0.000006077151,"about_ca_topic_score_gemma":0.00006017324,"teacher_disagreement_score":0.24807039,"about_ca_system_score_codex":0.00032107896,"about_ca_system_score_gemma":0.0018970129,"threshold_uncertainty_score":0.9994923},"labels":[],"label_agreement":null},{"id":"W4283396237","doi":"10.1134/s0001434622050091","title":"Winning “Big” in the St. Petersburg Game","year":2022,"lang":"en","type":"article","venue":"Mathematical Notes","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":"University of New Brunswick","funders":"","keywords":"St petersburg; Mathematics; Big game; Mathematical economics; History; Archaeology; Philosophy; Environmental ethics","score_opus":0.18241003907680325,"score_gpt":0.3939894289647474,"score_spread":0.21157938988794417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283396237","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.9473247,0.000033295873,0.019498957,0.012296527,0.000065831904,0.0002974136,0.00001548229,0.000043177686,0.0204246],"genre_scores_gemma":[0.9978245,2.6082657e-7,0.0008116592,0.00076854025,0.000037418755,0.00013082674,0.0000016942014,0.0000058676683,0.000419256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979661,0.0003722518,0.00037813207,0.0002267889,0.00087098364,0.00018573372],"domain_scores_gemma":[0.99154365,0.007743599,0.000074905045,0.0005779728,0.00002316013,0.000036734677],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043894337,0.000077256,0.00015869837,0.000089515015,0.00022284864,0.00013157792,0.0010032648,0.000016640432,0.0038749594],"category_scores_gemma":[0.0029538174,0.000045014633,0.00007340168,0.00070868083,0.0001096601,0.00005699989,0.00023551592,0.00022998602,0.00058230385],"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.000014334516,0.00034871805,0.0006581149,0.0000065524246,0.0000049187365,0.000018459266,0.009661389,0.0007877176,0.0007788534,0.96640956,0.0021664768,0.019144902],"study_design_scores_gemma":[0.00009358218,0.00002902794,0.0009931716,0.000004481046,0.000004069155,0.000026624828,0.0049653547,0.0022430841,0.000079392645,0.97391057,0.017579958,0.000070713104],"about_ca_topic_score_codex":0.0000026095195,"about_ca_topic_score_gemma":0.0000016835493,"teacher_disagreement_score":0.05049976,"about_ca_system_score_codex":0.000014694897,"about_ca_system_score_gemma":0.0000146660495,"threshold_uncertainty_score":0.9970356},"labels":[],"label_agreement":null},{"id":"W4283725615","doi":"10.1016/j.ejor.2022.06.052","title":"Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Initialization; Population; Particle swarm optimization; Algorithm; Metaheuristic; Reservation; Mathematics","score_opus":0.48824208230378274,"score_gpt":0.48426509826174224,"score_spread":0.003976984042040499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283725615","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.08512419,0.00027923673,0.9071785,0.0043853205,0.00016627015,0.00044353958,0.00015915264,0.000006721759,0.0022570388],"genre_scores_gemma":[0.9686518,0.00001463804,0.027712073,0.00033742213,0.0003360039,0.000019358451,0.0000074633144,0.00002010897,0.0029011755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925153,0.0036954074,0.00076065917,0.00022899285,0.002537455,0.00026215945],"domain_scores_gemma":[0.9948338,0.002518378,0.0002706378,0.00032863833,0.0019274262,0.00012111394],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.04635777,0.000080672085,0.00015021501,0.00043523038,0.0025139665,0.00039014535,0.0012899764,0.000006618736,0.0003390226],"category_scores_gemma":[0.0044376347,0.00005317563,0.00016803246,0.0007026098,0.00025218105,0.00029968127,0.000356755,0.0006254679,0.000039285336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024997626,0.00015251522,0.0000190945,0.0000024407645,0.000059307276,0.000054179673,0.0017094052,0.8566182,0.009679321,0.039899975,0.08018717,0.011368388],"study_design_scores_gemma":[0.00037548275,0.00015550695,0.00009245106,0.0000053331933,0.000012328588,0.0002021293,0.0012459914,0.92403096,0.00011055758,0.025328182,0.048378613,0.00006247832],"about_ca_topic_score_codex":0.0000029455448,"about_ca_topic_score_gemma":0.0000011963418,"teacher_disagreement_score":0.8835276,"about_ca_system_score_codex":0.000097598786,"about_ca_system_score_gemma":0.00048067415,"threshold_uncertainty_score":0.9987846},"labels":[],"label_agreement":null},{"id":"W4283828225","doi":"10.18280/mmep.090301","title":"Analysis of a Single Manufacturer Multi-Retailer Inventory Competition Using Supermodular Multi-Objective Games","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Kementerian Pendidikan, Kebudayaan, Riset, dan Teknologi","keywords":"Nash equilibrium; Supply chain; Mathematical optimization; Mathematical economics; Pareto principle; Game theory; Risk dominance; Supply chain management; Computer science; Mathematics; Economics; Best response; Epsilon-equilibrium","score_opus":0.12487498775146452,"score_gpt":0.3042800624741436,"score_spread":0.17940507472267905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283828225","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.4462534,0.000096282616,0.55344343,0.000013964204,0.000020459307,0.000107816166,0.000014454544,0.00002411037,0.000026062937],"genre_scores_gemma":[0.964333,0.000002723251,0.035412878,0.000014896512,0.000007768421,0.00004826124,0.000007928088,0.000016304815,0.00015624236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838907,0.00008756762,0.00052472675,0.0003451189,0.00045752717,0.00019599573],"domain_scores_gemma":[0.99906135,0.0003196035,0.00012366165,0.00033288248,0.000078965764,0.0000835655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011466076,0.00014938418,0.00041841483,0.00044195863,0.00016754078,0.000058429083,0.00023003684,0.00004629874,0.00039979006],"category_scores_gemma":[0.00009014292,0.00012819024,0.00016005716,0.00076888956,0.00006900597,0.00009758744,0.00013023619,0.00017748952,0.000009566495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038436865,0.00019353256,0.00006435844,0.000041023814,0.00012013225,4.50391e-7,0.0019589798,0.9819844,0.009745717,0.0058224197,0.0000010572146,0.00006410854],"study_design_scores_gemma":[0.00016614412,0.00002488316,0.0000648459,0.000024643929,0.00017163539,0.000004404801,0.00038812828,0.98899,0.0008574852,0.009047742,0.000116796095,0.00014326409],"about_ca_topic_score_codex":0.000010826303,"about_ca_topic_score_gemma":7.0892804e-7,"teacher_disagreement_score":0.5180796,"about_ca_system_score_codex":0.000043417807,"about_ca_system_score_gemma":0.000010122803,"threshold_uncertainty_score":0.5227446},"labels":[],"label_agreement":null},{"id":"W4285061361","doi":"10.1090/stml/097/08","title":"Variants of pursuit-evasion games","year":2022,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Pursuit-evasion; Evasion (ethics); Computer science; Biology; Genetics; Artificial intelligence","score_opus":0.0932425407536615,"score_gpt":0.3619899644275166,"score_spread":0.26874742367385507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285061361","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007833463,0.00023473977,0.00048623362,0.0010715575,0.00015751283,0.00055462227,0.00022756633,0.000095427975,0.996389],"genre_scores_gemma":[0.017503362,0.00008565711,0.0017801148,0.00026395018,0.00013058141,0.000065144086,0.0000465265,0.00007538723,0.98004925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951515,0.000116127536,0.0012657258,0.000621827,0.0026255823,0.00021922514],"domain_scores_gemma":[0.995353,0.0024123816,0.0006262981,0.00139618,0.00005287026,0.00015928921],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012744265,0.000310278,0.0008062903,0.00028947936,0.00011515326,0.00017761144,0.0025048314,0.00017313582,0.12106985],"category_scores_gemma":[0.00027461108,0.00022685196,0.00038848148,0.00017078509,0.00026643166,0.0003852102,0.001871245,0.00041401086,0.003121857],"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.000016494081,0.00016805735,0.000018052702,0.000032260275,0.000049708233,0.000012308908,0.00027817127,0.0000023106097,0.000038204256,0.9735567,0.022564419,0.0032633387],"study_design_scores_gemma":[0.00010706967,0.00006802002,0.00013694211,0.00007102864,0.00004524448,0.000008534439,0.00013522182,0.00001127874,0.00004242164,0.76108956,0.23811261,0.00017203284],"about_ca_topic_score_codex":1.460894e-7,"about_ca_topic_score_gemma":6.401515e-8,"teacher_disagreement_score":0.2155482,"about_ca_system_score_codex":0.000014604294,"about_ca_system_score_gemma":0.00008758946,"threshold_uncertainty_score":0.9976543},"labels":[],"label_agreement":null},{"id":"W4285428293","doi":"10.48550/arxiv.2207.05435","title":"Quantum Extensive Form Games","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Saskatchewan","funders":"Office of Science; U.S. Department of Energy","keywords":"Quantum pseudo-telepathy; Computer science; Combinatorial game theory; Quantum; Quantum algorithm; Quantum computer; Theoretical computer science; Mathematics; Mathematical economics; Quantum network; Sequential game; Game theory; Quantum mechanics; Physics","score_opus":0.23723769793995342,"score_gpt":0.2827379152950832,"score_spread":0.04550021735512977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285428293","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.93300676,0.00007652252,0.03438228,0.00042384694,0.0007222632,0.00045093865,0.00017129775,0.00016960723,0.030596493],"genre_scores_gemma":[0.9723112,0.000081247075,0.0000781373,0.00023605608,0.000074113785,0.000005067568,0.000030205965,0.000019485306,0.027164517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972351,0.00033301933,0.00037986165,0.0013821279,0.0003315345,0.00033836145],"domain_scores_gemma":[0.99578947,0.0010294867,0.00049963663,0.0021107637,0.0003799191,0.00019073536],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013304349,0.00028306115,0.00043936717,0.00042263835,0.0004537364,0.00015301765,0.0026518616,0.0001879447,0.0048319083],"category_scores_gemma":[0.00055049185,0.00028092327,0.0004039001,0.0011195942,0.00026722954,0.00022208816,0.0028731823,0.0007727536,0.0012736707],"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.00007514326,0.00011340866,0.0016574905,0.000009041554,0.000054777956,0.00014971897,0.00054403336,0.061211746,0.000041168794,0.92738885,0.0074371053,0.0013175374],"study_design_scores_gemma":[0.00020732569,0.000036959627,0.0026285835,0.000011362206,0.000061086874,0.0000048393485,0.0034613283,0.02390615,0.000041876137,0.9228168,0.046481483,0.00034217566],"about_ca_topic_score_codex":0.00006477014,"about_ca_topic_score_gemma":0.000025972653,"teacher_disagreement_score":0.03930442,"about_ca_system_score_codex":0.00015935587,"about_ca_system_score_gemma":0.00020079626,"threshold_uncertainty_score":0.9999643},"labels":[],"label_agreement":null},{"id":"W4286579116","doi":"10.1109/tsmc.2022.3189215","title":"The Graph Model for Conflict Resolution and Credible Maximin Stability","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Minimax; Stability (learning theory); Conflict resolution; Graph; Action (physics); Set (abstract data type); Time horizon; Mathematical economics; Economics; Horizon; Computer science; Mathematics; Political science; Law; Combinatorics","score_opus":0.13805116351798988,"score_gpt":0.3249546681476231,"score_spread":0.1869035046296332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286579116","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.14332774,0.001646353,0.8491251,0.00047902155,0.0012469519,0.0021844164,0.0006618815,0.000086378095,0.0012421905],"genre_scores_gemma":[0.9892302,0.000093757,0.000060367667,0.00003122062,0.000045562607,0.001456258,0.0000029908608,0.000019695379,0.009059922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701494,0.0005770397,0.00076459185,0.000565136,0.0007765343,0.00030176205],"domain_scores_gemma":[0.99713856,0.0014957258,0.00026060548,0.0007530426,0.00019954715,0.00015251192],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004297714,0.00018918989,0.00031225264,0.00015871566,0.002170082,0.0005040763,0.0004142397,0.00007500996,0.000012629026],"category_scores_gemma":[0.000032354365,0.00013869612,0.00010820394,0.00037290948,0.00025894452,0.00009603407,0.0000099738445,0.0002342535,0.000010092095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076862617,0.00048445136,0.00013894112,0.00022293047,0.00018603614,0.0000021204198,0.008299703,0.7711304,0.0026287576,0.19475837,0.008330639,0.013049011],"study_design_scores_gemma":[0.0006564796,0.00025257585,0.000056692596,0.000021364134,0.000054540884,0.000064279215,0.0130797,0.9219916,0.00015314929,0.007463914,0.055957254,0.0002484782],"about_ca_topic_score_codex":0.00016054547,"about_ca_topic_score_gemma":0.00007106022,"teacher_disagreement_score":0.8490647,"about_ca_system_score_codex":0.00006585351,"about_ca_system_score_gemma":0.00004973483,"threshold_uncertainty_score":0.99912894},"labels":[],"label_agreement":null},{"id":"W4287552350","doi":"10.48550/arxiv.2012.08265","title":"Signaling Games for Log-Concave Distributions: Number of Bins and\\n Properties of Equilibria","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Queen's University","funders":"","keywords":"Mathematics; Gaussian; Countable set; Context (archaeology); Upper and lower bounds; Convergence (economics); Applied mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.2986719326376997,"score_gpt":0.2900127444635379,"score_spread":0.00865918817416178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287552350","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.8882719,0.00006727309,0.10998752,0.0001852421,0.00006483102,0.00040575932,0.0003918182,0.000028453584,0.0005972052],"genre_scores_gemma":[0.99876887,0.00003415351,0.00048075937,0.00001661884,0.000031045514,0.0000039467373,0.000019646937,0.000009197582,0.0006357899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985052,0.0001386227,0.00043875893,0.0006319669,0.000129568,0.00015587945],"domain_scores_gemma":[0.9976952,0.0006423187,0.0005345343,0.00058294606,0.00044714002,0.00009785949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062807935,0.00016772408,0.0004579489,0.00010404808,0.00009089687,0.000040973842,0.0007818593,0.0001506391,0.000101595426],"category_scores_gemma":[0.0007799866,0.00014928503,0.00023329415,0.00047722185,0.0004858247,0.00013965566,0.0007424783,0.00017005515,0.000026528724],"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.00036853823,0.00016389826,0.008416194,0.00027713223,0.00018410981,0.0000050007293,0.0009779994,0.008287076,0.04094075,0.9392707,0.00037728954,0.0007313078],"study_design_scores_gemma":[0.00052456785,0.00006239868,0.00082319224,0.00018183557,0.00019936892,0.0000019008323,0.0020160954,0.029380314,0.04108286,0.92454684,0.0008837474,0.0002969083],"about_ca_topic_score_codex":0.000027742475,"about_ca_topic_score_gemma":0.000005541222,"teacher_disagreement_score":0.11049694,"about_ca_system_score_codex":0.000027906368,"about_ca_system_score_gemma":0.00014567433,"threshold_uncertainty_score":0.6087667},"labels":[],"label_agreement":null},{"id":"W4288056540","doi":"10.1016/j.ejor.2022.07.046","title":"The graph model for composite decision makers and its application to a water resource conflict","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Wilfrid Laurier University","funders":"Major Project of Philosophy and Social Science Research in Colleges and Universities of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Conflict resolution; Conflict analysis; Operations research; Group decision-making; Computer science; Management science; Graph; Fuzzy logic; Resource (disambiguation); Stability (learning theory); Mathematical economics; Economics; Mathematics; Artificial intelligence; Machine learning; Theoretical computer science; Social psychology; Political science; Psychology","score_opus":0.23736606617440686,"score_gpt":0.45916537544461955,"score_spread":0.22179930927021269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288056540","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.7132002,0.00031408123,0.25411698,0.028317405,0.00006528198,0.0009653396,0.00006122273,0.000006938081,0.0029525426],"genre_scores_gemma":[0.9939398,0.000014564338,0.0017430681,0.00049568806,0.000099229444,0.000060503928,0.000005528072,0.000013998248,0.0036275918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99550503,0.0014068373,0.00061720016,0.00024268805,0.001998233,0.0002299939],"domain_scores_gemma":[0.9952581,0.0028444817,0.00010094635,0.0002805994,0.0013354941,0.00018039481],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.031315822,0.000069850226,0.00011232091,0.00030519144,0.0024257572,0.0004267282,0.0010913572,0.000008620433,0.00006297456],"category_scores_gemma":[0.0013165674,0.0000388081,0.00007171244,0.00043556822,0.0000999936,0.00014295786,0.00044529012,0.0003492056,0.00009555238],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031677946,0.0001771621,0.00008063224,0.0000034241712,0.000046215617,0.000014187282,0.0062340326,0.49444553,0.16302931,0.15650705,0.08241804,0.09387661],"study_design_scores_gemma":[0.0007863693,0.00045576505,0.0009259833,0.000008030403,0.0000058679384,0.00010017265,0.0013081928,0.14800663,0.0019233332,0.03615273,0.81021947,0.0001074463],"about_ca_topic_score_codex":3.8323762e-7,"about_ca_topic_score_gemma":9.947772e-7,"teacher_disagreement_score":0.72780144,"about_ca_system_score_codex":0.00004114617,"about_ca_system_score_gemma":0.000078555466,"threshold_uncertainty_score":0.99887294},"labels":[],"label_agreement":null},{"id":"W4288256892","doi":"10.70064/mt.v3i1.966","title":"Rethinking Affordance","year":2019,"lang":"en","type":"preprint","venue":"Media theory.","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Electronic Arts (Canada); University of Alberta","funders":"","keywords":"Affordance; Psychology; Cognitive psychology","score_opus":0.1491932787329114,"score_gpt":0.38567431685398973,"score_spread":0.23648103812107832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288256892","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.5812882,0.0016130022,0.16880468,0.0038194444,0.00957116,0.0013945574,0.00026551666,0.00045315942,0.23279029],"genre_scores_gemma":[0.9835939,0.000040970615,0.0022560274,0.0005822816,0.0005518873,0.00009639807,0.000034145647,0.000033584292,0.01281084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568385,0.0008436649,0.00073047774,0.0010107014,0.0013776876,0.00035363407],"domain_scores_gemma":[0.9883222,0.0078102658,0.00057876954,0.0028825654,0.0002658072,0.00014038381],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011867351,0.00029899154,0.00056650094,0.00024732406,0.0001507423,0.00032999052,0.0031005125,0.00036929472,0.0030556237],"category_scores_gemma":[0.0071357987,0.00022268176,0.00028215692,0.00040407566,0.00030567413,0.00011229627,0.0015370193,0.0010312595,0.008610124],"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.000042775584,0.00003506379,0.0003133718,0.000015692243,0.000021605254,0.000004426602,0.0073630014,0.0008681353,0.00013674154,0.94355637,0.005203583,0.04243926],"study_design_scores_gemma":[0.00010801054,0.000007389475,0.00068292825,0.00006882186,0.00002039457,0.0000033301853,0.00044839765,0.00032585312,0.0006479523,0.9633708,0.034065504,0.0002506193],"about_ca_topic_score_codex":0.0000039741094,"about_ca_topic_score_gemma":0.000010403483,"teacher_disagreement_score":0.40230566,"about_ca_system_score_codex":0.000045909906,"about_ca_system_score_gemma":0.0001859581,"threshold_uncertainty_score":0.9978557},"labels":[],"label_agreement":null},{"id":"W4289732921","doi":"10.2139/ssrn.4174461","title":"Correlated Equilibria and Forecasts based on Naïve Play in Hawk-Dove Games","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Dove; Mathematical economics; Economics; Econometrics; Business; Marketing","score_opus":0.02991557425124468,"score_gpt":0.318938837749126,"score_spread":0.2890232634978813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289732921","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.99053293,0.0004647838,0.0033484967,0.0022404655,0.00016069922,0.00017288463,0.000011837889,0.000019240051,0.003048653],"genre_scores_gemma":[0.9970752,0.000036633744,0.000034462963,0.00031672168,0.000045275705,0.000022964432,0.0000033869337,0.000013224998,0.0024521288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968795,0.00045408658,0.00045027403,0.00033397993,0.00075416325,0.0011279806],"domain_scores_gemma":[0.9984374,0.00089011434,0.0002345833,0.0002908514,0.000053415977,0.00009364014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007090251,0.00013034859,0.00020443021,0.00037685657,0.00039576247,0.00012116594,0.00058611995,0.000043228745,0.0006439026],"category_scores_gemma":[0.00045478798,0.000105396735,0.00008294191,0.0008042622,0.00007293761,0.00015476182,0.00011046496,0.0018823993,0.00006498737],"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.001282604,0.00053244986,0.013536645,0.0000019854992,0.000070025344,0.00004110347,0.0016528231,0.0231669,0.00280829,0.70963335,0.0021107057,0.24516311],"study_design_scores_gemma":[0.0012774522,0.0006645569,0.0031014853,0.000007400641,0.000010388046,0.00037146916,0.0031434193,0.046358436,0.00008053606,0.9390563,0.0057549397,0.00017364555],"about_ca_topic_score_codex":0.000013544901,"about_ca_topic_score_gemma":0.00017153987,"teacher_disagreement_score":0.24498947,"about_ca_system_score_codex":0.0004277649,"about_ca_system_score_gemma":0.0008212672,"threshold_uncertainty_score":0.8178193},"labels":[],"label_agreement":null},{"id":"W4293173224","doi":"10.2139/ssrn.4085705","title":"Data Collection by an Informed Seller","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","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":"Bank of Canada","funders":"","keywords":"Pooling; Private information retrieval; Value (mathematics); Microeconomics; Data collection; Product (mathematics); Business; Consumer information; Information asymmetry; Economics; Marketing; Computer science","score_opus":0.08889502632967547,"score_gpt":0.39099587347026643,"score_spread":0.30210084714059093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293173224","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.9048753,0.0011138609,0.074232064,0.0059445603,0.00063112786,0.0003815805,0.00019194266,0.00009728751,0.012532318],"genre_scores_gemma":[0.9761507,0.00023716722,0.0000857451,0.00027787953,0.00010372496,0.000017313409,0.00007054395,0.0000102535205,0.023046667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970318,0.0003582044,0.0004012833,0.00029396563,0.00091900025,0.0009957382],"domain_scores_gemma":[0.998516,0.00028194382,0.00024305024,0.0007715514,0.00008921793,0.00009819011],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0097284345,0.000085983454,0.00012069001,0.00016136274,0.0014220207,0.00018217207,0.0020993599,0.000025799665,0.0015719162],"category_scores_gemma":[0.00039433182,0.00007071582,0.00004453518,0.0009410811,0.00004287427,0.00068781606,0.0003100647,0.0013819061,0.00014947618],"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.00036962834,0.00063130766,0.0021483921,9.98443e-7,0.00015119524,0.0000024272113,0.0018034816,0.0011852547,0.0030060872,0.38606298,0.36751044,0.23712783],"study_design_scores_gemma":[0.0002954506,0.000243897,0.00009023907,3.7401782e-7,0.000009165733,0.00036785306,0.009246652,0.0022487864,0.000040402174,0.54747754,0.43988675,0.00009286675],"about_ca_topic_score_codex":0.000030020585,"about_ca_topic_score_gemma":0.00060194166,"teacher_disagreement_score":0.23703496,"about_ca_system_score_codex":0.00049250753,"about_ca_system_score_gemma":0.0023277386,"threshold_uncertainty_score":0.999878},"labels":[],"label_agreement":null},{"id":"W4293211198","doi":"10.2139/ssrn.4117687","title":"Internal Disagreement and Disruptive Technologies","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Disruptive technology; Business; Engineering","score_opus":0.031043836031499416,"score_gpt":0.3450705122822495,"score_spread":0.3140266762507501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293211198","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.95564723,0.0022600237,0.030010084,0.00859663,0.00015734839,0.00013885713,0.000011130794,0.00006343521,0.0031152575],"genre_scores_gemma":[0.99490815,0.00034297444,0.000057637964,0.000059895967,0.000033828972,0.00002539296,5.380042e-7,0.0000052469863,0.004566343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978996,0.00015700243,0.00028150645,0.00022482406,0.0006103108,0.00082673633],"domain_scores_gemma":[0.999276,0.00023493463,0.00017841578,0.00022650573,0.000048316306,0.000035817855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004727535,0.00008208265,0.00011841593,0.00015958547,0.00069928006,0.00011536649,0.0007885656,0.000017860804,0.000248095],"category_scores_gemma":[0.0002886205,0.000059178717,0.00006221644,0.00035281797,0.00012907265,0.00013758634,0.00044896067,0.0013488355,0.00004290757],"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.00003813142,0.000047065496,0.0027088998,1.8280815e-7,0.000031243977,0.0000022717727,0.00043718878,0.000040563482,0.0002992221,0.76894873,0.00028458028,0.22716191],"study_design_scores_gemma":[0.00018136052,0.00022897313,0.00066448405,0.0000011539503,0.000007250773,0.00054915354,0.056029826,0.0000764606,0.00007795464,0.92302614,0.019086575,0.00007067829],"about_ca_topic_score_codex":0.000007983504,"about_ca_topic_score_gemma":0.00006413252,"teacher_disagreement_score":0.22709124,"about_ca_system_score_codex":0.00033289948,"about_ca_system_score_gemma":0.00027578266,"threshold_uncertainty_score":0.58600944},"labels":[],"label_agreement":null},{"id":"W4293525104","doi":"10.3390/fi14090257","title":"A Game-Theoretic Rent-Seeking Framework for Improving Multipath TCP Performance","year":2022,"lang":"en","type":"article","venue":"Future Internet","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":"University of Calgary","funders":"","keywords":"Computer science; Multipath TCP; Regret; Mathematical optimization; Multipath propagation; Function (biology); Convergence (economics); Nash equilibrium; Game theory; Kernel (algebra); Distributed computing; Computer network; Machine learning; Mathematical economics","score_opus":0.04708307947113038,"score_gpt":0.34504142610273375,"score_spread":0.29795834663160337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293525104","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.7646941,0.00016171185,0.22946711,0.0011494483,0.0019576917,0.00052326557,0.00008208287,0.000111934874,0.0018526262],"genre_scores_gemma":[0.985983,0.0000026790208,0.007777302,0.000675709,0.0007236716,0.00042062713,0.000016574539,0.000022292992,0.004378119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979754,0.00015558585,0.0004528366,0.00051691744,0.0005944322,0.00030481842],"domain_scores_gemma":[0.9978949,0.0009637005,0.0002799881,0.00067002606,0.00010767391,0.00008372777],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00192261,0.00015141575,0.00020602044,0.00014512624,0.00029290127,0.00016875386,0.001277814,0.00006577172,0.0021991553],"category_scores_gemma":[0.000581096,0.00012198515,0.00015439854,0.0004333074,0.00008477774,0.00013552881,0.00040992303,0.00042803952,0.00019202604],"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.00040008262,0.00017612959,0.003015943,0.00004189048,0.000026783158,0.000004838501,0.012357572,0.0005597982,0.0016944093,0.73199815,0.010391691,0.23933272],"study_design_scores_gemma":[0.00056523096,0.00040951665,0.0017854961,0.00003939684,0.000029466317,0.00004351539,0.0077051744,0.063030995,0.0016992665,0.36725774,0.55701905,0.00041515395],"about_ca_topic_score_codex":0.0000053097842,"about_ca_topic_score_gemma":0.000002942791,"teacher_disagreement_score":0.54662734,"about_ca_system_score_codex":0.000060865706,"about_ca_system_score_gemma":0.000034545472,"threshold_uncertainty_score":0.99871296},"labels":[],"label_agreement":null},{"id":"W4293581464","doi":"10.1016/j.eswa.2022.118692","title":"Impact of external influence on unilateral improvements in the graph model for conflict resolution","year":2022,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"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":"Computer science; Conflict resolution; Graph; Resolution (logic); Artificial intelligence; Theoretical computer science; Political science","score_opus":0.08924453860568086,"score_gpt":0.4029534718254169,"score_spread":0.31370893321973603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293581464","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.6879104,0.0001450895,0.3074703,0.00026637161,0.000028512726,0.0033278875,0.00027700452,0.000026160025,0.00054827955],"genre_scores_gemma":[0.98599017,0.0000027319034,0.00044739957,0.00015329832,0.000031514133,0.012939,0.000016878308,0.000010270921,0.00040871196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796826,0.00019306895,0.0005528561,0.0003654466,0.00071773335,0.00020262052],"domain_scores_gemma":[0.99798244,0.0005197154,0.00035110704,0.0009189579,0.00017784182,0.000049912254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016189216,0.00012410096,0.00019794617,0.00021093068,0.0004485473,0.000071512724,0.0010040647,0.000027894694,0.000015640599],"category_scores_gemma":[0.0000429142,0.00007335739,0.0001002872,0.0008637305,0.000096674084,0.000121604244,0.00005919799,0.00013203376,0.000008812177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030885337,0.0005236625,0.0031751534,0.000006672979,0.000023291233,3.7576714e-7,0.005978929,0.777998,0.019988649,0.18917467,0.001631987,0.0011898092],"study_design_scores_gemma":[0.003718952,0.0020059273,0.049729157,0.00008247139,0.000040158244,0.00006454775,0.009836756,0.81674176,0.00062739383,0.08640197,0.029974198,0.00077671884],"about_ca_topic_score_codex":0.0003122744,"about_ca_topic_score_gemma":0.000011657487,"teacher_disagreement_score":0.3070229,"about_ca_system_score_codex":0.000082776074,"about_ca_system_score_gemma":0.0000931249,"threshold_uncertainty_score":0.34499085},"labels":[],"label_agreement":null},{"id":"W4297879039","doi":"","title":"Asymmetric Warfare","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Statistics Canada","funders":"","keywords":"Parameterized complexity; Sigma; Range (aeronautics); Mathematics; State (computer science); Markov chain; Combinatorics; Discrete mathematics; Algorithm; Physics; Statistics; Engineering; Quantum mechanics","score_opus":0.046678312652302316,"score_gpt":0.30888127572533153,"score_spread":0.2622029630730292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297879039","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.076215565,0.0009837042,0.5437175,0.023063518,0.00048456236,0.0006757786,0.00014413285,0.00041249488,0.35430276],"genre_scores_gemma":[0.9326826,0.00015740842,0.025921257,0.00027960562,0.000062617204,0.00013416815,0.00022851917,0.000051037827,0.040482834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9838676,0.011360596,0.001195976,0.0015424237,0.0015490575,0.0004843734],"domain_scores_gemma":[0.9769671,0.010622522,0.001155772,0.006142909,0.004749912,0.00036177383],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.027582407,0.00043806626,0.00065829797,0.0007056492,0.0006173559,0.0012305237,0.0047923145,0.00044802876,0.00090211787],"category_scores_gemma":[0.018614462,0.00039739604,0.00045277245,0.0017244059,0.0004185566,0.00017002871,0.0029626747,0.0009808217,0.0017741144],"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.000011754693,0.00056899927,0.0016174229,0.000055541394,0.00006509615,0.000003113437,0.0038769033,0.00034633052,0.0005358008,0.6023521,0.021271281,0.36929566],"study_design_scores_gemma":[0.000593338,5.0021106e-7,0.009103713,0.00074017025,0.000077350116,0.00001641393,0.00027507514,0.022105739,0.020548962,0.5414485,0.40412343,0.0009668525],"about_ca_topic_score_codex":0.00028174807,"about_ca_topic_score_gemma":0.00034611826,"teacher_disagreement_score":0.856467,"about_ca_system_score_codex":0.00009635875,"about_ca_system_score_gemma":0.00028764014,"threshold_uncertainty_score":0.99984777},"labels":[],"label_agreement":null},{"id":"W4298858694","doi":"10.48550/arxiv.1011.0253","title":"Polynomial-time Computation of Exact Correlated Equilibrium in Compact\\n Games","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Oracle; Time complexity; Polynomial; Computation; Ellipsoid; Algorithm; Mathematics; Computer science; Product (mathematics); Applied mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.1280234325683176,"score_gpt":0.2711669700400261,"score_spread":0.1431435374717085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298858694","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.98335207,0.000028035454,0.0068435827,0.00012871035,0.00031540883,0.00037082576,0.000067339046,0.000065657856,0.008828377],"genre_scores_gemma":[0.99642843,0.000009624329,0.00009177542,0.000020092368,0.000035182766,4.5908973e-7,0.00003325173,0.000016091451,0.0033650866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976193,0.0003957596,0.00061719905,0.00088178867,0.00022184516,0.00026413807],"domain_scores_gemma":[0.9966657,0.0010729472,0.00079103606,0.0010239438,0.00030066684,0.00014570217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013381122,0.00026083353,0.0006073095,0.0006986023,0.00006163362,0.000082154045,0.0014028619,0.00043064606,0.000525522],"category_scores_gemma":[0.00037539843,0.00026784683,0.00023651478,0.0012111751,0.00038071355,0.00024053929,0.00060891995,0.0008178885,0.0006354383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002898874,0.00037074022,0.011736819,0.000030844258,0.000059583363,0.000044740304,0.0006104811,0.9671767,0.007746443,0.0069925105,0.0036249326,0.0013163298],"study_design_scores_gemma":[0.0012460349,0.00007529757,0.042680714,0.0001692864,0.000098052195,0.000005604711,0.0004959453,0.82250476,0.002093468,0.12885,0.0011536329,0.0006271884],"about_ca_topic_score_codex":0.0001901539,"about_ca_topic_score_gemma":0.000051240797,"teacher_disagreement_score":0.14467192,"about_ca_system_score_codex":0.00007948667,"about_ca_system_score_gemma":0.00020025838,"threshold_uncertainty_score":0.99997735},"labels":[],"label_agreement":null},{"id":"W4299841664","doi":"10.48550/arxiv.1511.04657","title":"Finite Model Approximations and Asymptotic Optimality of Quantized\\n Policies in Decentralized Stochastic Control","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Approximations of π; Asymptotically optimal algorithm; Mathematics; Quantization (signal processing); Optimal control; Mathematical optimization; Gaussian; Stochastic control; Class (philosophy); Applied mathematics; Computer science; Discrete mathematics; Algorithm","score_opus":0.2767138141197961,"score_gpt":0.3011781092560789,"score_spread":0.024464295136282788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299841664","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.5568147,0.000035264962,0.4418818,0.000099713434,0.000031842697,0.00034420867,0.0001550701,0.000023287934,0.0006141363],"genre_scores_gemma":[0.9987323,0.00003111965,0.0007557947,0.000036066696,0.0000089791265,0.000004022533,0.000012979954,0.000010611984,0.00040808358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978129,0.00038302175,0.0005754857,0.000729334,0.00022536881,0.0002738844],"domain_scores_gemma":[0.9965892,0.0013055946,0.0005237479,0.0009604973,0.0004292733,0.00019170741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018468512,0.00023803678,0.0006358082,0.00048741602,0.00009216704,0.00007899495,0.0009245462,0.0002126428,0.000039088853],"category_scores_gemma":[0.0013204026,0.00023286417,0.00014851724,0.00077487994,0.00044692567,0.00020071903,0.0005357535,0.00033395857,0.000030339286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010047954,0.00009312443,0.0019319558,0.000012819182,0.000021113636,0.0000020421617,0.00043604342,0.77539754,0.000028849852,0.22190991,0.000025801415,0.00004035269],"study_design_scores_gemma":[0.0007763026,0.000011273103,0.0017532662,0.000026744103,0.000054516477,6.232198e-7,0.000312574,0.59305614,0.00000612112,0.4038693,0.000004561022,0.00012860457],"about_ca_topic_score_codex":0.00014955793,"about_ca_topic_score_gemma":0.00008748856,"teacher_disagreement_score":0.4419177,"about_ca_system_score_codex":0.00008285437,"about_ca_system_score_gemma":0.00028437466,"threshold_uncertainty_score":0.94959253},"labels":[],"label_agreement":null},{"id":"W43072628","doi":"10.1016/j.geb.2017.10.028","title":"On the optimality of diverse expert panels in persuasion games","year":2017,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"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":"Persuasion; Undo; Diversity (politics); Intuition; Parameterized complexity; Heuristics; Action (physics); Computer science; Microeconomics; Mathematical economics; Psychology; Social psychology; Economics; Political science; Law","score_opus":0.20858108475540685,"score_gpt":0.40601435257659113,"score_spread":0.19743326782118428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43072628","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.9962417,0.00002634145,0.000012815411,0.0011998585,0.00009966798,0.00015713385,0.000030499243,0.0000044928206,0.0022275029],"genre_scores_gemma":[0.99902844,0.000045751618,0.000048676477,0.00007018718,0.000021722206,0.00004359494,5.686325e-7,0.0000034277114,0.0007376491],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99922156,0.000051975298,0.00026991445,0.00025930651,0.000085841195,0.000111412926],"domain_scores_gemma":[0.9986157,0.00034268046,0.00020826414,0.00077412836,0.000016182874,0.000043072123],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001019836,0.00007683929,0.00017316554,0.000045713467,0.00021940652,0.00014348133,0.0005597283,0.0000420881,0.000939039],"category_scores_gemma":[0.00015777376,0.00004740219,0.000063446394,0.000017946057,0.00029303195,0.00016690204,0.00016331894,0.00006898723,0.00013190084],"study_design_candidate":"observational","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.00019157297,0.0004461556,0.33075574,0.0000040125474,0.000014607034,0.0000068830386,0.008694733,0.0001441844,0.0044866507,0.14483528,0.0034285497,0.5069916],"study_design_scores_gemma":[0.00031602045,0.00004678598,0.976288,0.000012956055,0.000008770888,0.0000026981543,0.005182296,0.00028946702,0.0017147466,0.013529482,0.0025014395,0.00010732017],"about_ca_topic_score_codex":0.0002596668,"about_ca_topic_score_gemma":0.00005440109,"teacher_disagreement_score":0.64553225,"about_ca_system_score_codex":0.000016758635,"about_ca_system_score_gemma":0.00001610531,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W4312465470","doi":"10.3982/ecta15847","title":"Learning From Reviews: The Selection Effect and the Speed of Learning","year":2022,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Army Research Office","keywords":"Product (mathematics); Quality (philosophy); Computer science; Selection (genetic algorithm); Learning effect; Rating system; Dynamics (music); Machine learning; Artificial intelligence; Econometrics; Statistics; Psychology; Economics; Mathematics; Microeconomics","score_opus":0.06848698722976547,"score_gpt":0.3349427169976347,"score_spread":0.26645572976786924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312465470","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.98557794,0.0024543712,0.00055664364,0.0012254159,0.00007799288,0.0003643729,0.000002643767,0.00001659877,0.00972401],"genre_scores_gemma":[0.9972124,0.00011677263,0.000028305807,0.00006678273,0.000041064086,0.00004834248,0.0000017982608,0.000003928554,0.0024806021],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974271,0.0017389099,0.0003379495,0.00020738023,0.00020261358,0.00008603782],"domain_scores_gemma":[0.9896344,0.009740794,0.00035917622,0.0002186689,0.000024750554,0.000022212593],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008904551,0.000058434296,0.00022990009,0.00020064409,0.000752085,0.00007906947,0.00041088575,0.000012301659,0.0018155836],"category_scores_gemma":[0.0056196027,0.000029287248,0.00008896973,0.0021152273,0.00012410899,0.00006348472,0.00019229675,0.0003245792,0.000121054225],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027471827,0.00005911213,0.13796848,0.0000068854365,0.000083683306,3.3286025e-7,0.0053696847,0.023996774,0.0006633401,0.020675858,0.004740286,0.80616087],"study_design_scores_gemma":[0.0010278336,0.00037358972,0.04683525,0.000004905835,0.000056431803,0.000007947167,0.004789616,0.018454831,0.00033471614,0.033042092,0.89492816,0.00014461295],"about_ca_topic_score_codex":0.000037288937,"about_ca_topic_score_gemma":0.0000013934658,"teacher_disagreement_score":0.89018786,"about_ca_system_score_codex":0.000017487058,"about_ca_system_score_gemma":0.0000088486595,"threshold_uncertainty_score":0.9990969},"labels":[],"label_agreement":null},{"id":"W4312800695","doi":"10.3982/te4710","title":"Dynamic delegation with a persistent state","year":2022,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Business School, Hebrew University of Jerusalem; Southern Economic Association; University of Arizona; Southern University of Science and Technology; HSBC Bank USA; Johns Hopkins University; Peking University; University of Southern California; Western University; Pennsylvania State University; Cornell University","keywords":"Delegation; Principal (computer security); Babbling; Simple (philosophy); Outcome (game theory); State (computer science); Computer science; Principal–agent problem; Mathematical economics; Mathematics; Economics; Computer security; Algorithm; Finance","score_opus":0.02581102606345348,"score_gpt":0.2920033091771999,"score_spread":0.26619228311374643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312800695","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.97184455,0.000007825698,0.007124057,0.0024478817,0.000054337022,0.00015605676,0.000040627638,0.000030868607,0.018293807],"genre_scores_gemma":[0.9977201,0.0000033511033,0.000727955,0.0004503127,0.00000762306,0.00006327222,0.000009593869,0.000010700406,0.0010070483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988631,0.00016356149,0.00029075882,0.00031193785,0.00019661122,0.00017400699],"domain_scores_gemma":[0.99877375,0.0005286115,0.00010797963,0.0004532099,0.000044411907,0.00009205594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015873462,0.00008167273,0.00014118468,0.000077817545,0.00031032372,0.00009630138,0.0005136515,0.000014027086,0.0051459954],"category_scores_gemma":[0.0000947976,0.00006335725,0.00008051781,0.00020214578,0.00042418193,0.000088904926,0.00017239044,0.00014401239,0.00048565015],"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.00011127475,0.00003950192,0.000056398792,3.3447094e-7,0.000010168409,7.400387e-7,0.00035836667,0.02197296,0.000027478636,0.9689248,0.000037210386,0.008460725],"study_design_scores_gemma":[0.00020775478,0.00015944045,0.0002518391,5.544361e-7,0.000010413818,0.0000250177,0.0014441964,0.07638087,0.00003767688,0.91599166,0.0053861095,0.000104445375],"about_ca_topic_score_codex":0.0000014749008,"about_ca_topic_score_gemma":0.000005104907,"teacher_disagreement_score":0.05440791,"about_ca_system_score_codex":0.000103653605,"about_ca_system_score_gemma":0.000058406364,"threshold_uncertainty_score":0.9957634},"labels":[],"label_agreement":null},{"id":"W4313141472","doi":"10.1007/978-3-031-16455-2_1","title":"Noncooperative Games","year":2022,"lang":"en","type":"book-chapter","venue":"Theory and decision library. Series C, Game theory, mathematical programming and operations research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"HEC Montréal","funders":"","keywords":"Sect; Stackelberg competition; Mathematical economics; Game theory; Computer science; Mathematics; Political science; Law","score_opus":0.11638894841941844,"score_gpt":0.41041290285647875,"score_spread":0.2940239544370603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313141472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117663555,0.006550718,0.047954064,0.0029721274,0.00028389395,0.0043332973,0.0005084809,0.00059631024,0.92503476],"genre_scores_gemma":[0.07055602,0.0019221619,0.0187021,0.0003800537,0.00036696898,0.0008311958,0.00015481428,0.0002455001,0.90684116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99003124,0.0028551894,0.0017880036,0.0017858312,0.0026757645,0.0008639574],"domain_scores_gemma":[0.9732267,0.023385637,0.00020151996,0.0019651123,0.0005399286,0.000681078],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.022539029,0.00076150434,0.0012661899,0.001153899,0.0028118792,0.0033272225,0.0017332544,0.0004958192,0.032271676],"category_scores_gemma":[0.005361787,0.0005465555,0.0002860258,0.00076373736,0.004194529,0.0020803865,0.0025437155,0.0020740647,0.0012872723],"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.00085931504,0.000118476506,7.6516545e-7,0.000035125224,0.00006558859,0.00002499389,0.0020618122,0.00003961353,0.000015918069,0.7699973,0.00080179225,0.22597927],"study_design_scores_gemma":[0.00031366985,0.00050137844,0.0000028589934,0.00015161454,0.000046353507,0.00014093707,0.004038652,0.00023915824,0.00008103946,0.7418329,0.25219056,0.00046089228],"about_ca_topic_score_codex":0.0000013058984,"about_ca_topic_score_gemma":0.0000031568118,"teacher_disagreement_score":0.25138876,"about_ca_system_score_codex":0.000047254805,"about_ca_system_score_gemma":0.00032780896,"threshold_uncertainty_score":0.9996986},"labels":[],"label_agreement":null},{"id":"W4317215089","doi":"10.1007/s11128-022-03806-0","title":"Quantum extensive-form games","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"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 Saskatchewan","funders":"Office of Science; Pacific Institute for the Mathematical Sciences","keywords":"Quantum pseudo-telepathy; Computer science; Quantum computer; Combinatorial game theory; Quantum; Quantum algorithm; Theoretical computer science; Mathematical economics; Sequential game; Quantum network; Mathematics; Game theory; Quantum mechanics; Physics","score_opus":0.09563826890643594,"score_gpt":0.3818490415214261,"score_spread":0.28621077261499017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317215089","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.8834989,0.000092722024,0.07771536,0.004887938,0.0005623207,0.0004597253,0.00004075854,0.0011792659,0.031563014],"genre_scores_gemma":[0.9976823,0.000014632767,0.00025729663,0.0008856895,0.00006430333,0.000055848366,0.00004970031,0.000009798572,0.0009804479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727714,0.000058489233,0.0009913156,0.00022882422,0.0010753565,0.0003688901],"domain_scores_gemma":[0.9976562,0.00044970118,0.0005209053,0.0004846387,0.00076449756,0.00012402044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026889814,0.00016113419,0.00022355076,0.00063630886,0.0006300734,0.00084510277,0.0006564517,0.00008773446,0.00027288366],"category_scores_gemma":[0.0020902043,0.00012329023,0.000090366535,0.0027131885,0.00013526731,0.004422239,0.00012871486,0.0001667306,0.014477059],"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.000038812024,0.00002757752,0.0004540874,0.000055546167,0.000007677064,0.0000021873134,0.010249175,0.0008518945,0.0005500037,0.3414816,0.03200827,0.6142732],"study_design_scores_gemma":[0.0002825807,0.000034025543,0.008291402,0.000045913417,0.000008295889,0.000020078147,0.013694129,0.25173503,0.00074059336,0.5289802,0.1958911,0.00027665767],"about_ca_topic_score_codex":0.000004581021,"about_ca_topic_score_gemma":0.0000010163474,"teacher_disagreement_score":0.6139965,"about_ca_system_score_codex":0.000028936092,"about_ca_system_score_gemma":0.00013577458,"threshold_uncertainty_score":0.9862903},"labels":[],"label_agreement":null},{"id":"W4319239180","doi":"10.1007/978-3-031-24866-5_35","title":"Strategies for Surviving Aggressive Multiparty Repeated Standoffs (Extended Abstract)","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Victory; Adversary; Survivability; Computer science; Demise; Computer security; Commit; Adversarial system; Operations research; Political science; Computer network; Law; Artificial intelligence; Mathematics","score_opus":0.0795282175057332,"score_gpt":0.3603600284949618,"score_spread":0.2808318109892286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319239180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019274725,0.0002793341,0.9824371,0.000506192,0.0011925758,0.0009668817,0.00017672432,0.0001121289,0.012401625],"genre_scores_gemma":[0.9616986,0.000026675954,0.03507485,0.0005209141,0.00036460653,0.000112497146,0.000036203746,0.00004984194,0.0021158364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478513,0.00008068192,0.0009559713,0.0017371336,0.0018632045,0.00057790463],"domain_scores_gemma":[0.99070686,0.0059166322,0.0010982786,0.0015076775,0.00061567314,0.00015489795],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0049415743,0.00043781113,0.0006280035,0.00073046505,0.00081794104,0.0009545387,0.0029691919,0.00020956343,0.0009797154],"category_scores_gemma":[0.0014889105,0.0003464076,0.00022677467,0.0007378026,0.000983523,0.0006135169,0.0007543554,0.0007512795,0.000050099807],"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.00011537434,0.000083301435,0.00004508653,0.00002704541,0.000027732003,0.000077464,0.0026043989,0.10892231,0.0009432281,0.1635912,0.00030554904,0.7232573],"study_design_scores_gemma":[0.0003657141,0.00013108198,0.0002782649,0.00010581243,0.000012259768,0.000029292292,0.00001859354,0.03525825,0.0006263707,0.9444942,0.018161878,0.0005183108],"about_ca_topic_score_codex":0.000026596543,"about_ca_topic_score_gemma":0.00022149445,"teacher_disagreement_score":0.9597711,"about_ca_system_score_codex":0.00020214633,"about_ca_system_score_gemma":0.0008097826,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W4320040851","doi":"10.2139/ssrn.4354768","title":"Existence of Myopic-Farsighted Stable Sets in Matching Markets","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université de Montréal","funders":"Social Sciences and Humanities Research Council of Canada; Fonds de recherche du Québec; Ville de Québec","keywords":"Matching (statistics); Mathematical economics; Stability (learning theory); Economics; Mathematics; Computer science; Statistics","score_opus":0.05521752405107145,"score_gpt":0.3643855929961768,"score_spread":0.30916806894510535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320040851","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.9915973,0.00027904016,0.0030584056,0.0009046474,0.000091364716,0.00009189646,0.000004083361,0.000025498068,0.0039477902],"genre_scores_gemma":[0.99427813,0.00044664645,0.00016824943,0.000034997403,0.00003185786,0.000005757619,0.0000014510073,0.000008860706,0.005024063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969815,0.00028109248,0.0005907941,0.00023195069,0.0006658683,0.0012488202],"domain_scores_gemma":[0.998535,0.0006942575,0.00026471345,0.00032206482,0.000120230914,0.00006373327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010281342,0.00009569935,0.00021684988,0.00039921273,0.00015575634,0.00007089177,0.0007895387,0.000050148177,0.0001664599],"category_scores_gemma":[0.00048164913,0.00007441232,0.0000860954,0.0016777961,0.00005773047,0.00026977243,0.000086182125,0.00084009866,0.00027565574],"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.00012624789,0.0001069978,0.008550024,0.000005928526,0.000041296335,0.000012579119,0.0013231306,0.0005729308,0.0067211096,0.9030842,0.00055248133,0.07890305],"study_design_scores_gemma":[0.00026376348,0.000041706673,0.017709592,0.000018748964,0.0000040212767,0.00006416151,0.0040795,0.0003559552,0.0003805112,0.9758652,0.0011381188,0.000078713376],"about_ca_topic_score_codex":0.000031568532,"about_ca_topic_score_gemma":0.0003180527,"teacher_disagreement_score":0.07882434,"about_ca_system_score_codex":0.00017573297,"about_ca_system_score_gemma":0.00070222665,"threshold_uncertainty_score":0.36498573},"labels":[],"label_agreement":null},{"id":"W4323312451","doi":"10.1007/s43069-023-00202-x","title":"Model Development with Maple in PhD-Level Management Science Courses: A Personal Account","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Maple; Computer science; Presentation (obstetrics); Mathematics education; Mathematics","score_opus":0.4506563412510798,"score_gpt":0.5069861037775598,"score_spread":0.05632976252648003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323312451","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.9394101,0.000014029616,0.022610929,0.0109469965,0.000043156324,0.0011230832,0.00005737515,0.00006657068,0.025727749],"genre_scores_gemma":[0.9514428,0.000011207791,0.010502526,0.000108817876,0.0000115941575,0.0007358146,0.000014689541,0.000010135921,0.037162468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495655,0.00011489421,0.00034884756,0.0006481158,0.0031539758,0.0007776294],"domain_scores_gemma":[0.9982961,0.00024014531,0.000019568552,0.00059230474,0.0006849487,0.00016694187],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010029995,0.000107286076,0.00012613783,0.0015039046,0.0018022786,0.00083397963,0.0012983438,0.000031522617,0.00026019436],"category_scores_gemma":[0.0004184075,0.0000766147,0.000023695904,0.0067976047,0.00066289795,0.0006952267,0.00059255806,0.00024534643,0.0024367012],"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.00010760066,0.00054414355,0.0037992967,0.000014088819,0.000027425083,0.000041516414,0.012123981,0.2179548,0.0045688283,0.67128986,0.028151156,0.061377306],"study_design_scores_gemma":[0.0006490822,0.0000682124,0.017111685,0.00005044261,0.0000024492388,0.0000069010885,0.039964445,0.88870263,0.0013178298,0.024225285,0.02762715,0.00027389353],"about_ca_topic_score_codex":0.000039146493,"about_ca_topic_score_gemma":0.0018931348,"teacher_disagreement_score":0.6707478,"about_ca_system_score_codex":0.00022877408,"about_ca_system_score_gemma":0.0010377701,"threshold_uncertainty_score":0.99949723},"labels":[],"label_agreement":null},{"id":"W4323659940","doi":"10.1016/j.geb.2023.03.003","title":"Targeting in networks under costly agreements","year":2023,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"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":"Agence Nationale de la Recherche; Aix-Marseille Université","keywords":"Principal (computer security); Order (exchange); Payment; Microeconomics; Economics; Unit (ring theory); Mathematical economics; Computer science; Mathematical optimization; Mathematics; Finance","score_opus":0.10627010221989372,"score_gpt":0.3750821985778426,"score_spread":0.2688120963579489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323659940","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.9982814,0.000064520595,0.00025420927,0.0003408323,0.00018375236,0.00014308238,0.000011234596,0.000028634971,0.0006923036],"genre_scores_gemma":[0.9974459,0.000063641026,0.000048339327,0.00011220052,0.000050356903,0.00006471316,0.000008896872,0.000006330896,0.0021996205],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99907744,0.00003775456,0.00033056285,0.00028646796,0.00006661448,0.00020113932],"domain_scores_gemma":[0.999443,0.00020542784,0.0000765543,0.00020423204,0.000009812565,0.000060995084],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010705722,0.00007150979,0.00013728403,0.00011364763,0.00008183069,0.000114084585,0.0002060433,0.00004510858,0.0006054699],"category_scores_gemma":[0.000026649936,0.00006205832,0.000032266384,0.0001661396,0.000053233303,0.00012570307,0.00010828554,0.00007489752,0.0010865921],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020447329,0.00007869092,0.747923,0.0000018813593,0.000009454797,0.000009553129,0.0007122577,0.03127994,0.0004406648,0.013472727,0.02452265,0.18152873],"study_design_scores_gemma":[0.0003958535,0.000017489432,0.95107555,0.0000064354235,0.000010630348,0.0000030656201,0.003071104,0.019683491,0.000025827941,0.015478888,0.010053771,0.00017786292],"about_ca_topic_score_codex":0.00004401595,"about_ca_topic_score_gemma":0.00005668425,"teacher_disagreement_score":0.20315257,"about_ca_system_score_codex":0.000024457915,"about_ca_system_score_gemma":0.000011569548,"threshold_uncertainty_score":0.9996912},"labels":[],"label_agreement":null},{"id":"W4362653177","doi":"10.1109/tcns.2023.3264749","title":"An Algorithm for Resilient Nash Equilibrium Seeking in the Partial Information Setting","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Computer science; Misinformation; Adversarial system; Game theory; Distributed algorithm; Core (optical fiber); Computer security; Theoretical computer science; Mathematical optimization; Algorithm; Mathematical economics; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.04456899424362184,"score_gpt":0.3375276827903865,"score_spread":0.29295868854676466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362653177","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.023796095,0.000022082844,0.9731088,0.0005026027,0.00097021274,0.0012119471,0.00013163654,0.000075375676,0.00018120541],"genre_scores_gemma":[0.9986359,0.000002095065,0.00026881232,0.00014393852,0.00028322704,0.0005717615,0.000008760926,0.000008973881,0.0000765694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719334,0.0005948486,0.0009758177,0.00022954315,0.0006749858,0.00033149152],"domain_scores_gemma":[0.9955702,0.0032853358,0.000336764,0.0005611406,0.00019007492,0.000056505414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070252162,0.00012465073,0.0002837965,0.0002387765,0.0002690202,0.00021385468,0.00056958135,0.000084941625,0.000009224025],"category_scores_gemma":[0.000054309257,0.0000878682,0.00014191569,0.0012202733,0.00005636647,0.0005221986,0.0000012682732,0.00015450953,0.000079855134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000824755,0.000048246104,0.000038206294,0.000009341977,0.000017174707,5.443469e-7,0.0010488529,0.92723703,0.0004525165,0.0010033054,0.0010343224,0.06902797],"study_design_scores_gemma":[0.00083186774,0.00014605773,0.00025005522,0.000051089202,0.000021160276,0.000004216366,0.00245617,0.988833,0.00013006643,0.0015539431,0.00562432,0.00009806275],"about_ca_topic_score_codex":0.000023839211,"about_ca_topic_score_gemma":0.000026079544,"teacher_disagreement_score":0.97483975,"about_ca_system_score_codex":0.00002615399,"about_ca_system_score_gemma":0.000045198405,"threshold_uncertainty_score":0.3583161},"labels":[],"label_agreement":null},{"id":"W4372324534","doi":"10.54691/bcpbm.v44i.4977","title":"Application of Nash Equilibrium: Taking the Game Between Enterprises as an Example","year":2023,"lang":"en","type":"article","venue":"BCP Business & Management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Nash equilibrium; Mathematical economics; Epsilon-equilibrium; Equilibrium selection; Solution concept; Best response; Game theory; Computer science; Symmetric equilibrium; Repeated game; Economics","score_opus":0.16211634655653104,"score_gpt":0.3948567281709751,"score_spread":0.23274038161444408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372324534","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.9768189,0.00002002797,0.01675366,0.0014167891,0.000093049915,0.0006688528,0.000011708736,0.00015497382,0.0040620333],"genre_scores_gemma":[0.99751985,0.000012623037,0.0002633914,0.00010259744,0.00010485536,0.00020442187,0.000039400093,0.000015820457,0.0017370246],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9977933,0.00013295787,0.00051534706,0.00048752571,0.0008330911,0.0002377893],"domain_scores_gemma":[0.9974641,0.00051209255,0.00039438083,0.0013597998,0.00021594418,0.000053677726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021547924,0.00013301536,0.00020675316,0.0002537809,0.00014970006,0.00013336023,0.0014131044,0.000030080697,0.00020981676],"category_scores_gemma":[0.00013654809,0.00009115803,0.000064151245,0.002674382,0.00014475502,0.0002757039,0.0005397446,0.000058110832,0.0011833651],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017459957,0.00007503141,0.0027466842,0.000027069103,0.000033523298,0.0000024500869,0.0005859709,0.0016100848,0.0010063624,0.026862336,0.0010620959,0.96597093],"study_design_scores_gemma":[0.00014220706,0.00000396628,0.7899318,0.000014550418,0.000037036785,8.594261e-7,0.0010686563,0.0005564268,0.0003681919,0.1564006,0.051367514,0.00010822756],"about_ca_topic_score_codex":0.00023599657,"about_ca_topic_score_gemma":0.000014400674,"teacher_disagreement_score":0.9658627,"about_ca_system_score_codex":0.000016180218,"about_ca_system_score_gemma":0.000015271591,"threshold_uncertainty_score":0.99959433},"labels":[],"label_agreement":null},{"id":"W4377203357","doi":"10.2139/ssrn.4448629","title":"Verifiability and Effective Persuasion","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Concordia University; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Persuasion; Computer science; Psychology; Social psychology","score_opus":0.033412328654078706,"score_gpt":0.367098873366922,"score_spread":0.33368654471284326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377203357","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.9926151,0.00019054089,0.004029612,0.0014778227,0.00009129723,0.00013521094,0.000001928614,0.00004295588,0.0014155058],"genre_scores_gemma":[0.99722785,0.00033426247,0.000017516408,0.00003435654,0.00008697949,0.00001116325,6.830618e-7,0.0000057089355,0.0022814733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794066,0.00027702458,0.00021901689,0.0002454617,0.00041529626,0.00090253353],"domain_scores_gemma":[0.9986285,0.0008665831,0.000090076086,0.00023225091,0.00010171808,0.00008089823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010957242,0.00007603438,0.00012563262,0.00014322154,0.00037563572,0.00010940276,0.00030408494,0.00004115784,0.00006278493],"category_scores_gemma":[0.0012318284,0.00005286153,0.0000699407,0.0006936491,0.00010094474,0.0001758754,0.00007169733,0.0007293535,0.00058961945],"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.00007734291,0.000038801325,0.0072065108,0.0000013838114,0.00003094669,0.0000018254715,0.00066218287,0.000051720588,0.0029143773,0.5506215,0.0005073074,0.43788606],"study_design_scores_gemma":[0.00020594706,0.00012699718,0.024096496,0.000002258063,0.00000627512,0.00009152812,0.003611101,0.00023435903,0.00014477284,0.9672731,0.004144889,0.00006226682],"about_ca_topic_score_codex":0.000004892376,"about_ca_topic_score_gemma":0.000031971886,"teacher_disagreement_score":0.4378238,"about_ca_system_score_codex":0.00015448788,"about_ca_system_score_gemma":0.00028964,"threshold_uncertainty_score":0.7578562},"labels":[],"label_agreement":null},{"id":"W4377231893","doi":"10.2139/ssrn.4455735","title":"The Reciprocity Set","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Ottawa","funders":"","keywords":"Reciprocity (cultural anthropology); Set (abstract data type); Computer science; Psychology; Social psychology; Programming language","score_opus":0.15174408036034898,"score_gpt":0.42120896730036467,"score_spread":0.2694648869400157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231893","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.630335,0.012448152,0.19802298,0.12591065,0.009342258,0.0020166081,0.00019279713,0.0006949659,0.021036603],"genre_scores_gemma":[0.9140551,0.0075595607,0.00006644736,0.00012771679,0.0009847593,0.00006419257,0.000007782448,0.000038482216,0.07709597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99440306,0.0006426334,0.000848771,0.00053360185,0.0013536687,0.0022182902],"domain_scores_gemma":[0.995256,0.002260091,0.0007529543,0.0012135803,0.0003981706,0.00011921248],"candidate_categories":["metaresearch","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.032947496,0.00022392685,0.00029951645,0.00016007906,0.001338345,0.00092707115,0.0035220508,0.00021189662,0.000065372755],"category_scores_gemma":[0.0032063348,0.00012691725,0.00037733658,0.00054930197,0.00019128647,0.0000931084,0.0008864273,0.006987295,0.0022425617],"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.000045124103,0.000021930708,0.0003446272,0.0000016824695,0.00015675822,0.0000022742083,0.0003143868,0.0005313699,0.00002608117,0.8715705,0.013513751,0.11347149],"study_design_scores_gemma":[0.0000845146,0.000032720858,0.0004933607,0.000011252876,0.000021073472,0.000086819084,0.0027171236,0.00014366627,0.000017478953,0.93966305,0.05659057,0.0001383765],"about_ca_topic_score_codex":0.000028502795,"about_ca_topic_score_gemma":0.0012482099,"teacher_disagreement_score":0.2837201,"about_ca_system_score_codex":0.00057309936,"about_ca_system_score_gemma":0.0039295442,"threshold_uncertainty_score":0.9999618},"labels":[],"label_agreement":null},{"id":"W4382045382","doi":"10.1016/j.automatica.2023.111142","title":"Robustness of dynamics in games: A contraction mapping decomposition approach","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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; University of Alberta","funders":"Air Force Office of Scientific Research; University of Illinois at Urbana-Champaign; National Science Foundation","keywords":"Cournot competition; Mathematics; Contraction (grammar); Nash equilibrium; Fixed point; Mathematical economics; Dynamics (music); Mathematical optimization; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.08281243963399137,"score_gpt":0.3842369678540809,"score_spread":0.3014245282200895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382045382","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.7736613,0.000004064915,0.21800645,0.00047248616,0.000059879458,0.00019759474,0.000006455352,0.000103999795,0.0074877553],"genre_scores_gemma":[0.99357903,0.0000022494596,0.006087697,0.000016540684,0.0000147596875,0.000055878405,0.000021065935,0.000005633715,0.00021712927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998622,0.00014573788,0.000513711,0.00020360896,0.00037235825,0.00014255896],"domain_scores_gemma":[0.99836946,0.0009954257,0.00018413435,0.0003388479,0.00007859115,0.000033550266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001848085,0.000066587476,0.00019636049,0.0003624447,0.000057222816,0.000058125603,0.00028061616,0.00005410085,0.000058373476],"category_scores_gemma":[0.00047038854,0.000056157896,0.000050741266,0.0016892974,0.00006559635,0.00022317124,0.00004447782,0.000078522105,0.0001476271],"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.0000663545,0.0009729917,0.006413088,0.00017310659,0.000057839257,0.000009277445,0.005068824,0.28471166,0.0087306155,0.46938765,0.0031518657,0.22125673],"study_design_scores_gemma":[0.00015602197,0.000008539525,0.031171164,0.000023703915,0.0000037843572,0.000005327991,0.004686767,0.92929566,0.00011543547,0.034407366,0.00006781703,0.000058417703],"about_ca_topic_score_codex":0.000007785142,"about_ca_topic_score_gemma":0.000013032305,"teacher_disagreement_score":0.644584,"about_ca_system_score_codex":0.000050683324,"about_ca_system_score_gemma":0.000024019555,"threshold_uncertainty_score":0.22900525},"labels":[],"label_agreement":null},{"id":"W4382204418","doi":"10.1109/phm58589.2023.00046","title":"An efficient algorithm for task allocation with multi-agent collaboration constraints","year":2023,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Task (project management); Mathematical optimization; Constraint (computer-aided design); Nash equilibrium; Function (biology); Greedy algorithm; Game theory; Algorithm; Task analysis; Mathematics","score_opus":0.09092074280888283,"score_gpt":0.411757806660983,"score_spread":0.32083706385210015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382204418","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.1214217,0.000002314252,0.87616074,0.0008192378,0.00008971932,0.00070129265,0.00009256921,0.00015073991,0.0005616817],"genre_scores_gemma":[0.94257355,9.636248e-7,0.054685593,0.00014886683,0.000037354206,0.0002507531,0.00008921798,0.00000863925,0.0022050864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861836,0.00008396254,0.00028668065,0.00038309305,0.00045791527,0.00016996184],"domain_scores_gemma":[0.99837816,0.00043603318,0.000106411506,0.00041887013,0.0005583469,0.000102190366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017512249,0.000087337154,0.00011017734,0.0001515177,0.00024786816,0.00019069569,0.0002895118,0.000040379953,0.00017039143],"category_scores_gemma":[0.0002063368,0.000058709353,0.000028155835,0.0013121045,0.00014408487,0.00013628259,0.000018733446,0.000032747277,0.00074034923],"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.000049053262,0.00055145175,0.00022401835,0.0000041794265,0.000026474865,0.0000022191762,0.0034664625,0.070913315,0.01907129,0.083423935,0.0059390003,0.8163286],"study_design_scores_gemma":[0.0007770902,0.00016108646,0.002156172,0.000004321585,0.000011864147,0.0000027061826,0.010943984,0.96822774,0.0055846325,0.0047122124,0.0072594113,0.00015875399],"about_ca_topic_score_codex":0.000003887549,"about_ca_topic_score_gemma":0.000037617247,"teacher_disagreement_score":0.8973144,"about_ca_system_score_codex":0.000023006081,"about_ca_system_score_gemma":0.0000940493,"threshold_uncertainty_score":0.9515939},"labels":[],"label_agreement":null},{"id":"W4382245061","doi":"10.11647/obp.0362.16","title":"Extensive games","year":2023,"lang":"en","type":"book-chapter","venue":"Open Book Publishers","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":"University of Toronto","funders":"","keywords":"Outcome (game theory); Business; Competitor analysis; Market economy; Industrial organization; Economics; Microeconomics; Marketing","score_opus":0.19964406446434155,"score_gpt":0.39392066361058553,"score_spread":0.19427659914624398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382245061","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050668154,0.00018884645,0.000100932564,0.0065775877,0.0007038743,0.0008970215,0.00010536975,0.00013816326,0.9912831],"genre_scores_gemma":[0.00014625644,0.00004385824,0.00018822381,0.0032620083,0.00021371318,0.00010503817,0.00007683643,0.00009996536,0.9958641],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960338,0.00007666475,0.00083994743,0.0012518525,0.0014284794,0.00036929533],"domain_scores_gemma":[0.99451125,0.0014869131,0.0006293383,0.0022588463,0.0008222736,0.0002914018],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003010548,0.0003885434,0.0007061174,0.00043792676,0.00029707258,0.007398902,0.005508955,0.00038093142,0.029273655],"category_scores_gemma":[0.0016379652,0.00031238986,0.0002999266,0.00025762492,0.00038414806,0.003159252,0.0017761495,0.00054274395,0.039524823],"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.000008508996,0.000004408686,0.0000010034606,0.0000010175579,0.000027051452,0.000012655025,0.00006866105,0.0000052852706,0.0000028640063,0.40816724,0.5739937,0.01770763],"study_design_scores_gemma":[0.00009547973,0.000015326472,0.000019704054,0.000028070821,0.000017436258,0.0000042636425,0.00019719961,0.0000038596168,0.000005236619,0.43796644,0.56143284,0.00021411871],"about_ca_topic_score_codex":0.000030378791,"about_ca_topic_score_gemma":0.000049157126,"teacher_disagreement_score":0.029799212,"about_ca_system_score_codex":0.00006786338,"about_ca_system_score_gemma":0.00037027648,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4382245167","doi":"10.11647/obp.0361.16","title":"Extensive games","year":2023,"lang":"en","type":"book-chapter","venue":"Open Book Publishers","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":"University of Toronto","funders":"","keywords":"Outcome (game theory); Business; Competitor analysis; Market economy; Economics; Microeconomics; Industrial organization; Marketing","score_opus":0.19964406446434155,"score_gpt":0.39392066361058553,"score_spread":0.19427659914624398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382245167","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050668154,0.00018884645,0.000100932564,0.0065775877,0.0007038743,0.0008970215,0.00010536975,0.00013816326,0.9912831],"genre_scores_gemma":[0.00014625644,0.00004385824,0.00018822381,0.0032620083,0.00021371318,0.00010503817,0.00007683643,0.00009996536,0.9958641],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960338,0.00007666475,0.00083994743,0.0012518525,0.0014284794,0.00036929533],"domain_scores_gemma":[0.99451125,0.0014869131,0.0006293383,0.0022588463,0.0008222736,0.0002914018],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003010548,0.0003885434,0.0007061174,0.00043792676,0.00029707258,0.007398902,0.005508955,0.00038093142,0.029273655],"category_scores_gemma":[0.0016379652,0.00031238986,0.0002999266,0.00025762492,0.00038414806,0.003159252,0.0017761495,0.00054274395,0.039524823],"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.000008508996,0.000004408686,0.0000010034606,0.0000010175579,0.000027051452,0.000012655025,0.00006866105,0.0000052852706,0.0000028640063,0.40816724,0.5739937,0.01770763],"study_design_scores_gemma":[0.00009547973,0.000015326472,0.000019704054,0.000028070821,0.000017436258,0.0000042636425,0.00019719961,0.0000038596168,0.000005236619,0.43796644,0.56143284,0.00021411871],"about_ca_topic_score_codex":0.000030378791,"about_ca_topic_score_gemma":0.000049157126,"teacher_disagreement_score":0.029799212,"about_ca_system_score_codex":0.00006786338,"about_ca_system_score_gemma":0.00037027648,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4382936253","doi":"10.23919/acc55779.2023.10155917","title":"Estimation of Unknown Payoff Parameters in Large Network Games","year":2023,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic game; Identifiability; Estimator; Convexity; Convergence (economics); Computer science; Mathematical optimization; Network formation; Smoothness; Quadratic equation; Applied mathematics; Mathematics; Mathematical economics; Machine learning; Statistics","score_opus":0.09630537348210276,"score_gpt":0.4009005497975782,"score_spread":0.30459517631547545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382936253","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.96767515,0.000011518514,0.021367494,0.0007668876,0.0000761355,0.00012832897,0.000005034742,0.000060044847,0.009909416],"genre_scores_gemma":[0.9939284,0.0000045637976,0.0024874955,0.00009868519,0.000010980263,0.00002017448,0.0000056848426,0.0000032986738,0.0034407729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884963,0.000105573556,0.0003736858,0.00018287291,0.0003150621,0.00017315698],"domain_scores_gemma":[0.9981228,0.0013800203,0.000091431866,0.00033371974,0.000038466296,0.000033530963],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026356855,0.000051115316,0.00013579485,0.00014806139,0.00004216228,0.00003122532,0.00028588966,0.000033113458,0.00030655751],"category_scores_gemma":[0.00079477957,0.00003620013,0.000044807693,0.001982856,0.000047908998,0.000111981564,0.00006630452,0.000048935708,0.0010482806],"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.00001797516,0.000075249525,0.013516398,0.000003630223,0.00000618684,0.0000016871094,0.00067277974,0.31279194,0.00013041573,0.5123652,0.025606854,0.13481164],"study_design_scores_gemma":[0.00021189754,0.00002122936,0.06633563,0.000012553133,0.0000031912548,5.6872324e-7,0.0006355351,0.19193208,0.0010604016,0.7314588,0.00824305,0.00008507499],"about_ca_topic_score_codex":0.00000964626,"about_ca_topic_score_gemma":0.000055891036,"teacher_disagreement_score":0.21909353,"about_ca_system_score_codex":0.0000057769976,"about_ca_system_score_gemma":0.000015683425,"threshold_uncertainty_score":0.9997295},"labels":[],"label_agreement":null},{"id":"W4382998691","doi":"10.1109/lcsys.2023.3292049","title":"Equilibration of Coordinating Imitation and Best-Response Dynamics","year":2023,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Action (physics); Sequence (biology); Context (archaeology); Imitation; Function (biology); Graph; Computer science; Best response; Mathematics; Combinatorics; Mathematical economics; Evolutionary biology; Theoretical computer science; Biology; Psychology; Physics; Social psychology; Game theory; Genetics","score_opus":0.06108743319354955,"score_gpt":0.3438782383773778,"score_spread":0.28279080518382826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382998691","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.905085,0.000020948353,0.089118436,0.0048144604,0.00027726303,0.00046504117,0.00004648041,0.00005473196,0.000117581476],"genre_scores_gemma":[0.9991684,7.463679e-7,0.00003778273,0.0001746064,0.000061828236,0.00010831513,0.0000045503834,0.000009211615,0.0004345613],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796516,0.0005948429,0.0005632681,0.00025032298,0.00047095004,0.00015548416],"domain_scores_gemma":[0.9952048,0.003941716,0.00033846087,0.00031429535,0.0001485879,0.00005211972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039488915,0.00008980071,0.00023766095,0.0002661201,0.000114459406,0.0001486039,0.00023740166,0.000047218902,0.000004586411],"category_scores_gemma":[0.001286772,0.00007574216,0.000050752384,0.00062858907,0.00009844418,0.0002641196,0.00001905604,0.000060486043,0.00012910791],"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.00025365254,0.00002549652,0.0034371456,0.000024715642,0.000029148909,0.0000046419254,0.0008532114,0.0444958,0.9289427,0.012574499,0.0032949913,0.0060640266],"study_design_scores_gemma":[0.0015295023,0.00012901152,0.012112451,0.000081461076,0.00003277938,0.000012804081,0.003367702,0.97716427,0.0010315655,0.0035549435,0.00075993035,0.00022355639],"about_ca_topic_score_codex":0.000023351455,"about_ca_topic_score_gemma":0.000006928912,"teacher_disagreement_score":0.9326685,"about_ca_system_score_codex":0.000028242614,"about_ca_system_score_gemma":0.000019003437,"threshold_uncertainty_score":0.30886757},"labels":[],"label_agreement":null},{"id":"W4383105304","doi":"10.1016/j.jet.2023.105690","title":"Derandomization of persuasion mechanisms","year":2023,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Game Theory and Applications","field":"Decision Sciences","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":"York University","funders":"York University; University of Michigan","keywords":"Persuasion; Mechanism (biology); Communication source; Set (abstract data type); Computer science; Microeconomics; Mathematical economics; Psychology; Economics; Social psychology; Epistemology; Computer network","score_opus":0.08928588245972705,"score_gpt":0.3867462718643636,"score_spread":0.2974603894046366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383105304","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.92021775,0.00004329744,0.07472616,0.00050596416,0.00047555228,0.000071661685,0.0000070322712,0.000010193002,0.0039423727],"genre_scores_gemma":[0.9980445,0.000030010102,0.0005132125,0.000044554174,0.00008341667,0.0000012071866,6.1932104e-7,0.0000057738625,0.0012767429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986594,0.00025152523,0.00074074086,0.00009481235,0.00017176497,0.00008179126],"domain_scores_gemma":[0.9969799,0.0018685469,0.000771221,0.00020961625,0.00011799363,0.000052738967],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008633948,0.000053658587,0.00024592134,0.00032760954,0.000058376427,0.000032346987,0.0004153232,0.0000371574,0.0010062457],"category_scores_gemma":[0.0008648893,0.00003814039,0.00016899827,0.00018772692,0.000055657172,0.00021775985,0.000042550713,0.00006959479,0.00049578905],"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.00031580857,0.00002170011,0.000087509,0.0000016033367,0.000024864787,0.0000014884463,0.0005969721,0.0058592805,0.011151741,0.962996,0.0019233336,0.01701969],"study_design_scores_gemma":[0.0007817877,0.000045208133,0.0004992862,0.000008520696,0.00001302967,0.00001804006,0.0018336301,0.0008248589,0.007620012,0.98719794,0.0011184958,0.000039205624],"about_ca_topic_score_codex":4.118261e-7,"about_ca_topic_score_gemma":6.7640684e-7,"teacher_disagreement_score":0.07782669,"about_ca_system_score_codex":0.000025011894,"about_ca_system_score_gemma":0.000064858075,"threshold_uncertainty_score":0.99990696},"labels":[],"label_agreement":null},{"id":"W4384027103","doi":"10.7151/dmgt.2503","title":"Fractional eternal domination: securely distributing resources across a network","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Dawson College; Université de Montréal; University of Victoria","funders":"Fonds de recherche du Québec – Nature et technologies; Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics","score_opus":0.07314322653004089,"score_gpt":0.3988477076159836,"score_spread":0.3257044810859427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384027103","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.8786584,0.000093512404,0.10648935,0.003599142,0.0005257005,0.00046243425,0.00019390874,0.0005368736,0.009440667],"genre_scores_gemma":[0.9915487,0.000008560338,0.0007335963,0.0001422875,0.0003643478,0.00016288688,0.000043354874,0.000030206267,0.006966024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564165,0.00068594766,0.00096303114,0.0006355584,0.0014343037,0.0006395145],"domain_scores_gemma":[0.99233615,0.0058085974,0.0005117614,0.0009298517,0.00020909426,0.00020456506],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010988262,0.00026754808,0.00041169886,0.00020623425,0.0014149776,0.0004234878,0.00112692,0.00013110565,0.0014505947],"category_scores_gemma":[0.0030189762,0.0001561516,0.0003631098,0.002689008,0.00043348747,0.00036085153,0.00042577754,0.00030181534,0.003205859],"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.00010072054,0.00011039454,0.0009944636,0.000017003185,0.000043711905,0.0000097939355,0.0053257705,0.0005541992,0.0002503345,0.97349167,0.007729797,0.011372138],"study_design_scores_gemma":[0.00025346418,0.000018203076,0.014040807,0.00008602057,0.000019635405,0.000026378539,0.009053195,0.0009035708,0.000118527525,0.96462286,0.010627816,0.00022953609],"about_ca_topic_score_codex":9.169518e-7,"about_ca_topic_score_gemma":0.0000029970258,"teacher_disagreement_score":0.112890325,"about_ca_system_score_codex":0.000020693922,"about_ca_system_score_gemma":0.000025369909,"threshold_uncertainty_score":0.999885},"labels":[],"label_agreement":null},{"id":"W4385128256","doi":"10.1016/j.automatica.2023.111180","title":"Signaling games in multiple dimensions: Geometric properties of equilibrium solutions","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Nash equilibrium; Independent and identically distributed random variables; Mathematical optimization; Gaussian; Scalar (mathematics); Signaling game; Mathematics; Generalization; Mathematical economics; Game theory; Distortion (music); Computer science; Applied mathematics; Random variable; Mathematical analysis; Statistics","score_opus":0.22453505193948228,"score_gpt":0.35496557311833554,"score_spread":0.13043052117885326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385128256","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.9965006,0.00018084857,0.0010529638,0.0010977741,0.000053979446,0.00023163977,0.000008250419,0.00016739639,0.0007065087],"genre_scores_gemma":[0.9979226,0.000005619287,0.0013763008,0.000031866028,0.000011199571,0.00007133767,0.0000021226465,0.000008265819,0.00057066267],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981601,0.00016341408,0.00064656755,0.00024314728,0.00052086863,0.0002658655],"domain_scores_gemma":[0.99731374,0.0018622649,0.00014472251,0.00049929327,0.00012481229,0.000055166252],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023354942,0.00008382836,0.00023586028,0.0008754805,0.000120549965,0.000047871807,0.00044843688,0.000044687597,0.000089372865],"category_scores_gemma":[0.006087903,0.000061761355,0.000075758326,0.0046703047,0.0001784431,0.00019465003,0.00021890408,0.000076932934,0.000997772],"study_design_candidate":"bench_or_experimental","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.000037958584,0.0007160487,0.008390541,0.000092221504,0.000052378273,0.00001007225,0.0064804656,0.018638305,0.84840095,0.06973843,0.007761327,0.03968129],"study_design_scores_gemma":[0.0010114817,0.00009138614,0.067717664,0.00029802337,0.000027318625,0.000008338935,0.010115571,0.45744795,0.14741619,0.3125352,0.002871553,0.00045934407],"about_ca_topic_score_codex":0.000033001656,"about_ca_topic_score_gemma":0.000009624541,"teacher_disagreement_score":0.7009848,"about_ca_system_score_codex":0.000012198288,"about_ca_system_score_gemma":0.00008240538,"threshold_uncertainty_score":0.99978006},"labels":[],"label_agreement":null},{"id":"W4385364043","doi":"10.2139/ssrn.4518248","title":"Private Signals and Fast Product Adoption Under Incomplete Information","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Business; Product (mathematics); Private information retrieval; Computer science; Computer security; Mathematics","score_opus":0.04872784675753235,"score_gpt":0.334652189400914,"score_spread":0.2859243426433817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385364043","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.90665114,0.00019025178,0.088300675,0.0036365557,0.000104973544,0.00019372538,0.0000064551696,0.000070322014,0.00084589754],"genre_scores_gemma":[0.99778384,0.00046671627,0.000078287514,0.00013902539,0.0001237067,0.000009124231,0.000009229063,0.0000059418867,0.00138414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781805,0.00014642216,0.00044745946,0.00016388335,0.0005600337,0.0008641412],"domain_scores_gemma":[0.9990731,0.0002022691,0.0002592478,0.0002266122,0.0001662944,0.0000724933],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006745993,0.00009508972,0.00012795553,0.0003206014,0.0003788207,0.00029002276,0.0003439238,0.000033696222,0.00006774039],"category_scores_gemma":[0.00037016827,0.00007051395,0.000050180817,0.0009206599,0.00006656021,0.0009677898,0.000078658704,0.00060047896,0.0010177916],"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.0000365436,0.00001701912,0.00089903397,0.0000024402007,0.000032551638,3.5715095e-7,0.00046446276,0.0017337708,0.0032728137,0.80008537,0.00077536,0.19268027],"study_design_scores_gemma":[0.00022142238,0.000069868984,0.010915653,0.000005564491,0.000007951375,0.00012579886,0.0025961453,0.000778854,0.00018636414,0.97148937,0.013507689,0.000095308744],"about_ca_topic_score_codex":0.0000039948195,"about_ca_topic_score_gemma":0.000027789023,"teacher_disagreement_score":0.19258496,"about_ca_system_score_codex":0.00012079047,"about_ca_system_score_gemma":0.00033386206,"threshold_uncertainty_score":0.99976003},"labels":[],"label_agreement":null},{"id":"W4385449962","doi":"10.2139/ssrn.4527310","title":"Valuing influence","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of British Columbia","funders":"","keywords":"Business","score_opus":0.054827238475544215,"score_gpt":0.38737743910087696,"score_spread":0.33255020062533275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385449962","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.9856629,0.00017640108,0.008422415,0.0022410324,0.000103861814,0.00005470325,0.0000011089177,0.000077730125,0.0032598556],"genre_scores_gemma":[0.9885784,0.00032968938,0.000035918856,0.00012371241,0.00013562075,0.000005284335,5.295411e-7,0.000007930637,0.010782947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694175,0.00014600767,0.00034898316,0.00020437888,0.00069946656,0.0016594323],"domain_scores_gemma":[0.99875695,0.00053279195,0.0001471003,0.00030994037,0.00016220509,0.000091035574],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012525995,0.000076838965,0.00011416234,0.0002415291,0.00039195735,0.00017963733,0.00084512884,0.00003608808,0.00010877656],"category_scores_gemma":[0.0015081038,0.000056254634,0.0000928585,0.001430057,0.000058575646,0.00029421377,0.00007433391,0.0009241443,0.004924395],"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.000009613775,0.000012645265,0.002475777,3.1428837e-7,0.000017602579,0.00000268108,0.00023956732,0.0014142917,0.002954337,0.91520715,0.00081590546,0.07685011],"study_design_scores_gemma":[0.0001107814,0.000037402173,0.0060553523,0.0000032162982,0.0000044441767,0.00014195069,0.0021480408,0.00024844115,0.00012895986,0.979706,0.011345711,0.0000696838],"about_ca_topic_score_codex":0.0000048678253,"about_ca_topic_score_gemma":0.00004723832,"teacher_disagreement_score":0.07678043,"about_ca_system_score_codex":0.00015559998,"about_ca_system_score_gemma":0.0008257944,"threshold_uncertainty_score":0.9958504},"labels":[],"label_agreement":null},{"id":"W4386398401","doi":"10.1007/978-3-031-43254-5_12","title":"Diversity-Seeking Jump Games in Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"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":"Nash equilibrium; Jump; Computer science; Mathematical economics; Best response; Fraction (chemistry); Type (biology); Diversity (politics); Symmetric game; Game theory; Node (physics); Normal-form game; Repeated game; Mathematical optimization; Mathematics; Sociology","score_opus":0.07781634396175041,"score_gpt":0.3243671318265744,"score_spread":0.24655078786482398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386398401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013581457,0.00011792607,0.9908291,0.0006634151,0.0011950826,0.00026125362,0.000005267762,0.000088572655,0.0054812324],"genre_scores_gemma":[0.9890929,0.000031597796,0.0059836935,0.0009421359,0.00041610998,0.0000058240107,0.000003087188,0.000025657973,0.0034990322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959693,0.00006980284,0.00060102466,0.0013582408,0.0014757941,0.0005258449],"domain_scores_gemma":[0.99502766,0.0032549507,0.00027742263,0.0011294432,0.00018677289,0.00012373958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004118064,0.00030972017,0.000476782,0.0013374854,0.0006753009,0.0003482412,0.0034669805,0.0002768013,0.0001134804],"category_scores_gemma":[0.00058560446,0.00025932107,0.00013116316,0.0018382883,0.0009003124,0.00028711048,0.0043268586,0.0008382662,0.00034369028],"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.000011167688,0.000021787338,0.0026709887,0.000005619703,0.000005655566,0.00008475105,0.0021838653,0.32567936,0.000025643087,0.038328264,0.00012878461,0.6308541],"study_design_scores_gemma":[0.000114536364,0.00002758975,0.0028576166,0.00015222467,0.0000041222956,0.000007985417,0.0000018264944,0.20242052,0.000027827346,0.79246247,0.00160786,0.00031542234],"about_ca_topic_score_codex":0.000029505936,"about_ca_topic_score_gemma":0.00036475304,"teacher_disagreement_score":0.98773474,"about_ca_system_score_codex":0.00013443355,"about_ca_system_score_gemma":0.000142791,"threshold_uncertainty_score":0.9999859},"labels":[],"label_agreement":null},{"id":"W4386526862","doi":"10.1016/j.jeconom.2023.105502","title":"Econometric inference on a large Bayesian game with heterogeneous beliefs","year":2023,"lang":"en","type":"article","venue":"Journal of Econometrics","topic":"Game Theory and Applications","field":"Decision Sciences","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 British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Hindsight bias; Regret; Inference; Econometrics; Bayesian inference; Bayesian probability; Mathematical economics; Economics; Computer science; Mathematics; Statistics; Psychology; Artificial intelligence; Cognitive psychology","score_opus":0.28817473566225865,"score_gpt":0.3716775319212516,"score_spread":0.08350279625899293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386526862","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.97740227,0.0001527525,0.013709173,0.0009253178,0.0002846799,0.00012704631,0.00005313465,0.000027474489,0.007318154],"genre_scores_gemma":[0.9980045,0.000120967175,0.00032619716,0.00030363657,0.00015118388,0.0000052426435,0.0000017816541,0.0000147074215,0.0010717964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775225,0.000091425274,0.0009728602,0.0002859217,0.000568642,0.00032890023],"domain_scores_gemma":[0.9942682,0.0036202876,0.00097576366,0.000516222,0.00034451066,0.00027504726],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0038297765,0.00014805607,0.00042832023,0.006094164,0.00012086693,0.0002813871,0.0009840624,0.00006950181,0.000990424],"category_scores_gemma":[0.0038531732,0.00010197271,0.00018360242,0.011168396,0.000058944268,0.00036975252,0.00009139134,0.00026931582,0.0016780455],"study_design_candidate":"observational","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.0006997597,0.00244719,0.2587864,0.000044591347,0.0006506901,0.00064857135,0.0028880476,0.20418063,0.00009785523,0.15862161,0.021340927,0.3495937],"study_design_scores_gemma":[0.004616278,0.0059508197,0.2900525,0.00010425528,0.00010645083,0.00064101507,0.0019701254,0.014949819,0.0012519049,0.3235113,0.3555867,0.0012588374],"about_ca_topic_score_codex":7.9653176e-7,"about_ca_topic_score_gemma":0.000005029916,"teacher_disagreement_score":0.34833488,"about_ca_system_score_codex":0.00008123978,"about_ca_system_score_gemma":0.00011548598,"threshold_uncertainty_score":0.9999228},"labels":[],"label_agreement":null},{"id":"W4386647620","doi":"10.2139/ssrn.4569599","title":"The Reciprocity Set","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Ottawa","funders":"","keywords":"Reciprocity (cultural anthropology); Set (abstract data type); Mathematical economics; Mathematics; Computer science; Psychology; Social psychology; Programming language","score_opus":0.15174408036034898,"score_gpt":0.42120896730036467,"score_spread":0.2694648869400157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386647620","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.630335,0.012448152,0.19802298,0.12591065,0.009342258,0.0020166081,0.00019279713,0.0006949659,0.021036603],"genre_scores_gemma":[0.9140551,0.0075595607,0.00006644736,0.00012771679,0.0009847593,0.00006419257,0.000007782448,0.000038482216,0.07709597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99440306,0.0006426334,0.000848771,0.00053360185,0.0013536687,0.0022182902],"domain_scores_gemma":[0.995256,0.002260091,0.0007529543,0.0012135803,0.0003981706,0.00011921248],"candidate_categories":["metaresearch","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.032947496,0.00022392685,0.00029951645,0.00016007906,0.001338345,0.00092707115,0.0035220508,0.00021189662,0.000065372755],"category_scores_gemma":[0.0032063348,0.00012691725,0.00037733658,0.00054930197,0.00019128647,0.0000931084,0.0008864273,0.006987295,0.0022425617],"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.000045124103,0.000021930708,0.0003446272,0.0000016824695,0.00015675822,0.0000022742083,0.0003143868,0.0005313699,0.00002608117,0.8715705,0.013513751,0.11347149],"study_design_scores_gemma":[0.0000845146,0.000032720858,0.0004933607,0.000011252876,0.000021073472,0.000086819084,0.0027171236,0.00014366627,0.000017478953,0.93966305,0.05659057,0.0001383765],"about_ca_topic_score_codex":0.000028502795,"about_ca_topic_score_gemma":0.0012482099,"teacher_disagreement_score":0.2837201,"about_ca_system_score_codex":0.00057309936,"about_ca_system_score_gemma":0.0039295442,"threshold_uncertainty_score":0.9999618},"labels":[],"label_agreement":null},{"id":"W4387686983","doi":"10.4230/lipics.stacs.2024.28","title":"One n Remains to Settle the Tree Conjecture","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Nash equilibrium; Discrete mathematics; Spanning tree; Tree (set theory); Mathematical economics","score_opus":0.37339575131627767,"score_gpt":0.28869630950408015,"score_spread":0.08469944181219752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387686983","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.85582787,0.000020659172,0.106965296,0.011960571,0.0007061456,0.0009602985,0.00028189903,0.0003380424,0.022939226],"genre_scores_gemma":[0.9482793,0.000018616161,0.00011550601,0.00048345324,0.00014798381,0.000003870876,0.000015146273,0.000020261714,0.05091582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772215,0.00034021746,0.00028145325,0.0010842382,0.0002751341,0.0002968307],"domain_scores_gemma":[0.99552226,0.0015302248,0.00023084471,0.0023183925,0.00020612658,0.000192127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016686391,0.00021742108,0.0003257886,0.00028525002,0.00035329533,0.00018548653,0.0028497907,0.00022757203,0.00040115003],"category_scores_gemma":[0.0007534044,0.00017180368,0.00025387947,0.0016727437,0.00021054297,0.000077762255,0.0018178369,0.0005889515,0.006716123],"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.000075721924,0.00010272526,0.0015467921,0.00001152766,0.00011300615,0.00006648415,0.0011630027,0.22922046,0.00018444646,0.72478026,0.04017302,0.002562535],"study_design_scores_gemma":[0.00017668516,0.00003096223,0.010794565,0.000034995628,0.00007869205,0.0000015436857,0.0011061366,0.0045570163,0.00015353566,0.953992,0.028770497,0.00030335228],"about_ca_topic_score_codex":0.0000555091,"about_ca_topic_score_gemma":0.0006953616,"teacher_disagreement_score":0.22921175,"about_ca_system_score_codex":0.0000822398,"about_ca_system_score_gemma":0.00013061671,"threshold_uncertainty_score":0.99405724},"labels":[],"label_agreement":null},{"id":"W4387879403","doi":"10.1287/isre.2021.0463","title":"Join Up or Stay Away? Coalition Formation for Critical IT Infrastructure","year":2023,"lang":"en","type":"article","venue":"Information Systems Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Interoperability; Government (linguistics); Subsidy; Critical infrastructure; Business; Economies of scale; Investment (military); Public economics; Economics; Microeconomics; Computer security; Computer science; Politics; Political science; Market economy","score_opus":0.459459398977152,"score_gpt":0.5675053012524482,"score_spread":0.10804590227529626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387879403","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.1093609,0.00003972405,0.81384814,0.017315885,0.0028889584,0.0072329934,0.0020667787,0.00079919316,0.04644742],"genre_scores_gemma":[0.9905899,0.000012227626,0.00032298284,0.00016797846,0.000218885,0.001076979,0.0003230905,0.000010552598,0.0072773974],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946113,0.0006021514,0.001328971,0.00022478026,0.0026747966,0.0005579655],"domain_scores_gemma":[0.98932016,0.006683404,0.00021126543,0.0006429342,0.0029500574,0.00019217841],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015579695,0.00012726709,0.00023944472,0.0012443993,0.00088601233,0.001449205,0.00071088015,0.00017933272,0.00038649168],"category_scores_gemma":[0.015672091,0.0000888865,0.00008573794,0.002860891,0.00018433703,0.0039116344,0.0001599309,0.00028844876,0.00767731],"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.00021282052,0.000013208747,0.000053214764,0.00021811192,0.000008958514,7.490711e-7,0.00625057,0.0013535123,0.0002889664,0.3142288,0.6603322,0.017038919],"study_design_scores_gemma":[0.00051402877,0.00011149163,0.0006312216,0.000059328147,0.0000032275634,0.000025360514,0.04613079,0.07391134,0.000516128,0.053609148,0.82434434,0.0001436176],"about_ca_topic_score_codex":0.000018239773,"about_ca_topic_score_gemma":0.000008931721,"teacher_disagreement_score":0.881229,"about_ca_system_score_codex":0.0001443583,"about_ca_system_score_gemma":0.00022833887,"threshold_uncertainty_score":0.99958736},"labels":[],"label_agreement":null},{"id":"W4389331594","doi":"10.2139/ssrn.4655155","title":"Approximate Nash Equilibria Algorithms for Weighted Congestion Games and Their Runtimes","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Windsor","funders":"","keywords":"Nash equilibrium; Computer science; Algorithm; Best response; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.08867629441425895,"score_gpt":0.36871517634997214,"score_spread":0.2800388819357132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389331594","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.39440838,0.006593151,0.58550197,0.009202752,0.0014381114,0.001664687,0.0002976176,0.0003150139,0.00057831226],"genre_scores_gemma":[0.97412074,0.005438081,0.0023681861,0.00010894261,0.0011301988,0.00029951925,0.0000874277,0.00010560127,0.01634131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956585,0.00032185842,0.0008884084,0.000824807,0.00051309325,0.0017933095],"domain_scores_gemma":[0.9963849,0.0015439725,0.00079362217,0.0006689549,0.00045122587,0.00015732388],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.011859453,0.00038560483,0.00062076293,0.00041288708,0.0004715331,0.0007533584,0.001253608,0.00031601952,0.000045374534],"category_scores_gemma":[0.0008082784,0.00026841988,0.00032987088,0.00037777648,0.0002132182,0.00022380083,0.0005807891,0.002320683,0.00009249921],"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.0002129967,0.00011895487,0.00031604513,0.00003944092,0.0005885149,0.0000019224874,0.0010058427,0.0002658644,0.0014916469,0.6268567,0.0029270395,0.36617506],"study_design_scores_gemma":[0.00044229263,0.00012434188,0.00023292069,0.000053921314,0.000056852914,0.00009805915,0.0021986337,0.016473182,0.00026680663,0.9770874,0.002673732,0.00029190056],"about_ca_topic_score_codex":0.000013345622,"about_ca_topic_score_gemma":0.000077788274,"teacher_disagreement_score":0.58313376,"about_ca_system_score_codex":0.00025794888,"about_ca_system_score_gemma":0.0015729249,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W4390788573","doi":"10.2139/ssrn.4693028","title":"Verifiability and Effective Persuasion","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Concordia University; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Persuasion; Voting; Context (archaeology); Contrast (vision); Computer science; Microeconomics; Social psychology; Psychology; Economics; Political science; Artificial intelligence; Law; Politics","score_opus":0.03041755132329453,"score_gpt":0.371443063173087,"score_spread":0.34102551184979246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390788573","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.97833914,0.0066583515,0.007232576,0.0026274621,0.00069914915,0.00048417045,0.000020357102,0.00005626038,0.0038825595],"genre_scores_gemma":[0.9955444,0.0011602144,0.00006648502,0.000038330447,0.00035653118,0.00004367796,0.000002387457,0.000019331705,0.002768646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625105,0.0005531779,0.0005158536,0.000747946,0.0007431286,0.0011888462],"domain_scores_gemma":[0.9978998,0.0008654078,0.00026077943,0.00062053325,0.00022011582,0.00013341811],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.015047003,0.00024356556,0.0003697788,0.00024745686,0.00029120513,0.00055670284,0.00078659476,0.00022994442,0.00009651814],"category_scores_gemma":[0.0011665433,0.00017018493,0.00026229108,0.0003042989,0.00019157304,0.00008452104,0.0010290341,0.0063434686,0.00038473192],"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.00009136215,0.00006696876,0.00049474405,0.0000234952,0.00015811171,0.000003845763,0.0008529427,0.00012065692,0.00039843257,0.64403677,0.00038391046,0.35336876],"study_design_scores_gemma":[0.00012831521,0.000120051074,0.0010214471,0.000039136296,0.00006080954,0.00021100322,0.0017787821,0.00032600213,0.000075953416,0.99322796,0.0028425774,0.00016793437],"about_ca_topic_score_codex":0.000018541728,"about_ca_topic_score_gemma":0.00007690198,"teacher_disagreement_score":0.35320082,"about_ca_system_score_codex":0.00070270227,"about_ca_system_score_gemma":0.001823464,"threshold_uncertainty_score":0.9959489},"labels":[],"label_agreement":null},{"id":"W4391258576","doi":"10.37236/11909","title":"Power of $k$ Choices in the Semi-Random Graph Process","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Random graph; Process (computing); Power (physics); Discrete mathematics; Computer science","score_opus":0.02386316884284069,"score_gpt":0.35460698811547936,"score_spread":0.3307438192726387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391258576","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.9766289,0.010170493,0.0044816663,0.0037245979,0.0003108357,0.00017181558,0.0000015078116,0.000008046026,0.004502162],"genre_scores_gemma":[0.99928194,0.00028798752,8.282387e-7,0.00007692615,0.00004153753,0.0000057608627,1.199233e-7,0.000006690016,0.00029822454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748015,0.00040028448,0.000678058,0.00011710557,0.0010482722,0.0002761553],"domain_scores_gemma":[0.9960047,0.0029724368,0.0003552856,0.0003579642,0.00027991788,0.000029665747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010221757,0.000096003525,0.00023996475,0.00023123018,0.00009447906,0.00012799798,0.0017846695,0.000041231964,0.00005744737],"category_scores_gemma":[0.0005783518,0.000041732044,0.0001683756,0.0021916628,0.0001334664,0.00022585201,0.000029991977,0.0007137438,0.000016943954],"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.00006376919,0.0001161138,0.00026007663,0.0000065916433,0.0000337742,0.0000039970228,0.0032110997,0.00024157188,0.00019406651,0.9945233,0.00073040795,0.0006152185],"study_design_scores_gemma":[0.00035909828,0.00019324853,0.00051827723,0.000031508745,0.000025514923,0.00009953875,0.0020294548,0.00010250105,0.0007762842,0.9845578,0.011257644,0.000049139828],"about_ca_topic_score_codex":0.0000019459155,"about_ca_topic_score_gemma":0.0000045108927,"teacher_disagreement_score":0.022653049,"about_ca_system_score_codex":0.000041753032,"about_ca_system_score_gemma":0.00034820812,"threshold_uncertainty_score":0.35426775},"labels":[],"label_agreement":null},{"id":"W4391748201","doi":"10.1007/978-3-031-17299-1_3306","title":"Zero-Order Relationships","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of British Columbia","funders":"","keywords":"Zero (linguistics); Zero order; Order (exchange); Mathematics; Business; First order; Philosophy; Applied mathematics; Linguistics","score_opus":0.36881950889067194,"score_gpt":0.3965512878929388,"score_spread":0.027731779002266865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391748201","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011560142,0.0000235174,0.011897725,0.0016862836,0.00022876936,0.0001866553,0.000041578878,0.00023016897,0.98569375],"genre_scores_gemma":[0.0035557067,0.000018164774,0.000862153,0.00019206807,0.0001048618,0.0000167033,0.000027418053,0.0000385543,0.99518436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978415,0.00004976404,0.00057888724,0.00051787973,0.0008681906,0.00014380597],"domain_scores_gemma":[0.995252,0.0030040657,0.00021993472,0.001099658,0.00032237804,0.0001019507],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022240793,0.00018060979,0.000256105,0.00030874772,0.00027167035,0.00014270825,0.00073769334,0.00028883055,0.012946628],"category_scores_gemma":[0.0013322167,0.00013241611,0.0001499268,0.00022654289,0.00013598795,0.00008930696,0.00016830048,0.00045543053,0.14824113],"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.0000014680169,0.0000025046847,0.000009720404,5.4071694e-7,0.000008047335,0.0000013772695,0.000034460598,0.00001805503,0.0000022582738,0.88664967,0.10827998,0.004991928],"study_design_scores_gemma":[0.000023333092,0.0000036241136,0.00006695965,0.000005745734,0.000007811989,0.0000014334466,0.000023821673,0.000019945777,0.0000021960807,0.5569575,0.44279674,0.00009087388],"about_ca_topic_score_codex":0.000002064405,"about_ca_topic_score_gemma":0.00003226163,"teacher_disagreement_score":0.33451676,"about_ca_system_score_codex":0.000015477342,"about_ca_system_score_gemma":0.00006420258,"threshold_uncertainty_score":0.9879557},"labels":[],"label_agreement":null},{"id":"W4392035834","doi":"10.1007/s13235-024-00553-y","title":"Preface: Special issue of Dynamic Games and Applications in Memory of Professor Ngo Van Long","year":2024,"lang":"en","type":"article","venue":"Dynamic Games and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Mathematical economics; Computer science; Operations research; Economics; Mathematics","score_opus":0.018874803988020133,"score_gpt":0.3554827328491104,"score_spread":0.33660792886109026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392035834","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.8705422,0.005563719,0.09690913,0.0037746034,0.00015912991,0.0048045916,0.00092642097,0.00017874021,0.017141448],"genre_scores_gemma":[0.9899909,0.0004779764,0.0008162616,0.000032874053,0.00014977017,0.0011211163,0.00005764145,0.000025762334,0.0073277126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975917,0.00010062098,0.0009277126,0.00075176364,0.0003715615,0.00025665844],"domain_scores_gemma":[0.9976445,0.00095150736,0.00027612786,0.0008484686,0.00015754775,0.00012187418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090069114,0.00022915767,0.0004567609,0.00044273175,0.00015228118,0.00010730874,0.0005581493,0.00013534195,0.0002692643],"category_scores_gemma":[0.00008217846,0.00019219848,0.00010198787,0.0013992738,0.0006315557,0.00021103311,0.00020513381,0.00023982112,0.000069020105],"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.000025266556,0.00042974218,0.0026624114,0.00035270173,0.00006120748,0.0000012292195,0.0029072452,0.00021049421,0.005881076,0.22563122,0.0007164279,0.761121],"study_design_scores_gemma":[0.0009417412,0.00013965768,0.12783468,0.00029660988,0.00022118722,0.000041412393,0.013791925,0.029567886,0.0012485661,0.62254596,0.2025036,0.00086676545],"about_ca_topic_score_codex":0.000022264103,"about_ca_topic_score_gemma":0.00022040527,"teacher_disagreement_score":0.7602542,"about_ca_system_score_codex":0.000036621772,"about_ca_system_score_gemma":0.000093435054,"threshold_uncertainty_score":0.78376263},"labels":[],"label_agreement":null},{"id":"W4392490384","doi":"10.48550/arxiv.2403.01012","title":"Hilbert Space-Valued LQ Mean Field Games: An Infinite-Dimensional Analysis","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Linear-quadratic-Gaussian control; Hilbert space; Mathematics; Space (punctuation); Field (mathematics); Mathematical analysis; Computer science; Mathematical optimization; Optimal control; Pure mathematics","score_opus":0.15760617862221693,"score_gpt":0.28787853562446264,"score_spread":0.1302723570022457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392490384","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.9577299,0.000077883386,0.02440419,0.0008159933,0.00043480314,0.0002930049,0.00013155442,0.00022270305,0.015889993],"genre_scores_gemma":[0.98036444,0.000019159577,0.00041617546,0.00037815113,0.00012641608,0.0000025831953,0.00005912051,0.000023559835,0.018610386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618864,0.0005002118,0.00052075926,0.0019579944,0.00045882005,0.00037357697],"domain_scores_gemma":[0.99482906,0.0014366022,0.0003667415,0.0025799249,0.00041125054,0.00037643543],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017368403,0.00040846455,0.00068704714,0.0014466998,0.0002522795,0.00034833944,0.0020209905,0.00059389975,0.0029321879],"category_scores_gemma":[0.0004640836,0.00037849048,0.0008101955,0.0038404055,0.00023210271,0.00022110624,0.0020662574,0.0012972025,0.0021901198],"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.00013605828,0.00022514204,0.0033628868,0.000021241376,0.0010058498,0.0002020527,0.0008658265,0.38553387,0.00010345742,0.60289043,0.0048185647,0.0008346187],"study_design_scores_gemma":[0.000216044,0.00007065355,0.0013143831,0.000041230327,0.0014795667,0.000002687058,0.0007906329,0.2394122,0.00022652629,0.75133204,0.0045418395,0.00057219836],"about_ca_topic_score_codex":0.00032020456,"about_ca_topic_score_gemma":0.00055319373,"teacher_disagreement_score":0.1484416,"about_ca_system_score_codex":0.00010757551,"about_ca_system_score_gemma":0.0002442882,"threshold_uncertainty_score":0.9998667},"labels":[],"label_agreement":null},{"id":"W4392551615","doi":"10.2139/ssrn.4736843","title":"Reputational Algorithm Aversion","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Download; Computer science; World Wide Web","score_opus":0.03270319476895112,"score_gpt":0.3658318648779404,"score_spread":0.3331286701089893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392551615","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.075850405,0.004419142,0.90177906,0.0070302663,0.00079052505,0.00011047375,0.000012064037,0.000111009125,0.009897066],"genre_scores_gemma":[0.9685049,0.0004410264,0.0010357945,0.00011732452,0.00046760362,0.000004288306,0.000003724036,0.000011137222,0.029414222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976609,0.00012252766,0.0003336274,0.00025937214,0.00076338276,0.0008602067],"domain_scores_gemma":[0.99901456,0.0005109728,0.0000732511,0.0001883572,0.00013718278,0.00007565302],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006622339,0.00008236337,0.00009714309,0.00022530765,0.00028444504,0.0003636272,0.00044860816,0.000043961845,0.0005281155],"category_scores_gemma":[0.00027139529,0.00005813,0.00013861759,0.0006350817,0.00005391907,0.00036801337,0.00003972159,0.001032168,0.002449932],"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.000004415322,0.000012098191,0.000015310292,3.2194234e-7,0.000020806789,0.0000040879086,0.000089752575,0.000081372586,0.00011977735,0.6026584,0.0017860341,0.39520764],"study_design_scores_gemma":[0.000079596306,0.00005197542,0.000082525075,0.000006600499,0.000009538185,0.00068631116,0.0012205681,0.004044997,0.00008690688,0.91278094,0.08088376,0.00006630321],"about_ca_topic_score_codex":0.0000030832227,"about_ca_topic_score_gemma":0.000011344434,"teacher_disagreement_score":0.90074325,"about_ca_system_score_codex":0.00029349237,"about_ca_system_score_gemma":0.001371558,"threshold_uncertainty_score":0.9983268},"labels":[],"label_agreement":null},{"id":"W4392939974","doi":"10.2139/ssrn.4727167","title":"On Three-Layer Data Markets","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Business; Layer (electronics); Materials science; Nanotechnology","score_opus":0.11695435696400737,"score_gpt":0.40862520559788523,"score_spread":0.2916708486338779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392939974","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.51319194,0.01163032,0.36655408,0.0234419,0.0017936518,0.00036982325,0.00008827271,0.0002453413,0.08268464],"genre_scores_gemma":[0.9851227,0.00036883506,0.00006820671,0.00018306078,0.00034447413,0.0000033623883,0.0000048000393,0.000014567096,0.013890038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711883,0.00015378745,0.0003546244,0.00043980885,0.0007842235,0.0011487525],"domain_scores_gemma":[0.9976551,0.0011049325,0.00007630353,0.0010078915,0.00006567639,0.000090081754],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.012043651,0.00011356861,0.0001303337,0.00019957608,0.0002500443,0.0005043443,0.0019712187,0.000049634873,0.000999905],"category_scores_gemma":[0.00074541254,0.00007370871,0.00008503308,0.0005902376,0.00005584816,0.00042137376,0.0001736768,0.0015421227,0.0037612393],"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.000025463785,0.000022754577,0.000039802624,4.981128e-7,0.00003478221,0.0000046505756,0.000022074513,0.000012987931,0.000121961944,0.778026,0.008151743,0.2135373],"study_design_scores_gemma":[0.00008597481,0.00006389804,0.00028450787,0.000012483118,0.0000141720875,0.00029294455,0.00020949218,0.002066052,0.000029528277,0.8989828,0.09787577,0.0000823659],"about_ca_topic_score_codex":0.0000034914167,"about_ca_topic_score_gemma":0.00019572335,"teacher_disagreement_score":0.47193068,"about_ca_system_score_codex":0.00017430865,"about_ca_system_score_gemma":0.0011672816,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W4393130843","doi":"10.2139/ssrn.4770744","title":"Multidimensional Signaling with a Resource Constraint","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Constraint (computer-aided design); Resource (disambiguation); Resource constraints; Computer science; Business; Mathematics; Distributed computing; Computer network","score_opus":0.0413910171736717,"score_gpt":0.3403226338194915,"score_spread":0.2989316166458198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393130843","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.8894227,0.0068956837,0.08096958,0.009076305,0.0005275955,0.00063930434,0.00006451449,0.00018875362,0.012215519],"genre_scores_gemma":[0.98969936,0.00012687682,0.001494865,0.00017308656,0.0005381081,0.000028757897,0.000009673232,0.000045476507,0.007883813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424106,0.00041228122,0.00088803156,0.0008556233,0.0016577318,0.0019452537],"domain_scores_gemma":[0.99713296,0.0009765345,0.0005660979,0.00073026755,0.0003857048,0.00020843923],"candidate_categories":["research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012489021,0.00037135874,0.00048417068,0.0004383758,0.00039041994,0.0005453424,0.0012006243,0.00024081243,0.0003332773],"category_scores_gemma":[0.00044908508,0.00023892234,0.00034742133,0.00049378676,0.00031377806,0.00006739705,0.0007516308,0.00893252,0.00078448304],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014328012,0.00007891136,0.00006483473,0.000009809221,0.00036010245,0.00004093001,0.00053738157,0.008606636,0.0010086157,0.95147043,0.00085060456,0.036828443],"study_design_scores_gemma":[0.00026935895,0.00013059808,0.000016584976,0.00017564339,0.00010104642,0.0014388225,0.0047904425,0.00081266806,0.00023844586,0.9797796,0.011940589,0.00030618708],"about_ca_topic_score_codex":0.000013469336,"about_ca_topic_score_gemma":0.00009953044,"teacher_disagreement_score":0.100276604,"about_ca_system_score_codex":0.00061735726,"about_ca_system_score_gemma":0.007096745,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W4393159963","doi":"10.1609/aaai.v38i11.29143","title":"A Sequentially Fair Mechanism for Multiple Sensitive Attributes","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Mechanism (biology); Computer science; Epistemology; Philosophy","score_opus":0.26281526326130256,"score_gpt":0.4008321003431169,"score_spread":0.13801683708181434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159963","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.5527638,0.00003845293,0.3970127,0.02823253,0.001668772,0.0025975972,0.00043847342,0.00034950196,0.016898155],"genre_scores_gemma":[0.996564,0.000008488872,0.0014326947,0.00020456025,0.000121478995,0.0001076131,0.0000015636509,0.000015855714,0.0015437761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976296,0.00002701563,0.0007084086,0.00063077925,0.00070457155,0.0002996393],"domain_scores_gemma":[0.99613434,0.0014634873,0.00026066348,0.00027887657,0.001777558,0.00008507932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018849258,0.00019783442,0.0002754914,0.00017736798,0.0002824855,0.0005630064,0.0012492075,0.0000960382,0.00019633489],"category_scores_gemma":[0.0042240624,0.00012835287,0.00025902287,0.0008903245,0.0003301839,0.0002968631,0.00020560702,0.00021824778,0.00040898216],"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.000062224855,0.000041882337,0.00000885135,0.000015129845,0.000014588927,2.3299745e-7,0.00072711194,0.000019149822,0.17086253,0.80605775,0.0004827374,0.021707805],"study_design_scores_gemma":[0.000009452055,0.000060712107,0.000011110573,0.00007455314,0.00001349922,0.0000023927482,0.0012206447,0.029404636,0.45265797,0.51603246,0.0004292244,0.000083350096],"about_ca_topic_score_codex":0.000016806576,"about_ca_topic_score_gemma":0.000022503627,"teacher_disagreement_score":0.44380015,"about_ca_system_score_codex":0.000035158722,"about_ca_system_score_gemma":0.00011799969,"threshold_uncertainty_score":0.5429083},"labels":[],"label_agreement":null},{"id":"W4394999785","doi":"","title":"Game-theoretical analysis of network formation and drug pricing","year":2020,"lang":"fr","type":"dissertation","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Concordia University","keywords":"Drug; Computer science; Medicine; Pharmacology","score_opus":0.017579244990285153,"score_gpt":0.279277618815045,"score_spread":0.2616983738247598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394999785","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.5281429,0.0020632956,0.39730012,0.012473423,0.00021629204,0.00072419515,0.00012560732,0.00011319526,0.05884092],"genre_scores_gemma":[0.97312117,0.0006579009,0.017582154,0.00012489075,0.000029435756,0.00004966178,0.0012875985,0.000035655605,0.0071115643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9875704,0.008342384,0.0016180227,0.0009796039,0.0010385824,0.00045101647],"domain_scores_gemma":[0.9836517,0.009777445,0.0015171707,0.0015975075,0.003099302,0.0003568602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.012675157,0.00041788688,0.000976206,0.000563167,0.0006115829,0.00048113655,0.0014140197,0.00030509237,0.0008648531],"category_scores_gemma":[0.004891574,0.00041736892,0.00047578628,0.0046716947,0.00091733027,0.00042308698,0.0003904532,0.0005397475,0.00010704302],"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.00003850481,0.00020759332,0.0019121951,0.000112252994,0.0002910619,0.0000011992174,0.038802918,0.0005981885,0.0016375444,0.8959633,0.00020870799,0.060226537],"study_design_scores_gemma":[0.000958519,0.0000026336252,0.023573438,0.0026960024,0.0035697625,0.000011593207,0.009110961,0.6490795,0.061355215,0.22581267,0.022651069,0.0011786224],"about_ca_topic_score_codex":0.00027160204,"about_ca_topic_score_gemma":0.001651697,"teacher_disagreement_score":0.67015064,"about_ca_system_score_codex":0.00006850205,"about_ca_system_score_gemma":0.00020611944,"threshold_uncertainty_score":0.9998278},"labels":[],"label_agreement":null},{"id":"W4395072518","doi":"10.2139/ssrn.4793549","title":"Managing Information Production in Teams","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Production (economics); Business; Process management; Knowledge management; Computer science; Economics","score_opus":0.019400642002293668,"score_gpt":0.33107959628641154,"score_spread":0.31167895428411785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395072518","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.86239856,0.0022312864,0.09235205,0.023692805,0.0011390799,0.00028035516,0.0000015513563,0.00012033296,0.017783977],"genre_scores_gemma":[0.9960639,0.00049081625,0.000039672286,0.000050945324,0.00017379274,0.00000736904,0.0000011973326,0.000004045383,0.003168292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830514,0.00008532893,0.0003818095,0.00013536017,0.00041050962,0.000681829],"domain_scores_gemma":[0.99956715,0.0000998166,0.00007378692,0.00016408878,0.00006522307,0.0000299341],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008010109,0.00006183586,0.000075455784,0.00044967793,0.00012339377,0.00035549098,0.0002931543,0.00002846018,0.000058896218],"category_scores_gemma":[0.00037244245,0.0000453659,0.000050503233,0.00092646,0.000025941867,0.0014023965,0.000024116373,0.0009536102,0.00090374803],"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.000007279443,0.000007621471,0.00017037142,0.0000014000871,0.0000062749546,5.257505e-7,0.00044390952,0.0004227924,0.00010212099,0.4134961,0.00033858375,0.585003],"study_design_scores_gemma":[0.00005728615,0.000024939744,0.00037067494,0.000015792206,0.000003678389,0.00023370134,0.00449812,0.001425249,0.00010212871,0.96870404,0.024509719,0.00005465397],"about_ca_topic_score_codex":0.0000100228135,"about_ca_topic_score_gemma":0.00014155736,"teacher_disagreement_score":0.58494836,"about_ca_system_score_codex":0.0004065256,"about_ca_system_score_gemma":0.0006166128,"threshold_uncertainty_score":0.9998742},"labels":[],"label_agreement":null},{"id":"W4396711969","doi":"10.3982/te4840","title":"Optimal sample sizes and statistical decision rules","year":2024,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Sample (material); Decision rule; Computer science; Sample size determination; Econometrics; Statistics; Mathematics; Artificial intelligence; Chemistry","score_opus":0.03707866861675208,"score_gpt":0.35374239516529543,"score_spread":0.31666372654854336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396711969","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.6882495,0.00011996376,0.30185118,0.0011651407,0.00014546858,0.00008659324,0.00032168938,0.00006237184,0.007998093],"genre_scores_gemma":[0.9548719,0.00007155985,0.044669442,0.00016207731,0.00009731172,0.000010811001,0.000010158783,0.000014040066,0.000092707734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862826,0.00008576856,0.00043918664,0.00048455302,0.00014793123,0.00021430486],"domain_scores_gemma":[0.98345274,0.015919438,0.00002954757,0.00037208875,0.000033701686,0.00019246072],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018358474,0.00012189583,0.00022294601,0.00009391631,0.00011763485,0.0005898148,0.00035181647,0.00007449226,0.005777529],"category_scores_gemma":[0.0024521293,0.00008869454,0.000057925256,0.000110690955,0.0011340464,0.00015716847,0.00018937864,0.00014413297,0.0019374195],"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.000037760812,0.000012704388,0.000021097721,0.0000017657117,0.0000060461985,0.0000017255941,0.00009103385,0.00010829719,0.000016393999,0.8583637,0.00046992462,0.14086954],"study_design_scores_gemma":[0.000081194674,0.000039292165,0.0004534644,0.000007419082,0.000012096081,0.000015714671,0.00013983973,0.05033726,0.00008250471,0.93038636,0.01833622,0.00010866014],"about_ca_topic_score_codex":0.0000021902922,"about_ca_topic_score_gemma":0.0000017730013,"teacher_disagreement_score":0.2666224,"about_ca_system_score_codex":0.000021082993,"about_ca_system_score_gemma":0.00004484469,"threshold_uncertainty_score":0.9988397},"labels":[],"label_agreement":null},{"id":"W4399185150","doi":"10.1142/s0219198924020018","title":"Preface: Special Issue on <i>Game Theory and Optimization</i> in Honor of Pierre Bernhard","year":2024,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Honor; Mathematical economics; Game theory; Law and economics; Computer science; Philosophy; Mathematics; Sociology; Internet privacy","score_opus":0.046958429296512706,"score_gpt":0.3930694967049926,"score_spread":0.34611106740847986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399185150","genre_codex":"other","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.016033083,0.13560452,0.04894421,0.019706432,0.0045389105,0.0034068972,0.0007425088,0.00028462586,0.77073884],"genre_scores_gemma":[0.8062081,0.082455404,0.0018467938,0.0074952473,0.004531398,0.0004402273,0.0001041009,0.000115549425,0.09680317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99680483,0.00082395267,0.0009142778,0.00054923625,0.00074273284,0.00016496633],"domain_scores_gemma":[0.995795,0.0032083185,0.00022591386,0.0004906162,0.00019929609,0.00008087041],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0067207306,0.00020087497,0.00043128815,0.0003058581,0.000030679614,0.0001420496,0.00087527453,0.000069238224,0.010611844],"category_scores_gemma":[0.0025297767,0.00014844227,0.00016137987,0.0006473104,0.00025924045,0.00029212152,0.00016357175,0.00024170072,0.0011412184],"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.00011674008,0.000077217854,0.00003124568,0.0001263152,0.000038125563,0.0000067208243,0.0003873273,0.0014328768,0.000029458879,0.7181875,0.0054716887,0.27409476],"study_design_scores_gemma":[0.00017112719,0.000043274875,0.00018488054,0.0019457825,0.000033150718,0.000021246262,0.000086971195,0.00067984255,0.00014819218,0.45858425,0.5379489,0.00015238726],"about_ca_topic_score_codex":0.0000012647567,"about_ca_topic_score_gemma":0.0000021666228,"teacher_disagreement_score":0.790175,"about_ca_system_score_codex":0.000047232857,"about_ca_system_score_gemma":0.000063734784,"threshold_uncertainty_score":0.99963653},"labels":[],"label_agreement":null},{"id":"W4399828040","doi":"10.1007/978-3-031-54071-4_11","title":"Information Dependent Properties of Equilibria: Existence, Comparison, Continuity and Team-against-Team Games","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.0536635730174083,"score_gpt":0.3024958594514155,"score_spread":0.24883228643400718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828040","genre_codex":"other","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.021441272,0.012646446,0.0019171472,0.00022616402,0.0012072781,0.0031684057,0.0006457338,0.00018274171,0.9585648],"genre_scores_gemma":[0.8058329,0.000034300825,0.000009257807,0.00004923911,0.00014924763,0.00011731983,0.000012148215,0.000020185838,0.19377537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594206,0.00013280263,0.0019299666,0.00043748063,0.0012970102,0.00026066464],"domain_scores_gemma":[0.99653435,0.0004883967,0.0013092983,0.00087131525,0.0006545153,0.00014211152],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027623107,0.00038739643,0.0012787045,0.0003966118,0.00012138524,0.00059581775,0.00069856684,0.00033791995,0.000038327973],"category_scores_gemma":[0.0003411677,0.00026698405,0.00021962589,0.00009873906,0.0003866429,0.000512822,0.0001973167,0.0003836083,0.00082605233],"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.00017558248,0.00003184452,0.0002672107,0.0005089963,0.00029682432,0.0000019299807,0.0026883532,0.00014231847,0.0023688609,0.9729763,0.008561839,0.011979934],"study_design_scores_gemma":[0.0015599326,0.00018597988,0.00012568521,0.0017710155,0.00034404124,0.00004654086,0.005204406,0.00974824,0.0002736114,0.07021425,0.90975314,0.00077314826],"about_ca_topic_score_codex":0.000037333113,"about_ca_topic_score_gemma":0.000028412413,"teacher_disagreement_score":0.90276206,"about_ca_system_score_codex":0.000058530695,"about_ca_system_score_gemma":0.00014471584,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W4399828049","doi":"10.1007/978-3-031-54071-4_18","title":"Signaling Games: Equilibria Under Criteria or Prior Mismatch Between an Encoder and a Decoder","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Encoder; Computer science","score_opus":0.14230679619530473,"score_gpt":0.3995833039145963,"score_spread":0.25727650771929156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828049","genre_codex":"other","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.10467976,0.029747156,0.21414456,0.005423579,0.0069438596,0.013873405,0.0054882686,0.0018581974,0.6178412],"genre_scores_gemma":[0.63696575,0.000008785934,0.00010722874,0.00017028261,0.0009876455,0.00011391583,0.000019534624,0.00009038619,0.36153647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513006,0.00027180216,0.0016199253,0.0013993053,0.0011141829,0.00046472638],"domain_scores_gemma":[0.99450636,0.0027978558,0.0005760758,0.0013494813,0.00037325957,0.00039698035],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0034251355,0.00061124057,0.0014063368,0.00039888013,0.00023889574,0.0015700653,0.0009537367,0.00058660563,0.0015373329],"category_scores_gemma":[0.00020158771,0.00041520968,0.00025595448,0.0001355646,0.00024586762,0.00035182099,0.00016905775,0.00047824823,0.0017139247],"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.00040902972,0.00007539282,0.00015732613,0.0005017824,0.0012207417,0.00013024399,0.003208476,0.00021821412,0.005314256,0.9682422,0.008769955,0.011752333],"study_design_scores_gemma":[0.0012125719,0.00024171948,0.00005828252,0.00079673337,0.0006341725,0.000112328606,0.0011997563,0.0051027676,0.000021108548,0.7852285,0.20442586,0.00096623955],"about_ca_topic_score_codex":0.00003067646,"about_ca_topic_score_gemma":0.000045157183,"teacher_disagreement_score":0.532286,"about_ca_system_score_codex":0.000068021815,"about_ca_system_score_gemma":0.00020780032,"threshold_uncertainty_score":0.99982995},"labels":[],"label_agreement":null},{"id":"W4399828050","doi":"10.1007/978-3-031-54071-4_23","title":"Multi-Agent Reinforcement Learning with General Information Structures: Convergence to Equilibria","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Reinforcement learning; Convergence (economics); Computer science; Reinforcement; Artificial intelligence; Psychology; Economics; Social psychology","score_opus":0.046954340486774236,"score_gpt":0.31739144376297035,"score_spread":0.27043710327619613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828050","genre_codex":"methods","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.0028818632,0.0011895772,0.5249808,0.0007303562,0.004051305,0.006672379,0.00033872953,0.00049264455,0.4586624],"genre_scores_gemma":[0.52892077,0.0000054197576,0.00013739956,0.00018806275,0.00024657187,0.0001580504,0.00003664361,0.000026135884,0.47028098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996315,0.00007916583,0.0012826478,0.00055085664,0.001438558,0.00033375775],"domain_scores_gemma":[0.99743843,0.0002754427,0.0006664697,0.0008508592,0.00051271345,0.00025607224],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014411792,0.00041639066,0.00064364827,0.00032457025,0.00020225953,0.0007237608,0.0007469197,0.0002225871,0.0007514166],"category_scores_gemma":[0.00017418049,0.00028279665,0.00017251179,0.0001504618,0.00008073603,0.00036663236,0.0001404398,0.00042353396,0.008293876],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012959175,0.000003503139,0.000026508018,0.00007493336,0.00019417907,0.00000933992,0.0010770953,0.13590989,0.00059639965,0.8556839,0.0041658557,0.0021288043],"study_design_scores_gemma":[0.0007323281,0.0001869737,0.00004259018,0.00024425364,0.000106456515,0.000026263242,0.0003704635,0.064472176,0.000016111022,0.008581419,0.9247524,0.0004685619],"about_ca_topic_score_codex":0.000059617534,"about_ca_topic_score_gemma":0.000016257978,"teacher_disagreement_score":0.9205865,"about_ca_system_score_codex":0.00014021588,"about_ca_system_score_gemma":0.00015554077,"threshold_uncertainty_score":0.99996245},"labels":[],"label_agreement":null},{"id":"W4399828153","doi":"10.1007/978-3-031-54071-4_19","title":"Two Classes of Signaling Games: Reputation and Information Privacy Games","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Reputation; Internet privacy; Computer science; Political science; Law","score_opus":0.04337950248601028,"score_gpt":0.3327221006036709,"score_spread":0.2893425981176606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828153","genre_codex":"other","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.008767096,0.011132558,0.042741377,0.0013128213,0.0018257538,0.0039545833,0.0008928793,0.00031772006,0.9290552],"genre_scores_gemma":[0.9013032,0.0000529685,0.00007247092,0.00006615034,0.00019648069,0.00007163541,0.000021264474,0.000020137024,0.098195694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970523,0.0000870236,0.001467275,0.00037125696,0.000872531,0.0001495871],"domain_scores_gemma":[0.9957905,0.0018144157,0.001128315,0.00059849326,0.00058698666,0.00008127901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021494974,0.00025055846,0.0006521663,0.00048249608,0.00008197534,0.00048240134,0.00035896926,0.00019130985,0.000102765574],"category_scores_gemma":[0.0006389259,0.00018999967,0.0001598469,0.00011747705,0.00013624146,0.0007297959,0.000067913774,0.00021476997,0.0006256935],"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.000032308293,0.0000045215147,0.000013999399,0.000151427,0.00009148212,0.000001710657,0.0007662889,0.00057301763,0.00043654258,0.9835689,0.00078178226,0.013578029],"study_design_scores_gemma":[0.0007554746,0.000083053084,0.000056714598,0.0008158312,0.00021111856,0.000034422985,0.001135551,0.004346024,0.000070407266,0.43418163,0.5579898,0.0003199931],"about_ca_topic_score_codex":0.000021273092,"about_ca_topic_score_gemma":0.0000028557477,"teacher_disagreement_score":0.8925361,"about_ca_system_score_codex":0.00003821822,"about_ca_system_score_gemma":0.00010534499,"threshold_uncertainty_score":0.80422324},"labels":[],"label_agreement":null},{"id":"W4399828204","doi":"10.1007/978-3-031-54071-4_10","title":"Information Structures in Stochastic Dynamic Games and Informational Properties of Equilibria","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Computer science; Mathematical economics; Statistical physics; Economics; Physics","score_opus":0.029693343173438993,"score_gpt":0.2851457114966366,"score_spread":0.2554523683231976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828204","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13953055,0.036253165,0.03800127,0.002025549,0.0046164454,0.013691156,0.0045211907,0.00045841737,0.7609023],"genre_scores_gemma":[0.961246,0.000006693522,0.00000539771,0.00002869594,0.000044726,0.00006992462,0.00002121497,0.000010969893,0.03856635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761695,0.000038083454,0.0013228283,0.000171116,0.00071321655,0.00013778122],"domain_scores_gemma":[0.9983717,0.0003470744,0.0005991131,0.00036095156,0.00026865304,0.00005248667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010397917,0.00021744803,0.0005353133,0.00061600626,0.00004302569,0.0002881501,0.0003309583,0.00019283323,0.00006677051],"category_scores_gemma":[0.000264056,0.00014913415,0.000084310705,0.00008608918,0.00018252435,0.00060762104,0.00007863469,0.00021895814,0.0002672542],"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.000063174026,0.0000025008935,0.0000044699436,0.00018600891,0.000049884016,3.6799565e-7,0.0013464546,0.0048535774,0.00023950929,0.988851,0.0001762432,0.004226811],"study_design_scores_gemma":[0.0012188844,0.00008783015,0.00033753575,0.001349531,0.00010538069,0.00006104446,0.0018986892,0.17952281,0.000009183404,0.7798625,0.035040863,0.0005057198],"about_ca_topic_score_codex":0.000021213584,"about_ca_topic_score_gemma":0.000018978797,"teacher_disagreement_score":0.8217155,"about_ca_system_score_codex":0.000046424906,"about_ca_system_score_gemma":0.00012439009,"threshold_uncertainty_score":0.60815144},"labels":[],"label_agreement":null},{"id":"W4399833126","doi":"10.1007/978-3-031-54071-4","title":"Stochastic Teams, Games, and Control under Information Constraints","year":2024,"lang":"en","type":"book","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"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":"Queen's University","keywords":"Control (management); Computer science; Operations research; Mathematical economics; Mathematics; Artificial intelligence","score_opus":0.02404878474408436,"score_gpt":0.3022325203131931,"score_spread":0.27818373556910875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399833126","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.000089261026,0.006972361,0.54519993,0.0015404021,0.0026642492,0.0044651674,0.0031595419,0.0003454323,0.43556365],"genre_scores_gemma":[0.74126846,0.0000061678684,0.0000055357254,0.00050025684,0.0003913467,0.00026055882,0.000048368423,0.000026987178,0.25749233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960732,0.00023401542,0.0015181556,0.0005954896,0.001199348,0.0003797918],"domain_scores_gemma":[0.9947963,0.0028078188,0.00077708863,0.0008660143,0.0004951205,0.00025766576],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034112788,0.0004437389,0.0010232853,0.0005034333,0.00019150885,0.0012020194,0.0006431039,0.0004670948,0.00037565667],"category_scores_gemma":[0.00072267913,0.00033175276,0.00020625268,0.0001923959,0.00054133584,0.0004365748,0.000070177804,0.00057172263,0.006508038],"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.000081852035,0.000019841453,0.000006820472,0.00018397257,0.00039126267,0.000008298057,0.0004483706,0.0017124903,0.00005872271,0.8184739,0.1535893,0.025025195],"study_design_scores_gemma":[0.0032992412,0.00009549189,0.00009452238,0.00073098874,0.00047627185,0.00018052827,0.001448269,0.011426184,5.4960486e-7,0.29767618,0.6838222,0.00074955844],"about_ca_topic_score_codex":0.000020490832,"about_ca_topic_score_gemma":0.000009209345,"teacher_disagreement_score":0.74117917,"about_ca_system_score_codex":0.00017815366,"about_ca_system_score_gemma":0.00074965385,"threshold_uncertainty_score":0.99991345},"labels":[],"label_agreement":null},{"id":"W4399834743","doi":"10.1007/978-3-031-54071-4_3","title":"Information Structures in Decentralized Stochastic Control","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Computer science; Control (management); Artificial intelligence","score_opus":0.03311182761188705,"score_gpt":0.31620476778998236,"score_spread":0.2830929401780953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399834743","genre_codex":"other","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.0009834276,0.009662852,0.1825057,0.0020689094,0.0069369143,0.009916793,0.0034765573,0.00053125096,0.7839176],"genre_scores_gemma":[0.8816145,0.000007977595,0.0000061087794,0.00022800741,0.0002414869,0.00019679806,0.00003401483,0.000031259005,0.11763981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596953,0.00013958824,0.0018108826,0.00043550247,0.0012688168,0.00037564893],"domain_scores_gemma":[0.99645823,0.001383955,0.00073698006,0.00089430215,0.00035949564,0.0001670617],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021137353,0.0004303841,0.0010476008,0.0007444978,0.000100394085,0.0007420839,0.0008330095,0.00043110893,0.00066780765],"category_scores_gemma":[0.0005440315,0.000317746,0.00028539647,0.00016082147,0.00012662882,0.0003732133,0.000048213868,0.00053254695,0.0054581272],"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.00011555856,0.0000045864076,0.000009042917,0.00003397402,0.00008775423,0.0000058425544,0.000280049,0.0059480313,0.000026932292,0.9881009,0.0021484378,0.0032389078],"study_design_scores_gemma":[0.0024662944,0.00003911337,0.00012663288,0.00025411425,0.00014442604,0.00003101378,0.00021931864,0.009858751,7.796339e-7,0.65003955,0.3364151,0.00040487648],"about_ca_topic_score_codex":0.000055006105,"about_ca_topic_score_gemma":0.00004577117,"teacher_disagreement_score":0.8806311,"about_ca_system_score_codex":0.00014761384,"about_ca_system_score_gemma":0.00016326073,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W4399939161","doi":"10.1109/tsmc.2024.3407836","title":"Inverse Preference Optimization in the Graph Model for Conflict Resolution With Uncertain Cost","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Preference; Inverse; Computer science; Conflict resolution; Graph; Mathematical optimization; Inverse problem; Resolution (logic); Mathematics; Theoretical computer science; Artificial intelligence; Statistics; Political science","score_opus":0.16043706286838294,"score_gpt":0.33530338168383816,"score_spread":0.17486631881545522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399939161","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.01007639,0.00037044054,0.98521376,0.0002432291,0.00040460494,0.0021266697,0.00016597736,0.00007200857,0.0013269435],"genre_scores_gemma":[0.99338365,0.0000882151,0.0003153312,0.000048621398,0.000046818637,0.0012858075,0.000007820747,0.000020416197,0.004803338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976718,0.00036747247,0.0005945996,0.00051945064,0.0006088296,0.00023788115],"domain_scores_gemma":[0.9981619,0.0009339584,0.00012528728,0.0005206301,0.00017504294,0.00008319025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021081055,0.00019800742,0.00026053214,0.0003397647,0.0002723683,0.000747299,0.00036205692,0.00012179965,0.000005642136],"category_scores_gemma":[0.000016243512,0.00012224428,0.00006857739,0.00080269546,0.00014691536,0.00019523904,0.0000016755587,0.00020583849,0.000027415905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058807058,0.000047332214,0.0000067874557,0.0000717902,0.00001851478,0.0000016401787,0.0023605402,0.97106993,0.000044504588,0.024972504,0.00064553943,0.0007020996],"study_design_scores_gemma":[0.00035381675,0.00011796978,0.000010060077,0.00024967498,0.000042077518,0.00004320329,0.0042904806,0.9891977,0.000021847189,0.0008990993,0.0046144105,0.00015970149],"about_ca_topic_score_codex":0.00020183086,"about_ca_topic_score_gemma":0.0002781796,"teacher_disagreement_score":0.9848984,"about_ca_system_score_codex":0.000058403333,"about_ca_system_score_gemma":0.000071414564,"threshold_uncertainty_score":0.7206221},"labels":[],"label_agreement":null},{"id":"W4400009424","doi":"10.1108/ejm-05-2022-0360","title":"Category–level drivers of the market share–rank power law relationship","year":2024,"lang":"en","type":"article","venue":"European Journal of Marketing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Business; Marketing; Market share; Rank (graph theory); Mathematics","score_opus":0.11006852811295303,"score_gpt":0.33215078427366074,"score_spread":0.2220822561607077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400009424","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31146,0.00038398345,0.0021549056,0.0031008895,0.0007255693,0.000093324954,0.00002697996,0.000019389554,0.68203497],"genre_scores_gemma":[0.99269444,0.000005153373,0.0007658096,0.00014326377,0.00011441984,3.099695e-7,2.5180677e-7,0.000017823128,0.0062585436],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9936002,0.0042888555,0.0009499827,0.0001870546,0.00082456396,0.00014934124],"domain_scores_gemma":[0.9921183,0.0065273796,0.0005573769,0.00040193234,0.00031231914,0.00008269792],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.035899386,0.00010109522,0.00016640579,0.00015176529,0.00022838442,0.00020528855,0.0011111393,0.000019892645,0.0015721878],"category_scores_gemma":[0.008111375,0.000059818638,0.00026349403,0.0006604254,0.00019246165,0.00027560056,0.00017479542,0.00041832664,0.00018788033],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012659229,0.0002442487,0.038082033,0.00013676495,0.00036058063,0.00049093674,0.01211614,0.0012880196,0.017036995,0.31277558,0.5251063,0.09109645],"study_design_scores_gemma":[0.00044539908,0.00007603985,0.6798495,0.0006998974,0.00008383912,0.00030994872,0.0029530223,0.00028791407,0.000679508,0.03303643,0.2813432,0.00023532941],"about_ca_topic_score_codex":7.477291e-7,"about_ca_topic_score_gemma":0.0000013025493,"teacher_disagreement_score":0.6812344,"about_ca_system_score_codex":0.000022663078,"about_ca_system_score_gemma":0.000066043605,"threshold_uncertainty_score":0.99934053},"labels":[],"label_agreement":null},{"id":"W4401015365","doi":"10.5206/mt.v4i1.17122","title":"Computation of Nash Equilibria of Two-Person m x n Games","year":2024,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maple; Nash equilibrium; Computation; Mathematical economics; Computer science; Game theory; Mathematics; Algorithm","score_opus":0.12536940207507707,"score_gpt":0.41047278508858004,"score_spread":0.28510338301350296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401015365","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.31485504,0.00018072379,0.67728597,0.0008447059,0.00023477427,0.00012392279,0.00009735227,0.00006414231,0.0063133924],"genre_scores_gemma":[0.9961684,0.0000044498897,0.0017721412,0.000012942211,0.000022781325,0.00001397597,0.0000038773337,0.000007671706,0.0019937826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988256,0.00008615932,0.00037668418,0.00021851635,0.00039520385,0.000097818636],"domain_scores_gemma":[0.9988498,0.00066851056,0.0000735184,0.0002494099,0.000116483636,0.000042272983],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006631754,0.00007135844,0.00016805883,0.00022772244,0.00006155925,0.000050060546,0.00022550487,0.000033947395,0.0011165835],"category_scores_gemma":[0.000038285914,0.000059075213,0.00015258527,0.0009221482,0.00014132731,0.00019509437,0.0000040377668,0.00008634644,0.00016461941],"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.00006441506,0.0003829665,0.0002259996,0.00014339153,0.00015507087,0.0000030981034,0.00940522,0.03418942,0.35180163,0.1696627,0.003920768,0.43004534],"study_design_scores_gemma":[0.0010750381,0.00029459532,0.005688961,0.00024681113,0.00027561645,0.0000399057,0.008811216,0.22952165,0.17856993,0.5450823,0.029892953,0.0005010661],"about_ca_topic_score_codex":0.000040891115,"about_ca_topic_score_gemma":0.000030436184,"teacher_disagreement_score":0.68131334,"about_ca_system_score_codex":0.0000108477625,"about_ca_system_score_gemma":0.00005226875,"threshold_uncertainty_score":0.9997965},"labels":[],"label_agreement":null},{"id":"W4401480952","doi":"10.1142/s0219024924500171","title":"NETTING AND NOVATION IN REPO NETWORKS","year":2024,"lang":"en","type":"article","venue":"International Journal of Theoretical and Applied Finance","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Netting; Business; Economics; Finance","score_opus":0.02185970550589138,"score_gpt":0.3458953894953337,"score_spread":0.3240356839894423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401480952","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.92717654,0.00060266984,0.058399994,0.006783116,0.0003599032,0.000056910747,0.0000029826194,0.000007956904,0.0066099497],"genre_scores_gemma":[0.9980714,0.00014962192,0.0012283542,0.00024153906,0.00021864692,0.0000027926314,4.939415e-7,0.000003902134,0.00008329039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988556,0.000028243347,0.000510744,0.00016565913,0.00035576805,0.00008397234],"domain_scores_gemma":[0.998759,0.0008842293,0.0001339351,0.000072579445,0.00011803144,0.00003224544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018821238,0.00006250185,0.00012906053,0.00015255528,0.000029563713,0.00022296875,0.00026529084,0.000043488537,0.00005621477],"category_scores_gemma":[0.00034542757,0.000043115157,0.000031298223,0.00023592745,0.00026185773,0.00013440238,0.000077653865,0.0002204081,0.0000075519433],"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.000046450372,0.000012278158,0.00020156804,0.0000010494108,0.0000057716666,0.000014543182,0.000115514646,0.00044370076,0.0003870455,0.8680357,0.00014902279,0.13058738],"study_design_scores_gemma":[0.00017398845,0.000019754298,0.0038394681,0.00007592942,0.0000041053913,0.00014332551,0.000101613645,0.020555217,0.00036521596,0.9677628,0.0069005988,0.000057938996],"about_ca_topic_score_codex":4.6821222e-7,"about_ca_topic_score_gemma":4.428918e-7,"teacher_disagreement_score":0.13052945,"about_ca_system_score_codex":0.000014975357,"about_ca_system_score_gemma":0.00001824701,"threshold_uncertainty_score":0.21500927},"labels":[],"label_agreement":null},{"id":"W4401669748","doi":"10.1142/s0218202524500507","title":"A duality and free boundary approach to adverse selection","year":2024,"lang":"en","type":"article","venue":"Mathematical Models and Methods in Applied Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Science and Technology Commission of Shanghai Municipality; Canada Research Chairs; Simons Foundation","keywords":"Duality (order theory); Selection (genetic algorithm); Boundary (topology); Mathematical optimization; Mathematics; Computer science; Applied mathematics; Mathematical economics; Calculus (dental); Mathematical analysis; Pure mathematics; Medicine; Artificial intelligence","score_opus":0.25112207746275983,"score_gpt":0.49723698484888124,"score_spread":0.2461149073861214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401669748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04578469,0.00011837221,0.8209883,0.00051778654,0.0000321757,0.0003108467,0.0000038235535,0.00004864955,0.13219535],"genre_scores_gemma":[0.42325917,0.0000047674607,0.5762693,0.00011775044,0.000016530072,0.000097435804,1.219036e-7,0.000003909168,0.00023099121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780345,0.00025278688,0.00044965363,0.00072426174,0.0005273589,0.00024246193],"domain_scores_gemma":[0.99717975,0.002323461,0.000038380564,0.0002744881,0.000024629913,0.00015931584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014582154,0.000129103,0.0002777334,0.00026721862,0.0002789282,0.0004681888,0.00043174764,0.00006671334,0.00004370812],"category_scores_gemma":[0.00072760216,0.000083742416,0.00003465256,0.0014725028,0.00061510253,0.0002202695,0.0002845647,0.00015831625,0.000022368362],"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.000005354939,0.000042400778,0.000006387074,0.00002193619,0.0000021392027,1.896022e-7,0.0018128044,0.0006130202,0.0012507195,0.92802316,0.000082187515,0.06813967],"study_design_scores_gemma":[0.000049626193,0.000016054224,0.000040575338,0.000013662061,0.0000052202377,0.000009824403,0.0011900702,0.24917777,0.00028264394,0.7482763,0.00085209275,0.00008615888],"about_ca_topic_score_codex":0.0000041732383,"about_ca_topic_score_gemma":0.0000027161996,"teacher_disagreement_score":0.3774745,"about_ca_system_score_codex":0.000015212146,"about_ca_system_score_gemma":0.000052161475,"threshold_uncertainty_score":0.5053913},"labels":[],"label_agreement":null},{"id":"W4401686770","doi":"10.3390/jrfm17080370","title":"Adapting to Multipolarity: Insights from Iterated Game Theory Simulations—A Preliminary Study on Hypothetical Optimal Global Cooperation","year":2024,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterated function; Game theory; Mathematical economics; Computer science; Economics; Mathematics","score_opus":0.03941694725936073,"score_gpt":0.339249415517914,"score_spread":0.29983246825855325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401686770","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.7652938,0.0002756125,0.23336326,0.00017598433,0.00024616663,0.0003236079,0.000042070897,0.000014634244,0.00026490272],"genre_scores_gemma":[0.99739665,0.00001713349,0.0021267077,0.0001531197,0.00019970316,0.0000073795823,0.0000017702903,0.000006402363,0.00009112098],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804795,0.0003628367,0.0006212335,0.00030131786,0.00054691936,0.00011972864],"domain_scores_gemma":[0.9983837,0.000976608,0.00014202068,0.00021561164,0.00017277285,0.0001093122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013225127,0.00012993836,0.00022048845,0.00024076563,0.00021027825,0.00042816828,0.0002582564,0.000041132764,0.000039356542],"category_scores_gemma":[0.00081353163,0.00009073314,0.000070295326,0.0006658923,0.000038457834,0.0002445267,0.00012665088,0.0002116138,0.000077260906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014508745,0.0007172148,0.0017764228,0.0000044317267,0.00006216791,0.00019786037,0.0059713954,0.038133662,0.000077524994,0.18711406,0.00039922315,0.7640951],"study_design_scores_gemma":[0.0020601363,0.003422096,0.43771216,0.00029682615,0.00045581372,0.000025910424,0.0078398045,0.041207176,0.00011802188,0.44631177,0.060075033,0.00047524282],"about_ca_topic_score_codex":0.0000072448547,"about_ca_topic_score_gemma":0.000012446775,"teacher_disagreement_score":0.7636199,"about_ca_system_score_codex":0.00003737471,"about_ca_system_score_gemma":0.00002798841,"threshold_uncertainty_score":0.41288367},"labels":[],"label_agreement":null},{"id":"W4402153668","doi":"10.26599/tst.2024.9010056","title":"Mixed Strategy Nash Equilibrium for Scheduling Games on Batching-Machines with Activation Cost","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","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":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Nash equilibrium; Computer science; Scheduling (production processes); Epsilon-equilibrium; Best response; Mathematical optimization; Mathematical economics; Economics; Mathematics","score_opus":0.10000094816469142,"score_gpt":0.4008223774677241,"score_spread":0.3008214293030327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402153668","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.85266924,0.00006751797,0.13587916,0.0074705044,0.00027822226,0.0005215851,0.000012281658,0.00057372765,0.0025277366],"genre_scores_gemma":[0.9926437,0.0000017273962,0.0060812896,0.00013910877,0.00007243836,0.00014105729,0.0000032451755,0.00001885858,0.0008985409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971802,0.000041453437,0.0004006421,0.0010454907,0.0008077366,0.00052443234],"domain_scores_gemma":[0.99758446,0.0010475849,0.00015529967,0.0007962641,0.00032255016,0.000093825605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028308847,0.00020551935,0.00024672263,0.0017155645,0.00057490444,0.0007790806,0.0015326533,0.00013840132,0.00005174248],"category_scores_gemma":[0.0018503444,0.00013885609,0.000061780505,0.006070146,0.0018178892,0.0008261493,0.00016820892,0.0003254281,0.00019457785],"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.00004832336,0.000054608932,0.00015272759,0.000007931955,0.000007028778,0.0000023470527,0.00022723006,0.0051983045,0.23658349,0.5378491,0.00016921714,0.2196997],"study_design_scores_gemma":[0.00033380432,0.0006067894,0.00047384604,0.00017683585,0.000018752009,0.0000507783,0.0022609548,0.10622535,0.3005308,0.57230794,0.016614141,0.00040002682],"about_ca_topic_score_codex":0.0000065452437,"about_ca_topic_score_gemma":0.000010109174,"teacher_disagreement_score":0.21929967,"about_ca_system_score_codex":0.00010399323,"about_ca_system_score_gemma":0.00043559136,"threshold_uncertainty_score":0.7512692},"labels":[],"label_agreement":null},{"id":"W4402387423","doi":"10.48550/arxiv.2408.06253","title":"Learning in Time-Varying Monotone Network Games with Dynamic Populations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Monotone polygon; Computer science; Mathematical economics; Mathematics","score_opus":0.1188339447479177,"score_gpt":0.2696759048224014,"score_spread":0.1508419600744837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402387423","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.96266615,0.00009867771,0.028023927,0.00022619253,0.0001510416,0.000360261,0.000013564964,0.00020659364,0.008253581],"genre_scores_gemma":[0.9745261,0.000027804308,0.00047029398,0.00002934252,0.000050857096,0.000004257164,0.000029143675,0.000027022772,0.024835184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976425,0.00030979005,0.00035695772,0.0011325451,0.00022281952,0.00033537188],"domain_scores_gemma":[0.9981072,0.000518599,0.00026758207,0.00087347405,0.00011715752,0.000115977775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001162152,0.00026391933,0.00038669622,0.00050009764,0.00023341813,0.0002587902,0.0011096651,0.00021139353,0.00029874776],"category_scores_gemma":[0.00013254026,0.00024445084,0.00015292501,0.002082679,0.00015858327,0.00015085196,0.0012949265,0.0011202262,0.001372431],"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.00004326212,0.000032933087,0.016231896,0.000009098205,0.000025119216,0.000077653065,0.00021336241,0.9355751,0.000016011174,0.04678478,0.0001433302,0.0008474392],"study_design_scores_gemma":[0.0001513989,0.000023146524,0.007192755,0.00015082472,0.000058485322,0.0000033352815,0.00021474544,0.44891772,0.0000033188585,0.54256374,0.0004682118,0.000252333],"about_ca_topic_score_codex":0.000089170855,"about_ca_topic_score_gemma":0.00022967035,"teacher_disagreement_score":0.49577895,"about_ca_system_score_codex":0.00015476406,"about_ca_system_score_gemma":0.00013988905,"threshold_uncertainty_score":0.9994051},"labels":[],"label_agreement":null},{"id":"W4403364360","doi":"10.1016/j.ejor.2024.10.014","title":"Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mediation; Inverse; Mathematical optimization; Conflict resolution; Graph; Path (computing); Theoretical computer science; Operations research; Mathematics; Political science; Computer network","score_opus":0.6142092893936134,"score_gpt":0.4791714146721988,"score_spread":0.1350378747214146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403364360","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.64708585,0.00032116557,0.29533854,0.05108382,0.00068340806,0.0006941489,0.000029071189,0.000023059334,0.0047409604],"genre_scores_gemma":[0.9939458,0.0000758924,0.0035297421,0.00057218154,0.00062428886,0.000037218288,0.0000023317034,0.000018134337,0.0011944615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927264,0.0031910853,0.00079296896,0.00026181468,0.0027936248,0.00023410362],"domain_scores_gemma":[0.99165773,0.006113956,0.00012643271,0.00044923235,0.0014585112,0.00019413106],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.041213542,0.00009935241,0.000120561126,0.00042813364,0.0009173428,0.0011881314,0.0013202601,0.00001908167,0.0000993231],"category_scores_gemma":[0.013712638,0.000048741418,0.00010979743,0.0017430921,0.00027621878,0.000668706,0.00019241005,0.0009440017,0.00078642205],"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.00035567416,0.00008155061,0.000055803204,0.0000067789383,0.000062288455,0.000080574566,0.030206632,0.37454757,0.010086926,0.4959829,0.072726555,0.015806759],"study_design_scores_gemma":[0.00053826225,0.00058941904,0.006864678,0.00045679635,0.000033899923,0.00015008493,0.013863794,0.6474032,0.001570951,0.21003923,0.118155666,0.0003340434],"about_ca_topic_score_codex":0.0000021769297,"about_ca_topic_score_gemma":0.000007139074,"teacher_disagreement_score":0.34685993,"about_ca_system_score_codex":0.0000744035,"about_ca_system_score_gemma":0.00042957795,"threshold_uncertainty_score":0.9999916},"labels":[],"label_agreement":null},{"id":"W4403822217","doi":"10.1016/j.ejor.2024.10.035","title":"Interrelationships of Non-cooperative, Classical and Pareto coalitional stability definitions","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Pareto principle; Stability (learning theory); Mathematical economics; Pareto optimal; Mathematical optimization; Computer science; Mathematics; Multi-objective optimization; Machine learning","score_opus":0.5622902772644344,"score_gpt":0.5054436516394628,"score_spread":0.05684662562497156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403822217","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.8951903,0.0005065366,0.046381492,0.0118014645,0.00017939712,0.00021138995,0.00018965013,0.000009846781,0.045529913],"genre_scores_gemma":[0.99703175,0.000045729143,0.002020838,0.00004510205,0.0002060403,0.000005210338,0.00001146661,0.000010562085,0.00062329194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99412644,0.0027144374,0.0010197632,0.00025764902,0.0017216832,0.00016005313],"domain_scores_gemma":[0.9907907,0.0062430105,0.000105432104,0.00022895164,0.0024479171,0.00018395424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.019721817,0.000087607914,0.00019035563,0.0004702909,0.00035880817,0.00046951618,0.00046611845,0.000025768228,0.0015245533],"category_scores_gemma":[0.0062499144,0.000061140534,0.00010075792,0.0008536394,0.00074253866,0.000567389,0.0001561098,0.00069967925,0.00032292184],"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.00014035877,0.0002708973,0.0029494006,0.000020636842,0.00006423312,0.000067929876,0.0023738083,0.0005450113,0.014322848,0.95100904,0.020807391,0.0074284226],"study_design_scores_gemma":[0.0017580657,0.0021544956,0.35893583,0.0008020234,0.00006115724,0.0010801791,0.01073129,0.025097061,0.006986925,0.4668062,0.1250448,0.0005419913],"about_ca_topic_score_codex":0.0000011623399,"about_ca_topic_score_gemma":0.000005345573,"teacher_disagreement_score":0.48420286,"about_ca_system_score_codex":0.000046987832,"about_ca_system_score_gemma":0.0005367072,"threshold_uncertainty_score":0.9993882},"labels":[],"label_agreement":null},{"id":"W4404212697","doi":"10.1016/j.ejor.2024.11.014","title":"Cap-and-trade under a dual-channel setting in the presence of information asymmetry","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Western University","funders":"Social Sciences and Humanities Research Council; Social Sciences and Humanities Research Council of Canada; Canada Research Chairs; CRC Health Group","keywords":"Dual (grammatical number); Information asymmetry; Asymmetry; Channel (broadcasting); Computer science; Economics; Mathematics; Telecommunications; Physics; Microeconomics; Linguistics; Philosophy","score_opus":0.19332780208832512,"score_gpt":0.4589287300325435,"score_spread":0.26560092794421836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404212697","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.87522566,0.0012237658,0.025479766,0.06211145,0.00020128269,0.00036246504,0.00003043658,0.000007820863,0.03535738],"genre_scores_gemma":[0.9989941,0.00003632971,0.00043284963,0.00020177159,0.00011787573,0.0000020034597,0.0000015289478,0.000004025376,0.00020948544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498063,0.0021748843,0.00073356257,0.00010346707,0.0018710443,0.00013639394],"domain_scores_gemma":[0.99515474,0.0040905434,0.00010247104,0.00016528215,0.00043198207,0.000054976594],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.034552425,0.00005133817,0.0000918001,0.00054164365,0.00016023911,0.00055256666,0.00051323645,0.000013817351,0.00007544781],"category_scores_gemma":[0.00421597,0.000028986819,0.00004603198,0.0010062665,0.00017705366,0.0008856798,0.000105411586,0.0005124315,0.00010076372],"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.00014629809,0.00016047228,0.0006326378,0.00005073548,0.000053006577,0.00016392353,0.033035293,0.021716647,0.007563571,0.8102045,0.051549014,0.07472389],"study_design_scores_gemma":[0.001631193,0.0011462297,0.31937867,0.00092219247,0.000028689114,0.0021437982,0.075242825,0.05952329,0.003637506,0.35136667,0.18454283,0.00043611185],"about_ca_topic_score_codex":0.0000033092883,"about_ca_topic_score_gemma":0.0000014927067,"teacher_disagreement_score":0.45883784,"about_ca_system_score_codex":0.0000179577,"about_ca_system_score_gemma":0.00018584743,"threshold_uncertainty_score":0.99413145},"labels":[],"label_agreement":null},{"id":"W4404351617","doi":"10.48550/arxiv.2411.01032","title":"Two timescales in stochastic evolutionary games","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical economics; Computer science; Economics","score_opus":0.16436957662352392,"score_gpt":0.2816273739264116,"score_spread":0.11725779730288766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404351617","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.92282826,0.0004966752,0.04981468,0.00052736484,0.0005983606,0.00046170346,0.00014555846,0.0001986904,0.024928711],"genre_scores_gemma":[0.98166704,0.000018757546,0.0001648649,0.00004543745,0.00009178765,0.000003728459,0.000015524385,0.000016787142,0.01797607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976228,0.00025541685,0.0003722271,0.0012468132,0.00022179223,0.00028093698],"domain_scores_gemma":[0.997475,0.0009204115,0.00017475516,0.0011434836,0.00014941338,0.00013690446],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009585797,0.0002532846,0.00035388267,0.0007229056,0.000102105536,0.00012413104,0.0014446258,0.00019810548,0.0006407265],"category_scores_gemma":[0.00030507697,0.00024633532,0.00024264942,0.0013765399,0.0003079748,0.00012335675,0.0019861828,0.00077552476,0.0043670516],"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.000037068698,0.00008420051,0.0007528095,0.000011440222,0.000025545038,0.00010434764,0.00018711892,0.478412,0.000025193482,0.51767856,0.0019237173,0.0007580269],"study_design_scores_gemma":[0.0001683468,0.000010294037,0.002222984,0.000083808045,0.00004192145,0.000004245099,0.000454181,0.15156066,0.000007738929,0.8445528,0.0006634331,0.00022955821],"about_ca_topic_score_codex":0.00008228996,"about_ca_topic_score_gemma":0.00011129636,"teacher_disagreement_score":0.3268743,"about_ca_system_score_codex":0.00018028513,"about_ca_system_score_gemma":0.00024703972,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4405254840","doi":"10.48550/arxiv.2412.06990","title":"The Oracle Complexity of Simplex-based Matrix Games","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Oracle; Nash equilibrium; Simplex; Mathematics; Matrix (chemical analysis); Combinatorics; Mathematical economics; Computer science; Chemistry","score_opus":0.322652605380197,"score_gpt":0.3190839135366793,"score_spread":0.003568691843517713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405254840","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.9501795,0.0002571096,0.03298216,0.0017004178,0.0004609772,0.00050102116,0.0003543764,0.00016136095,0.01340306],"genre_scores_gemma":[0.992003,0.000027170976,0.00020462896,0.000046064288,0.000045609788,0.0000016994671,0.0000109562,0.000014778315,0.0076460466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978525,0.0003608497,0.00044033208,0.0008235055,0.00027375636,0.0002490247],"domain_scores_gemma":[0.9952656,0.0019839816,0.00042930036,0.0018520333,0.0003543485,0.00011473626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018298774,0.00021387177,0.00035847456,0.00022778257,0.00030081382,0.00020101224,0.0023336853,0.00016658314,0.00040881403],"category_scores_gemma":[0.0003929825,0.00015986017,0.00038698656,0.0011253717,0.001122813,0.0000603965,0.0015545643,0.00053353654,0.0008915996],"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.00006760642,0.000060138846,0.0004608925,0.00003004095,0.000044711567,0.000016989927,0.00008741747,0.04809822,0.00005650941,0.9470644,0.0025346868,0.0014783938],"study_design_scores_gemma":[0.00012748454,0.000017835762,0.0008770632,0.000030780207,0.00006825568,6.664975e-7,0.00049308856,0.073433824,0.00043945145,0.90984416,0.014506163,0.00016125999],"about_ca_topic_score_codex":0.00008917356,"about_ca_topic_score_gemma":0.00013366363,"teacher_disagreement_score":0.04182353,"about_ca_system_score_codex":0.00006479437,"about_ca_system_score_gemma":0.0002723735,"threshold_uncertainty_score":0.99988633},"labels":[],"label_agreement":null},{"id":"W4405761688","doi":"10.1016/j.ins.2024.121783","title":"Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time","year":2024,"lang":"en","type":"article","venue":"Information Sciences","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":"Wilfrid Laurier University","funders":"","keywords":"Nash equilibrium; Probabilistic logic; Zero (linguistics); Zero-sum game; Best response; Correlated equilibrium; Epsilon-equilibrium; Mathematics; Polynomial; Mathematical economics; Game theory; Computer science; Mathematical optimization; Repeated game; Statistics; Equilibrium selection; Mathematical analysis","score_opus":0.09798014279736016,"score_gpt":0.40554001085171065,"score_spread":0.3075598680543505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405761688","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.95841074,0.00007573968,0.0011768509,0.002170611,0.0003572101,0.0003597789,0.00002438341,0.00009640779,0.03732826],"genre_scores_gemma":[0.99858034,0.0000014042297,0.00043317457,0.00015314324,0.000032814307,0.000044942644,0.000004565863,0.0000028072925,0.0007468335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739075,0.000114321185,0.0009497864,0.00029563505,0.00093120086,0.00031829075],"domain_scores_gemma":[0.99816304,0.0013002906,0.00014680998,0.0002528403,0.00007001576,0.00006699703],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006339013,0.00011828715,0.00018542176,0.0013417988,0.00012212283,0.0012828481,0.00090671616,0.000064522355,0.00041786628],"category_scores_gemma":[0.0018997514,0.0000860809,0.000059516475,0.004149732,0.00037296134,0.004404787,0.00014522838,0.0001541403,0.0043710377],"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.0001490979,0.00026042102,0.022838194,0.00018426293,0.000016863514,0.000023779525,0.062379565,0.09581726,0.009944545,0.30870393,0.055892408,0.4437897],"study_design_scores_gemma":[0.0004987958,0.0001244538,0.025277324,0.00022138125,0.000006100677,0.0000360464,0.0041622464,0.56836706,0.0010197766,0.3281662,0.07159731,0.00052329345],"about_ca_topic_score_codex":0.000031401014,"about_ca_topic_score_gemma":0.00002396829,"teacher_disagreement_score":0.47254983,"about_ca_system_score_codex":0.000076017466,"about_ca_system_score_gemma":0.00027959596,"threshold_uncertainty_score":0.9997539},"labels":[],"label_agreement":null},{"id":"W4405798113","doi":"10.2139/ssrn.5069482","title":"Equilibrium Conditions for Catch-22 Situations","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Economics; Environmental science","score_opus":0.05575573355019492,"score_gpt":0.4001419031535662,"score_spread":0.34438616960337126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405798113","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.22977902,0.0039151157,0.7194856,0.032267775,0.001147126,0.00064021413,0.00019214535,0.00022875807,0.012344276],"genre_scores_gemma":[0.97188777,0.00013345835,0.00019685242,0.00013276261,0.00047365602,0.00006996817,0.000016697768,0.000017497485,0.027071316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751323,0.00009910884,0.00045167236,0.00029624015,0.0004467543,0.0011929704],"domain_scores_gemma":[0.9979124,0.0013360509,0.00009840186,0.00030963772,0.00023810973,0.000105405736],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005011714,0.000111175796,0.00014542577,0.0002678286,0.0003819472,0.00049034774,0.00059532333,0.000056081957,0.00048763977],"category_scores_gemma":[0.0006600585,0.00008504164,0.00023689741,0.0007042486,0.00009165888,0.0004319373,0.00003737242,0.00079007586,0.0010122854],"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.00000728081,0.000028111766,0.000017370332,0.0000013862236,0.00004677582,6.6263107e-7,0.00015476345,0.0001408295,0.0031012383,0.97275454,0.009350762,0.014396253],"study_design_scores_gemma":[0.00013877003,0.00008697014,0.000055839428,0.000007790475,0.000036950154,0.00022730055,0.0016428556,0.0017106951,0.00019926635,0.92751724,0.068279505,0.000096842996],"about_ca_topic_score_codex":0.0000039833703,"about_ca_topic_score_gemma":0.000108142274,"teacher_disagreement_score":0.74210876,"about_ca_system_score_codex":0.00027318587,"about_ca_system_score_gemma":0.0020717394,"threshold_uncertainty_score":0.9997655},"labels":[],"label_agreement":null},{"id":"W4407613698","doi":"10.1007/978-3-031-82697-9_9","title":"The Computational Complexity of Equilibria with Strategic Constraints","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Victoria","funders":"","keywords":"Computer science; Computational complexity theory; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.1128177789688143,"score_gpt":0.3531298064763141,"score_spread":0.2403120275074998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407613698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012992456,0.000092951675,0.9528347,0.0013002164,0.00028170826,0.00035505558,0.000052323587,0.000025107323,0.04375866],"genre_scores_gemma":[0.94305414,0.000003859389,0.055528264,0.00031036383,0.00007735355,0.0000058550168,0.0000070871765,0.000008809577,0.001004293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964917,0.00008112173,0.00072122377,0.00082506286,0.001573339,0.000307562],"domain_scores_gemma":[0.9925669,0.005186193,0.00048605358,0.0009893078,0.0006877568,0.000083825544],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025605296,0.00026731513,0.00042599984,0.00035828023,0.00041490066,0.00039958887,0.002640692,0.00012142972,0.00014578494],"category_scores_gemma":[0.00024362805,0.00015552544,0.000095960626,0.0008013162,0.009768089,0.00013053489,0.00046053284,0.0004413369,0.00003404342],"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.000020988022,0.000015397189,0.000040847342,0.000005762122,0.0000100407515,0.0000035286962,0.00011143248,0.034629934,0.000032239903,0.81617874,0.000028059278,0.14892301],"study_design_scores_gemma":[0.00014219081,0.000065055516,0.00023663737,0.00010542505,0.0000064250544,0.000017125685,0.0000024242524,0.08877079,0.0000986382,0.91002285,0.0003779357,0.00015452101],"about_ca_topic_score_codex":0.000005771958,"about_ca_topic_score_gemma":0.000090964284,"teacher_disagreement_score":0.9417549,"about_ca_system_score_codex":0.000058183494,"about_ca_system_score_gemma":0.0010697296,"threshold_uncertainty_score":0.9929268},"labels":[],"label_agreement":null},{"id":"W4407636625","doi":"10.2139/ssrn.5141959","title":"An Ordinal Solution to King Solomon's Dilemma","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Dilemma; Ordinal optimization; Ordinal data; Mathematical economics; Econometrics; Mathematics; Statistics; Epistemology; Philosophy","score_opus":0.06078329293703761,"score_gpt":0.4039954498344191,"score_spread":0.3432121568973815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407636625","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.35135797,0.00048428046,0.63491094,0.0062458897,0.0010735302,0.0004648234,0.000044230812,0.00010202812,0.005316282],"genre_scores_gemma":[0.9916208,0.00019076181,0.0010326216,0.000282872,0.0007636225,0.000047769594,0.000013049307,0.000017256316,0.006031241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942504,0.00060822605,0.0008934825,0.00085143535,0.0011176199,0.002278809],"domain_scores_gemma":[0.9970977,0.00035469013,0.0005519429,0.0011561993,0.0005697757,0.00026972333],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.012911232,0.00032069476,0.00046833194,0.0006728175,0.00071701314,0.00075075595,0.0028362903,0.00028317014,0.00018422141],"category_scores_gemma":[0.0008994694,0.0002669061,0.00031861107,0.0007283744,0.00007589787,0.00029057704,0.00069390296,0.0045755594,0.00033885217],"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.00014617445,0.00017368792,0.0012828502,0.000005615051,0.0001289094,0.000004037356,0.000551716,0.008699177,0.0012145236,0.7046677,0.0011552746,0.28197038],"study_design_scores_gemma":[0.0001691538,0.00018360284,0.0007116134,0.000056368513,0.000051725954,0.00011656693,0.0010923579,0.0012151308,0.0001374815,0.9842707,0.011710603,0.0002847319],"about_ca_topic_score_codex":0.0001341552,"about_ca_topic_score_gemma":0.0013010881,"teacher_disagreement_score":0.64026284,"about_ca_system_score_codex":0.0010660657,"about_ca_system_score_gemma":0.004602957,"threshold_uncertainty_score":0.9999783},"labels":[],"label_agreement":null},{"id":"W4408886485","doi":"10.3982/ecta21871","title":"Feedback Design in Dynamic Moral Hazard","year":2025,"lang":"en","type":"article","venue":"Econometrica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Moral hazard; Economics; Mathematical economics; Actuarial science; Econometrics; Control theory (sociology); Microeconomics; Incentive; Management","score_opus":0.12459154727680546,"score_gpt":0.3862326406229855,"score_spread":0.26164109334618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408886485","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.49223807,0.0007530761,0.13598609,0.005134344,0.0004647309,0.00050972856,0.000020763722,0.00010176241,0.36479142],"genre_scores_gemma":[0.9888309,0.000017218345,0.0024327952,0.00021071799,0.0000071375216,0.000035582252,0.0000010887945,0.0000035074097,0.008461055],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989725,0.000092538125,0.0003795803,0.00027819216,0.000113902024,0.00016328225],"domain_scores_gemma":[0.9979753,0.0014550708,0.000054655906,0.00043457234,0.00003399751,0.000046417343],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014302994,0.000071879855,0.00018055852,0.0015110553,0.000056320077,0.000120812794,0.00060898904,0.000043629203,0.0007416402],"category_scores_gemma":[0.00084716093,0.00006268931,0.000052384345,0.0049069026,0.000061338964,0.00014504758,0.00006830594,0.00008911233,0.0020709161],"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.00005028811,0.00028034276,0.049472924,0.0000064432593,0.000031626405,0.0000054533507,0.000277088,0.013233646,0.0001789233,0.2359675,0.052479837,0.6480159],"study_design_scores_gemma":[0.0002881,0.000020255793,0.20844746,0.000004383073,0.000003271976,7.6398095e-7,0.00017574121,0.016188847,0.00020067641,0.74449134,0.030061087,0.00011807489],"about_ca_topic_score_codex":0.0000026789994,"about_ca_topic_score_gemma":0.000010172524,"teacher_disagreement_score":0.64789784,"about_ca_system_score_codex":0.00007167256,"about_ca_system_score_gemma":0.000047025347,"threshold_uncertainty_score":0.9987061},"labels":[],"label_agreement":null},{"id":"W4409580887","doi":"10.54014/2ej6-eg29","title":"Opportunism and diversity in the lifestyle of a group II intron","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Genetics; Canadian Institutes of Health Research; National Institutes of Health","keywords":"Opportunism; Diversity (politics); Intron; Group (periodic table); Geography; Economics; Sociology; Biology; Anthropology; Physics; Market economy; Genetics; Gene","score_opus":0.10329005860420708,"score_gpt":0.3786744958380352,"score_spread":0.2753844372338281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409580887","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.928623,0.000050749437,0.00006299911,0.00045224227,0.000034103632,0.00017999446,0.000007765597,0.0000065710046,0.070582576],"genre_scores_gemma":[0.98772067,0.00003203592,0.00009177705,0.00018198407,0.000017367072,0.0000058604296,0.000044934248,0.0000019945353,0.011903385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880517,0.00012969587,0.00029447928,0.00022344849,0.0004666837,0.00008051654],"domain_scores_gemma":[0.9988993,0.0004648049,0.00019641466,0.00034382398,0.0000641701,0.00003150245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018624902,0.00008451351,0.0001855444,0.00014130963,0.00021559246,0.000033616234,0.00063173444,0.00009637671,0.00019997565],"category_scores_gemma":[0.00023053371,0.00004943704,0.00004854122,0.00029897658,0.00004942083,0.00008571177,0.0001007181,0.00013703298,0.000015476382],"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.00012320175,0.00043539584,0.003783565,0.000014858935,0.0000141942255,0.00000556089,0.019134326,0.0000037496366,0.0007748652,0.7507668,0.011434313,0.21350917],"study_design_scores_gemma":[0.00022642985,0.00011529736,0.45563138,0.000020972133,0.000026932688,0.000002597153,0.021507563,0.000035165478,0.000116842435,0.51258713,0.009590849,0.00013883722],"about_ca_topic_score_codex":0.00010870374,"about_ca_topic_score_gemma":0.0007771916,"teacher_disagreement_score":0.45184782,"about_ca_system_score_codex":0.0000048094603,"about_ca_system_score_gemma":0.000021955497,"threshold_uncertainty_score":0.2189593},"labels":[],"label_agreement":null},{"id":"W4409744385","doi":"10.1016/j.jtbi.2025.112129","title":"Positive and negative selective assortment","year":2025,"lang":"en","type":"article","venue":"Journal of Theoretical Biology","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Junta de Castilla y León; Agencia Estatal de Investigación; European Regional Development Fund; Ministerio de Universidades; Natural Sciences and Engineering Research Council of Canada; Universidad de Valladolid","keywords":"Biology; Computer science","score_opus":0.02407301883776324,"score_gpt":0.3968736235685551,"score_spread":0.37280060473079185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409744385","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.8565277,0.00027569005,0.056128796,0.0203841,0.00030926702,0.00017486367,0.00002351258,0.0000073079736,0.06616877],"genre_scores_gemma":[0.99794644,0.000018743425,0.0010043111,0.000776822,0.000040919032,0.0000021401345,2.6953796e-7,0.0000016089101,0.00020872668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985948,0.00055884296,0.00043579604,0.00014991878,0.0001399179,0.00012071183],"domain_scores_gemma":[0.99354196,0.005595372,0.00022741748,0.00012183662,0.00044186562,0.00007154077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021394736,0.00007018332,0.00026304316,0.00017099756,0.0000815632,0.000034809378,0.00029298026,0.00007470086,0.00021566516],"category_scores_gemma":[0.004646228,0.00004014544,0.00008153712,0.00033245143,0.00094076403,0.00005266292,0.00009364278,0.00020256049,0.000021720332],"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.00015264087,0.00004353536,0.0010955766,3.0662324e-7,0.00004825894,0.0000018447528,0.00015288472,0.0000019240335,0.0022558125,0.9798916,0.0005750186,0.015780585],"study_design_scores_gemma":[0.00025699253,0.00029672752,0.008496092,0.000009111882,0.000026189426,0.000029201554,0.00031381572,0.000042557516,0.009640241,0.97947145,0.0013800018,0.000037621667],"about_ca_topic_score_codex":7.0945214e-7,"about_ca_topic_score_gemma":4.718675e-7,"teacher_disagreement_score":0.14141876,"about_ca_system_score_codex":0.000028218927,"about_ca_system_score_gemma":0.00005859604,"threshold_uncertainty_score":0.5562305},"labels":[],"label_agreement":null},{"id":"W4410061237","doi":"10.1007/978-981-96-4448-3_9","title":"Computing Approximate Mixed Nash Equilibria for Symmetric Weighted Congestion Games","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Windsor","funders":"","keywords":"Computer science; Nash equilibrium; Mathematical economics; Mathematical optimization; Mathematics","score_opus":0.05310495471577022,"score_gpt":0.33757603979365974,"score_spread":0.28447108507788954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410061237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015073288,0.00033079067,0.9845809,0.0007829319,0.0017674802,0.0010084775,0.000049600156,0.0001368513,0.009835677],"genre_scores_gemma":[0.70959574,0.000019260362,0.2836042,0.0010869855,0.00070932263,0.0000462393,0.00004134878,0.000046330384,0.0048505557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949903,0.00012429291,0.0010607959,0.0018467145,0.0013544412,0.00062349485],"domain_scores_gemma":[0.98728335,0.009795322,0.00062396034,0.0013538233,0.0007896742,0.00015389116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055244034,0.0004811147,0.00077192154,0.002020591,0.0005637971,0.00082982663,0.0030273306,0.0003645465,0.00005429174],"category_scores_gemma":[0.0023727329,0.00039181495,0.0002398857,0.002280894,0.00094215095,0.00029652673,0.0009640226,0.00064558507,0.00007023887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019064537,0.000024404588,0.000029976982,0.000028033954,0.000010441884,0.0000028395775,0.00016636928,0.004239075,0.00019841212,0.20279405,0.00024648535,0.79224086],"study_design_scores_gemma":[0.00023419084,0.000059075344,0.000102948616,0.0001913151,0.000015657533,0.000008965331,8.518827e-7,0.4054095,0.00085059914,0.58792853,0.004886734,0.0003116413],"about_ca_topic_score_codex":0.0000052317123,"about_ca_topic_score_gemma":0.00001695788,"teacher_disagreement_score":0.7919292,"about_ca_system_score_codex":0.00017094443,"about_ca_system_score_gemma":0.00045686078,"threshold_uncertainty_score":0.9998534},"labels":[],"label_agreement":null},{"id":"W4410464782","doi":"10.1007/978-3-031-92932-8_22","title":"On The Computational Complexity of Games with Uncertainty","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Victoria","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Asymptotic computational complexity; Computational resource; Algorithm","score_opus":0.08015998613908407,"score_gpt":0.33895224641011024,"score_spread":0.2587922602710262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410464782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014621781,0.000034074965,0.9720644,0.003963561,0.00018562168,0.0003623956,0.000047075075,0.000022658849,0.02185805],"genre_scores_gemma":[0.963609,0.0000018851181,0.032876737,0.0021016973,0.000069064,0.000009831917,0.000006545473,0.000008846162,0.0013164171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661195,0.00008736579,0.0005315718,0.0008315988,0.0017045907,0.00023290528],"domain_scores_gemma":[0.9894826,0.0084013995,0.00038982957,0.0011026153,0.00056518416,0.000058409623],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002239387,0.0002618076,0.00041414401,0.00048061466,0.00029302016,0.00019334223,0.0024712116,0.000103680155,0.00026317773],"category_scores_gemma":[0.00060811616,0.00013969163,0.000100658195,0.0008883977,0.003884153,0.00008396768,0.00038319052,0.00047613925,0.000046930898],"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.00002037062,0.000018726952,0.00002068059,0.0000035229934,0.000005914027,0.0000015003285,0.00017287866,0.28079954,0.000004635456,0.64474016,0.00014507015,0.074067004],"study_design_scores_gemma":[0.000098784236,0.0000879376,0.0003254854,0.00015757578,0.000005243447,0.0000049418154,0.0000011674678,0.10678181,0.00012329896,0.89140433,0.00086831435,0.00014109163],"about_ca_topic_score_codex":0.000012763832,"about_ca_topic_score_gemma":0.0000779461,"teacher_disagreement_score":0.9621468,"about_ca_system_score_codex":0.00007252702,"about_ca_system_score_gemma":0.0005025383,"threshold_uncertainty_score":0.9988267},"labels":[],"label_agreement":null},{"id":"W4410561822","doi":"10.1007/978-3-031-92898-7_2","title":"Analysis and Predictability of Centrality Measures in Competition Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Predictability; Computer science; Centrality; Competition (biology); Statistics; Mathematics","score_opus":0.03786166085489959,"score_gpt":0.3193094219697867,"score_spread":0.2814477611148871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561822","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.00697944,0.00022850763,0.99025774,0.0003029431,0.00016846035,0.0002593285,0.000027703805,0.000015001377,0.0017608614],"genre_scores_gemma":[0.9938952,0.000031450607,0.005783357,0.00013524265,0.00004318334,0.00000434196,0.00000588729,0.000003185495,0.00009819011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968677,0.00014792717,0.0008006865,0.0009902032,0.00094955973,0.0002439231],"domain_scores_gemma":[0.9960194,0.0023223069,0.00030476824,0.0009629287,0.0003128369,0.000077745346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852977,0.00020229307,0.00061291514,0.0010678519,0.00010058252,0.00013821488,0.0011178919,0.00019215225,0.000068490874],"category_scores_gemma":[0.0006807688,0.00016275974,0.00013133403,0.0021751586,0.0012911429,0.00014591051,0.00040415212,0.00039586096,0.0000016590965],"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.00003260818,0.00007192554,0.083315395,0.000022753564,0.000038580976,0.0000030268968,0.00050900975,0.2553662,0.000041154133,0.04771905,0.000006839079,0.61287344],"study_design_scores_gemma":[0.0001361377,0.000030118916,0.1118373,0.00011756798,0.000054307664,0.0000013865708,9.923745e-7,0.26788092,0.00015518047,0.6193979,0.00019393575,0.00019425557],"about_ca_topic_score_codex":0.000063858395,"about_ca_topic_score_gemma":0.0013143677,"teacher_disagreement_score":0.9869157,"about_ca_system_score_codex":0.0000832517,"about_ca_system_score_gemma":0.00016165662,"threshold_uncertainty_score":0.66371495},"labels":[],"label_agreement":null},{"id":"W4410603213","doi":"10.1177/00223433251330790","title":"Accounting for variability in conflict dynamics: A pattern-based predictive model","year":2025,"lang":"en","type":"article","venue":"Journal of Peace Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"European Research Council; Irish Research Council","keywords":"Dynamics (music); Psychology; Human factors and ergonomics; Poison control; Computer science; Econometrics; Medicine; Medical emergency; Economics","score_opus":0.23711086528910147,"score_gpt":0.5353805453574029,"score_spread":0.2982696800683014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410603213","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.29613686,0.00004226414,0.6964429,0.004140151,0.000049863276,0.0003326375,0.000032623415,0.000003938044,0.0028187605],"genre_scores_gemma":[0.99732876,0.0000062176787,0.0015495026,0.000083004605,0.000048454553,0.000037225098,8.9296674e-7,0.000004675243,0.0009412462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967312,0.0008448387,0.0007556342,0.00023871007,0.0011368504,0.00029276934],"domain_scores_gemma":[0.98526603,0.011954584,0.0002374845,0.00039045556,0.002072275,0.00007918059],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.041679453,0.00006872119,0.00024818818,0.00078543666,0.000162979,0.00017995115,0.00095890963,0.000073657684,0.000044225035],"category_scores_gemma":[0.015321455,0.000050980198,0.00012685466,0.0011069153,0.00016968856,0.00021473497,0.00010870481,0.00060014566,0.000008253817],"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.003437201,0.0023905318,0.18854782,0.00024114504,0.00014985302,0.000023131834,0.004298901,0.25274128,0.009209829,0.10996231,0.034539763,0.39445823],"study_design_scores_gemma":[0.000581344,0.000069430775,0.006167999,0.00006396395,0.000004998829,0.0000011580578,0.0011181806,0.81980455,0.0003065957,0.17048135,0.001361604,0.000038795242],"about_ca_topic_score_codex":0.000017712398,"about_ca_topic_score_gemma":0.000055027813,"teacher_disagreement_score":0.7011919,"about_ca_system_score_codex":0.0002786582,"about_ca_system_score_gemma":0.00082964957,"threshold_uncertainty_score":0.9929729},"labels":[],"label_agreement":null},{"id":"W4410914765","doi":"10.1007/978-3-031-95221-0_10","title":"Strength of Preference and Probabilistic Preference in the Graph Model for Conflict Resolution for Two Decision-Makers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Preference; Probabilistic logic; Conflict resolution; Resolution (logic); Graph; Computer science; Psychology; Artificial intelligence; Mathematics; Statistics; Sociology; Theoretical computer science; Social science","score_opus":0.11053771765324175,"score_gpt":0.34958579544034435,"score_spread":0.2390480777871026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410914765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018403525,0.0003103041,0.989972,0.00046246874,0.000062820225,0.002160586,0.00023835333,0.000021474096,0.0049316376],"genre_scores_gemma":[0.97690296,0.00006714519,0.021524873,0.00033006247,0.000030879964,0.0005492871,0.00017423951,0.000014185331,0.00040634227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974527,0.0000345342,0.0013368578,0.0003744703,0.0005815698,0.00021987758],"domain_scores_gemma":[0.99235815,0.004855794,0.000931171,0.0004801231,0.001346778,0.000027991933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988742,0.00029107556,0.00045852017,0.0007538249,0.0002178741,0.0002924122,0.000715757,0.000286715,0.000007854885],"category_scores_gemma":[0.0075921617,0.00019812776,0.00007189361,0.00066848914,0.0002532245,0.0008616792,0.000089001456,0.0002810488,0.0000011134908],"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.00033908203,0.000026333382,0.00002190419,0.0006524697,0.000006115666,6.15642e-8,0.003267397,0.19814831,0.000008720444,0.16504405,0.000066289555,0.6324193],"study_design_scores_gemma":[0.0005276559,0.000017594315,0.00016632458,0.0008256719,0.000025973723,0.0000012949828,0.000055539298,0.3530457,0.000020178713,0.64267755,0.002476634,0.00015987598],"about_ca_topic_score_codex":0.000008255501,"about_ca_topic_score_gemma":0.00024328427,"teacher_disagreement_score":0.9750626,"about_ca_system_score_codex":0.00005327794,"about_ca_system_score_gemma":0.00043863864,"threshold_uncertainty_score":0.90890753},"labels":[],"label_agreement":null},{"id":"W4410940438","doi":"10.3982/te5768","title":"Adversarial coordination and public information design","year":2025,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Università Bocconi; National Science Foundation","keywords":"Adversarial system; Public information; Computer science; Artificial intelligence; Internet privacy","score_opus":0.044069825739129105,"score_gpt":0.31873722397821014,"score_spread":0.27466739823908104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410940438","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.26395383,0.000010201204,0.6330751,0.013376872,0.00022784568,0.00027933496,0.000013230143,0.000047135458,0.0890164],"genre_scores_gemma":[0.9975023,0.000008096919,0.0015357363,0.0007254055,0.000023402068,0.000016085361,0.0000050306776,0.0000020001503,0.00018191649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916095,0.00012914946,0.00036266394,0.00014883764,0.0000745988,0.00012380234],"domain_scores_gemma":[0.998032,0.0014546845,0.000082753126,0.00026197807,0.00010111452,0.00006746771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002116831,0.00006584259,0.00012241716,0.00016963032,0.0001349649,0.0003302352,0.00028322331,0.000066873436,0.00041635075],"category_scores_gemma":[0.0020641675,0.000055061184,0.00002977682,0.00021199115,0.00045461862,0.00060509716,0.00009945078,0.00007062157,0.00034610042],"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.000031903583,0.000009525451,0.000066842855,6.9179515e-7,0.000004292452,1.8535486e-8,0.00006748965,0.00009885807,0.000011581078,0.9472221,0.0006320355,0.051854663],"study_design_scores_gemma":[0.00025731348,0.000015227019,0.00038893468,0.000001409111,0.000006120029,9.59411e-7,0.0003104371,0.026368074,0.00017060907,0.9561725,0.016253669,0.000054723405],"about_ca_topic_score_codex":9.759706e-7,"about_ca_topic_score_gemma":7.0642693e-7,"teacher_disagreement_score":0.73354846,"about_ca_system_score_codex":0.00003050869,"about_ca_system_score_gemma":0.00006755694,"threshold_uncertainty_score":0.4558749},"labels":[],"label_agreement":null},{"id":"W4410940443","doi":"10.3982/te5653","title":"Random utility coordination games on networks","year":2025,"lang":"en","type":"article","venue":"Theoretical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Coordination game; Computer science; Mathematical economics; Microeconomics; Economics","score_opus":0.032665760754034164,"score_gpt":0.3411353277044809,"score_spread":0.30846956695044675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410940443","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.50123304,0.000025823629,0.15060735,0.007631842,0.0003430295,0.00027364638,0.000014076693,0.00006250395,0.3398087],"genre_scores_gemma":[0.9966924,0.000012694493,0.00014795345,0.0013271453,0.000057961603,0.000024877576,0.000004494178,0.000005146856,0.0017273119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986371,0.0002310647,0.00046831934,0.0003808229,0.000096398304,0.0001863185],"domain_scores_gemma":[0.99500144,0.0040897303,0.00008872032,0.0006645222,0.00007882681,0.00007675768],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031190992,0.000108000335,0.00025215934,0.000104444836,0.00014856647,0.00015260419,0.0005515103,0.000095150004,0.0017345215],"category_scores_gemma":[0.001642244,0.00008376533,0.000113277936,0.00025870517,0.0006961516,0.00007867902,0.00009748081,0.00015841915,0.000532789],"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.0002112499,0.000045271678,0.00014806296,5.3065247e-7,0.0000073119936,1.04148135e-7,0.000021475855,0.0017649261,0.000003971951,0.9454739,0.0016851723,0.050637983],"study_design_scores_gemma":[0.0004782295,0.000018708672,0.0013825073,0.000004466638,0.000008738323,4.0626844e-7,0.00007755762,0.10388806,0.00021381352,0.8818248,0.012031802,0.00007089965],"about_ca_topic_score_codex":8.220386e-7,"about_ca_topic_score_gemma":0.0000016916802,"teacher_disagreement_score":0.49545938,"about_ca_system_score_codex":0.000032930573,"about_ca_system_score_gemma":0.000036475198,"threshold_uncertainty_score":0.99917805},"labels":[],"label_agreement":null},{"id":"W4410957032","doi":"10.1007/978-3-031-95221-0_8","title":"Redefining Sequential Stability for Multi-decision-Maker Conflict Within Graph Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Stability (learning theory); Decision maker; Computer science; Graph; Artificial intelligence; Operations research; Mathematics; Theoretical computer science; Machine learning","score_opus":0.14047725836331842,"score_gpt":0.37610008143217993,"score_spread":0.2356228230688615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410957032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032998837,0.00024508662,0.9731076,0.0005050887,0.00039885263,0.0010343377,0.00026944364,0.00013025141,0.023979366],"genre_scores_gemma":[0.60671496,0.00007800748,0.3789995,0.0037790479,0.00027582946,0.0005555718,0.0010086211,0.00012206815,0.008466382],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953983,0.000040359664,0.0023971533,0.0006812493,0.0011131502,0.00036977636],"domain_scores_gemma":[0.9928779,0.0019078869,0.0015718864,0.0008929522,0.0026638994,0.000085444764],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003073799,0.00055008614,0.00078479934,0.0011987613,0.00057010376,0.0009379067,0.0009531198,0.000757863,0.00017387983],"category_scores_gemma":[0.008894763,0.00045313238,0.00022014794,0.0009456407,0.00030455852,0.0018507859,0.00023742625,0.0006638821,0.00004999137],"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.00037484383,0.000043854336,0.000040240186,0.00045318258,0.000026014957,9.295111e-7,0.004145073,0.28615132,0.00005360598,0.09489333,0.00023734597,0.6135802],"study_design_scores_gemma":[0.000751064,0.0000101445185,0.000032139425,0.0007744625,0.000047171612,0.000004435501,0.00007113511,0.38748518,0.0003195274,0.5951778,0.014821882,0.00050506135],"about_ca_topic_score_codex":0.0000075899447,"about_ca_topic_score_gemma":0.000077892524,"teacher_disagreement_score":0.6130752,"about_ca_system_score_codex":0.00016342291,"about_ca_system_score_gemma":0.0009604824,"threshold_uncertainty_score":0.99979204},"labels":[],"label_agreement":null},{"id":"W4411349214","doi":"10.1007/s11238-025-10048-w","title":"Payment schemes for finitely repeated Prisoner’s Dilemma games","year":2025,"lang":"en","type":"article","venue":"Theory and Decision","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Prisoner's dilemma; Mathematical economics; Dilemma; Payment; Game theory; Superrationality; Mathematics; Economics; Actuarial science; Computer science; Law and economics; Finance","score_opus":0.0669329766000516,"score_gpt":0.4109754526165244,"score_spread":0.3440424760164728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411349214","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.65496176,0.00044593855,0.33907598,0.00047122667,0.00015995256,0.00037057995,0.000025538578,0.00005945824,0.004429578],"genre_scores_gemma":[0.98587525,0.000035771165,0.0049058944,0.0006326852,0.00004050898,0.00010581618,0.0000075414537,0.0000084200165,0.008388108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980024,0.00024525562,0.0005965598,0.0005620658,0.00037604853,0.00021766384],"domain_scores_gemma":[0.98318046,0.0155696,0.00014463531,0.00076890684,0.00024563592,0.00009075159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066279816,0.000156006,0.00028449777,0.00025951874,0.00040120873,0.00022806517,0.0005030103,0.00009713019,0.00031416587],"category_scores_gemma":[0.0076325,0.00010434316,0.00011860712,0.00059829775,0.00018168284,0.00018404056,0.00020850638,0.00009771735,0.00012515586],"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.0006532171,0.00004665822,0.00020495882,0.0000027142967,0.000009924403,5.187868e-7,0.00010829501,0.000012673155,0.00076905056,0.5992056,0.0046554175,0.39433095],"study_design_scores_gemma":[0.00049082685,0.000054621058,0.0020772477,0.000036789497,0.000017758555,0.0000019700494,0.00034401886,0.000277932,0.003642042,0.7850515,0.20790768,0.00009757637],"about_ca_topic_score_codex":0.000001250593,"about_ca_topic_score_gemma":0.0000016556415,"teacher_disagreement_score":0.39423335,"about_ca_system_score_codex":0.000013693755,"about_ca_system_score_gemma":0.00004169004,"threshold_uncertainty_score":0.9137367},"labels":[],"label_agreement":null},{"id":"W4411716789","doi":"10.32920/29425682.v1","title":"Deep Agreements","year":2025,"lang":"en","type":"preprint","venue":"","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":"Ted Rogers Centre for Heart Research","funders":"","keywords":"Business","score_opus":0.18046069251367772,"score_gpt":0.4657263154414245,"score_spread":0.2852656229277468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411716789","genre_codex":"other","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.0060550566,0.000058973532,0.23785427,0.0016530909,0.0005258761,0.00025721066,0.0000249213,0.00006715881,0.75350344],"genre_scores_gemma":[0.5836197,0.000013000772,0.0069000507,0.0011108414,0.0000887983,0.000107468884,0.000017250892,0.0000037426546,0.40813914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821836,0.00010871902,0.0004269335,0.0005236831,0.0005994517,0.00012282547],"domain_scores_gemma":[0.997662,0.0005891687,0.00014227383,0.0013605072,0.00018868738,0.00005734876],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012907584,0.00011646334,0.00020393108,0.00017300626,0.00008610162,0.00020592622,0.001623199,0.00012702569,0.00669586],"category_scores_gemma":[0.00057654385,0.00008142001,0.00013318541,0.00030104388,0.000050689643,0.00003404514,0.0016290426,0.00022801025,0.0036489612],"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.00000958125,0.00012110788,0.0013346168,0.000012516491,0.00004904293,0.0000014774947,0.00043390435,0.002954465,0.000034560973,0.6545986,0.088978514,0.2514716],"study_design_scores_gemma":[0.00004590087,0.0000025448835,0.0010985566,0.000010257983,0.000009368208,1.9958712e-7,0.00017227417,0.002376328,0.00018702101,0.9010871,0.094919235,0.00009123484],"about_ca_topic_score_codex":0.00001725491,"about_ca_topic_score_gemma":0.00003586475,"teacher_disagreement_score":0.57756466,"about_ca_system_score_codex":0.000016953985,"about_ca_system_score_gemma":0.00007797069,"threshold_uncertainty_score":0.9971268},"labels":[],"label_agreement":null},{"id":"W4411946002","doi":"10.1145/3736252.3742506","title":"Anonymous Network Formation","year":2025,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Social Sciences and Humanities Research Council of Canada; Fonds de Recherche du Québec-Société et Culture; Israel Science Foundation","keywords":"Computer science; Computer network","score_opus":0.08844079554847026,"score_gpt":0.42464373779327047,"score_spread":0.3362029422448002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411946002","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026812412,0.00002372817,0.35918722,0.0023079778,0.00010438368,0.00007331119,6.294699e-7,0.000045840672,0.61144453],"genre_scores_gemma":[0.9364333,0.0000013464677,0.0014880571,0.0011374614,0.000030106306,0.000010649338,9.779391e-7,7.8231903e-7,0.060897306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994197,0.00004455571,0.00019323196,0.00010094143,0.00015927167,0.00008233025],"domain_scores_gemma":[0.9991709,0.00042079357,0.00003438209,0.0002860019,0.00006927119,0.000018652821],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009481846,0.00002979992,0.000054710956,0.00005184534,0.00012761675,0.00008514035,0.00026675145,0.000019887406,0.0009106034],"category_scores_gemma":[0.00020899049,0.000019828165,0.000028182269,0.00069635804,0.000022705532,0.00014806609,0.000046427187,0.000029506113,0.0014607089],"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.000002745277,0.000006783863,0.00029932076,2.8648688e-7,0.0000010042296,6.22025e-8,0.000028833661,0.00039121474,0.00009137279,0.79442173,0.14817443,0.0565822],"study_design_scores_gemma":[0.00004262097,0.0000029963007,0.0022919606,0.0000015270099,0.0000014885521,5.2015304e-7,0.00013260843,0.0019334771,0.0005561441,0.7302809,0.2647336,0.00002216313],"about_ca_topic_score_codex":0.0000016655755,"about_ca_topic_score_gemma":0.0000128814845,"teacher_disagreement_score":0.9096209,"about_ca_system_score_codex":0.000005941434,"about_ca_system_score_gemma":0.000013231714,"threshold_uncertainty_score":0.99931675},"labels":[],"label_agreement":null},{"id":"W4412368978","doi":"10.1007/s10458-025-09714-8","title":"Diversity-seeking jump games in networks","year":2025,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","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":"Concordia University","funders":"","keywords":"Price of anarchy; Jump; Mathematical economics; Node (physics); Fraction (chemistry); Diversity (politics); Class (philosophy); Computer science; Function (biology); Stability (learning theory); Mathematical optimization; Mathematics; Economics; Price of stability; Artificial intelligence","score_opus":0.09937112948378411,"score_gpt":0.3655412427002712,"score_spread":0.2661701132164871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412368978","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.8917679,0.0011974329,0.09986929,0.00034831755,0.0012722283,0.0007716287,0.00001324417,0.00007825922,0.0046816664],"genre_scores_gemma":[0.98395276,0.00005393155,0.00009389504,0.00027466644,0.000041469335,0.000037723108,0.0000035720873,0.0000068427225,0.015535158],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980151,0.00023905507,0.0005981201,0.0005432017,0.0002970545,0.00030748826],"domain_scores_gemma":[0.998779,0.00037424042,0.00018315269,0.0004843601,0.00007537062,0.000103872044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017837546,0.0001659656,0.00033611624,0.00031022762,0.0007214989,0.00022666324,0.0005552181,0.00010242755,0.000058007343],"category_scores_gemma":[0.00014027402,0.00013423055,0.00007785756,0.00056351,0.000086576336,0.00016350092,0.00083471043,0.00014530921,0.00009120572],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432764,0.00057101774,0.83719105,0.000064827924,0.00014255242,0.000055274053,0.008407103,0.035505075,0.00031567918,0.04305447,0.010722386,0.063926265],"study_design_scores_gemma":[0.0013226789,0.000024167663,0.47874376,0.0001469391,0.00003718134,0.000006811028,0.0038981114,0.3802756,0.000024642786,0.0014358882,0.13374752,0.0003366795],"about_ca_topic_score_codex":0.0005183255,"about_ca_topic_score_gemma":0.00010011575,"teacher_disagreement_score":0.35844725,"about_ca_system_score_codex":0.00007434049,"about_ca_system_score_gemma":0.000032367727,"threshold_uncertainty_score":0.5549259},"labels":[],"label_agreement":null},{"id":"W4412617786","doi":"10.55016/ojs/cdm.v12i1.62435","title":"Characterizations and algorithms for generalized Cops and Robbers games","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.08899808708330083,"score_gpt":0.4303909892209791,"score_spread":0.3413929021376783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617786","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.16158059,0.000074477844,0.8172756,0.016392589,0.00011745077,0.0011902844,0.002216246,0.000053139927,0.001099609],"genre_scores_gemma":[0.9450436,0.00004463363,0.049279504,0.00026076217,0.00012238864,0.00048806946,0.00006181397,0.000019036108,0.0046801604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987432,0.000045184166,0.0004290482,0.00032812016,0.00022633941,0.00022810764],"domain_scores_gemma":[0.9973416,0.00088097487,0.00028839588,0.00087173126,0.00040623138,0.00021106456],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012693346,0.00013776301,0.00031703353,0.00009602767,0.0014687653,0.0009196188,0.00046958763,0.000062944164,0.000046689827],"category_scores_gemma":[0.006573763,0.000106452586,0.00006585388,0.00011889801,0.00027434935,0.00027100605,0.00022084812,0.000056481607,0.00004400125],"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.000013555201,0.000054819167,0.00023197885,0.000017456898,0.000035196434,5.4708426e-7,0.0011357295,0.000014524619,0.0044388915,0.98203754,0.0033247254,0.0086950315],"study_design_scores_gemma":[0.0013739959,0.00008366604,0.009319659,0.00006192765,0.00015645676,0.000025306983,0.0008464204,0.0307083,0.0021633743,0.87223923,0.08260225,0.00041941565],"about_ca_topic_score_codex":0.0000037653751,"about_ca_topic_score_gemma":0.000007940761,"teacher_disagreement_score":0.78346306,"about_ca_system_score_codex":0.000017320988,"about_ca_system_score_gemma":0.000032680946,"threshold_uncertainty_score":0.9998312},"labels":[],"label_agreement":null},{"id":"W4412990244","doi":"10.1073/pnas.2504339122","title":"The evolution of zero-sum and positive-sum worldviews","year":2025,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Air Force Research Laboratory; Army Research Office; Agence Nationale de la Recherche; Air Force Office of Scientific Research; John Templeton Foundation","keywords":"Conformity; Population; Matching (statistics); Social psychology; Economics; Hostility; Microeconomics; Psychology; Sociology; Mathematics","score_opus":0.07157633389227887,"score_gpt":0.38987997700908167,"score_spread":0.3183036431168028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412990244","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.92199004,0.0009413832,0.00008828374,0.019854885,0.000040870324,0.00032722953,0.0000264086,0.000007673277,0.05672324],"genre_scores_gemma":[0.9974457,0.00003657122,0.00046925063,0.00014111331,0.000016491986,0.000009812989,2.6665859e-8,0.0000011389363,0.0018798662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977386,0.00002588794,0.0005398503,0.00024279028,0.0013386754,0.00011420908],"domain_scores_gemma":[0.9973049,0.0014123681,0.00062415004,0.00002064997,0.0006149594,0.00002295632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006779457,0.00006893282,0.0001527741,0.00021370294,0.00052611466,0.00005906176,0.001466302,0.00004769151,0.0000075396524],"category_scores_gemma":[0.003057887,0.0000342274,0.00007435942,0.0021384333,0.0022092657,0.0003549733,0.0002636188,0.0001160226,0.000002245841],"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.000012954584,0.000020162655,0.005225386,0.000006389843,0.0000064112223,2.8156888e-10,0.000114969276,0.000019022435,0.06564873,0.92363894,0.001801816,0.0035051922],"study_design_scores_gemma":[0.00006554672,0.000013589239,0.14499308,0.000050077313,0.000008076984,0.000001040279,0.00054877467,0.00046358717,0.050986897,0.80134946,0.0014883003,0.000031554744],"about_ca_topic_score_codex":0.000006762462,"about_ca_topic_score_gemma":2.9676974e-7,"teacher_disagreement_score":0.13976769,"about_ca_system_score_codex":0.000027733236,"about_ca_system_score_gemma":0.00005782071,"threshold_uncertainty_score":0.8140131},"labels":[],"label_agreement":null},{"id":"W4413184967","doi":"10.55016/ojs/cdm.v6i1.62094","title":"Partially critical tournaments and partially critical supports","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.09823530041768298,"score_gpt":0.4256145755361205,"score_spread":0.3273792751184375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184967","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.07709827,0.00008706344,0.89100665,0.012480418,0.00033744448,0.0007229789,0.0007006224,0.00015358817,0.017412947],"genre_scores_gemma":[0.98058945,0.00000421187,0.018036883,0.0004304274,0.00009363408,0.00013070718,0.0000072794387,0.000016718532,0.0006907162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970505,0.00019280484,0.00097433495,0.0004889569,0.0007272419,0.0005661299],"domain_scores_gemma":[0.99517214,0.0024070423,0.00011169878,0.00087168685,0.0007494407,0.00068798516],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002396105,0.00021736744,0.00041686257,0.00014355924,0.0005192516,0.00035549,0.0005853149,0.00011496757,0.0019446053],"category_scores_gemma":[0.02256269,0.00016971974,0.00012703126,0.00044380344,0.0005310103,0.0003270935,0.00031206536,0.00018579798,0.001219732],"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.000020374988,0.0002696596,0.00038672957,0.000010006158,0.000016731039,0.00001839104,0.0017174073,0.0000031529478,0.000560348,0.9919776,0.0040027453,0.0010168529],"study_design_scores_gemma":[0.00025367326,0.00014947401,0.0022856211,0.000051705556,0.00010749974,0.000067390254,0.0011189107,0.0014034897,0.0025606945,0.9813394,0.0103592295,0.00030290647],"about_ca_topic_score_codex":0.000004310001,"about_ca_topic_score_gemma":0.000018119654,"teacher_disagreement_score":0.90349114,"about_ca_system_score_codex":0.000037243524,"about_ca_system_score_gemma":0.00009739487,"threshold_uncertainty_score":0.9995579},"labels":[],"label_agreement":null},{"id":"W4413477157","doi":"10.1007/978-3-031-84869-8_32","title":"Algebraic Structure and Complexity of Games","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Mathematics; Algebraic number; Algebraic structure; Computer science; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.08452569229232898,"score_gpt":0.34328184683374524,"score_spread":0.25875615454141626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477157","genre_codex":"other","genre_gemma":"methods","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.012862202,0.0007300667,0.055248946,0.00043048817,0.00033630914,0.0018904088,0.004157812,0.0001151284,0.9242286],"genre_scores_gemma":[0.086133264,0.0003000779,0.5849281,0.00011261537,0.00011109209,0.00002853255,0.000035840003,0.000098131815,0.32825238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707806,0.000008211473,0.0012807018,0.00054466195,0.0008645202,0.00022385114],"domain_scores_gemma":[0.9967588,0.0011746365,0.0009726157,0.00040954832,0.00060174434,0.000082655446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010815036,0.00035539508,0.0008739944,0.00047691102,0.00008212207,0.00015204042,0.0007538912,0.00025604802,0.0005242062],"category_scores_gemma":[0.0017700099,0.00030536207,0.00006755558,0.00015272472,0.0008036354,0.000082738945,0.00040730994,0.0004808309,0.000026553047],"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.0000057622005,0.000024865325,0.000089270005,0.0004972936,0.00002530319,0.0000017521787,0.0010659472,9.3101823e-7,0.000097510594,0.9898007,0.002110338,0.00628033],"study_design_scores_gemma":[0.00013656596,0.000024006058,0.00033755,0.0003910916,0.00006276264,0.000005903617,0.00022018551,0.00060463813,0.0002113399,0.9880473,0.009712649,0.00024598843],"about_ca_topic_score_codex":0.0000031107566,"about_ca_topic_score_gemma":0.000019055984,"teacher_disagreement_score":0.5959763,"about_ca_system_score_codex":0.00003984955,"about_ca_system_score_gemma":0.00008407994,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W4413724402","doi":"10.64628/aam.94unfejwk","title":"Survivor: Mathematical predictions of the big win","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Econometrics; Mathematical economics; Computer science; Economics","score_opus":0.25517154386635205,"score_gpt":0.43045613258397586,"score_spread":0.1752845887176238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413724402","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13146944,0.000045857665,0.16410218,0.0074102115,0.0016149331,0.0008515271,0.00031556573,0.0000913231,0.69409895],"genre_scores_gemma":[0.94996864,0.0000052813516,0.00077400706,0.00003971709,0.00011955886,0.00006052599,0.0000020395025,0.000007394334,0.049022865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772465,0.00021824811,0.0006344046,0.00038502627,0.00091144745,0.00012624548],"domain_scores_gemma":[0.9941194,0.001244697,0.00055726554,0.0037520244,0.00026209556,0.00006448218],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027957782,0.00013179574,0.00032328532,0.00008005124,0.00030469403,0.00020044591,0.0032289685,0.00017921413,0.0015717291],"category_scores_gemma":[0.0028869654,0.00006581684,0.00030721133,0.00014959989,0.0005163815,0.00004133902,0.0018382878,0.000359507,0.0005914923],"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.00000771365,0.0002593512,0.0019191849,0.00003091942,0.000056074008,2.909067e-7,0.0007174963,0.0008991587,0.00024887038,0.9588455,0.021930603,0.015084832],"study_design_scores_gemma":[0.00004454761,0.0000044509093,0.008108885,0.000043280757,0.00002597494,0.0000025222516,0.00016926468,0.0014302605,0.0005936181,0.9807481,0.008754121,0.00007494075],"about_ca_topic_score_codex":0.000039532602,"about_ca_topic_score_gemma":0.0000798466,"teacher_disagreement_score":0.81849915,"about_ca_system_score_codex":0.0000117147365,"about_ca_system_score_gemma":0.00017454641,"threshold_uncertainty_score":0.99934095},"labels":[],"label_agreement":null},{"id":"W4414594724","doi":"10.11647/obp.0490.16","title":"16. Preferences, profiles, games, and optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Open Book Publishers","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":"University of Toronto","funders":"","keywords":"Mathematical model; Process (computing); Work (physics); Optimization problem; Identification (biology)","score_opus":0.08378266343041525,"score_gpt":0.3410498473444951,"score_spread":0.2572671839140799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414594724","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021841781,0.0009974496,0.0043496736,0.0022268887,0.00023906822,0.0013985957,0.00013221482,0.00005841222,0.9905955],"genre_scores_gemma":[0.00018267233,0.00017745276,0.0038161834,0.0011815618,0.00007570545,0.00014884319,0.0002628389,0.00003163399,0.9941231],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969062,0.00010356901,0.00078035844,0.0011585501,0.0007925187,0.00025875427],"domain_scores_gemma":[0.9967708,0.00061912544,0.0005700243,0.0013314722,0.000498414,0.00021017816],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020565214,0.0003665852,0.00058396265,0.00038883858,0.0002979596,0.0069398065,0.0028913345,0.00041063435,0.01918164],"category_scores_gemma":[0.00070643134,0.00029823912,0.000103206476,0.00021223548,0.0003179632,0.0032306951,0.0012690917,0.00043362635,0.00031780975],"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.000016974318,0.000010518805,0.000010128141,0.000006645591,0.000026952895,9.1048935e-7,0.000035938683,0.00007544112,4.8961493e-7,0.35008353,0.5968446,0.052887864],"study_design_scores_gemma":[0.0001863854,0.000024005307,0.0000101326605,0.00008863362,0.000034560475,0.0000028091872,0.00008425853,0.00014289039,0.000005695085,0.24366686,0.7555026,0.00025121772],"about_ca_topic_score_codex":0.000046421348,"about_ca_topic_score_gemma":0.000042235595,"teacher_disagreement_score":0.15865795,"about_ca_system_score_codex":0.00009661328,"about_ca_system_score_gemma":0.0006095897,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W4414785154","doi":"10.1093/ej/ueaf102","title":"A Model Of Selection and Policy Concerns","year":2025,"lang":"en","type":"article","venue":"The Economic Journal","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":"Kellogg's (Canada)","funders":"Universidad Carlos III de Madrid; Ministerio de Ciencia, Innovación y Universidades","keywords":"Blame; Principal (computer security); Selection (genetic algorithm); Quality (philosophy); Principal–agent problem","score_opus":0.11808085437524345,"score_gpt":0.4142914677073884,"score_spread":0.29621061333214493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414785154","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.9629451,0.000044234046,0.015320141,0.005014491,0.000055624932,0.000039639017,0.000004827877,0.0000033893102,0.016572563],"genre_scores_gemma":[0.99624383,0.000031648906,0.00014554843,0.00017216368,0.00009115735,0.0000014695131,3.5998333e-8,0.0000013258153,0.0033128345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950963,0.00005741952,0.00025104606,0.00006906284,0.00004905879,0.000063797386],"domain_scores_gemma":[0.99938405,0.00029015398,0.00014520787,0.00012013479,0.000035154106,0.000025333133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014185322,0.00003210277,0.000085708336,0.00010650123,0.00016347745,0.00007172383,0.00026318585,0.000016025197,0.00012522291],"category_scores_gemma":[0.00013465302,0.000019375544,0.00003455015,0.000096538715,0.00008136155,0.000087151086,0.000040392555,0.0000884815,0.000032008098],"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.000025665431,0.000007178388,0.0009993031,6.163416e-7,0.000020837135,2.8177071e-8,0.00058430375,0.04179888,0.0025569836,0.9204466,0.00398702,0.02957264],"study_design_scores_gemma":[0.0001198443,0.0000072374737,0.0009932888,0.0000027330136,0.0000057147968,0.000016446902,0.0002653599,0.109813124,0.0007483519,0.8859886,0.0020202645,0.000019025469],"about_ca_topic_score_codex":0.000014519172,"about_ca_topic_score_gemma":0.000018108267,"teacher_disagreement_score":0.06801424,"about_ca_system_score_codex":0.000044495086,"about_ca_system_score_gemma":0.00024051852,"threshold_uncertainty_score":0.13711031},"labels":[],"label_agreement":null},{"id":"W4415183496","doi":"10.1016/j.automatica.2025.112643","title":"On linear quadratic potential games","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Nash equilibrium; Potential game; Action (physics); Class (philosophy); Convergence (economics); Quadratic equation; Best response; Set (abstract data type)","score_opus":0.03962225223216166,"score_gpt":0.4028065365741275,"score_spread":0.36318428434196587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415183496","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.7389399,0.00004455811,0.09011322,0.0130895795,0.00042888641,0.000323561,0.000009186988,0.00028890994,0.15676224],"genre_scores_gemma":[0.98272824,0.0000012297562,0.002060956,0.0010753823,0.000026734147,0.000027043081,0.0000013667893,0.000003946021,0.014075111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986745,0.00013325748,0.00037191866,0.0002480874,0.00043002338,0.0001421909],"domain_scores_gemma":[0.99773115,0.0013938927,0.000075647535,0.0006761889,0.00007473573,0.00004835848],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000851302,0.000083165585,0.0001609012,0.00016300056,0.00016149446,0.000116038376,0.00052823895,0.00004431289,0.0011201007],"category_scores_gemma":[0.0017090803,0.00005821731,0.00007932559,0.0006081347,0.000094961375,0.00007349307,0.00006749618,0.00008633225,0.005601141],"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.00001159805,0.000121308585,0.000056423563,0.000004287973,0.000015389063,0.000002707052,0.00018170138,0.00045726413,0.0006069839,0.91745347,0.031212568,0.04987631],"study_design_scores_gemma":[0.00016127092,0.000032816402,0.005950833,0.000024541077,0.000014864833,0.0000011291302,0.00017347808,0.046079297,0.0011648891,0.9338219,0.012496417,0.00007854549],"about_ca_topic_score_codex":0.0000019112026,"about_ca_topic_score_gemma":0.0000014246524,"teacher_disagreement_score":0.24378838,"about_ca_system_score_codex":0.00001132733,"about_ca_system_score_gemma":0.000050774113,"threshold_uncertainty_score":0.999793},"labels":[],"label_agreement":null},{"id":"W4415209079","doi":"10.3390/g16050054","title":"Classifying Limited-Move Stability Cycles in 2 × 2 Games","year":2025,"lang":"en","type":"article","venue":"Games","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Ranking (information retrieval); Graph; Stability (learning theory); Preference; Repeated game; Coordination game; Game theory","score_opus":0.11404345869004419,"score_gpt":0.40458710152266497,"score_spread":0.2905436428326208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415209079","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.9356963,0.0003484274,0.0022261015,0.0037548475,0.00021800617,0.00019781957,0.0000145027825,0.00007451681,0.05746945],"genre_scores_gemma":[0.9944561,0.000021316153,0.00043546822,0.00049630314,0.000026193318,0.000049561655,0.0000019538288,0.0000047370877,0.004508361],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809176,0.00025915282,0.00053369993,0.0004887986,0.00037980574,0.0002467999],"domain_scores_gemma":[0.9967808,0.0021511116,0.00010301409,0.00079823745,0.00010978705,0.00005706431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026849,0.00011958836,0.00025069067,0.0002963205,0.00010475604,0.00016877278,0.00066167465,0.0000798064,0.0005416902],"category_scores_gemma":[0.0024952493,0.00009298669,0.00009509817,0.0012857686,0.00021148854,0.00020338024,0.00017565828,0.00018430653,0.0003259961],"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.000068666974,0.000297457,0.24411336,0.000018011244,0.000018613975,0.0000047116205,0.0022004778,0.00017741405,0.004512877,0.32209593,0.010229942,0.41626254],"study_design_scores_gemma":[0.00021981438,0.000009400486,0.37438148,0.000029559767,0.000005639558,7.771222e-7,0.003572227,0.0005259727,0.0054744403,0.55155635,0.06410529,0.00011902019],"about_ca_topic_score_codex":0.000025521134,"about_ca_topic_score_gemma":0.0001284103,"teacher_disagreement_score":0.4161435,"about_ca_system_score_codex":0.000046933386,"about_ca_system_score_gemma":0.0000786663,"threshold_uncertainty_score":0.59311277},"labels":[],"label_agreement":null},{"id":"W4415653858","doi":"10.1016/j.geb.2025.10.007","title":"Robust implementation with peer mechanisms and evidence","year":2025,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Class (philosophy); Function (biology); Limit (mathematics); Face (sociological concept); Principal (computer security); Value (mathematics)","score_opus":0.13319639062844002,"score_gpt":0.39706324065990833,"score_spread":0.2638668500314683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415653858","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.9900865,0.000117910655,0.007205661,0.0018707383,0.000059093352,0.00019881134,0.0000137196685,0.000013101211,0.0004344696],"genre_scores_gemma":[0.9940476,0.000031683605,0.0019601798,0.00014599902,0.000010249954,0.00008632945,0.0000017227507,0.0000030214483,0.003713235],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993099,0.00002433037,0.00020154189,0.00028997118,0.000076863085,0.00009740278],"domain_scores_gemma":[0.99946934,0.00017316778,0.00007094712,0.00020431861,0.000037434973,0.000044809585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007098282,0.0000681155,0.000112280024,0.000071254566,0.000121263016,0.00020563767,0.00012625991,0.000025278208,0.0004695676],"category_scores_gemma":[0.000022630182,0.000050376857,0.000016266848,0.0000628276,0.00007040929,0.00023895646,0.000065013155,0.000039107752,0.00004341756],"study_design_candidate":"observational","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.00006118933,0.000044538287,0.16002257,0.000009302669,0.000019926672,0.0000021667156,0.0009001899,0.00015657872,0.002146065,0.28713322,0.0041468455,0.5453574],"study_design_scores_gemma":[0.0009048396,0.00015754711,0.8818185,0.000051828232,0.00016620824,0.0000325247,0.011222597,0.00075102603,0.0032303436,0.08938114,0.011960235,0.00032325575],"about_ca_topic_score_codex":0.00007194764,"about_ca_topic_score_gemma":0.0002446657,"teacher_disagreement_score":0.72179586,"about_ca_system_score_codex":0.000016165535,"about_ca_system_score_gemma":0.00003186903,"threshold_uncertainty_score":0.5141436},"labels":[],"label_agreement":null},{"id":"W4416018309","doi":"10.1093/jeea/jvaf038","title":"Revising Beliefs in Light of Unforeseen Events","year":2025,"lang":"en","type":"article","venue":"Journal of the European Economic Association","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Heidelberg; University of Glasgow; York University; University of Sussex; University of Warwick; Centre for Economic Policy Research","keywords":"Event (particle physics); Unexpected events; Motivated reasoning; Base (topology); Rare events","score_opus":0.02778563767861068,"score_gpt":0.3334396044680441,"score_spread":0.3056539667894334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416018309","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.87258726,0.000073546275,0.00037225956,0.006796741,0.00056601735,0.00008872306,0.000004846168,0.0000024777776,0.11950815],"genre_scores_gemma":[0.9913415,0.000016207767,0.00006213751,0.00009800943,0.00010119974,2.080277e-7,1.4106406e-7,0.0000036314211,0.008377017],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979092,0.00076863164,0.000962078,0.00007963606,0.0002007953,0.000079641104],"domain_scores_gemma":[0.99728936,0.00057371386,0.0017789418,0.00022534576,0.00011451651,0.00001809301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010290611,0.000046349185,0.00018675283,0.00017634712,0.000057249832,0.000036852918,0.0007147818,0.000022124188,0.00003200759],"category_scores_gemma":[0.0022076236,0.000030791256,0.0001417947,0.0002430826,0.000011953268,0.00019280842,0.00010392066,0.00013945038,0.00008780937],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006040828,0.00014935527,0.85123,0.0000106328835,0.00014619288,0.0000015082906,0.0018022164,0.008736708,0.0026261352,0.029449115,0.04673195,0.05905574],"study_design_scores_gemma":[0.00049186824,0.000014894099,0.8734085,0.0001361652,0.00001898595,0.0000018565796,0.00021476798,0.00014248735,0.0010564011,0.08594142,0.038522422,0.000050261664],"about_ca_topic_score_codex":0.0000023880148,"about_ca_topic_score_gemma":0.000009083552,"teacher_disagreement_score":0.11875421,"about_ca_system_score_codex":0.00030570573,"about_ca_system_score_gemma":0.00007039492,"threshold_uncertainty_score":0.35665408},"labels":[],"label_agreement":null},{"id":"W4416138593","doi":"10.3390/g16060059","title":"Linear Programming for Computing Equilibria Under Truncation Selection and Designing Defensive Strategies Against Malicious Opponents","year":2025,"lang":"en","type":"article","venue":"Games","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":"Queen's University","funders":"","keywords":"Minimax; Stochastic game; Truncation (statistics); Linear programming; Game theory; Replicator equation; Representation (politics); Selection (genetic algorithm)","score_opus":0.08656563917580605,"score_gpt":0.4076682094963147,"score_spread":0.32110257032050865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416138593","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.5878056,0.000069988804,0.41070193,0.00036552848,0.00006723586,0.00033193943,0.000002056135,0.000059518883,0.000596154],"genre_scores_gemma":[0.9780514,0.000005671951,0.021187998,0.00019695895,0.000056553043,0.000043674463,0.000009426796,0.000007326606,0.00044098118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988418,0.00010922777,0.0003256383,0.0003438732,0.00018580328,0.00019364414],"domain_scores_gemma":[0.99836934,0.0010101395,0.00014970505,0.0001600968,0.00027051504,0.000040180483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009948943,0.000104550876,0.0001594215,0.00016139136,0.00033264596,0.00035208472,0.00016797434,0.000060602546,0.000004511042],"category_scores_gemma":[0.00047149777,0.000089933936,0.000048775615,0.0004737782,0.0000703837,0.00023085384,0.000059338327,0.00007256049,0.000009865396],"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.000107777305,0.00008866361,0.0037603662,0.000047606027,0.00007371344,5.382878e-7,0.0024019564,0.01407092,0.07111884,0.19142215,0.00076486013,0.7161426],"study_design_scores_gemma":[0.0015171632,0.00019248422,0.022306094,0.00019108749,0.00010675524,0.000012370354,0.031503513,0.26174966,0.018416815,0.64626706,0.01720165,0.0005353389],"about_ca_topic_score_codex":0.0000070215624,"about_ca_topic_score_gemma":0.00001315983,"teacher_disagreement_score":0.7156073,"about_ca_system_score_codex":0.000024497795,"about_ca_system_score_gemma":0.00008144164,"threshold_uncertainty_score":0.36673996},"labels":[],"label_agreement":null},{"id":"W4416287897","doi":"10.2139/ssrn.5746462","title":"Contagious implementation in Prisoner's and other dilemmas","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Kellogg's (Canada)","funders":"","keywords":"Nash equilibrium; Best response; Epsilon-equilibrium; Equilibrium selection; Repeated game; Strategic dominance; Incentive; Strategy; Symmetric equilibrium","score_opus":0.03362413610762437,"score_gpt":0.392550992049518,"score_spread":0.3589268559418936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416287897","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.8971532,0.012868734,0.072570115,0.0063377847,0.00096970727,0.00208226,0.00016349646,0.00004225664,0.0078124665],"genre_scores_gemma":[0.9840407,0.0091423,0.00018157675,0.0004352305,0.00025091448,0.000097001495,0.000008007003,0.00002491994,0.0058193794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917802,0.0010566259,0.0020222408,0.001086585,0.0009391914,0.0031151173],"domain_scores_gemma":[0.99668884,0.0008667378,0.0012273019,0.0007414499,0.0002756635,0.00020000966],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.016196102,0.00052176864,0.00080189353,0.00087903196,0.00058198953,0.00065032276,0.0012966793,0.0003639115,0.0007227437],"category_scores_gemma":[0.0003043686,0.00046323155,0.00027629556,0.0008565482,0.00025757996,0.00029341332,0.00063480344,0.0058053504,0.00010649373],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016250765,0.00015099165,0.017325893,0.0000132852265,0.00019937624,0.0000032119992,0.0019520521,0.00020324209,0.00013709262,0.6763018,0.00013840952,0.30341217],"study_design_scores_gemma":[0.0017206753,0.00020903954,0.003281009,0.00011972167,0.000104024635,0.00022290196,0.01894369,0.00031542996,0.000112785274,0.9490065,0.025545117,0.00041909373],"about_ca_topic_score_codex":0.0007045442,"about_ca_topic_score_gemma":0.012094109,"teacher_disagreement_score":0.30299306,"about_ca_system_score_codex":0.0014695014,"about_ca_system_score_gemma":0.007233545,"threshold_uncertainty_score":0.99978197},"labels":[],"label_agreement":null},{"id":"W4416327393","doi":"10.1080/15295036.2025.2583282","title":"Clouding the sun: storing and distributing low-carbon games","year":2025,"lang":"en","type":"article","venue":"Critical Studies in Media Communication","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":"University of Calgary","funders":"","keywords":"Key (lock)","score_opus":0.22136808288570325,"score_gpt":0.5039301334244504,"score_spread":0.2825620505387471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416327393","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.94688416,0.014298784,0.0008863686,0.027917024,0.00033994013,0.00020211586,0.000003731639,0.000039404746,0.009428499],"genre_scores_gemma":[0.99838096,0.00085950084,0.00038333028,0.0001915176,0.000038373615,0.000081408194,0.0000018670465,0.0000031953025,0.000059869526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982903,0.00056111056,0.00044643984,0.00022757328,0.0002824164,0.00019213663],"domain_scores_gemma":[0.9739571,0.024851229,0.000057038505,0.00087846664,0.00022185325,0.000034274362],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.004391153,0.00008940305,0.0002159746,0.000072327624,0.0005740237,0.0000984242,0.00081471034,0.00004306253,0.0000070709284],"category_scores_gemma":[0.03414461,0.000059339975,0.000029337642,0.00068238034,0.0012472564,0.00009019346,0.00090488023,0.00030349594,0.000005685787],"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.000013816682,0.00005841169,0.01576932,0.000021536473,0.000019152685,7.7590687e-7,0.0072345575,0.000014780492,0.00026236853,0.9246564,0.0006074919,0.051341407],"study_design_scores_gemma":[0.00022268182,0.000008047919,0.035321545,0.00027333712,0.000029207162,0.0000015777077,0.048953857,0.0018461467,0.0005604914,0.9058446,0.006809299,0.0001291822],"about_ca_topic_score_codex":0.0000102416625,"about_ca_topic_score_gemma":0.00006574616,"teacher_disagreement_score":0.051496807,"about_ca_system_score_codex":0.00006846478,"about_ca_system_score_gemma":0.000015845413,"threshold_uncertainty_score":0.9739912},"labels":[],"label_agreement":null},{"id":"W4416381027","doi":"10.1017/9781108641784.008","title":"A Conformity Theory of Chilling Effects","year":2025,"lang":"","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"York University","funders":"","keywords":"Conformity; Scope (computer science); Personalization; Prospect theory; Compliance (psychology); Behaviour change","score_opus":0.04163847390103589,"score_gpt":0.2613451779621991,"score_spread":0.2197067040611632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416381027","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023747575,0.0003395558,0.03609603,0.00001972821,0.0004657068,0.0013432653,0.0007396587,0.00007915094,0.95854217],"genre_scores_gemma":[0.18419461,0.00018885637,0.00017022308,0.0000843235,0.000059358903,0.0000019477507,0.000016791562,0.000022922948,0.81526095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959801,0.00048419595,0.00091705617,0.0011895151,0.0009318481,0.00049731974],"domain_scores_gemma":[0.99059236,0.004939308,0.0012242973,0.0020584478,0.00085054256,0.00033507313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020083003,0.0006912448,0.0012908868,0.000713947,0.0007586015,0.000109689754,0.002702274,0.0006915249,0.000044897446],"category_scores_gemma":[0.00046757617,0.0007244668,0.000872197,0.000085044485,0.0019735,0.00022127932,0.0014283808,0.00089086604,0.00007161705],"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.00049957226,0.000044688066,0.0000063224174,0.00030635198,0.000302271,0.000049635757,0.00017971698,0.000011011465,0.00018408096,0.96315867,0.0010867488,0.034170926],"study_design_scores_gemma":[0.001686214,0.00018630941,0.000113883056,0.0013512062,0.0012206557,0.00001626237,0.00053770683,0.00033255733,0.010870933,0.010616531,0.9720699,0.0009978088],"about_ca_topic_score_codex":0.000053284653,"about_ca_topic_score_gemma":7.896416e-7,"teacher_disagreement_score":0.9709832,"about_ca_system_score_codex":0.00012269523,"about_ca_system_score_gemma":0.00042553616,"threshold_uncertainty_score":0.99952066},"labels":[],"label_agreement":null},{"id":"W4416605362","doi":"10.5256/f1000research.1000.r1028","title":"Referee report. For: An a posteriori measure of network modularity [v1; approved with reservations 2, http://f1000r.es/rs]","year":2013,"lang":"en","type":"article","venue":"Faculty of 1000 Research Ltd","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Measure (data warehouse); Modularity (biology); A priori and a posteriori; Key (lock)","score_opus":0.24371875592814268,"score_gpt":0.44645296746326707,"score_spread":0.2027342115351244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416605362","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.9601523,0.000050247025,0.012284925,0.014914549,0.00004609327,0.0023170295,0.00045027677,0.000058280937,0.009726247],"genre_scores_gemma":[0.9656336,0.000003597741,0.01232069,0.000039651528,0.000117839445,0.00044306598,0.00027937625,0.000026061087,0.021136135],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932418,0.0008983067,0.0010872167,0.0007873996,0.0033279771,0.0006573353],"domain_scores_gemma":[0.9845831,0.0015861993,0.0005193463,0.0024230024,0.01056168,0.00032669381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014825538,0.0001961849,0.00052949437,0.00028340085,0.0005295979,0.00021908115,0.0018540784,0.00018679441,0.00029880702],"category_scores_gemma":[0.0062542367,0.0001353609,0.00015526354,0.0019446214,0.0007546359,0.0006992591,0.0003405553,0.00046702233,0.000122055775],"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.002475706,0.0024824624,0.046570558,0.00026443673,0.00042432846,0.000020724401,0.005000513,0.003058745,0.17882684,0.28781813,0.4214696,0.051587984],"study_design_scores_gemma":[0.0021803542,0.0025381842,0.18421793,0.000303167,0.00005528491,0.000060752423,0.005768684,0.0071995035,0.011521873,0.47962156,0.30582145,0.00071126566],"about_ca_topic_score_codex":0.0010693588,"about_ca_topic_score_gemma":0.0012937298,"teacher_disagreement_score":0.19180344,"about_ca_system_score_codex":0.00005521405,"about_ca_system_score_gemma":0.00040762484,"threshold_uncertainty_score":0.7487357},"labels":[],"label_agreement":null},{"id":"W4416618002","doi":"10.5256/f1000research.1000.r1055","title":"Referee report. For: An a posteriori measure of network modularity [v1; approved with reservations 2, http://f1000r.es/rs]","year":2013,"lang":"en","type":"article","venue":"Faculty of 1000 Research Ltd","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Measure (data warehouse); Modularity (biology); A priori and a posteriori; Key (lock)","score_opus":0.24371875592814268,"score_gpt":0.44645296746326707,"score_spread":0.2027342115351244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416618002","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.9601523,0.000050247025,0.012284925,0.014914549,0.00004609327,0.0023170295,0.00045027677,0.000058280937,0.009726247],"genre_scores_gemma":[0.9656336,0.000003597741,0.01232069,0.000039651528,0.000117839445,0.00044306598,0.00027937625,0.000026061087,0.021136135],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932418,0.0008983067,0.0010872167,0.0007873996,0.0033279771,0.0006573353],"domain_scores_gemma":[0.9845831,0.0015861993,0.0005193463,0.0024230024,0.01056168,0.00032669381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014825538,0.0001961849,0.00052949437,0.00028340085,0.0005295979,0.00021908115,0.0018540784,0.00018679441,0.00029880702],"category_scores_gemma":[0.0062542367,0.0001353609,0.00015526354,0.0019446214,0.0007546359,0.0006992591,0.0003405553,0.00046702233,0.000122055775],"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.002475706,0.0024824624,0.046570558,0.00026443673,0.00042432846,0.000020724401,0.005000513,0.003058745,0.17882684,0.28781813,0.4214696,0.051587984],"study_design_scores_gemma":[0.0021803542,0.0025381842,0.18421793,0.000303167,0.00005528491,0.000060752423,0.005768684,0.0071995035,0.011521873,0.47962156,0.30582145,0.00071126566],"about_ca_topic_score_codex":0.0010693588,"about_ca_topic_score_gemma":0.0012937298,"teacher_disagreement_score":0.19180344,"about_ca_system_score_codex":0.00005521405,"about_ca_system_score_gemma":0.00040762484,"threshold_uncertainty_score":0.7487357},"labels":[],"label_agreement":null},{"id":"W4416685257","doi":"10.2139/ssrn.5785062","title":"Bayesian Persuasion without Commitment","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Persuasion; Communication source; Bayesian probability; Cheap talk; State (computer science); Bayesian inference; Credibility","score_opus":0.03809781883433339,"score_gpt":0.36652222890741454,"score_spread":0.32842441007308115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416685257","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.051192142,0.012086523,0.8481734,0.015128642,0.0039218254,0.002262464,0.0001203442,0.00013646635,0.066978216],"genre_scores_gemma":[0.89348584,0.017853329,0.0007972395,0.00039821316,0.00076924433,0.00008743529,0.000016592574,0.000040338025,0.08655174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858473,0.0018532441,0.0024859733,0.001706907,0.002441655,0.005664935],"domain_scores_gemma":[0.9933463,0.0010274164,0.0018613384,0.0023218729,0.0009039435,0.0005391705],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.024354208,0.00096630864,0.0013217401,0.00097027404,0.0024245018,0.0011543335,0.0045295204,0.0007296273,0.0020132903],"category_scores_gemma":[0.00083480903,0.00079746585,0.0012164424,0.0012596587,0.00048500948,0.0003760484,0.001604962,0.014060132,0.0010631992],"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":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00032799115,0.00051193684,0.0014033752,0.000019684008,0.00057278486,0.0000042503466,0.0011369098,0.0012660335,0.000120557626,0.6841993,0.0005885366,0.30984867],"study_design_scores_gemma":[0.0010823094,0.00041584377,0.00020837586,0.0003129535,0.00034793827,0.00044085778,0.012402494,0.0032177116,0.00012092997,0.9159516,0.0648085,0.0006904899],"about_ca_topic_score_codex":0.00010177371,"about_ca_topic_score_gemma":0.0006530324,"teacher_disagreement_score":0.8473761,"about_ca_system_score_codex":0.003863599,"about_ca_system_score_gemma":0.01894115,"threshold_uncertainty_score":0.99996036},"labels":[],"label_agreement":null},{"id":"W4416814142","doi":"10.1016/j.chaos.2025.117598","title":"Self-confirming Q-learning on unknown networks","year":2025,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Alberta","funders":"Wuhan University; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Convergence (economics); Consistency (knowledge bases); Function (biology); Process (computing); Complete information; Social network (sociolinguistics)","score_opus":0.043689443523310265,"score_gpt":0.391468734442258,"score_spread":0.3477792909189477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416814142","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.5132102,0.0004794289,0.045121673,0.005197499,0.0012361367,0.0007029281,0.000008803542,0.0006156564,0.4334277],"genre_scores_gemma":[0.98151964,0.000024456596,0.00031954344,0.0010323629,0.00025236933,0.00007312632,0.0000057836537,0.000014466694,0.016758265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757415,0.00031422303,0.00058770675,0.0006035992,0.0004845588,0.00043577352],"domain_scores_gemma":[0.99516463,0.0034142176,0.00022803202,0.0008650972,0.00018778414,0.0001402233],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002144752,0.00020454812,0.0003387045,0.0003017034,0.00064988184,0.00029960522,0.00084765727,0.00016150447,0.00059088226],"category_scores_gemma":[0.0015818679,0.00016695654,0.00017206959,0.0011628787,0.00011941439,0.00018872829,0.00018373813,0.0005162447,0.0013607118],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071816365,0.0004625076,0.004023546,0.0000150253345,0.000111303,0.000015465817,0.0016587633,0.0126232635,0.0014314671,0.7456627,0.016537704,0.21738645],"study_design_scores_gemma":[0.00030226173,0.00005776427,0.002926853,0.00006823292,0.000032230055,0.0000050993904,0.0011280807,0.028452897,0.0019458097,0.08125134,0.88355273,0.00027668674],"about_ca_topic_score_codex":0.0000074883746,"about_ca_topic_score_gemma":0.000005261327,"teacher_disagreement_score":0.86701506,"about_ca_system_score_codex":0.000050971415,"about_ca_system_score_gemma":0.000089447145,"threshold_uncertainty_score":0.9994168},"labels":[],"label_agreement":null},{"id":"W4416958545","doi":"10.1016/j.jmateco.2025.103209","title":"The pipeline externalities problem","year":2025,"lang":"en","type":"article","venue":"Journal of Mathematical Economics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Shapley value; Pipeline (software); Shadow price; Core (optical fiber); Transferable utility; Cooperative game theory; Externality; Set (abstract data type); Production (economics); Bellman equation","score_opus":0.06407532836068425,"score_gpt":0.372199913233345,"score_spread":0.30812458487266076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416958545","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.45709488,0.0004282342,0.314844,0.04004276,0.0004835306,0.00023367036,0.0000071542195,0.000013991892,0.18685177],"genre_scores_gemma":[0.94055176,0.00017141506,0.012894205,0.0008393461,0.00024293056,0.000008794883,1.18008906e-7,0.000008791655,0.04528266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984517,0.00006568515,0.0011315882,0.000080525904,0.00015964167,0.00011084517],"domain_scores_gemma":[0.99478763,0.0041362406,0.00049537135,0.00031548514,0.00020858273,0.00005670049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051065097,0.00006307045,0.0002311019,0.00007858131,0.00014849326,0.00028827044,0.0008452403,0.000031810454,0.00020120073],"category_scores_gemma":[0.0017131421,0.000032178978,0.00015358393,0.000117735784,0.00015339945,0.00014587925,0.000079473204,0.00014406268,0.00019543503],"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.000020425383,0.00003807441,0.000030652383,0.0000037754019,0.000014867363,4.3708286e-7,0.0001137274,0.00016765723,0.000019579034,0.96352226,0.007256899,0.028811658],"study_design_scores_gemma":[0.00011840463,0.000013079501,0.00005268204,0.00002057916,0.00001097567,0.000026139935,0.0007093652,0.0019037433,0.00023380613,0.9055493,0.09133282,0.000029111008],"about_ca_topic_score_codex":2.021185e-7,"about_ca_topic_score_gemma":0.0000016307044,"teacher_disagreement_score":0.48345688,"about_ca_system_score_codex":0.000027616863,"about_ca_system_score_gemma":0.00009258277,"threshold_uncertainty_score":0.27797985},"labels":[],"label_agreement":null},{"id":"W4417361426","doi":"10.1145/3785356","title":"The Role of Social Support and Influencers in Content Markets","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Economics and Computation","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":"University of Toronto","funders":"","keywords":"Influencer marketing; Context (archaeology); Currency; Dual (grammatical number); Face (sociological concept); Core (optical fiber); Content (measure theory)","score_opus":0.03977196310340644,"score_gpt":0.3213874610348901,"score_spread":0.28161549793148366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417361426","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.98644435,0.000030284215,0.009624854,0.002159376,0.00004256694,0.00010368414,0.0000098872,0.0000037201535,0.0015812521],"genre_scores_gemma":[0.9994741,0.00010323366,0.00015027716,0.00010503467,0.0000025618717,0.000014726036,8.1407035e-7,0.0000014733336,0.00014779886],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947274,0.000041927866,0.0002608047,0.0001291277,0.000039799103,0.000055622164],"domain_scores_gemma":[0.9990666,0.0007054126,0.000071319,0.00010410038,0.000037593676,0.000014958051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052048266,0.000041417985,0.00008442236,0.00009746967,0.00019413613,0.00006339579,0.00012213619,0.000026010883,0.000007592324],"category_scores_gemma":[0.000031084888,0.000032764157,0.000023235112,0.0001198207,0.00010406072,0.000078481215,0.000006448619,0.000048765916,0.0000028215477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005946677,0.000024844274,0.0008944546,0.0000010224951,0.000011045056,2.8036792e-8,0.00049765327,0.0028508157,0.00007644262,0.061689775,0.000009895212,0.93388456],"study_design_scores_gemma":[0.0005064586,0.000040991883,0.23488607,0.0000049098476,0.000012015224,0.0000012883443,0.0047696293,0.02276671,0.0007278624,0.72703785,0.009173493,0.00007270162],"about_ca_topic_score_codex":0.000014906007,"about_ca_topic_score_gemma":0.00007240278,"teacher_disagreement_score":0.93381184,"about_ca_system_score_codex":0.0000138548185,"about_ca_system_score_gemma":0.00002934991,"threshold_uncertainty_score":0.14931577},"labels":[],"label_agreement":null},{"id":"W5236415","doi":"","title":"A Mechanism for Forming Long-Term Coalitions of Customer and Vendor Personal Agents","year":2002,"lang":"en","type":"article","venue":"CAL [magazine] Certified Akers Laboratories","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":"University of Saskatchewan","funders":"","keywords":"Vendor; Term (time); Mechanism (biology); Business; Computer science; Marketing","score_opus":0.1340966759771136,"score_gpt":0.35982129028817467,"score_spread":0.22572461431106106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5236415","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.9862269,0.00024585117,0.006482329,0.0017846802,0.00044750384,0.0006845293,0.0010639748,0.00007866261,0.0029855317],"genre_scores_gemma":[0.99574405,0.00002276314,0.0007219203,0.0002347856,0.0001105661,0.00015279884,0.00002446354,0.000020244523,0.0029684214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804896,0.0000830263,0.0005685648,0.00045079825,0.0005238548,0.0003248082],"domain_scores_gemma":[0.99762714,0.0007473523,0.00023734599,0.00037984955,0.0008118495,0.00019647733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056696346,0.00019715236,0.00034666268,0.00014817379,0.00036816928,0.0001569435,0.00031975872,0.000113407536,0.0006005082],"category_scores_gemma":[0.0011902167,0.00016306227,0.00010905812,0.00085039204,0.00037044164,0.0003840322,0.00007827738,0.000121350145,0.00021895785],"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.00026359016,0.0004543979,0.0074989214,0.00014800888,0.00016012485,0.000017770311,0.0104033835,0.000008895587,0.056779534,0.8677751,0.03617596,0.020314354],"study_design_scores_gemma":[0.009030128,0.001090943,0.05014049,0.00037813265,0.0008028306,0.00012504835,0.017398158,0.009672654,0.15084885,0.5499649,0.20744778,0.0031000744],"about_ca_topic_score_codex":0.000001879493,"about_ca_topic_score_gemma":0.000015560456,"teacher_disagreement_score":0.31781015,"about_ca_system_score_codex":0.000028850054,"about_ca_system_score_gemma":0.000048096343,"threshold_uncertainty_score":0.66494864},"labels":[],"label_agreement":null},{"id":"W5517251","doi":"10.1007/bfb0040248","title":"A game programming approach to efficient management of interconnected power networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bargaining problem; Payment; Computer science; Game theory; Bargaining power; Mathematical optimization; Power (physics); Operations research; Nash equilibrium; Mathematical economics; Microeconomics; Economics; Mathematics","score_opus":0.024945132860388432,"score_gpt":0.28897360096955843,"score_spread":0.26402846810917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5517251","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.0011753206,0.00021699819,0.7412944,0.00032290968,0.000110532725,0.0009066421,0.000021383736,0.000026406267,0.25592542],"genre_scores_gemma":[0.9954296,0.0000105971585,0.0031173376,0.00057433953,0.000026845044,0.00005820458,0.000013657581,0.000005598312,0.0007638241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728096,0.00004663417,0.0010815347,0.00038676852,0.000931714,0.00027237524],"domain_scores_gemma":[0.99801856,0.0007454628,0.0005601088,0.00034878092,0.00024653442,0.0000805727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025277818,0.00024625487,0.00044413676,0.00073126174,0.00013890566,0.00036351432,0.0007063558,0.00017805514,0.000047915346],"category_scores_gemma":[0.00021365538,0.00016771769,0.000101113925,0.0006314152,0.00040294087,0.00042374153,0.00014507226,0.00022299612,0.000033144606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006504269,0.000039499097,0.00006243005,0.000033404594,0.000024367717,5.54636e-7,0.0011440968,0.38314784,0.000004379447,0.2733501,0.00010491618,0.34202337],"study_design_scores_gemma":[0.0026231417,0.000646651,0.0032592816,0.00087924337,0.00011710388,0.000029905486,0.00079127774,0.5185743,0.0000492205,0.21377072,0.25785282,0.0014063183],"about_ca_topic_score_codex":0.000012198064,"about_ca_topic_score_gemma":0.00000779147,"teacher_disagreement_score":0.9942543,"about_ca_system_score_codex":0.000029282723,"about_ca_system_score_gemma":0.00003299533,"threshold_uncertainty_score":0.6839329},"labels":[],"label_agreement":null},{"id":"W562951150","doi":"10.4324/9781315789408","title":"Choice, Decision, and Measurement: Essays in Honor of R. Duncan Luce","year":2019,"lang":"en","type":"book","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":210,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Honor; History; Computer science","score_opus":0.1158404155474685,"score_gpt":0.35748051938331415,"score_spread":0.24164010383584567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W562951150","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034201278,0.00044407588,0.0025121558,0.0001818207,0.00015397888,0.0005035638,0.000041092477,0.000017279406,0.9927259],"genre_scores_gemma":[0.100332245,0.00006420382,0.0005996696,0.00015426028,0.00006514035,0.00002243792,0.000006058768,0.000021602234,0.8987344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996408,0.0001011991,0.00095286185,0.0006448838,0.0017071136,0.0001859662],"domain_scores_gemma":[0.9952541,0.0025550253,0.0004292834,0.0011163951,0.0005452592,0.000099908786],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004518086,0.00022047161,0.00060650177,0.00048321128,0.000048912807,0.00008437474,0.0007824582,0.00023146332,0.0014955595],"category_scores_gemma":[0.0019676515,0.00015662384,0.0001059622,0.00036696353,0.0001746222,0.0001349146,0.00023292773,0.00023911166,0.00082794524],"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.000077904515,0.00014127867,0.003142355,0.000045524317,0.000040296676,0.0000028018835,0.00026917658,0.000056835688,0.00039457835,0.54465586,0.32150337,0.12967002],"study_design_scores_gemma":[0.00034752084,0.000028767434,0.004279765,0.00011295789,0.000013322811,0.0000019198048,0.000040589926,0.000033199245,0.000088888286,0.5840694,0.41081467,0.00016900455],"about_ca_topic_score_codex":0.00002518345,"about_ca_topic_score_gemma":0.00056970783,"teacher_disagreement_score":0.12950103,"about_ca_system_score_codex":0.00006687651,"about_ca_system_score_gemma":0.00035966182,"threshold_uncertainty_score":0.99995005},"labels":[],"label_agreement":null},{"id":"W5638217","doi":"10.1080/00039896.1968.10665029","title":"Domination Graphs of Extended Rotational Tournaments: Chords and Cycles.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.034540080034856174,"score_gpt":0.35806628137791363,"score_spread":0.32352620134305743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5638217","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.99177885,0.00006386894,0.0011380331,0.00027332775,0.00032385386,0.00014251813,0.0000056501203,0.000015122712,0.006258799],"genre_scores_gemma":[0.9990524,0.000008471949,0.0005741868,0.00005251859,0.000004918818,0.00000827344,0.0000034939742,0.0000049661708,0.00029073682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985031,0.00007090555,0.00045044348,0.00021884435,0.00062338624,0.0001333556],"domain_scores_gemma":[0.99827373,0.0008556465,0.00023392128,0.0002675197,0.0002856535,0.00008352587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752644,0.00007708922,0.00014403442,0.00020629347,0.000119021075,0.000047547368,0.000270762,0.000048464306,0.00013694119],"category_scores_gemma":[0.00060013053,0.000065265966,0.000048291677,0.00055899227,0.00014977963,0.00021756336,0.00005333965,0.00007620261,0.00003354673],"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.000027286707,0.00010385629,0.0056926585,0.0000013448274,0.00000774285,8.316751e-7,0.0002726998,0.0000032755827,0.0025457577,0.9574472,0.0003570166,0.03354037],"study_design_scores_gemma":[0.00046197543,0.00003387671,0.19921859,0.0000051602087,0.0000055643613,0.0000031918696,0.00034490813,0.000046301422,0.0037777962,0.795421,0.0006264534,0.000055208657],"about_ca_topic_score_codex":0.0000059131003,"about_ca_topic_score_gemma":0.0000046199634,"teacher_disagreement_score":0.19352593,"about_ca_system_score_codex":0.000018110304,"about_ca_system_score_gemma":0.000022230084,"threshold_uncertainty_score":0.26614687},"labels":[],"label_agreement":null},{"id":"W576206128","doi":"10.1007/978-3-642-35582-0","title":"Game Theory for Networks : Third International ICST Conference, GameNets 2012, Vancouver, BC, Canada, May 24-26, 2012, Revised Selected Papers","year":2012,"lang":"en","type":"book","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Game theory; Stackelberg competition; Cognitive radio; Computer network; Robustness (evolution); Mathematical economics; Telecommunications; Wireless; Mathematics","score_opus":0.04832219727111224,"score_gpt":0.30795889641860474,"score_spread":0.2596366991474925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W576206128","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036380592,0.00077549845,0.05176058,0.0005269334,0.0053143473,0.0016196145,0.00065931183,0.00023482049,0.9390725],"genre_scores_gemma":[0.023034425,0.00017512187,0.00064864155,0.0016709398,0.0014904198,0.00029270657,0.00061603007,0.00010605851,0.9719657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940897,0.00048070442,0.0015545709,0.0012353093,0.00175036,0.0008893209],"domain_scores_gemma":[0.99080384,0.003986409,0.001170553,0.001565203,0.001856094,0.00061792304],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003976323,0.00071838376,0.0009708691,0.00031700183,0.00031745207,0.0003855382,0.0030404667,0.0006745636,0.020725751],"category_scores_gemma":[0.00066898926,0.00055691955,0.00030581138,0.00040053914,0.00033924312,0.0006989557,0.0002698009,0.0007839315,0.00043157442],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001334928,0.00006170193,0.000019854066,0.000008754097,0.00012125962,0.0000015172957,0.0000693042,0.00020185632,0.0000162583,0.19620378,0.7787007,0.024461504],"study_design_scores_gemma":[0.0005219168,0.000050867984,0.00018010891,0.000063090534,0.00010985115,0.0000053472554,0.00016706604,0.0013365509,0.000018831359,0.118907645,0.8779892,0.00064954866],"about_ca_topic_score_codex":0.0020440505,"about_ca_topic_score_gemma":0.2854121,"teacher_disagreement_score":0.28336805,"about_ca_system_score_codex":0.00042809773,"about_ca_system_score_gemma":0.0032842974,"threshold_uncertainty_score":0.9996882},"labels":[],"label_agreement":null},{"id":"W65371796","doi":"10.1007/978-1-4614-7085-4_12","title":"Agreement in Teams and the Dynamic Programming Approach Under Information Constraints","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Computer science; Dynamic programming; Constraint (computer-aided design); Information exchange; Context (archaeology); Constraint programming; Function (biology); Subject (documents); Knowledge management; Mathematical optimization; Operations research; Theoretical computer science; Mathematics; Algorithm; Stochastic programming; World Wide Web","score_opus":0.044169347346190796,"score_gpt":0.3093560791029169,"score_spread":0.26518673175672614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65371796","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033193137,0.0000465242,0.045880534,0.00083605625,0.000034067143,0.0012505596,0.0000074483737,0.000020947875,0.9515919],"genre_scores_gemma":[0.48684558,0.00004080726,0.003871226,0.0006323234,0.000019093934,0.00021720675,0.000043625714,0.000010262002,0.50831985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837697,0.000048867263,0.00063975673,0.00023646836,0.00055369345,0.00014425116],"domain_scores_gemma":[0.9985858,0.0005044739,0.00029125885,0.00045917445,0.000108391076,0.000050908464],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021776622,0.0001681556,0.00025291115,0.0001836686,0.000108836764,0.00036594816,0.00041481908,0.00013908179,0.0017438371],"category_scores_gemma":[0.00009120116,0.000087630775,0.000064745735,0.000072800736,0.00084467896,0.00030165145,0.00014520889,0.00024352914,0.0013086523],"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.0000045660736,0.000005295695,0.0000031213074,0.0000027026247,0.0000069094103,4.4990976e-8,0.00029338783,0.000024655375,2.5094354e-7,0.7253253,0.00020185177,0.27413192],"study_design_scores_gemma":[0.0006481567,0.00001228344,0.00019559567,0.000022384018,0.000014546566,0.000011503524,0.003438163,0.0040542767,5.482509e-7,0.90071857,0.09070484,0.00017915487],"about_ca_topic_score_codex":0.000020273945,"about_ca_topic_score_gemma":0.00003255841,"teacher_disagreement_score":0.48651364,"about_ca_system_score_codex":0.00003770132,"about_ca_system_score_gemma":0.000043750366,"threshold_uncertainty_score":0.9994689},"labels":[],"label_agreement":null},{"id":"W6887770014","doi":"10.17632/ccn43vxdjg.1","title":"Information Sharing in Financial Markets","year":2024,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","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":"University of Toronto","funders":"","keywords":"Information sharing; Financial market; Information system; Information asymmetry; Key (lock); Financial analysis","score_opus":0.04431511567638452,"score_gpt":0.3408691621060885,"score_spread":0.29655404642970395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6887770014","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013551627,0.00025991726,0.00022137626,0.00014019203,0.00047562466,0.00025804236,0.9841074,0.000050235245,0.0009356056],"genre_scores_gemma":[0.0069381064,0.00047577458,0.00012584082,0.00039504716,0.0003897335,0.000039560648,0.9915022,0.000012680256,0.00012104257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702275,0.00021349892,0.00094010506,0.00077834475,0.00064374483,0.00040155926],"domain_scores_gemma":[0.9958625,0.0010723498,0.00031899248,0.0025763367,0.000035514026,0.00013432188],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004059287,0.00032500972,0.00043122403,0.000511029,0.00024818833,0.0010385724,0.004770951,0.00018400307,0.0001162375],"category_scores_gemma":[0.00024305595,0.00025823078,0.000053530614,0.00092984847,0.0000989288,0.0012143248,0.0038326844,0.0007217788,0.0017906572],"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.000049561364,0.00002129171,0.00035051463,0.0002226042,0.000012169845,0.0000087875505,0.00088655914,0.00015622415,0.0000013742917,0.00019158247,0.9740744,0.02402493],"study_design_scores_gemma":[0.00012157665,0.000010606326,0.008098715,0.0005426139,0.00003891333,0.000013628183,0.0004231694,0.030147161,3.5937975e-7,0.02063859,0.9396913,0.0002733782],"about_ca_topic_score_codex":0.0003978056,"about_ca_topic_score_gemma":0.0046708486,"teacher_disagreement_score":0.03438311,"about_ca_system_score_codex":0.000021025462,"about_ca_system_score_gemma":0.00007114387,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W6924725793","doi":"10.15468/dl.se7wxx","title":"Occurrence Download","year":2022,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Coordinate system; Matching (statistics); Download; Range (aeronautics); Geographic coordinate conversion","score_opus":0.05628766592820833,"score_gpt":0.3062486423872709,"score_spread":0.24996097645906257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924725793","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046821925,0.00001152064,0.000017208118,0.00039191288,0.00058108306,0.00034029226,0.9976156,0.00007106602,0.00050313276],"genre_scores_gemma":[0.00003505142,0.000017067183,9.996653e-7,0.0007640067,0.0000011973758,0.000014444592,0.99916613,8.870856e-9,0.0000010843768],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99641836,0.00028922345,0.0007725621,0.00039636283,0.0018373464,0.00028615427],"domain_scores_gemma":[0.9971732,0.00021980108,0.0006597671,0.001344306,0.00040851318,0.00019439908],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002135737,0.00025664116,0.00033902697,0.00018757746,0.00085943437,0.00040701145,0.0022492984,0.0002097807,0.22946253],"category_scores_gemma":[0.0012873844,0.0002349131,0.00024211941,0.0011860259,0.00026703498,0.0011485125,0.0011275272,0.00042125385,0.4152164],"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.00003738919,0.000042024694,0.0002898311,0.0000114492495,0.00001166441,9.697873e-7,0.000053131505,0.00004021543,2.3681581e-8,0.0000025952193,0.9959446,0.0035660695],"study_design_scores_gemma":[0.00017725675,0.000027283097,0.00007254368,3.304853e-7,0.000026169226,0.00000547484,0.0006025427,1.3011902e-7,8.9911396e-7,0.000111181944,0.9987405,0.00023567845],"about_ca_topic_score_codex":0.00016462832,"about_ca_topic_score_gemma":0.0000092887,"teacher_disagreement_score":0.18575387,"about_ca_system_score_codex":0.00027206203,"about_ca_system_score_gemma":0.00019674761,"threshold_uncertainty_score":0.9579478},"labels":[],"label_agreement":null},{"id":"W6930691146","doi":"10.5281/zenodo.14962028","title":"Generative Artificial Intelligence in Canadian Financial Services Marketing: Transforming Consumer Insights and Engagement","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":true,"ca_institutions":"Humber Polytechnic","funders":"","keywords":"Transformative learning; Generative grammar; Financial services; Mainstream; Agency (philosophy); Workforce; Unbanked","score_opus":0.0776131757763302,"score_gpt":0.3272537720605945,"score_spread":0.24964059628426433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930691146","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.7306532,0.00039953616,0.031287875,0.0063497443,0.00019322734,0.0012417856,0.00017664493,0.00022494516,0.22947301],"genre_scores_gemma":[0.99882185,0.000046723282,0.00024824485,0.00037368233,0.000026812822,1.4561091e-7,0.00006082605,0.00008146412,0.0003402254],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807066,0.0006845862,0.00034779985,0.00037736804,0.00025841378,0.00026115307],"domain_scores_gemma":[0.99905545,0.00018568017,0.00005592674,0.00025868276,0.00029768018,0.00014658037],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0030980578,0.0000908678,0.00011703921,0.0005325749,0.0018547099,0.00074787,0.0007203192,0.00004750664,0.0026785412],"category_scores_gemma":[0.001459289,0.00008533441,0.000021787308,0.0010853768,0.00015740457,0.00020244242,0.0002942091,0.00020080592,0.0009586039],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007329149,0.0000610473,0.0000372558,0.000022480244,0.000010274423,0.000008006268,0.0059756306,0.000113246904,0.0022232106,0.29573563,0.0046476326,0.6910923],"study_design_scores_gemma":[0.00008433309,0.000026511141,0.0022188502,0.00003200119,0.0000050983253,0.000004788514,0.0023589984,0.0020721501,0.0012594302,0.043473706,0.94835615,0.00010800087],"about_ca_topic_score_codex":0.0009746609,"about_ca_topic_score_gemma":0.0021964153,"teacher_disagreement_score":0.9437085,"about_ca_system_score_codex":0.00009138074,"about_ca_system_score_gemma":0.000022482121,"threshold_uncertainty_score":0.9998193},"labels":[],"label_agreement":null},{"id":"W6931008191","doi":"10.5281/zenodo.6004724","title":"Haidoterminus","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Arthropod mouthparts; Scape; Range (aeronautics); Key (lock); Taxonomy (biology)","score_opus":0.1863186474384662,"score_gpt":0.3769455963891002,"score_spread":0.19062694895063398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931008191","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10433971,0.000022776167,0.011446339,0.0046904236,0.00018428883,0.00033899944,0.00016746954,0.00054197875,0.878268],"genre_scores_gemma":[0.9893427,0.000007450943,0.00021758329,0.000124478,0.00013751666,2.3643638e-8,0.00007880787,0.00038145474,0.009710001],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981797,0.00026508732,0.00027395636,0.00042854922,0.00059957255,0.00025316776],"domain_scores_gemma":[0.99718714,0.00007895992,0.00022710253,0.0017439962,0.00059355196,0.00016925689],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023397587,0.00009142769,0.00012409472,0.0001513791,0.007756402,0.003951739,0.003977812,0.000044055454,0.023458092],"category_scores_gemma":[0.0052161743,0.00008009267,0.000061197665,0.0002268341,0.000368461,0.0005030289,0.0017853444,0.00016535893,0.06257714],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029519259,0.00008204382,0.000013466476,0.0000036956696,0.000011581223,0.000010702012,0.00064630184,0.000016737375,0.0034731834,0.07897396,0.26665917,0.65007967],"study_design_scores_gemma":[0.00019731736,0.000048680304,0.0038496722,0.000005492446,0.000004060237,0.00005635769,0.00019362148,0.0001908636,0.0005426832,0.024024358,0.97078913,0.000097777505],"about_ca_topic_score_codex":0.000006399948,"about_ca_topic_score_gemma":2.4863158e-7,"teacher_disagreement_score":0.885003,"about_ca_system_score_codex":0.000033854078,"about_ca_system_score_gemma":0.0000023035,"threshold_uncertainty_score":0.99708223},"labels":[],"label_agreement":null},{"id":"W6980093259","doi":"","title":"Asymmetric information without common priors: an indirect evolutionary analysis of quantity competition","year":2011,"lang":"en","type":"article","venue":"Research Portal (Queen's University Belfast)","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Queen's University","funders":"","keywords":"Competition (biology); Complete information; Information asymmetry; Measure (data warehouse); Imperfect competition; Stability (learning theory); Perfect information; Information transmission","score_opus":0.09958141001158242,"score_gpt":0.3676412749699873,"score_spread":0.26805986495840484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980093259","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.95355123,0.000004547051,0.0037498875,0.00014295212,0.000028372651,0.0003249787,0.00020860297,0.00005846065,0.041930947],"genre_scores_gemma":[0.99816066,0.000026909614,0.00088884233,0.000011974621,0.00001251791,0.0000018616389,0.0001983214,0.0000046718787,0.000694212],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99584335,0.0010768477,0.00049491774,0.0003471824,0.001896229,0.00034149538],"domain_scores_gemma":[0.99658275,0.00060171395,0.00037146956,0.0008239864,0.0013577294,0.00026235962],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043117623,0.00012562038,0.00039065868,0.0044238926,0.0005580036,0.000065848166,0.0010769644,0.00012782465,0.0012318254],"category_scores_gemma":[0.00062694406,0.000120849996,0.00020064515,0.010176263,0.00053274044,0.0022601371,0.00031720454,0.0003636637,0.00024500594],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043125718,0.000869147,0.61771446,0.000018215293,0.0004222988,0.000025021607,0.002867819,0.000334147,0.00008581199,0.3699541,0.0015745275,0.005703194],"study_design_scores_gemma":[0.000291542,0.00024240579,0.979461,0.000011475082,0.0001426342,0.0000017492757,0.007362352,0.00118603,0.00043915267,0.0062584924,0.004445805,0.00015734993],"about_ca_topic_score_codex":0.0029017616,"about_ca_topic_score_gemma":0.00031465798,"teacher_disagreement_score":0.3636956,"about_ca_system_score_codex":0.000109264074,"about_ca_system_score_gemma":0.0002083971,"threshold_uncertainty_score":0.9996812},"labels":[],"label_agreement":null},{"id":"W6989191178","doi":"","title":"Algorithmic approaches to oligopoly theory","year":2015,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oligopoly; Work (physics); Stability (learning theory); Key (lock); Measure (data warehouse)","score_opus":0.19108511192772612,"score_gpt":0.3489148833668621,"score_spread":0.15782977143913599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989191178","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.58717215,0.00030010956,0.000010314538,0.00010153063,0.0015232667,0.0013762316,0.0017897162,0.00035034082,0.40737635],"genre_scores_gemma":[0.88626134,0.000021260668,0.0023501553,0.0005522729,0.00018268531,0.0006843985,0.0006073894,0.00022221194,0.109118275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901131,0.001571499,0.0018134282,0.0023544482,0.003126685,0.0010208624],"domain_scores_gemma":[0.9923042,0.0018329626,0.00095097977,0.0027819257,0.000999868,0.0011300702],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011321099,0.0010089842,0.0012330082,0.0011448116,0.0015003053,0.00046446995,0.0038576254,0.0009733055,0.0011631617],"category_scores_gemma":[0.0068436945,0.00088714564,0.000589015,0.0024828475,0.00015979615,0.0009006983,0.00041829317,0.0016390949,0.014081269],"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.00020371149,0.00016054274,0.0000024907408,0.000020523927,0.000075634984,0.000012277514,0.000051001276,0.000056439007,0.0029599431,0.57279766,0.00013481689,0.42352498],"study_design_scores_gemma":[0.00035673718,0.0001079523,0.00022373509,0.00008058441,0.000113043294,0.000020751198,0.0023395598,0.000021259943,0.016206985,0.7706468,0.20897593,0.000906632],"about_ca_topic_score_codex":0.000060433413,"about_ca_topic_score_gemma":0.000378265,"teacher_disagreement_score":0.42261836,"about_ca_system_score_codex":0.0005003665,"about_ca_system_score_gemma":0.00018130097,"threshold_uncertainty_score":0.9997996},"labels":[],"label_agreement":null},{"id":"W7010148570","doi":"","title":"A Group Public Goods Game with Position Uncertainty","year":2022,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"Queen's University","funders":"","keywords":"Outcome (game theory); Position (finance); Public good; Complete information; Public goods game; Non-cooperative game; Screening game; Group (periodic table); Repeated game","score_opus":0.11625288147800623,"score_gpt":0.40578903501266345,"score_spread":0.2895361535346572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010148570","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.8343428,0.000054820706,0.00011587933,0.0023362103,0.00022227207,0.001121728,0.00020937754,0.00006022439,0.16153674],"genre_scores_gemma":[0.9943802,0.00056335726,0.00053717184,0.00016266048,0.00012014823,0.001188097,0.0001567239,0.000044327855,0.0028473523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940924,0.0013994933,0.00094311073,0.0015830103,0.0011634995,0.00081845984],"domain_scores_gemma":[0.99396765,0.0026859366,0.00039955534,0.0024273593,0.00021756145,0.00030192742],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01011337,0.0002953373,0.0005705734,0.001008234,0.00038829987,0.0007125296,0.0026409344,0.00021804664,0.0028396528],"category_scores_gemma":[0.000977501,0.00025522977,0.00019970241,0.000796683,0.0005093359,0.00024300104,0.0025247568,0.0022899164,0.00010516562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005663109,0.0006738084,0.016362404,0.000050640003,0.0001520281,0.00006096382,0.0017858625,0.087701395,0.00023591737,0.09820001,0.00030472854,0.7939059],"study_design_scores_gemma":[0.0017770248,0.0006817865,0.030854303,0.0001466158,0.000025274323,0.00009077059,0.024412954,0.03863947,0.000054334618,0.64335716,0.25845027,0.00151004],"about_ca_topic_score_codex":0.0005291632,"about_ca_topic_score_gemma":0.0027430577,"teacher_disagreement_score":0.7923959,"about_ca_system_score_codex":0.0019814204,"about_ca_system_score_gemma":0.001332133,"threshold_uncertainty_score":0.99999},"labels":[],"label_agreement":null},{"id":"W7010629992","doi":"","title":"Instability of Equilibria with Private Monitoring","year":2015,"lang":"en","type":"other","venue":"Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)","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":"Queen's University","funders":"","keywords":"Imperfect; Robustness (evolution); Dilemma; Yield (engineering); Control theory (sociology); Instability","score_opus":0.07457009454741999,"score_gpt":0.30147060015227783,"score_spread":0.22690050560485786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010629992","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15735273,0.00045015544,0.00094375486,0.0002461877,0.00014727552,0.0007882729,0.0018066018,0.00016131019,0.8381037],"genre_scores_gemma":[0.3788548,0.0003909664,0.024489885,0.000020218977,0.00017468294,0.000002746938,0.00017309144,0.00031008283,0.5955835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957043,0.00068790297,0.0005605624,0.00093712023,0.0016864493,0.00042367406],"domain_scores_gemma":[0.9948305,0.0008101716,0.0011255607,0.0024269137,0.00045001204,0.00035685638],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016927752,0.00044023394,0.001046829,0.00066457276,0.0001947271,0.000027191507,0.0031446735,0.00026143453,0.0019878247],"category_scores_gemma":[0.00054398784,0.00040802316,0.0003231068,0.00086272537,0.002050916,0.00018875646,0.0012506112,0.000572052,0.0001239768],"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.010037141,0.0052107517,0.080683455,0.0017440616,0.0038710448,0.0004763661,0.10980858,0.00048581627,0.01727669,0.05686499,0.6077489,0.10579219],"study_design_scores_gemma":[0.0016626442,0.00043237658,0.007992589,0.0007358706,0.00020187211,0.000019802554,0.0165025,0.00038291392,0.00018835612,0.01437765,0.95677423,0.00072921923],"about_ca_topic_score_codex":0.0012244539,"about_ca_topic_score_gemma":0.0018535281,"teacher_disagreement_score":0.34902528,"about_ca_system_score_codex":0.000102645536,"about_ca_system_score_gemma":0.0005186653,"threshold_uncertainty_score":0.99983716},"labels":[],"label_agreement":null},{"id":"W7018614758","doi":"","title":"Distributed resource allocation under communication constraints","year":2001,"lang":"en","type":"other","venue":"OpenGrey (Institut de l'Information Scientifique et Technique)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Resource allocation; Resource (disambiguation); Key (lock); Information system; Resource management (computing); Context (archaeology)","score_opus":0.054246643539082824,"score_gpt":0.3437857684037055,"score_spread":0.2895391248646227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018614758","genre_codex":"methods","genre_gemma":"other","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.00002447418,0.000036760564,0.5139245,0.0018848408,0.0001246292,0.0037460001,0.00041993,0.00049909926,0.47933978],"genre_scores_gemma":[0.060770314,0.00051855354,0.06472606,0.005841532,0.000218779,0.006055295,0.010776933,0.00039817084,0.85069436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99491346,0.00088263996,0.001455366,0.000656696,0.0015801869,0.000511678],"domain_scores_gemma":[0.99409074,0.00051124324,0.0015722743,0.00283804,0.00069970824,0.00028799163],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011062278,0.00046507354,0.0005273758,0.00130996,0.0005701978,0.0016784996,0.0029240076,0.00069274387,0.0075051854],"category_scores_gemma":[0.0019888883,0.00042608037,0.00020142869,0.002273489,0.0010907677,0.0018805596,0.00048676258,0.0007273438,0.0032744242],"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.00001016255,0.00006564859,0.000025469379,0.00003310767,0.000020722888,0.0000014886404,0.0003457952,0.0004232485,0.0002527589,0.16873725,0.77431726,0.055767115],"study_design_scores_gemma":[0.00030360167,0.000010889351,0.00009072138,0.00044368044,0.00002495484,0.000040384522,0.0006454422,0.00038686386,0.0016926213,0.020914618,0.97497606,0.0004701612],"about_ca_topic_score_codex":0.00020532847,"about_ca_topic_score_gemma":0.00037082742,"teacher_disagreement_score":0.44919842,"about_ca_system_score_codex":0.00031642028,"about_ca_system_score_gemma":0.0005914162,"threshold_uncertainty_score":0.9998191},"labels":[],"label_agreement":null},{"id":"W7022570885","doi":"","title":"Bandits in the Lab","year":2018,"lang":"en","type":"article","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; University of New South Wales","keywords":"Markov chain; Test (biology); Markov process; Markov decision process; Game theory; Strategic dominance","score_opus":0.024179164368265553,"score_gpt":0.2452027726635699,"score_spread":0.22102360829530435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022570885","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.83965284,0.00052745035,0.00080748333,0.0020773988,0.00021439684,0.0001546919,0.000011238159,0.000033828484,0.15652068],"genre_scores_gemma":[0.9846322,0.000010759813,0.00017419539,0.0004440886,0.00014811408,0.000010975755,0.000003211388,0.0000036828476,0.014572759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982727,0.000239505,0.00024429546,0.00031911104,0.0007122546,0.00021212891],"domain_scores_gemma":[0.998619,0.0004693618,0.00011457298,0.00053478155,0.00017152305,0.00009076675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011922398,0.00010661205,0.00012190731,0.00017027846,0.003883836,0.0000833026,0.0009103324,0.00007175104,0.0001661373],"category_scores_gemma":[0.00023813719,0.00007625104,0.00008721505,0.00076304225,0.0004655666,0.0002618071,0.0001542322,0.0001416668,0.00073870143],"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.00038236714,0.0003314881,0.053383034,0.000003920093,0.00004176254,0.00060969073,0.070349805,0.0005374355,0.010724495,0.8267063,0.018416455,0.018513247],"study_design_scores_gemma":[0.00076476217,0.000100181016,0.2520086,0.000019169936,0.000027864771,0.00063591317,0.03435153,0.000938358,0.004884219,0.06357728,0.64242905,0.00026304883],"about_ca_topic_score_codex":0.0018581412,"about_ca_topic_score_gemma":0.0024648607,"teacher_disagreement_score":0.763129,"about_ca_system_score_codex":0.00047434767,"about_ca_system_score_gemma":0.00025458788,"threshold_uncertainty_score":0.997413},"labels":[],"label_agreement":null},{"id":"W7024459006","doi":"","title":"Revisiting the past, discovering traditional care and the cultural meaning of pregnancy and birth in a Cree community","year":2000,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Meaning (existential); Pregnancy; Ethnic group; Qualitative research; Traditional knowledge; Thematic analysis","score_opus":0.021012968314962178,"score_gpt":0.21256610384631655,"score_spread":0.19155313553135436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024459006","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05824327,0.0035339303,0.00001322935,0.0018919926,0.00002819367,0.00027559302,0.00077816186,0.0000045111774,0.9352311],"genre_scores_gemma":[0.9782431,0.000637928,0.00013556477,0.0001736981,0.00005872628,0.000013264038,0.0000068629856,0.000023304177,0.020707566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997983,0.00037291984,0.00030986438,0.00016965717,0.0010354952,0.00012908329],"domain_scores_gemma":[0.99772215,0.0016665044,0.00026777823,0.00027864036,6.0563195e-7,0.00006434044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006223998,0.00014401916,0.0002820039,0.000027142169,0.00027987346,0.00005213803,0.0004030931,0.000022942957,0.0000708941],"category_scores_gemma":[0.00001524211,0.00008039332,0.00002616157,0.0001039963,0.00043250978,0.00014748436,0.0001706067,0.0002454544,1.3387317e-9],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052071264,0.000027120912,0.032133102,0.0007386531,0.00013777365,0.000017243527,0.00842752,0.00015678756,0.00039539265,0.79975075,0.0038135566,0.1538814],"study_design_scores_gemma":[0.00397894,0.00015643964,0.25499675,0.00904215,0.00014867175,0.00006433231,0.26099008,0.0016948215,0.0015244434,0.1252702,0.3408867,0.0012464621],"about_ca_topic_score_codex":0.004834826,"about_ca_topic_score_gemma":0.034770146,"teacher_disagreement_score":0.91999984,"about_ca_system_score_codex":0.000002334353,"about_ca_system_score_gemma":0.000214074,"threshold_uncertainty_score":0.9828428},"labels":[],"label_agreement":null},{"id":"W7027213214","doi":"","title":"1896 Chap. 0525. An Act To Authorize The Town Of Edgartown To Borrow And Expend Money For The Purpose Of Providing Additions And Improvements To The County Court House In Said Town.","year":2011,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Legislation; Quarter (Canadian coin); Payment; County government; Legislature; Government (linguistics); Agency (philosophy); Governor","score_opus":0.025527092263695622,"score_gpt":0.27808781195670035,"score_spread":0.25256071969300475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027213214","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.6674579,0.014070504,0.008265214,0.057900123,0.0024574953,0.056805402,0.030387908,0.0014421606,0.16121332],"genre_scores_gemma":[0.6265666,0.0012044508,0.0031157117,0.0019960108,0.00045024964,0.0027029482,0.0001918422,0.00089737686,0.3628748],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99502224,0.0006061888,0.0015053652,0.0011421967,0.0008719463,0.0008520616],"domain_scores_gemma":[0.99479795,0.0015203905,0.001156056,0.0020829167,0.00007972976,0.0003629646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014927764,0.000594822,0.0009265655,0.0006107878,0.00039159125,0.00040955012,0.0026458,0.00018366471,0.0005401698],"category_scores_gemma":[0.00014814704,0.00034525336,0.00019226581,0.0010681078,0.00047842137,0.0014666377,0.0007670705,0.00049446966,0.000007795486],"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.0022768585,0.00052024884,0.0018820871,0.00016932862,0.0004233892,0.000008816888,0.011938941,0.0002094903,0.0105875265,0.011697005,0.9319482,0.028338127],"study_design_scores_gemma":[0.00095391343,0.0017542485,0.0027444356,0.00026892428,0.00012283603,0.000015213079,0.001588594,0.0001881695,0.03060021,0.028117402,0.9330121,0.00063391053],"about_ca_topic_score_codex":0.00018408838,"about_ca_topic_score_gemma":0.00011773483,"teacher_disagreement_score":0.20166148,"about_ca_system_score_codex":0.000032158572,"about_ca_system_score_gemma":0.0005613193,"threshold_uncertainty_score":0.9998999},"labels":[],"label_agreement":null},{"id":"W7039442808","doi":"","title":"Measurement of the Cosmic Ray and Neutrino-Induced Muon Flux at the Sudbury Neutrino Observatory","year":2010,"lang":"en","type":"other","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Basic Energy Sciences; Office of Science; U.S. Department of Energy","keywords":"Zenith; Muon; Flux (metallurgy); Neutrino; Cosmic ray; Observatory","score_opus":0.046725203108621376,"score_gpt":0.27892466686339507,"score_spread":0.23219946375477368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039442808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38761285,0.0012560626,0.0006265777,0.0011374034,0.001510315,0.0015914751,0.0006337901,0.00011299713,0.6055185],"genre_scores_gemma":[0.9758609,0.00005475217,0.00014176557,0.00012265079,0.000030963525,0.000059947874,0.00012643175,0.000026670701,0.023575954],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962322,0.00013818302,0.0011826609,0.00038382167,0.0018238174,0.00023932796],"domain_scores_gemma":[0.99601054,0.00043185413,0.0015199088,0.0013858236,0.00052935374,0.00012250603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030108069,0.00026905446,0.0004911686,0.00030821422,0.00035572945,0.000120959,0.0011788675,0.0002927145,0.00043877034],"category_scores_gemma":[0.00036731714,0.00015247308,0.00018629199,0.000809857,0.0016857248,0.0002756423,0.000654042,0.00025729244,0.00003314023],"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.00035660423,0.0010054198,0.003583817,0.0004154232,0.00029043556,0.0000010043145,0.000060262846,0.00016708496,0.09443495,0.3221068,0.53768927,0.03988892],"study_design_scores_gemma":[0.0005548907,0.00009623906,0.06677048,0.00017335502,0.000114675306,0.000010563175,0.000024408453,0.000008459889,0.026886579,0.0013375189,0.90376174,0.0002610999],"about_ca_topic_score_codex":0.0000627159,"about_ca_topic_score_gemma":0.00028212814,"teacher_disagreement_score":0.588248,"about_ca_system_score_codex":0.000037356338,"about_ca_system_score_gemma":0.00018624548,"threshold_uncertainty_score":0.62176716},"labels":[],"label_agreement":null},{"id":"W7043977812","doi":"","title":"When An Evolutionary Analysis of the Volunteer`s Dilemma.","year":2006,"lang":"en","type":"report","venue":"Oxford University Research Archive (ORA) (University of Oxford)","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":"Trinity College","funders":"","keywords":"Nash equilibrium; Dilemma; Value (mathematics); Public good; Strategic dominance; Best response; Population","score_opus":0.0950708589430962,"score_gpt":0.34514298980663066,"score_spread":0.25007213086353447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043977812","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41236314,0.00016367104,0.024829075,0.0020659887,0.00032303482,0.0018305549,0.013216913,0.00011687582,0.54509073],"genre_scores_gemma":[0.80671155,0.0011222928,0.0061814943,0.00001753456,0.00015158972,9.38489e-7,0.0014287193,0.000052404506,0.18433349],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9884969,0.0024600173,0.0006521257,0.0013756371,0.0061658146,0.0008495312],"domain_scores_gemma":[0.9877891,0.0025964964,0.0013023195,0.003267727,0.004603345,0.00044103974],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.006450206,0.0004122372,0.0013293037,0.004808521,0.001879166,0.00007647229,0.008176967,0.00042649914,0.0019899572],"category_scores_gemma":[0.0011295488,0.00039481383,0.0016137201,0.007752552,0.004035408,0.0008507387,0.0036384445,0.0014979382,0.000025758618],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002371253,0.0027890552,0.24483731,0.00030953367,0.006235477,0.00031182898,0.007935101,0.007978642,0.0010046135,0.10166052,0.5950556,0.029511087],"study_design_scores_gemma":[0.00042917297,0.00019278779,0.20236191,0.00007246977,0.0009532376,0.000006765749,0.0076377564,0.0031109545,0.000010606378,0.028081993,0.7568045,0.00033781957],"about_ca_topic_score_codex":0.010528651,"about_ca_topic_score_gemma":0.014829813,"teacher_disagreement_score":0.3943484,"about_ca_system_score_codex":0.00069053035,"about_ca_system_score_gemma":0.002845879,"threshold_uncertainty_score":0.9998504},"labels":[],"label_agreement":null},{"id":"W7093368340","doi":"10.6084/m9.figshare.30423374","title":"Additional file 10 of Lake sturgeon behavioral diversity in the Laurentian great lakes: migratory patterns across populations and habitats","year":2025,"lang":"","type":"article","venue":"Figshare","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":"Fisheries and Oceans Canada","funders":"","keywords":"Habitat; Diversity (politics); Population; Sturgeon; Waterfowl; Species diversity","score_opus":0.1556328526963818,"score_gpt":0.3823642194144406,"score_spread":0.2267313667180588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093368340","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06198706,0.00008155859,0.0000014889334,0.00021355826,0.000044779998,0.00037079,0.9365129,0.000012604279,0.0007752872],"genre_scores_gemma":[0.5197675,8.404172e-7,0.000017556482,0.00011974762,0.000023142806,0.00029278663,0.47707084,0.0000039984916,0.0027035675],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99787325,0.00028053246,0.000497285,0.00047678218,0.0005857408,0.00028641117],"domain_scores_gemma":[0.9961485,0.0026290126,0.00026807014,0.0005802161,0.00029443475,0.000079733894],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026936567,0.00019705028,0.0002573298,0.00016165957,0.0009436804,0.00020693144,0.0009036477,0.00015469143,0.98050547],"category_scores_gemma":[0.0015938233,0.00015962111,0.00016241048,0.00092529354,0.00010953774,0.00032304515,0.00074633263,0.00026656137,0.0008936035],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013056088,0.00020876195,0.008571283,0.000032124673,0.000008116763,0.0000051708025,0.0018786809,0.000006118466,6.693519e-7,0.0000930762,0.9849554,0.004227556],"study_design_scores_gemma":[0.0001797798,0.000030187986,0.57112575,0.0009820651,0.000017831642,0.0000018743722,0.0034326226,0.00005013693,0.000003689106,0.0017440126,0.42231408,0.00011798521],"about_ca_topic_score_codex":0.00003821669,"about_ca_topic_score_gemma":0.032444645,"teacher_disagreement_score":0.9796119,"about_ca_system_score_codex":0.000021407935,"about_ca_system_score_gemma":0.00010554327,"threshold_uncertainty_score":0.9998843},"labels":[],"label_agreement":null},{"id":"W7095348831","doi":"","title":"DEPARTMENT OF ECONOMICSIsolation, Assurance and Rules: Can Rational Folly Supplant Foolish Rationality? ∗","year":2008,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Game theory; Disposition; Debt; Decision theory; Friendship; Quarter (Canadian coin)","score_opus":0.07389896868318753,"score_gpt":0.32501579490801225,"score_spread":0.25111682622482473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095348831","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.97420686,0.000032782624,0.015385287,0.002156371,0.00004953992,0.00019142746,0.00031983893,0.000014281477,0.007643621],"genre_scores_gemma":[0.9937602,0.000020514752,0.004187966,0.00023337433,0.000041348612,0.000030451469,0.00007618775,0.0000031636835,0.0016467833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987843,0.00007341019,0.00049862417,0.00024535775,0.00030770118,0.00009062819],"domain_scores_gemma":[0.9982892,0.0010100803,0.0001738905,0.00024823853,0.00021253966,0.000066016815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073189253,0.000072854695,0.00015885073,0.00006884387,0.0001914668,0.000041826304,0.00018883037,0.000030828127,0.00061245135],"category_scores_gemma":[0.0003043149,0.000058116377,0.000044724587,0.00012588098,0.00014864716,0.00021022893,0.000034130404,0.000032663436,0.0000657876],"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.00004501607,0.00010769888,0.098675825,0.0000032447854,0.00002917259,8.680264e-7,0.0006090768,0.00097312144,0.0007759239,0.87620455,0.021404115,0.0011714124],"study_design_scores_gemma":[0.000581923,0.000045145884,0.6082603,0.0000041602248,0.000009885526,0.000049096434,0.00025970713,0.0021834343,0.003977374,0.35491973,0.029524788,0.0001845159],"about_ca_topic_score_codex":0.00002251119,"about_ca_topic_score_gemma":0.00023219478,"teacher_disagreement_score":0.5212848,"about_ca_system_score_codex":0.000015380845,"about_ca_system_score_gemma":0.00014152788,"threshold_uncertainty_score":0.67059124},"labels":[],"label_agreement":null},{"id":"W7096189930","doi":"","title":"Capacity Investments in a Stochastic Dynamic Game: Good News Principle","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Investment (military); Government (linguistics); Public policy; Subject (documents)","score_opus":0.09722151068611917,"score_gpt":0.4009573747111423,"score_spread":0.3037358640250231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096189930","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.9369874,0.000010883525,0.035961702,0.0016221819,0.000043289805,0.0002754599,0.000005761016,0.00004806241,0.025045244],"genre_scores_gemma":[0.9921485,8.043977e-7,0.0013987339,0.0011207417,0.000010404865,0.000019729228,0.0000017313214,0.0000034487728,0.005295876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844706,0.000109775414,0.000408874,0.00035923903,0.00045216584,0.00022290576],"domain_scores_gemma":[0.9988683,0.0002899681,0.00009354405,0.00058141345,0.00005024417,0.00011652219],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008701345,0.0001029339,0.0001714772,0.00017256732,0.000057691297,0.0000844759,0.00053377333,0.00004977574,0.00046848843],"category_scores_gemma":[0.0006184484,0.00007511765,0.000049752256,0.00078450906,0.000067936126,0.000192302,0.000049868824,0.00012317092,0.0011901063],"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.000035306046,0.00066578103,0.0034849471,0.0000011313609,0.000006653745,0.0000042297693,0.0012581944,0.0053682495,0.004430739,0.91831416,0.00066257594,0.06576806],"study_design_scores_gemma":[0.00036941172,0.00005429499,0.14697145,0.000006017618,0.0000030946292,0.000005453697,0.00022415984,0.012361264,0.00015981343,0.83744055,0.0022733903,0.00013112008],"about_ca_topic_score_codex":0.00002938872,"about_ca_topic_score_gemma":0.0002951312,"teacher_disagreement_score":0.14348651,"about_ca_system_score_codex":0.000049853876,"about_ca_system_score_gemma":0.000038094087,"threshold_uncertainty_score":0.9995876},"labels":[],"label_agreement":null},{"id":"W7096264325","doi":"","title":"Formation of Buyer-Seller Trade Networks in a Quality-Di¤erentiated Product Market,”Canadian","year":2006,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quality (philosophy); Set (abstract data type); Product (mathematics); Stochastic game; Association (psychology); Trade association; Service (business)","score_opus":0.07669146683283466,"score_gpt":0.35458837261753584,"score_spread":0.27789690578470116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096264325","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.75636023,0.0001070437,0.028940808,0.0038302145,0.000119053366,0.0005943737,0.000021276277,0.00004792126,0.2099791],"genre_scores_gemma":[0.9954247,0.0000031221275,0.00024401584,0.000095291965,0.000037572067,0.000017656352,0.000017196877,0.0000045929605,0.0041558864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981591,0.00027772924,0.00075965346,0.00023947563,0.00034136165,0.0002226873],"domain_scores_gemma":[0.9989013,0.00034310666,0.00017589549,0.000430681,0.00007380576,0.00007522109],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023773354,0.00008415366,0.00017854646,0.000298143,0.00008060205,0.00005882395,0.00035628353,0.00005494101,0.0012919129],"category_scores_gemma":[0.00019784278,0.00006472351,0.000058642014,0.0012754496,0.00005893372,0.00027684122,0.000019353278,0.00009136207,0.00007883128],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001849029,0.000782946,0.069837764,0.00003148017,0.000021763593,0.0000036160243,0.001390845,0.028370986,0.005678502,0.47570053,0.32171613,0.09628055],"study_design_scores_gemma":[0.0006619314,0.000027158461,0.7459548,0.000020709944,0.000009646102,0.0000052347114,0.001067086,0.03932617,0.0047783055,0.16727938,0.040560465,0.00030910026],"about_ca_topic_score_codex":0.009710979,"about_ca_topic_score_gemma":0.10537447,"teacher_disagreement_score":0.67611706,"about_ca_system_score_codex":0.00002965565,"about_ca_system_score_gemma":0.000053222153,"threshold_uncertainty_score":0.99962103},"labels":[],"label_agreement":null},{"id":"W7097152505","doi":"","title":"Andriy Burkov, Université Laval Computing Equilibria in Repeated Games 1/26Motivation Definitions Approximating Equilibria Algorithms Examples Extracting strategies Algorithms Andriy Burkov, Université Laval Computing Equilibria in Repeated Games 2/26Moti","year":2009,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stability (learning theory); Work (physics); Approximation algorithm; Repeated game","score_opus":0.08136849653842387,"score_gpt":0.3224432499209732,"score_spread":0.2410747533825493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097152505","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.9418329,0.00027542512,0.03833198,0.0012465056,0.0002622191,0.0010859373,0.000072064926,0.00083310384,0.016059846],"genre_scores_gemma":[0.9644614,0.00009252194,0.03395186,0.00013892657,0.00025852773,0.0000070623905,0.00028111928,0.000075766584,0.0007328556],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98917794,0.0015779454,0.0033185065,0.0023881511,0.0017410206,0.0017964569],"domain_scores_gemma":[0.9905416,0.0050211134,0.001813945,0.0014486309,0.00072225975,0.00045248924],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006858453,0.0009931689,0.0015431895,0.0017877942,0.00103061,0.001411313,0.0018289951,0.0005298387,0.00031717142],"category_scores_gemma":[0.0021861624,0.0009895563,0.0003936943,0.0054612104,0.0003948793,0.0031052395,0.00082825834,0.0012097021,0.00005408338],"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.0010071088,0.0026404192,0.059678253,0.00018635103,0.00036204062,0.0009948324,0.048039448,0.063423134,0.4351706,0.11518061,0.0022851191,0.27103207],"study_design_scores_gemma":[0.005270717,0.00048969296,0.09525549,0.0009711706,0.00012556271,0.00029155967,0.076584525,0.7588783,0.009591179,0.04993694,0.00056773156,0.002037169],"about_ca_topic_score_codex":0.0019376668,"about_ca_topic_score_gemma":0.000702952,"teacher_disagreement_score":0.69545513,"about_ca_system_score_codex":0.00061463285,"about_ca_system_score_gemma":0.0005775304,"threshold_uncertainty_score":0.9996253},"labels":[],"label_agreement":null},{"id":"W7099730940","doi":"","title":"Toronto, ON","year":2015,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Public service; Subject (documents); Politics; Promotion (chess); Corporate governance; Service (business); Power (physics); Public interest","score_opus":0.45633903421455463,"score_gpt":0.5015817390619223,"score_spread":0.04524270484736764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099730940","genre_codex":"other","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.06768854,0.00001156478,0.0033818032,0.0010848988,0.00007541005,0.000029973187,7.3894205e-7,0.000028733553,0.9276983],"genre_scores_gemma":[0.9184747,2.4974148e-7,0.0004600074,0.00065192644,0.00003612715,0.0000038121038,1.8643486e-7,0.0000011380621,0.08037189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993868,0.000033328935,0.0000930106,0.000107263135,0.00032781888,0.00005176324],"domain_scores_gemma":[0.99929506,0.00022758648,0.000018046054,0.00031041607,0.000067447305,0.000081438506],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009745107,0.000024266885,0.00003954091,0.000010149748,0.000024760242,0.000041496936,0.00025001616,0.000012075322,0.0033681018],"category_scores_gemma":[0.00048239555,0.000014007488,0.000016848311,0.00007890532,0.000018365396,0.00008723299,0.000022896687,0.00001538627,0.010699476],"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.0000050810786,0.000018901377,0.000102766164,1.66734e-8,4.5835367e-7,1.4746091e-7,0.00012885724,0.000017172271,0.000037559977,0.84461445,0.124440596,0.03063401],"study_design_scores_gemma":[0.000069484544,0.000031711887,0.00075383665,2.699149e-7,4.3391654e-7,6.998992e-7,0.0010072618,0.00010067305,0.00068166404,0.4730566,0.5242687,0.000028630155],"about_ca_topic_score_codex":0.000028137321,"about_ca_topic_score_gemma":0.00005649812,"teacher_disagreement_score":0.85078615,"about_ca_system_score_codex":0.0000133178055,"about_ca_system_score_gemma":0.00001302633,"threshold_uncertainty_score":0.997543},"labels":[],"label_agreement":null},{"id":"W7100919453","doi":"","title":"Efficient Dynamic Coordination with Individual Learning,” University of Toronto working paper 301","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Outcome (game theory); Contrast (vision); Investment (military); Order (exchange); Variable (mathematics); Value (mathematics); Coordination game; Global game; Repeated game","score_opus":0.032338520157539005,"score_gpt":0.3071813352050856,"score_spread":0.2748428150475466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100919453","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.8174593,0.000027602955,0.11114207,0.00012289252,0.000021476511,0.00008419226,0.000001073745,0.00003060691,0.07111083],"genre_scores_gemma":[0.9907619,0.0000012899903,0.0015982334,0.000022459719,0.0000061799215,1.9261034e-7,0.0000021479918,0.0000029404644,0.0076046637],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99897003,0.000062904975,0.00015387859,0.0001920604,0.0004994506,0.00012166336],"domain_scores_gemma":[0.99899197,0.0004913952,0.00013560757,0.0001996533,0.00013142443,0.00004994722],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002145562,0.00005456494,0.00009275331,0.000042132626,0.00016453829,0.000024846324,0.00030773238,0.000035773857,0.0016962092],"category_scores_gemma":[0.00009669358,0.000040471943,0.000030761723,0.0002800702,0.00010081345,0.00007556716,0.000063133964,0.0000648827,0.00006858652],"study_design_candidate":"observational","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.00037999806,0.00047668713,0.050259955,0.0000045346687,0.000064193984,0.000009172979,0.01046509,0.02792451,0.008022085,0.23709284,0.0008984996,0.6644024],"study_design_scores_gemma":[0.0015374569,0.00034963095,0.7874557,0.00003949397,0.00006805269,0.000011768339,0.06838429,0.022308594,0.0010082904,0.006871555,0.111522324,0.000442836],"about_ca_topic_score_codex":0.0001625348,"about_ca_topic_score_gemma":0.002501261,"teacher_disagreement_score":0.73719573,"about_ca_system_score_codex":0.000044186974,"about_ca_system_score_gemma":0.000021256314,"threshold_uncertainty_score":0.9992164},"labels":[],"label_agreement":null},{"id":"W7107864129","doi":"10.1016/j.fmre.2025.11.014","title":"Computing approximate pure Nash equilibria for weighted congestion games","year":2025,"lang":"en","type":"article","venue":"Fundamental Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Anhui Province; Anhui Provincial Department of Education; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Nash equilibrium; Best response; Computation; Selection (genetic algorithm); Set (abstract data type)","score_opus":0.2926742945367568,"score_gpt":0.5461735226903068,"score_spread":0.25349922815355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107864129","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.95189255,0.00016186203,0.017512657,0.0051147714,0.00025236368,0.0012190916,0.000062768166,0.00008295799,0.023700949],"genre_scores_gemma":[0.9745227,0.0000052587866,0.0015910505,0.00015830259,0.00008889094,0.00014107466,0.000028507418,0.000009719661,0.023454458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996931,0.0005498945,0.00043774518,0.00056043104,0.0010178107,0.00050307397],"domain_scores_gemma":[0.99348915,0.00540897,0.000077758225,0.0005498766,0.00036212994,0.00011211381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007345142,0.00011016033,0.00021053047,0.0004297701,0.00083530723,0.0005857302,0.0009173939,0.000086734464,0.000326],"category_scores_gemma":[0.0018019476,0.00008830647,0.00009367779,0.0014961177,0.00038300987,0.00018439385,0.00049600773,0.0003392525,0.00035656375],"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.00046137208,0.0003257386,0.009907881,0.000060890474,0.000052115738,0.0000024922194,0.00079633674,0.00003938075,0.060737357,0.6720691,0.061976027,0.19357136],"study_design_scores_gemma":[0.0008869631,0.00014886055,0.007333067,0.0000846072,0.000008134532,0.000002288351,0.0035084425,0.025273187,0.013037265,0.855084,0.094471104,0.0001620691],"about_ca_topic_score_codex":0.0000047916583,"about_ca_topic_score_gemma":0.000005310179,"teacher_disagreement_score":0.19340928,"about_ca_system_score_codex":0.000078360456,"about_ca_system_score_gemma":0.00013022732,"threshold_uncertainty_score":0.6424593},"labels":[],"label_agreement":null},{"id":"W7111438036","doi":"","title":"Regret Analysis of Bilateral Trade with a Smoothed Adversary","year":2024,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Regret; Order (exchange); Adversary; Minimax; Bilateral trade","score_opus":0.10396956642297236,"score_gpt":0.3814158927926703,"score_spread":0.2774463263696979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111438036","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.9903423,0.00046583562,0.0015779538,0.0039500976,0.00003804481,0.00041426258,0.000385508,0.00005582683,0.0027701573],"genre_scores_gemma":[0.993797,0.00004502712,0.00077353814,0.0000082444385,0.000024092964,0.0000011223858,0.000059870305,0.000009861975,0.0052812584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962053,0.0005176969,0.0003287706,0.0008267737,0.0017490842,0.00037237495],"domain_scores_gemma":[0.9968114,0.0010766718,0.00013171019,0.0013068424,0.00050861895,0.00016479455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048102182,0.00013566183,0.0004637543,0.0024326167,0.0002462159,0.00006859858,0.0014504136,0.000068144145,0.00075765536],"category_scores_gemma":[0.00047840743,0.000105404724,0.00024008936,0.009469971,0.0014317639,0.00048744207,0.00029745806,0.00037919628,0.00013724656],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006155943,0.0036675422,0.068951234,0.00096560136,0.014004813,0.0016330467,0.1575466,0.010974175,0.18654408,0.096933305,0.21282305,0.23980063],"study_design_scores_gemma":[0.0023046567,0.0019659942,0.3422571,0.0004417253,0.0019397849,0.00007800629,0.039521664,0.0098956935,0.031372778,0.041225012,0.5276805,0.0013170796],"about_ca_topic_score_codex":0.000547033,"about_ca_topic_score_gemma":0.00024747718,"teacher_disagreement_score":0.31485742,"about_ca_system_score_codex":0.0000779523,"about_ca_system_score_gemma":0.00032207838,"threshold_uncertainty_score":0.8295795},"labels":[],"label_agreement":null},{"id":"W7116084461","doi":"10.2139/ssrn.5938297","title":"Misaligned Agents","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","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":"HEC Montréal; Queen's University","funders":"","keywords":"Incentive; Dimension (graph theory); Perspective (graphical); Prosocial behavior; Private information retrieval; Performance measurement; Information asymmetry","score_opus":0.05241929075018149,"score_gpt":0.3856696607416569,"score_spread":0.3332503699914754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116084461","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.2166949,0.023497436,0.49361444,0.027717467,0.010839866,0.0030928762,0.00033257066,0.00025191176,0.22395854],"genre_scores_gemma":[0.78022337,0.020158056,0.0002705008,0.0005711842,0.00083531067,0.000056834342,0.0000147635,0.00003444301,0.19783555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9854628,0.001584207,0.002619978,0.0016260751,0.0022954752,0.006411478],"domain_scores_gemma":[0.99307007,0.0013565009,0.0019077334,0.0021764226,0.0010111559,0.00047810984],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.025436336,0.0008514015,0.0011672986,0.00094962737,0.0017293505,0.0011869506,0.005620768,0.0007510599,0.0026165063],"category_scores_gemma":[0.0017817257,0.000737404,0.0012834677,0.0016342541,0.00040321026,0.00035986194,0.0015127274,0.011543773,0.002864492],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017523608,0.00033814737,0.00022372243,0.000015653188,0.0006466195,0.0000061687188,0.00063638494,0.00087129156,0.000114622,0.80185264,0.002213353,0.19290616],"study_design_scores_gemma":[0.00076621276,0.00017921833,0.00024684332,0.00017514997,0.00027150745,0.00034160604,0.0052211094,0.00081440015,0.00014842281,0.90670127,0.084551126,0.00058314035],"about_ca_topic_score_codex":0.00006263144,"about_ca_topic_score_gemma":0.0003056261,"teacher_disagreement_score":0.5635285,"about_ca_system_score_codex":0.0024390083,"about_ca_system_score_gemma":0.024568241,"threshold_uncertainty_score":0.9998499},"labels":[],"label_agreement":null},{"id":"W7116780730","doi":"10.1007/s10726-025-09955-8","title":"Investigating Limited-Move Stabilities in the Graph Model for Conflict Resolution with Unknown Preference","year":2025,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Innovation Cluster (Canada)","funders":"National Natural Science Foundation of China","keywords":"Stability (learning theory); Preference; Conflict resolution; Graph; Graph theory; Conflict analysis","score_opus":0.15392849835903863,"score_gpt":0.36647879713809983,"score_spread":0.2125502987790612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116780730","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.5541777,0.00010592447,0.44324023,0.00095046783,0.00003454707,0.0005091772,0.000012555763,0.000019275489,0.0009501379],"genre_scores_gemma":[0.99167293,0.00003192952,0.0070001916,0.0007488327,0.000015665555,0.00018320442,0.000014858856,0.0000047300864,0.0003276482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981984,0.0002088406,0.00050539675,0.00042251535,0.0004929682,0.00017189381],"domain_scores_gemma":[0.9943933,0.0047165835,0.00016896655,0.00045260516,0.0002260168,0.000042549953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031025743,0.0001224569,0.00017231818,0.00028900694,0.00035030817,0.000259726,0.00037162198,0.00007835065,0.000009696636],"category_scores_gemma":[0.00225327,0.00007185004,0.000043776385,0.0010222973,0.00016879653,0.00035032726,0.0000562382,0.00013113742,0.000004481282],"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.00022130545,0.000094999574,0.005708628,0.000012898985,0.000006973986,1.3479813e-7,0.006183755,0.009685852,0.0006489638,0.8623961,0.0013135754,0.113726795],"study_design_scores_gemma":[0.00060295657,0.00006736502,0.055948332,0.000059452836,0.000011455129,0.0000011515825,0.0023553919,0.29774052,0.00008630009,0.64110947,0.0019266446,0.000090969836],"about_ca_topic_score_codex":0.000017663635,"about_ca_topic_score_gemma":0.00035665193,"teacher_disagreement_score":0.43749523,"about_ca_system_score_codex":0.000024079229,"about_ca_system_score_gemma":0.000051906638,"threshold_uncertainty_score":0.29299596},"labels":[],"label_agreement":null},{"id":"W7123342435","doi":"10.1109/cdc57313.2025.11312166","title":"Perturbation Analysis with Q-Noise in LQG Graphon Mean Field Games","year":2025,"lang":"","type":"article","venue":"","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":"Polytechnique Montréal; McGill University","funders":"","keywords":"Perturbation (astronomy); Eigenfunction; Quadratic equation; Gaussian; Mean field theory; Linear-quadratic-Gaussian control; Singular perturbation","score_opus":0.025146211401501112,"score_gpt":0.34125882960362025,"score_spread":0.3161126182021191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123342435","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.6274632,0.0003740081,0.20439358,0.010832602,0.00013529065,0.0004937466,0.000009359885,0.000049491817,0.1562487],"genre_scores_gemma":[0.93831104,0.0000926752,0.00077128905,0.001423656,0.00001621111,0.00005349515,0.0000056077556,0.0000048839265,0.05932114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969798,0.00032362022,0.0008648504,0.00086166704,0.0006481973,0.00032188467],"domain_scores_gemma":[0.9958029,0.0024462694,0.00020860622,0.0011588655,0.00027537392,0.00010801928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018846634,0.0002410749,0.0005112986,0.002035236,0.0002454226,0.00036626097,0.0008107439,0.00015780231,0.0049227555],"category_scores_gemma":[0.0005392107,0.00016719943,0.00027343488,0.0137501275,0.00019225216,0.00036269712,0.00011624679,0.0002521789,0.00017003735],"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.0005628721,0.0007641112,0.15327701,0.000021763502,0.00070510147,0.000007743723,0.0054977266,0.0061583044,0.0006853249,0.62120676,0.0047310055,0.20638226],"study_design_scores_gemma":[0.0020121352,0.00047625968,0.17580314,0.00019999471,0.002277768,0.000002617051,0.02602009,0.08559543,0.014949342,0.6715687,0.020034863,0.0010596702],"about_ca_topic_score_codex":0.00029862538,"about_ca_topic_score_gemma":0.003721986,"teacher_disagreement_score":0.31084785,"about_ca_system_score_codex":0.000040838233,"about_ca_system_score_gemma":0.00015001684,"threshold_uncertainty_score":0.9959869},"labels":[],"label_agreement":null},{"id":"W7123348782","doi":"10.1109/cdc57313.2025.11312910","title":"Bi-threshold Decision-making Dynamics","year":2025,"lang":"","type":"article","venue":"","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":"Brock University; Statistics Canada","funders":"","keywords":"Dynamics (music); Population; Finite set; Amplitude; Discrete time and continuous time; Stochastic process","score_opus":0.03644674465688286,"score_gpt":0.40066667104712905,"score_spread":0.3642199263902462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123348782","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.056817267,0.00043623094,0.51452684,0.003702642,0.0012415306,0.00037121584,0.00003334899,0.000084493135,0.42278644],"genre_scores_gemma":[0.92813885,0.000076741075,0.0078728,0.0021235107,0.00006813005,0.000029553798,0.0000022314757,0.000014485874,0.06167371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543387,0.00015036021,0.0015113312,0.0011951905,0.0011114038,0.0005978302],"domain_scores_gemma":[0.9890035,0.0077744303,0.000273622,0.0022833142,0.00048867235,0.00017649456],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0035493143,0.00035649425,0.000522084,0.00082286436,0.0009927289,0.0010616267,0.0026737405,0.00028887432,0.011378865],"category_scores_gemma":[0.002854648,0.00028648393,0.00035120468,0.004698578,0.00049225107,0.00043330927,0.0010038265,0.0004289539,0.005234798],"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.000044484736,0.0001129999,0.0010449913,0.0000036445033,0.000020065734,0.0000029863934,0.00006904829,0.00045769452,0.000023731518,0.5875875,0.010049964,0.40058294],"study_design_scores_gemma":[0.00024364732,0.000026594202,0.0018157708,0.0002309635,0.000046264344,0.0000046512305,0.0019168699,0.13664035,0.00010617774,0.81468177,0.04402147,0.000265464],"about_ca_topic_score_codex":0.0000089308605,"about_ca_topic_score_gemma":0.00018223065,"teacher_disagreement_score":0.87132156,"about_ca_system_score_codex":0.0001695047,"about_ca_system_score_gemma":0.0003942144,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W7124137026","doi":"10.65109/dcqq8259","title":"Budgetary Effects on Pricing Equilibrium in Online Markets","year":2016,"lang":"","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Submodular set function; Budget constraint; Valuation (finance); Nash equilibrium; Clearing; Market clearing; Counterintuitive; Function (biology)","score_opus":0.042407921434427356,"score_gpt":0.34576416290960355,"score_spread":0.3033562414751762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124137026","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.9435596,0.00015499206,0.0031030804,0.014106815,0.0005434766,0.0006428065,0.000028041859,0.000059082817,0.03780214],"genre_scores_gemma":[0.9701406,0.000054793498,0.0006629073,0.0016124138,0.00022191825,0.00002640946,0.0000018169387,0.000020808182,0.027258378],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.995617,0.00078719895,0.0009981954,0.0010410093,0.00090636,0.0006502513],"domain_scores_gemma":[0.9851671,0.012899784,0.00022547273,0.001330022,0.00011005353,0.000267608],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0034680925,0.00032930775,0.00047850443,0.00049807923,0.00011226131,0.000122062236,0.0011757278,0.00017356814,0.004530213],"category_scores_gemma":[0.0027310664,0.00018307337,0.00016878947,0.0013522314,0.00022506245,0.0004728939,0.00037351975,0.00023526845,0.0057422747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039557467,0.00073307334,0.0067352727,0.000023995082,0.000017025657,0.000033724842,0.00021453727,0.000024053365,0.07445057,0.01919632,0.0033556195,0.8948202],"study_design_scores_gemma":[0.0052356664,0.0010878453,0.47951606,0.0019185357,0.000056523906,0.000026940217,0.0007125877,0.0034154882,0.14449902,0.324624,0.037478693,0.0014286328],"about_ca_topic_score_codex":0.00001290742,"about_ca_topic_score_gemma":0.000034206336,"teacher_disagreement_score":0.8933916,"about_ca_system_score_codex":0.00008931937,"about_ca_system_score_gemma":0.0001154445,"threshold_uncertainty_score":0.9963798},"labels":[],"label_agreement":null},{"id":"W7124156347","doi":"10.65109/foxf6427","title":"Empathetic social choice on social networks","year":2014,"lang":"","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Social choice theory; Preference; Maximization; Social preferences; Social network (sociolinguistics); Value (mathematics); Utility maximization; Social Welfare","score_opus":0.120020358915993,"score_gpt":0.40382310164067686,"score_spread":0.28380274272468387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124156347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3378072,0.000050634266,0.11818788,0.02159673,0.0016908655,0.00065156695,0.000022873484,0.0002067927,0.51978546],"genre_scores_gemma":[0.97208846,0.0000057622915,0.00007923899,0.0032007704,0.003285462,0.00003334525,0.0000033862937,0.000025234202,0.021278335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995584,0.00091867504,0.0008390505,0.0008740433,0.0011036661,0.0006805341],"domain_scores_gemma":[0.9957148,0.0028764745,0.000362325,0.0006169215,0.0002251618,0.00020431934],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0037279811,0.00033284372,0.0004912079,0.00014232632,0.0023295009,0.0005747749,0.0014113961,0.00035983612,0.008568714],"category_scores_gemma":[0.00071764167,0.00026945968,0.00040636756,0.0010678654,0.0006370059,0.00018235811,0.0002227155,0.00052124605,0.008608231],"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.000043420252,0.00028588192,0.00009150605,0.0000019972479,0.000015333506,3.1070596e-7,0.0013736611,0.00031364968,0.00004072308,0.5704667,0.038314607,0.3890522],"study_design_scores_gemma":[0.0012684545,0.000319011,0.03243825,0.000018289038,0.0001018214,0.0000031196603,0.0019653363,0.04412207,0.00016545145,0.3189082,0.5997989,0.0008910593],"about_ca_topic_score_codex":0.000015277354,"about_ca_topic_score_gemma":0.000023493583,"teacher_disagreement_score":0.6342813,"about_ca_system_score_codex":0.000045388424,"about_ca_system_score_gemma":0.00006355414,"threshold_uncertainty_score":0.99997574},"labels":[],"label_agreement":null},{"id":"W7124240789","doi":"10.65109/gzfu8152","title":"Game of Thoughts: Iterative Reasoning in Game-Theoretic Domains with Large Language Models","year":2025,"lang":"","type":"article","venue":"","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":"Google (Canada); University of Waterloo","funders":"","keywords":"Action (physics); Cognition; Hierarchy; Resource allocation; Resource (disambiguation); Game theory; Visual reasoning","score_opus":0.019580955395501497,"score_gpt":0.3480464282384963,"score_spread":0.3284654728429948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124240789","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.492201,0.0006281354,0.36771882,0.0004416484,0.000059284957,0.0005833139,0.000075516524,0.00003098779,0.13826129],"genre_scores_gemma":[0.97669655,0.00006988503,0.0039706384,0.00039894483,0.000030821288,0.00007474214,0.000006525745,0.00001633227,0.01873554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959912,0.00074406154,0.0011170837,0.00086560135,0.0007213449,0.00056075095],"domain_scores_gemma":[0.99591935,0.0020270112,0.00037040998,0.0012444996,0.00031485077,0.00012387508],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033024952,0.00033817842,0.0007050508,0.0006075056,0.00014559117,0.00021952175,0.0010332055,0.00016367523,0.0011038311],"category_scores_gemma":[0.0004756045,0.00023059692,0.00014627894,0.0034125394,0.0007138802,0.0005942052,0.0002948064,0.00038005167,0.00008992698],"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.0002591286,0.00038859586,0.0006590204,0.000028867547,0.000038058166,0.000014392202,0.02842856,0.0029159377,0.0005090126,0.9641422,0.00007071715,0.0025455297],"study_design_scores_gemma":[0.0022309232,0.00018590348,0.000763124,0.0010326371,0.00007400156,0.00000782022,0.049721263,0.100585446,0.012267624,0.8318074,0.0009389549,0.00038493492],"about_ca_topic_score_codex":0.000035673445,"about_ca_topic_score_gemma":0.00027459106,"teacher_disagreement_score":0.48449558,"about_ca_system_score_codex":0.0000672621,"about_ca_system_score_gemma":0.0002898606,"threshold_uncertainty_score":0.9998093},"labels":[],"label_agreement":null},{"id":"W7124302126","doi":"10.65109/slpd9249","title":"The Triangles of Dishonesty: Modelling the Evolution of Lies, Bullshit, and Deception in Agent Societies","year":2024,"lang":"","type":"article","venue":"","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":"Ontario Tech University","funders":"","keywords":"Deception; Dishonesty; Disinformation; Interrogation; Collusion; Game theory; Attractiveness; Stochastic game","score_opus":0.07679846169592856,"score_gpt":0.34158389646545484,"score_spread":0.26478543476952626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124302126","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.8301384,0.031150581,0.12988092,0.005783414,0.0003118697,0.0005351787,0.000027693795,0.000017196018,0.0021547512],"genre_scores_gemma":[0.9912215,0.004370978,0.00023558317,0.000014535843,0.000045861565,0.000031416184,8.9959605e-7,0.0000070848746,0.004072147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760115,0.0003669209,0.00092354347,0.0003273931,0.0005895244,0.00019147631],"domain_scores_gemma":[0.9950393,0.004109682,0.0002049638,0.00046652395,0.00014249147,0.000037036694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053222757,0.00013470039,0.0002284449,0.00011629823,0.00035974348,0.00026375588,0.00049077073,0.00009231201,0.00013092619],"category_scores_gemma":[0.0002389379,0.00006551814,0.00014974104,0.001083952,0.001089469,0.0002232749,0.00015776888,0.00018590664,0.000026815092],"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.000113367256,0.0001218037,0.0004330987,0.000073707284,0.0000479947,4.0107153e-7,0.015165492,0.02958771,0.0019734087,0.8372671,0.0016364539,0.113579445],"study_design_scores_gemma":[0.0001488637,0.000053409905,0.00086412445,0.0001384595,0.000049743787,0.0000031155198,0.059765305,0.34064028,0.0009343763,0.5910734,0.006233693,0.0000952578],"about_ca_topic_score_codex":0.0002293655,"about_ca_topic_score_gemma":0.00016106167,"teacher_disagreement_score":0.31105256,"about_ca_system_score_codex":0.00006223521,"about_ca_system_score_gemma":0.0001693362,"threshold_uncertainty_score":0.4014194},"labels":[],"label_agreement":null},{"id":"W7124303883","doi":"10.65109/sjjn3653","title":"Is Nash Equilibrium Approximator Learnable?","year":2023,"lang":"","type":"article","venue":"","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Learnability; Nash equilibrium; Generalization; Function (biology); Upper and lower bounds; Probably approximately correct learning","score_opus":0.17403200595065782,"score_gpt":0.4127392377308282,"score_spread":0.2387072317801704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124303883","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.53900224,0.00021726538,0.0053202165,0.0309952,0.0012711865,0.00089618954,0.00011953812,0.00080101483,0.42137715],"genre_scores_gemma":[0.6024477,0.000049850005,0.00039950933,0.0011487963,0.00016991096,0.000049627462,0.000004980847,0.000025505438,0.39570412],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949544,0.00028380562,0.0010809375,0.0012138073,0.0015525054,0.0009145658],"domain_scores_gemma":[0.99541056,0.0016609527,0.00026255462,0.0019056296,0.00031454422,0.0004457635],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0046203155,0.00032809176,0.00046703764,0.0004643712,0.0005097234,0.00090030674,0.0020716127,0.00022715067,0.05154698],"category_scores_gemma":[0.0010094073,0.00026380763,0.00034871275,0.005806886,0.00048598374,0.0006426719,0.0009749643,0.0003326063,0.21939456],"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.0000485925,0.00020982139,0.0012552339,0.000032550666,0.000056574183,0.000014960209,0.0025735255,0.00018821385,0.009808602,0.26856512,0.6692416,0.048005193],"study_design_scores_gemma":[0.0004109103,0.000079307654,0.001595178,0.000024363871,0.00002986083,0.000011777229,0.006374292,0.030475639,0.0118006,0.37498313,0.5737274,0.0004875172],"about_ca_topic_score_codex":0.000016049138,"about_ca_topic_score_gemma":0.0000023871983,"teacher_disagreement_score":0.16784757,"about_ca_system_score_codex":0.000029237384,"about_ca_system_score_gemma":0.00022586313,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W7124309048","doi":"10.65109/hshm6853","title":"Learning the Stackelberg Equilibrium in a Newsvendor Game","year":2023,"lang":"","type":"article","venue":"","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":"University of Ottawa","funders":"","keywords":"Stackelberg competition; Newsvendor model; Regret; Uniqueness; Repeated game; Nash equilibrium; Best response; Game theory; Convergence (economics)","score_opus":0.10212086658958563,"score_gpt":0.3913403081715845,"score_spread":0.28921944158199886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124309048","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.9092772,0.00013774858,0.00075015554,0.022414356,0.0004100788,0.00059245457,0.000009176451,0.00018777346,0.06622107],"genre_scores_gemma":[0.83662754,0.00007973319,0.000038118123,0.0003779367,0.00012174249,0.00007629261,0.0000036329466,0.000019081217,0.16265593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953426,0.0010436923,0.0010143088,0.0007827423,0.0010244551,0.0007922162],"domain_scores_gemma":[0.9920554,0.0062831608,0.0002335252,0.0011331266,0.00012444837,0.00017030947],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0075371936,0.00024444505,0.00034744924,0.0004186865,0.00032025276,0.0006098206,0.0018080858,0.00012225006,0.008660709],"category_scores_gemma":[0.0030062865,0.00015028732,0.00020522655,0.006769592,0.00044815883,0.0003851518,0.00080842583,0.000687872,0.035380073],"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.0002839685,0.00042765084,0.016093459,0.000028270719,0.00007259432,0.00009009231,0.036087323,0.07002523,0.020857465,0.39009377,0.059234597,0.4067056],"study_design_scores_gemma":[0.00090922427,0.00021055958,0.020385625,0.000054113465,0.000024254974,0.000014652739,0.045002084,0.118470095,0.001645699,0.29946,0.51331276,0.00051094993],"about_ca_topic_score_codex":0.000090707734,"about_ca_topic_score_gemma":0.00014172915,"teacher_disagreement_score":0.45407814,"about_ca_system_score_codex":0.0000377711,"about_ca_system_score_gemma":0.00018558878,"threshold_uncertainty_score":0.9922455},"labels":[],"label_agreement":null},{"id":"W7132887053","doi":"","title":"Distributed (Generalized) Nash Equilibrium Seeking in the Partial-Decision Information Setting","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Nash equilibrium; Epsilon-equilibrium; Best response; Equilibrium selection; Solution concept; Correlated equilibrium; Risk dominance; Graph","score_opus":0.04415021271894497,"score_gpt":0.406472760256515,"score_spread":0.36232254753757004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132887053","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.96114147,0.0003919898,0.019408446,0.0043192455,0.0017636468,0.0021110727,0.00032651745,0.00010858676,0.010429009],"genre_scores_gemma":[0.9912006,0.000070634516,0.000520123,0.00071106246,0.0001946789,0.0006292039,0.0041803704,0.000036228223,0.0024570809],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904888,0.0018950056,0.0024552285,0.00092796783,0.0033537748,0.0008792205],"domain_scores_gemma":[0.9907658,0.0048638126,0.0019414956,0.0018133668,0.00044692398,0.0001685957],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01141988,0.0006392878,0.0007285351,0.00067585835,0.001480145,0.0016405113,0.0030789105,0.00039151727,0.005546291],"category_scores_gemma":[0.004483854,0.00049818907,0.00040172812,0.0045989635,0.00015160575,0.0015237647,0.00047241917,0.0014251894,0.0010244607],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002312541,0.0008667677,0.0022616345,0.00023535446,0.0001314741,0.00004842137,0.49555144,0.08026201,0.009453839,0.07770379,0.041861698,0.28931102],"study_design_scores_gemma":[0.0018467505,0.00020135684,0.00880541,0.00031855833,0.00016651707,0.000039829127,0.41118306,0.06870027,0.0015650729,0.038157646,0.4676769,0.0013386125],"about_ca_topic_score_codex":0.00028542482,"about_ca_topic_score_gemma":0.00013141752,"teacher_disagreement_score":0.4258152,"about_ca_system_score_codex":0.00024644323,"about_ca_system_score_gemma":0.00043673947,"threshold_uncertainty_score":0.9998198},"labels":[],"label_agreement":null},{"id":"W7148614598","doi":"10.1007/978-3-032-07031-9_6","title":"Rent-Seeking Games in Cloud Networking","year":2025,"lang":"en","type":"book-chapter","venue":"Static & dynamic game theory: foundations & applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université du Québec à Trois-Rivières; Innovation and Economic Development Trois Rivières","funders":"","keywords":"Cloud computing; Virtualization; Key (lock); Network virtualization; Virtual machine; Cloud computing security; Virtual network; Resource (disambiguation); Transmission (telecommunications)","score_opus":0.04586341987758033,"score_gpt":0.36695825155664596,"score_spread":0.3210948316790656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148614598","genre_codex":"methods","genre_gemma":"other","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.00010624313,0.00061362266,0.51918226,0.001674271,0.0004925344,0.0025195405,0.00045992207,0.00026553933,0.47468606],"genre_scores_gemma":[0.19064865,0.0005928407,0.0044332272,0.0006858322,0.00045810005,0.0028539915,0.0013930579,0.00018238433,0.79875195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925743,0.00051078503,0.0027291174,0.0019763173,0.0013733384,0.00083616126],"domain_scores_gemma":[0.9860963,0.0077745784,0.0015536812,0.0036338032,0.0006845981,0.00025701054],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004965572,0.00088897435,0.0012478643,0.0018410832,0.0008170063,0.0007139473,0.0027737857,0.00050740887,0.0025348777],"category_scores_gemma":[0.00077527366,0.00088946533,0.00050155044,0.0016414326,0.0010605572,0.00035050558,0.00056433596,0.0012672201,0.0033270794],"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.000025380401,0.000089297755,0.000018333101,0.000022366721,0.00010299191,0.0000021834762,0.00048077284,0.00061809726,0.000023969893,0.83341676,0.0017111029,0.16348878],"study_design_scores_gemma":[0.00025891792,0.000017860668,0.00007096876,0.0001795798,0.00016683119,0.000007063335,0.00038300082,0.0048626545,0.0000011341136,0.6162299,0.3773511,0.00047098528],"about_ca_topic_score_codex":0.000026911312,"about_ca_topic_score_gemma":0.00046920023,"teacher_disagreement_score":0.51474905,"about_ca_system_score_codex":0.0006514991,"about_ca_system_score_gemma":0.0007840244,"threshold_uncertainty_score":0.9993556},"labels":[],"label_agreement":null},{"id":"W7148627483","doi":"10.70675/e088b7bezda95z4d47zaaa9z8a28b285c296","title":"Instances of uniqueness restoration and equilibria selection in mean field games","year":2018,"lang":"","type":"dissertation","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Game studies; Video game; Selection (genetic algorithm); Ligne","score_opus":0.0531549397604579,"score_gpt":0.3912682581230599,"score_spread":0.33811331836260194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148627483","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.9737978,0.00025992314,0.0063936715,0.00020865646,0.0003310632,0.00060018816,0.000009824412,0.000025593621,0.018373298],"genre_scores_gemma":[0.99147975,0.00029354598,0.0011638994,0.000059707665,0.00008460235,0.00006324785,0.000041583233,0.000015889043,0.0067977575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962554,0.00046938093,0.0014625555,0.0008351891,0.00072337745,0.00025410915],"domain_scores_gemma":[0.9964897,0.0012929855,0.0009456081,0.00039651492,0.0007813696,0.000093802344],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026289981,0.00031469992,0.00059049117,0.0007562856,0.00020542585,0.00019737268,0.00051845703,0.0004818905,0.0011967],"category_scores_gemma":[0.0010160466,0.000276485,0.000087394306,0.0019736746,0.00026175153,0.00082395255,0.00005897196,0.00027307728,0.000039218394],"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.002828095,0.0006286624,0.026421927,0.0004257026,0.00008649306,0.0000020423408,0.036107037,0.00012259964,0.18657503,0.38449267,0.0020285905,0.36028114],"study_design_scores_gemma":[0.0010771581,0.0013399149,0.057200998,0.0009062599,0.00010648205,0.000008809151,0.03254567,0.008184321,0.3632137,0.5282488,0.0061588045,0.0010091327],"about_ca_topic_score_codex":0.00045197833,"about_ca_topic_score_gemma":0.017459469,"teacher_disagreement_score":0.35927203,"about_ca_system_score_codex":0.00004390443,"about_ca_system_score_gemma":0.00032185932,"threshold_uncertainty_score":0.9999687},"labels":[],"label_agreement":null},{"id":"W7164922887","doi":"10.1080/17153379.2013.12556866","title":"Asian Rivalries: Conflict, Escalation, and Limitations on Two-level Games.","year":2013,"lang":"en","type":"article","venue":"Pacific Affairs","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"East Asia; South asia","score_opus":0.13505298377969235,"score_gpt":0.33960863986947626,"score_spread":0.2045556560897839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7164922887","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015737342,0.00005237316,0.011576748,0.0053453906,0.00014658336,0.00047302127,0.000049661856,0.00010366574,0.96651524],"genre_scores_gemma":[0.98521906,0.000019429093,0.002074021,0.000062719424,0.000063872176,0.0001277941,0.000013511975,0.000013094829,0.012406489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820626,0.00014409752,0.0004278843,0.00046341404,0.0005263034,0.00023206513],"domain_scores_gemma":[0.996703,0.002001335,0.0001568106,0.00067216967,0.00026629548,0.00020035538],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00076971884,0.00015319802,0.00019299462,0.00019120281,0.0003253064,0.00035183766,0.00033689215,0.00006181353,0.0010732451],"category_scores_gemma":[0.0015376243,0.000118206895,0.00006499717,0.0005445719,0.00033845153,0.00034081496,0.000055454373,0.00013696367,0.0074345516],"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.000023685303,0.00020147399,0.0017285018,0.0000050161316,0.0000359042,0.0000016412961,0.015326792,0.00023056172,0.0014660313,0.6051215,0.05928481,0.3165741],"study_design_scores_gemma":[0.00086890423,0.00013847067,0.059271365,0.000027767941,0.000026274056,0.000017833956,0.269224,0.0028932872,0.00062380783,0.495264,0.17111146,0.0005328239],"about_ca_topic_score_codex":0.000010080658,"about_ca_topic_score_gemma":0.000017396043,"teacher_disagreement_score":0.9694817,"about_ca_system_score_codex":0.000017717031,"about_ca_system_score_gemma":0.000032135937,"threshold_uncertainty_score":0.9998399},"labels":[],"label_agreement":null},{"id":"W76868003","doi":"10.1007/0-387-24602-9_5","title":"Consistent Conjectures, Equilibria and Dynamic Games","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Nash equilibrium; Consistency (knowledge bases); Mathematical economics; Best response; Time consistency; Differential (mechanical device); Mathematics; Game theory; Economics; Discrete mathematics; Physics","score_opus":0.07456134028518495,"score_gpt":0.3560178293754057,"score_spread":0.28145648909022075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76868003","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008972196,0.0015730943,0.00068103074,0.0017682356,0.000106732645,0.00027986665,0.00008198137,0.00007589033,0.9945359],"genre_scores_gemma":[0.08369602,0.00014255794,0.0005848177,0.00075267203,0.00007616576,0.000007847023,0.000014092795,0.000022421556,0.9147034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979907,0.000032649805,0.00056389894,0.00064614846,0.0005921379,0.00017441463],"domain_scores_gemma":[0.9975385,0.0010930282,0.00025137342,0.00083352305,0.00013748324,0.00014608218],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007337446,0.00026653564,0.00043271924,0.00018379604,0.000101867816,0.00021696843,0.0004939335,0.00023986312,0.012916638],"category_scores_gemma":[0.00016040512,0.00018347145,0.00015009026,0.000038356022,0.00044901032,0.000077285025,0.00022332717,0.0002262645,0.0022189599],"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.000008753705,0.00000552845,0.0000029053313,0.0000020467166,0.000022020971,0.0000026913774,0.000037926267,0.0000028677107,0.000107805514,0.9236878,0.0113909105,0.06472875],"study_design_scores_gemma":[0.00008041364,0.000014467233,0.000045633125,0.0000114374325,0.000020664449,0.000028202503,0.000025589277,0.000172042,0.000008995431,0.45644072,0.5430043,0.00014753216],"about_ca_topic_score_codex":0.00000310167,"about_ca_topic_score_gemma":0.00008733211,"teacher_disagreement_score":0.5316134,"about_ca_system_score_codex":0.000024572202,"about_ca_system_score_gemma":0.000065380555,"threshold_uncertainty_score":0.9985579},"labels":[],"label_agreement":null},{"id":"W79118343","doi":"10.1111/caje.12011","title":"On input market surplus and its relation to the downstream market game","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Economics/Revue canadienne d économique","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Downstream (manufacturing); Economics; Order (exchange); Function (biology); Microeconomics; Economic surplus; Relation (database); Mathematical economics; Welfare; Computer science; Market economy; Operations management","score_opus":0.1453054325348221,"score_gpt":0.23056073320715278,"score_spread":0.0852553006723307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79118343","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.9669501,0.0000778543,0.00006528197,0.019456787,0.0006451186,0.00046169347,0.00012337556,0.0000039065635,0.012215861],"genre_scores_gemma":[0.9904035,0.000027495229,0.00009619338,0.0020966583,0.0003234212,0.00003698823,0.0000021569597,0.000022472634,0.006991118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793756,0.00022062582,0.00093244464,0.00038802586,0.000009714536,0.00051163347],"domain_scores_gemma":[0.9951312,0.0014583435,0.00056808087,0.00060784933,0.00033910596,0.0018954263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029439174,0.00021351577,0.00040560286,0.0007045237,0.00026657552,0.00046077208,0.000978475,0.00012745071,0.0041549955],"category_scores_gemma":[0.0020698532,0.00017324864,0.00013170112,0.00026755675,0.000116176176,0.0005357168,0.0000362653,0.00032951575,0.00047281125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012691985,0.000016789892,0.003717008,0.000007281357,0.00009362413,0.000030010939,0.0022654203,0.0090062525,0.000026091615,0.8216646,0.12378777,0.039258238],"study_design_scores_gemma":[0.00044072565,0.0003011216,0.047777887,0.00005479973,0.00002350373,0.00037443324,0.00083511526,0.007130422,0.00004886426,0.80183804,0.14081122,0.00036383994],"about_ca_topic_score_codex":0.017783638,"about_ca_topic_score_gemma":0.78725034,"teacher_disagreement_score":0.7694667,"about_ca_system_score_codex":0.00061653636,"about_ca_system_score_gemma":0.0008222697,"threshold_uncertainty_score":0.99675536},"labels":[],"label_agreement":null}]}