{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035703555,0.0012107431,0.9930779,0.00046758814,0.000110274996,0.00007088332,0.00022089829,0.0002980914,0.004186659],"genre_scores_gemma":[0.036110617,0.0029712438,0.9503644,0.00049244636,0.00030340246,0.0006936664,0.00091535156,0.0006005659,0.007548238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683774,0.002059348,0.00010701688,0.00031721784,0.0006023849,0.0000762492],"domain_scores_gemma":[0.9962567,0.0026898042,0.00015035582,0.00042521843,0.0003915615,0.00008638128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029856921,0.0018943388,0.00137798,0.002435422,0.00087168254,0.0031838587,0.003708102,0.0020758505,0.012984373],"category_scores_gemma":[0.009863543,0.0007862984,0.0016391112,0.004616237,0.0018740881,0.005156741,0.0019267943,0.002942835,0.0038851057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006557984,0.00007197263,0.00029334115,0.00055790466,0.00017108822,0.00007169081,0.00033732413,0.051238123,0.0007422427,0.60928684,0.042900812,0.29426306],"study_design_scores_gemma":[0.000021752881,0.000010134637,0.000097403405,0.00008755859,0.00002910119,0.000056131576,0.000051952793,0.1736292,0.00031558823,0.79657733,0.029099338,0.000024500145],"about_ca_topic_score_codex":0.0044969665,"about_ca_topic_score_gemma":0.0037538763,"teacher_disagreement_score":0.012984373,"about_ca_system_score_codex":0.0015806584,"about_ca_system_score_gemma":0.0019379735,"threshold_uncertainty_score":0.043437004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002823275,0.01371625,0.21249038,0.008491092,0.001025525,0.00035349058,0.0010144509,0.00037098528,0.75971454],"genre_scores_gemma":[0.42799702,0.038579084,0.19371617,0.008158656,0.0017216116,0.0017621024,0.0025174937,0.00043231522,0.32511556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980069,0.0007229247,0.00012029903,0.0003683944,0.000629858,0.00015164095],"domain_scores_gemma":[0.99884486,0.00065093854,0.00006135784,0.00016101352,0.00020572371,0.00007610137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014627582,0.0014530296,0.001190152,0.0012125474,0.0014167359,0.005735634,0.0019794295,0.0022124103,0.027145397],"category_scores_gemma":[0.0040316945,0.00041239534,0.0007572857,0.0015189114,0.0038440463,0.0041885204,0.002063143,0.0031328413,0.0074711232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005674711,0.000012201359,0.00005682409,0.00008697531,0.000010519172,0.000028756596,0.00009330225,0.0019232411,0.00006906689,0.9747838,0.010063828,0.012865954],"study_design_scores_gemma":[0.000011384093,0.000012459771,0.000064302316,0.00010105152,0.0000055489836,0.000058905796,0.00007014376,0.003225522,0.000084864885,0.8745082,0.12184899,0.000008619724],"about_ca_topic_score_codex":0.0046645887,"about_ca_topic_score_gemma":0.0028056097,"teacher_disagreement_score":0.027145397,"about_ca_system_score_codex":0.0039706514,"about_ca_system_score_gemma":0.0025441526,"threshold_uncertainty_score":0.09081036},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08559278,0.00081103283,0.8738023,0.005804181,0.00034709982,0.00023277958,0.0015032591,0.0004933967,0.031413242],"genre_scores_gemma":[0.8997917,0.0006588046,0.08935266,0.0010283785,0.00041702748,0.00019898919,0.0012525,0.00014658418,0.007153279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702686,0.0012643897,0.00018332881,0.00046079254,0.0006801547,0.00038443258],"domain_scores_gemma":[0.98398304,0.010357567,0.00087705825,0.0017406718,0.0025001357,0.00054152875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042635556,0.0005017125,0.0010024399,0.0013059506,0.001467161,0.002274693,0.0013347537,0.0010644561,0.0116970325],"category_scores_gemma":[0.029354837,0.0005021622,0.0013484438,0.002057025,0.0034232426,0.0057707233,0.0029541687,0.0040765135,0.0010597167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007997553,0.000057779725,0.0011312005,0.0001341015,0.000032650587,0.00014277888,0.00037925973,0.004993968,0.0014554561,0.9783029,0.003355384,0.0099345865],"study_design_scores_gemma":[0.000021339292,0.000055872355,0.00060770166,0.000053691558,0.000026668951,0.00009797248,0.00010094404,0.0213047,0.0015607241,0.9713677,0.0047804336,0.000022219274],"about_ca_topic_score_codex":0.002521303,"about_ca_topic_score_gemma":0.0023088139,"teacher_disagreement_score":0.0116970325,"about_ca_system_score_codex":0.0020342534,"about_ca_system_score_gemma":0.0012364156,"threshold_uncertainty_score":0.03913045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34329697,0.0022002473,0.35038784,0.006436157,0.000486382,0.00023613367,0.0024941997,0.00035622934,0.29410583],"genre_scores_gemma":[0.8883951,0.0015340364,0.06930285,0.0009007622,0.00027695688,0.00026859946,0.00090626866,0.000112365764,0.038303073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848515,0.0005578755,0.0000558554,0.00021339052,0.00024530903,0.00044252202],"domain_scores_gemma":[0.9944154,0.0039595906,0.00050074706,0.00023682824,0.00032036717,0.00056704367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012496255,0.00062589045,0.0010624268,0.0017427233,0.0016371219,0.0035158677,0.0013033741,0.002163726,0.018754018],"category_scores_gemma":[0.0064646294,0.00038983847,0.00075316435,0.0015244277,0.002634643,0.005763601,0.0015303092,0.0026283208,0.0020638579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075513264,0.00003860539,0.00038392126,0.0000782116,0.000019978079,0.0000852066,0.00008964643,0.008895164,0.0007120096,0.9748921,0.005351081,0.009378681],"study_design_scores_gemma":[0.000025833573,0.000019559096,0.000372668,0.000030164394,0.000011550116,0.000105748084,0.00007142592,0.02677141,0.00026395466,0.96813536,0.004176961,0.00001549449],"about_ca_topic_score_codex":0.0017656107,"about_ca_topic_score_gemma":0.0026024946,"teacher_disagreement_score":0.018754018,"about_ca_system_score_codex":0.0018056004,"about_ca_system_score_gemma":0.001212783,"threshold_uncertainty_score":0.06273842},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13407707,0.00043467927,0.85090625,0.0005118817,0.00005133502,0.00014232393,0.0002557808,0.00018616967,0.013434457],"genre_scores_gemma":[0.91624844,0.0005126952,0.06908917,0.00015142036,0.000052289164,0.00029610778,0.000417351,0.000110861816,0.013121705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997687,0.0009509355,0.00010856115,0.00033782722,0.00044015597,0.00047546707],"domain_scores_gemma":[0.9845723,0.012333635,0.0010325772,0.0006239689,0.00072145584,0.0007159988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033094173,0.0012576962,0.0021615205,0.0018194468,0.00094797707,0.0038405857,0.0032027708,0.002130419,0.009958303],"category_scores_gemma":[0.02556804,0.0008595175,0.0011754916,0.0017933454,0.0024957696,0.004269493,0.002301265,0.002612127,0.0009395647],"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.00034089308,0.00014513607,0.0010534228,0.00014498652,0.00006718487,0.00015456005,0.00050796283,0.5299098,0.0008662277,0.45213443,0.0019800693,0.012695221],"study_design_scores_gemma":[0.000029738958,0.000033897755,0.00014302308,0.000028514327,0.000015629601,0.000040743038,0.0001163547,0.7856604,0.00021199863,0.21322006,0.00048837264,0.000011245421],"about_ca_topic_score_codex":0.004214103,"about_ca_topic_score_gemma":0.0040207994,"teacher_disagreement_score":0.009958303,"about_ca_system_score_codex":0.0033794153,"about_ca_system_score_gemma":0.0018979143,"threshold_uncertainty_score":0.03331381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27989244,0.0013766623,0.56621855,0.007021908,0.0007905431,0.00029029488,0.0024154645,0.0022362107,0.13975787],"genre_scores_gemma":[0.9083808,0.0007750683,0.06897492,0.001381654,0.00056091277,0.0005948548,0.0010388354,0.00082118856,0.017471738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967489,0.0005308563,0.00024541904,0.0006195556,0.0012089271,0.00064646656],"domain_scores_gemma":[0.9551484,0.032918315,0.0020832494,0.005342704,0.0027303568,0.0017769923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00345662,0.0015287355,0.002428838,0.0017156957,0.0024949873,0.005985426,0.0033721863,0.0032939482,0.024954356],"category_scores_gemma":[0.052982934,0.0013100293,0.0020435262,0.0019229183,0.0039315624,0.012979761,0.005813141,0.009671093,0.006455609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010700468,0.00020679855,0.0018813013,0.00044004197,0.000079577156,0.00071368256,0.0006570199,0.017824301,0.007665556,0.933397,0.0076286686,0.028435983],"study_design_scores_gemma":[0.000066145934,0.0000636425,0.00040159785,0.000055475306,0.000027310292,0.00038770953,0.0001792019,0.041803513,0.0033578817,0.95082617,0.0027955913,0.000035728237],"about_ca_topic_score_codex":0.00084339175,"about_ca_topic_score_gemma":0.0009205614,"teacher_disagreement_score":0.024954356,"about_ca_system_score_codex":0.0014631567,"about_ca_system_score_gemma":0.0016138202,"threshold_uncertainty_score":0.0834806},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090338394,0.0013508869,0.7497099,0.0032054342,0.00023078463,0.000094714094,0.0004300483,0.00013716624,0.15450267],"genre_scores_gemma":[0.92062104,0.0016441237,0.04572008,0.00035042793,0.00019098789,0.00031243562,0.00024705558,0.00010423448,0.0308096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995641,0.00015745965,0.00001911026,0.000091829555,0.00011122902,0.00005634189],"domain_scores_gemma":[0.99919766,0.00047872207,0.000082182334,0.000056402136,0.00013295363,0.00005216459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364774,0.0005797678,0.0007367504,0.0008607719,0.0007314107,0.001732087,0.00096451043,0.0007507742,0.010235333],"category_scores_gemma":[0.0034959042,0.00025066474,0.00092083286,0.0008644842,0.0016153737,0.0021403101,0.0012973963,0.0019256328,0.0006924259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007613829,0.0000055161936,0.000085881824,0.000019493835,0.000010034309,0.00003274787,0.000032397413,0.008446548,0.00023853696,0.98634315,0.0012634085,0.003514584],"study_design_scores_gemma":[0.00001160686,0.000012875135,0.0001518652,0.00001684344,0.00000515208,0.000035569297,0.000032675383,0.041722592,0.00021111294,0.9551931,0.002599908,0.0000066866132],"about_ca_topic_score_codex":0.0016573273,"about_ca_topic_score_gemma":0.0008022713,"teacher_disagreement_score":0.010235333,"about_ca_system_score_codex":0.0011039102,"about_ca_system_score_gemma":0.00087929657,"threshold_uncertainty_score":0.034240603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016329344,0.0012874458,0.8876018,0.0012066416,0.00022937251,0.00009594506,0.00019741757,0.00010971493,0.092942365],"genre_scores_gemma":[0.6999432,0.005436942,0.207248,0.00055206125,0.00032917742,0.00040229879,0.00030645495,0.00015652561,0.085625306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992632,0.00034534448,0.000022851107,0.00009057997,0.00021097825,0.00006699336],"domain_scores_gemma":[0.999012,0.00065611274,0.00008607586,0.000047841997,0.00015355382,0.000044402725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472824,0.000673461,0.00073393225,0.00069412193,0.00054173736,0.0020385736,0.0015981422,0.0010202802,0.010797201],"category_scores_gemma":[0.0039257575,0.00041766858,0.0004945514,0.0019140354,0.0012895168,0.0018996221,0.000750491,0.0013352488,0.000992956],"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.00001588562,0.000030412833,0.00012912376,0.00006580646,0.0000152277435,0.000051866464,0.000057826473,0.280855,0.00039193805,0.7016383,0.004033752,0.0127147585],"study_design_scores_gemma":[0.000014501884,0.000017571949,0.00014511272,0.00003610061,0.000011830665,0.00003624619,0.00006481245,0.66673064,0.00034080405,0.3274382,0.005150569,0.00001362812],"about_ca_topic_score_codex":0.004520151,"about_ca_topic_score_gemma":0.0051830974,"teacher_disagreement_score":0.010797201,"about_ca_system_score_codex":0.0020396602,"about_ca_system_score_gemma":0.0019722483,"threshold_uncertainty_score":0.036120236},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088050775,0.004762877,0.84202135,0.00383583,0.00030391887,0.00006557592,0.00019785904,0.00036641964,0.060395453],"genre_scores_gemma":[0.90328944,0.00510608,0.065682486,0.00037829395,0.00018766508,0.00015715364,0.000100481215,0.00016317303,0.024935147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918133,0.0003086342,0.000031564254,0.00019803419,0.00019929963,0.00008120589],"domain_scores_gemma":[0.9980698,0.0013315897,0.00016423262,0.00018222514,0.0001666146,0.00008562684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011734555,0.00087415817,0.0008939143,0.00057875196,0.0007255618,0.0032474464,0.0010519526,0.0011214969,0.0055178576],"category_scores_gemma":[0.0034887681,0.00036479151,0.00081549416,0.0011402094,0.0032396228,0.0047032493,0.0015746467,0.001333544,0.0004996179],"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.00015547936,0.000068455396,0.0018682183,0.00035458064,0.00009056318,0.00022613292,0.0007861892,0.23920266,0.004989252,0.7083186,0.0021649136,0.04177495],"study_design_scores_gemma":[0.0000391292,0.00011927708,0.0013879368,0.00014713759,0.00007879509,0.00017212663,0.000862456,0.5356271,0.0037842914,0.4398196,0.017907806,0.000054270626],"about_ca_topic_score_codex":0.004859167,"about_ca_topic_score_gemma":0.0024893177,"teacher_disagreement_score":0.0055178576,"about_ca_system_score_codex":0.0016497297,"about_ca_system_score_gemma":0.0011752307,"threshold_uncertainty_score":0.018459141},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003996752,0.000030293428,0.99469405,0.000026504193,0.000007249776,0.00004523818,0.000022962528,0.00018354812,0.0009933866],"genre_scores_gemma":[0.13479613,0.00011457255,0.86254686,0.000046619472,0.000015896761,0.0002976284,0.0001237894,0.00015362588,0.0019049536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00035078495,0.00005392277,0.00019646314,0.00036592723,0.00010855448],"domain_scores_gemma":[0.998314,0.00097285217,0.00014117296,0.0003481395,0.00017704541,0.000046731962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463475,0.00090782554,0.0013407232,0.00083496183,0.00077095337,0.00113721,0.0021435553,0.00078227243,0.005185092],"category_scores_gemma":[0.005996634,0.0006252627,0.0016693225,0.0008256867,0.0010948824,0.0024739325,0.0014081434,0.002396676,0.0009776899],"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.00018338114,0.00008980181,0.00074768474,0.00019192263,0.00011381304,0.00014836602,0.00049552735,0.6597254,0.006521335,0.23015688,0.0011372895,0.100488566],"study_design_scores_gemma":[0.000019330464,0.00004234921,0.0000623446,0.000018747329,0.000019476633,0.000043568896,0.000026488295,0.9230718,0.0021102817,0.072597854,0.001976464,0.000011312929],"about_ca_topic_score_codex":0.0041118893,"about_ca_topic_score_gemma":0.003887557,"teacher_disagreement_score":0.005185092,"about_ca_system_score_codex":0.0012682213,"about_ca_system_score_gemma":0.0012999115,"threshold_uncertainty_score":0.017345905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16276912,0.0002427797,0.8247012,0.0006154405,0.00003098412,0.0001325852,0.00007680845,0.0001916926,0.011239469],"genre_scores_gemma":[0.92360353,0.00035825107,0.06578885,0.00016584464,0.00006814317,0.00032528312,0.00015743749,0.00009126637,0.009441381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976993,0.0011510041,0.00010793771,0.0004049481,0.00040521,0.0002314752],"domain_scores_gemma":[0.98090154,0.01581983,0.0012325379,0.0007768561,0.0006876472,0.0005814894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032961955,0.00092281174,0.0017475139,0.0008851494,0.0009199362,0.0027895775,0.002519168,0.00182872,0.0030991472],"category_scores_gemma":[0.018769411,0.0010065362,0.001026789,0.0013926439,0.0028593566,0.003781906,0.003286005,0.0023732553,0.0004517333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023896179,0.00018669048,0.0016944621,0.00016858525,0.00015792051,0.00016432069,0.00046883523,0.31314135,0.0014243752,0.66166115,0.0016434962,0.019049905],"study_design_scores_gemma":[0.000051530667,0.00004754985,0.00018443866,0.000014982727,0.000014619736,0.000030150044,0.000059570437,0.54741555,0.00037045777,0.4514809,0.00031371572,0.000016611879],"about_ca_topic_score_codex":0.0014110921,"about_ca_topic_score_gemma":0.0019398929,"teacher_disagreement_score":0.0032961955,"about_ca_system_score_codex":0.0020440784,"about_ca_system_score_gemma":0.0015877215,"threshold_uncertainty_score":0.017432153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019334957,0.00024533452,0.9891676,0.00045033582,0.000059030855,0.00011179271,0.000039455477,0.00009552503,0.007897383],"genre_scores_gemma":[0.11208845,0.0009139558,0.8830316,0.00022264053,0.0000977905,0.00078943075,0.00017029123,0.000086086664,0.0025996878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959531,0.0023905674,0.00017409876,0.00035967233,0.00093593734,0.00018665606],"domain_scores_gemma":[0.9962392,0.0027253407,0.00030720196,0.00024558284,0.00032481828,0.00015784639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037308836,0.0019434636,0.0014649754,0.0056421813,0.0013264822,0.0047588507,0.002557193,0.0012966075,0.0054603596],"category_scores_gemma":[0.0073432224,0.0006398293,0.002570857,0.0043835915,0.0043895137,0.008273719,0.0027295477,0.002630075,0.00069613574],"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.000026873924,0.00004767882,0.00040758625,0.00017296482,0.00010938548,0.00015917103,0.0007652829,0.09795978,0.00043880098,0.8553273,0.0018027414,0.042782474],"study_design_scores_gemma":[0.00001891397,0.000028373497,0.00013411802,0.00006840717,0.00003183584,0.00010508007,0.0003532749,0.18938284,0.00018065944,0.80176944,0.00788698,0.000040148396],"about_ca_topic_score_codex":0.0036382382,"about_ca_topic_score_gemma":0.004741967,"teacher_disagreement_score":0.0056421813,"about_ca_system_score_codex":0.003940328,"about_ca_system_score_gemma":0.0030261169,"threshold_uncertainty_score":0.028589249},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0869432,0.0014763535,0.7145052,0.002944357,0.00028652875,0.00028377512,0.00031977278,0.0004970766,0.19274376],"genre_scores_gemma":[0.8666653,0.0014355909,0.09875037,0.00091868354,0.00033835357,0.0008427565,0.00032387738,0.00046810543,0.030256942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975205,0.0008274337,0.00014768651,0.0005770059,0.00055053143,0.00037678998],"domain_scores_gemma":[0.9932627,0.0037055633,0.00070995325,0.0006042999,0.0012327329,0.0004847263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028791951,0.0011645427,0.001284918,0.0031220273,0.0019612387,0.0034451461,0.0016727175,0.0024814834,0.01712696],"category_scores_gemma":[0.014768358,0.0005044783,0.0015655622,0.0014316406,0.0038011107,0.006571947,0.00486914,0.0030140223,0.0018096381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016339089,0.000021644122,0.0005476807,0.00006261919,0.00002022912,0.00008979389,0.00027974942,0.008752096,0.00046275387,0.98167026,0.0010626088,0.007014248],"study_design_scores_gemma":[0.000016233993,0.000034375495,0.00022291036,0.0000452796,0.000010557114,0.0001448921,0.00016599831,0.03318934,0.00045941691,0.9581709,0.0075257826,0.000014249313],"about_ca_topic_score_codex":0.00091621414,"about_ca_topic_score_gemma":0.0004944505,"teacher_disagreement_score":0.01712696,"about_ca_system_score_codex":0.0021485218,"about_ca_system_score_gemma":0.00091556844,"threshold_uncertainty_score":0.057295322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17236699,0.0010029316,0.666052,0.0066087022,0.0001599646,0.00017740052,0.0005321587,0.00016888912,0.15293111],"genre_scores_gemma":[0.9210335,0.0013281886,0.033491552,0.00048539118,0.00020662646,0.0003644488,0.00033877222,0.000081858656,0.042669553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895966,0.00047806953,0.000032926604,0.00020005892,0.00021564563,0.000113720744],"domain_scores_gemma":[0.99303985,0.0047817496,0.0007096399,0.00032238432,0.00063255406,0.0005137956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014188706,0.0008493771,0.0009348855,0.0012399015,0.0011879846,0.003488629,0.0011652996,0.0019344239,0.011038024],"category_scores_gemma":[0.01226875,0.0004716388,0.00050479354,0.001282587,0.0025457551,0.005219252,0.0019389486,0.0023355025,0.00094506104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017932995,0.000009577068,0.00007330745,0.000016474769,0.0000067662763,0.000033418906,0.00005497663,0.008770671,0.0001983691,0.9866969,0.0010695298,0.003052091],"study_design_scores_gemma":[0.000009057564,0.0000069227417,0.000051550473,0.0000052838654,0.000003395686,0.000023486207,0.000023123876,0.030169109,0.000082601946,0.9686618,0.00095991755,0.0000037768023],"about_ca_topic_score_codex":0.0014449327,"about_ca_topic_score_gemma":0.0013468971,"teacher_disagreement_score":0.011038024,"about_ca_system_score_codex":0.0020405864,"about_ca_system_score_gemma":0.00093147665,"threshold_uncertainty_score":0.036925912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905342,0.00007726141,0.006888661,0.00007365152,0.000011632832,0.00011381921,0.000041405565,0.00006459015,0.0021947776],"genre_scores_gemma":[0.99675447,0.000042599095,0.002599709,0.000022167053,0.00001322135,0.00006617702,0.00003608597,0.000013432014,0.000452072],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99064356,0.0059773386,0.00050153304,0.0007303568,0.0015357124,0.00061149255],"domain_scores_gemma":[0.73469126,0.2434265,0.011027022,0.005508781,0.0023294112,0.003017026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013416025,0.0006375797,0.0013158163,0.0009936577,0.0005392123,0.0020429231,0.00068830035,0.0008885162,0.004422032],"category_scores_gemma":[0.0966044,0.0005862785,0.00051916554,0.00048504968,0.0018257257,0.002002568,0.0013332799,0.0015310848,0.00033484283],"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.06734037,0.017707203,0.32107523,0.0014135805,0.0008198179,0.001557772,0.010447632,0.07762208,0.13667344,0.045769483,0.0014894761,0.31808403],"study_design_scores_gemma":[0.0054811263,0.025742592,0.44000068,0.00022056582,0.0006089223,0.0013526464,0.0023655014,0.27774593,0.049406115,0.19384187,0.0027612397,0.00047285893],"about_ca_topic_score_codex":0.00045168353,"about_ca_topic_score_gemma":0.0005193457,"teacher_disagreement_score":0.013416025,"about_ca_system_score_codex":0.0009687773,"about_ca_system_score_gemma":0.0005574605,"threshold_uncertainty_score":0.07095158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88055193,0.0002193712,0.099731766,0.0011490147,0.000024631388,0.00006172844,0.000060107886,0.00008137143,0.018120036],"genre_scores_gemma":[0.9958332,0.0000644088,0.0030689486,0.000027518692,0.000008334501,0.000020203463,0.000010287751,0.0000047296644,0.0009623801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990289,0.00052371423,0.000023454037,0.00012283587,0.0001384713,0.00016258762],"domain_scores_gemma":[0.99377936,0.0034530584,0.0014280999,0.00042183866,0.00037099718,0.0005465092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013959045,0.0002685133,0.0003299891,0.0006292642,0.0010895057,0.0016577748,0.00069498306,0.0009962365,0.0011323991],"category_scores_gemma":[0.00791578,0.00032814758,0.0003238762,0.0003819615,0.0021786161,0.002514002,0.001496433,0.00069085904,0.00015285212],"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.00028337407,0.0003868565,0.02495534,0.00015917144,0.00012059166,0.0025454853,0.00362549,0.17172623,0.009606002,0.754032,0.002751541,0.029807812],"study_design_scores_gemma":[0.0001029233,0.00018428071,0.0084705325,0.000048264767,0.000045625136,0.00077104114,0.0012571779,0.5030943,0.0017376152,0.47973564,0.004491325,0.00006128477],"about_ca_topic_score_codex":0.001418054,"about_ca_topic_score_gemma":0.0011150222,"teacher_disagreement_score":0.0016577748,"about_ca_system_score_codex":0.0008501063,"about_ca_system_score_gemma":0.00055222755,"threshold_uncertainty_score":0.007382393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0890026,0.0012473564,0.8301757,0.0018227468,0.00009762799,0.00013039648,0.00053065177,0.0003252681,0.07666762],"genre_scores_gemma":[0.8896784,0.0023634615,0.07924328,0.00041382582,0.00028752518,0.0002838926,0.00041515043,0.00022115736,0.02709322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00029951913,0.000031759326,0.00016930548,0.00019010328,0.00015712091],"domain_scores_gemma":[0.99740463,0.0013090582,0.0004064422,0.00035138646,0.0003108976,0.00021752804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023129245,0.0010857654,0.00090401905,0.0027998376,0.0005694846,0.0033751477,0.0011676925,0.0015211152,0.014904697],"category_scores_gemma":[0.006598065,0.0005247711,0.0011124914,0.0018947789,0.0023654317,0.0049617933,0.0015489336,0.0021308437,0.0012299118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019658239,0.000018494064,0.00035004935,0.000048698243,0.000017315011,0.000065963344,0.000074818076,0.03294031,0.0005218431,0.95251846,0.0019362466,0.011488134],"study_design_scores_gemma":[0.000011929148,0.00001915256,0.000702685,0.0000327209,0.000017526469,0.000097240234,0.00004319192,0.1309965,0.00017082557,0.86549157,0.002398865,0.000017798106],"about_ca_topic_score_codex":0.001845027,"about_ca_topic_score_gemma":0.0010350252,"teacher_disagreement_score":0.014904697,"about_ca_system_score_codex":0.0018483327,"about_ca_system_score_gemma":0.0007264332,"threshold_uncertainty_score":0.049861193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080528185,0.001376246,0.6416956,0.017679509,0.00050629413,0.00026291452,0.000496528,0.00028661994,0.25716802],"genre_scores_gemma":[0.92490506,0.0008347365,0.037215073,0.00094543846,0.00033826643,0.00036253128,0.00024217804,0.00007083461,0.0350859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99340445,0.0030207722,0.0002579581,0.0012853406,0.0011472565,0.00088428584],"domain_scores_gemma":[0.98471665,0.009637856,0.0018775532,0.0014659358,0.0013721049,0.0009298782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054668603,0.00079585734,0.0012048073,0.0014746583,0.002250714,0.0044220295,0.00202869,0.004456242,0.020881087],"category_scores_gemma":[0.021022636,0.0003897768,0.0011085987,0.0014160885,0.004594991,0.006810647,0.003557737,0.0028426975,0.00224829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025922158,0.000017997825,0.000181221,0.000041439132,0.000013854082,0.00006326758,0.00031408484,0.0097527485,0.00015355244,0.9829626,0.0015106036,0.0049626296],"study_design_scores_gemma":[0.000027306676,0.000025375186,0.00011356514,0.000019474246,0.000007832759,0.00005470852,0.00011973874,0.028150512,0.00009562204,0.9663783,0.004994015,0.000013554228],"about_ca_topic_score_codex":0.001757786,"about_ca_topic_score_gemma":0.00097438815,"teacher_disagreement_score":0.020881087,"about_ca_system_score_codex":0.0026145903,"about_ca_system_score_gemma":0.0015640603,"threshold_uncertainty_score":0.0698542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56444496,0.00042918877,0.30401114,0.005816418,0.00011720915,0.00033759457,0.002049494,0.0006054965,0.12218851],"genre_scores_gemma":[0.9859616,0.00014606766,0.0077263378,0.00018394888,0.00005897149,0.00015287101,0.00038277448,0.0000346173,0.0053526717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99344057,0.0032074414,0.00046760327,0.0010374102,0.00087412295,0.0009728826],"domain_scores_gemma":[0.95396477,0.025923671,0.0063019367,0.008404309,0.0019596934,0.0034456823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00883168,0.0007333848,0.0016713598,0.0019762255,0.0014107763,0.0038612336,0.0017235309,0.0030361386,0.014262063],"category_scores_gemma":[0.05051263,0.0004187859,0.0013058747,0.0020399466,0.00537731,0.0076867165,0.0053620753,0.0028520338,0.0007647444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012787743,0.000076447475,0.003607334,0.0000774194,0.000044989356,0.00008355033,0.00040256593,0.0031906248,0.00019003432,0.9820079,0.0007686491,0.009422586],"study_design_scores_gemma":[0.00003241711,0.00003522675,0.0016034124,0.0000131394945,0.000012369655,0.000038918526,0.00012986545,0.006146748,0.00007956524,0.99145484,0.000444165,0.000009389746],"about_ca_topic_score_codex":0.00088862545,"about_ca_topic_score_gemma":0.00083278463,"teacher_disagreement_score":0.014262063,"about_ca_system_score_codex":0.0018345707,"about_ca_system_score_gemma":0.0013098496,"threshold_uncertainty_score":0.047711313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020995406,0.000119930075,0.9960359,0.00017014107,0.000043024473,0.000020991223,0.000014935129,0.00008332863,0.0014121996],"genre_scores_gemma":[0.5348543,0.0007088725,0.45605955,0.00038684675,0.0002745528,0.00029395093,0.0001995495,0.00015545363,0.007066954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694496,0.0010444802,0.00017560415,0.00053319515,0.0010463223,0.00025536536],"domain_scores_gemma":[0.99738675,0.0013327835,0.00020050543,0.00027569837,0.00068357936,0.000120792014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033888412,0.0010054389,0.0017902622,0.0014312187,0.00082946557,0.0024473858,0.00262044,0.0021251764,0.002124761],"category_scores_gemma":[0.006175441,0.00058027776,0.001538703,0.0013560732,0.0013930325,0.0035706665,0.0031487755,0.0020608401,0.0005657182],"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.00013577932,0.00007441824,0.00033301028,0.00016675376,0.00022468976,0.00015318202,0.0003178767,0.7415033,0.0029417705,0.13911356,0.0027267635,0.11230898],"study_design_scores_gemma":[0.00001201665,0.000032692253,0.00004674921,0.00000971998,0.000020648122,0.000019146139,0.000030093654,0.95854044,0.00088985654,0.038973633,0.0014110499,0.000013910859],"about_ca_topic_score_codex":0.0033292088,"about_ca_topic_score_gemma":0.0018655306,"teacher_disagreement_score":0.0033888412,"about_ca_system_score_codex":0.0015456245,"about_ca_system_score_gemma":0.001367568,"threshold_uncertainty_score":0.017922103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17654872,0.0010032082,0.73810613,0.0041034212,0.0001150282,0.0001245539,0.00017387219,0.00014651507,0.07967859],"genre_scores_gemma":[0.9132231,0.0010919507,0.060570225,0.00037539995,0.00020100382,0.00020885887,0.00011415863,0.00007545187,0.024140025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875116,0.00065508246,0.00004293211,0.00016832183,0.00017802691,0.000204388],"domain_scores_gemma":[0.99649197,0.002464682,0.00032604852,0.000173245,0.00021394882,0.0003300782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022081966,0.0006518591,0.0015440389,0.0007691144,0.0009079151,0.0025760368,0.0018945344,0.00354283,0.0058874115],"category_scores_gemma":[0.010073759,0.0006641912,0.0010995829,0.0011156884,0.002437433,0.0043643955,0.0019075912,0.0020389247,0.00058551505],"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.000050820952,0.00004824653,0.00051225844,0.00009122133,0.000038232956,0.00014144152,0.00027706326,0.061461996,0.0010530477,0.92244804,0.0024829893,0.011394585],"study_design_scores_gemma":[0.000034811696,0.000024766468,0.00038253592,0.000018154753,0.00001519591,0.00015497567,0.00009868785,0.18831155,0.00014217122,0.80933845,0.001457973,0.000020739191],"about_ca_topic_score_codex":0.0023699393,"about_ca_topic_score_gemma":0.0027222396,"teacher_disagreement_score":0.0058874115,"about_ca_system_score_codex":0.0017663715,"about_ca_system_score_gemma":0.0012075912,"threshold_uncertainty_score":0.019695401},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014974916,0.0007813544,0.93578386,0.001335586,0.00014777365,0.00019485076,0.00031245695,0.00023517702,0.046233937],"genre_scores_gemma":[0.7140655,0.0028972873,0.25133598,0.00094208773,0.0004370115,0.0014749231,0.0008586302,0.00034590607,0.027642673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746764,0.0012043113,0.0001455809,0.00049744686,0.00040377074,0.00028130098],"domain_scores_gemma":[0.9967727,0.0021791724,0.00033065834,0.00018838637,0.00033200314,0.00019701851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024879067,0.0016617221,0.0013069249,0.0022464176,0.001605048,0.004066061,0.0018539046,0.0022145167,0.011133215],"category_scores_gemma":[0.008873116,0.0005521668,0.0016332336,0.0022496253,0.0041279006,0.0062191817,0.0028386428,0.003370807,0.0016651121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009335452,0.000009514022,0.00006027125,0.000032537257,0.000009846116,0.000028821301,0.00010322229,0.010220894,0.00013858323,0.98596734,0.0006909573,0.0027286732],"study_design_scores_gemma":[0.000011106637,0.000009682135,0.000024889732,0.0000135089995,0.0000059148865,0.000020460675,0.00004222551,0.04352746,0.00008373786,0.9534635,0.002790094,0.0000075201024],"about_ca_topic_score_codex":0.00435486,"about_ca_topic_score_gemma":0.0029069341,"teacher_disagreement_score":0.011133215,"about_ca_system_score_codex":0.0034310957,"about_ca_system_score_gemma":0.0015050619,"threshold_uncertainty_score":0.03724432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057245702,0.005107365,0.9758271,0.0012132247,0.00019232488,0.000075905045,0.0000545353,0.00018717811,0.0116177155],"genre_scores_gemma":[0.7218831,0.007339167,0.25445038,0.0007828325,0.00091867766,0.00074067595,0.0002210477,0.00012050392,0.013543591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989422,0.0004667972,0.00006534612,0.00018013343,0.00026324892,0.000082188126],"domain_scores_gemma":[0.9964713,0.0028685918,0.00019076084,0.00013965015,0.00022986329,0.000099812976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019234756,0.0013508383,0.0011616346,0.0008749478,0.00047957257,0.0016618684,0.0010178699,0.0017456715,0.0033960138],"category_scores_gemma":[0.0058268197,0.0004712534,0.00079551496,0.0007587633,0.002342632,0.0021063457,0.0018808902,0.0022403533,0.0005483274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004846549,0.00007019963,0.0007086359,0.00038666287,0.00010107405,0.00013081338,0.00016600847,0.42364958,0.0008000761,0.5086955,0.0026871401,0.06255579],"study_design_scores_gemma":[0.000021244427,0.00005258598,0.00012432574,0.000037394384,0.0000142042745,0.00003883572,0.000023830235,0.78450847,0.00030865567,0.2099116,0.004947421,0.0000113977485],"about_ca_topic_score_codex":0.0022899562,"about_ca_topic_score_gemma":0.0016672711,"teacher_disagreement_score":0.0033960138,"about_ca_system_score_codex":0.0013854166,"about_ca_system_score_gemma":0.0011247204,"threshold_uncertainty_score":0.0113607645},"labels":[],"label_agreement":null},{"id":"W1516840567","doi":"10.1007/978-0-387-35706-5_23","title":"Solving the Oshi-Zumo Game","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nash equilibrium; Mathematical economics; Computer science; Game theory; Strategy; Mathematics","score_opus":0.053153344532452164,"score_gpt":0.3524715400949214,"score_spread":0.2993181955624692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516840567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15261738,0.0007288242,0.60283977,0.0021379504,0.00044669138,0.00029684606,0.00018023232,0.000284825,0.24046743],"genre_scores_gemma":[0.6781561,0.001279379,0.21678714,0.00036632683,0.00011814455,0.00043785977,0.0002934972,0.000112052185,0.10244957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997533,0.00008836414,0.000013419236,0.000037109625,0.00005039497,0.00005740064],"domain_scores_gemma":[0.9997037,0.00020267323,0.00001616731,0.000024569144,0.000017750595,0.000035073623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267833,0.0008497876,0.00085911714,0.0002998178,0.0009768691,0.0014237217,0.0010425748,0.0012006926,0.009859203],"category_scores_gemma":[0.0017638609,0.0002604438,0.0006375447,0.0004321684,0.00097027456,0.0027286874,0.0015731255,0.0015972567,0.0006703345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023692769,0.00012545928,0.0004117235,0.00021847937,0.000043910593,0.0001266634,0.00059392676,0.04736306,0.0028081979,0.8737898,0.006573274,0.06770874],"study_design_scores_gemma":[0.00008991526,0.00010936369,0.00025446087,0.00006525243,0.00003678271,0.00006605153,0.00048002228,0.19935167,0.0020814056,0.77832925,0.019106738,0.000029066427],"about_ca_topic_score_codex":0.0020301135,"about_ca_topic_score_gemma":0.0043911184,"teacher_disagreement_score":0.009859203,"about_ca_system_score_codex":0.00060207286,"about_ca_system_score_gemma":0.0012160249,"threshold_uncertainty_score":0.03298235},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013586966,0.014706558,0.078253165,0.009640686,0.00049952633,0.00005221989,0.000055687906,0.00004955853,0.8831556],"genre_scores_gemma":[0.59361356,0.014497599,0.036954544,0.0018678921,0.0006631416,0.00019625903,0.00012305283,0.000102923485,0.35198104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995912,0.0002030369,0.000010521874,0.00005562294,0.00010440317,0.000035288347],"domain_scores_gemma":[0.9996289,0.0002441962,0.000020951316,0.00004424317,0.000038160153,0.000023565593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009508451,0.0005581899,0.0005250929,0.0006837496,0.0006325708,0.0024716882,0.0006245932,0.0017603928,0.012121916],"category_scores_gemma":[0.0019286823,0.00021089069,0.00028174056,0.0010177221,0.004008524,0.002734387,0.00080889714,0.0020223584,0.001373231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019378515,0.000007175917,0.000034967175,0.000013807849,0.000002557915,0.000009507887,0.00008686028,0.0006716845,0.000026997508,0.9878634,0.0021518045,0.009129274],"study_design_scores_gemma":[0.0000015252049,0.0000024266155,0.000062060695,0.000017134127,0.0000011576586,0.000014613279,0.00003910291,0.00084324426,0.000026804544,0.98432124,0.014668789,0.000001795921],"about_ca_topic_score_codex":0.0010330594,"about_ca_topic_score_gemma":0.0012166365,"teacher_disagreement_score":0.012121916,"about_ca_system_score_codex":0.0017969462,"about_ca_system_score_gemma":0.0007637038,"threshold_uncertainty_score":0.04055184},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12804663,0.00006341441,0.8597467,0.0007314263,0.000031164098,0.00021827008,0.0001671289,0.00012036592,0.010874934],"genre_scores_gemma":[0.92756677,0.00013102709,0.06570088,0.00012705287,0.000033371896,0.00025554575,0.0001813223,0.000023652101,0.0059803305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975189,0.0011632979,0.00011730664,0.00060120627,0.0003560127,0.00024335447],"domain_scores_gemma":[0.9940911,0.0040735924,0.0009421311,0.0004289309,0.000275815,0.00018848812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273267,0.0009225488,0.0012725391,0.00044165543,0.0004100724,0.0017365367,0.0012041476,0.0017898644,0.003439426],"category_scores_gemma":[0.0111870365,0.0005440502,0.0012018867,0.00034821214,0.0020864815,0.0029893094,0.00174833,0.0019321588,0.00038538864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017064047,0.00014749025,0.0017690327,0.00013646604,0.00007617124,0.0003753917,0.00044725012,0.25268835,0.0026511573,0.73017305,0.0004498688,0.010915066],"study_design_scores_gemma":[0.00007442996,0.0000589949,0.0003200976,0.000013455916,0.000014772457,0.000059696347,0.00007874486,0.6296083,0.0006507281,0.3682069,0.0008918675,0.0000220344],"about_ca_topic_score_codex":0.0020842776,"about_ca_topic_score_gemma":0.0010347753,"teacher_disagreement_score":0.003439426,"about_ca_system_score_codex":0.0010873812,"about_ca_system_score_gemma":0.0014864631,"threshold_uncertainty_score":0.014451861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5509259,0.0009655153,0.31808394,0.005421247,0.00029920225,0.00030106807,0.0019252615,0.000416262,0.12166153],"genre_scores_gemma":[0.9629854,0.0003623315,0.022600418,0.00040650083,0.00013667345,0.00017648711,0.0003272868,0.000036460347,0.012968533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780566,0.00084835343,0.00012317304,0.0004073176,0.00039190447,0.00042346516],"domain_scores_gemma":[0.99084127,0.006078619,0.00068575103,0.00056134857,0.0006943944,0.0011384945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023704604,0.00052553276,0.0007534914,0.0015400919,0.0014045059,0.0030027737,0.0009310884,0.0011068375,0.007080434],"category_scores_gemma":[0.009016444,0.00033613737,0.0006027725,0.001273315,0.0028065625,0.0047972314,0.0024984789,0.0016107499,0.0006403313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023102916,0.000083134255,0.0031842508,0.00024313365,0.000088987064,0.000290946,0.0005612363,0.0061497744,0.003640448,0.9548969,0.004734926,0.0258953],"study_design_scores_gemma":[0.00005364681,0.00008368137,0.0016316129,0.000048270642,0.0000694391,0.000458563,0.00039803464,0.029493688,0.001785779,0.9593323,0.006618754,0.000026210577],"about_ca_topic_score_codex":0.0010610336,"about_ca_topic_score_gemma":0.0014977733,"teacher_disagreement_score":0.007080434,"about_ca_system_score_codex":0.0011322912,"about_ca_system_score_gemma":0.0010651383,"threshold_uncertainty_score":0.023686409},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12154096,0.0016519496,0.7537971,0.0072101844,0.0003065756,0.0003013618,0.001088135,0.00034939218,0.11375433],"genre_scores_gemma":[0.8978934,0.00040611895,0.09174739,0.0012151189,0.00032731504,0.0005677442,0.00087070506,0.00015616271,0.0068158847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9802066,0.007904436,0.0017745226,0.0037484297,0.004804787,0.001561349],"domain_scores_gemma":[0.958561,0.023436433,0.003652948,0.0056459196,0.0075308154,0.0011728817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104476735,0.000681959,0.0012268516,0.00286809,0.002010304,0.005599064,0.0027865798,0.00281862,0.008696195],"category_scores_gemma":[0.053715914,0.0009107465,0.0014779874,0.0028937757,0.008378159,0.01185115,0.004273815,0.0055838795,0.0008701352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029775698,0.000019704064,0.0006280516,0.00003344584,0.000022036364,0.000048704173,0.00037663008,0.0009390186,0.00025167025,0.99241275,0.00068381836,0.0045542074],"study_design_scores_gemma":[0.00002816511,0.000027110778,0.0004262105,0.000048330832,0.00002008448,0.00011267731,0.00028268914,0.006114326,0.0005744499,0.9881443,0.004199128,0.00002241881],"about_ca_topic_score_codex":0.0011031764,"about_ca_topic_score_gemma":0.0006571787,"teacher_disagreement_score":0.0104476735,"about_ca_system_score_codex":0.0024021352,"about_ca_system_score_gemma":0.0014424676,"threshold_uncertainty_score":0.055253208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55541843,0.0011796906,0.17397527,0.016498106,0.00038954002,0.0001581455,0.00035937616,0.0005726736,0.2514488],"genre_scores_gemma":[0.9516976,0.00018134878,0.005825357,0.00025189167,0.00009992744,0.000032661916,0.00006096395,0.00003532875,0.04181489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997532,0.0007824302,0.00012727466,0.0005341213,0.00047530705,0.0005488958],"domain_scores_gemma":[0.99378717,0.0013784813,0.0014382972,0.001266589,0.00071333884,0.0014161329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003365349,0.00037467075,0.0008562033,0.0008934686,0.0023689,0.0038624296,0.001217891,0.0027483879,0.020301888],"category_scores_gemma":[0.01360305,0.00045304964,0.0008623378,0.0005440631,0.0021797079,0.004690968,0.0027088018,0.0016332974,0.002684156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004616941,0.00014544415,0.012817176,0.0001313248,0.000108708366,0.001226192,0.0025796937,0.014847044,0.0043988614,0.91571504,0.010439133,0.037129764],"study_design_scores_gemma":[0.00023246565,0.0006100162,0.019210108,0.00021608808,0.00022651844,0.00211239,0.0022067444,0.21178633,0.002608196,0.67362565,0.08688937,0.00027616587],"about_ca_topic_score_codex":0.003300662,"about_ca_topic_score_gemma":0.003221311,"teacher_disagreement_score":0.020301888,"about_ca_system_score_codex":0.0026355167,"about_ca_system_score_gemma":0.0014608394,"threshold_uncertainty_score":0.06791657},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004130106,0.00010441318,0.9937376,0.000058284913,0.000015000443,0.00005452777,0.000078386205,0.0003482239,0.0014734135],"genre_scores_gemma":[0.18084085,0.00045211814,0.813762,0.000121479796,0.00009391457,0.00043147174,0.0005664862,0.0003508642,0.003380723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983265,0.00047651766,0.00011420004,0.00038588475,0.00043357146,0.00026335425],"domain_scores_gemma":[0.9971048,0.0015948684,0.00016501773,0.0006181155,0.00032031618,0.00019682308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029647595,0.0016829019,0.0031533167,0.0020295891,0.0016006922,0.0048234183,0.0047886204,0.0022718236,0.009150368],"category_scores_gemma":[0.01073882,0.0013612275,0.00265529,0.004290418,0.0026178379,0.00540101,0.00480467,0.003492955,0.0015054389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001840743,0.00013492335,0.0005100284,0.0002056837,0.000080590544,0.000071258044,0.00014405079,0.3749305,0.0019708208,0.55432993,0.0030897623,0.06434848],"study_design_scores_gemma":[0.000040268395,0.000039592065,0.00007892639,0.000022906108,0.00002460832,0.00002339155,0.0000290277,0.6865202,0.0006461304,0.31105256,0.0015029388,0.000019417077],"about_ca_topic_score_codex":0.0049131135,"about_ca_topic_score_gemma":0.006882099,"teacher_disagreement_score":0.009150368,"about_ca_system_score_codex":0.0022996408,"about_ca_system_score_gemma":0.0024499681,"threshold_uncertainty_score":0.030610979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86309636,0.0017223839,0.03792259,0.012365618,0.000107105545,0.000088331115,0.00031295096,0.00006242289,0.08432229],"genre_scores_gemma":[0.9928933,0.0003101405,0.0008459398,0.00016404985,0.000048550188,0.000012652639,0.000027046406,0.0000060432085,0.0056922464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99947816,0.00025590928,0.000010947109,0.00007726351,0.00005744984,0.00012031357],"domain_scores_gemma":[0.99717414,0.0016582613,0.0005005092,0.00009700558,0.00014997217,0.0004201355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264931,0.00031082792,0.0005423736,0.00046911754,0.0010666572,0.0020185392,0.0006090924,0.0025453498,0.012065914],"category_scores_gemma":[0.004541207,0.00023933747,0.0004496505,0.00057804433,0.0013317873,0.0018636261,0.00090334954,0.0013320196,0.000717353],"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.0025409637,0.0013469813,0.096673675,0.00031566608,0.0004702487,0.003179834,0.004468229,0.077048,0.0049506812,0.7307522,0.014464957,0.06378845],"study_design_scores_gemma":[0.00051802816,0.0007644652,0.071074374,0.00011632552,0.00033904047,0.00089297927,0.0041640117,0.3263266,0.0015121606,0.57054806,0.023474246,0.0002697046],"about_ca_topic_score_codex":0.009214361,"about_ca_topic_score_gemma":0.0084864665,"teacher_disagreement_score":0.012065914,"about_ca_system_score_codex":0.0015965557,"about_ca_system_score_gemma":0.00048723043,"threshold_uncertainty_score":0.040364504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06267292,0.0002893426,0.8971191,0.0014309667,0.000084940424,0.00025496265,0.00012000245,0.0002296933,0.037798043],"genre_scores_gemma":[0.81593925,0.0005473546,0.16780543,0.00040857695,0.0001812406,0.00094603887,0.00031642098,0.00011998137,0.013735616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960311,0.0023041337,0.00016512118,0.00031047923,0.00074678595,0.0004423681],"domain_scores_gemma":[0.99635136,0.002552406,0.00024839144,0.00026665215,0.00034779654,0.00023348062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037769815,0.0013235947,0.0016318153,0.0007284446,0.0010676852,0.002710727,0.0024199502,0.0025854893,0.004214859],"category_scores_gemma":[0.0072206566,0.0005466627,0.0011622068,0.0016558676,0.002553028,0.0038663412,0.0030187904,0.0026029376,0.00082521664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024601948,0.0001487326,0.00031784162,0.00026989277,0.000083461186,0.00017504572,0.00071173155,0.05994521,0.0032826818,0.90243596,0.003972246,0.028411161],"study_design_scores_gemma":[0.000096300515,0.0001238826,0.00011152927,0.00002832618,0.000021226277,0.00007034278,0.00013901264,0.19510706,0.0010180891,0.8017112,0.0015564839,0.00001661473],"about_ca_topic_score_codex":0.00070781773,"about_ca_topic_score_gemma":0.00057554076,"teacher_disagreement_score":0.004214859,"about_ca_system_score_codex":0.0008886563,"about_ca_system_score_gemma":0.0016223945,"threshold_uncertainty_score":0.019974828},"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":"review","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029372957,0.38658684,0.1220907,0.033427242,0.11058588,0.00029657347,0.0015057258,0.0007448405,0.34182504],"genre_scores_gemma":[0.05807333,0.4080661,0.07259177,0.024490505,0.18752901,0.00072771864,0.0034944923,0.001130736,0.24389626],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991775,0.0001784026,0.000079624755,0.0001853032,0.0003143009,0.0000648021],"domain_scores_gemma":[0.9981254,0.0010367784,0.000064181055,0.00013813894,0.0005034658,0.00013210883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001231461,0.0013275146,0.0010538674,0.0026273446,0.00087098585,0.0036503181,0.0011839523,0.0024601032,0.031099323],"category_scores_gemma":[0.0036666566,0.0006171371,0.0011739307,0.0029459624,0.0017940592,0.00524215,0.0013880262,0.005014655,0.009358326],"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.000030920957,0.00010792433,0.0004964226,0.0012333217,0.00004353108,0.00017348418,0.00028811733,0.0014363683,0.0006782245,0.29954794,0.51878566,0.1771781],"study_design_scores_gemma":[0.0000077443,0.00003650595,0.00037952527,0.00034234743,0.000012263546,0.00044477594,0.00007472412,0.00096067245,0.00011190162,0.12050411,0.87710816,0.000017189972],"about_ca_topic_score_codex":0.0007842227,"about_ca_topic_score_gemma":0.0008271707,"teacher_disagreement_score":0.031099323,"about_ca_system_score_codex":0.0014570076,"about_ca_system_score_gemma":0.0009869321,"threshold_uncertainty_score":0.10403758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.599644,0.0018686013,0.31185216,0.0024107483,0.00021464839,0.00018673018,0.00052177993,0.00038401096,0.08291731],"genre_scores_gemma":[0.9872966,0.00020349011,0.005212224,0.00004843179,0.000021870466,0.000045924666,0.000053722415,0.000019509293,0.007098322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970642,0.0012583173,0.000099214485,0.00054889696,0.0002936986,0.0007356511],"domain_scores_gemma":[0.9923977,0.002966075,0.0022481882,0.0008193064,0.00053934933,0.0010292582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036177952,0.00053630857,0.0014498623,0.0009571357,0.0013001956,0.004104375,0.0015024722,0.00147103,0.010462435],"category_scores_gemma":[0.015226962,0.0005164861,0.0010651981,0.0008850806,0.0023472882,0.0027052965,0.0022845317,0.001311155,0.001025971],"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.00027724248,0.00013491581,0.015497763,0.00012897278,0.00014577115,0.000472526,0.000722503,0.52721864,0.0005971489,0.42950287,0.004382035,0.020919632],"study_design_scores_gemma":[0.00015501898,0.00021774769,0.007765092,0.00007041081,0.00009042713,0.00018412068,0.0006646103,0.65229696,0.00039207333,0.33181015,0.0062822467,0.00007121844],"about_ca_topic_score_codex":0.007913118,"about_ca_topic_score_gemma":0.0041140025,"teacher_disagreement_score":0.010462435,"about_ca_system_score_codex":0.0037355975,"about_ca_system_score_gemma":0.0022204574,"threshold_uncertainty_score":0.035000324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8279613,0.001247807,0.13756974,0.002287133,0.00014767423,0.000052266583,0.00034978535,0.00014427029,0.03024003],"genre_scores_gemma":[0.99287957,0.0003215426,0.0032716654,0.000038720747,0.00006757406,0.000019703279,0.000047790767,0.000017209288,0.0033362808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990727,0.00042207178,0.00004464729,0.00014537694,0.00017922097,0.00013592165],"domain_scores_gemma":[0.9785993,0.015566808,0.0029593653,0.0008566526,0.0006891483,0.0013288104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021105523,0.00035957087,0.0009822976,0.0014962758,0.00078247226,0.004249255,0.0015401851,0.001964584,0.007049258],"category_scores_gemma":[0.017234312,0.0005630696,0.00054312503,0.0013067904,0.0024628348,0.006222946,0.0018200687,0.0010666796,0.00040562113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005070654,0.00017588463,0.006571483,0.00017111498,0.00011104601,0.0004796321,0.0005395719,0.37475947,0.002284844,0.5885783,0.0024468477,0.023374833],"study_design_scores_gemma":[0.00004625485,0.00010901371,0.0026544859,0.00003813437,0.000036283487,0.00022473684,0.0002812262,0.33633512,0.0005282522,0.6582108,0.0014961673,0.000039470935],"about_ca_topic_score_codex":0.00071342883,"about_ca_topic_score_gemma":0.00089766225,"teacher_disagreement_score":0.007049258,"about_ca_system_score_codex":0.0014111634,"about_ca_system_score_gemma":0.00044704985,"threshold_uncertainty_score":0.02358216},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081980295,0.0013192073,0.117271036,0.005544005,0.00041191193,0.00006914354,0.00022271987,0.00063895533,0.7925427],"genre_scores_gemma":[0.8235404,0.0013196362,0.02779483,0.0009653127,0.000189149,0.00010431822,0.00050753733,0.00017189082,0.1454069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995148,0.0001408754,0.000016600816,0.00012030858,0.00014722644,0.00006016516],"domain_scores_gemma":[0.99846077,0.0006423437,0.00007437215,0.00036390434,0.00018745934,0.00027110885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008830101,0.00034740573,0.00034720823,0.0003889637,0.0007191446,0.002431299,0.00084828807,0.0006005352,0.029097203],"category_scores_gemma":[0.005936695,0.00018723296,0.000378123,0.0004311822,0.0014333179,0.0065860553,0.0024734712,0.0016893712,0.004559651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009521744,0.0002063655,0.0025723337,0.00014637447,0.000028088623,0.00010329173,0.0031202943,0.0024325768,0.0010718456,0.556831,0.03574599,0.3976466],"study_design_scores_gemma":[0.000015147606,0.000120880126,0.002167709,0.00009362983,0.00001645724,0.00019365782,0.0013652878,0.0041939975,0.0010708283,0.91451675,0.0762256,0.000020041041],"about_ca_topic_score_codex":0.0005954385,"about_ca_topic_score_gemma":0.0010390462,"teacher_disagreement_score":0.029097203,"about_ca_system_score_codex":0.0005172764,"about_ca_system_score_gemma":0.000638504,"threshold_uncertainty_score":0.09733981},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2003284,0.00009094027,0.79036146,0.00038824222,0.000041821695,0.00018719032,0.0003224176,0.0011493934,0.00713016],"genre_scores_gemma":[0.73494476,0.00011640079,0.26065856,0.00009297971,0.000024293382,0.00014586709,0.0005246833,0.00018367036,0.0033088806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988838,0.00041199313,0.00007191437,0.00025870182,0.00018169808,0.0001919116],"domain_scores_gemma":[0.9959025,0.0031130197,0.00026972627,0.00026866602,0.00024857686,0.00019752292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018662731,0.0014900898,0.0012433922,0.0011817884,0.00074819307,0.0019877052,0.0014330817,0.0010705027,0.0038942937],"category_scores_gemma":[0.010855,0.0007109237,0.0009363546,0.000719878,0.0016065317,0.0033025008,0.0019271628,0.0014939209,0.00058179296],"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.00030151024,0.0001950611,0.0026680988,0.00016440038,0.000076615164,0.0002598634,0.00029282784,0.7866548,0.0027901288,0.1606436,0.0017382705,0.04421476],"study_design_scores_gemma":[0.00003174226,0.000019187968,0.00009140887,0.000007827182,0.0000096087215,0.000013571316,0.000043223936,0.8640869,0.0010757667,0.1342751,0.00033814236,0.0000074468862],"about_ca_topic_score_codex":0.0070835925,"about_ca_topic_score_gemma":0.008484501,"teacher_disagreement_score":0.0070835925,"about_ca_system_score_codex":0.0021262234,"about_ca_system_score_gemma":0.0020532687,"threshold_uncertainty_score":0.015426874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21713969,0.0009246674,0.75844866,0.001358088,0.00006375822,0.000075457065,0.00034635552,0.0001564721,0.021486849],"genre_scores_gemma":[0.9206235,0.00051990105,0.07480302,0.00016280657,0.00017352864,0.0001357024,0.0003730671,0.00009889882,0.0031096383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99327713,0.002528078,0.00048859156,0.001139788,0.0019735557,0.00059290946],"domain_scores_gemma":[0.98176974,0.010936624,0.0021391823,0.0023833043,0.0022173005,0.0005538398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067490228,0.00058793346,0.0011770687,0.002944905,0.0013466893,0.0033456297,0.0016455412,0.0012378313,0.003125887],"category_scores_gemma":[0.030818462,0.00055567484,0.0011740582,0.0032311757,0.005142696,0.00902042,0.0032798124,0.0026091696,0.00046150354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041020863,0.000015396034,0.0010454352,0.000029156248,0.00002198641,0.000054583572,0.0003352908,0.004141937,0.00057613465,0.9874427,0.00027800282,0.006018377],"study_design_scores_gemma":[0.000010923274,0.000020764663,0.00039287744,0.000017165838,0.000012682802,0.000052005384,0.000093248564,0.01596113,0.0005202421,0.98177105,0.0011330053,0.000015061544],"about_ca_topic_score_codex":0.0010755423,"about_ca_topic_score_gemma":0.0006860067,"teacher_disagreement_score":0.0067490228,"about_ca_system_score_codex":0.0013415464,"about_ca_system_score_gemma":0.0007132673,"threshold_uncertainty_score":0.035692632},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530773,0.00018432275,0.74562967,0.0030505266,0.00007044299,0.00034706338,0.00025223865,0.0006634888,0.0044945497],"genre_scores_gemma":[0.916525,0.00009834639,0.08098447,0.0005148856,0.00006914849,0.00032594075,0.00020349493,0.00008380376,0.0011948956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98566645,0.008773522,0.0005662257,0.002486711,0.0016030931,0.0009039985],"domain_scores_gemma":[0.7743797,0.18959762,0.013144392,0.011760133,0.0069117346,0.004206446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02453606,0.0013728688,0.0026811515,0.0013727178,0.0012766308,0.0020030702,0.004136218,0.0042440468,0.0031405452],"category_scores_gemma":[0.15851784,0.00067863014,0.0010398593,0.0011466707,0.006765616,0.0054868227,0.003100401,0.004501349,0.0006022804],"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.002535428,0.0014450359,0.042451102,0.00039868843,0.000807092,0.00061240117,0.00084609946,0.5566196,0.0049665654,0.2543114,0.006574086,0.12843259],"study_design_scores_gemma":[0.00021099832,0.00033170806,0.0013424853,0.000029188705,0.00004133805,0.000053506483,0.000057494308,0.9182241,0.0017190736,0.077614754,0.00034406167,0.00003129169],"about_ca_topic_score_codex":0.0024454028,"about_ca_topic_score_gemma":0.0016197113,"teacher_disagreement_score":0.02453606,"about_ca_system_score_codex":0.001977841,"about_ca_system_score_gemma":0.003993054,"threshold_uncertainty_score":0.12976062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17475787,0.000071503295,0.82039255,0.00030852787,0.000019081472,0.00012808782,0.00015294299,0.00056610716,0.0036033343],"genre_scores_gemma":[0.7618359,0.00012013555,0.23575681,0.000090233705,0.000015009434,0.00014646292,0.0002928613,0.00010109445,0.0016416677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985164,0.000606877,0.00006692892,0.0003388458,0.0002295095,0.0002414616],"domain_scores_gemma":[0.9956671,0.0032410757,0.0004040926,0.00024969692,0.00027880076,0.00015911045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016610514,0.0011573314,0.0012499695,0.0012113757,0.0008730681,0.0018478761,0.0018687628,0.0010069746,0.0023646725],"category_scores_gemma":[0.007879796,0.00076497655,0.00085955515,0.0010188925,0.0018446074,0.0041561904,0.0017704262,0.001213696,0.00034434744],"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.00034409232,0.00027283994,0.001960823,0.00018072726,0.00012003699,0.00019597396,0.00027615338,0.7494122,0.0045126034,0.20105617,0.0009830071,0.040685352],"study_design_scores_gemma":[0.000036576577,0.000035061843,0.00008661437,0.0000076069414,0.000016680387,0.000023114604,0.000047451522,0.85373265,0.002360636,0.14333849,0.00030575797,0.00000941224],"about_ca_topic_score_codex":0.0050776177,"about_ca_topic_score_gemma":0.0058490015,"teacher_disagreement_score":0.0050776177,"about_ca_system_score_codex":0.0015627556,"about_ca_system_score_gemma":0.0017181066,"threshold_uncertainty_score":0.011338651},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1679224,0.017611807,0.72442394,0.027347181,0.00094573415,0.00044644525,0.0041631632,0.00046353415,0.056675825],"genre_scores_gemma":[0.9386254,0.0089236,0.037606396,0.00070210034,0.0006285939,0.0004519878,0.0012222703,0.000055296245,0.011784294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99297935,0.005470323,0.00015749835,0.0005047965,0.0005859653,0.0003019955],"domain_scores_gemma":[0.9674548,0.026277067,0.0033762765,0.0015253917,0.00095006474,0.00041634453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062231766,0.0006021142,0.0010716751,0.002707339,0.0007689159,0.0021213323,0.0010236966,0.0014795752,0.0050971676],"category_scores_gemma":[0.05482812,0.0005204282,0.00060697406,0.0052818777,0.0022156455,0.0034514074,0.0016643886,0.001648038,0.0010568268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073925024,0.000065086664,0.028593173,0.00029195086,0.00031281725,0.00022481308,0.0004914421,0.13198864,0.00015833451,0.768292,0.011229703,0.05827803],"study_design_scores_gemma":[0.000054969758,0.000043762313,0.012001691,0.000118860095,0.00006675272,0.00009656864,0.0005410499,0.23404934,0.0001553389,0.7343838,0.018451046,0.000036834204],"about_ca_topic_score_codex":0.017506743,"about_ca_topic_score_gemma":0.0077932393,"teacher_disagreement_score":0.017506743,"about_ca_system_score_codex":0.0028667373,"about_ca_system_score_gemma":0.0012481398,"threshold_uncertainty_score":0.03480971},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005262332,0.00071387104,0.9346497,0.0021602325,0.00019969618,0.0001930329,0.0006178531,0.00030322207,0.055900205],"genre_scores_gemma":[0.45447758,0.0028995161,0.49657062,0.0011134443,0.00040077115,0.0015077291,0.0022929555,0.00034435312,0.040393073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973586,0.001540372,0.00010314644,0.00035987023,0.00047557036,0.0001623887],"domain_scores_gemma":[0.9970386,0.0019270184,0.0002051616,0.00031258003,0.000331354,0.00018527915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019308846,0.0012640433,0.00090212596,0.0018113633,0.0012318939,0.0036813936,0.0025152818,0.002312359,0.021246152],"category_scores_gemma":[0.0062105292,0.00042506366,0.0015500919,0.002686618,0.0027590613,0.004660491,0.0022314654,0.0028926134,0.0027737273],"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.00001528842,0.00002295521,0.000091700866,0.00004733659,0.000017709172,0.00007349339,0.000100747035,0.06390061,0.00011931737,0.92270124,0.003619868,0.009289713],"study_design_scores_gemma":[0.000019002178,0.000009954089,0.000028846218,0.000019533485,0.000008197229,0.00003993051,0.00004218295,0.17487466,0.00006447627,0.8121771,0.01270475,0.000011383896],"about_ca_topic_score_codex":0.008262954,"about_ca_topic_score_gemma":0.0057423706,"teacher_disagreement_score":0.021246152,"about_ca_system_score_codex":0.00309627,"about_ca_system_score_gemma":0.0023079265,"threshold_uncertainty_score":0.0710755},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18833223,0.017069744,0.31788856,0.039147858,0.00064778875,0.00021398907,0.0002763602,0.000250533,0.436173],"genre_scores_gemma":[0.94625473,0.0060995,0.026814023,0.00093307486,0.00020704794,0.00021262585,0.00010215344,0.00006589788,0.019310998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949333,0.0025025487,0.00019068923,0.0010298883,0.00093150005,0.00041196242],"domain_scores_gemma":[0.9934894,0.003934041,0.0008926812,0.0007061387,0.00060124847,0.000376527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048124376,0.00071866816,0.0009178219,0.0018869811,0.0024237079,0.008604094,0.0014410965,0.0027075217,0.007823606],"category_scores_gemma":[0.011356333,0.0005022651,0.0009902305,0.0019952033,0.017799346,0.009371853,0.0040216474,0.0034003446,0.0007251301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009795969,0.000010481895,0.00073812675,0.000052465737,0.000017922262,0.000042770433,0.001347715,0.0016070952,0.00013920656,0.99006224,0.0004238473,0.005548485],"study_design_scores_gemma":[0.0000131389625,0.00002094888,0.0016512312,0.000096707874,0.000016245263,0.00008976488,0.0016933805,0.0047615226,0.0001792804,0.9666567,0.024800763,0.000020296433],"about_ca_topic_score_codex":0.009177641,"about_ca_topic_score_gemma":0.0056500332,"teacher_disagreement_score":0.009177641,"about_ca_system_score_codex":0.0054705585,"about_ca_system_score_gemma":0.003378516,"threshold_uncertainty_score":0.039691865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13504027,0.00062049186,0.8290017,0.002653039,0.00011057977,0.00017168352,0.00062973023,0.00029891438,0.03147352],"genre_scores_gemma":[0.90608466,0.0006690293,0.083037876,0.0008298787,0.00017862521,0.00045332927,0.00028188335,0.0001351055,0.008329571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967475,0.0011668297,0.0002462991,0.00080985925,0.0005825073,0.00044707852],"domain_scores_gemma":[0.97650576,0.016189363,0.0027068988,0.0017206785,0.002019982,0.0008573207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053562494,0.00078876375,0.0017732463,0.0013386569,0.0015339412,0.0031080213,0.002392334,0.0020595393,0.0071888887],"category_scores_gemma":[0.022545414,0.00067029527,0.0022659837,0.001087247,0.0033874144,0.0075177075,0.0024091993,0.0032003485,0.00082073454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095086034,0.00005374201,0.0014537137,0.00012921062,0.000081726066,0.00019216629,0.00043888792,0.011554778,0.0011372687,0.9753666,0.0011747372,0.008322098],"study_design_scores_gemma":[0.000051552954,0.0000710592,0.0004850683,0.000032492655,0.000033691867,0.00018305334,0.000085276246,0.10749246,0.000540114,0.8891869,0.001810064,0.000028386092],"about_ca_topic_score_codex":0.0019079363,"about_ca_topic_score_gemma":0.0014230609,"teacher_disagreement_score":0.0071888887,"about_ca_system_score_codex":0.0022877848,"about_ca_system_score_gemma":0.0013523755,"threshold_uncertainty_score":0.028326929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40082803,0.00020244709,0.5571928,0.0013210024,0.00007358205,0.00027804557,0.0002301549,0.00010799072,0.039765976],"genre_scores_gemma":[0.9774924,0.000099494704,0.016503735,0.00008324645,0.000020584259,0.00012884158,0.00003326486,0.000011446578,0.005626963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980527,0.00097541726,0.00006951514,0.00031960808,0.0002956396,0.0002870809],"domain_scores_gemma":[0.99728954,0.0017084096,0.00033059387,0.00016389512,0.00014941931,0.00035814889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946294,0.00085332134,0.00093349075,0.0004590794,0.0005917219,0.0021361602,0.0017436442,0.0015351322,0.002695011],"category_scores_gemma":[0.004760298,0.000362238,0.0009883059,0.00036431418,0.0024010637,0.0018931555,0.0013802397,0.0012449992,0.0002573367],"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.0003721645,0.00024910495,0.0015835519,0.00014437508,0.00016920868,0.0010200444,0.00071039237,0.36660612,0.008159339,0.610273,0.0011156547,0.009597147],"study_design_scores_gemma":[0.000077538156,0.0001559575,0.00037492928,0.000019927103,0.000032780474,0.0001341712,0.00013288151,0.80755067,0.000886925,0.18922943,0.0013640047,0.00004075155],"about_ca_topic_score_codex":0.0031394272,"about_ca_topic_score_gemma":0.002473423,"teacher_disagreement_score":0.0031394272,"about_ca_system_score_codex":0.0022095775,"about_ca_system_score_gemma":0.0014782689,"threshold_uncertainty_score":0.016031682},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054230273,0.009382865,0.3439991,0.007747493,0.0008084522,0.00013227305,0.0001376052,0.00017186746,0.58339],"genre_scores_gemma":[0.82773244,0.007048011,0.0535215,0.0014309202,0.0017261371,0.00070933066,0.00026312325,0.00039447646,0.10717416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974541,0.0013164772,0.000103284685,0.00027466935,0.0005876798,0.00026373158],"domain_scores_gemma":[0.9877145,0.009305862,0.00033728353,0.0005255062,0.0014708699,0.0006459674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040022964,0.0012513013,0.0018166716,0.0020465234,0.0027094833,0.0047976915,0.0025414906,0.003229714,0.013321958],"category_scores_gemma":[0.019157266,0.0007964813,0.0013223755,0.0027646217,0.0047988,0.00897286,0.0031852468,0.006725566,0.0018106926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020466923,0.000018062236,0.0000612408,0.00004293532,0.0000071151658,0.000023136392,0.00014759686,0.001980016,0.00008638915,0.9899014,0.002431424,0.0052801627],"study_design_scores_gemma":[0.000010865087,0.000009903459,0.00004812755,0.00002254108,0.000005073782,0.000035306533,0.00006500384,0.0072233654,0.00005588125,0.9900699,0.002449431,0.000004628489],"about_ca_topic_score_codex":0.0014889189,"about_ca_topic_score_gemma":0.00086112425,"teacher_disagreement_score":0.013321958,"about_ca_system_score_codex":0.0026287592,"about_ca_system_score_gemma":0.0014615825,"threshold_uncertainty_score":0.044566393},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18456739,0.00049760425,0.7620334,0.0018640462,0.000045476012,0.00013522449,0.00022739611,0.00016319822,0.05046619],"genre_scores_gemma":[0.9619265,0.00023548493,0.034463532,0.00016275019,0.000050836934,0.00016107268,0.000077975725,0.000040300405,0.0028816084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376655,0.0029286672,0.00038348802,0.0013403832,0.0011408434,0.00044007727],"domain_scores_gemma":[0.98283225,0.010574268,0.0022193552,0.002780726,0.0010740139,0.0005193364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063115107,0.00074313226,0.0010452176,0.0017508144,0.0009242332,0.0036416245,0.0016819966,0.0019005735,0.0055605355],"category_scores_gemma":[0.030407235,0.00044103342,0.0018283755,0.00095359946,0.005471147,0.0078360485,0.0046358793,0.0032523507,0.0005016374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036233527,0.000017186345,0.00051727874,0.000041595544,0.000038769977,0.00010414949,0.00025468986,0.025092136,0.00081953953,0.9682662,0.00015522284,0.004657036],"study_design_scores_gemma":[0.000015214108,0.00004754044,0.00034471927,0.000025240519,0.000016155504,0.00005174452,0.000105571795,0.073653735,0.0010049623,0.9233886,0.0013277557,0.000018783583],"about_ca_topic_score_codex":0.0009964567,"about_ca_topic_score_gemma":0.00040109965,"teacher_disagreement_score":0.0063115107,"about_ca_system_score_codex":0.0019870573,"about_ca_system_score_gemma":0.00069232134,"threshold_uncertainty_score":0.03337884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051658065,0.000099647754,0.98057234,0.0003775674,0.00004922395,0.00012475751,0.00012028598,0.00010968772,0.0133807445],"genre_scores_gemma":[0.22358188,0.0003447049,0.7687975,0.00010918605,0.000048212765,0.00044665596,0.00030652343,0.00008745987,0.006277842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796534,0.0009453848,0.00010035521,0.00027491545,0.00058074447,0.00013313025],"domain_scores_gemma":[0.99690527,0.0022195019,0.00026227153,0.00015349501,0.00036554702,0.0000938793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026500116,0.00067864434,0.000817715,0.0030256147,0.0012213849,0.0034060488,0.001365407,0.00093024556,0.009541114],"category_scores_gemma":[0.0073261415,0.00035522282,0.0009793018,0.0026701957,0.0024747516,0.005011661,0.0017154196,0.0012553296,0.00086327095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037582777,0.000035141755,0.0006691646,0.0001348638,0.000027904043,0.00010734503,0.00049400574,0.12832108,0.0010857254,0.8150517,0.0018827858,0.052152615],"study_design_scores_gemma":[0.000017871016,0.000037321985,0.00015001195,0.000043260003,0.000017435135,0.00005682696,0.00023959557,0.4257548,0.0009297224,0.5616358,0.011096718,0.000020667729],"about_ca_topic_score_codex":0.0038100828,"about_ca_topic_score_gemma":0.0029328982,"teacher_disagreement_score":0.009541114,"about_ca_system_score_codex":0.0020190561,"about_ca_system_score_gemma":0.0026009243,"threshold_uncertainty_score":0.031918228},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10337589,0.0003315768,0.8912295,0.0012673901,0.000048177357,0.00007577194,0.0001703921,0.00033822493,0.0031630304],"genre_scores_gemma":[0.92885196,0.00022620003,0.06742455,0.00013615645,0.00006053458,0.0001051275,0.00014516534,0.000044853583,0.003005423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628085,0.002109626,0.0001790822,0.00063191983,0.00051849004,0.00027994273],"domain_scores_gemma":[0.9799185,0.014674691,0.0024813672,0.0010915174,0.0013069242,0.00052691775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008512704,0.0008097644,0.0017732481,0.0012104817,0.00067280827,0.0031537185,0.003050602,0.0028715967,0.0017423681],"category_scores_gemma":[0.03448246,0.0011770698,0.0010122673,0.0011491791,0.0019596843,0.0056024655,0.0015898607,0.0023750993,0.00046203288],"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.00016912933,0.00007476473,0.0025871706,0.00005535511,0.00006379725,0.00016922582,0.00028317678,0.91287977,0.0005908302,0.068110555,0.00056820456,0.014448007],"study_design_scores_gemma":[0.000011397152,0.000014922795,0.00028189382,0.0000036781983,0.000006167412,0.000014443229,0.000011631964,0.98008406,0.000054244276,0.019385472,0.0001222079,0.000009819703],"about_ca_topic_score_codex":0.0104575725,"about_ca_topic_score_gemma":0.008370255,"teacher_disagreement_score":0.0104575725,"about_ca_system_score_codex":0.0020579728,"about_ca_system_score_gemma":0.00095667026,"threshold_uncertainty_score":0.045020044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055937435,0.011954477,0.68564457,0.0054820073,0.0010259768,0.00013835427,0.0002786014,0.00018603653,0.23935257],"genre_scores_gemma":[0.83507574,0.008096895,0.07093362,0.00063037366,0.001463534,0.00047898982,0.00039281393,0.00014073333,0.082787246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987519,0.0006081496,0.00006133679,0.00016897316,0.00027029015,0.00013945186],"domain_scores_gemma":[0.9974369,0.001962766,0.00016991273,0.00011139038,0.00014927829,0.000169794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016885279,0.0009997264,0.0014550394,0.0006424865,0.000759232,0.002793679,0.0012663358,0.0017746286,0.006733872],"category_scores_gemma":[0.0053671207,0.0005782973,0.00089079817,0.0014072887,0.0024349517,0.0024003158,0.00097562,0.0021986805,0.0007403208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017435961,0.000020046291,0.000090822534,0.000063738946,0.000018123495,0.000035646073,0.00007719963,0.025610998,0.00021805216,0.9639902,0.0036250178,0.0062327194],"study_design_scores_gemma":[0.000015562702,0.000011702082,0.0000830301,0.000014438408,0.000005990911,0.000023631035,0.00002027194,0.038593013,0.00004542989,0.9576159,0.0035639321,0.00000712972],"about_ca_topic_score_codex":0.002433809,"about_ca_topic_score_gemma":0.0020810538,"teacher_disagreement_score":0.006733872,"about_ca_system_score_codex":0.0018434969,"about_ca_system_score_gemma":0.0015254827,"threshold_uncertainty_score":0.022527039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00915677,0.00069389085,0.98155034,0.00057022896,0.000060164944,0.000031366748,0.000040616334,0.000037561356,0.007859069],"genre_scores_gemma":[0.76827747,0.0020961573,0.21547364,0.00029880623,0.00030441472,0.000417644,0.00014505463,0.00008607662,0.0129006645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.00021591097,0.000019154857,0.0000692897,0.00010354761,0.000035508376],"domain_scores_gemma":[0.9991937,0.0005386262,0.000073936695,0.000043909644,0.00009937264,0.000050466577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001308,0.00062276656,0.0006192305,0.0008795074,0.00045651276,0.0015796437,0.0011455313,0.001042168,0.0028609992],"category_scores_gemma":[0.001831627,0.00038510788,0.00084314315,0.0005309398,0.0017989702,0.0021360149,0.0017491699,0.0016700736,0.00021319083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001123757,0.000018922745,0.0003529758,0.000040311697,0.00003637228,0.00005375362,0.000136164,0.2681066,0.000765587,0.7238973,0.0004298356,0.0061508343],"study_design_scores_gemma":[0.000008549821,0.000018679568,0.000089290144,0.000014182099,0.0000053048384,0.000019356276,0.000046111374,0.8166149,0.00015477174,0.18099268,0.0020239213,0.000012164373],"about_ca_topic_score_codex":0.0030704848,"about_ca_topic_score_gemma":0.0018414888,"teacher_disagreement_score":0.0030704848,"about_ca_system_score_codex":0.0012080962,"about_ca_system_score_gemma":0.000767053,"threshold_uncertainty_score":0.009570956},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016263064,0.0067308904,0.056507662,0.0612032,0.00089491904,0.00014795436,0.00017608042,0.00006209144,0.8580142],"genre_scores_gemma":[0.86802405,0.0028182182,0.02033892,0.011054319,0.0010176159,0.00035930655,0.00014821508,0.00011710608,0.09612223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98604834,0.0074709593,0.0005015447,0.0018193255,0.0029559522,0.0012039253],"domain_scores_gemma":[0.9884675,0.0078298515,0.0006270758,0.0012978353,0.0012882606,0.0004893359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009169181,0.00069845165,0.0013689415,0.0022101863,0.004141572,0.012737336,0.0018845452,0.0098397415,0.014829434],"category_scores_gemma":[0.02214253,0.0008380952,0.0009488536,0.0014660207,0.028531693,0.008086701,0.0037176602,0.008251099,0.0023544938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022814388,0.000004346629,0.00003260528,0.0000085789625,0.0000033110953,0.000011404464,0.00025964857,0.0000707073,0.000013122051,0.9975267,0.0009517552,0.0011153918],"study_design_scores_gemma":[0.0000053169742,0.0000023356847,0.000065054446,0.000026131958,0.0000029740795,0.000014669917,0.00021888077,0.00016135638,0.00002647022,0.98171705,0.017755486,0.0000043147984],"about_ca_topic_score_codex":0.0036848686,"about_ca_topic_score_gemma":0.0041362206,"teacher_disagreement_score":0.014829434,"about_ca_system_score_codex":0.0052154725,"about_ca_system_score_gemma":0.0044611357,"threshold_uncertainty_score":0.049609363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4813843,0.008783827,0.2350073,0.008582158,0.0011279926,0.00022778264,0.0020606935,0.0007055452,0.26212037],"genre_scores_gemma":[0.9645211,0.0016870205,0.017953146,0.00063144224,0.00056712644,0.00016136518,0.0005235194,0.00010526011,0.013850003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863005,0.00029254114,0.00006870726,0.00024273244,0.00038162054,0.0003843214],"domain_scores_gemma":[0.98740935,0.009039045,0.0008683721,0.0006743596,0.0007667093,0.0012422022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019753848,0.0010945294,0.0014057799,0.002872486,0.0016102163,0.0055428925,0.0017681028,0.0017704294,0.016461767],"category_scores_gemma":[0.015602457,0.0005111743,0.000801883,0.0017088109,0.0027451236,0.0066825687,0.0030957358,0.0045690406,0.0021885806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032807808,0.00009864218,0.0025388177,0.00031505618,0.000057408724,0.00026062716,0.0003937812,0.0057285405,0.0021362859,0.96126413,0.008800897,0.018077737],"study_design_scores_gemma":[0.00005875464,0.00006500024,0.0013430313,0.000112680034,0.000042540636,0.00035216325,0.000112902264,0.018897308,0.00088094437,0.97224885,0.005856014,0.000029798808],"about_ca_topic_score_codex":0.000438742,"about_ca_topic_score_gemma":0.00074444135,"teacher_disagreement_score":0.016461767,"about_ca_system_score_codex":0.0016031074,"about_ca_system_score_gemma":0.0006832061,"threshold_uncertainty_score":0.055070102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65170336,0.00047148374,0.3303754,0.0016917096,0.000033778077,0.00013188492,0.00012934118,0.00009173483,0.015371147],"genre_scores_gemma":[0.9671376,0.00024720706,0.02946529,0.0001630838,0.00002507022,0.000085396954,0.00004917488,0.00002100773,0.00280619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.00017785223,0.00002007692,0.00010690073,0.00004905506,0.00007309845],"domain_scores_gemma":[0.9976683,0.0013706633,0.00051561196,0.00013098176,0.00011563091,0.000198829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012882149,0.00039466913,0.00068686495,0.0003935287,0.00041708173,0.0011852814,0.0007225733,0.0012667272,0.0023280615],"category_scores_gemma":[0.0072509605,0.0004502254,0.0004201142,0.00020203984,0.0011699097,0.0025350486,0.0008039124,0.0010141153,0.00029378064],"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.00071371417,0.00029020166,0.019023934,0.00040232297,0.00029406953,0.0006673145,0.0012008192,0.56737405,0.014850413,0.31520957,0.0033493328,0.076624304],"study_design_scores_gemma":[0.00011007414,0.00018772538,0.005055678,0.000055903696,0.000053211024,0.0002286406,0.00027246447,0.8087887,0.0016725565,0.18217783,0.0013407539,0.000056380377],"about_ca_topic_score_codex":0.002284537,"about_ca_topic_score_gemma":0.0020869183,"teacher_disagreement_score":0.0023280615,"about_ca_system_score_codex":0.0009768463,"about_ca_system_score_gemma":0.00078600965,"threshold_uncertainty_score":0.0077881813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026842833,0.0043049776,0.9443404,0.0029327678,0.00028679013,0.00010979713,0.00004980653,0.000094865485,0.021037774],"genre_scores_gemma":[0.8419454,0.0022503224,0.1478373,0.00024745837,0.000322798,0.00035570515,0.00007909796,0.00006893372,0.006892997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393255,0.004276844,0.00015060895,0.00028239636,0.001064884,0.000292794],"domain_scores_gemma":[0.9853872,0.012684116,0.00047371344,0.00045014234,0.00073698757,0.0002677658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076292492,0.0008063283,0.0018575833,0.0019647605,0.0013937345,0.0035110782,0.0019132076,0.0024552296,0.004590237],"category_scores_gemma":[0.022050302,0.0005829358,0.0009105348,0.0029409651,0.0043662465,0.0061869766,0.002523177,0.002444719,0.0004923149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010844897,0.00008771115,0.0004145721,0.00017935426,0.000089329,0.000076914,0.00053269794,0.085911095,0.00026027765,0.8648056,0.002053297,0.04548066],"study_design_scores_gemma":[0.000024843317,0.00002035511,0.000104627994,0.000036228088,0.000020756479,0.000018600062,0.0001793553,0.21450038,0.00017147316,0.78219706,0.0027135902,0.000012834781],"about_ca_topic_score_codex":0.0041048466,"about_ca_topic_score_gemma":0.0023355193,"teacher_disagreement_score":0.0076292492,"about_ca_system_score_codex":0.002424845,"about_ca_system_score_gemma":0.0021446722,"threshold_uncertainty_score":0.040347815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1693491,0.00038167406,0.81535673,0.0010434483,0.00005403665,0.00016438047,0.0001098909,0.00007788947,0.013462671],"genre_scores_gemma":[0.9362806,0.00039821508,0.059418514,0.00014699461,0.000028151942,0.00012370941,0.00006891792,0.000022365286,0.0035124535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793506,0.0011553947,0.00006881119,0.00028616478,0.0002380478,0.00031655986],"domain_scores_gemma":[0.9958621,0.0022124674,0.0007258588,0.00034970112,0.0003261428,0.00052372966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022438916,0.00085997017,0.0006855243,0.000574638,0.0009733847,0.0020100428,0.0014986387,0.0012610285,0.0020203632],"category_scores_gemma":[0.0075873164,0.00060526177,0.0006365142,0.0007189791,0.0019977344,0.0043058433,0.0023808007,0.0011272352,0.00025590466],"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.00013554936,0.00008056693,0.0017832322,0.00013885912,0.00007592195,0.00035211205,0.00034456144,0.55699,0.0028720726,0.42232695,0.0012546121,0.013645497],"study_design_scores_gemma":[0.000031216066,0.000070203205,0.00032816292,0.000020750722,0.000023089397,0.00011631517,0.00019590644,0.7865838,0.0010183348,0.20907721,0.00251404,0.000020853327],"about_ca_topic_score_codex":0.0020525183,"about_ca_topic_score_gemma":0.002106865,"teacher_disagreement_score":0.0022438916,"about_ca_system_score_codex":0.0014868687,"about_ca_system_score_gemma":0.0010982895,"threshold_uncertainty_score":0.011866987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074016917,0.00022271146,0.960448,0.0010691007,0.00013355013,0.0010933693,0.0013068899,0.015222659,0.013102015],"genre_scores_gemma":[0.07803427,0.00019079272,0.9085107,0.0003557522,0.00006608628,0.0011401253,0.0032571615,0.0014830369,0.0069620465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965655,0.00057692424,0.00026327732,0.0011731277,0.000833679,0.00058748457],"domain_scores_gemma":[0.99601513,0.002465196,0.00017271712,0.00078648294,0.00038805063,0.00017232356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021190734,0.0038318445,0.0023998842,0.0017838402,0.0021164527,0.0046276376,0.005002085,0.0033731612,0.045483083],"category_scores_gemma":[0.007982646,0.001344904,0.0034887514,0.0023561353,0.0014891309,0.0067309863,0.004944651,0.0042369454,0.010959505],"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.0008668097,0.0009140774,0.0013149031,0.0010908673,0.00032245115,0.00033480424,0.0005881231,0.13750626,0.006917585,0.17131962,0.06359089,0.6152335],"study_design_scores_gemma":[0.00074396026,0.00014542056,0.00028770245,0.00008395983,0.00014631853,0.0002470785,0.00027296826,0.6207104,0.0045368783,0.35007548,0.022671005,0.00007880071],"about_ca_topic_score_codex":0.009932967,"about_ca_topic_score_gemma":0.015573833,"teacher_disagreement_score":0.045483083,"about_ca_system_score_codex":0.0046240566,"about_ca_system_score_gemma":0.007106902,"threshold_uncertainty_score":0.15215605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12836848,0.00022030082,0.84382606,0.001012652,0.000099461504,0.00038105174,0.000103578765,0.0001891264,0.025799258],"genre_scores_gemma":[0.87338364,0.00034473676,0.11762082,0.00014688834,0.000054454584,0.0004752443,0.00009194326,0.000028982262,0.007853299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796116,0.0011080833,0.00008929759,0.00035329975,0.0003261645,0.00016186832],"domain_scores_gemma":[0.99654335,0.0017418019,0.00067561347,0.0005039172,0.00026867664,0.00026666082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026061495,0.00051288353,0.00069665076,0.0006931597,0.00086896744,0.0014045154,0.0014898401,0.0013927408,0.005149573],"category_scores_gemma":[0.0047599636,0.00037749123,0.0007186613,0.0006769668,0.0018799307,0.0026091447,0.0018065966,0.00069465826,0.00044437213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013493813,0.00015426212,0.00068666524,0.00019215266,0.00007825918,0.0002746243,0.00026343172,0.13855484,0.006544867,0.8296968,0.0015843263,0.021834748],"study_design_scores_gemma":[0.00019760881,0.00014174712,0.00033231868,0.000039935345,0.000041333104,0.00019610206,0.00009154771,0.36384204,0.0032280392,0.62337315,0.008487285,0.000028904291],"about_ca_topic_score_codex":0.00062461785,"about_ca_topic_score_gemma":0.0005405675,"teacher_disagreement_score":0.005149573,"about_ca_system_score_codex":0.0007608036,"about_ca_system_score_gemma":0.0011130177,"threshold_uncertainty_score":0.017227054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8513263,0.002503257,0.13414052,0.0012535696,0.00019764197,0.00081921456,0.00044081302,0.0005935092,0.008725269],"genre_scores_gemma":[0.94995755,0.00020090584,0.04848626,0.00011550351,0.000037727168,0.00036374872,0.00034954413,0.000035894103,0.0004528364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9834409,0.012800609,0.0007954145,0.0009118872,0.0016008241,0.00045035654],"domain_scores_gemma":[0.87410235,0.11188452,0.003917028,0.0050964006,0.0037742797,0.0012254345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020720193,0.0015269608,0.0011462888,0.0015754866,0.0008251608,0.0013417732,0.0022144935,0.002174962,0.0011629271],"category_scores_gemma":[0.084076166,0.00048345164,0.00051804836,0.0009849647,0.0014105352,0.0022289304,0.0017344516,0.002084579,0.0002927386],"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.001039753,0.0025403234,0.017536312,0.0003688708,0.00027434432,0.00007815033,0.00022419814,0.92082036,0.0012059656,0.007363281,0.0017170028,0.046831526],"study_design_scores_gemma":[0.00026493717,0.0009638379,0.0016577368,0.00003678304,0.000028526514,0.000028352093,0.000101413534,0.98836887,0.0013480923,0.006539968,0.00064341427,0.000018013578],"about_ca_topic_score_codex":0.0029272595,"about_ca_topic_score_gemma":0.0031562229,"teacher_disagreement_score":0.020720193,"about_ca_system_score_codex":0.0021968358,"about_ca_system_score_gemma":0.0014104478,"threshold_uncertainty_score":0.10958022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06773353,0.000057676727,0.9289102,0.0002035065,0.000017269092,0.00008387434,0.000029908453,0.0002911734,0.0026728585],"genre_scores_gemma":[0.82914275,0.000051605177,0.169329,0.00007020847,0.000012219268,0.00015721057,0.000057724334,0.00004260285,0.0011367138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921286,0.000352592,0.00003455631,0.0001356196,0.00015640775,0.000107934364],"domain_scores_gemma":[0.9966563,0.002540539,0.00028214534,0.00016839958,0.00022913571,0.00012338968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016767924,0.00063607696,0.001064916,0.0005889974,0.00054142193,0.0010624191,0.0011072188,0.00089566637,0.0019211695],"category_scores_gemma":[0.0069079,0.00038004373,0.000509299,0.00037629373,0.0011005386,0.0013279236,0.0014524485,0.0010520181,0.00019724274],"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.00018718117,0.00012242963,0.0010109032,0.0000678932,0.000046180383,0.00008722475,0.00009126415,0.9125712,0.0033695102,0.046809115,0.00050113566,0.03513591],"study_design_scores_gemma":[0.000023333341,0.000016407508,0.00003852984,0.0000024315732,0.0000033267756,0.0000077925815,0.0000072268426,0.9853393,0.00067269686,0.013797291,0.00008908803,0.0000026379148],"about_ca_topic_score_codex":0.0019340898,"about_ca_topic_score_gemma":0.0025962824,"teacher_disagreement_score":0.0019340898,"about_ca_system_score_codex":0.0013158144,"about_ca_system_score_gemma":0.0015753612,"threshold_uncertainty_score":0.009546995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085147,0.00062220264,0.8655529,0.0015720305,0.00022409187,0.00019718337,0.00017999507,0.0011813093,0.045323424],"genre_scores_gemma":[0.8485589,0.00071228534,0.10064198,0.00039579105,0.00022409206,0.00029289586,0.00010246892,0.00029048687,0.04878117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987344,0.0004986219,0.000057466197,0.00017754546,0.00031285975,0.00021901724],"domain_scores_gemma":[0.99516857,0.0025408056,0.0002896333,0.0015172329,0.00031476837,0.00016905378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016246731,0.0007105505,0.000814785,0.0007260754,0.0011825935,0.0021985404,0.0017558058,0.0012956477,0.004484449],"category_scores_gemma":[0.006018445,0.00061369233,0.0005471582,0.00097301474,0.0019198257,0.005271426,0.0027732197,0.0020911878,0.0010576446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024120993,0.00009506557,0.00024989204,0.00016801087,0.000042700187,0.00013780556,0.00038665964,0.079580165,0.004304496,0.8516246,0.0075721066,0.0555973],"study_design_scores_gemma":[0.000047095386,0.0000798217,0.00008441125,0.00002586059,0.000029212866,0.00021067815,0.00006628264,0.28143486,0.0036625057,0.70778304,0.006545548,0.000030596],"about_ca_topic_score_codex":0.00041706004,"about_ca_topic_score_gemma":0.00044056404,"teacher_disagreement_score":0.004484449,"about_ca_system_score_codex":0.0010146956,"about_ca_system_score_gemma":0.0010455622,"threshold_uncertainty_score":0.015001953},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117263064,0.0030507937,0.7550694,0.004859404,0.00091793993,0.00025398788,0.000721814,0.0008008553,0.11706275],"genre_scores_gemma":[0.8695334,0.001565183,0.1076222,0.0012425799,0.0008051821,0.00030013846,0.00045192416,0.00059231144,0.017887034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595886,0.0018688487,0.00014190677,0.00069312,0.00080149766,0.00053572375],"domain_scores_gemma":[0.9666104,0.027556272,0.00081961474,0.0025873962,0.0012529802,0.0011733198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049339198,0.0026906813,0.0037157673,0.0018182115,0.0017345787,0.0051161144,0.0062044696,0.004230195,0.020705726],"category_scores_gemma":[0.03269148,0.0013800728,0.0018695374,0.002704747,0.004109972,0.0125200655,0.0056738425,0.008083443,0.0025959958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086110027,0.0005051822,0.0010978912,0.0006026654,0.00016274054,0.0002297894,0.00039212615,0.22445385,0.003701572,0.68523103,0.017772716,0.06498936],"study_design_scores_gemma":[0.000069798574,0.0001012712,0.00023735146,0.0000513617,0.000037718084,0.000053503303,0.000056552857,0.38721225,0.0005923211,0.61012626,0.0014279058,0.000033743112],"about_ca_topic_score_codex":0.0021134194,"about_ca_topic_score_gemma":0.002744004,"teacher_disagreement_score":0.020705726,"about_ca_system_score_codex":0.003709268,"about_ca_system_score_gemma":0.0025115972,"threshold_uncertainty_score":0.06926757},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09046711,0.00058385654,0.89561915,0.0012854978,0.000068896916,0.000108323504,0.00030145212,0.00036982796,0.011195943],"genre_scores_gemma":[0.7028693,0.00100142,0.2884731,0.0002819138,0.0001844879,0.0004153025,0.0008621516,0.00016346842,0.0057487763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984805,0.0006962162,0.00006260653,0.00024750928,0.00027267702,0.00024048315],"domain_scores_gemma":[0.9913488,0.007370472,0.00052647165,0.00039491776,0.00021447628,0.00014488476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019162903,0.0014097616,0.0010533645,0.00147828,0.0007360627,0.002914877,0.0015140394,0.00095122156,0.0047643483],"category_scores_gemma":[0.012552354,0.0004643916,0.0011067758,0.0017865374,0.0024726526,0.0051497906,0.0013762396,0.0024329976,0.00063245354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006723315,0.00008142221,0.00054470776,0.00009109163,0.000021808599,0.000069475675,0.00014937537,0.18470272,0.0003904114,0.7875135,0.0014319859,0.024936311],"study_design_scores_gemma":[0.000016350301,0.000019231766,0.00005863778,0.000013426707,0.0000064546202,0.000024850187,0.000037743313,0.37760296,0.00033117237,0.6209815,0.00089781237,0.000009867261],"about_ca_topic_score_codex":0.0018737261,"about_ca_topic_score_gemma":0.0015099483,"teacher_disagreement_score":0.0047643483,"about_ca_system_score_codex":0.001963294,"about_ca_system_score_gemma":0.0009852678,"threshold_uncertainty_score":0.015938342},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008335307,0.09597599,0.17650145,0.32242775,0.010504191,0.00018758758,0.0014490213,0.00028467376,0.38433403],"genre_scores_gemma":[0.4260611,0.11463092,0.061703946,0.07726886,0.06646319,0.0012386638,0.0021828588,0.0008584695,0.24959192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995443,0.0018197708,0.00038053727,0.00054473506,0.0013906881,0.00042131354],"domain_scores_gemma":[0.9685997,0.02654624,0.0009188931,0.0018685759,0.0015603441,0.00050627853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061371466,0.0012028958,0.0013647602,0.002041995,0.0026273446,0.0062084957,0.0023902545,0.007514794,0.020650748],"category_scores_gemma":[0.026629297,0.00094180176,0.00162737,0.0045600706,0.0064676492,0.010466893,0.0030420015,0.008061393,0.0033440525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031991523,0.00004409352,0.00014789852,0.00023178871,0.000029819977,0.0001035799,0.00023581862,0.002005484,0.000075532764,0.9040763,0.07119055,0.021827241],"study_design_scores_gemma":[0.000025800635,0.000014193564,0.00021993686,0.00023194365,0.000010628349,0.000087755325,0.00010468009,0.0022900405,0.000051900028,0.89649487,0.10044871,0.000019576155],"about_ca_topic_score_codex":0.0017988826,"about_ca_topic_score_gemma":0.00081176497,"teacher_disagreement_score":0.020650748,"about_ca_system_score_codex":0.0053047678,"about_ca_system_score_gemma":0.0022899702,"threshold_uncertainty_score":0.06908363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66974294,0.0012062541,0.22531402,0.0040071276,0.00016090643,0.00034570758,0.00024297433,0.00006787202,0.0989123],"genre_scores_gemma":[0.9895942,0.00034528467,0.0038789946,0.00006617881,0.00002027598,0.00007560466,0.00003962434,0.000006365503,0.005973431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992741,0.00027900524,0.000024251482,0.00012230196,0.000103837316,0.00019649764],"domain_scores_gemma":[0.99917233,0.000415574,0.000117818185,0.000023354412,0.00011864987,0.00015230034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011108959,0.00049615867,0.000743694,0.0007450187,0.0014069458,0.002449925,0.0015582414,0.0016777553,0.0053932243],"category_scores_gemma":[0.0028409462,0.00031242036,0.0007938691,0.00068869436,0.0014622102,0.0028932847,0.0010756775,0.0012071512,0.00016318065],"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.00008362023,0.00014959567,0.010979362,0.0001677608,0.00010417589,0.0021602777,0.0017403818,0.3390131,0.0017456939,0.62960434,0.0031474133,0.011104318],"study_design_scores_gemma":[0.000034995715,0.000078708224,0.0030804295,0.000025111023,0.00005315507,0.00018056278,0.0010275292,0.90823084,0.0001538219,0.08458898,0.0025109106,0.000034935292],"about_ca_topic_score_codex":0.026268383,"about_ca_topic_score_gemma":0.013893778,"teacher_disagreement_score":0.026268383,"about_ca_system_score_codex":0.0031832021,"about_ca_system_score_gemma":0.002513709,"threshold_uncertainty_score":0.052231014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50437933,0.00023457277,0.31607568,0.002975178,0.00011632245,0.00015756539,0.00016474801,0.00033788194,0.17555872],"genre_scores_gemma":[0.9847157,0.000043849777,0.00967967,0.00004777074,0.000015866954,0.00008015551,0.00003330663,0.000022078846,0.0053617074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980356,0.00092351134,0.00010441381,0.00043237896,0.0002378732,0.0002662545],"domain_scores_gemma":[0.99035513,0.00487431,0.0014124325,0.0018006865,0.000641519,0.0009158535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018128606,0.00035193985,0.00047493758,0.0009006371,0.0008889993,0.0037266465,0.0008132535,0.0013537568,0.009782712],"category_scores_gemma":[0.014368315,0.00044395868,0.00045984585,0.0008342858,0.0024635636,0.0044305124,0.0023850286,0.00095458206,0.0009786433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001803403,0.00012210596,0.0040318496,0.00007810191,0.000068222995,0.00017208357,0.0016371777,0.024433512,0.0023624953,0.9303714,0.0014146215,0.03512809],"study_design_scores_gemma":[0.000081681035,0.00018184833,0.0060527124,0.00003895649,0.000047271686,0.00009318309,0.0013894578,0.07906425,0.0007379826,0.90664464,0.00563117,0.00003676218],"about_ca_topic_score_codex":0.0011491938,"about_ca_topic_score_gemma":0.0009208609,"teacher_disagreement_score":0.009782712,"about_ca_system_score_codex":0.00091476494,"about_ca_system_score_gemma":0.0012235466,"threshold_uncertainty_score":0.032726407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12772469,0.0029369707,0.6376521,0.004711006,0.00037780654,0.00012205525,0.00015270065,0.00010777626,0.22621493],"genre_scores_gemma":[0.90648824,0.002140017,0.032290526,0.00024972812,0.00027673296,0.00014409347,0.00006380568,0.0000455494,0.05830118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994374,0.00029636896,0.00001596777,0.00009403808,0.00009531523,0.000060856182],"domain_scores_gemma":[0.9983541,0.0010597672,0.00019747134,0.00013177292,0.00011935178,0.0001375949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624042,0.00047273116,0.00060245715,0.00034838266,0.0007193235,0.0016614887,0.0010692888,0.0016720511,0.008836464],"category_scores_gemma":[0.0068225204,0.0004109222,0.0004345582,0.0006607862,0.0018056374,0.0029563466,0.0014521602,0.0011920149,0.00050207344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035881614,0.00002413669,0.00017084517,0.0000630177,0.000013597453,0.00006399842,0.000108144566,0.046990808,0.0005614229,0.9374741,0.0025493016,0.011944742],"study_design_scores_gemma":[0.000028360739,0.000020848394,0.00015592248,0.000020543637,0.000009196439,0.00008501032,0.00006049875,0.14704177,0.00024031337,0.84820753,0.0041203485,0.000009623679],"about_ca_topic_score_codex":0.0011329466,"about_ca_topic_score_gemma":0.0010731923,"teacher_disagreement_score":0.008836464,"about_ca_system_score_codex":0.0012269579,"about_ca_system_score_gemma":0.00079570565,"threshold_uncertainty_score":0.029560983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004238275,0.06482525,0.106469855,0.009116688,0.0020002504,0.0001802847,0.00039008082,0.00026378775,0.81251556],"genre_scores_gemma":[0.36315638,0.12941459,0.10416824,0.008745419,0.004039119,0.00091019255,0.0013868354,0.00046758584,0.38771164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935585,0.00022839075,0.000032601267,0.00009468678,0.00020488127,0.000083505576],"domain_scores_gemma":[0.9994974,0.00030389032,0.00003771514,0.00004462642,0.00006523892,0.000051039144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054220203,0.0015029937,0.0007366114,0.001126516,0.0010518457,0.003461456,0.0008907511,0.0016493504,0.012322082],"category_scores_gemma":[0.0018716244,0.0003688195,0.00064109615,0.0014861362,0.0034083447,0.004739834,0.0015886637,0.0027982527,0.002801051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031481964,0.00000769386,0.000027234602,0.00008023442,0.0000053830972,0.000029565108,0.00010542252,0.001256948,0.00007572942,0.9735348,0.014476016,0.010397832],"study_design_scores_gemma":[0.000005660478,0.000008312299,0.00007713583,0.000103629165,0.0000039837037,0.00010062242,0.00009068502,0.0017079575,0.000058344744,0.8310687,0.16676807,0.000006905367],"about_ca_topic_score_codex":0.0029808003,"about_ca_topic_score_gemma":0.0027489564,"teacher_disagreement_score":0.012322082,"about_ca_system_score_codex":0.0029844048,"about_ca_system_score_gemma":0.0014438631,"threshold_uncertainty_score":0.04122144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6477898,0.0009764048,0.28904673,0.0073880525,0.00019647293,0.00018309258,0.0002661697,0.00025495357,0.053898368],"genre_scores_gemma":[0.9921267,0.00022711993,0.0056886277,0.00010970074,0.000081839855,0.000035167013,0.000028786195,0.000028321427,0.0016736542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597114,0.0020550762,0.00022848672,0.00040795005,0.0007077774,0.0006296261],"domain_scores_gemma":[0.95569825,0.031642683,0.0049192687,0.0034820915,0.0023385705,0.0019190712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007415109,0.0004870988,0.0015875879,0.0014347004,0.0018136341,0.006034772,0.0014201299,0.0021905287,0.0048531825],"category_scores_gemma":[0.048674453,0.00075270486,0.000990332,0.0012699964,0.0064099743,0.011452574,0.004753979,0.002551314,0.00028713865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002613224,0.00014556742,0.0035750333,0.00010754616,0.00010250605,0.00033844632,0.0005010535,0.082742296,0.0015080258,0.89540327,0.0013261581,0.013988633],"study_design_scores_gemma":[0.000040453902,0.00005773439,0.0018572732,0.00002332329,0.000034107466,0.00007471072,0.00025786227,0.1317085,0.00060384156,0.8645266,0.0007746986,0.000040924824],"about_ca_topic_score_codex":0.001845251,"about_ca_topic_score_gemma":0.0014578028,"teacher_disagreement_score":0.007415109,"about_ca_system_score_codex":0.0018091497,"about_ca_system_score_gemma":0.0014818677,"threshold_uncertainty_score":0.039215326},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040354533,0.8270243,0.00370804,0.041924838,0.055236742,0.000079152844,0.00041870135,0.0001664469,0.07103824],"genre_scores_gemma":[0.0060198526,0.64187497,0.0033955695,0.019887231,0.038263276,0.00014558843,0.0007975298,0.0002355499,0.28938046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942005,0.00010455148,0.000026757609,0.00009961531,0.00031164347,0.000037382968],"domain_scores_gemma":[0.99737513,0.0014712642,0.0001223551,0.00006223327,0.0007625993,0.00020643415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007283193,0.0013866395,0.0018174761,0.0024898683,0.0006019182,0.0022760069,0.0012623655,0.0019595565,0.039842952],"category_scores_gemma":[0.003684893,0.0005300491,0.0007581356,0.003975014,0.0009971695,0.0029632584,0.0008112276,0.0033508025,0.028109133],"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.000011164434,0.0000117505,0.000024297779,0.00034918485,0.00000984807,0.000011622046,0.000012271769,0.00014326321,0.00007160159,0.0027607295,0.9581162,0.038478065],"study_design_scores_gemma":[0.000013382159,0.000022181468,0.00027214564,0.0006139111,0.000017613344,0.00013702088,0.000019520829,0.00023618886,0.00010032246,0.0054786694,0.9930775,0.000011493226],"about_ca_topic_score_codex":0.0028072018,"about_ca_topic_score_gemma":0.006094508,"teacher_disagreement_score":0.039842952,"about_ca_system_score_codex":0.0017980823,"about_ca_system_score_gemma":0.0015314681,"threshold_uncertainty_score":0.13328797},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30115446,0.00066954043,0.63190705,0.0038915884,0.00016269367,0.00018794145,0.00063843105,0.00028608576,0.0611023],"genre_scores_gemma":[0.9542232,0.000366386,0.01898647,0.00014977458,0.00006600739,0.00014022706,0.000112659276,0.000023828996,0.025931472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981609,0.0005833736,0.00010140003,0.00044014756,0.00035043532,0.0003638421],"domain_scores_gemma":[0.9938199,0.003227502,0.0015491928,0.00069710385,0.00032817,0.00037820992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018366456,0.000760767,0.0013411958,0.00070253824,0.00095162855,0.003378943,0.0026173126,0.0038731203,0.010733026],"category_scores_gemma":[0.008231048,0.0007173578,0.0017616634,0.0011163199,0.0025645797,0.0044180322,0.0021810937,0.0023905456,0.0010589114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018262258,0.00012832975,0.0014280962,0.000093308205,0.00007657821,0.000540635,0.0004193185,0.38695934,0.0022617711,0.5960881,0.001170945,0.010650905],"study_design_scores_gemma":[0.00013604891,0.00012358096,0.0006288052,0.000026730488,0.0000498792,0.00018253337,0.00014623198,0.68541485,0.0006858816,0.30732253,0.005221992,0.00006094356],"about_ca_topic_score_codex":0.005324141,"about_ca_topic_score_gemma":0.0031423145,"teacher_disagreement_score":0.010733026,"about_ca_system_score_codex":0.0025616358,"about_ca_system_score_gemma":0.001775815,"threshold_uncertainty_score":0.0359056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3978699,0.0022850838,0.37929013,0.013065662,0.00044553512,0.00011784133,0.00065068796,0.00030917372,0.20596597],"genre_scores_gemma":[0.9751609,0.0005572694,0.009051885,0.00038556437,0.00013409367,0.00007543287,0.00010749082,0.000052173098,0.014475166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998808,0.0006083153,0.000027783863,0.00012348272,0.00020120671,0.00023123661],"domain_scores_gemma":[0.99509686,0.0031812086,0.00033885322,0.00037239672,0.00030372894,0.0007069524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030549746,0.0007385845,0.0025591797,0.0011754401,0.002050771,0.0031897677,0.0030036117,0.0031770575,0.008360165],"category_scores_gemma":[0.009827136,0.0006564144,0.00083846226,0.001193646,0.0033078808,0.0045968955,0.0021993502,0.004013391,0.00069211714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055748475,0.00003096272,0.00018110665,0.000020268391,0.000014262364,0.00006512507,0.00004427607,0.013486444,0.00016585793,0.98301053,0.0013448979,0.0015805452],"study_design_scores_gemma":[0.00004761994,0.000012890969,0.00009486129,0.000006654397,0.0000075678963,0.000032945034,0.00002681653,0.07695183,0.00005104247,0.92224187,0.00051172415,0.000014109084],"about_ca_topic_score_codex":0.0056433133,"about_ca_topic_score_gemma":0.004127403,"teacher_disagreement_score":0.008360165,"about_ca_system_score_codex":0.0021684708,"about_ca_system_score_gemma":0.0018290099,"threshold_uncertainty_score":0.027967572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237724,0.0006595858,0.35642415,0.0010591873,0.00005563798,0.00016571603,0.000143133,0.0001077233,0.01761249],"genre_scores_gemma":[0.9771249,0.00022376847,0.018337049,0.000103167746,0.00004859552,0.000090699,0.00006897694,0.00002868107,0.003974021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734604,0.0010837889,0.000107237,0.00049377914,0.00049856625,0.00047061997],"domain_scores_gemma":[0.9864499,0.007492911,0.0027030013,0.00074725767,0.0010857154,0.0015212039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038861928,0.00063039333,0.0010881325,0.0011296092,0.001893833,0.0029757412,0.0014717199,0.0017812744,0.003657604],"category_scores_gemma":[0.017786862,0.0006562343,0.0010533961,0.00067185896,0.0036085066,0.0043136124,0.0025751255,0.0016425248,0.00036501262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017101379,0.00015056232,0.003947917,0.000091311354,0.0001690543,0.0008059044,0.0014816243,0.18116249,0.003727504,0.7968627,0.0009901209,0.0104397265],"study_design_scores_gemma":[0.000111022884,0.00017931133,0.0009125306,0.000028798611,0.00003315114,0.00024230576,0.0006033639,0.5247012,0.00082254066,0.46975362,0.0025667483,0.000045360186],"about_ca_topic_score_codex":0.0024969736,"about_ca_topic_score_gemma":0.0017339744,"teacher_disagreement_score":0.0038861928,"about_ca_system_score_codex":0.0013799387,"about_ca_system_score_gemma":0.0010847119,"threshold_uncertainty_score":0.020552397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.920087,0.00012836164,0.06020665,0.0006542599,0.000017866216,0.00008873537,0.00009461012,0.000050238912,0.018672263],"genre_scores_gemma":[0.9920923,0.0000521715,0.005984037,0.000028678225,0.0000062452095,0.000025429898,0.000029601722,0.0000058495957,0.0017756039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992605,0.00034743722,0.000033459724,0.00013924387,0.000110431276,0.00010887556],"domain_scores_gemma":[0.9928691,0.0042229937,0.0012886769,0.0004384772,0.0003473089,0.0008334885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909965,0.00019812488,0.00052379665,0.00081458205,0.0011243782,0.0024469295,0.0007752307,0.0016490569,0.007263775],"category_scores_gemma":[0.009989835,0.00045537626,0.0003587332,0.000642035,0.0015603,0.004615654,0.0015817342,0.00076671864,0.00054414483],"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.0011216344,0.00071163935,0.037696872,0.00020632207,0.00015714501,0.0021763947,0.0021937876,0.23692493,0.01799507,0.6474437,0.003194785,0.050177675],"study_design_scores_gemma":[0.0001918815,0.00021956816,0.012097262,0.000036924048,0.00007550449,0.00045320977,0.0013714579,0.6360804,0.002909667,0.34252146,0.003990044,0.00005264457],"about_ca_topic_score_codex":0.0012613173,"about_ca_topic_score_gemma":0.0011878851,"teacher_disagreement_score":0.007263775,"about_ca_system_score_codex":0.0010480059,"about_ca_system_score_gemma":0.0005507896,"threshold_uncertainty_score":0.02429974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21300067,0.0034246917,0.48608956,0.021654723,0.00096009974,0.00018719581,0.00077052583,0.00028811127,0.27362445],"genre_scores_gemma":[0.9556226,0.0012163753,0.03100533,0.00041710862,0.0003055345,0.00011272974,0.00011454713,0.00005871579,0.011147056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965989,0.0016274963,0.00012123904,0.0004703928,0.00088129163,0.00030075194],"domain_scores_gemma":[0.99318624,0.0038098465,0.00064146594,0.0008060693,0.0007173137,0.0008389872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028756629,0.00049723574,0.00051029515,0.0019682504,0.0015503627,0.0067519415,0.0011460967,0.0022029423,0.0061093466],"category_scores_gemma":[0.015132519,0.0003009972,0.00040176648,0.0016130689,0.005491139,0.011982886,0.003076218,0.0012981137,0.0005905793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023312943,0.000008961621,0.00046646438,0.000046809913,0.000018913908,0.000047817626,0.00019977076,0.003343692,0.0005809064,0.9850639,0.00077794754,0.009421586],"study_design_scores_gemma":[0.000010679285,0.00002899851,0.00031318513,0.000054458407,0.000020385554,0.00011907521,0.00020943063,0.009546307,0.0004950819,0.975274,0.0139099965,0.000018358473],"about_ca_topic_score_codex":0.00048211598,"about_ca_topic_score_gemma":0.00038563638,"teacher_disagreement_score":0.0067519415,"about_ca_system_score_codex":0.0017894522,"about_ca_system_score_gemma":0.00086541515,"threshold_uncertainty_score":0.020437837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18110168,0.00033518928,0.806587,0.0011430961,0.000033068744,0.000052906336,0.00005878703,0.000045842542,0.010642521],"genre_scores_gemma":[0.97403044,0.00015112123,0.023622073,0.00009588671,0.000035714595,0.00007387226,0.000015412219,0.0000108924605,0.0019646364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819416,0.0010621774,0.00005139433,0.00023956552,0.00027218813,0.00018058794],"domain_scores_gemma":[0.9954536,0.0033613476,0.0006271876,0.00024266425,0.00015167217,0.00016350932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025939397,0.00063255994,0.0009169971,0.00046591894,0.00055994175,0.0014500604,0.001085811,0.0014509334,0.0013911553],"category_scores_gemma":[0.008819234,0.00052078103,0.00055309804,0.0005859257,0.0023651617,0.0022697905,0.0012795116,0.0009847737,0.00012297746],"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.00008670447,0.000029599923,0.00063639856,0.000055005494,0.000055298355,0.00018750022,0.000100628255,0.6680085,0.0022203396,0.323297,0.00038556606,0.0049375165],"study_design_scores_gemma":[0.000038123653,0.0000568355,0.00018315695,0.000006807274,0.000011594381,0.00003807769,0.000038161594,0.83624744,0.0003162163,0.16263835,0.00041482862,0.000010440363],"about_ca_topic_score_codex":0.0013817996,"about_ca_topic_score_gemma":0.001113691,"teacher_disagreement_score":0.0025939397,"about_ca_system_score_codex":0.0014653361,"about_ca_system_score_gemma":0.00080075476,"threshold_uncertainty_score":0.013718188},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013525806,0.6404617,0.16607296,0.03021431,0.005876948,0.00016861173,0.0011368975,0.00029218805,0.14225057],"genre_scores_gemma":[0.24139757,0.6663645,0.039143257,0.0025169956,0.0051992666,0.0002480554,0.0013386762,0.000104137805,0.04368762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992816,0.0002787871,0.00003201589,0.00013715442,0.0002295472,0.00004087915],"domain_scores_gemma":[0.9980792,0.00090524636,0.00015012288,0.00018420405,0.00056641095,0.000114772505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012640457,0.0007742963,0.0008982157,0.0036115646,0.0008727583,0.0036777733,0.0010979098,0.0015210855,0.0078466665],"category_scores_gemma":[0.0044248453,0.00040075544,0.00035823323,0.005319661,0.002893359,0.0042265533,0.0013742965,0.0011131337,0.0012886378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015092678,0.000025265888,0.0007585953,0.0011503304,0.00007328141,0.000060938917,0.00023134735,0.0083363475,0.00037387045,0.74162495,0.053800467,0.19354953],"study_design_scores_gemma":[0.000008076064,0.000024927136,0.0014169029,0.0006537262,0.00005429446,0.00018237422,0.0004041569,0.0048802607,0.00016081687,0.37785286,0.6143317,0.000029861798],"about_ca_topic_score_codex":0.006543089,"about_ca_topic_score_gemma":0.00879359,"teacher_disagreement_score":0.0078466665,"about_ca_system_score_codex":0.002648782,"about_ca_system_score_gemma":0.0022327758,"threshold_uncertainty_score":0.026249647},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007909936,0.0077937115,0.092096515,0.08718584,0.027979027,0.0020444593,0.1145897,0.0016729316,0.6587278],"genre_scores_gemma":[0.116381265,0.010292084,0.08041077,0.012742948,0.01984431,0.0045546857,0.118368834,0.002183913,0.6352212],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738616,0.0006717483,0.00022398849,0.00032162687,0.0011447138,0.0002516858],"domain_scores_gemma":[0.9759186,0.014546635,0.0009681876,0.0017981584,0.0052870777,0.0014812781],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00217002,0.0016208984,0.002195838,0.0029821908,0.0019027883,0.0031062313,0.002622462,0.003986259,0.3724834],"category_scores_gemma":[0.033472206,0.0008172289,0.0017233193,0.004865189,0.00081691984,0.0048786737,0.0022680536,0.003531801,0.13800806],"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.000076334814,0.00012623746,0.0002069975,0.00028256048,0.000014467254,0.000081805534,0.000041748997,0.00094663876,0.000122007456,0.033313192,0.94279003,0.021997992],"study_design_scores_gemma":[0.00024234089,0.00006971784,0.0029101367,0.000517533,0.00003552989,0.00033012795,0.00019895738,0.0030131855,0.00078290276,0.29505786,0.69676507,0.000076700155],"about_ca_topic_score_codex":0.003736561,"about_ca_topic_score_gemma":0.0033786045,"teacher_disagreement_score":0.3724834,"about_ca_system_score_codex":0.003326528,"about_ca_system_score_gemma":0.0032206576,"threshold_uncertainty_score":0.8950763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8631493,0.00058222434,0.02532194,0.0024025152,0.000044977103,0.00041178305,0.00069285644,0.000051515188,0.10734288],"genre_scores_gemma":[0.9946398,0.00021493479,0.0019498519,0.000054714128,0.0000035587325,0.00003243356,0.00007285966,0.0000037903326,0.0030280543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987753,0.00046814527,0.000031129086,0.00008117924,0.0002744533,0.00036988195],"domain_scores_gemma":[0.9980108,0.0011536792,0.0001482226,0.000039160932,0.00044652936,0.00020161559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012748052,0.00043876944,0.00047584617,0.0017924844,0.002430358,0.002423603,0.0011941998,0.0011233723,0.0040683094],"category_scores_gemma":[0.0051060445,0.00022245517,0.0006593324,0.002225151,0.0025737637,0.0011141183,0.0010652717,0.0011308802,0.000099742676],"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.00019002923,0.00009296459,0.0049754125,0.00011876164,0.000074534204,0.0007554664,0.0012304608,0.6579755,0.0006008084,0.32177275,0.0028345776,0.009378662],"study_design_scores_gemma":[0.0000612431,0.00008772486,0.0058859335,0.000042080974,0.00005827207,0.000076944234,0.004455234,0.8909428,0.00042894032,0.09227685,0.005592156,0.00009171122],"about_ca_topic_score_codex":0.83392996,"about_ca_topic_score_gemma":0.8047381,"teacher_disagreement_score":0.16607004,"about_ca_system_score_codex":0.035339113,"about_ca_system_score_gemma":0.021989409,"threshold_uncertainty_score":0.33409607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011314845,0.001145651,0.9289768,0.0018114364,0.00018790306,0.00017351263,0.0004136689,0.00021188815,0.05576441],"genre_scores_gemma":[0.5325607,0.0021008484,0.44417432,0.0010000393,0.00036138322,0.0008335783,0.00075642945,0.00010541634,0.018107226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984006,0.00052931457,0.00013589009,0.00032153944,0.00042925007,0.00018324696],"domain_scores_gemma":[0.9990885,0.00034986163,0.00016856006,0.00014962631,0.00016055594,0.000082884144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788674,0.0007042405,0.0005567439,0.0009896618,0.00085242494,0.002708995,0.0015745687,0.0009594726,0.00714585],"category_scores_gemma":[0.0024052293,0.00026848615,0.0010574879,0.0010097336,0.0023870878,0.0041047116,0.0024832508,0.0023620012,0.0009633518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039763822,0.000009040709,0.00008346428,0.000037498834,0.000005860313,0.000059052545,0.00010150024,0.0024646374,0.0002529966,0.99277884,0.0005330582,0.0036700775],"study_design_scores_gemma":[0.000014878984,0.000026536092,0.00021200338,0.0000793715,0.000018460683,0.0002059441,0.00013237626,0.038252115,0.00042349918,0.9254504,0.035168137,0.0000162629],"about_ca_topic_score_codex":0.0018878578,"about_ca_topic_score_gemma":0.0019213458,"teacher_disagreement_score":0.00714585,"about_ca_system_score_codex":0.0014995307,"about_ca_system_score_gemma":0.0011185702,"threshold_uncertainty_score":0.023905277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5839525,0.0010889958,0.3707812,0.0018082015,0.00009148453,0.00015256053,0.00016071323,0.000086833825,0.041877538],"genre_scores_gemma":[0.97907513,0.0003429593,0.016785298,0.00007325775,0.0000525542,0.0000985833,0.000052914736,0.0000095168125,0.0035098942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791676,0.001014422,0.000119985016,0.00032149671,0.00041237715,0.00021496737],"domain_scores_gemma":[0.9906369,0.007070602,0.0008874385,0.00028032553,0.0003819427,0.0007427855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028017664,0.0009156552,0.0016863854,0.0011601852,0.0011921619,0.0036032435,0.0015626997,0.0019744723,0.0034473077],"category_scores_gemma":[0.01072554,0.00043365406,0.000919955,0.0012441925,0.004879051,0.0059000337,0.002017844,0.0019744525,0.00017406186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014970121,0.00006625053,0.0005893813,0.000081870385,0.000043379096,0.00019031041,0.00048135105,0.028081298,0.0010055719,0.96343243,0.00030403337,0.0055744266],"study_design_scores_gemma":[0.000076530596,0.00013746924,0.00031216338,0.000013937922,0.000018013752,0.00013901887,0.0001895719,0.10127579,0.00019774456,0.89707285,0.00054808694,0.00001889855],"about_ca_topic_score_codex":0.0019730623,"about_ca_topic_score_gemma":0.0012049439,"teacher_disagreement_score":0.0036032435,"about_ca_system_score_codex":0.0011840465,"about_ca_system_score_gemma":0.0011412438,"threshold_uncertainty_score":0.014817297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18856514,0.0014238423,0.750813,0.0016125186,0.00011339402,0.00011881324,0.00017832646,0.00009514192,0.057079814],"genre_scores_gemma":[0.95970875,0.00086899416,0.030145457,0.00009879874,0.00006544693,0.00017762755,0.00011203898,0.000025161875,0.008797743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986564,0.00059443887,0.00005661008,0.00021141833,0.0002761062,0.00020496352],"domain_scores_gemma":[0.99671316,0.0021290206,0.0004994444,0.00012919573,0.00035273246,0.00017651287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145555,0.000919417,0.00088658766,0.0010091618,0.0008214086,0.0020690802,0.0012591988,0.0013643528,0.0030442164],"category_scores_gemma":[0.008298958,0.00040054505,0.0010336628,0.0009350753,0.0025256118,0.002654983,0.0018647974,0.0013887786,0.00041071637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005309063,0.000033205717,0.00066753756,0.000065098764,0.000053200463,0.00019545008,0.0002784286,0.25173622,0.0011020291,0.73658884,0.00065837806,0.008568549],"study_design_scores_gemma":[0.00002290548,0.000053311564,0.00035124613,0.000027865664,0.000019600242,0.00012594266,0.000097752265,0.61164004,0.00027958365,0.38581795,0.0015342942,0.000029504288],"about_ca_topic_score_codex":0.00319182,"about_ca_topic_score_gemma":0.0015167175,"teacher_disagreement_score":0.00319182,"about_ca_system_score_codex":0.0019986369,"about_ca_system_score_gemma":0.001332402,"threshold_uncertainty_score":0.014501154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67944247,0.00028456753,0.3111151,0.0011291251,0.00007960397,0.00020682305,0.0001465798,0.00018412141,0.007411621],"genre_scores_gemma":[0.97993577,0.00011854146,0.015694369,0.00010387066,0.000084421285,0.000112589245,0.000047746315,0.000080378086,0.003822212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706,0.0011901018,0.00011283879,0.00036920412,0.00061143754,0.0006564561],"domain_scores_gemma":[0.9007438,0.08194172,0.0056962445,0.0056887283,0.0028786722,0.0030508735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074231997,0.0011087407,0.0025701993,0.0014338386,0.0009781981,0.0020156088,0.0019303132,0.0021665455,0.0070147677],"category_scores_gemma":[0.042599745,0.001358055,0.001480953,0.00073639734,0.0025388012,0.0038485955,0.0023333293,0.0025610975,0.0003920283],"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.0020242103,0.0012733558,0.011732667,0.00027344032,0.0004065696,0.0004920295,0.0011616404,0.7238946,0.013358703,0.21754718,0.0017305635,0.026104981],"study_design_scores_gemma":[0.0002502985,0.00039523613,0.009559416,0.000019225465,0.00017680369,0.00008010137,0.00017832365,0.8391783,0.0011683659,0.14854237,0.00037752773,0.00007398534],"about_ca_topic_score_codex":0.004430662,"about_ca_topic_score_gemma":0.0056015383,"teacher_disagreement_score":0.0074231997,"about_ca_system_score_codex":0.0017230553,"about_ca_system_score_gemma":0.0018229141,"threshold_uncertainty_score":0.039258122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97658575,0.00016725989,0.012612564,0.00080368057,0.000013967379,0.000033571607,0.00022927241,0.000027684227,0.009526302],"genre_scores_gemma":[0.998396,0.000056408608,0.00081924954,0.000009996834,0.0000015955825,0.000009467195,0.000028523695,0.0000024797005,0.0006763332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99935895,0.0003934845,0.000021861531,0.000037249763,0.000056768233,0.00013155153],"domain_scores_gemma":[0.9986375,0.0009237607,0.00017486844,0.000024626102,0.00009430135,0.00014494835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006367787,0.00041464128,0.00042192466,0.0011444424,0.0008967321,0.0016199896,0.00084891473,0.00069323904,0.0022394366],"category_scores_gemma":[0.0019902524,0.00020616381,0.00051795406,0.0011896448,0.0011683294,0.00092455203,0.0008270934,0.0005042547,0.00005895765],"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.00022786985,0.00009900986,0.013330503,0.000041431675,0.00008156338,0.00083048944,0.00022614357,0.932879,0.0010287315,0.046151035,0.0006542674,0.004450066],"study_design_scores_gemma":[0.00002451325,0.000047274414,0.00591317,0.000010130568,0.000040720457,0.000049918403,0.0011056408,0.98114854,0.00028594208,0.010808629,0.00053592486,0.000029694262],"about_ca_topic_score_codex":0.117942125,"about_ca_topic_score_gemma":0.09036188,"teacher_disagreement_score":0.8820579,"about_ca_system_score_codex":0.0044882824,"about_ca_system_score_gemma":0.0016420315,"threshold_uncertainty_score":0.23451126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024540884,0.0004698557,0.82307047,0.0022778504,0.0004472208,0.00020642098,0.00049156003,0.0002147358,0.14828098],"genre_scores_gemma":[0.64989954,0.0008883831,0.29195857,0.0018350583,0.0008191789,0.0009609265,0.0009091044,0.0003028304,0.052426428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970822,0.0008701669,0.0002754116,0.0008455905,0.0005301109,0.0003965511],"domain_scores_gemma":[0.9966388,0.0012280212,0.00022231937,0.00043366797,0.0012468639,0.0002302877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027169706,0.0010385296,0.001249697,0.0021667217,0.0022946454,0.0049460046,0.0025397288,0.002828199,0.02284178],"category_scores_gemma":[0.0058213975,0.000486064,0.0017298565,0.0019793485,0.002887687,0.009016222,0.003229275,0.0035292027,0.0034279146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007508623,0.000010001272,0.000026113488,0.000011735325,0.000004717257,0.000017045983,0.0000778005,0.00024563927,0.00022597134,0.99667454,0.000687228,0.002011759],"study_design_scores_gemma":[0.00001872913,0.00001904527,0.000054867098,0.0000122471165,0.000011716477,0.000072379626,0.00008188508,0.0052729556,0.00025941306,0.98689806,0.0072873947,0.000011302247],"about_ca_topic_score_codex":0.0007182891,"about_ca_topic_score_gemma":0.00073486444,"teacher_disagreement_score":0.02284178,"about_ca_system_score_codex":0.0011972568,"about_ca_system_score_gemma":0.0009584534,"threshold_uncertainty_score":0.07641339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041715175,0.0010134679,0.8642526,0.003814974,0.0007707797,0.00007052256,0.00028960858,0.0003844092,0.08768844],"genre_scores_gemma":[0.9380882,0.00073706295,0.023497077,0.00026828513,0.0003980258,0.000110643465,0.00015934117,0.00007064601,0.03667081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924904,0.00023031025,0.000028494236,0.00017208085,0.00024340022,0.00007667281],"domain_scores_gemma":[0.99890363,0.00049700117,0.00014754516,0.0001510526,0.00022972445,0.00007103242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082469,0.0005497364,0.00091637875,0.00044371348,0.0004840375,0.0014721805,0.0005524942,0.0008227281,0.0068264375],"category_scores_gemma":[0.0037813007,0.00028030985,0.00047943543,0.00058834575,0.0012543525,0.0009505384,0.0010142674,0.0011343446,0.0006325235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007709647,0.000065731314,0.000352493,0.00006540116,0.000043219905,0.00004766629,0.000040702565,0.17697775,0.0019904946,0.7797121,0.0075748623,0.03305252],"study_design_scores_gemma":[0.000038334365,0.00004934436,0.00037097355,0.000013380447,0.000017194916,0.00003356698,0.000015462509,0.6155424,0.0005286446,0.37571248,0.007664147,0.000014100758],"about_ca_topic_score_codex":0.0017743829,"about_ca_topic_score_gemma":0.001380713,"teacher_disagreement_score":0.0068264375,"about_ca_system_score_codex":0.0013239603,"about_ca_system_score_gemma":0.0014628127,"threshold_uncertainty_score":0.022836685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023677172,0.0004611942,0.9755762,0.0006047449,0.00010544408,0.000118000135,0.0002197023,0.0019181619,0.018628867],"genre_scores_gemma":[0.123893104,0.0009358238,0.84506637,0.0005589389,0.00025663196,0.0007859669,0.00092895783,0.0011217293,0.026452526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897397,0.0003871119,0.00006979616,0.00012843062,0.0003195533,0.00012122227],"domain_scores_gemma":[0.9978314,0.0015853902,0.0000786164,0.00023379757,0.00022340055,0.00004736668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012197904,0.0012230043,0.000712952,0.00073676265,0.0005970092,0.0017941975,0.0015488452,0.0010573681,0.032587826],"category_scores_gemma":[0.0060032317,0.0006347008,0.0008473481,0.00096749695,0.000921899,0.002230687,0.0025814564,0.0025456836,0.007437654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013501832,0.00017917856,0.00043648176,0.00089593383,0.00011774744,0.00015612008,0.00022957721,0.16126621,0.0030941493,0.5254755,0.042058874,0.26595524],"study_design_scores_gemma":[0.0001264066,0.000021565542,0.000059173974,0.000049098184,0.000016574297,0.000056012985,0.00004965742,0.7279698,0.0022073041,0.24323535,0.026195029,0.000014002993],"about_ca_topic_score_codex":0.002188416,"about_ca_topic_score_gemma":0.0054838057,"teacher_disagreement_score":0.032587826,"about_ca_system_score_codex":0.0011093572,"about_ca_system_score_gemma":0.0013961908,"threshold_uncertainty_score":0.10901713},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2119624,0.0012785487,0.7282837,0.010094505,0.00020430595,0.00022712711,0.0004056233,0.00022579328,0.047317993],"genre_scores_gemma":[0.9768787,0.00042755387,0.016620927,0.00021570556,0.00014109451,0.00012833529,0.000044270735,0.00003800754,0.0055053616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354124,0.0029166546,0.00031605456,0.0015468956,0.0007779303,0.0009012741],"domain_scores_gemma":[0.85778993,0.1173488,0.012584277,0.006275449,0.003778606,0.0022229576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018634642,0.00093533815,0.003069389,0.0016331731,0.0016397029,0.006539014,0.0034195436,0.008172226,0.0124502],"category_scores_gemma":[0.124077946,0.0013154869,0.0014977034,0.0013925047,0.006724515,0.015981857,0.0038318953,0.0056809816,0.0007066877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036898634,0.00010737694,0.0013163754,0.00011905679,0.00010566091,0.0002576871,0.0005024853,0.05320096,0.0008796738,0.9316216,0.0015965365,0.009923643],"study_design_scores_gemma":[0.00016382047,0.000074167074,0.00059312274,0.000045856446,0.00005630572,0.00016253539,0.00024299878,0.14411244,0.00029522748,0.8531322,0.0010588864,0.00006257883],"about_ca_topic_score_codex":0.0021682747,"about_ca_topic_score_gemma":0.0014482974,"teacher_disagreement_score":0.018634642,"about_ca_system_score_codex":0.0027184116,"about_ca_system_score_gemma":0.0025954822,"threshold_uncertainty_score":0.09855062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58049977,0.004473126,0.18919061,0.015331796,0.0006556725,0.00017759476,0.00075358385,0.00020282964,0.20871492],"genre_scores_gemma":[0.98465884,0.0010352643,0.0034548326,0.00032210795,0.00023510162,0.00004845003,0.00007132533,0.000024895593,0.010149221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982791,0.00067193527,0.00007095991,0.00023250381,0.00040594072,0.0003396332],"domain_scores_gemma":[0.98070234,0.014469304,0.0019841671,0.0009421405,0.0010519818,0.0008500603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027571123,0.00057813,0.0013060028,0.0016931196,0.0010879065,0.0034939891,0.0008402946,0.0022589667,0.007881862],"category_scores_gemma":[0.016978448,0.00046389565,0.0006658559,0.0016533753,0.0033319204,0.004955864,0.002634825,0.0015098541,0.00039513933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115981085,0.000081998245,0.002183366,0.000160843,0.000060681916,0.00024595665,0.00030276243,0.10803838,0.00063780294,0.8712685,0.003585181,0.01331855],"study_design_scores_gemma":[0.000022954078,0.00003415923,0.0018834933,0.000048602782,0.000028588673,0.000081285194,0.0003477329,0.05363515,0.0003526056,0.9396296,0.0039053413,0.000030409563],"about_ca_topic_score_codex":0.002079187,"about_ca_topic_score_gemma":0.00143866,"teacher_disagreement_score":0.007881862,"about_ca_system_score_codex":0.0018993655,"about_ca_system_score_gemma":0.0008321112,"threshold_uncertainty_score":0.026367426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50034773,0.0004884172,0.46038088,0.00325552,0.000044303873,0.0001238748,0.00014685685,0.00011938,0.035093155],"genre_scores_gemma":[0.9683271,0.00035207017,0.024332538,0.00017461544,0.000051407056,0.000089298555,0.00005515014,0.00003046348,0.0065874145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852103,0.0008290635,0.000047410675,0.00019545744,0.00014835199,0.0002587349],"domain_scores_gemma":[0.9937298,0.00433625,0.00068231276,0.00030402764,0.00033548998,0.0006120384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028705988,0.0005075316,0.0016996242,0.0009848609,0.0010257981,0.0024283552,0.0015361147,0.0028449246,0.004938902],"category_scores_gemma":[0.014945204,0.00062744453,0.00096691184,0.0008771586,0.0025080803,0.0044797594,0.0019960077,0.001488841,0.0004404137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017556979,0.00013515534,0.0030476928,0.00016088434,0.000092592396,0.0003581569,0.0007733544,0.11168879,0.0025081967,0.86136067,0.0025063877,0.017192584],"study_design_scores_gemma":[0.00007337543,0.000055933255,0.0015224984,0.000021522586,0.000032628504,0.00029855274,0.00026144797,0.31818607,0.00026258576,0.67797476,0.0012791553,0.00003149581],"about_ca_topic_score_codex":0.0029069162,"about_ca_topic_score_gemma":0.0031810785,"teacher_disagreement_score":0.004938902,"about_ca_system_score_codex":0.0015024322,"about_ca_system_score_gemma":0.0012233101,"threshold_uncertainty_score":0.016522288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053033687,0.0008440416,0.7847476,0.003463553,0.00022465097,0.00019251477,0.000088165914,0.00012302698,0.15728284],"genre_scores_gemma":[0.9129462,0.0005643036,0.06960098,0.00047738745,0.00006535311,0.0003960131,0.00005007481,0.00006562872,0.015834114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382824,0.004563176,0.000084219864,0.00042589265,0.0006422456,0.0004562001],"domain_scores_gemma":[0.99405503,0.004521002,0.00040498126,0.0005763178,0.00027953874,0.00016301713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047373134,0.0006531249,0.00089491747,0.0014249635,0.0013392142,0.0032551836,0.0016587419,0.002341364,0.011301721],"category_scores_gemma":[0.00868512,0.00033630646,0.0014813181,0.0012064805,0.006045745,0.0037088206,0.0037863136,0.0025603217,0.0007587803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004392438,0.000033521046,0.00028421893,0.000051387196,0.00002390385,0.00015003244,0.00046550194,0.025013901,0.00024504287,0.96596575,0.0005105262,0.0072123418],"study_design_scores_gemma":[0.000025875659,0.000046857138,0.00019130559,0.000041222127,0.000016833454,0.00011157032,0.00054573617,0.10961466,0.0002661558,0.8812971,0.007821366,0.000021296859],"about_ca_topic_score_codex":0.002056654,"about_ca_topic_score_gemma":0.0018120548,"teacher_disagreement_score":0.011301721,"about_ca_system_score_codex":0.0026267697,"about_ca_system_score_gemma":0.001836838,"threshold_uncertainty_score":0.03780806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012533058,0.00021312325,0.9833855,0.00026275704,0.000052796797,0.000036044756,0.00006288614,0.000060319067,0.0033936389],"genre_scores_gemma":[0.63864934,0.0007336174,0.35182625,0.00016119218,0.000290889,0.0003044789,0.00025199287,0.00007395063,0.0077082063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984042,0.00092347275,0.00007431151,0.00018819996,0.00030981205,0.00010005305],"domain_scores_gemma":[0.9963934,0.0023817697,0.00029154235,0.00027724003,0.0005071866,0.00014890483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026289918,0.0006198998,0.0009949603,0.0013353085,0.00059282355,0.0017132529,0.0012578634,0.0008217793,0.0040645073],"category_scores_gemma":[0.008646577,0.0003080736,0.0008359676,0.0018006568,0.0012788903,0.0028729993,0.0014292384,0.0014593737,0.00061020255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013431809,0.000114696006,0.00031597613,0.00012058892,0.0000459718,0.000058725862,0.00027532555,0.11766245,0.0017859037,0.81017053,0.0019833292,0.067332186],"study_design_scores_gemma":[0.000014739879,0.000041979794,0.00007768374,0.000016912492,0.000013159184,0.000022941227,0.000036597903,0.5494039,0.00036582988,0.4484232,0.001568862,0.000014100278],"about_ca_topic_score_codex":0.0024144768,"about_ca_topic_score_gemma":0.0014013421,"teacher_disagreement_score":0.0040645073,"about_ca_system_score_codex":0.00085754594,"about_ca_system_score_gemma":0.0011056004,"threshold_uncertainty_score":0.013903618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13998243,0.002977979,0.7553162,0.003508296,0.0002032982,0.0002201503,0.00030216877,0.00019554356,0.09729391],"genre_scores_gemma":[0.9054618,0.004116908,0.071295135,0.0006756286,0.00032337566,0.0007464785,0.00024525015,0.000120114426,0.017015314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748284,0.0015223762,0.000102213104,0.00022249727,0.00042709737,0.00024294706],"domain_scores_gemma":[0.97723,0.01894546,0.0011976976,0.0006337056,0.0013804202,0.0006127105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004298249,0.0011441349,0.002318362,0.0015362398,0.0010385509,0.0032949036,0.0018620702,0.0017679866,0.005364133],"category_scores_gemma":[0.025607187,0.0010240215,0.0011622466,0.001514234,0.0041601215,0.007481576,0.001979469,0.003785961,0.00070732174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041872518,0.00008031947,0.0006136655,0.0001762761,0.000039565162,0.00014799566,0.0003637897,0.021606835,0.0005259306,0.95980716,0.0018755842,0.014720963],"study_design_scores_gemma":[0.000013187957,0.000023788883,0.00030254008,0.000030432742,0.000011381205,0.000083775056,0.00007790596,0.059932936,0.00012807154,0.9382184,0.001167455,0.000010030362],"about_ca_topic_score_codex":0.0018689301,"about_ca_topic_score_gemma":0.0012504756,"teacher_disagreement_score":0.005364133,"about_ca_system_score_codex":0.001351178,"about_ca_system_score_gemma":0.001597031,"threshold_uncertainty_score":0.022731602},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033801246,0.004688228,0.57220894,0.020300776,0.0006489169,0.00016550875,0.00054784486,0.00015974973,0.3674789],"genre_scores_gemma":[0.8960374,0.004012416,0.056926277,0.0020869235,0.0016379965,0.00044995404,0.00019481049,0.000110718014,0.038543478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946325,0.0026060857,0.00022138422,0.0007593543,0.0012754127,0.0005052947],"domain_scores_gemma":[0.98649395,0.009323898,0.0011763036,0.0014131106,0.0010946317,0.00049808424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058481335,0.0007433288,0.0009440923,0.0015721194,0.0020354379,0.0054381066,0.0019853313,0.0052933316,0.015145629],"category_scores_gemma":[0.022642778,0.0005998779,0.0010334271,0.001720914,0.0076856436,0.008878289,0.0027138623,0.0044511193,0.0015163659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035555895,0.0000034415777,0.000035175606,0.000013764867,0.0000038970634,0.000020767746,0.000058648402,0.0012910342,0.000035599987,0.996582,0.00056680397,0.0013853312],"study_design_scores_gemma":[0.000007672728,0.00000652459,0.000046741854,0.000017833674,0.0000033685346,0.00003075731,0.000019959685,0.0055204914,0.000025547433,0.99161583,0.0027008674,0.0000044481367],"about_ca_topic_score_codex":0.0021332612,"about_ca_topic_score_gemma":0.0008671056,"teacher_disagreement_score":0.015145629,"about_ca_system_score_codex":0.0032997052,"about_ca_system_score_gemma":0.0021720435,"threshold_uncertainty_score":0.050667167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6245763,0.004405543,0.31678513,0.011134466,0.00032301323,0.00035027912,0.0014501134,0.0007364287,0.0402388],"genre_scores_gemma":[0.9592269,0.001908267,0.029648691,0.00056847563,0.000443532,0.00020585231,0.00037288154,0.00044610887,0.0071792356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964038,0.0016264819,0.0001580626,0.0005167275,0.0005407053,0.0007542104],"domain_scores_gemma":[0.7872818,0.1897234,0.0077259196,0.004332662,0.0037173626,0.0072188694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010571835,0.0017994976,0.0045789275,0.0037892647,0.001773102,0.005750912,0.004547195,0.0041477364,0.017848663],"category_scores_gemma":[0.09436822,0.0016237035,0.0015907957,0.0031852378,0.0065275324,0.020397117,0.0045400932,0.0043430664,0.0007702381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023145452,0.00035975556,0.003778251,0.0008254622,0.00020292238,0.00025982177,0.0013456444,0.23395544,0.0051342645,0.7078782,0.0080775935,0.035868205],"study_design_scores_gemma":[0.00028384826,0.00042721754,0.0014067687,0.00013155669,0.00013034632,0.00028538186,0.0005342007,0.37928152,0.0010830314,0.6144619,0.0018794435,0.00009476695],"about_ca_topic_score_codex":0.0020237523,"about_ca_topic_score_gemma":0.0019453837,"teacher_disagreement_score":0.017848663,"about_ca_system_score_codex":0.0037289187,"about_ca_system_score_gemma":0.0018775058,"threshold_uncertainty_score":0.059709728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53004426,0.00092053245,0.4183411,0.0030557036,0.00018621441,0.00011804612,0.00017975773,0.0001719457,0.046982408],"genre_scores_gemma":[0.9879946,0.0002419459,0.0072056847,0.00014957447,0.000032997425,0.000058814727,0.000021616435,0.000012306118,0.004282441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995895,0.00019344622,0.000016654547,0.000077327335,0.000046420802,0.0000766207],"domain_scores_gemma":[0.9990773,0.00041997683,0.00017444514,0.00005601504,0.000085071304,0.00018720678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086187903,0.0006059244,0.0009478186,0.0007604615,0.0013246981,0.0016907105,0.0021220492,0.0026306317,0.0045573637],"category_scores_gemma":[0.0026510844,0.00039799238,0.0009691368,0.00038893218,0.0019428548,0.0028174128,0.0016135505,0.0010985767,0.0003286748],"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.00014471912,0.00010482243,0.0028147027,0.00013011193,0.00013390687,0.0010015169,0.0005088408,0.5582379,0.005533458,0.42232385,0.0018189682,0.007247144],"study_design_scores_gemma":[0.00006752395,0.00009098645,0.00063852826,0.00001322788,0.000048737496,0.00018992052,0.00010707183,0.9153311,0.000105977815,0.08249811,0.0008781853,0.000030639752],"about_ca_topic_score_codex":0.0040796353,"about_ca_topic_score_gemma":0.0023697342,"teacher_disagreement_score":0.0045573637,"about_ca_system_score_codex":0.0011128247,"about_ca_system_score_gemma":0.0008068887,"threshold_uncertainty_score":0.015245914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31434762,0.0012299033,0.45362988,0.0064989664,0.0007591391,0.00021143992,0.00043072083,0.00012457813,0.2227678],"genre_scores_gemma":[0.9585726,0.0008655171,0.019756263,0.00035798762,0.00027117558,0.00019138648,0.00010534417,0.00004624544,0.019833438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820185,0.0010154305,0.00006195817,0.00017450702,0.00028317614,0.00026298207],"domain_scores_gemma":[0.9938751,0.0046348628,0.0003274966,0.00021074672,0.0004031371,0.00054858887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018540871,0.0011837059,0.0016473307,0.0013925398,0.0013126595,0.004233913,0.0017521523,0.0028259554,0.009069224],"category_scores_gemma":[0.010346549,0.00038544025,0.0008197165,0.0010800569,0.004143685,0.004826056,0.0025820287,0.0026971085,0.00047007485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010843418,0.000028408887,0.00018298869,0.000047644404,0.0000181098,0.00010115142,0.00008398377,0.04654105,0.00037011402,0.9475639,0.0015018057,0.0034525427],"study_design_scores_gemma":[0.000053365024,0.00006498683,0.00018520585,0.00004312775,0.000018390576,0.00005784151,0.00013345576,0.26402092,0.00014536889,0.7331055,0.0021325063,0.00003925531],"about_ca_topic_score_codex":0.0065676956,"about_ca_topic_score_gemma":0.0035704428,"teacher_disagreement_score":0.009069224,"about_ca_system_score_codex":0.002820128,"about_ca_system_score_gemma":0.0020140288,"threshold_uncertainty_score":0.030339599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12467925,0.00020034968,0.8314261,0.00091710064,0.00008128478,0.00036785073,0.00016945388,0.00018907842,0.04196944],"genre_scores_gemma":[0.8845838,0.0002586132,0.09916575,0.00024243013,0.000037661583,0.0004442063,0.00009970113,0.000030957603,0.015136913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990158,0.0004223252,0.000024598245,0.000204719,0.0001943299,0.00013806506],"domain_scores_gemma":[0.9989261,0.0005322643,0.00016463299,0.000091472815,0.00011318557,0.00017233919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010026156,0.0007732721,0.00052844716,0.0005114134,0.0007077418,0.0013425478,0.0012068718,0.0014182127,0.0045747873],"category_scores_gemma":[0.0035232191,0.0003928145,0.0004725235,0.0005140839,0.0018361309,0.0032833512,0.0021304435,0.0010825776,0.00039159541],"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.0002546913,0.00011323083,0.0008600575,0.00009447645,0.000051806554,0.00059064565,0.00031728615,0.4728354,0.009172261,0.49990848,0.0025696636,0.01323205],"study_design_scores_gemma":[0.000074622025,0.000150176,0.00025824946,0.000018625498,0.00001617142,0.00019346217,0.00009402104,0.89218605,0.0017755786,0.09973715,0.0054664398,0.000029311439],"about_ca_topic_score_codex":0.0020986442,"about_ca_topic_score_gemma":0.0022345101,"teacher_disagreement_score":0.0045747873,"about_ca_system_score_codex":0.0011811064,"about_ca_system_score_gemma":0.00077192485,"threshold_uncertainty_score":0.015304148},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3297932,0.00026675832,0.6608169,0.000692537,0.000042759224,0.00021486738,0.00059039256,0.00062826823,0.0069541926],"genre_scores_gemma":[0.8774704,0.0002916956,0.11788059,0.00007493228,0.00003395872,0.0001876682,0.00045485474,0.000049707687,0.0035561344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982254,0.0007743903,0.00008620089,0.00033502028,0.00025577605,0.00032337438],"domain_scores_gemma":[0.99301964,0.0053447243,0.0006023378,0.0006086614,0.00021447359,0.00021015767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013848565,0.001079563,0.0011468792,0.0006087941,0.0005647205,0.0019051488,0.0020643687,0.0009374388,0.004275725],"category_scores_gemma":[0.009901569,0.0005361959,0.00089691626,0.0010048959,0.0014203022,0.0046943445,0.0014387408,0.0018181257,0.0003490542],"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.0005403546,0.00017893984,0.0010861026,0.00020979221,0.00008062574,0.00021631329,0.00017967119,0.7235287,0.0029661544,0.2350382,0.0013853804,0.034589753],"study_design_scores_gemma":[0.00003779658,0.00005323365,0.00012984246,0.000008694084,0.000016801956,0.00003994727,0.00004031045,0.88355005,0.0010784591,0.1144495,0.00058427075,0.000011093252],"about_ca_topic_score_codex":0.0029365832,"about_ca_topic_score_gemma":0.0026827024,"teacher_disagreement_score":0.004275725,"about_ca_system_score_codex":0.001960867,"about_ca_system_score_gemma":0.00091650797,"threshold_uncertainty_score":0.014303744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07241533,0.00040517029,0.89741457,0.0005058859,0.000048735536,0.00017810489,0.00016025979,0.000072757764,0.02879914],"genre_scores_gemma":[0.8382853,0.0007266009,0.15070951,0.00016441307,0.000044199005,0.0005424408,0.00014166888,0.00006173034,0.009324229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982358,0.0010185315,0.000055668323,0.00013669868,0.00023732446,0.0003159753],"domain_scores_gemma":[0.997769,0.0016336907,0.00021073893,0.000063247724,0.00019858562,0.00012463274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030363032,0.0018009937,0.0015604835,0.001530203,0.0009257871,0.0023873728,0.001418951,0.0017405852,0.002836778],"category_scores_gemma":[0.0060735284,0.0008703152,0.0008806213,0.0014278969,0.0022800332,0.0016130566,0.0019867935,0.0012952387,0.0005303088],"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.0001190532,0.00006960211,0.00026560194,0.00008640431,0.000051238727,0.00009198226,0.00016560598,0.79159045,0.0007042887,0.19576982,0.0013000775,0.009785883],"study_design_scores_gemma":[0.000041972526,0.000039117735,0.00009070458,0.000020367166,0.00001125463,0.000020137753,0.000070989554,0.9099329,0.0003071597,0.08882339,0.00062818,0.0000138166315],"about_ca_topic_score_codex":0.0037587013,"about_ca_topic_score_gemma":0.0032342658,"teacher_disagreement_score":0.0037587013,"about_ca_system_score_codex":0.0021519144,"about_ca_system_score_gemma":0.0027082004,"threshold_uncertainty_score":0.01605773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005886857,0.0001199417,0.9867474,0.0003914339,0.00003389602,0.00014706851,0.00007661992,0.00010992895,0.006486916],"genre_scores_gemma":[0.24580465,0.00065773237,0.7477259,0.00021417155,0.00007588129,0.00080468174,0.00032891743,0.00008225187,0.00430582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952076,0.0032430051,0.00021176029,0.0003816339,0.00074158155,0.00021434903],"domain_scores_gemma":[0.99266887,0.005867989,0.00045913667,0.00050468923,0.0003312252,0.00016806947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037938084,0.0010792727,0.0010991661,0.0023292769,0.001559549,0.0037061048,0.0025563682,0.0022212784,0.005098338],"category_scores_gemma":[0.010421849,0.0006040161,0.0023745357,0.0026530104,0.0038036108,0.0051712403,0.0026688208,0.0020894452,0.0006910915],"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.00004899762,0.000048273043,0.00033586455,0.00009839533,0.00004031049,0.00029071522,0.0005735713,0.25038376,0.00070707256,0.7320244,0.0011895265,0.014259195],"study_design_scores_gemma":[0.000039394756,0.00003267074,0.000066734545,0.00004074234,0.000020718795,0.00011870913,0.0001849749,0.5275434,0.0002997325,0.46525759,0.006363339,0.000031949738],"about_ca_topic_score_codex":0.0056739314,"about_ca_topic_score_gemma":0.0053002,"teacher_disagreement_score":0.0056739314,"about_ca_system_score_codex":0.002566802,"about_ca_system_score_gemma":0.0026385805,"threshold_uncertainty_score":0.020063818},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102391355,0.00040726815,0.87459666,0.00064729096,0.00005209143,0.00027202646,0.0005004482,0.00016881326,0.020964028],"genre_scores_gemma":[0.89282614,0.0005282169,0.09973341,0.000064667,0.00002314027,0.00040790744,0.0003411088,0.000028269355,0.006047152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923754,0.00039096174,0.000031395954,0.0001227717,0.0001199389,0.00009740256],"domain_scores_gemma":[0.99938893,0.0003173904,0.00008706164,0.000035077628,0.00011913428,0.000052345473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010466479,0.00072613836,0.00059967133,0.0011965466,0.00085412624,0.0011424882,0.0019780952,0.00084756414,0.0044766986],"category_scores_gemma":[0.0016781898,0.00029022034,0.0009885945,0.001775476,0.0010194455,0.0017907133,0.0010343815,0.0007539148,0.00030181732],"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.00003448353,0.000032391777,0.0010538313,0.00006713685,0.00003356956,0.00017282246,0.00020933489,0.8395013,0.00061075244,0.14671853,0.0008171313,0.01074871],"study_design_scores_gemma":[0.0000119047345,0.000016163947,0.00026560164,0.0000059301424,0.00001197772,0.000014024557,0.00006669642,0.96164024,0.00006856872,0.037088893,0.00080040813,0.000009712571],"about_ca_topic_score_codex":0.04196304,"about_ca_topic_score_gemma":0.03286003,"teacher_disagreement_score":0.04196304,"about_ca_system_score_codex":0.003436059,"about_ca_system_score_gemma":0.0026828733,"threshold_uncertainty_score":0.08343756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012970442,0.000136766,0.9829107,0.00018733762,0.000014083429,0.00006493879,0.00006821667,0.00010194922,0.0035455867],"genre_scores_gemma":[0.6774781,0.0004688378,0.31512,0.0001453548,0.00008711824,0.00064728037,0.000322552,0.000101153906,0.0056296624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99565256,0.0022499168,0.00017821339,0.00069166266,0.0008974743,0.00033026346],"domain_scores_gemma":[0.9860363,0.01041486,0.0016779384,0.0010073953,0.0006049548,0.00025846384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049013156,0.001371597,0.002734334,0.002467172,0.0010560533,0.0035761455,0.003206015,0.0024747516,0.005516913],"category_scores_gemma":[0.021617875,0.001234264,0.0030521702,0.0015321275,0.0028434477,0.004978786,0.0058313683,0.0032848248,0.00069795427],"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.000053574273,0.0000595266,0.000803513,0.000111976784,0.00009580084,0.00030475596,0.00019669086,0.50435144,0.00057663943,0.48091298,0.00041931274,0.012113855],"study_design_scores_gemma":[0.000008137212,0.000019125047,0.00007103426,0.000018397133,0.000011033928,0.000048556692,0.00002877627,0.71848094,0.0002749518,0.28049126,0.00053240446,0.00001547456],"about_ca_topic_score_codex":0.001592895,"about_ca_topic_score_gemma":0.0014453008,"teacher_disagreement_score":0.005516913,"about_ca_system_score_codex":0.0020556462,"about_ca_system_score_gemma":0.0017010123,"threshold_uncertainty_score":0.025920987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15458938,0.0010732748,0.8113392,0.0016173287,0.00012793696,0.00015652427,0.00009472334,0.00016248808,0.030839162],"genre_scores_gemma":[0.9471316,0.0007093717,0.0470359,0.00012095617,0.00010809155,0.00021152363,0.000081996004,0.00007432773,0.0045262724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767846,0.0011481636,0.000098817305,0.00029339592,0.0005848222,0.00019635196],"domain_scores_gemma":[0.987081,0.009035268,0.0009317674,0.0005035768,0.0019709899,0.00047741033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036413958,0.0007877215,0.00067085953,0.0016012173,0.0010370575,0.0017600718,0.0014328975,0.00089209265,0.0028090444],"category_scores_gemma":[0.017389683,0.00039183607,0.0007221489,0.0013421713,0.002731394,0.0030725624,0.0023728814,0.0026932405,0.00032298663],"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.00028489085,0.000068182686,0.0012933218,0.00010529578,0.00005112012,0.00013753054,0.0004329364,0.2886017,0.003890546,0.6890232,0.0012477257,0.014863545],"study_design_scores_gemma":[0.00001457243,0.00007039281,0.00023188205,0.000023034438,0.000007490335,0.000044948527,0.0000708289,0.74649817,0.0012873008,0.25046283,0.0012760223,0.000012561703],"about_ca_topic_score_codex":0.002024625,"about_ca_topic_score_gemma":0.00075082254,"teacher_disagreement_score":0.0036413958,"about_ca_system_score_codex":0.0026432767,"about_ca_system_score_gemma":0.00096412224,"threshold_uncertainty_score":0.019257784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010082382,0.00036600025,0.9868405,0.0005028339,0.000082854895,0.000052675667,0.0000799731,0.00008165846,0.010985245],"genre_scores_gemma":[0.2175355,0.002862042,0.7572546,0.00089970493,0.00047401537,0.0010185459,0.0005507948,0.00029735264,0.01910748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970018,0.0018416181,0.00011657152,0.0003901629,0.0005070547,0.0001428049],"domain_scores_gemma":[0.99797565,0.0012309703,0.00017478388,0.00026941125,0.00024468044,0.00010446203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024364197,0.0015795106,0.0011798015,0.0024364346,0.0011136312,0.0030385703,0.0031849307,0.002308412,0.0086189695],"category_scores_gemma":[0.004605568,0.00060332596,0.0024907498,0.0025334696,0.003665439,0.0045821997,0.0027343363,0.0042872736,0.0019112861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008608192,0.000016172102,0.00006836851,0.00005664857,0.000024775958,0.000061564904,0.00013227492,0.06811843,0.00022972401,0.9234368,0.0010125707,0.0068341126],"study_design_scores_gemma":[0.000011712685,0.000018135113,0.000031394247,0.000023540266,0.0000129406235,0.000049441405,0.000049460694,0.19709244,0.0001201813,0.7883022,0.014272168,0.000016449903],"about_ca_topic_score_codex":0.005192318,"about_ca_topic_score_gemma":0.003918293,"teacher_disagreement_score":0.0086189695,"about_ca_system_score_codex":0.0028128081,"about_ca_system_score_gemma":0.0022581674,"threshold_uncertainty_score":0.02883339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31742448,0.0004111483,0.5791288,0.0017969132,0.00007671974,0.00017433953,0.00013539818,0.000110005014,0.10074229],"genre_scores_gemma":[0.9753067,0.00011366594,0.019928789,0.00008228639,0.000027624987,0.00008048631,0.000027248052,0.000010734978,0.004422374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968579,0.0018103316,0.00013463052,0.00035207986,0.0006045068,0.0002406014],"domain_scores_gemma":[0.9962645,0.0019168531,0.00071442453,0.00037523685,0.000590617,0.00013836219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032820515,0.0004128485,0.00050437415,0.0007612605,0.0005562246,0.0027914643,0.0006690389,0.0008693124,0.0047491016],"category_scores_gemma":[0.007967952,0.00021117643,0.0005565815,0.0005335621,0.0033231273,0.0028651198,0.0010802246,0.0009220549,0.00030603033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015884849,0.000012659192,0.00029102067,0.000022390013,0.000012388582,0.000042685555,0.00027371576,0.004361422,0.00040836268,0.99201304,0.0001604853,0.0023859907],"study_design_scores_gemma":[0.000029120503,0.000035046694,0.0005847874,0.000024340281,0.000009968351,0.00005953848,0.00031217572,0.047464047,0.0005486645,0.9481968,0.0027160111,0.00001953975],"about_ca_topic_score_codex":0.0019473141,"about_ca_topic_score_gemma":0.0012324443,"teacher_disagreement_score":0.0047491016,"about_ca_system_score_codex":0.0019471584,"about_ca_system_score_gemma":0.000657606,"threshold_uncertainty_score":0.01735735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29937857,0.0024309484,0.4280676,0.013573074,0.00028929894,0.00029026813,0.0011059332,0.00015911281,0.25470522],"genre_scores_gemma":[0.9481449,0.0009054135,0.018191472,0.00053831976,0.00015667769,0.00012690168,0.00011741098,0.000017742745,0.031801097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987381,0.0006041647,0.00004551255,0.00017504892,0.00022640616,0.0002107154],"domain_scores_gemma":[0.9985253,0.00096289587,0.0001329629,0.000107155945,0.00011957975,0.00015203301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015642392,0.0005609035,0.0010930264,0.00086842896,0.00063914753,0.0023003903,0.0015063687,0.0027032709,0.0068155155],"category_scores_gemma":[0.0055744564,0.00036188992,0.00054185715,0.0008061577,0.0021051744,0.0029013006,0.0013140116,0.0015073201,0.00054533145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056137837,0.00002099639,0.00017516135,0.00003731958,0.000017327846,0.000097806354,0.00007372011,0.014257971,0.0008242533,0.97662467,0.0019172068,0.0058975504],"study_design_scores_gemma":[0.00007595768,0.00003262531,0.0003887396,0.000016277543,0.00002577915,0.00017101191,0.00004916297,0.119227834,0.00042449654,0.8744412,0.005111236,0.000035601603],"about_ca_topic_score_codex":0.0035620048,"about_ca_topic_score_gemma":0.0020475374,"teacher_disagreement_score":0.0068155155,"about_ca_system_score_codex":0.002870012,"about_ca_system_score_gemma":0.0013671474,"threshold_uncertainty_score":0.022800207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5070256,0.00050616823,0.4399496,0.0018934129,0.00006524352,0.0001123873,0.00015099125,0.000096018535,0.050200675],"genre_scores_gemma":[0.97350967,0.00010502222,0.023187868,0.00006594594,0.000023412716,0.000064743916,0.000029351399,0.000013832209,0.0030001737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936085,0.003916121,0.0003017301,0.00043200032,0.0010326656,0.0007090588],"domain_scores_gemma":[0.98229516,0.013780715,0.000972857,0.0011291972,0.00086891046,0.0009532017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004817793,0.0005910649,0.0010710974,0.0011959677,0.0009464348,0.005401029,0.0010698355,0.0017564435,0.0078171315],"category_scores_gemma":[0.019211335,0.0007378918,0.0010580407,0.0017320771,0.0026152025,0.0071548717,0.0021473558,0.0026025786,0.0005418618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037658834,0.00012770601,0.003496011,0.00014535231,0.00012664706,0.00025142764,0.0011432115,0.028445832,0.0017117048,0.9408562,0.0006342867,0.022685023],"study_design_scores_gemma":[0.000052661737,0.000096370124,0.0017702568,0.000021312682,0.000052777425,0.00008439328,0.0006104166,0.071511865,0.00042762313,0.92460567,0.0007219548,0.000044669232],"about_ca_topic_score_codex":0.0013944482,"about_ca_topic_score_gemma":0.0022971423,"teacher_disagreement_score":0.0078171315,"about_ca_system_score_codex":0.0014619867,"about_ca_system_score_gemma":0.0007680711,"threshold_uncertainty_score":0.026150882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020875145,0.017416222,0.17989618,0.13881524,0.0046225456,0.00005105188,0.0006251188,0.00027797025,0.6374206],"genre_scores_gemma":[0.79046804,0.008548157,0.03871278,0.035215434,0.008270692,0.00025006666,0.00025849644,0.00033648734,0.11793992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980464,0.00075144926,0.00007479135,0.00048036076,0.00046250524,0.0001845185],"domain_scores_gemma":[0.9955531,0.0031468347,0.00017996524,0.0005253482,0.00048776047,0.000106996245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003482357,0.0005438365,0.0013536898,0.0015491365,0.0026353037,0.005233303,0.0018108495,0.0037419028,0.019420264],"category_scores_gemma":[0.011289117,0.00041776238,0.0010009763,0.0014464856,0.009340646,0.011127389,0.0020655096,0.0072923005,0.0027511637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050937283,0.0000032715404,0.000040906292,0.000016731916,0.0000056672893,0.000014840349,0.000053720436,0.00009117731,0.000016254462,0.99351466,0.004144319,0.0020932928],"study_design_scores_gemma":[0.000004385319,0.0000020225855,0.00004897155,0.0000133003705,0.0000025401735,0.000025073767,0.000023541668,0.0003277334,0.00002042815,0.9921704,0.007358698,0.0000028632235],"about_ca_topic_score_codex":0.0023284766,"about_ca_topic_score_gemma":0.0016258477,"teacher_disagreement_score":0.019420264,"about_ca_system_score_codex":0.0026098038,"about_ca_system_score_gemma":0.0011601665,"threshold_uncertainty_score":0.064967275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33892348,0.00058838143,0.630268,0.0024355554,0.00018122698,0.000115167415,0.00008198322,0.00017796748,0.027228268],"genre_scores_gemma":[0.98681355,0.00014394958,0.008123462,0.000062584535,0.000036737416,0.00006390978,0.000015963173,0.000020007721,0.0047198976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988298,0.0005034813,0.00004219014,0.00017556238,0.00024198559,0.00020709241],"domain_scores_gemma":[0.9911685,0.0065707234,0.0006659017,0.0003333728,0.0005283098,0.0007331412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021062454,0.0006221688,0.0011917402,0.00069088745,0.0009394058,0.002375007,0.0018885739,0.0015781493,0.0045173215],"category_scores_gemma":[0.016847726,0.00056171964,0.0006924747,0.00054486387,0.0031215125,0.0035289358,0.0024045727,0.0019707633,0.00024911185],"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.0001448577,0.00009782166,0.0012677766,0.000092826056,0.000059909864,0.00027444668,0.00045849776,0.31648073,0.0019595423,0.66957486,0.0010880461,0.008500709],"study_design_scores_gemma":[0.000045843,0.000028587856,0.00020900936,0.000008373413,0.000015256688,0.000038179955,0.0000784875,0.787169,0.00021914777,0.21166149,0.0005113262,0.000015329613],"about_ca_topic_score_codex":0.0054438324,"about_ca_topic_score_gemma":0.0028701962,"teacher_disagreement_score":0.0054438324,"about_ca_system_score_codex":0.0016837713,"about_ca_system_score_gemma":0.001480477,"threshold_uncertainty_score":0.015111923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04468045,0.0049006213,0.80569184,0.03478491,0.0009858765,0.00016105898,0.00062095455,0.00012341439,0.10805097],"genre_scores_gemma":[0.6783528,0.0082888035,0.21402037,0.003509213,0.003395503,0.0006588135,0.0007807326,0.00015877541,0.090835124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989999,0.0004438138,0.000045023804,0.00024821068,0.00015562505,0.00010736833],"domain_scores_gemma":[0.9974874,0.001830667,0.0001826838,0.00014980369,0.0002091143,0.00014032712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016433767,0.0010065789,0.0011123514,0.0007758633,0.0012977157,0.0031762242,0.001605446,0.0033179102,0.0127644865],"category_scores_gemma":[0.009523012,0.0005338465,0.0013305094,0.001850219,0.0031768626,0.007406175,0.0029547082,0.004280909,0.00072378287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021013046,0.000063919266,0.000111608344,0.00012303771,0.000017435917,0.000042173466,0.0001307775,0.013943209,0.00015544407,0.96492594,0.0060803355,0.014385053],"study_design_scores_gemma":[0.000011508629,0.00001116242,0.00004578408,0.000018024624,0.0000043540667,0.00002326608,0.00008044565,0.011651471,0.000054738863,0.98522365,0.0028692237,0.0000063634616],"about_ca_topic_score_codex":0.0033069912,"about_ca_topic_score_gemma":0.002523494,"teacher_disagreement_score":0.0127644865,"about_ca_system_score_codex":0.0014991681,"about_ca_system_score_gemma":0.0029026417,"threshold_uncertainty_score":0.042701423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25133356,0.00035834577,0.7359353,0.0014851964,0.00006950928,0.000117473974,0.00019772859,0.00010794996,0.010394995],"genre_scores_gemma":[0.9537826,0.00020252747,0.043969728,0.00011531064,0.000046825884,0.0001016895,0.00008544694,0.000029371968,0.0016665144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343395,0.0049212645,0.00018987492,0.00045825297,0.0006630792,0.00033360685],"domain_scores_gemma":[0.95975214,0.035130557,0.0016634878,0.0014573864,0.0010203435,0.0009761106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007402169,0.001015762,0.0016661445,0.0025576598,0.0010359634,0.0036240076,0.0022459892,0.0025854155,0.004810499],"category_scores_gemma":[0.038136292,0.0008165688,0.0012181962,0.0031455995,0.0024337487,0.008445332,0.0017352179,0.002074697,0.00033894245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041379154,0.000115259376,0.0019668918,0.00019953628,0.00016616657,0.00019394947,0.00054068275,0.2675945,0.000681409,0.7083422,0.00091858493,0.018867107],"study_design_scores_gemma":[0.000041313768,0.00004359494,0.0002790708,0.000012758668,0.00003804573,0.000053304484,0.00012733525,0.37737495,0.00013638064,0.62149704,0.00037135722,0.000024873523],"about_ca_topic_score_codex":0.0022306032,"about_ca_topic_score_gemma":0.003436482,"teacher_disagreement_score":0.007402169,"about_ca_system_score_codex":0.0017344954,"about_ca_system_score_gemma":0.0010299388,"threshold_uncertainty_score":0.03914684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50301546,0.00047166104,0.44227982,0.003260281,0.00012093023,0.0002447057,0.00048159712,0.0001658703,0.04995975],"genre_scores_gemma":[0.9617029,0.00033004524,0.025780287,0.00026109823,0.00007558244,0.00034864928,0.00024660028,0.00005298743,0.011201901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762565,0.001007712,0.00010086769,0.00028397705,0.0006219789,0.00035984817],"domain_scores_gemma":[0.9905628,0.006800202,0.0007663075,0.000490716,0.0006124423,0.0007676278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691635,0.00063068,0.001867526,0.0016736647,0.0024660174,0.005540884,0.0023484477,0.0025471721,0.0057942113],"category_scores_gemma":[0.013062927,0.00095951324,0.0011532288,0.0014367548,0.004479268,0.0058690486,0.0033076277,0.003117752,0.00047187577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051189814,0.00004621643,0.00022253174,0.000025910334,0.000021015132,0.000055676035,0.00019606228,0.017139757,0.00047635025,0.97846174,0.00052803196,0.0027755138],"study_design_scores_gemma":[0.000027515418,0.000012433294,0.000121839366,0.000008760019,0.0000054305224,0.000015720812,0.00005160795,0.06437206,0.000181974,0.934872,0.00031810233,0.000012517168],"about_ca_topic_score_codex":0.0024518953,"about_ca_topic_score_gemma":0.0022304135,"teacher_disagreement_score":0.0057942113,"about_ca_system_score_codex":0.002442219,"about_ca_system_score_gemma":0.0020264788,"threshold_uncertainty_score":0.01938355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03455656,0.0017232145,0.78573084,0.009154661,0.00093474245,0.00029883985,0.0010964146,0.0010245392,0.16548015],"genre_scores_gemma":[0.5831511,0.0029712068,0.35677436,0.0030179503,0.0010795179,0.00056994637,0.0018216936,0.0016069184,0.0490072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962746,0.0015108936,0.00013827442,0.0007089328,0.000965294,0.00040200623],"domain_scores_gemma":[0.9776659,0.01614971,0.00059920474,0.0028698482,0.0018779525,0.000837496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064633153,0.0026378087,0.0016676657,0.0023268545,0.0016404502,0.0050746463,0.004451164,0.0029906458,0.048319016],"category_scores_gemma":[0.042371757,0.0008898671,0.0024608453,0.0025820853,0.0021872418,0.013648179,0.0054509654,0.007180688,0.008684927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028306813,0.0005707989,0.0015149342,0.00059835636,0.00014321724,0.00016477745,0.00040035782,0.07268656,0.0029344906,0.7902913,0.04859769,0.08181439],"study_design_scores_gemma":[0.00007432532,0.00011968192,0.0004614651,0.00015032881,0.00006934815,0.000119203294,0.00009373414,0.25645256,0.0017762273,0.7276197,0.013020743,0.000042688396],"about_ca_topic_score_codex":0.0036366382,"about_ca_topic_score_gemma":0.0053172344,"teacher_disagreement_score":0.048319016,"about_ca_system_score_codex":0.003718665,"about_ca_system_score_gemma":0.0036343096,"threshold_uncertainty_score":0.1616432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028135035,0.00025901996,0.9630973,0.0006308377,0.00007439008,0.000052998108,0.000025047213,0.000039374372,0.0076860473],"genre_scores_gemma":[0.6942418,0.0008080775,0.29949614,0.00017635892,0.00015948527,0.00025627398,0.00004174742,0.000067112036,0.0047529917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796754,0.0014026831,0.0000713309,0.000116878226,0.00034765463,0.00009389387],"domain_scores_gemma":[0.9892581,0.00931581,0.0003606449,0.00028753883,0.00056790997,0.00020995425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049503245,0.00079091213,0.0009465438,0.0009993345,0.001170787,0.0029323143,0.0015995564,0.0016513239,0.0049075666],"category_scores_gemma":[0.01963457,0.00057018665,0.000967549,0.0020991506,0.0019083414,0.004473372,0.0021643136,0.0023360236,0.00030018506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007784098,0.00014281855,0.0015650728,0.00017600588,0.00007440982,0.00032731314,0.0009829443,0.31511566,0.0009038151,0.61171097,0.0013119236,0.06761114],"study_design_scores_gemma":[0.000012065994,0.000036047284,0.00019055197,0.000022085378,0.000021953836,0.000040910745,0.00022540707,0.73159444,0.00025303173,0.2662785,0.0013049518,0.000020031981],"about_ca_topic_score_codex":0.0026216977,"about_ca_topic_score_gemma":0.0028039746,"teacher_disagreement_score":0.0049503245,"about_ca_system_score_codex":0.0009590075,"about_ca_system_score_gemma":0.0008945006,"threshold_uncertainty_score":0.026180148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033145897,0.000388284,0.9591477,0.0009545097,0.00008449445,0.000080310536,0.000033032888,0.00021619216,0.005949562],"genre_scores_gemma":[0.89630395,0.0006303823,0.097572915,0.00023042102,0.00012588818,0.00030519612,0.0000511899,0.000058419795,0.00472166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794286,0.001069144,0.00008926684,0.00023487028,0.00043950306,0.00022443006],"domain_scores_gemma":[0.9866159,0.009246128,0.0014836718,0.0012456307,0.00075172057,0.0006569348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041446513,0.0008548562,0.0009323673,0.0010935048,0.00090026826,0.002836229,0.0028739597,0.0020507865,0.0023367184],"category_scores_gemma":[0.018273883,0.0006982067,0.0007507778,0.0008772187,0.003535851,0.0039431737,0.003967221,0.0020731634,0.0003314271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008662379,0.000058054724,0.0003186652,0.00011964301,0.000047702943,0.00011201253,0.00029393737,0.16528477,0.0023192123,0.8089256,0.00166863,0.020765087],"study_design_scores_gemma":[0.00007667953,0.0000475263,0.000072370596,0.000017935337,0.000012586384,0.000049884613,0.000046172616,0.36727864,0.0005905694,0.63012826,0.0016666603,0.000012771526],"about_ca_topic_score_codex":0.00092567847,"about_ca_topic_score_gemma":0.00081771886,"teacher_disagreement_score":0.0041446513,"about_ca_system_score_codex":0.0012469711,"about_ca_system_score_gemma":0.0013559014,"threshold_uncertainty_score":0.02191931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018621515,0.0023956045,0.9463865,0.0059553143,0.00024261525,0.00011963536,0.00047200336,0.0002185411,0.025588242],"genre_scores_gemma":[0.6870706,0.0058722543,0.28714803,0.0013345674,0.0004338346,0.00063706766,0.0009125512,0.000230826,0.016360233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975817,0.0015892702,0.00006596806,0.00030857415,0.000301399,0.00015303786],"domain_scores_gemma":[0.9957831,0.003089249,0.00028899603,0.00029787415,0.00024675706,0.00029398716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021339455,0.0013680591,0.0015687422,0.0021885065,0.0012316246,0.004396419,0.003589323,0.0038588645,0.009473853],"category_scores_gemma":[0.008803001,0.00061542814,0.0012927756,0.0035844557,0.003564944,0.009315358,0.001650007,0.0028674558,0.0017098669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005024067,0.000035254125,0.0003158371,0.0001031619,0.000047813963,0.000098350414,0.00021949245,0.08821613,0.00022620302,0.8934905,0.0036365965,0.013560384],"study_design_scores_gemma":[0.000020508647,0.000011705897,0.00006080842,0.000017958417,0.000016948776,0.000047079353,0.00006071993,0.13661751,0.000039462597,0.8598899,0.0031994593,0.000017947596],"about_ca_topic_score_codex":0.0074325614,"about_ca_topic_score_gemma":0.006855624,"teacher_disagreement_score":0.009473853,"about_ca_system_score_codex":0.0027929181,"about_ca_system_score_gemma":0.0021480783,"threshold_uncertainty_score":0.03169322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47909912,0.0016852067,0.41921243,0.0052857236,0.00014085263,0.000086341104,0.00034520272,0.00014595519,0.093999185],"genre_scores_gemma":[0.96155316,0.00065483607,0.025117362,0.00014618678,0.000041496758,0.000059235037,0.000101765094,0.000028600354,0.012297395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903524,0.0005496622,0.000030833708,0.00012482377,0.00013273035,0.0001267718],"domain_scores_gemma":[0.99641645,0.0026116704,0.00027218548,0.000157979,0.000335323,0.00020642464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019185059,0.00030425572,0.00062556216,0.0006113834,0.0007486833,0.0026214137,0.00086939766,0.0013802798,0.0053774808],"category_scores_gemma":[0.012778717,0.000376779,0.0004865746,0.0007279231,0.0020923137,0.0045617293,0.000988384,0.00137664,0.00045928947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005587082,0.000027404876,0.00089802354,0.00003257518,0.000022778017,0.00007797972,0.0004136918,0.018128695,0.00045525288,0.9711067,0.00078855024,0.007992425],"study_design_scores_gemma":[0.000017217522,0.000011138254,0.0004238165,0.0000085479405,0.000006566878,0.000041364936,0.00013473787,0.046143092,0.000091988986,0.95179886,0.0013116933,0.000010924842],"about_ca_topic_score_codex":0.005354179,"about_ca_topic_score_gemma":0.0035861267,"teacher_disagreement_score":0.0053774808,"about_ca_system_score_codex":0.0015760049,"about_ca_system_score_gemma":0.0010257898,"threshold_uncertainty_score":0.017989457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751907,0.00015711415,0.011479452,0.0008450955,0.000078769415,0.00060035277,0.00016048223,0.00009025078,0.011397654],"genre_scores_gemma":[0.9898677,0.0001461394,0.0071806326,0.00021755444,0.000048082904,0.00067276007,0.00012323036,0.000014116476,0.0017298708],"study_design_codex":"design_other","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.9977963,0.0010079609,0.000124128,0.00043286273,0.00041796072,0.00022074209],"domain_scores_gemma":[0.9714234,0.016961386,0.0041204654,0.005124052,0.00090770226,0.001462983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038026965,0.0004890756,0.00055174984,0.0004359409,0.0010055299,0.0013941786,0.001187561,0.0013633443,0.0057223304],"category_scores_gemma":[0.019110007,0.00028253088,0.0003328749,0.0005568168,0.0016901892,0.0018734221,0.0017486721,0.0017959268,0.00043595483],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017569963,0.1473738,0.08972818,0.0033518514,0.00094774866,0.002384546,0.01393604,0.058350716,0.1431754,0.25061288,0.01864801,0.2539209],"study_design_scores_gemma":[0.01821423,0.077089794,0.09325075,0.00082144636,0.00061237335,0.0020149273,0.009476423,0.23145795,0.05904595,0.4473715,0.06024953,0.00039514742],"about_ca_topic_score_codex":0.00047585135,"about_ca_topic_score_gemma":0.00057826476,"teacher_disagreement_score":0.0057223304,"about_ca_system_score_codex":0.00067346194,"about_ca_system_score_gemma":0.0009929971,"threshold_uncertainty_score":0.020110846},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18580112,0.0020417687,0.6707312,0.024104584,0.00042133476,0.0007700474,0.002788721,0.0007445165,0.112596706],"genre_scores_gemma":[0.9295842,0.0011878165,0.034167375,0.0007244041,0.00031627517,0.00043146947,0.00038780645,0.000110558554,0.033090174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929802,0.0038970786,0.00024187715,0.00082139665,0.0008520322,0.0012074912],"domain_scores_gemma":[0.9597641,0.02903044,0.0038137236,0.0011959308,0.0028137187,0.003382081],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008093171,0.0018659339,0.0039369627,0.0038436865,0.0019363187,0.010518754,0.0057152347,0.008015349,0.029309884],"category_scores_gemma":[0.034205873,0.0015820097,0.0024822978,0.0058335024,0.005890295,0.01027393,0.0034296007,0.004683278,0.002197368],"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.00019537249,0.0003088151,0.0019985985,0.0002107902,0.00015595628,0.00023363209,0.00051046733,0.17174865,0.00037574908,0.81348765,0.003958682,0.0068157185],"study_design_scores_gemma":[0.00041385088,0.0002262024,0.0014676435,0.000063616055,0.00013681703,0.00017613907,0.00043416387,0.43581167,0.00010855568,0.55768627,0.0033625627,0.00011251666],"about_ca_topic_score_codex":0.0210474,"about_ca_topic_score_gemma":0.014132947,"teacher_disagreement_score":0.99615633,"about_ca_system_score_codex":0.00886713,"about_ca_system_score_gemma":0.004518591,"threshold_uncertainty_score":0.09805137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060793143,0.00048957026,0.9743463,0.0010636145,0.00008076973,0.00006822112,0.00015205555,0.000091570975,0.017628597],"genre_scores_gemma":[0.47861165,0.0019131734,0.49805725,0.00073846785,0.00027783794,0.0006693867,0.0005282904,0.00014717481,0.019056687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997951,0.0011989649,0.00007919279,0.00027813963,0.00036130956,0.00013137107],"domain_scores_gemma":[0.99865305,0.0007951396,0.00013700241,0.0001321207,0.00017512651,0.000107505606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022204153,0.0010603499,0.00096558797,0.0014693758,0.0011113987,0.0025485998,0.0020922816,0.0018016729,0.007118995],"category_scores_gemma":[0.0039411928,0.000386022,0.0017158125,0.0022277124,0.0023083591,0.004999295,0.0016853621,0.0025113176,0.0012620125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016590726,0.000012335344,0.00007285343,0.00002853909,0.000017411989,0.000055071323,0.00012888436,0.04638519,0.00025103803,0.94725746,0.0008807413,0.0048939614],"study_design_scores_gemma":[0.000015982965,0.00001411482,0.00003596201,0.000012947658,0.000009879157,0.000037024747,0.00004667235,0.15565416,0.00010594902,0.8385025,0.005549895,0.000014961462],"about_ca_topic_score_codex":0.005050743,"about_ca_topic_score_gemma":0.004560612,"teacher_disagreement_score":0.007118995,"about_ca_system_score_codex":0.002870102,"about_ca_system_score_gemma":0.0017533203,"threshold_uncertainty_score":0.023815453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25611794,0.002566019,0.6023706,0.006333868,0.00020229802,0.00030526172,0.0011474951,0.0002480239,0.1307085],"genre_scores_gemma":[0.9101045,0.0036750613,0.07045493,0.0006567378,0.00047508298,0.00037800235,0.0007507037,0.00017482477,0.013330039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961467,0.0019283703,0.0001803592,0.00068380137,0.0007130107,0.00034779307],"domain_scores_gemma":[0.9749805,0.017472133,0.0029742653,0.0011063034,0.0020924232,0.0013744541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035779132,0.0014560678,0.0026274144,0.0033927795,0.002616963,0.0053102276,0.002857614,0.0026454811,0.010295431],"category_scores_gemma":[0.024525443,0.0012960735,0.0016631196,0.0032280046,0.0074352175,0.011453621,0.0054074875,0.004299992,0.0011980697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035218018,0.000011226178,0.00021773796,0.000026157539,0.000012515683,0.000053730735,0.00010916035,0.00548008,0.00016644725,0.9916773,0.0006466519,0.0015637631],"study_design_scores_gemma":[0.000021548618,0.00001336501,0.00013884885,0.000014025751,0.000010269388,0.00005285157,0.00003949264,0.014223704,0.00008290878,0.9845316,0.00085760886,0.000013819935],"about_ca_topic_score_codex":0.003181608,"about_ca_topic_score_gemma":0.0019682054,"teacher_disagreement_score":0.010295431,"about_ca_system_score_codex":0.0033374352,"about_ca_system_score_gemma":0.0017902469,"threshold_uncertainty_score":0.03444159},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10161323,0.0005314605,0.8745803,0.0021896379,0.000110550965,0.0001117543,0.00029356574,0.00013719847,0.020432318],"genre_scores_gemma":[0.8903934,0.0007907586,0.098586455,0.00032720595,0.00014593502,0.00024479823,0.0002504436,0.00010394612,0.00915707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969543,0.0021330593,0.000076228156,0.00026589853,0.0003544332,0.00021615256],"domain_scores_gemma":[0.988457,0.009669493,0.0004696047,0.00048640234,0.00046012533,0.0004573408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004029038,0.001083852,0.0019072217,0.00255995,0.0012798553,0.0036718128,0.0027361014,0.0032411024,0.009238816],"category_scores_gemma":[0.017144796,0.0007038453,0.001294548,0.003583085,0.0028884285,0.009510144,0.0015551487,0.0025672184,0.0010308842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014490285,0.00006745546,0.00060510327,0.000096235926,0.00006438389,0.00009791386,0.00023706515,0.12871663,0.00039566853,0.85542125,0.0013693643,0.012784035],"study_design_scores_gemma":[0.00003508225,0.000024357912,0.00014283878,0.000010582396,0.000025985524,0.000041055613,0.000060623228,0.30635127,0.00006992293,0.69258016,0.0006347782,0.000023411822],"about_ca_topic_score_codex":0.0051282714,"about_ca_topic_score_gemma":0.0049772677,"teacher_disagreement_score":0.009238816,"about_ca_system_score_codex":0.0018998747,"about_ca_system_score_gemma":0.0012065927,"threshold_uncertainty_score":0.030906916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1296439,0.0006073341,0.8406648,0.0044060093,0.00014326996,0.0002607012,0.00069695874,0.00014597537,0.02343103],"genre_scores_gemma":[0.9439312,0.00067858695,0.04564938,0.00049528875,0.00032884403,0.000608068,0.00056033075,0.00007525789,0.007673146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97204643,0.01466052,0.0015408986,0.004561885,0.00456041,0.002629745],"domain_scores_gemma":[0.7238404,0.23845552,0.013128941,0.012640243,0.007937169,0.0039977576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027709575,0.0012944575,0.0051810155,0.0026217827,0.0024206294,0.00856869,0.0045556594,0.0047301017,0.0068032867],"category_scores_gemma":[0.14505768,0.002310958,0.0038608573,0.0025240916,0.010296603,0.014539664,0.0046525323,0.0097380355,0.0010222329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001269662,0.000069665555,0.0006619853,0.00006180485,0.00012224354,0.000092177346,0.00041498817,0.016940612,0.00022403036,0.97701913,0.000511446,0.0037550458],"study_design_scores_gemma":[0.000049762788,0.000022776981,0.0004209792,0.0000135748405,0.000028731441,0.00004270509,0.000060370465,0.0456961,0.000093990144,0.9532491,0.00029655366,0.000025510908],"about_ca_topic_score_codex":0.0058125425,"about_ca_topic_score_gemma":0.0032317624,"teacher_disagreement_score":0.027709575,"about_ca_system_score_codex":0.003993625,"about_ca_system_score_gemma":0.0044057295,"threshold_uncertainty_score":0.14654398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058244582,0.0013686029,0.8819129,0.0061967405,0.00016899982,0.00017063454,0.0003376673,0.00013593743,0.051463995],"genre_scores_gemma":[0.89529234,0.0014076919,0.094184466,0.0013854877,0.00067868544,0.0004233215,0.00026856293,0.000059466267,0.0063000144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96994644,0.01458624,0.0018776011,0.0059643476,0.005613105,0.0020123348],"domain_scores_gemma":[0.9116362,0.05903186,0.011308042,0.01149088,0.0046718335,0.001861209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02140967,0.0011553664,0.0026270784,0.0030044843,0.0018905426,0.006843266,0.0025490422,0.0038541202,0.0042951973],"category_scores_gemma":[0.09410359,0.0009904847,0.0022856342,0.002697115,0.015145806,0.018571036,0.0058198166,0.0049437876,0.0006972918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029935183,0.000014986981,0.00054801465,0.00005115388,0.00004324712,0.00011672124,0.00018723753,0.005046856,0.0001669598,0.9883207,0.0003652278,0.0051089767],"study_design_scores_gemma":[0.0000134722395,0.000018596993,0.00014894594,0.000017604105,0.0000116277715,0.00007574534,0.000028809052,0.010148653,0.00012394489,0.9885606,0.00083956425,0.000012395489],"about_ca_topic_score_codex":0.002796022,"about_ca_topic_score_gemma":0.001607403,"teacher_disagreement_score":0.02140967,"about_ca_system_score_codex":0.0042244988,"about_ca_system_score_gemma":0.0029902633,"threshold_uncertainty_score":0.11322653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5579178,0.0017264719,0.36956564,0.007855683,0.00024751062,0.00018886688,0.001520742,0.0007064682,0.060270842],"genre_scores_gemma":[0.9733792,0.0007548458,0.010715715,0.00036075542,0.00011142671,0.00013369891,0.00048938853,0.00016713288,0.0138878375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985525,0.0004735643,0.000043099422,0.0003293512,0.00024097803,0.00036060298],"domain_scores_gemma":[0.9808559,0.013414471,0.0012577764,0.0010729432,0.0009614418,0.002437467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018574169,0.00087268645,0.0014416436,0.0020689317,0.0013755445,0.0044817613,0.0024120822,0.003398986,0.015574411],"category_scores_gemma":[0.018180378,0.0009229743,0.000939161,0.0015921481,0.0033352156,0.009202267,0.0025115365,0.0031453692,0.00097232347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023676304,0.00004975291,0.000865226,0.00014594884,0.000051007824,0.00012707227,0.0005297506,0.03185798,0.0028887664,0.95335716,0.0033480215,0.0065425234],"study_design_scores_gemma":[0.00008442819,0.00015927444,0.0011257328,0.000086330336,0.00007403348,0.00023084828,0.00046780627,0.21430081,0.0016483506,0.7776378,0.0041149314,0.000069682916],"about_ca_topic_score_codex":0.0036839372,"about_ca_topic_score_gemma":0.0019313,"teacher_disagreement_score":0.015574411,"about_ca_system_score_codex":0.0028116957,"about_ca_system_score_gemma":0.001623318,"threshold_uncertainty_score":0.05210167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09259648,0.00021757033,0.8887493,0.0015488113,0.000085436506,0.000117459625,0.00030143108,0.00036084699,0.016022654],"genre_scores_gemma":[0.7401446,0.0004245437,0.25567138,0.0002768419,0.00006626758,0.00052078423,0.00031467213,0.00010695642,0.0024739054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918765,0.00052810257,0.000026834789,0.0000744853,0.00011669091,0.00006621935],"domain_scores_gemma":[0.99385506,0.004875361,0.00031012725,0.00040461993,0.00030624215,0.00024847474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016270292,0.0006103619,0.0014564506,0.0009364394,0.00080452935,0.0019865911,0.0019271215,0.002264612,0.003984232],"category_scores_gemma":[0.0095970975,0.0006482367,0.0013037856,0.0010902352,0.002575233,0.0015911487,0.002197483,0.00212334,0.00038059847],"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.000012797354,0.000015594287,0.00030547465,0.00001645653,0.00001083884,0.000028015265,0.000041523974,0.95713,0.00010132983,0.041262664,0.0001409214,0.0009343656],"study_design_scores_gemma":[0.000009002104,0.000003888263,0.000026568796,0.0000035850842,0.0000019062113,0.0000028312843,0.000012687775,0.9791894,0.000025043142,0.02050219,0.00022056734,0.0000022164081],"about_ca_topic_score_codex":0.013464628,"about_ca_topic_score_gemma":0.007750563,"teacher_disagreement_score":0.013464628,"about_ca_system_score_codex":0.0016141059,"about_ca_system_score_gemma":0.002195585,"threshold_uncertainty_score":0.0267725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020602431,0.011467559,0.82435477,0.009163904,0.0012281237,0.00030755668,0.00014551979,0.00012197401,0.13260816],"genre_scores_gemma":[0.7444755,0.012756243,0.2198858,0.0017339401,0.0013371947,0.0007711399,0.00015026428,0.00008417969,0.018805876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736685,0.0018944283,0.00011519681,0.00013246988,0.00034987114,0.00014113281],"domain_scores_gemma":[0.9932561,0.0057821516,0.00020333113,0.00012770551,0.0004078062,0.00022297037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031562229,0.0012852895,0.0012972456,0.0017488177,0.0010858957,0.0028475474,0.0013437119,0.001978886,0.0053084977],"category_scores_gemma":[0.008842498,0.0004748993,0.0011770737,0.0023682802,0.003849967,0.0017992236,0.0029710256,0.0029926724,0.00039085714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010694212,0.00003766869,0.0002323158,0.00014192337,0.000032579177,0.0001515666,0.00016178585,0.13508645,0.00013617615,0.85310555,0.002288588,0.008614884],"study_design_scores_gemma":[0.000020385603,0.000020507454,0.000089456524,0.000059713373,0.000009086756,0.00004815267,0.000119556265,0.19067141,0.00004347747,0.801002,0.007907245,0.000008937052],"about_ca_topic_score_codex":0.0058197086,"about_ca_topic_score_gemma":0.0044616843,"teacher_disagreement_score":0.0058197086,"about_ca_system_score_codex":0.0025534725,"about_ca_system_score_gemma":0.0017939319,"threshold_uncertainty_score":0.018526852},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037164222,0.00044360626,0.8286278,0.001652699,0.00026484873,0.00021492332,0.0015918377,0.0016955921,0.12834442],"genre_scores_gemma":[0.75605655,0.00085754355,0.17014469,0.00051896117,0.000116272495,0.0003228895,0.0021869093,0.00047163304,0.06932453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995121,0.00014990906,0.000016962516,0.00017634704,0.000102734666,0.000042056126],"domain_scores_gemma":[0.9991025,0.000361761,0.000066383785,0.00021991394,0.00016955024,0.00007998788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036106,0.0006281093,0.00043686252,0.00094946264,0.00066101894,0.0027298022,0.0010253447,0.0013325657,0.027487984],"category_scores_gemma":[0.003680792,0.00035351273,0.00055685104,0.00086542126,0.0010137237,0.0032606374,0.0013858237,0.0009106563,0.0036320693],"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.00007946725,0.00005105439,0.0005047646,0.000112032794,0.000032008065,0.00012832209,0.00027200914,0.08047595,0.0023695754,0.8722563,0.00870428,0.035014346],"study_design_scores_gemma":[0.000033422468,0.000035628964,0.0003180961,0.000020846825,0.000020799838,0.000066795394,0.0001323557,0.3672155,0.0009754705,0.60564166,0.025515849,0.000023634218],"about_ca_topic_score_codex":0.005821726,"about_ca_topic_score_gemma":0.004042397,"teacher_disagreement_score":0.027487984,"about_ca_system_score_codex":0.0010995687,"about_ca_system_score_gemma":0.0007012593,"threshold_uncertainty_score":0.091956496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10239178,0.0034093447,0.6953254,0.006884837,0.0002573522,0.00015299497,0.0004429252,0.00019490912,0.19094051],"genre_scores_gemma":[0.9432586,0.0015308033,0.040886212,0.000546065,0.00016976416,0.0002562568,0.00015152626,0.000049966387,0.013150794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.00053013064,0.000034358884,0.00024513106,0.00019713126,0.00012029403],"domain_scores_gemma":[0.9957112,0.0026588745,0.00070333725,0.00038249322,0.00025811413,0.00028597834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023926424,0.0007303457,0.00063854264,0.00087957614,0.00081867207,0.0019199711,0.0012533756,0.0015597726,0.009548737],"category_scores_gemma":[0.011298333,0.00020436403,0.000828291,0.0009898918,0.002710219,0.003523517,0.001971554,0.0016435847,0.0008003581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086087875,0.000014046217,0.00060954166,0.000027093982,0.000023374589,0.00004041252,0.00009548913,0.01943369,0.00020190599,0.9705451,0.0009485416,0.008052183],"study_design_scores_gemma":[0.00001052181,0.00003238171,0.0004761465,0.000015281092,0.0000065645295,0.00009488161,0.00004564489,0.059212662,0.0001101801,0.9328634,0.007122547,0.000009809791],"about_ca_topic_score_codex":0.0015038664,"about_ca_topic_score_gemma":0.00074884074,"teacher_disagreement_score":0.009548737,"about_ca_system_score_codex":0.0019824046,"about_ca_system_score_gemma":0.00065084663,"threshold_uncertainty_score":0.03194368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6165388,0.0013146085,0.2918793,0.0055768066,0.000054898563,0.00033995142,0.0003675443,0.000071254566,0.083856836],"genre_scores_gemma":[0.9871322,0.00022967863,0.010504008,0.00006666617,0.00002333357,0.000068603935,0.00003761011,0.000006062408,0.0019318345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98943067,0.0060833003,0.00053806516,0.0009984892,0.0018358984,0.0011135632],"domain_scores_gemma":[0.9676422,0.019259274,0.0077992547,0.0014996991,0.0018617302,0.001937842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069218623,0.0005220427,0.0005249462,0.0018844042,0.001143441,0.0047549787,0.0007038604,0.0014951612,0.0064632357],"category_scores_gemma":[0.016515052,0.00030978836,0.00086386467,0.002489731,0.006296304,0.0051455414,0.0029766539,0.0016381682,0.00032973656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011627347,0.00020105974,0.021615587,0.00014088453,0.00009905632,0.0002337785,0.0022715137,0.020654047,0.0005860976,0.9341502,0.00050881016,0.019422676],"study_design_scores_gemma":[0.00007043567,0.00039957915,0.030947242,0.00013598056,0.00008174937,0.00018169192,0.002689082,0.059373904,0.0004975765,0.8994851,0.006045829,0.0000918862],"about_ca_topic_score_codex":0.0052937483,"about_ca_topic_score_gemma":0.0035574632,"teacher_disagreement_score":0.0069218623,"about_ca_system_score_codex":0.0038924187,"about_ca_system_score_gemma":0.0016503164,"threshold_uncertainty_score":0.03660673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8373603,0.00024310459,0.11117804,0.0029548563,0.000055927547,0.000099297205,0.00009848915,0.000048051763,0.04796195],"genre_scores_gemma":[0.99495995,0.000038871844,0.0039096344,0.00009597405,0.000044463628,0.00004924365,0.000020670388,0.000005432034,0.0008756894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99316967,0.0038385906,0.00024196254,0.0010346666,0.0010837805,0.0006312834],"domain_scores_gemma":[0.96623623,0.023870176,0.002761594,0.0035184023,0.0017217203,0.0018919023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067368103,0.00023730923,0.0011739028,0.0012445125,0.0016424811,0.0029517848,0.0009449274,0.0013919678,0.0032598283],"category_scores_gemma":[0.03094817,0.0002014908,0.0006816182,0.001018498,0.0063301423,0.0043844613,0.0037355195,0.0020418745,0.00014677769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014405894,0.00012058417,0.006805944,0.000049932936,0.00008512887,0.00008442548,0.0012615582,0.01029976,0.0006321123,0.95817465,0.00051425863,0.021827534],"study_design_scores_gemma":[0.000017314114,0.0000307239,0.0011689264,0.0000047071444,0.000007434375,0.000033589746,0.00023082999,0.0073832953,0.00008632432,0.99073994,0.0002906023,0.000006303434],"about_ca_topic_score_codex":0.0006597413,"about_ca_topic_score_gemma":0.00051159767,"teacher_disagreement_score":0.0067368103,"about_ca_system_score_codex":0.0012976464,"about_ca_system_score_gemma":0.0007535668,"threshold_uncertainty_score":0.03562808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24089034,0.00086926064,0.7328944,0.0018656537,0.00008873131,0.00020064255,0.00015925322,0.00015741738,0.022874232],"genre_scores_gemma":[0.933095,0.0008325582,0.055300757,0.00019691285,0.00009532895,0.0002825937,0.00009522619,0.00004978523,0.010051811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885345,0.0005144851,0.000057579255,0.00015366875,0.0001954075,0.0002253601],"domain_scores_gemma":[0.9956254,0.0030736018,0.00049883913,0.00020483097,0.00029343617,0.00030395927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002852979,0.001131344,0.0015051867,0.0012593223,0.0013350683,0.0036820667,0.0022643306,0.0024567624,0.0030625372],"category_scores_gemma":[0.009684191,0.00077632256,0.0011056424,0.001312202,0.0023951547,0.0058291852,0.0017152154,0.001742856,0.00027424202],"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.000119606004,0.00008677547,0.00047420312,0.00011793914,0.00008144093,0.00011977241,0.0003027023,0.18952002,0.001250143,0.7943216,0.0018425231,0.01176326],"study_design_scores_gemma":[0.00003247549,0.000031409905,0.00010216232,0.000013638149,0.000022415814,0.0000423261,0.000060619863,0.36291173,0.00029864506,0.635686,0.00078214967,0.000016455188],"about_ca_topic_score_codex":0.0020382903,"about_ca_topic_score_gemma":0.0019722804,"teacher_disagreement_score":0.0036820667,"about_ca_system_score_codex":0.0026300773,"about_ca_system_score_gemma":0.0018354382,"threshold_uncertainty_score":0.019082606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16189164,0.00036558585,0.78440034,0.0012353058,0.00012061739,0.00027141994,0.00017310382,0.000076087235,0.05146584],"genre_scores_gemma":[0.8789402,0.00027855695,0.1061362,0.00017584041,0.000044808887,0.00036461776,0.00010115592,0.000014651178,0.013943851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987435,0.000644479,0.000060426766,0.00017804558,0.00023453923,0.000139032],"domain_scores_gemma":[0.9996131,0.00017262377,0.00005670626,0.000026445005,0.0000597949,0.000071294686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012912017,0.0008312303,0.000716725,0.000544261,0.0009918413,0.0015789864,0.0011260814,0.0014307117,0.0043480964],"category_scores_gemma":[0.0020134863,0.00020873696,0.0005218449,0.00049604045,0.0014901189,0.0031252345,0.0014945563,0.0012155946,0.00046127752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008559789,0.000070363574,0.0003194202,0.00006783153,0.000024673478,0.00017451098,0.00034536506,0.012642389,0.0021467553,0.9739613,0.00055562996,0.009606094],"study_design_scores_gemma":[0.000072637915,0.00019768697,0.0004903143,0.00004072419,0.00002583812,0.00037470632,0.0003732127,0.22006054,0.0019594778,0.77083975,0.0055073113,0.000057756955],"about_ca_topic_score_codex":0.0010679109,"about_ca_topic_score_gemma":0.0008234932,"teacher_disagreement_score":0.0043480964,"about_ca_system_score_codex":0.0010145792,"about_ca_system_score_gemma":0.0009442865,"threshold_uncertainty_score":0.014545858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98322105,0.0002700519,0.0062197647,0.0005135477,0.000023077944,0.00008787685,0.00011874076,0.000005752635,0.0095400885],"genre_scores_gemma":[0.9959818,0.00007619825,0.0030638396,0.00006847057,0.000007809028,0.0001891002,0.000042965185,0.0000057636917,0.00056391506],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99199295,0.0065002185,0.00019946179,0.00024897797,0.0007497844,0.0003086065],"domain_scores_gemma":[0.94016045,0.04967441,0.0053660166,0.0010293172,0.0026847695,0.0010850242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009359435,0.0004857386,0.000523133,0.0035973403,0.0022511745,0.0035132908,0.0010128273,0.0012106518,0.0040697935],"category_scores_gemma":[0.05616472,0.00032739414,0.00043536568,0.0037649467,0.0018746662,0.0033079674,0.0024364637,0.0023770344,0.00027021137],"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.0032289433,0.00245209,0.6000668,0.00039798862,0.0007714865,0.0006709468,0.16745815,0.009950916,0.0032408172,0.081157975,0.0025339674,0.12806988],"study_design_scores_gemma":[0.00028753607,0.001275084,0.5160901,0.00028171283,0.00039555485,0.0006570008,0.26536623,0.08051127,0.002878457,0.12504166,0.00692312,0.0002924136],"about_ca_topic_score_codex":0.007168437,"about_ca_topic_score_gemma":0.007235044,"teacher_disagreement_score":0.009359435,"about_ca_system_score_codex":0.0025565482,"about_ca_system_score_gemma":0.0015268429,"threshold_uncertainty_score":0.04949802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115616985,0.000809862,0.8388294,0.0019173335,0.00011327927,0.000158,0.00029876694,0.00021141306,0.042044956],"genre_scores_gemma":[0.8824091,0.00059104414,0.105599545,0.0002876489,0.00015760807,0.00025016908,0.0001951869,0.00009933052,0.010410356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610656,0.0023739182,0.00013648908,0.0005606862,0.00049667526,0.00032564715],"domain_scores_gemma":[0.9924481,0.004851896,0.00079472415,0.0009443823,0.00051996135,0.00044099014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036562365,0.0009786697,0.0014197775,0.0016346641,0.0012187811,0.0039927145,0.0030143461,0.0019082332,0.009537213],"category_scores_gemma":[0.011587167,0.000667199,0.001673608,0.002266936,0.0034609295,0.008265255,0.002421226,0.0031608965,0.00073474477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007024213,0.000036263013,0.00018452198,0.0000747184,0.000045460376,0.000065189815,0.00017437783,0.060804654,0.00041304683,0.92997974,0.0006157212,0.007535989],"study_design_scores_gemma":[0.000022025346,0.000020964264,0.000069634334,0.000012156964,0.000019926385,0.0000352893,0.000047214242,0.11354568,0.00012959218,0.8852563,0.00082673936,0.000014441929],"about_ca_topic_score_codex":0.0023663647,"about_ca_topic_score_gemma":0.0026375405,"teacher_disagreement_score":0.009537213,"about_ca_system_score_codex":0.0020959417,"about_ca_system_score_gemma":0.0014144186,"threshold_uncertainty_score":0.031905174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13352197,0.0023964338,0.53562194,0.0029241228,0.0002802617,0.00014116184,0.00033022297,0.00022495833,0.3245588],"genre_scores_gemma":[0.90018326,0.0012892111,0.046779696,0.00017841312,0.00013965463,0.00034404465,0.00025624468,0.000091282025,0.050738323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948186,0.0001926362,0.000029865329,0.00008392234,0.00014667868,0.000065088134],"domain_scores_gemma":[0.9985536,0.0009798744,0.00011226652,0.00012205048,0.00012918764,0.000103084545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091878127,0.00039893005,0.00061816233,0.0007354295,0.0008972197,0.0020252445,0.001037903,0.0009192554,0.009408465],"category_scores_gemma":[0.0041415133,0.00027856746,0.0007257578,0.0008538052,0.0020725115,0.0028224557,0.00132263,0.0017797897,0.0009231344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031457846,0.000018011702,0.00013732756,0.00004161554,0.00001760059,0.000041772524,0.00024124341,0.016777223,0.0007738054,0.9661171,0.0026575034,0.013145432],"study_design_scores_gemma":[0.000009349049,0.000014699578,0.00015953602,0.000013255036,0.0000042135684,0.00004207808,0.000055157838,0.06491894,0.00022556492,0.93164533,0.002902556,0.000009423236],"about_ca_topic_score_codex":0.0017003502,"about_ca_topic_score_gemma":0.0013462257,"teacher_disagreement_score":0.009408465,"about_ca_system_score_codex":0.0015037389,"about_ca_system_score_gemma":0.00083118,"threshold_uncertainty_score":0.03147447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035016154,0.011064843,0.00055888324,0.02355826,0.9555195,0.000029269675,0.00007103594,0.00006783883,0.009095448],"genre_scores_gemma":[0.00089963287,0.012575877,0.00037508822,0.013973762,0.93700475,0.000065946755,0.000096509844,0.00012331219,0.034885116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99608314,0.0006729414,0.00042347496,0.0005658051,0.0019512663,0.0003034055],"domain_scores_gemma":[0.98825246,0.0052828947,0.000504936,0.00042423268,0.004279722,0.0012557653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040155933,0.0038122784,0.0036758482,0.0033744501,0.002188191,0.007634106,0.002571339,0.008360378,0.033764925],"category_scores_gemma":[0.014379734,0.0008433882,0.002791398,0.0017645134,0.002511927,0.004861337,0.0016083308,0.014285599,0.020411758],"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.000011313509,0.000008747432,0.000009772947,0.000097516415,0.00000836304,0.000028953138,0.000006146721,0.00005389432,0.000036442834,0.0018768265,0.9922455,0.005616531],"study_design_scores_gemma":[0.000030599283,0.000017516746,0.00011263028,0.00025507662,0.000018609988,0.00012725832,0.000014013796,0.0002845469,0.00006680777,0.0054627582,0.9935988,0.000011438862],"about_ca_topic_score_codex":0.0011928288,"about_ca_topic_score_gemma":0.0022190055,"teacher_disagreement_score":0.033764925,"about_ca_system_score_codex":0.0041017304,"about_ca_system_score_gemma":0.0028979063,"threshold_uncertainty_score":0.112954915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06881407,0.0003985449,0.9183859,0.00065561343,0.00005984753,0.00016069364,0.00012153252,0.000079825666,0.011323908],"genre_scores_gemma":[0.87417847,0.00067799905,0.117869034,0.00015203847,0.000051514922,0.00022078601,0.00015078756,0.00003809773,0.006661376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986442,0.0006079846,0.000058224337,0.00028430898,0.00019224893,0.00021311558],"domain_scores_gemma":[0.9970312,0.0014517407,0.00063309213,0.00029957222,0.00027158568,0.0003127715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020764433,0.0009477901,0.0007694781,0.0005875903,0.00074653176,0.0017109627,0.001788128,0.0012667889,0.00280847],"category_scores_gemma":[0.006308123,0.00039528133,0.0007308898,0.00078489515,0.001442618,0.0040249913,0.0024736347,0.0011775745,0.00035734687],"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.000093349,0.00008032312,0.001248517,0.0002015108,0.00008604783,0.00027662073,0.00021811757,0.6088337,0.0026858014,0.3639025,0.001410981,0.020962652],"study_design_scores_gemma":[0.000026557182,0.00009950148,0.00026578477,0.000026475554,0.000031005882,0.00011360998,0.00013401842,0.8200514,0.001484523,0.17442143,0.0033262903,0.000019427165],"about_ca_topic_score_codex":0.0012568908,"about_ca_topic_score_gemma":0.0012270333,"teacher_disagreement_score":0.00280847,"about_ca_system_score_codex":0.0014219392,"about_ca_system_score_gemma":0.0009938779,"threshold_uncertainty_score":0.010981441},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2754771,0.0039637373,0.16714104,0.33278662,0.0015186584,0.0003321838,0.00049079955,0.00024947285,0.2180404],"genre_scores_gemma":[0.96133155,0.0010207013,0.017115258,0.0071568014,0.00051758083,0.00020883894,0.000087372915,0.00009480859,0.012467015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99381834,0.003302474,0.00014040768,0.0007789079,0.00072604214,0.0012338795],"domain_scores_gemma":[0.9804206,0.009367424,0.0013233189,0.001227081,0.0022215317,0.005440034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007332862,0.0004376839,0.0013232159,0.0008039319,0.005085752,0.0066165933,0.002469635,0.008435395,0.013022243],"category_scores_gemma":[0.028212793,0.00045423387,0.0007459568,0.0011085105,0.008805198,0.020464512,0.0050190515,0.0032264397,0.002216147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009273396,0.00024312487,0.0041119927,0.00027346058,0.00011606169,0.0002239846,0.003390846,0.0029989795,0.00085287535,0.9227084,0.023337172,0.041650455],"study_design_scores_gemma":[0.000042702162,0.000046212837,0.0010181471,0.00008727181,0.000019044443,0.00018841363,0.00669342,0.0061209863,0.00014340917,0.96408105,0.021518443,0.000040895786],"about_ca_topic_score_codex":0.0053824815,"about_ca_topic_score_gemma":0.0066327914,"teacher_disagreement_score":0.013022243,"about_ca_system_score_codex":0.0014503374,"about_ca_system_score_gemma":0.0042048306,"threshold_uncertainty_score":0.043563724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96670914,0.000665489,0.0036150776,0.0015651517,0.000012003696,0.00005344583,0.0000700509,0.000010643432,0.027299037],"genre_scores_gemma":[0.9984565,0.00015458776,0.0002956825,0.000032462893,0.000004851137,0.000009591292,0.000011693676,0.0000011913135,0.0010335437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903667,0.00028150526,0.00003580177,0.00008231325,0.0001663687,0.0003973383],"domain_scores_gemma":[0.99878734,0.000399048,0.00030486265,0.000051679002,0.00019293113,0.00026430303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009318512,0.00031746522,0.0004541371,0.00226848,0.0024659894,0.0029345958,0.00092829065,0.0009234186,0.0032761123],"category_scores_gemma":[0.0017196327,0.0002740473,0.00036850056,0.002628637,0.0032860474,0.0020090558,0.0017272384,0.00057339086,0.00008699017],"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.00020463389,0.00023637745,0.22310486,0.00029490024,0.00022710268,0.0019086659,0.0064217057,0.1709076,0.0020549183,0.53687894,0.0034416062,0.0543188],"study_design_scores_gemma":[0.00009207302,0.00024999655,0.36076307,0.0001988311,0.00018247281,0.00022858706,0.02012803,0.34063926,0.0010162318,0.26571816,0.010619698,0.00016361452],"about_ca_topic_score_codex":0.16553058,"about_ca_topic_score_gemma":0.23588075,"teacher_disagreement_score":0.16553058,"about_ca_system_score_codex":0.010241581,"about_ca_system_score_gemma":0.0076788133,"threshold_uncertainty_score":0.3291341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18616581,0.0006370878,0.7547888,0.0054517253,0.00014330805,0.00012916871,0.0008191563,0.0003752496,0.05148972],"genre_scores_gemma":[0.94936657,0.00052609626,0.03995667,0.00030621936,0.00006193915,0.00017331846,0.00034704892,0.00010796334,0.009154157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985839,0.0008228223,0.000038334772,0.00022883042,0.00013114973,0.00019499107],"domain_scores_gemma":[0.99435586,0.004415384,0.00038898122,0.00024682414,0.0002793243,0.000313643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018845075,0.0007851645,0.001571386,0.0014648916,0.00136477,0.0043328903,0.0017905734,0.0031038297,0.012048777],"category_scores_gemma":[0.009532966,0.000628444,0.0010484238,0.001836908,0.0033418222,0.0069456208,0.0017999113,0.0028883035,0.0009443945],"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.00009740409,0.000041969117,0.00029897748,0.000051603703,0.00003762988,0.00007669609,0.00019971847,0.13542858,0.00020791672,0.8572339,0.0018124547,0.004513132],"study_design_scores_gemma":[0.0000302635,0.000010925335,0.00006740048,0.000009385814,0.000012120759,0.000011911525,0.000065387685,0.203727,0.00006042293,0.79536414,0.00062807294,0.000012917266],"about_ca_topic_score_codex":0.00862029,"about_ca_topic_score_gemma":0.0079563055,"teacher_disagreement_score":0.012048777,"about_ca_system_score_codex":0.0024404794,"about_ca_system_score_gemma":0.0020776095,"threshold_uncertainty_score":0.040307164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05559567,0.00026538718,0.9387915,0.0009029672,0.00004311368,0.000053658914,0.00010051169,0.00005634443,0.0041908664],"genre_scores_gemma":[0.8570469,0.0005109211,0.13918434,0.00023202489,0.000095056064,0.00020486985,0.00014388135,0.00006297657,0.002519088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426067,0.0039632507,0.00017765969,0.000496624,0.0007723966,0.0003293925],"domain_scores_gemma":[0.9745428,0.022745192,0.00087192305,0.0006513276,0.0006667168,0.0005220902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069465055,0.0014053668,0.0021151337,0.0022358086,0.0008919686,0.0034448712,0.0029161323,0.0029823156,0.0043702116],"category_scores_gemma":[0.027584758,0.00096231885,0.0017095887,0.002937656,0.0028453993,0.0101313,0.0020441855,0.0032728594,0.00047316574],"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.0002618785,0.000099399,0.0011900458,0.00018052399,0.00017815916,0.00020104443,0.0004023175,0.51304513,0.00089057325,0.4590765,0.00079788914,0.023676611],"study_design_scores_gemma":[0.00003198933,0.00003343223,0.00017911331,0.0000145024715,0.00004081548,0.00004260912,0.000053725693,0.5666021,0.00013748309,0.4325351,0.00029137716,0.000037757294],"about_ca_topic_score_codex":0.003104507,"about_ca_topic_score_gemma":0.0039175893,"teacher_disagreement_score":0.0069465055,"about_ca_system_score_codex":0.0019188018,"about_ca_system_score_gemma":0.0010617853,"threshold_uncertainty_score":0.036737084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6292399,0.0010817376,0.23028122,0.0074043963,0.00026886814,0.00026265063,0.00027598752,0.0002620905,0.13092321],"genre_scores_gemma":[0.98318106,0.00019219791,0.009200366,0.00034008568,0.000045484172,0.0000398506,0.000029822253,0.000014354961,0.006956727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989329,0.00034967973,0.000052130876,0.00021299205,0.00018850157,0.00026375733],"domain_scores_gemma":[0.99305725,0.004042749,0.0014211388,0.0006785482,0.00032683226,0.00047339132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015912872,0.0005570254,0.00056153175,0.0003677548,0.000973369,0.0027905311,0.0010118049,0.002567774,0.012741079],"category_scores_gemma":[0.0083516585,0.00044023598,0.00081515306,0.0003664868,0.0017523668,0.0045703705,0.001446792,0.0023544757,0.0008177357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011323831,0.00026733137,0.004075596,0.0003272637,0.00010169395,0.00061406905,0.00093724625,0.014150613,0.02836549,0.9180654,0.0025766238,0.029386207],"study_design_scores_gemma":[0.0005372246,0.0014931302,0.0063155233,0.00021440088,0.00044860214,0.0014962913,0.0015574264,0.17862852,0.02201233,0.76467127,0.022423554,0.00020166507],"about_ca_topic_score_codex":0.0011297453,"about_ca_topic_score_gemma":0.0009940866,"teacher_disagreement_score":0.012741079,"about_ca_system_score_codex":0.0013475259,"about_ca_system_score_gemma":0.0009913609,"threshold_uncertainty_score":0.042623162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10211555,0.0016956732,0.16858561,0.006656437,0.00018516298,0.00014173507,0.00033505767,0.00013911011,0.7201456],"genre_scores_gemma":[0.9482463,0.0012250409,0.019033272,0.00058050564,0.00005493693,0.00007305736,0.00005033245,0.000017950868,0.0307185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993538,0.00028265387,0.000019990617,0.00008422973,0.00012558587,0.00013365434],"domain_scores_gemma":[0.9995622,0.00024057865,0.000046937075,0.000040026447,0.00005226914,0.00005787294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064903783,0.00066373846,0.0007230448,0.00050330535,0.0012435942,0.002602867,0.0012225489,0.0025743148,0.009542989],"category_scores_gemma":[0.002507515,0.00028582543,0.0007214184,0.0009744861,0.0017383265,0.0030635418,0.0010595879,0.0017215213,0.0008091524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017093764,0.000012549147,0.00007665922,0.000014737601,0.0000043709333,0.00009941883,0.000057086854,0.0041230167,0.00007384735,0.9916602,0.0015859623,0.0022750653],"study_design_scores_gemma":[0.000054382734,0.000041669817,0.00026974338,0.000027419364,0.000016279027,0.00025630332,0.0001436535,0.049895763,0.00018985115,0.9344593,0.0146217095,0.00002385209],"about_ca_topic_score_codex":0.009135677,"about_ca_topic_score_gemma":0.008936827,"teacher_disagreement_score":0.009542989,"about_ca_system_score_codex":0.0016488376,"about_ca_system_score_gemma":0.0009503972,"threshold_uncertainty_score":0.031924546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51839644,0.0010234284,0.38879064,0.0030276862,0.00023275547,0.00021461793,0.00030857933,0.0004201548,0.08758572],"genre_scores_gemma":[0.9647057,0.0007110397,0.020344457,0.0002679643,0.0001628665,0.00021639363,0.00014154083,0.000085758176,0.013364404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972372,0.0013477512,0.00016182834,0.0003628361,0.00040353622,0.00048694588],"domain_scores_gemma":[0.98336583,0.0115740355,0.0016646713,0.0014352459,0.0007402202,0.0012201252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033161887,0.0007489895,0.0017088164,0.0011750534,0.0020415597,0.0038965826,0.0012471195,0.0015877518,0.0047078],"category_scores_gemma":[0.011713384,0.0009007431,0.0017380881,0.0013605464,0.0068694786,0.0062705055,0.0023449399,0.0029191512,0.0006563641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041997955,0.000021041706,0.00018399299,0.0000290104,0.000011923047,0.000028799137,0.00023731256,0.002734997,0.00044888823,0.9945417,0.00031388446,0.001406542],"study_design_scores_gemma":[0.000022164219,0.000010478766,0.00006302214,0.0000044501808,0.000008144093,0.000024017194,0.000040179824,0.004926092,0.00013385156,0.99411726,0.0006442807,0.0000060401426],"about_ca_topic_score_codex":0.002489911,"about_ca_topic_score_gemma":0.0016684876,"teacher_disagreement_score":0.0047078,"about_ca_system_score_codex":0.0023040387,"about_ca_system_score_gemma":0.0019721969,"threshold_uncertainty_score":0.017537892},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27092335,0.00079345587,0.71013576,0.00093712384,0.00008414078,0.00008083757,0.00010272811,0.00019051702,0.016752103],"genre_scores_gemma":[0.94930893,0.00044702954,0.041243333,0.00008818927,0.00004400509,0.00010038946,0.00011542641,0.000056173707,0.008596602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00052348187,0.00003450654,0.00014588147,0.00016616803,0.00018524713],"domain_scores_gemma":[0.9910307,0.0070514055,0.0005454927,0.00034192574,0.0005875384,0.0004429794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002492379,0.00082958885,0.0017361201,0.0015205323,0.0008620178,0.0028082174,0.0021481253,0.0015811394,0.0032980135],"category_scores_gemma":[0.017939156,0.00085086765,0.0011409384,0.0008160741,0.0028753458,0.0024863842,0.0021730848,0.0024325554,0.00025512584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028195613,0.00013432586,0.0012973822,0.00011920615,0.00006634189,0.00010752507,0.00042209026,0.24035579,0.0016479191,0.7461966,0.0011237479,0.008247037],"study_design_scores_gemma":[0.000025696223,0.00002114026,0.00013627541,0.000012617817,0.000011968935,0.00001964582,0.000056095312,0.7510759,0.00019943697,0.24806266,0.00036952674,0.000008925155],"about_ca_topic_score_codex":0.006115899,"about_ca_topic_score_gemma":0.003036377,"teacher_disagreement_score":0.006115899,"about_ca_system_score_codex":0.0023022844,"about_ca_system_score_gemma":0.0012513204,"threshold_uncertainty_score":0.01670438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24157369,0.007899719,0.6935451,0.0033928768,0.00019541162,0.00020459498,0.00023618957,0.00011893075,0.052833524],"genre_scores_gemma":[0.95784736,0.0023818624,0.037032943,0.0001455999,0.0003931509,0.00014497514,0.00010585055,0.000038278475,0.001909929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954366,0.002299598,0.0002906636,0.00067806325,0.0010810168,0.00021406022],"domain_scores_gemma":[0.85639507,0.12508655,0.007147052,0.0028608292,0.0065665366,0.0019440164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014551728,0.0008646709,0.0011837673,0.0044392366,0.001506056,0.006512033,0.0020772754,0.0016576824,0.005036092],"category_scores_gemma":[0.06394548,0.0007125332,0.0010324809,0.0031149462,0.006274833,0.01398477,0.0030303062,0.0031421294,0.00031340244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036198668,0.000047318343,0.0014163239,0.00007464431,0.000035115314,0.000032216587,0.00031291612,0.007081609,0.0002965935,0.9804432,0.00034014502,0.009883702],"study_design_scores_gemma":[0.000014282749,0.000046358713,0.0009851292,0.000039497925,0.00002941505,0.00006969701,0.00018399354,0.052085508,0.00024002795,0.94576293,0.00052324735,0.000019962112],"about_ca_topic_score_codex":0.00055945304,"about_ca_topic_score_gemma":0.0006753494,"teacher_disagreement_score":0.014551728,"about_ca_system_score_codex":0.002116496,"about_ca_system_score_gemma":0.001530144,"threshold_uncertainty_score":0.07695782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034183215,0.003611866,0.8671696,0.003248191,0.00025982616,0.00019596964,0.0009861009,0.0005413569,0.08980378],"genre_scores_gemma":[0.6797732,0.006742368,0.2720852,0.0018263838,0.0009953722,0.0010629941,0.0022309816,0.0005109371,0.034772538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873155,0.0003170543,0.000071200164,0.00029225796,0.00041917438,0.00016871997],"domain_scores_gemma":[0.9960296,0.0027264855,0.00026378426,0.00034956404,0.0003809878,0.00024945528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049181,0.0008359437,0.0010950702,0.0030984106,0.002597305,0.004652689,0.0016703614,0.001480372,0.011279717],"category_scores_gemma":[0.008698086,0.0007553473,0.0021723474,0.0033474283,0.0036228471,0.009071692,0.0031521956,0.004808778,0.0018427611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035572311,0.0000054046477,0.00005788564,0.000017769966,0.000004573237,0.000017820403,0.000118162636,0.0010191319,0.00007188022,0.99453604,0.0008582798,0.0032894954],"study_design_scores_gemma":[0.000005553466,0.0000042346765,0.000042864674,0.000009349038,0.0000031594118,0.00002742421,0.000025092631,0.00471235,0.00005232747,0.9919098,0.0032046253,0.000003168464],"about_ca_topic_score_codex":0.002541359,"about_ca_topic_score_gemma":0.0018446601,"teacher_disagreement_score":0.011279717,"about_ca_system_score_codex":0.0027973093,"about_ca_system_score_gemma":0.00087450974,"threshold_uncertainty_score":0.03773445},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2549553,0.0016736473,0.063791536,0.011209232,0.001184574,0.0011395518,0.0011874622,0.00042499986,0.66443366],"genre_scores_gemma":[0.86062497,0.0005309346,0.02210443,0.0032727967,0.00015316946,0.001047767,0.0011404085,0.00007264223,0.11105288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768674,0.0011904002,0.00005056931,0.0001988888,0.000504405,0.000369058],"domain_scores_gemma":[0.997279,0.00122933,0.0001323278,0.00017273898,0.00031183648,0.0008747898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021349937,0.0006684185,0.0007046124,0.00049128896,0.0018358782,0.0020531914,0.0012442648,0.0023413117,0.016683193],"category_scores_gemma":[0.008821968,0.00023851622,0.0004460812,0.0004527265,0.0020037633,0.0020845116,0.002188218,0.0022847827,0.0022130115],"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.0017142354,0.00059618894,0.001450293,0.00022904367,0.00008462623,0.0010454336,0.0016013228,0.019917954,0.003377241,0.80194455,0.11776281,0.050276306],"study_design_scores_gemma":[0.0008688452,0.0010844037,0.0036795381,0.00024604253,0.000034320754,0.00059710385,0.0019225237,0.09778941,0.0021136317,0.59470576,0.29675788,0.00020056487],"about_ca_topic_score_codex":0.006092426,"about_ca_topic_score_gemma":0.014254523,"teacher_disagreement_score":0.016683193,"about_ca_system_score_codex":0.0017342329,"about_ca_system_score_gemma":0.0022206667,"threshold_uncertainty_score":0.05581081},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29328373,0.00087615027,0.5478939,0.0049188207,0.00033392903,0.00026374325,0.0008279772,0.0005860525,0.15101571],"genre_scores_gemma":[0.9485375,0.00032584413,0.024979439,0.00034872018,0.00014979093,0.00010538314,0.0001570661,0.000046687906,0.025349522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966223,0.0013918671,0.00013316172,0.00090098934,0.000574246,0.00037739446],"domain_scores_gemma":[0.9753818,0.015141313,0.0024011405,0.0035450615,0.0019752611,0.0015554146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043993816,0.0006496846,0.0014999643,0.0012786295,0.0019129888,0.005407715,0.002333416,0.003911874,0.017602477],"category_scores_gemma":[0.029567996,0.00067331054,0.0005507106,0.0011642877,0.003204714,0.009226903,0.0025971541,0.002577874,0.0018237656],"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.00038934528,0.00008394261,0.0011185386,0.000094217154,0.00004372055,0.0002396608,0.00027167826,0.044489753,0.0010269055,0.9229956,0.0048807343,0.024365889],"study_design_scores_gemma":[0.000054018252,0.000057785077,0.000294821,0.000021613267,0.000017094144,0.00016884223,0.00009371808,0.06739938,0.00025054536,0.92727363,0.0043480415,0.000020534011],"about_ca_topic_score_codex":0.0010436062,"about_ca_topic_score_gemma":0.0013751031,"teacher_disagreement_score":0.017602477,"about_ca_system_score_codex":0.0014372331,"about_ca_system_score_gemma":0.0012459803,"threshold_uncertainty_score":0.05888611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60536546,0.0014885425,0.37016943,0.0025901292,0.00023609972,0.0001612978,0.0002135554,0.00027129764,0.019504128],"genre_scores_gemma":[0.98317057,0.0005244901,0.010200051,0.000120570076,0.00013586409,0.00011013548,0.00007090796,0.00004608818,0.0056212423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965497,0.0016723701,0.00022385572,0.00045500783,0.0005566089,0.0005425242],"domain_scores_gemma":[0.904195,0.08573122,0.004643906,0.0021643199,0.0015262596,0.0017392166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060691894,0.0008119406,0.0031699752,0.0017168884,0.0010495057,0.0041493736,0.0029242227,0.0037649935,0.0072480165],"category_scores_gemma":[0.045773003,0.001213492,0.0013230483,0.0014841761,0.0027246885,0.005985559,0.0015911123,0.0034513613,0.0004097719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055455195,0.0002958654,0.003952858,0.00025829204,0.00026776257,0.0005288222,0.00064998615,0.15195905,0.0022507417,0.81240654,0.0025685236,0.02430703],"study_design_scores_gemma":[0.0001178442,0.00010641211,0.0019331693,0.000025998148,0.00010150816,0.00021888783,0.00020148954,0.33137017,0.00029537376,0.66490746,0.00065687747,0.00006482238],"about_ca_topic_score_codex":0.0021622747,"about_ca_topic_score_gemma":0.0020272348,"teacher_disagreement_score":0.0072480165,"about_ca_system_score_codex":0.0018722472,"about_ca_system_score_gemma":0.0011195616,"threshold_uncertainty_score":0.03209728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025304472,0.00022934012,0.9649879,0.00056324125,0.00005962196,0.00006004776,0.0001555159,0.00012349845,0.0085164],"genre_scores_gemma":[0.8158409,0.0004618611,0.1744067,0.00014533533,0.00008170227,0.00033434047,0.0002771899,0.000078667676,0.008373341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984869,0.0009412815,0.000051009676,0.00015020913,0.00026253035,0.00010794156],"domain_scores_gemma":[0.9962698,0.00281418,0.00030322402,0.00014831072,0.00029334344,0.00017112774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019226667,0.00089692394,0.0013509078,0.0013832597,0.0007093979,0.0029502807,0.0021672556,0.0017501486,0.008204104],"category_scores_gemma":[0.006837205,0.0005718297,0.0007989401,0.0022602084,0.0010579918,0.003769897,0.0010510755,0.0015370359,0.0007280102],"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.000107534164,0.00007274939,0.00019263593,0.000103168124,0.000048711427,0.00010930625,0.0002575842,0.52629656,0.0007037767,0.4570283,0.0016295355,0.013450206],"study_design_scores_gemma":[0.000011058095,0.000013754843,0.000028783958,0.0000061995806,0.0000062218396,0.000011642832,0.00002812375,0.88444406,0.000080134225,0.114943296,0.0004184975,0.000008123713],"about_ca_topic_score_codex":0.005222018,"about_ca_topic_score_gemma":0.003902139,"teacher_disagreement_score":0.008204104,"about_ca_system_score_codex":0.0014552168,"about_ca_system_score_gemma":0.0011193894,"threshold_uncertainty_score":0.027445436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747777,0.0011195813,0.10344977,0.011264061,0.0001413244,0.00027038914,0.00029800856,0.00009300537,0.13558689],"genre_scores_gemma":[0.9956507,0.00013635184,0.0014227353,0.00014080292,0.00001470496,0.000036119236,0.000018392022,0.0000042127285,0.0025759975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989004,0.00058732706,0.000034675886,0.00011157936,0.00015901469,0.00020701879],"domain_scores_gemma":[0.99606425,0.0024614988,0.0006006204,0.00032419618,0.00029335983,0.0002561064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339488,0.00064595666,0.0008367299,0.0010840446,0.0018116893,0.0029542996,0.0020347743,0.0025465714,0.005542369],"category_scores_gemma":[0.005857136,0.00039075396,0.0007673396,0.00085960515,0.0055281976,0.0035639987,0.0018585117,0.002295972,0.00028871544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013059018,0.000078647245,0.0050551575,0.000114122195,0.00007816845,0.0013761257,0.0043723634,0.14559276,0.0008318636,0.8341258,0.002077416,0.0061670085],"study_design_scores_gemma":[0.000099696415,0.00014566712,0.0048902733,0.0001201924,0.00009291089,0.0003423561,0.0027003991,0.70262706,0.0005093202,0.28087655,0.007457833,0.00013776119],"about_ca_topic_score_codex":0.043727815,"about_ca_topic_score_gemma":0.023948394,"teacher_disagreement_score":0.043727815,"about_ca_system_score_codex":0.00570525,"about_ca_system_score_gemma":0.0022428199,"threshold_uncertainty_score":0.08694661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011304115,0.00041273545,0.9781466,0.0004531389,0.000058245256,0.000049770133,0.000040042793,0.000039997645,0.009495333],"genre_scores_gemma":[0.5743497,0.0012952082,0.41700163,0.00033919362,0.00016649115,0.0003600665,0.000111463276,0.00006330408,0.006312859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620026,0.0023442495,0.00017512526,0.00040243156,0.00063511234,0.00024282241],"domain_scores_gemma":[0.994574,0.0038807662,0.00043825357,0.00047065163,0.0004233074,0.00021315328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037205014,0.0009812261,0.0011074044,0.0016332173,0.0012916563,0.0040539894,0.0029590898,0.0015670118,0.004569199],"category_scores_gemma":[0.009972317,0.0008079862,0.002173126,0.0030532673,0.004441351,0.0048532886,0.002705443,0.00281888,0.00038387024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014624792,0.000022690456,0.00013657838,0.000076637785,0.000037249072,0.000041264324,0.00016024103,0.06236351,0.00043445372,0.9297686,0.00031799002,0.0066261166],"study_design_scores_gemma":[0.000010669211,0.00001235763,0.000050811297,0.000019093894,0.000015363707,0.000035802488,0.000053540447,0.16351652,0.00028774925,0.8346014,0.0013818472,0.000014806404],"about_ca_topic_score_codex":0.0031674015,"about_ca_topic_score_gemma":0.0018666959,"teacher_disagreement_score":0.004569199,"about_ca_system_score_codex":0.0023359915,"about_ca_system_score_gemma":0.0020002478,"threshold_uncertainty_score":0.019676149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22760384,0.0007492312,0.7645523,0.0019312056,0.00009145177,0.00014971489,0.0001073909,0.00039853365,0.0044163577],"genre_scores_gemma":[0.9673616,0.00014634874,0.031288356,0.00010300269,0.00006490273,0.000057686826,0.000034296674,0.000028429744,0.00091531186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915154,0.0049381447,0.00033333813,0.001325554,0.0012483663,0.00063912204],"domain_scores_gemma":[0.92182314,0.057758685,0.007749621,0.008077905,0.002962647,0.0016280354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009837911,0.000676751,0.0014505929,0.0009862342,0.0013672861,0.0033340394,0.0020570457,0.0022383162,0.0015925423],"category_scores_gemma":[0.054899003,0.0006646066,0.0008474668,0.0013893301,0.0028688535,0.0059686373,0.0022987635,0.0023779823,0.00023456661],"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.0012129555,0.00063117436,0.0282762,0.00028501247,0.000353935,0.00097196427,0.0010951782,0.6216151,0.0057082493,0.17879902,0.0022544386,0.15879682],"study_design_scores_gemma":[0.000041344225,0.00018943386,0.0021613,0.00001692176,0.00005030438,0.00017014994,0.00011733009,0.93110096,0.0015853307,0.06378727,0.0007314307,0.000048233705],"about_ca_topic_score_codex":0.003169608,"about_ca_topic_score_gemma":0.0025934698,"teacher_disagreement_score":0.009837911,"about_ca_system_score_codex":0.0020422847,"about_ca_system_score_gemma":0.0012916329,"threshold_uncertainty_score":0.052028477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014908332,0.00020515679,0.96429926,0.00088642276,0.000030380888,0.00011659565,0.00011486619,0.00020735252,0.019231677],"genre_scores_gemma":[0.30707425,0.00025232456,0.6874529,0.0002127304,0.000042833795,0.00033319043,0.00016141227,0.00006799298,0.0044023125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764484,0.0011010987,0.000172973,0.0002844159,0.0006299094,0.00016677825],"domain_scores_gemma":[0.99516124,0.002569412,0.00028060854,0.00064431696,0.0008688376,0.00047561037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028037427,0.00056154834,0.0006868656,0.0013007326,0.0012441096,0.0029657898,0.0015481233,0.001422785,0.0059939087],"category_scores_gemma":[0.010797929,0.000678067,0.0008954812,0.0010400331,0.0021824683,0.0045102593,0.0020130859,0.003252907,0.0009854429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040876585,0.0000592061,0.00048669594,0.000083168714,0.000018973264,0.00004580786,0.00047404694,0.022134606,0.0013981039,0.93802255,0.0017263216,0.0355097],"study_design_scores_gemma":[0.000029854626,0.000038808248,0.0001850813,0.000041131236,0.00001530189,0.000033719763,0.00010260302,0.17179982,0.00042243933,0.82430977,0.0030048464,0.00001665039],"about_ca_topic_score_codex":0.0029807237,"about_ca_topic_score_gemma":0.0044012493,"teacher_disagreement_score":0.0059939087,"about_ca_system_score_codex":0.0017154277,"about_ca_system_score_gemma":0.0019744667,"threshold_uncertainty_score":0.020051599},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067009907,0.76140845,0.19980933,0.0018500547,0.00059811946,0.000095997006,0.000118842705,0.00013003801,0.029288175],"genre_scores_gemma":[0.21094526,0.6999224,0.07864216,0.0006903394,0.0023380602,0.00023474764,0.0003476161,0.00008547189,0.0067940345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987871,0.0004220065,0.00011540597,0.00018994468,0.00041625413,0.00006932225],"domain_scores_gemma":[0.997806,0.00161246,0.00011709458,0.00010329373,0.0002865289,0.00007460901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015779473,0.0010707934,0.0016775612,0.002279967,0.0004391186,0.0022568742,0.0015585856,0.001327021,0.0024419285],"category_scores_gemma":[0.002642789,0.00066062063,0.0011969735,0.0032358938,0.0013137376,0.002595907,0.0010913429,0.0017986234,0.0009855522],"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.000046700177,0.0002221079,0.0019368846,0.005572342,0.0003195794,0.00029057675,0.00038501885,0.05174239,0.0011128057,0.60850817,0.012121399,0.31774196],"study_design_scores_gemma":[0.000031205447,0.00017059,0.0017986031,0.0018302465,0.000107386695,0.00082933076,0.00026216308,0.09474451,0.0006467334,0.69829106,0.20119393,0.00009425539],"about_ca_topic_score_codex":0.0020015074,"about_ca_topic_score_gemma":0.0010986405,"teacher_disagreement_score":0.0024419285,"about_ca_system_score_codex":0.001444544,"about_ca_system_score_gemma":0.0010330038,"threshold_uncertainty_score":0.010481},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000755049,0.01492196,0.005064675,0.03608089,0.86409557,0.00013722561,0.001947036,0.00034188398,0.076655746],"genre_scores_gemma":[0.010117823,0.01645808,0.0032384212,0.010765971,0.503052,0.00025897397,0.0040721567,0.00091217767,0.4511244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989705,0.00014650551,0.00008907985,0.00017480052,0.0004950903,0.0001240646],"domain_scores_gemma":[0.9942614,0.000936051,0.00021854554,0.00039965913,0.0031584224,0.0010258689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018184044,0.0014996029,0.0015065008,0.0046937717,0.0017313821,0.004400232,0.0018227857,0.0028633645,0.10722554],"category_scores_gemma":[0.008081734,0.00041518852,0.00122954,0.002802058,0.00066867523,0.003382298,0.0021304837,0.003941144,0.05494021],"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.000019300614,0.000018924708,0.000045709938,0.00009159157,0.0000048446163,0.00001872518,0.000009086956,0.00016807162,0.000090865105,0.0018702776,0.9816668,0.015995655],"study_design_scores_gemma":[0.000012542775,0.000026841673,0.0006109795,0.0002151804,0.000010746744,0.000057708487,0.000028216886,0.0004342268,0.00016230607,0.00606054,0.9923673,0.000013297226],"about_ca_topic_score_codex":0.0035787087,"about_ca_topic_score_gemma":0.004838023,"teacher_disagreement_score":0.10722554,"about_ca_system_score_codex":0.0026307066,"about_ca_system_score_gemma":0.0028516445,"threshold_uncertainty_score":0.35870516},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013946641,0.00092105253,0.9059965,0.004706197,0.00019829092,0.00013480008,0.000058581598,0.000062925894,0.07397512],"genre_scores_gemma":[0.7985757,0.0011361727,0.19081743,0.00046624694,0.00022977106,0.0006049944,0.00007983783,0.000058020698,0.008031785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876264,0.008201299,0.0004865176,0.00082025817,0.0022941842,0.00057141454],"domain_scores_gemma":[0.978799,0.015881594,0.0010984595,0.0021469004,0.0016214683,0.00045261203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01151529,0.00084333593,0.0012673753,0.0016709404,0.002024569,0.0054275324,0.0030890692,0.0027524987,0.008630778],"category_scores_gemma":[0.030922772,0.0006379329,0.0015684464,0.0022569345,0.010095569,0.0066984165,0.004021361,0.003534034,0.0007149765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000472014,0.000012788684,0.00006484728,0.00002446299,0.000011769427,0.000008124967,0.00014871843,0.005415946,0.00004144909,0.9905359,0.00023237454,0.003498879],"study_design_scores_gemma":[0.000008950468,0.00000951768,0.000042944062,0.00002846996,0.000007257143,0.000011313417,0.00009766229,0.02267784,0.000090188834,0.97471285,0.002307303,0.000005665916],"about_ca_topic_score_codex":0.0042903502,"about_ca_topic_score_gemma":0.0023231239,"teacher_disagreement_score":0.01151529,"about_ca_system_score_codex":0.004187446,"about_ca_system_score_gemma":0.0062859543,"threshold_uncertainty_score":0.060899377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10701518,0.0010633828,0.86413723,0.0032375474,0.00026685436,0.00024258422,0.00085158204,0.00019866748,0.022986874],"genre_scores_gemma":[0.9250876,0.0013627198,0.053081322,0.00058663473,0.00035732263,0.00060763006,0.00046774885,0.00007040164,0.01837868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99015594,0.005124222,0.00057087716,0.0012122545,0.0018649561,0.0010718462],"domain_scores_gemma":[0.97133,0.023935596,0.0015085987,0.00096917985,0.0011665894,0.0010899453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007523875,0.002641727,0.0054032784,0.001815923,0.0012001845,0.0070129414,0.0043476545,0.003361305,0.005486097],"category_scores_gemma":[0.028648231,0.0018654278,0.0019364929,0.0020979363,0.00457343,0.009270277,0.004447953,0.0035756207,0.0006316945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032024525,0.00013640815,0.00045592143,0.00024642565,0.00018700238,0.00023404296,0.00014781217,0.16142994,0.000671568,0.82532823,0.001754482,0.0090879435],"study_design_scores_gemma":[0.000101642814,0.000084772655,0.00014855251,0.000033759035,0.000060712686,0.00008068015,0.000050831364,0.34193763,0.00031360248,0.6563331,0.0008033488,0.000051444087],"about_ca_topic_score_codex":0.0021184818,"about_ca_topic_score_gemma":0.0019196622,"teacher_disagreement_score":0.007523875,"about_ca_system_score_codex":0.0028974065,"about_ca_system_score_gemma":0.0031576904,"threshold_uncertainty_score":0.03979057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15019776,0.0005975743,0.7907757,0.003995113,0.000096006785,0.00024358578,0.0003107065,0.00021922459,0.053564396],"genre_scores_gemma":[0.92401713,0.0007622152,0.052398827,0.00034590694,0.00013427068,0.00045265045,0.00015486212,0.00009179127,0.02164232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977835,0.0012299524,0.000062043284,0.0002537313,0.0003154802,0.00035529133],"domain_scores_gemma":[0.98613715,0.011276762,0.0009328587,0.0003669276,0.00070958945,0.00057678676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032615333,0.0012427357,0.0015379632,0.0014518186,0.001425186,0.004578002,0.0024175674,0.0028904565,0.006060603],"category_scores_gemma":[0.0168225,0.00089237996,0.0009724309,0.0012602708,0.0029736143,0.005046657,0.0024298897,0.0025083416,0.0006013666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010922918,0.000072896655,0.0003357899,0.000096974574,0.000034494646,0.00011413165,0.00019091468,0.12898909,0.00052892225,0.86170584,0.0026595134,0.0051620975],"study_design_scores_gemma":[0.00003975747,0.000028464017,0.00008093524,0.00002442312,0.000016723288,0.000053899745,0.00011778614,0.40554458,0.00026240657,0.5927373,0.0010798078,0.000013888616],"about_ca_topic_score_codex":0.002454285,"about_ca_topic_score_gemma":0.0022890072,"teacher_disagreement_score":0.006060603,"about_ca_system_score_codex":0.002825051,"about_ca_system_score_gemma":0.0014854925,"threshold_uncertainty_score":0.020497262},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22967552,0.0006428455,0.63648695,0.010530044,0.0005098977,0.0002958453,0.00039713868,0.00024785154,0.12121392],"genre_scores_gemma":[0.94235057,0.00035350764,0.040357694,0.00043503958,0.0003064306,0.00038610393,0.00011711935,0.000056911133,0.015636643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968821,0.0018731322,0.00016376426,0.000371401,0.0005147602,0.0001948995],"domain_scores_gemma":[0.9818158,0.013113941,0.0012970235,0.0016252487,0.0008463856,0.0013016332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002878117,0.00060397206,0.0010358173,0.0018464881,0.0015981239,0.005059593,0.0015945391,0.002785806,0.011250245],"category_scores_gemma":[0.017297719,0.00052440865,0.0008362273,0.0011379382,0.005164479,0.009244583,0.003295663,0.0022515901,0.0005084203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013055651,0.000021711174,0.00055009377,0.000025928433,0.000012129198,0.000082466264,0.000103279934,0.007139741,0.00014725588,0.9891482,0.0007166646,0.0020395461],"study_design_scores_gemma":[0.000012246492,0.000010740683,0.00020722835,0.0000108883405,0.000005431431,0.000060780465,0.00015831726,0.04547144,0.00004247379,0.9528121,0.0012004855,0.000007832711],"about_ca_topic_score_codex":0.000854956,"about_ca_topic_score_gemma":0.0010713985,"teacher_disagreement_score":0.011250245,"about_ca_system_score_codex":0.0015797181,"about_ca_system_score_gemma":0.0010549095,"threshold_uncertainty_score":0.037635863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20654859,0.0024199416,0.45388848,0.013589733,0.0003766082,0.00012435432,0.00016362945,0.00011140462,0.3227773],"genre_scores_gemma":[0.9779187,0.00065051997,0.008658001,0.00021496417,0.000118794436,0.00006344313,0.0000361066,0.000012739271,0.012326767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984407,0.0008063583,0.00006127326,0.00019912377,0.00028521777,0.00020738719],"domain_scores_gemma":[0.99024814,0.0077435467,0.00070669607,0.00043388008,0.0004775722,0.00039001586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019973817,0.00047790076,0.00063373696,0.0007824908,0.0008264828,0.0039583053,0.0007986028,0.0019745005,0.008349463],"category_scores_gemma":[0.012533419,0.000293221,0.0004551894,0.0008332617,0.003770463,0.0053882333,0.0018222444,0.0018983297,0.00058402476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002062674,0.000026416696,0.00022628704,0.000028200402,0.000011564308,0.00004126928,0.00017062368,0.0080051515,0.00015027646,0.9849858,0.0005878646,0.0057459706],"study_design_scores_gemma":[0.000009415495,0.000010573825,0.00011132047,0.000009629956,0.000004431932,0.000023486991,0.00007527473,0.014575579,0.00006009053,0.98383254,0.001281132,0.0000065506706],"about_ca_topic_score_codex":0.0013351528,"about_ca_topic_score_gemma":0.0010143187,"teacher_disagreement_score":0.008349463,"about_ca_system_score_codex":0.0018016187,"about_ca_system_score_gemma":0.0015017878,"threshold_uncertainty_score":0.02793169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41427028,0.032698613,0.41850543,0.009806538,0.0006079779,0.00015741085,0.0004325326,0.00021206867,0.1233092],"genre_scores_gemma":[0.96812683,0.0058645257,0.019895412,0.00019582282,0.00031449436,0.00010471779,0.000102035956,0.00002009096,0.0053759944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880457,0.00041539487,0.00008235662,0.00021339754,0.00035877543,0.00012549912],"domain_scores_gemma":[0.99246186,0.005976084,0.0006673549,0.000289197,0.00040788949,0.00019754065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010094206,0.00034673707,0.00060277624,0.0013154311,0.00079917954,0.0029418669,0.0007224174,0.0010206748,0.0014836723],"category_scores_gemma":[0.007568579,0.00031899245,0.0007344711,0.0010163616,0.003257564,0.0041658347,0.001072576,0.0014877241,0.00012842558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001552213,0.000009682527,0.0006325052,0.000101259095,0.000024949346,0.000120750345,0.00022363862,0.027549962,0.00072211225,0.96231943,0.0005450007,0.007735244],"study_design_scores_gemma":[0.0000042033203,0.000011452254,0.00046055703,0.000026424432,0.00000685143,0.00009944308,0.00005044887,0.035685074,0.00017686156,0.9604837,0.0029826383,0.0000122555575],"about_ca_topic_score_codex":0.001210054,"about_ca_topic_score_gemma":0.0005954303,"teacher_disagreement_score":0.0029418669,"about_ca_system_score_codex":0.0018197491,"about_ca_system_score_gemma":0.00055112276,"threshold_uncertainty_score":0.013203263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23075916,0.000281313,0.60013247,0.0029056824,0.00018918658,0.00018118642,0.00045274518,0.0003878293,0.16471049],"genre_scores_gemma":[0.9086948,0.00017755342,0.077002294,0.00023015124,0.000046807007,0.0001397627,0.00016795004,0.00007552665,0.0134651605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905664,0.00040130297,0.000050665072,0.000119707176,0.00023245112,0.0001392998],"domain_scores_gemma":[0.99779284,0.0011011792,0.00024110192,0.00042194375,0.00030740947,0.0001355363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015253666,0.000304442,0.00080911524,0.00070276554,0.0014747677,0.0019338755,0.0014448625,0.0021687052,0.006834168],"category_scores_gemma":[0.007222677,0.00035937366,0.0006884493,0.0010812151,0.0015199591,0.002184859,0.0017212337,0.0014908101,0.00041529204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004739104,0.000034906723,0.00051760173,0.000031066465,0.00001835374,0.00037271247,0.00023347275,0.011271813,0.001823445,0.9799064,0.0011583803,0.0045844135],"study_design_scores_gemma":[0.000048302638,0.00003515087,0.00047865242,0.000017556415,0.000016043272,0.00042011592,0.00014401923,0.084123366,0.0011986356,0.9065682,0.0069307922,0.000019220353],"about_ca_topic_score_codex":0.0014202712,"about_ca_topic_score_gemma":0.0009766053,"teacher_disagreement_score":0.006834168,"about_ca_system_score_codex":0.00060189446,"about_ca_system_score_gemma":0.0008228198,"threshold_uncertainty_score":0.022862613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17803842,0.0005130932,0.78352565,0.001537314,0.00008373972,0.00019792093,0.0005072309,0.00012716273,0.0354694],"genre_scores_gemma":[0.6411413,0.0008957385,0.33576566,0.00044153852,0.00017319481,0.0008959221,0.0012453852,0.00015995766,0.01928133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795973,0.001004952,0.00014400168,0.000284443,0.00034172015,0.00026530708],"domain_scores_gemma":[0.9946374,0.0035935054,0.00047235982,0.0003502412,0.0004960698,0.00045028253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391277,0.0013376838,0.002399737,0.0021495086,0.0019602645,0.0043814816,0.0024520666,0.0027340918,0.0092141135],"category_scores_gemma":[0.010443061,0.0009834259,0.0014849579,0.0027102395,0.0024059366,0.007825424,0.0037602065,0.003978168,0.0009251094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017530686,0.00015082794,0.0005982726,0.00015669406,0.000041605053,0.00007778127,0.00022535601,0.021672128,0.0009463091,0.9517437,0.0025044226,0.021707535],"study_design_scores_gemma":[0.000026027836,0.00003099365,0.00014347374,0.000024060842,0.000007944373,0.000053896376,0.000066425,0.04430722,0.0002875067,0.9542878,0.0007525941,0.000011984097],"about_ca_topic_score_codex":0.00055437314,"about_ca_topic_score_gemma":0.0006941791,"teacher_disagreement_score":0.0092141135,"about_ca_system_score_codex":0.00084457884,"about_ca_system_score_gemma":0.0014805088,"threshold_uncertainty_score":0.030824244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057017347,0.00009333024,0.9860452,0.00007511479,0.000019889452,0.00010731146,0.000112760536,0.00008322342,0.007761465],"genre_scores_gemma":[0.09841442,0.0003910157,0.890892,0.00017129796,0.0001182712,0.00058345764,0.00062268076,0.00011047305,0.008696372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810624,0.00058899744,0.00013764948,0.0003925092,0.00062806235,0.00014643294],"domain_scores_gemma":[0.99761873,0.0014080092,0.00014417365,0.00029427645,0.0004323406,0.00010253146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018232898,0.0011905046,0.0013787833,0.0032174354,0.000982576,0.001900485,0.0017296012,0.0010033399,0.009427816],"category_scores_gemma":[0.008431204,0.0005874022,0.0019753275,0.0025199915,0.0020326066,0.0057692816,0.0025216353,0.0035805495,0.0018992018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007233218,0.00011161458,0.00087679387,0.00020161316,0.000028511935,0.0001266241,0.00052739016,0.03381333,0.0037857562,0.8581997,0.0018031771,0.100453086],"study_design_scores_gemma":[0.00002274891,0.00015087744,0.00039439875,0.00007815045,0.000023491597,0.0002719184,0.00013724597,0.14458245,0.0028117264,0.83559036,0.015893945,0.000042636115],"about_ca_topic_score_codex":0.0009114896,"about_ca_topic_score_gemma":0.0010498301,"teacher_disagreement_score":0.009427816,"about_ca_system_score_codex":0.00083296676,"about_ca_system_score_gemma":0.0009822367,"threshold_uncertainty_score":0.0315392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54288703,0.0066387756,0.37828618,0.0075220116,0.00036400967,0.000143378,0.00013256252,0.000132884,0.06389314],"genre_scores_gemma":[0.9877293,0.0006647456,0.007892475,0.0000926903,0.000097768636,0.0000792516,0.000013221909,0.000010139929,0.0034203925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964567,0.0024161246,0.00013625674,0.00029585251,0.00040700132,0.0002880503],"domain_scores_gemma":[0.9785589,0.01831139,0.0016725558,0.00050810137,0.0004777805,0.00047121433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041936305,0.0007768413,0.0015002514,0.0007240964,0.0010193168,0.002977949,0.0013188054,0.0029271746,0.0025181868],"category_scores_gemma":[0.022265172,0.0005755605,0.00075232337,0.0006114475,0.0068353624,0.005141096,0.0019119285,0.0018733231,0.00019150451],"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.00020471524,0.000066641245,0.0011898953,0.00014270385,0.000078252255,0.0003150533,0.0007724473,0.10223217,0.0006715018,0.8811625,0.0013251633,0.011839116],"study_design_scores_gemma":[0.00006253861,0.000052251715,0.00041635503,0.000024767935,0.000021886617,0.000095228024,0.00015303509,0.12254612,0.00013686327,0.87572294,0.00073844346,0.000029487805],"about_ca_topic_score_codex":0.002285846,"about_ca_topic_score_gemma":0.0011999552,"teacher_disagreement_score":0.0041936305,"about_ca_system_score_codex":0.0014270432,"about_ca_system_score_gemma":0.0013479571,"threshold_uncertainty_score":0.022178292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14956592,0.0005622284,0.7753756,0.0035735313,0.00024445492,0.00011973627,0.00016723355,0.0002219818,0.07016936],"genre_scores_gemma":[0.9617335,0.000249166,0.0210676,0.0001689982,0.00009054298,0.00014451376,0.000046607172,0.000035371657,0.01646375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982534,0.00088193006,0.00006348267,0.00036278347,0.00023026671,0.00020816537],"domain_scores_gemma":[0.99347323,0.0047733416,0.00054260954,0.0004940747,0.0002649236,0.00045178883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022825848,0.00065075787,0.0013178907,0.0005046002,0.0005498438,0.0021982025,0.0013317202,0.0017007913,0.0074409377],"category_scores_gemma":[0.011036104,0.0004814654,0.0006792908,0.0006382589,0.0023185683,0.0028746773,0.0020196366,0.0015269818,0.000637615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104515704,0.0000921793,0.0006382593,0.00006518706,0.000058423102,0.00013094526,0.0001780407,0.22571626,0.0006116476,0.7535851,0.0021154948,0.016703857],"study_design_scores_gemma":[0.000043703716,0.000047147943,0.00027984453,0.000010144306,0.000015490923,0.000040179937,0.00005910486,0.3216525,0.0001604623,0.6761566,0.001520858,0.000014056814],"about_ca_topic_score_codex":0.0012658342,"about_ca_topic_score_gemma":0.0009321603,"teacher_disagreement_score":0.0074409377,"about_ca_system_score_codex":0.0012702849,"about_ca_system_score_gemma":0.0010660808,"threshold_uncertainty_score":0.02489239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45176333,0.002228698,0.2135693,0.14883779,0.0022580463,0.00022186924,0.00055981945,0.0005062076,0.18005492],"genre_scores_gemma":[0.95926344,0.00033159615,0.005159925,0.004528893,0.00040222,0.00009840797,0.000046428366,0.00009708781,0.030072046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554235,0.0021434885,0.00015305044,0.00069868175,0.0005866583,0.0008757426],"domain_scores_gemma":[0.97525465,0.015373936,0.0022860263,0.0036712014,0.0013413804,0.0020727862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012246062,0.00051821134,0.0015328235,0.0007474935,0.0020583596,0.005367933,0.0019282785,0.0048667523,0.019494869],"category_scores_gemma":[0.06517582,0.000577519,0.0009708525,0.00064105826,0.0057947496,0.007606338,0.0047991374,0.0074158777,0.0027053722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013741854,0.00023029245,0.0070044035,0.00012545502,0.00012477394,0.0005102201,0.0021235396,0.010129569,0.001447125,0.86564845,0.022693526,0.08858838],"study_design_scores_gemma":[0.00011303144,0.0002629135,0.0028913994,0.000083851046,0.00004507079,0.00020570161,0.0012373858,0.023915475,0.00058322237,0.95849365,0.012127013,0.00004120668],"about_ca_topic_score_codex":0.0010834675,"about_ca_topic_score_gemma":0.00069200894,"teacher_disagreement_score":0.019494869,"about_ca_system_score_codex":0.0017372271,"about_ca_system_score_gemma":0.0018958739,"threshold_uncertainty_score":0.06521678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25902006,0.0022670208,0.47594246,0.010073904,0.00045136997,0.00017361515,0.00024743789,0.00007939521,0.25174466],"genre_scores_gemma":[0.9695097,0.00028819876,0.022510344,0.00024414688,0.00010792704,0.00006867094,0.000055168017,0.0000146480725,0.007201218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611276,0.002146983,0.00022238032,0.0003268296,0.00081206154,0.00037895003],"domain_scores_gemma":[0.9914944,0.0057328506,0.00058388116,0.00052983145,0.00096943893,0.0006895723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005241792,0.00044152286,0.0006872437,0.0016214541,0.0018259552,0.0048373295,0.000892176,0.0016732757,0.0111424],"category_scores_gemma":[0.020086585,0.0006332513,0.00063591084,0.0019020992,0.003125575,0.007967681,0.0018268427,0.0023820752,0.0005617151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006215677,0.00003486622,0.00041915767,0.000035126614,0.000025721416,0.00009882866,0.000601912,0.0021555235,0.00022627824,0.9856645,0.00085515296,0.009820819],"study_design_scores_gemma":[0.000017616734,0.00001543079,0.00020370654,0.000013335528,0.000012743211,0.00008820136,0.0003971127,0.0052751894,0.00013688489,0.99157834,0.0022537864,0.000007666265],"about_ca_topic_score_codex":0.0008387004,"about_ca_topic_score_gemma":0.0007241902,"teacher_disagreement_score":0.0111424,"about_ca_system_score_codex":0.0015859046,"about_ca_system_score_gemma":0.0008842924,"threshold_uncertainty_score":0.037275076},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3154611,0.0009950332,0.31510234,0.014727835,0.00023337702,0.0003305197,0.0003862965,0.00023164897,0.35253185],"genre_scores_gemma":[0.9713378,0.00028017306,0.01051811,0.0003073158,0.00007160241,0.00010222725,0.000055437908,0.00001612849,0.017311227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868625,0.00053867366,0.00003799499,0.00026529699,0.00024258388,0.0002291861],"domain_scores_gemma":[0.9972837,0.0011407249,0.00067712384,0.00028296397,0.000252655,0.00036282078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018027005,0.000563836,0.0005477103,0.000893779,0.0009981223,0.0026983428,0.0011073274,0.001913629,0.014785269],"category_scores_gemma":[0.008857292,0.00028827286,0.0005931858,0.0006098014,0.0022253797,0.0027488323,0.0017410286,0.0011854266,0.0014672218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010342171,0.00006396163,0.005311997,0.000042351352,0.00003356824,0.00044404544,0.0010115915,0.029078113,0.0010301116,0.9445636,0.0024086933,0.015908476],"study_design_scores_gemma":[0.00013866853,0.00019134559,0.0056715487,0.000047270656,0.00007022214,0.0004125787,0.00055888935,0.12797673,0.00047353838,0.8418409,0.022565844,0.00005238471],"about_ca_topic_score_codex":0.005132384,"about_ca_topic_score_gemma":0.0031579395,"teacher_disagreement_score":0.014785269,"about_ca_system_score_codex":0.0018431724,"about_ca_system_score_gemma":0.0010368194,"threshold_uncertainty_score":0.049461603},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11886984,0.005248467,0.56905335,0.0234142,0.0013636767,0.00019407453,0.00024453923,0.00018861813,0.2814233],"genre_scores_gemma":[0.8955883,0.003838966,0.07155425,0.002653244,0.0013119831,0.00030001777,0.00010219513,0.00012637672,0.024524594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869967,0.00071790285,0.000043013784,0.00015199027,0.00022872408,0.00015877621],"domain_scores_gemma":[0.99649245,0.0024937885,0.00017819235,0.00021124005,0.00030829423,0.0003160748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020110644,0.0008361967,0.00075184245,0.0005831181,0.0006549962,0.0020185644,0.001255811,0.0023154467,0.009690384],"category_scores_gemma":[0.010858835,0.00026799948,0.000685011,0.0007293619,0.0024119273,0.0030159226,0.0019193919,0.0023966625,0.00081424095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008341673,0.00003877825,0.000624291,0.00009289954,0.00002555717,0.00017043973,0.00013981428,0.030941421,0.0013168784,0.94356394,0.0048791184,0.018123433],"study_design_scores_gemma":[0.00008599448,0.00014454917,0.0005181869,0.00007153362,0.000018619721,0.0001235117,0.00010342559,0.08023137,0.00044624752,0.90889114,0.009328606,0.00003681467],"about_ca_topic_score_codex":0.0016301016,"about_ca_topic_score_gemma":0.0012650941,"teacher_disagreement_score":0.009690384,"about_ca_system_score_codex":0.0010237674,"about_ca_system_score_gemma":0.0009853598,"threshold_uncertainty_score":0.032417536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038906597,0.00042150563,0.85158795,0.0028612565,0.0003872183,0.00027130696,0.00027738002,0.00031742328,0.1049694],"genre_scores_gemma":[0.7966223,0.00053643103,0.12625961,0.00053193653,0.0002829247,0.00047194585,0.0002379243,0.00013091035,0.07492606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793017,0.0011696066,0.00007648871,0.000300354,0.00031564487,0.0002078108],"domain_scores_gemma":[0.99687237,0.0015408784,0.0001720994,0.000679016,0.00042168924,0.00031410527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025005394,0.0008636461,0.0011186119,0.0010305577,0.0011196219,0.0028161472,0.0016248997,0.0014143531,0.02093646],"category_scores_gemma":[0.008583935,0.00048000913,0.0005602177,0.001199047,0.0015671417,0.0028140738,0.0028166159,0.001931428,0.0024139578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002377733,0.00019677822,0.00042696708,0.00015078676,0.000064915504,0.00007851025,0.00014486854,0.06457633,0.001592637,0.8398634,0.013152063,0.07951501],"study_design_scores_gemma":[0.000055559107,0.00010462943,0.00019670962,0.00003409234,0.000029734905,0.000123357,0.000093297225,0.22140414,0.0007812904,0.7679811,0.009174407,0.000021703627],"about_ca_topic_score_codex":0.00032648246,"about_ca_topic_score_gemma":0.0005019586,"teacher_disagreement_score":0.02093646,"about_ca_system_score_codex":0.00094933924,"about_ca_system_score_gemma":0.0012123621,"threshold_uncertainty_score":0.07003945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425476,0.00030631057,0.014362753,0.0016723959,0.000031402145,0.00033288103,0.00023337618,0.00003282228,0.040480454],"genre_scores_gemma":[0.99127454,0.00020347835,0.0060508074,0.00007893035,0.0000046009927,0.00006667209,0.00009499594,0.0000033185152,0.0022226044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9978782,0.0014460118,0.00003936255,0.00008900179,0.00027278037,0.00027467057],"domain_scores_gemma":[0.995865,0.0032015473,0.00037662266,0.00008149161,0.00023106925,0.00024432884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428509,0.00040057613,0.00038782257,0.0015155121,0.0026235925,0.0022300868,0.001276339,0.0014486442,0.002522007],"category_scores_gemma":[0.005280963,0.00021323269,0.00044327273,0.0021433646,0.002545099,0.0010323529,0.0014417521,0.0012974037,0.00010086143],"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.0012994295,0.00092160393,0.046363834,0.00047178785,0.00017198782,0.0061287023,0.0108909635,0.51911646,0.0025676151,0.35427484,0.007871827,0.049920913],"study_design_scores_gemma":[0.00016090667,0.0004511698,0.01826068,0.00014541061,0.000105532825,0.0003899853,0.062728725,0.8413716,0.0013777084,0.059351083,0.01553638,0.00012077748],"about_ca_topic_score_codex":0.3361369,"about_ca_topic_score_gemma":0.5636016,"teacher_disagreement_score":0.66386306,"about_ca_system_score_codex":0.012868949,"about_ca_system_score_gemma":0.012800397,"threshold_uncertainty_score":0.6683607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06494853,0.0038370232,0.86636645,0.014407458,0.0003072584,0.00009766761,0.00029935807,0.0005681468,0.04916812],"genre_scores_gemma":[0.925667,0.0023633502,0.051579993,0.0015003369,0.00043291785,0.00016548348,0.00028845944,0.00019251714,0.017809942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946568,0.0033577636,0.00015930425,0.0008417874,0.00067138264,0.00031293798],"domain_scores_gemma":[0.9649938,0.027426537,0.00243157,0.002852351,0.0017544868,0.00054130587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008878393,0.0010672484,0.0024471823,0.0015171234,0.0009433909,0.0035852373,0.0022451954,0.0046517197,0.009777701],"category_scores_gemma":[0.093460135,0.0011077896,0.0009739692,0.001676501,0.0045764027,0.008459799,0.002615161,0.0050230967,0.0012698391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005296526,0.000058140733,0.0009022218,0.000075934964,0.000054478696,0.000052193467,0.00012813079,0.056857776,0.00015697129,0.91181433,0.0032152014,0.026631707],"study_design_scores_gemma":[0.00000886107,0.0000046248797,0.00016723567,0.000013057289,0.000005628862,0.000019686797,0.000013014163,0.039583586,0.000045667304,0.95932674,0.00080324383,0.0000087781455],"about_ca_topic_score_codex":0.0026435205,"about_ca_topic_score_gemma":0.001498896,"teacher_disagreement_score":0.009777701,"about_ca_system_score_codex":0.0027044425,"about_ca_system_score_gemma":0.0015464688,"threshold_uncertainty_score":0.046953976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45762447,0.001346729,0.41519362,0.001979538,0.00011014195,0.0004082663,0.0015094348,0.00045879968,0.12136896],"genre_scores_gemma":[0.9524447,0.0005370834,0.034589406,0.00020228658,0.000095344774,0.0005597232,0.0009814055,0.000071183786,0.010518858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959913,0.0014457054,0.00025088165,0.00067872455,0.000982693,0.00065064564],"domain_scores_gemma":[0.98782235,0.008830822,0.00083142,0.0005341965,0.0008714628,0.0011098649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003106878,0.0012250458,0.0027862738,0.0040874234,0.004487873,0.009907817,0.0033897092,0.0020606597,0.00854261],"category_scores_gemma":[0.011045064,0.0014628774,0.0021369988,0.0031055713,0.004588335,0.0065405755,0.0043659667,0.0024669196,0.0007619641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020449366,0.00006415365,0.00034735005,0.000086728476,0.000056552526,0.00006407532,0.0005655358,0.0047417395,0.0007858036,0.98800814,0.0007776237,0.0042978483],"study_design_scores_gemma":[0.00006213224,0.000026012534,0.00021007983,0.000031430627,0.000027124002,0.00004390781,0.00016522303,0.01868884,0.00063935807,0.97878724,0.0013017709,0.00001683731],"about_ca_topic_score_codex":0.0016394032,"about_ca_topic_score_gemma":0.0016791128,"teacher_disagreement_score":0.009907817,"about_ca_system_score_codex":0.0028523416,"about_ca_system_score_gemma":0.0020690244,"threshold_uncertainty_score":0.028577864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2913306,0.0018057701,0.5995868,0.0022426937,0.00017449258,0.00036056433,0.0002148749,0.0000684342,0.10421585],"genre_scores_gemma":[0.9584998,0.00052347104,0.027067488,0.00015489497,0.00006925898,0.00015419343,0.00005717761,0.000014384523,0.013459352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991001,0.0003813311,0.000028659246,0.00013100522,0.00017179646,0.00018720051],"domain_scores_gemma":[0.9983601,0.0010656537,0.00017933584,0.00007028078,0.00013818078,0.0001863731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014514433,0.00075152045,0.00068937894,0.00085931766,0.001207988,0.0017760524,0.0015859726,0.0014301465,0.0070183817],"category_scores_gemma":[0.004205901,0.00035420866,0.0010183748,0.00093147176,0.0023072923,0.003478672,0.0010732255,0.0014235555,0.00031042873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079547615,0.000057209403,0.00079245196,0.0000773559,0.000045462184,0.00018410184,0.0003531192,0.07279416,0.0009386619,0.9160453,0.0010927555,0.0075398367],"study_design_scores_gemma":[0.00008075428,0.00018693763,0.0011561116,0.000034615125,0.00006718154,0.00015749266,0.0003053146,0.4203138,0.00047823705,0.57054216,0.0066345814,0.000042704487],"about_ca_topic_score_codex":0.006534788,"about_ca_topic_score_gemma":0.004638461,"teacher_disagreement_score":0.0070183817,"about_ca_system_score_codex":0.0023453091,"about_ca_system_score_gemma":0.0018428855,"threshold_uncertainty_score":0.023478866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0655527,0.00019898334,0.92643946,0.0005392652,0.000046264984,0.0001460889,0.0005303915,0.0004073018,0.0061395555],"genre_scores_gemma":[0.7626461,0.00041490464,0.22499004,0.0004986064,0.0001845423,0.00061517,0.0015322944,0.0004839471,0.008634394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957638,0.0013742134,0.00026234123,0.0011259197,0.0008206452,0.0006531501],"domain_scores_gemma":[0.9745983,0.017479349,0.0018232225,0.0019100468,0.0025230898,0.0016659532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060410597,0.0011227679,0.0029518295,0.0025266248,0.0017336378,0.0053332984,0.0034468214,0.002233867,0.006422027],"category_scores_gemma":[0.028154857,0.0015887121,0.0022448227,0.0026521224,0.0037927453,0.008738831,0.0035880012,0.0047692163,0.00084772403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002130451,0.00014569581,0.0007629747,0.00013856578,0.000074567935,0.00007487278,0.00046928783,0.017659752,0.0010565217,0.96520376,0.0015680859,0.012632855],"study_design_scores_gemma":[0.000042290536,0.00003169107,0.00016722914,0.000021691776,0.000021889904,0.0000322811,0.000049380116,0.085961476,0.00031967708,0.9128723,0.0004657146,0.000014381553],"about_ca_topic_score_codex":0.004008905,"about_ca_topic_score_gemma":0.0043286667,"teacher_disagreement_score":0.006422027,"about_ca_system_score_codex":0.0024539721,"about_ca_system_score_gemma":0.0037299301,"threshold_uncertainty_score":0.031948566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14564142,0.0012012685,0.8370438,0.001701349,0.00013069694,0.000076121,0.000035254685,0.00014765916,0.014022436],"genre_scores_gemma":[0.9355582,0.00049460767,0.05895254,0.00022342202,0.00006778701,0.000089111825,0.00003016292,0.000014612707,0.0045695165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982091,0.0010938842,0.00006285378,0.00024517337,0.0002878758,0.00010115708],"domain_scores_gemma":[0.9960439,0.002594161,0.00038358834,0.0004022337,0.00037212868,0.00020398234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039959,0.00043635437,0.0009154114,0.00040059673,0.0003307847,0.001065535,0.001528005,0.0010738902,0.0016785885],"category_scores_gemma":[0.008871719,0.0002481766,0.00048745738,0.00039831785,0.0015063013,0.0015962351,0.0012660385,0.0013655605,0.00020632449],"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.00005436326,0.000075187825,0.0010471236,0.00008569401,0.0001322837,0.00007143599,0.000072174465,0.77422756,0.0008496007,0.19259772,0.00071036804,0.030076472],"study_design_scores_gemma":[0.000020354404,0.000051541967,0.00015066541,0.000009758832,0.000009612886,0.000022512488,0.000010214866,0.92600185,0.00020791666,0.07271398,0.00079282245,0.000008807445],"about_ca_topic_score_codex":0.0013463084,"about_ca_topic_score_gemma":0.00065878814,"teacher_disagreement_score":0.003039959,"about_ca_system_score_codex":0.00095688266,"about_ca_system_score_gemma":0.0005602265,"threshold_uncertainty_score":0.016077042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056940736,0.0005731272,0.9864818,0.00032084406,0.00013197359,0.000029419782,0.0000284727,0.00016643043,0.006573904],"genre_scores_gemma":[0.913313,0.0010352492,0.07260168,0.00044591888,0.0003059301,0.00025785566,0.000093217575,0.00005545294,0.011891682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953365,0.00014447715,0.000018104225,0.00011265054,0.00014797343,0.000043114625],"domain_scores_gemma":[0.99933285,0.0003764101,0.00008209044,0.00004650312,0.00013344266,0.000028687306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910682,0.0006327231,0.00081983086,0.00049850193,0.00047093641,0.0009396229,0.0008051601,0.0010946643,0.0022420827],"category_scores_gemma":[0.002368178,0.00022493541,0.0005602783,0.00053143775,0.0009794221,0.0005699198,0.0008185316,0.0010005912,0.0003289055],"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.000052193383,0.000040176903,0.00040506947,0.000113479946,0.00007154723,0.00006517202,0.000058277146,0.7662712,0.002743121,0.16674168,0.0023726993,0.061065443],"study_design_scores_gemma":[0.0000079525735,0.000025956,0.000089230096,0.000006428268,0.000005683367,0.000013419656,0.0000026740593,0.97851527,0.00018172999,0.0199533,0.0011904485,0.000007914977],"about_ca_topic_score_codex":0.0036696594,"about_ca_topic_score_gemma":0.0023176903,"teacher_disagreement_score":0.0036696594,"about_ca_system_score_codex":0.0008614472,"about_ca_system_score_gemma":0.00078443455,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17631316,0.0015864912,0.03285568,0.0124760065,0.0029399984,0.0004574697,0.00057376386,0.00051657885,0.77228075],"genre_scores_gemma":[0.82995087,0.0006606077,0.003067664,0.001417395,0.0010519016,0.00018161653,0.00031340178,0.000073554875,0.16328295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848807,0.00035742667,0.000043626485,0.0002674356,0.00051506166,0.00032835713],"domain_scores_gemma":[0.99477416,0.0012624442,0.00051218027,0.0005103485,0.0017503874,0.0011905017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018703244,0.0006402517,0.0004970917,0.0018864331,0.0022298724,0.003083367,0.00078400597,0.0014987184,0.04537643],"category_scores_gemma":[0.010672994,0.00023242319,0.00043205675,0.0008517372,0.00073188235,0.0019527114,0.001327471,0.0015810159,0.0121073015],"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.0005351194,0.00062225544,0.033452652,0.00078166684,0.0002878522,0.0016968921,0.0083747,0.0029005923,0.018557357,0.34273165,0.19898364,0.39107564],"study_design_scores_gemma":[0.0002601063,0.0006182147,0.050641805,0.00031207604,0.00046366482,0.0017286113,0.008616737,0.023477579,0.010811444,0.1450645,0.7578598,0.00014542324],"about_ca_topic_score_codex":0.00076499477,"about_ca_topic_score_gemma":0.0021946388,"teacher_disagreement_score":0.04537643,"about_ca_system_score_codex":0.0010687506,"about_ca_system_score_gemma":0.00075925695,"threshold_uncertainty_score":0.15179926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38916424,0.0042441473,0.40826842,0.018132394,0.0012406464,0.00016406897,0.0003166381,0.0003134919,0.17815593],"genre_scores_gemma":[0.97984535,0.0009566776,0.007389682,0.00031587676,0.0003819555,0.000055207667,0.000034600434,0.000027488784,0.010993181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978174,0.001255763,0.00008797413,0.00020543135,0.0003509263,0.0002824428],"domain_scores_gemma":[0.9746346,0.021634437,0.0013286888,0.00061052607,0.0011047394,0.00068698754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024002793,0.00055766397,0.0016150291,0.0009276934,0.0018068022,0.0048581273,0.0010010069,0.0032257987,0.012256828],"category_scores_gemma":[0.017648613,0.00072496565,0.0007051559,0.001698445,0.0029829636,0.004733484,0.0013740996,0.0022787645,0.00059111114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014576744,0.00010155779,0.0004840973,0.00014603528,0.000032454307,0.00025898148,0.00031002707,0.06343402,0.0005129086,0.9229535,0.0030638007,0.008556776],"study_design_scores_gemma":[0.000059940212,0.000038131027,0.00024949544,0.000028374623,0.00001868532,0.00006674396,0.000114843715,0.12763269,0.00013564288,0.87023413,0.0013922375,0.000029038618],"about_ca_topic_score_codex":0.0041150325,"about_ca_topic_score_gemma":0.0020405175,"teacher_disagreement_score":0.012256828,"about_ca_system_score_codex":0.0020895288,"about_ca_system_score_gemma":0.0020437671,"threshold_uncertainty_score":0.041003168},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09226099,0.002474746,0.8969556,0.0029016202,0.00009791894,0.000050347087,0.00025899571,0.00023453629,0.0047652437],"genre_scores_gemma":[0.93925357,0.002145531,0.051280078,0.00044857693,0.00029629975,0.00017648393,0.000306369,0.000055341694,0.0060377163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973449,0.001426367,0.00012796746,0.00051130244,0.00027782068,0.00031164364],"domain_scores_gemma":[0.96123725,0.03508859,0.0019110295,0.00087217963,0.0004770262,0.00041393362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005338641,0.0011579291,0.0020438996,0.0009555188,0.0007506093,0.0024469518,0.0021592663,0.0024223225,0.0030453077],"category_scores_gemma":[0.029175704,0.0010732245,0.0011474321,0.0011519025,0.0028452533,0.006429695,0.0025442105,0.0030059689,0.00038358988],"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.00022007703,0.000077506826,0.002353927,0.00020149905,0.00016810591,0.00028669133,0.00032554695,0.5085719,0.0004045675,0.4702918,0.0007706387,0.016327638],"study_design_scores_gemma":[0.000035639456,0.000029280172,0.00016448287,0.000020670052,0.000016383936,0.000022111384,0.000018135846,0.6434809,0.00011710639,0.35579252,0.00028807003,0.000014799592],"about_ca_topic_score_codex":0.006231699,"about_ca_topic_score_gemma":0.0047309413,"teacher_disagreement_score":0.006231699,"about_ca_system_score_codex":0.0021376538,"about_ca_system_score_gemma":0.0013779143,"threshold_uncertainty_score":0.028233767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065868095,0.00010906923,0.93181264,0.0001793158,0.000016919019,0.00003695242,0.000025673153,0.00012147158,0.001829871],"genre_scores_gemma":[0.93660396,0.00013682786,0.06133423,0.000071588845,0.000018991112,0.00011302544,0.000046602552,0.000021125408,0.0016536935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920195,0.00033227948,0.00004014756,0.00019256407,0.00013498894,0.00009817724],"domain_scores_gemma":[0.99627125,0.0022809405,0.0006989486,0.00021133179,0.00040586866,0.00013168989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019297143,0.0007083053,0.0010034121,0.00080522033,0.0006496945,0.0011923012,0.0013106788,0.0011940815,0.00085858314],"category_scores_gemma":[0.0069401762,0.0005058026,0.00051753654,0.0007488361,0.0011126858,0.0012859072,0.0012343852,0.0008120238,0.00017614083],"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.000045487,0.000025030415,0.00073018915,0.000019547415,0.000049304806,0.000042106367,0.000049846385,0.9668884,0.0007724299,0.023856577,0.00025490831,0.0072661205],"study_design_scores_gemma":[0.000008330165,0.0000110731535,0.00006962102,0.0000023461446,0.0000045008032,0.0000047318454,0.0000057418447,0.9920637,0.00012765928,0.0076211626,0.0000778191,0.0000033482715],"about_ca_topic_score_codex":0.0053766547,"about_ca_topic_score_gemma":0.003981239,"teacher_disagreement_score":0.0053766547,"about_ca_system_score_codex":0.0012339989,"about_ca_system_score_gemma":0.0007926324,"threshold_uncertainty_score":0.010690749},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2992593,0.00021003246,0.694363,0.0005433144,0.000019447281,0.00023808013,0.00046882077,0.0011253969,0.0037726215],"genre_scores_gemma":[0.82498187,0.0002227368,0.17198196,0.00009786255,0.000018896979,0.00024869252,0.00070816994,0.00011129932,0.0016285036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977449,0.0008949328,0.00013478541,0.0005168741,0.00037407846,0.00033452996],"domain_scores_gemma":[0.9885634,0.008755146,0.00094407616,0.0010950965,0.00036375134,0.00027849278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001999989,0.001384943,0.0018673198,0.0010116864,0.0008454134,0.002525522,0.0023010042,0.0014809952,0.0045676115],"category_scores_gemma":[0.01762775,0.0010465528,0.0013158313,0.0013243317,0.0018096158,0.0072195493,0.0023294417,0.0018455497,0.00043838],"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.00038116667,0.00017909794,0.0016482653,0.0002110527,0.00009663176,0.00016202725,0.0002682606,0.8657194,0.002406306,0.08834054,0.0009459835,0.039641216],"study_design_scores_gemma":[0.000038033442,0.000040333354,0.00011713684,0.000010542959,0.000015788686,0.000037650865,0.00006405899,0.89304113,0.001200019,0.10511542,0.0003113776,0.000008446837],"about_ca_topic_score_codex":0.0031913666,"about_ca_topic_score_gemma":0.0034985314,"teacher_disagreement_score":0.0045676115,"about_ca_system_score_codex":0.002466834,"about_ca_system_score_gemma":0.0015609227,"threshold_uncertainty_score":0.017898142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14659306,0.00024147396,0.8448772,0.0010983313,0.000040724255,0.00010150066,0.00009892433,0.00018129339,0.0067675496],"genre_scores_gemma":[0.9420413,0.000145448,0.052577335,0.00015004011,0.000033067867,0.000114554525,0.00007875141,0.000056073433,0.004803479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675226,0.0015226807,0.00012616889,0.0005114125,0.00061253086,0.00047490883],"domain_scores_gemma":[0.9877055,0.008717945,0.0014546115,0.00067271077,0.0007468162,0.0007023739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004292724,0.00088448205,0.0015551501,0.0009247472,0.0006501823,0.0020505532,0.0016447628,0.0019145483,0.0029681665],"category_scores_gemma":[0.02306798,0.00062524923,0.00080971076,0.0007930695,0.0031176482,0.0035622718,0.0018586711,0.0023166575,0.00027905393],"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.00019596184,0.00015549579,0.0017040729,0.00007507756,0.00007521795,0.00017709403,0.00018436022,0.70685613,0.0016555873,0.26623985,0.0009481642,0.021733029],"study_design_scores_gemma":[0.000023454953,0.000052449115,0.00026367453,0.000008185844,0.0000064117253,0.000024075165,0.00002466897,0.90122193,0.0003394359,0.09772563,0.0002932905,0.000016884207],"about_ca_topic_score_codex":0.0035207493,"about_ca_topic_score_gemma":0.0016652207,"teacher_disagreement_score":0.004292724,"about_ca_system_score_codex":0.0021247277,"about_ca_system_score_gemma":0.0015941687,"threshold_uncertainty_score":0.022702396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59944963,0.00088602485,0.32456198,0.0041262144,0.00008713367,0.00016072651,0.0001255655,0.000060872982,0.07054191],"genre_scores_gemma":[0.9847674,0.00022182782,0.010994006,0.00012193556,0.00004199702,0.000068805544,0.000021739179,0.000009700541,0.0037526542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736685,0.0014463781,0.00008422957,0.00044176492,0.00034082087,0.00031992645],"domain_scores_gemma":[0.9855236,0.008240315,0.0026511536,0.0014070566,0.0009593549,0.0012185203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050709667,0.00050189614,0.000716474,0.0013996463,0.0019144982,0.0036096657,0.001626869,0.00157111,0.0048653046],"category_scores_gemma":[0.016757214,0.00036322544,0.0005446281,0.0007644661,0.004479685,0.0050011147,0.002412578,0.0010175185,0.00043510454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009507221,0.000037275542,0.0036343555,0.000050742135,0.000050345432,0.000196021,0.00069419533,0.012296303,0.0014149429,0.97068,0.00058534567,0.0102654835],"study_design_scores_gemma":[0.00004615383,0.00009278916,0.0015411837,0.000034490433,0.0000525809,0.00021119571,0.0005703603,0.067556165,0.0014252932,0.9237888,0.0046543973,0.00002654431],"about_ca_topic_score_codex":0.00061424886,"about_ca_topic_score_gemma":0.0006850404,"teacher_disagreement_score":0.0050709667,"about_ca_system_score_codex":0.0016002709,"about_ca_system_score_gemma":0.0008075717,"threshold_uncertainty_score":0.026818156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0306413,0.0028540085,0.92347217,0.004734471,0.00040743648,0.00012659242,0.00030569744,0.00032122666,0.0371371],"genre_scores_gemma":[0.7406395,0.0056643593,0.20665574,0.002399905,0.002281057,0.0016874316,0.00050666154,0.00046880255,0.039696537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616325,0.0015201767,0.00025217579,0.00069293083,0.00092007226,0.00045133466],"domain_scores_gemma":[0.97397465,0.019853916,0.0013000142,0.0012384616,0.0021428645,0.0014901026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009882846,0.0019964895,0.0035302625,0.0040367832,0.0030300466,0.0062417057,0.0050595496,0.004164984,0.009122912],"category_scores_gemma":[0.03423384,0.0012562884,0.0035651962,0.002677427,0.0077214744,0.014819259,0.0064534415,0.0060859905,0.0010445745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013169749,0.000024488152,0.00021011037,0.000085179105,0.000036897207,0.00006110247,0.00015498213,0.00487556,0.00026968212,0.9906247,0.00092945393,0.0027147243],"study_design_scores_gemma":[0.000021612963,0.000020342148,0.00010059588,0.000029309962,0.000021799102,0.00010354544,0.000033413256,0.05610476,0.000102546794,0.9419653,0.0014794507,0.000017376742],"about_ca_topic_score_codex":0.0028282553,"about_ca_topic_score_gemma":0.0013148698,"teacher_disagreement_score":0.009882846,"about_ca_system_score_codex":0.0030340538,"about_ca_system_score_gemma":0.0027390316,"threshold_uncertainty_score":0.05226612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028807433,0.00021139518,0.966895,0.00036607028,0.000034418434,0.000060426115,0.000042331645,0.00010621105,0.0034767007],"genre_scores_gemma":[0.8736575,0.00040964253,0.12235653,0.00014106618,0.000101830236,0.00027947145,0.00009775768,0.00004965508,0.002906462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967885,0.0017930071,0.000121482495,0.0004471984,0.0005561733,0.0002936101],"domain_scores_gemma":[0.995145,0.0038128758,0.00041279916,0.000260651,0.00021840812,0.00015019262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029962857,0.0011558826,0.0015711489,0.00043217972,0.00086168764,0.0016546525,0.001753201,0.0012587028,0.0017883655],"category_scores_gemma":[0.008662192,0.0005889544,0.0008709278,0.0011319768,0.001956718,0.0027469534,0.0015395778,0.001561799,0.00020549381],"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.000104901985,0.0000355758,0.00025341497,0.000066097025,0.000038729213,0.00009217537,0.00009609837,0.8628839,0.00073016546,0.12559226,0.00037094337,0.009735641],"study_design_scores_gemma":[0.000030483294,0.000033705364,0.00006472223,0.0000048298643,0.000010614485,0.00002413385,0.000020248028,0.91300416,0.000336146,0.08592434,0.0005380165,0.000008621191],"about_ca_topic_score_codex":0.0044269427,"about_ca_topic_score_gemma":0.00362868,"teacher_disagreement_score":0.0044269427,"about_ca_system_score_codex":0.001712864,"about_ca_system_score_gemma":0.0022226858,"threshold_uncertainty_score":0.015846014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04480651,0.0006930044,0.9470131,0.0009921029,0.00003510788,0.00007972146,0.000113733484,0.00011927354,0.0061475243],"genre_scores_gemma":[0.80059797,0.00097194145,0.19331357,0.000271077,0.0001580007,0.00040144808,0.00018743283,0.0000662748,0.004032308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943334,0.003753784,0.00018778759,0.00054228154,0.0008232694,0.00035955105],"domain_scores_gemma":[0.98945767,0.008581103,0.00091327686,0.0005250818,0.0003117895,0.00021111907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059653227,0.0012051672,0.001527218,0.00076874957,0.00075005094,0.00231732,0.0017209615,0.0013318997,0.0014187713],"category_scores_gemma":[0.017706318,0.0006933183,0.0013601837,0.0008996877,0.0030859592,0.004436418,0.0020325843,0.002506052,0.00019357183],"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.00009345283,0.000050289258,0.0005607415,0.00012791419,0.00011592808,0.00012541235,0.00017711867,0.65401816,0.00058288436,0.3315705,0.0007727061,0.0118048545],"study_design_scores_gemma":[0.000021327294,0.000030336138,0.00016120171,0.00001658869,0.000013728395,0.000024092706,0.000028702378,0.6918927,0.0003491905,0.30672887,0.0007224269,0.000010876713],"about_ca_topic_score_codex":0.0022302554,"about_ca_topic_score_gemma":0.0020182463,"teacher_disagreement_score":0.0059653227,"about_ca_system_score_codex":0.002097482,"about_ca_system_score_gemma":0.001301131,"threshold_uncertainty_score":0.031548023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66657436,0.00084147527,0.30019343,0.0029205508,0.00011269566,0.00023694076,0.00016039066,0.0002906667,0.02866951],"genre_scores_gemma":[0.9911993,0.00016710741,0.0059645246,0.000117077616,0.000029733872,0.00006559528,0.000026392518,0.000007754533,0.002422357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981652,0.0009466028,0.00012547907,0.00024568313,0.00022008344,0.00029692356],"domain_scores_gemma":[0.99195623,0.0052513247,0.0013040204,0.0006805544,0.00033952374,0.0004683587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026102804,0.0008788702,0.00091177935,0.0006023576,0.0007646752,0.0021093956,0.0009703865,0.0016607487,0.0024793833],"category_scores_gemma":[0.011365824,0.0004894737,0.0009120183,0.00038826425,0.0029569834,0.0028893393,0.002014619,0.0016599076,0.0002507104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007496858,0.00023220398,0.006666299,0.00035944118,0.0002533638,0.0015656326,0.0037784593,0.2190849,0.00472864,0.7242652,0.0025510269,0.03576515],"study_design_scores_gemma":[0.00018178202,0.00029033425,0.0019262659,0.000048343558,0.000097182754,0.0003702208,0.00062036095,0.43847948,0.0008040979,0.55420995,0.0029016195,0.00007026966],"about_ca_topic_score_codex":0.0032709346,"about_ca_topic_score_gemma":0.0022218314,"teacher_disagreement_score":0.0032709346,"about_ca_system_score_codex":0.0011850563,"about_ca_system_score_gemma":0.0008441326,"threshold_uncertainty_score":0.013804674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15180562,0.001249427,0.79665565,0.0013452809,0.00027293115,0.00008543117,0.00070266763,0.00029316137,0.047589827],"genre_scores_gemma":[0.91398257,0.0007721673,0.06661816,0.00019759819,0.00034178034,0.000119087366,0.00039726545,0.0001144215,0.01745692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953845,0.0012746035,0.00030745845,0.0011594717,0.0015016265,0.0003722966],"domain_scores_gemma":[0.99261355,0.003850434,0.0010704052,0.0010864056,0.0010196186,0.0003595599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036048805,0.0006813659,0.001059586,0.0023675405,0.0012046329,0.0041898447,0.0011018132,0.0008276275,0.011300369],"category_scores_gemma":[0.01223286,0.0006308835,0.0009976707,0.0021585103,0.0036109968,0.007942239,0.0025237002,0.002438132,0.0012387572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030138008,0.0000105808085,0.00046482866,0.00004159612,0.000021383257,0.000057909994,0.000096263175,0.002828694,0.00065944745,0.98924726,0.00038333502,0.006158535],"study_design_scores_gemma":[0.000009931934,0.000055580407,0.0006409024,0.000034784778,0.000031370062,0.00022085084,0.00005990843,0.022826876,0.0011498058,0.9698242,0.0051179198,0.000027880498],"about_ca_topic_score_codex":0.0004953324,"about_ca_topic_score_gemma":0.00034191887,"teacher_disagreement_score":0.011300369,"about_ca_system_score_codex":0.0012717333,"about_ca_system_score_gemma":0.00063235266,"threshold_uncertainty_score":0.03780347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03459484,0.00028973585,0.9613713,0.00029591026,0.00008574849,0.000118615375,0.000011080979,0.00045377563,0.0027788433],"genre_scores_gemma":[0.710567,0.00017458694,0.2867414,0.00014573851,0.00006587958,0.00016307128,0.000023750152,0.000028818344,0.0020897184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988456,0.0005293454,0.00007692392,0.00017890941,0.00030130893,0.00006791568],"domain_scores_gemma":[0.99877995,0.00052803004,0.00013394907,0.00015948572,0.0003230268,0.00007556843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015991033,0.0005760734,0.0006662406,0.000690226,0.0004455971,0.0009878705,0.0013914965,0.00095014414,0.0009742472],"category_scores_gemma":[0.002258536,0.00021246435,0.00037398384,0.00027715624,0.00053417275,0.0013780987,0.0007283366,0.000731058,0.00021732261],"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.00046186973,0.0007753316,0.0037252826,0.00039319423,0.00042035998,0.0005616716,0.00040868772,0.42568663,0.07142816,0.08381035,0.0028451623,0.40948325],"study_design_scores_gemma":[0.00004779504,0.0002259079,0.00047563398,0.000012681853,0.000056676774,0.00016000474,0.000029368744,0.97841144,0.008912722,0.008023438,0.0036230213,0.000021373595],"about_ca_topic_score_codex":0.00040800188,"about_ca_topic_score_gemma":0.000627962,"teacher_disagreement_score":0.0015991033,"about_ca_system_score_codex":0.00042179902,"about_ca_system_score_gemma":0.00052802847,"threshold_uncertainty_score":0.008456945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031809965,0.0005238028,0.9659331,0.001432778,0.00017776326,0.00039553913,0.0010256413,0.0014338996,0.025896525],"genre_scores_gemma":[0.1890714,0.0016967822,0.7797863,0.00069715804,0.00019257604,0.0019456402,0.0026551313,0.000466193,0.02348882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823546,0.0008754534,0.00012171361,0.00024600618,0.00038673828,0.00013452093],"domain_scores_gemma":[0.99885654,0.0006188747,0.0000873236,0.00015472168,0.00018019135,0.00010243062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015238755,0.0011737153,0.0008434585,0.0017136323,0.0013160927,0.0044156606,0.0026000438,0.002449502,0.014274665],"category_scores_gemma":[0.004252424,0.0006005493,0.001631308,0.0018871012,0.001681727,0.004467434,0.0021693727,0.002414059,0.0032948267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006386448,0.00004311169,0.0002252736,0.00010850026,0.00003880143,0.00018194945,0.00026537327,0.17972769,0.0006703253,0.78631717,0.009581737,0.022776155],"study_design_scores_gemma":[0.00006880333,0.000026438787,0.00007658778,0.000040183982,0.000026267462,0.00008740445,0.000063256026,0.5393277,0.0002863057,0.4101619,0.0498034,0.000031736832],"about_ca_topic_score_codex":0.013645657,"about_ca_topic_score_gemma":0.010572878,"teacher_disagreement_score":0.014274665,"about_ca_system_score_codex":0.0024670123,"about_ca_system_score_gemma":0.003281158,"threshold_uncertainty_score":0.047753513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.366183,0.0011277344,0.59196264,0.010429789,0.0002747548,0.00025682335,0.0008272455,0.0005192216,0.02841883],"genre_scores_gemma":[0.9745094,0.00041627165,0.017963443,0.00048052688,0.0002834495,0.00016248535,0.00009204593,0.00005586761,0.006036531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98449004,0.010247596,0.00071831484,0.0015217388,0.0016108504,0.0014114255],"domain_scores_gemma":[0.8381792,0.13893633,0.008676498,0.010078792,0.00259605,0.0015330695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016752305,0.0018391038,0.004568249,0.0014051996,0.001419977,0.0067601292,0.0031805737,0.007292567,0.00471944],"category_scores_gemma":[0.08913756,0.003510981,0.0016432718,0.0016629456,0.00568128,0.011982057,0.004370637,0.0052778777,0.0011127377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018973537,0.0003025863,0.002249615,0.0005469052,0.00035731719,0.0009898159,0.0010175982,0.15675297,0.0029014451,0.81533074,0.003579084,0.014074577],"study_design_scores_gemma":[0.00024426627,0.000099732126,0.00040798378,0.00004706898,0.000107942826,0.00022892833,0.00012433343,0.2437548,0.00087670627,0.7535173,0.0005218458,0.00006894802],"about_ca_topic_score_codex":0.0009864748,"about_ca_topic_score_gemma":0.00054701715,"teacher_disagreement_score":0.016752305,"about_ca_system_score_codex":0.001867678,"about_ca_system_score_gemma":0.0019954466,"threshold_uncertainty_score":0.08859569},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1214025,0.046737336,0.14615425,0.092849456,0.00078674924,0.00018574855,0.00036261583,0.00016365323,0.59135777],"genre_scores_gemma":[0.9579609,0.010660496,0.014061646,0.0018787835,0.00020554375,0.00014835261,0.00012892565,0.000038523893,0.014916702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958619,0.0030874682,0.00012093444,0.00029569535,0.00038694998,0.0002470375],"domain_scores_gemma":[0.9921755,0.0062968363,0.00048493006,0.00030061704,0.00041150927,0.0003306529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053596087,0.0005898755,0.00049998,0.0011064648,0.0011980599,0.006311406,0.0006608561,0.0023184007,0.0064266864],"category_scores_gemma":[0.009351021,0.00031669828,0.00068394514,0.0014579591,0.0128059955,0.005754482,0.0013898847,0.002812586,0.0007495082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004095525,0.000031795116,0.0004619713,0.0001008683,0.000019626665,0.00007127535,0.0020828517,0.0014325589,0.00007129696,0.98228663,0.0022745267,0.011125479],"study_design_scores_gemma":[0.000013810425,0.000012242945,0.0003220627,0.000078242876,0.000007421141,0.000022038772,0.00077268475,0.0014025641,0.000045628527,0.99167836,0.005637247,0.000007673688],"about_ca_topic_score_codex":0.0056866133,"about_ca_topic_score_gemma":0.0028220343,"teacher_disagreement_score":0.0064266864,"about_ca_system_score_codex":0.0038338837,"about_ca_system_score_gemma":0.0032119239,"threshold_uncertainty_score":0.028344631},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27678078,0.0006585618,0.36519688,0.009171096,0.00016600455,0.00022059162,0.00084846374,0.0003423198,0.3466153],"genre_scores_gemma":[0.9478347,0.00041375257,0.038064286,0.00048950216,0.00009293652,0.0002124226,0.00030156953,0.00005782558,0.012532906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767524,0.0010998362,0.00015871563,0.00032346504,0.0004048615,0.00033788863],"domain_scores_gemma":[0.98917705,0.008075733,0.0008870726,0.00065027364,0.00079863716,0.0004111877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022044887,0.0005032413,0.0010159096,0.0013688286,0.0014446499,0.005853675,0.0009632536,0.0019371198,0.01644901],"category_scores_gemma":[0.017498182,0.00065253937,0.0006962479,0.0015482162,0.0038128635,0.007565661,0.0019727666,0.0019394589,0.001521273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047929116,0.00003567109,0.0003920484,0.00005313391,0.000014059214,0.000054389326,0.00028773738,0.0014974658,0.00019661245,0.9930634,0.0007447601,0.0036129265],"study_design_scores_gemma":[0.00002711271,0.000014027978,0.00015868436,0.00001547897,0.000008971503,0.00004833156,0.00019302114,0.0037744092,0.00012026414,0.9948338,0.0007972689,0.000008545806],"about_ca_topic_score_codex":0.0011355695,"about_ca_topic_score_gemma":0.0014867887,"teacher_disagreement_score":0.01644901,"about_ca_system_score_codex":0.0012439075,"about_ca_system_score_gemma":0.001434995,"threshold_uncertainty_score":0.055027425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08242783,0.00019181996,0.91217554,0.0003018508,0.000050806146,0.0002984053,0.00014387147,0.00059456803,0.0038153133],"genre_scores_gemma":[0.48147878,0.0001625901,0.5152762,0.00012019575,0.000029672898,0.00019144986,0.00029058786,0.000048265898,0.002402273],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715817,0.0007998178,0.00017697692,0.0006995128,0.0009384426,0.00022706456],"domain_scores_gemma":[0.9909019,0.004686658,0.00130646,0.0015624398,0.0011800338,0.0003624317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023260477,0.000802066,0.0010396444,0.0027182566,0.0014396666,0.0014818811,0.0022319378,0.0018844383,0.0013422488],"category_scores_gemma":[0.014709548,0.00047368472,0.00088790857,0.001269067,0.0012726851,0.0027240587,0.0034030234,0.0013915495,0.0005772567],"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.0006291617,0.0006274734,0.05095558,0.00072601356,0.00043337184,0.0014043859,0.0025962638,0.15468268,0.055742037,0.10943656,0.0059646885,0.61680186],"study_design_scores_gemma":[0.000058701684,0.0003428223,0.006831598,0.00009103669,0.00012781606,0.0015554889,0.0012794522,0.848587,0.04388838,0.086848415,0.010291342,0.00009807534],"about_ca_topic_score_codex":0.0017096318,"about_ca_topic_score_gemma":0.0018499265,"teacher_disagreement_score":0.0027182566,"about_ca_system_score_codex":0.00053471787,"about_ca_system_score_gemma":0.0012550373,"threshold_uncertainty_score":0.012301445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004332689,0.00022060012,0.99013186,0.00007092366,0.00007571488,0.0000824515,0.000016089787,0.0002444346,0.0048253164],"genre_scores_gemma":[0.78046805,0.00067517656,0.20384175,0.00019210872,0.00012841237,0.0007577547,0.000096934345,0.00008997354,0.01374984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.000044477165,0.00001610119,0.00010112742,0.00014203797,0.0000377259],"domain_scores_gemma":[0.999845,0.000038383914,0.000019789612,0.000010343854,0.00007691165,0.000009579876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035320214,0.0007216082,0.0005801016,0.00033860316,0.00034818627,0.0010561615,0.001063938,0.00082782714,0.0024820524],"category_scores_gemma":[0.00050576864,0.00025753945,0.00034761478,0.00019486423,0.00039411624,0.0005941559,0.00054713653,0.0007104994,0.0005671497],"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.00013593253,0.00014503404,0.000513804,0.0006211334,0.0001306712,0.00056063,0.0003155248,0.64649695,0.06504366,0.08715205,0.004074703,0.19480999],"study_design_scores_gemma":[0.000060788538,0.0001878636,0.0001623794,0.000022759641,0.000026082265,0.0000974144,0.00003453899,0.9728315,0.0075108223,0.009114586,0.0099338,0.00001744182],"about_ca_topic_score_codex":0.0011351834,"about_ca_topic_score_gemma":0.0009589923,"teacher_disagreement_score":0.0024820524,"about_ca_system_score_codex":0.00042315802,"about_ca_system_score_gemma":0.00047380893,"threshold_uncertainty_score":0.008303285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24600463,0.0008002919,0.7295813,0.0035299691,0.00011532915,0.00030654768,0.00093882513,0.0013700981,0.017353134],"genre_scores_gemma":[0.736494,0.00079929305,0.25373667,0.0004740123,0.00014826468,0.00029788856,0.0014901605,0.00040749597,0.0061521996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967739,0.001198535,0.00022541055,0.00068340625,0.00069066527,0.0004280887],"domain_scores_gemma":[0.94940484,0.044724382,0.0018822716,0.0023403412,0.0011304127,0.00051775045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034784074,0.001021971,0.0015595722,0.0014696213,0.0019018358,0.005181359,0.0023415366,0.0019056803,0.012180063],"category_scores_gemma":[0.029525315,0.0009314953,0.0017579317,0.0018300872,0.002569906,0.010131343,0.0033650466,0.0031597759,0.001006858],"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.0011495515,0.00027256695,0.0041806796,0.0005790659,0.00018803857,0.00028670896,0.00051803,0.6792631,0.0033126553,0.21793528,0.00611556,0.08619873],"study_design_scores_gemma":[0.000071101655,0.000036209072,0.00035285103,0.0000239916,0.000029851712,0.000059113943,0.00009977587,0.6976728,0.0014492444,0.29945338,0.0007312875,0.000020406782],"about_ca_topic_score_codex":0.006639069,"about_ca_topic_score_gemma":0.008003805,"teacher_disagreement_score":0.012180063,"about_ca_system_score_codex":0.0030477666,"about_ca_system_score_gemma":0.002035868,"threshold_uncertainty_score":0.04074633},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061806146,0.0010055936,0.3539249,0.023418456,0.0006055255,0.00053037214,0.0015552968,0.00028870837,0.556865],"genre_scores_gemma":[0.90424746,0.0008209794,0.03611574,0.0031816622,0.00077539677,0.0010403318,0.00069573964,0.00011921888,0.053003553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986102,0.0036804068,0.0009680504,0.003961548,0.0032911857,0.001996765],"domain_scores_gemma":[0.9741616,0.0126536945,0.001717279,0.007029133,0.0035490107,0.0008891768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008280157,0.0012527562,0.003452119,0.0018974844,0.0026338075,0.007414684,0.0032396505,0.006880766,0.018305784],"category_scores_gemma":[0.031876177,0.0010686564,0.0029111803,0.0016393383,0.0074597644,0.010452404,0.0043813754,0.008255209,0.0042533367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021770787,0.000017785445,0.00013597624,0.000030998086,0.00003048362,0.000047967707,0.00010962506,0.0008230597,0.000084676634,0.99504185,0.0018197523,0.0018361144],"study_design_scores_gemma":[0.000018167071,0.0000075452986,0.000086645035,0.000013019452,0.000011300562,0.000052266376,0.00004425729,0.0023485734,0.000084926636,0.99496055,0.0023660164,0.0000066792836],"about_ca_topic_score_codex":0.0017612074,"about_ca_topic_score_gemma":0.0010003953,"teacher_disagreement_score":0.018305784,"about_ca_system_score_codex":0.0030273166,"about_ca_system_score_gemma":0.0040037315,"threshold_uncertainty_score":0.061238945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008443148,0.00017394514,0.9792463,0.00070332026,0.00004902232,0.00018658671,0.0005332245,0.00023117769,0.010433146],"genre_scores_gemma":[0.3997233,0.00087559916,0.58253807,0.0007074945,0.00015207262,0.00081313145,0.001385448,0.00016728928,0.013637573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955461,0.0023400954,0.00020051174,0.0007526677,0.00082495925,0.00033565037],"domain_scores_gemma":[0.9956644,0.0029879871,0.0003221396,0.00034535048,0.00042007913,0.0002600896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028917375,0.0014037157,0.0017161277,0.0012407475,0.0010187625,0.00257971,0.0028184648,0.0022354086,0.008482985],"category_scores_gemma":[0.012812393,0.0006910128,0.0012868508,0.0016717574,0.0022887918,0.005939785,0.0018762981,0.0028214506,0.0011557295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054519503,0.000050419945,0.00035964727,0.00008196587,0.000041043935,0.00007292532,0.0001423174,0.084290534,0.00032580213,0.88928,0.0034232861,0.021877462],"study_design_scores_gemma":[0.000028414875,0.000013379756,0.00008851279,0.000017068063,0.000014082772,0.00004237173,0.000032815078,0.22443426,0.00015763483,0.771085,0.004071594,0.000014759534],"about_ca_topic_score_codex":0.0058453893,"about_ca_topic_score_gemma":0.0070501263,"teacher_disagreement_score":0.008482985,"about_ca_system_score_codex":0.0028579999,"about_ca_system_score_gemma":0.002492678,"threshold_uncertainty_score":0.028378427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081550285,0.00026501546,0.90452236,0.0006570722,0.00011356162,0.00013949892,0.000091094116,0.0007430756,0.011917977],"genre_scores_gemma":[0.95214385,0.00013279528,0.041024435,0.00012914387,0.00006044862,0.00014569944,0.00006898019,0.00004571538,0.006248832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989336,0.0002865924,0.000047951704,0.00025495622,0.00029744816,0.00017935707],"domain_scores_gemma":[0.99824524,0.0006265228,0.00028950564,0.00041398645,0.00023444659,0.00019035648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013880307,0.0005203918,0.00074599165,0.0003904823,0.00086647423,0.0013769633,0.0019326471,0.0008189108,0.003743517],"category_scores_gemma":[0.004234329,0.00032367246,0.00031811843,0.0004364521,0.0010532291,0.0020032446,0.0020341654,0.00062662765,0.0006186727],"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.00087062415,0.00018469674,0.0016767633,0.000186061,0.00011993909,0.00046734803,0.00051250466,0.6957894,0.022408534,0.2085415,0.005409209,0.063833416],"study_design_scores_gemma":[0.000052523632,0.000062915096,0.00017494458,0.0000065026766,0.000011099446,0.00009048703,0.000042803462,0.9533351,0.0019336893,0.04148679,0.00279134,0.00001193958],"about_ca_topic_score_codex":0.001004836,"about_ca_topic_score_gemma":0.0009908519,"teacher_disagreement_score":0.003743517,"about_ca_system_score_codex":0.0010174133,"about_ca_system_score_gemma":0.0008201747,"threshold_uncertainty_score":0.012523353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002853167,0.18147048,0.4355428,0.052019663,0.026939953,0.00019948196,0.0008325096,0.00035270146,0.2997893],"genre_scores_gemma":[0.19930275,0.20475432,0.249444,0.034894872,0.07709041,0.0019629016,0.0012340472,0.00080836535,0.23050839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921083,0.0002958232,0.00005989695,0.00011530935,0.0002476589,0.00007042444],"domain_scores_gemma":[0.9991273,0.0005974618,0.00004443573,0.000060741302,0.0001196418,0.000050371007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062976,0.0017963697,0.0011597145,0.001920384,0.0011760824,0.0038297102,0.0015399269,0.0030156733,0.010112086],"category_scores_gemma":[0.0029500693,0.0006594129,0.001338238,0.0016204108,0.0046881908,0.0065067965,0.0018373487,0.0053274604,0.003534858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004934606,0.000029716939,0.000038915714,0.00016164625,0.000010044855,0.000038193713,0.00012920618,0.0013810301,0.00017192935,0.94258684,0.040839557,0.014607961],"study_design_scores_gemma":[0.0000041705666,0.000012913217,0.00008500896,0.00016178194,0.00000620002,0.000052497766,0.000043652868,0.0013214524,0.00006066643,0.86281574,0.13542277,0.000013084825],"about_ca_topic_score_codex":0.0012459886,"about_ca_topic_score_gemma":0.0015818735,"teacher_disagreement_score":0.010112086,"about_ca_system_score_codex":0.002607501,"about_ca_system_score_gemma":0.0014638515,"threshold_uncertainty_score":0.03382826},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06978366,0.00023871989,0.9263891,0.00063506863,0.000059130893,0.00011421641,0.00016511172,0.00018125727,0.0024337636],"genre_scores_gemma":[0.9234766,0.00033417932,0.07056453,0.00012314915,0.00011025772,0.00019794221,0.00037280505,0.000044249424,0.0047763293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960835,0.0020279144,0.00019385321,0.00082465075,0.0004604503,0.0004095615],"domain_scores_gemma":[0.9585359,0.037378214,0.001686603,0.0009163419,0.00090002746,0.0005828133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061698686,0.0014157136,0.0034177322,0.0012062714,0.0005332314,0.0020059957,0.0022661649,0.0017733529,0.0038135122],"category_scores_gemma":[0.030638505,0.0018280214,0.00090512214,0.0011710358,0.0016307234,0.0032141139,0.0020663678,0.0023546887,0.00033944382],"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.0006302485,0.00019436705,0.0026524358,0.00019003608,0.00019511364,0.00011575788,0.00013198776,0.89756525,0.0011020174,0.06715469,0.0009780918,0.029089972],"study_design_scores_gemma":[0.000044074044,0.000037212525,0.00027436897,0.000007085742,0.000014316117,0.000010311266,0.000011303261,0.97058165,0.00028894443,0.02853807,0.00018373696,0.000008947774],"about_ca_topic_score_codex":0.011566303,"about_ca_topic_score_gemma":0.008380259,"teacher_disagreement_score":0.011566303,"about_ca_system_score_codex":0.001927626,"about_ca_system_score_gemma":0.002474329,"threshold_uncertainty_score":0.032629788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021028336,0.009180433,0.40622598,0.011047273,0.0010191768,0.00015728765,0.0007051692,0.00024950577,0.55038685],"genre_scores_gemma":[0.56051195,0.02192102,0.10633858,0.0036083912,0.0021760967,0.0005348214,0.0008965376,0.00018711777,0.30382562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993612,0.0002449592,0.000025189704,0.00010744425,0.00019648908,0.00006476501],"domain_scores_gemma":[0.99925655,0.0005159858,0.000050755738,0.0000616707,0.00007479575,0.00004026517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008751633,0.00076085835,0.00048443975,0.000357641,0.00054045883,0.0016563942,0.00071017037,0.0011449559,0.008739124],"category_scores_gemma":[0.0025047066,0.0003274438,0.0005197268,0.0005688995,0.0014344704,0.002372052,0.00083120854,0.0019070947,0.0013518622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037592788,0.000007660121,0.000028975126,0.000024783856,0.0000035958801,0.000020227086,0.000052619707,0.003983926,0.00008954183,0.9856962,0.0050068083,0.005081885],"study_design_scores_gemma":[0.000006778964,0.000009414496,0.00011176712,0.000050057526,0.000004352253,0.000046541732,0.00002488903,0.016081057,0.00009728645,0.94049543,0.043063667,0.000008746125],"about_ca_topic_score_codex":0.0016711154,"about_ca_topic_score_gemma":0.0014882492,"teacher_disagreement_score":0.008739124,"about_ca_system_score_codex":0.0017842182,"about_ca_system_score_gemma":0.001085004,"threshold_uncertainty_score":0.029235244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27782837,0.0009391145,0.44147277,0.007694503,0.00010922771,0.00026743533,0.00047329807,0.00031064727,0.27090457],"genre_scores_gemma":[0.9753542,0.00013895347,0.020092146,0.00022803336,0.00006810504,0.0001650776,0.00007690913,0.00002330363,0.0038533697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905009,0.0045421403,0.0006701453,0.0012128968,0.0016403005,0.0014336122],"domain_scores_gemma":[0.93864095,0.04353158,0.0051177763,0.0064729694,0.0041129002,0.0021238797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010959437,0.0005729178,0.0013162732,0.001653702,0.0019148308,0.0053277863,0.0014040172,0.0022538407,0.011842273],"category_scores_gemma":[0.051783524,0.000720448,0.0011282294,0.0013315452,0.0053527295,0.009199129,0.0032182396,0.0036392459,0.0006293761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053180534,0.000034687477,0.0011316291,0.00005116,0.00002703329,0.000039429426,0.00080432574,0.0014682194,0.00018920276,0.9884673,0.00045172469,0.0072821877],"study_design_scores_gemma":[0.000025855774,0.000024166582,0.0006912531,0.000015453654,0.000015676847,0.000030438161,0.0001752887,0.0040812334,0.00006880042,0.99431735,0.0005457928,0.000008701654],"about_ca_topic_score_codex":0.0023039202,"about_ca_topic_score_gemma":0.0023713084,"teacher_disagreement_score":0.011842273,"about_ca_system_score_codex":0.0020212096,"about_ca_system_score_gemma":0.0017457013,"threshold_uncertainty_score":0.057959735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27608973,0.0004903123,0.6881505,0.003805757,0.000052704785,0.00061106303,0.0014360838,0.00066894374,0.028694902],"genre_scores_gemma":[0.91827637,0.0003920587,0.073269874,0.00055800873,0.00015625573,0.0005738425,0.0010986183,0.00014383784,0.005531137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938939,0.0019497307,0.00028150453,0.001685902,0.0012457741,0.0009431105],"domain_scores_gemma":[0.9780899,0.016239282,0.0018401701,0.001987143,0.000867193,0.0009763204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003071882,0.001623688,0.0016236741,0.0017290136,0.0015755,0.005780389,0.0039659827,0.0022477275,0.0061390754],"category_scores_gemma":[0.021924617,0.00095319614,0.0021241442,0.0014275707,0.0046917363,0.012590484,0.004664886,0.0057587614,0.00048045907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030029714,0.0003586911,0.002703855,0.00035268904,0.00013695475,0.0003202563,0.001246844,0.09315288,0.004364038,0.87684494,0.0026874447,0.01753108],"study_design_scores_gemma":[0.00007847167,0.00004033213,0.0004615477,0.00003008013,0.00004050856,0.00013353319,0.00019986625,0.23468594,0.0020769874,0.76071656,0.0015074249,0.000028630899],"about_ca_topic_score_codex":0.003164736,"about_ca_topic_score_gemma":0.0027156905,"teacher_disagreement_score":0.0061390754,"about_ca_system_score_codex":0.0035425574,"about_ca_system_score_gemma":0.0022649502,"threshold_uncertainty_score":0.025703192},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28245965,0.0032080503,0.6438103,0.004524583,0.00028606184,0.0002677086,0.00026125502,0.000810945,0.06437143],"genre_scores_gemma":[0.98323214,0.00068600767,0.0111022815,0.0003403297,0.0001140631,0.0002455766,0.000073224546,0.00012260464,0.0040836735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947547,0.0026416592,0.00017258937,0.00041930185,0.0010571857,0.0009546315],"domain_scores_gemma":[0.91959125,0.061804287,0.0074530724,0.005071406,0.004053862,0.002026037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013949261,0.0010121969,0.0016774662,0.002058344,0.0013309384,0.0033162804,0.003436678,0.0030970606,0.00725517],"category_scores_gemma":[0.10340935,0.0009132626,0.0010086347,0.0010714178,0.005847723,0.0069527617,0.0035544084,0.0035009556,0.00092206243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024636378,0.00017920235,0.002031055,0.000244623,0.00008990448,0.00027844193,0.00027401806,0.30381048,0.001693806,0.67454267,0.0045818677,0.012027476],"study_design_scores_gemma":[0.00006581136,0.00015700735,0.0006299243,0.00009777065,0.00003574418,0.00024349497,0.00012112656,0.72989243,0.00067204837,0.26662898,0.0014105397,0.000045071003],"about_ca_topic_score_codex":0.0015393881,"about_ca_topic_score_gemma":0.00053596107,"teacher_disagreement_score":0.013949261,"about_ca_system_score_codex":0.0038974725,"about_ca_system_score_gemma":0.0013820475,"threshold_uncertainty_score":0.073771596},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037240386,0.018947463,0.46116033,0.014558479,0.001029069,0.00028115074,0.0011828712,0.00021986394,0.46538037],"genre_scores_gemma":[0.84539264,0.012073848,0.071430296,0.0025105395,0.0018387521,0.00051035354,0.0007515288,0.00006579492,0.06542636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983041,0.00070087326,0.0000958252,0.00026971614,0.00045040876,0.00017897639],"domain_scores_gemma":[0.9983309,0.0009611475,0.00018364353,0.0001300696,0.00025355205,0.00014071417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015539504,0.0010042608,0.0008762338,0.0013744746,0.000744842,0.0032162855,0.0007577737,0.0016928602,0.013463481],"category_scores_gemma":[0.0035245756,0.00035491903,0.00067955337,0.0016739474,0.0036249924,0.0037587297,0.0015441623,0.0021568378,0.0012245773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003621186,0.0000064136725,0.000048754853,0.000026009162,0.000004980104,0.000031564265,0.000049747094,0.0020330348,0.00009796471,0.99404067,0.0011911712,0.0024660418],"study_design_scores_gemma":[0.0000065431614,0.000007741313,0.00007815773,0.000031778272,0.000004501254,0.00004355841,0.000031917618,0.0054821945,0.000050193456,0.98029536,0.013963479,0.0000044725675],"about_ca_topic_score_codex":0.002573819,"about_ca_topic_score_gemma":0.0018862276,"teacher_disagreement_score":0.013463481,"about_ca_system_score_codex":0.0021077853,"about_ca_system_score_gemma":0.0014798132,"threshold_uncertainty_score":0.045039773},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13260224,0.0055099055,0.6859211,0.03359161,0.0010176902,0.0001830419,0.0006646637,0.00024375475,0.14026605],"genre_scores_gemma":[0.9152,0.0020060912,0.060701836,0.0018880498,0.000593786,0.00026266027,0.00016506416,0.00010861614,0.019073872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549145,0.0021789735,0.00028865167,0.00070280663,0.0008976184,0.00044058432],"domain_scores_gemma":[0.97122395,0.022209184,0.0011113234,0.0025066948,0.0016259688,0.0013227583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009517485,0.0007123458,0.0019798526,0.0022524635,0.0029495487,0.008172478,0.0023126176,0.004909772,0.011231204],"category_scores_gemma":[0.050613478,0.00065269525,0.0015256782,0.0023354525,0.010512175,0.02295928,0.0039744666,0.0062079546,0.0006980773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010535032,0.0000052890778,0.000038177943,0.000016109892,0.0000053589,0.000014337251,0.000075318516,0.0012381999,0.000034842622,0.99711597,0.00046860176,0.0009772948],"study_design_scores_gemma":[0.0000062546874,0.000001928755,0.000015128169,0.000005179639,0.0000020707228,0.000009785045,0.000015931955,0.0034540861,0.000013257448,0.9959592,0.0005137848,0.0000034294437],"about_ca_topic_score_codex":0.0025942617,"about_ca_topic_score_gemma":0.0014838115,"teacher_disagreement_score":0.011231204,"about_ca_system_score_codex":0.0034078152,"about_ca_system_score_gemma":0.0030497136,"threshold_uncertainty_score":0.050333917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52750045,0.0014631961,0.24065185,0.016690286,0.00047025055,0.00034532972,0.0003495477,0.0006756101,0.21185358],"genre_scores_gemma":[0.9817136,0.00016453702,0.0059831557,0.0002003807,0.00013133332,0.0000668108,0.000018303837,0.0000316271,0.011690278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996878,0.0014105994,0.00017213929,0.00045904025,0.00047869715,0.00060144946],"domain_scores_gemma":[0.9841474,0.010035229,0.0014176038,0.0013160575,0.0015193302,0.0015644422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582931,0.0007145873,0.0016290242,0.0010984443,0.0012718793,0.003894995,0.0014102417,0.0035087566,0.012491411],"category_scores_gemma":[0.024786228,0.0008149306,0.0005991034,0.00067306706,0.0029702317,0.00509129,0.0021604174,0.002315644,0.0014949278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068435055,0.00020489871,0.0009928406,0.00027342179,0.000071437906,0.000368916,0.0005804586,0.019424904,0.0036643837,0.951993,0.0049685375,0.01677287],"study_design_scores_gemma":[0.00024270437,0.00020348412,0.00085823744,0.000060319708,0.000043270797,0.00023007448,0.00031243966,0.06973605,0.0012165635,0.92364585,0.003418614,0.00003235234],"about_ca_topic_score_codex":0.0005456616,"about_ca_topic_score_gemma":0.0007406937,"teacher_disagreement_score":0.012491411,"about_ca_system_score_codex":0.0018580933,"about_ca_system_score_gemma":0.0022919157,"threshold_uncertainty_score":0.041787922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43292108,0.001245029,0.5372618,0.0028346311,0.00009619705,0.00023575012,0.00022395213,0.00018378352,0.024997711],"genre_scores_gemma":[0.98537004,0.00041696554,0.009305539,0.00013751925,0.00006649928,0.00012241253,0.0000611802,0.00001606196,0.0045038033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997827,0.00095603144,0.00008124352,0.00045443786,0.00036500988,0.00031619275],"domain_scores_gemma":[0.98332614,0.012326509,0.0022860244,0.00087710447,0.0005871108,0.0005970622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632901,0.0011726767,0.0014782829,0.001001722,0.0008871893,0.0020742184,0.0014027515,0.0021762217,0.0038321174],"category_scores_gemma":[0.022951815,0.00035670665,0.0010907353,0.0006721994,0.0034303034,0.00443526,0.002255922,0.002482402,0.00026906634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012990362,0.00017545947,0.0068434197,0.000187334,0.00021680696,0.00064459996,0.00079873163,0.30650926,0.0013951797,0.6645601,0.0011925931,0.01734661],"study_design_scores_gemma":[0.000034152396,0.00008478391,0.0008481792,0.000025319368,0.00003350195,0.00009464501,0.00008397095,0.48575607,0.00034161532,0.51179135,0.0008757078,0.00003073975],"about_ca_topic_score_codex":0.0037291737,"about_ca_topic_score_gemma":0.0026204637,"teacher_disagreement_score":0.0038321174,"about_ca_system_score_codex":0.0016906003,"about_ca_system_score_gemma":0.0007511586,"threshold_uncertainty_score":0.019212842},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085587844,0.00024424383,0.90766776,0.00038628755,0.000045555684,0.00008322222,0.000060506263,0.00020585583,0.005718771],"genre_scores_gemma":[0.9631678,0.00015854662,0.03389946,0.000055409317,0.000031328786,0.00017475475,0.000047389127,0.000020279671,0.0024449124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989423,0.0005012228,0.00004981821,0.00019636384,0.0001784707,0.00013188375],"domain_scores_gemma":[0.99691474,0.0021057578,0.00045577416,0.00014536039,0.00019434183,0.00018411691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013801141,0.0006993625,0.0013173097,0.0005602722,0.00059536815,0.0011269829,0.001409765,0.0010985327,0.0016248394],"category_scores_gemma":[0.0041231145,0.00042131916,0.0007730397,0.00047321807,0.0015780757,0.0010563623,0.0013135687,0.0011394297,0.00019077769],"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.000053641157,0.00003942988,0.00068049214,0.00002920193,0.000029907553,0.00008417702,0.000081027174,0.9665646,0.0008681212,0.026184706,0.00018704399,0.0051976815],"study_design_scores_gemma":[0.000010434725,0.000018741583,0.000060307266,0.0000018743254,0.0000035641924,0.00001097162,0.0000066183457,0.99191886,0.00008988739,0.0077362033,0.00013819341,0.0000043403593],"about_ca_topic_score_codex":0.0038582876,"about_ca_topic_score_gemma":0.00343585,"teacher_disagreement_score":0.0038582876,"about_ca_system_score_codex":0.0013325657,"about_ca_system_score_gemma":0.0010319651,"threshold_uncertainty_score":0.009668469},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037686035,0.0016842708,0.033107128,0.013137765,0.00040476833,0.000053223346,0.00037580804,0.00016052806,0.9133905],"genre_scores_gemma":[0.78244334,0.00086326466,0.0042201877,0.002220297,0.000566047,0.00013503362,0.00018250057,0.00011215412,0.20925717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981628,0.0007587851,0.000048242677,0.00033369736,0.00038820165,0.0003083416],"domain_scores_gemma":[0.9952401,0.00291655,0.00029428623,0.00076917,0.00037046956,0.0004094036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023649142,0.0005233101,0.0010941536,0.0016701802,0.0017971017,0.0038884399,0.0010803291,0.0033324268,0.09269295],"category_scores_gemma":[0.011882192,0.00036270503,0.0008680939,0.0012879843,0.0027826724,0.0045628618,0.002211316,0.0029385444,0.00608168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031466596,0.000014480742,0.00011080921,0.00003231329,0.000013370318,0.00002662682,0.00009203558,0.00039575598,0.00009460775,0.9841133,0.0077693667,0.0073059984],"study_design_scores_gemma":[0.000016226491,0.00001650659,0.00033065773,0.000025556232,0.00001390461,0.000083786384,0.00010271824,0.0010898763,0.000091322036,0.98429227,0.013930195,0.000006954397],"about_ca_topic_score_codex":0.0007173575,"about_ca_topic_score_gemma":0.0009213217,"teacher_disagreement_score":0.09269295,"about_ca_system_score_codex":0.0015880943,"about_ca_system_score_gemma":0.00090919714,"threshold_uncertainty_score":0.31008875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09341336,0.00014858392,0.9020344,0.00025729102,0.000034640376,0.00014803484,0.000047755417,0.0002063828,0.0037096138],"genre_scores_gemma":[0.8961874,0.00014596833,0.10169101,0.00007301657,0.00002573125,0.00024178972,0.000076690056,0.00005467958,0.0015036607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617344,0.0018029416,0.00014279815,0.00064251566,0.0005724277,0.0006660275],"domain_scores_gemma":[0.9930917,0.004911586,0.00071896956,0.00043995102,0.0004568443,0.00038092223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046249633,0.0016754335,0.0024200825,0.0009619156,0.0011658698,0.0026059316,0.0021725232,0.0014063517,0.0017427065],"category_scores_gemma":[0.016690375,0.0006380484,0.0007667624,0.0010701377,0.0031935726,0.002991958,0.0025453786,0.0013765326,0.00020887253],"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.0001445655,0.00004237618,0.00046721663,0.00007192274,0.00006240121,0.00014129368,0.00023358483,0.83460426,0.0009966684,0.15292339,0.00048333133,0.009829047],"study_design_scores_gemma":[0.000040955434,0.000041081556,0.0000666916,0.000009899615,0.000010846864,0.000016095593,0.000039540762,0.87285244,0.0005229019,0.12610798,0.0002799773,0.00001156504],"about_ca_topic_score_codex":0.006172866,"about_ca_topic_score_gemma":0.004296666,"teacher_disagreement_score":0.006172866,"about_ca_system_score_codex":0.0025492895,"about_ca_system_score_gemma":0.0029157042,"threshold_uncertainty_score":0.024459422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72426724,0.0014874429,0.17778453,0.008294692,0.00014895973,0.00014015388,0.00043284873,0.000093457566,0.08735071],"genre_scores_gemma":[0.98897845,0.00034897495,0.005708106,0.00013785486,0.000024311375,0.00008240149,0.00004124334,0.000009736673,0.0046689394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984628,0.0009225547,0.000043301203,0.00015798642,0.00011336821,0.00029998575],"domain_scores_gemma":[0.99516475,0.002966719,0.0009835449,0.00018540525,0.00017816634,0.0005213399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185845,0.00070723007,0.0008432725,0.00075762527,0.0013394424,0.0037236803,0.001995893,0.0027117056,0.0071254387],"category_scores_gemma":[0.008621015,0.0004913927,0.0008386085,0.00086484384,0.0037881539,0.0040493966,0.0021538741,0.0023176915,0.0004814631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012484154,0.00012773885,0.003865357,0.0000697459,0.000067513065,0.0004733178,0.0009021195,0.19674955,0.0007495617,0.7913746,0.0010024115,0.004493351],"study_design_scores_gemma":[0.00012099207,0.000093951174,0.0013754521,0.000032241187,0.000029426403,0.00018541052,0.00071095355,0.51369387,0.0001644466,0.4798523,0.0036887939,0.000052131865],"about_ca_topic_score_codex":0.007195678,"about_ca_topic_score_gemma":0.004775034,"teacher_disagreement_score":0.007195678,"about_ca_system_score_codex":0.002776207,"about_ca_system_score_gemma":0.0013570846,"threshold_uncertainty_score":0.02383697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0325176,0.0002654634,0.95958364,0.0011799448,0.000032521955,0.00007093821,0.00003437959,0.00006143694,0.006253977],"genre_scores_gemma":[0.84003544,0.00045859712,0.15332095,0.00036316493,0.00010155726,0.00042247385,0.000057500314,0.000042861368,0.0051974957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965816,0.0022025092,0.00008876179,0.00034417212,0.0005386346,0.00024430652],"domain_scores_gemma":[0.99413824,0.00405127,0.00063927454,0.00032455457,0.00054384646,0.00030286275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047789994,0.0010611664,0.0015614718,0.00066518324,0.0007924296,0.0023188319,0.0033051588,0.0024753143,0.0017493473],"category_scores_gemma":[0.013189551,0.0005764667,0.0009005226,0.00058403896,0.0041073347,0.0029884526,0.0023905355,0.002804248,0.00041755312],"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.000030563093,0.000042141364,0.00035659145,0.000045155237,0.000027769345,0.00012599555,0.0002703431,0.70569885,0.00047089896,0.28959802,0.0003610785,0.0029725875],"study_design_scores_gemma":[0.000014793484,0.000016694947,0.00003582054,0.0000050202725,0.0000025542536,0.000008148224,0.000014762635,0.91366094,0.000049852366,0.085929185,0.00025783142,0.0000043965347],"about_ca_topic_score_codex":0.004974083,"about_ca_topic_score_gemma":0.0027315174,"teacher_disagreement_score":0.004974083,"about_ca_system_score_codex":0.0019368946,"about_ca_system_score_gemma":0.0021703648,"threshold_uncertainty_score":0.025274038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04327078,0.00045711637,0.5521673,0.007641407,0.00027064662,0.00064592605,0.00061330554,0.0005298715,0.39440373],"genre_scores_gemma":[0.7560431,0.0006950081,0.18385269,0.0016509142,0.00022213242,0.0028958588,0.00050698937,0.0002277348,0.053905573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9831404,0.0072153048,0.0010501244,0.002529613,0.0039804326,0.0020841868],"domain_scores_gemma":[0.9815719,0.01032737,0.0010099808,0.0036767297,0.0023822573,0.0010317983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074775293,0.0015301337,0.0016999689,0.0021734433,0.00346588,0.007364658,0.0029788015,0.005488426,0.01603399],"category_scores_gemma":[0.025189787,0.0009115057,0.0021791293,0.0016487531,0.006175807,0.00723058,0.0067556584,0.0067317225,0.0021541037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012175155,0.000030095916,0.00009555847,0.000027360731,0.00001565838,0.00002318183,0.00022658272,0.0009752207,0.0001284855,0.9935288,0.0006170892,0.004319772],"study_design_scores_gemma":[0.000010429657,0.000011060338,0.000055160363,0.000020457957,0.0000111805575,0.00002880729,0.000107335036,0.0021428154,0.0001700816,0.9938152,0.0036210741,0.0000065508016],"about_ca_topic_score_codex":0.0012459785,"about_ca_topic_score_gemma":0.002224391,"teacher_disagreement_score":0.01603399,"about_ca_system_score_codex":0.0026771063,"about_ca_system_score_gemma":0.0054276073,"threshold_uncertainty_score":0.053638995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112322755,0.0029457933,0.71412534,0.014238672,0.00071202894,0.00012961979,0.0010648165,0.0005964137,0.2549551],"genre_scores_gemma":[0.5633476,0.0048698783,0.31303942,0.008460982,0.0016647121,0.0009902517,0.0020919594,0.0008700879,0.1046651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556196,0.0020119688,0.0002852581,0.00090842036,0.0008075545,0.00042480358],"domain_scores_gemma":[0.9920657,0.0054750447,0.00026939504,0.000998249,0.00096797454,0.00022365755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064689117,0.0011054982,0.0015210927,0.0021796923,0.0036375849,0.005451229,0.0026220519,0.0024446552,0.013938515],"category_scores_gemma":[0.011673673,0.0015650346,0.002967725,0.0026141775,0.010166025,0.014708255,0.00556848,0.009375622,0.0038507388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011142459,0.000006641351,0.00003582749,0.000023777538,0.0000072798093,0.000011098743,0.000067952395,0.0002263866,0.000091266214,0.9954,0.001486637,0.0026319828],"study_design_scores_gemma":[0.000007910839,0.0000021466626,0.000016675209,0.000008845721,0.0000048307006,0.000008622585,0.0000081943845,0.0006882452,0.00010462248,0.99623966,0.0029066224,0.0000036296983],"about_ca_topic_score_codex":0.0039863912,"about_ca_topic_score_gemma":0.0027528233,"teacher_disagreement_score":0.013938515,"about_ca_system_score_codex":0.004706735,"about_ca_system_score_gemma":0.0027887856,"threshold_uncertainty_score":0.04662901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010799249,0.00027802814,0.97107047,0.0006721082,0.000113706774,0.00044356709,0.0012871788,0.015468282,0.009586693],"genre_scores_gemma":[0.030873697,0.00043573824,0.9561901,0.00047583604,0.00016023158,0.0013152797,0.0020959412,0.0009778393,0.007475291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644107,0.0015515888,0.0005093221,0.00040515853,0.0009807918,0.00011206064],"domain_scores_gemma":[0.9934378,0.004348996,0.00031318195,0.0007725107,0.00090767164,0.00021974392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061215856,0.0015488657,0.0013693959,0.003251584,0.00088566396,0.0051355483,0.0025012922,0.0020165683,0.037900284],"category_scores_gemma":[0.013579844,0.00080781337,0.0011199894,0.0027961165,0.0010522453,0.0042667226,0.0030095507,0.0023247213,0.014324118],"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.00056864566,0.0002163147,0.0011597881,0.0013002668,0.00014016176,0.0007941909,0.0012067355,0.028867992,0.007978146,0.2013446,0.09552353,0.66089964],"study_design_scores_gemma":[0.00029678294,0.00023267917,0.0008549537,0.00077739824,0.000113367525,0.0007365465,0.00026723524,0.35409173,0.011347986,0.26116604,0.36996916,0.00014611351],"about_ca_topic_score_codex":0.0010610386,"about_ca_topic_score_gemma":0.00078356796,"teacher_disagreement_score":0.037900284,"about_ca_system_score_codex":0.0010561142,"about_ca_system_score_gemma":0.0018695268,"threshold_uncertainty_score":0.12678915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057403557,0.022746868,0.6580215,0.041371245,0.0043239,0.00007567917,0.0002604074,0.00012948297,0.26733056],"genre_scores_gemma":[0.43987656,0.033945337,0.4066224,0.012178812,0.012727505,0.0007725405,0.0004843489,0.00043367242,0.09295884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946403,0.002806579,0.00015249467,0.00075327954,0.0013377946,0.00030953545],"domain_scores_gemma":[0.9974481,0.0012102568,0.00014546189,0.00042614125,0.0004829918,0.00028710108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040296656,0.0011245287,0.0013185587,0.0029570367,0.002993482,0.005873783,0.0021385613,0.0029031066,0.008708313],"category_scores_gemma":[0.005269898,0.00045010078,0.0018294392,0.002431704,0.010896728,0.011180476,0.004576555,0.0059195175,0.0018987005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015417207,0.0000025432864,0.00002742402,0.000015507654,0.000004097337,0.000015984408,0.00012297381,0.00029707246,0.000035655106,0.99564457,0.0013749487,0.0024577153],"study_design_scores_gemma":[0.0000031019672,0.0000075159915,0.000027531552,0.000043082717,0.000004314054,0.000053927302,0.00013725716,0.0021002628,0.00004735941,0.9204033,0.07716646,0.0000058837945],"about_ca_topic_score_codex":0.002874967,"about_ca_topic_score_gemma":0.0021562448,"teacher_disagreement_score":0.008708313,"about_ca_system_score_codex":0.0045612464,"about_ca_system_score_gemma":0.0029930794,"threshold_uncertainty_score":0.033094287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19318445,0.0002883574,0.7874959,0.0011770274,0.0000885006,0.00011708858,0.00036136303,0.0005456437,0.016741693],"genre_scores_gemma":[0.5717492,0.00023966303,0.42257908,0.00031003004,0.00010279173,0.00017268918,0.00037003736,0.00011397708,0.004362446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984792,0.0006788391,0.000072942305,0.00023060803,0.00040279442,0.00013560276],"domain_scores_gemma":[0.99453187,0.0041260957,0.00021040306,0.0006064143,0.00030983274,0.0002154072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001465431,0.00044463945,0.0007121406,0.00079526415,0.0009068629,0.0012391879,0.0010154659,0.00056611,0.0061302893],"category_scores_gemma":[0.010013741,0.00026211582,0.0005906369,0.0006848968,0.0015398081,0.0032069297,0.0022260414,0.001759497,0.0004993922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046461256,0.00015465057,0.0069965054,0.0002169091,0.00005717849,0.00023255775,0.00049158675,0.17120378,0.0073965583,0.70784694,0.004781412,0.1001573],"study_design_scores_gemma":[0.00003898937,0.00016509145,0.001560745,0.000044648103,0.000016040332,0.00015602888,0.00022797564,0.44770998,0.0064958525,0.5365807,0.006966049,0.00003803272],"about_ca_topic_score_codex":0.0013700273,"about_ca_topic_score_gemma":0.0019515017,"teacher_disagreement_score":0.0061302893,"about_ca_system_score_codex":0.0006343389,"about_ca_system_score_gemma":0.00079517125,"threshold_uncertainty_score":0.020507812},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1564352,0.00066890987,0.77242625,0.0010890404,0.00008358707,0.00029276303,0.0007206058,0.0003173465,0.06796629],"genre_scores_gemma":[0.6887966,0.0008536462,0.2813643,0.00029540624,0.00008163793,0.0008124683,0.0016706003,0.00016483454,0.025960527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977604,0.0011495545,0.00013926867,0.00026634737,0.00037767825,0.00030671223],"domain_scores_gemma":[0.9924664,0.0058241016,0.0004254695,0.00040539392,0.00055798684,0.00032065384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019547914,0.0012495172,0.0018642294,0.0023735352,0.0017094731,0.004940486,0.002261142,0.0020462682,0.009813806],"category_scores_gemma":[0.013021519,0.00089418655,0.0011642865,0.0028679604,0.002049324,0.005411754,0.0028319561,0.0024734254,0.001245533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026531823,0.00026212918,0.0013268733,0.00026937458,0.00006599143,0.000113152244,0.00048385115,0.060393613,0.0012565873,0.88775283,0.0041832295,0.043627057],"study_design_scores_gemma":[0.00004132677,0.000026510093,0.00015238361,0.000041146617,0.000015253038,0.000049771315,0.000099394885,0.10656928,0.00043742743,0.8910314,0.0015224467,0.000013546914],"about_ca_topic_score_codex":0.0015982114,"about_ca_topic_score_gemma":0.0024374723,"teacher_disagreement_score":0.009813806,"about_ca_system_score_codex":0.001471446,"about_ca_system_score_gemma":0.0017779354,"threshold_uncertainty_score":0.032830477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37567458,0.002820799,0.54033077,0.006151316,0.0002441766,0.0004068005,0.0005776483,0.0005515376,0.0732424],"genre_scores_gemma":[0.97902393,0.0006609787,0.012938344,0.00013815364,0.00007939854,0.00013226598,0.000053809985,0.00003194369,0.0069412026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98987496,0.006212235,0.00040133347,0.00094700156,0.00096674205,0.0015977293],"domain_scores_gemma":[0.96115696,0.02560406,0.0075535295,0.0028379841,0.0014727622,0.0013746792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008929739,0.0008389877,0.0017999285,0.0012072426,0.0015282618,0.005782702,0.0022458385,0.004345131,0.007042723],"category_scores_gemma":[0.037277773,0.0013562719,0.00092235237,0.0018366587,0.0028703054,0.00831412,0.0028452005,0.0033435773,0.000899887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093606673,0.00021140538,0.002333807,0.00026760204,0.000099675104,0.0005412607,0.00048796387,0.2844593,0.0014706587,0.67734265,0.0022187529,0.029630914],"study_design_scores_gemma":[0.00043780965,0.00050294545,0.0011743861,0.00007577571,0.000086066066,0.00028637503,0.0006049648,0.3748981,0.0013053627,0.61289954,0.007641082,0.000087425906],"about_ca_topic_score_codex":0.0038571844,"about_ca_topic_score_gemma":0.002376085,"teacher_disagreement_score":0.008929739,"about_ca_system_score_codex":0.004855447,"about_ca_system_score_gemma":0.0035172259,"threshold_uncertainty_score":0.047225595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029852746,0.0011099176,0.90655273,0.005792145,0.000249212,0.00005380923,0.0006136958,0.00030004626,0.055475675],"genre_scores_gemma":[0.882039,0.0012085794,0.0948183,0.0007603305,0.0011878229,0.00029097806,0.00071768666,0.0001741788,0.018803159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974015,0.0009082079,0.00013241588,0.00048761535,0.00082300836,0.00024723308],"domain_scores_gemma":[0.9928087,0.0041941726,0.00060278905,0.0012136445,0.0007771021,0.0004036354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022755307,0.0007679002,0.0011652485,0.0031350607,0.0012578754,0.0054739686,0.0017657779,0.001939712,0.0116533125],"category_scores_gemma":[0.014007915,0.0006462437,0.0015238284,0.00236014,0.0039537637,0.011034547,0.0029212253,0.0041622715,0.00096843677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037815387,0.000003887649,0.00006001911,0.00001043515,0.0000039729707,0.000004581006,0.000029589177,0.0023028015,0.000049629114,0.994995,0.00045534418,0.0020808822],"study_design_scores_gemma":[0.0000017007296,0.0000025788406,0.000058390597,0.000003992305,0.0000027676317,0.000010624037,0.000006746566,0.016751561,0.000026547978,0.9824417,0.000688587,0.0000047208846],"about_ca_topic_score_codex":0.001549292,"about_ca_topic_score_gemma":0.0010623488,"teacher_disagreement_score":0.0116533125,"about_ca_system_score_codex":0.0023900226,"about_ca_system_score_gemma":0.0010265107,"threshold_uncertainty_score":0.03898418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011937047,0.2809716,0.49322784,0.006338958,0.0035039068,0.00051124924,0.0013464154,0.00047839867,0.20168458],"genre_scores_gemma":[0.17974892,0.3278781,0.38499743,0.0071066185,0.010940641,0.002504103,0.0019165751,0.0006422096,0.08426541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992855,0.00022203142,0.00006411792,0.00012612733,0.00021578655,0.000086483575],"domain_scores_gemma":[0.9987558,0.00088582915,0.000092194394,0.00006270819,0.0001288325,0.00007471621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010961504,0.0030355642,0.002374284,0.0027587477,0.0015154601,0.003801898,0.0024279845,0.0040412527,0.008231441],"category_scores_gemma":[0.0030787252,0.0012559999,0.0020729415,0.007870661,0.0033753451,0.004800962,0.0022214465,0.004455792,0.0029788723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049504186,0.0002127345,0.00032251026,0.00083545916,0.000042852556,0.0005030935,0.0003272328,0.010681498,0.0008159357,0.89659065,0.03866957,0.05094906],"study_design_scores_gemma":[0.000026217444,0.00007372595,0.00031717255,0.00022155076,0.00003037746,0.0006935972,0.00012065707,0.010228862,0.00012538,0.87137586,0.116733864,0.000052744657],"about_ca_topic_score_codex":0.003765056,"about_ca_topic_score_gemma":0.0046207723,"teacher_disagreement_score":0.008231441,"about_ca_system_score_codex":0.0020287952,"about_ca_system_score_gemma":0.0009646105,"threshold_uncertainty_score":0.027536869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16691323,0.0004588412,0.7983373,0.00165702,0.00006021884,0.00014508459,0.00015842858,0.00009594437,0.032173984],"genre_scores_gemma":[0.97391856,0.00043177712,0.01964689,0.00012483745,0.000042727435,0.00021536778,0.00004679873,0.000014153349,0.005558828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992072,0.0004469491,0.00001930902,0.000072850984,0.00013194351,0.00012171352],"domain_scores_gemma":[0.99857724,0.00095675385,0.00019900007,0.00004576364,0.00010408702,0.00011722276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376896,0.0007345977,0.0007464429,0.00037982877,0.0004870011,0.0013269072,0.0008864407,0.0013169334,0.001740282],"category_scores_gemma":[0.0035742042,0.00030276782,0.00044423173,0.0006052277,0.0017711543,0.0015809294,0.0012301403,0.0012024421,0.0001459103],"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.000066793735,0.000041041116,0.0003761498,0.000041040454,0.000024438084,0.000130944,0.00009327904,0.6201459,0.00066286704,0.37344375,0.00078822055,0.004185575],"study_design_scores_gemma":[0.000032797172,0.000037679176,0.00014367643,0.000008675389,0.0000057665634,0.000027122267,0.000043872064,0.87577826,0.00016754425,0.12304988,0.00069419463,0.000010525621],"about_ca_topic_score_codex":0.004942636,"about_ca_topic_score_gemma":0.0032423446,"teacher_disagreement_score":0.004942636,"about_ca_system_score_codex":0.0021901878,"about_ca_system_score_gemma":0.001463574,"threshold_uncertainty_score":0.015891016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053344425,0.00131693,0.87714595,0.0035457136,0.0001543418,0.00030603862,0.00022037314,0.00035489563,0.06361123],"genre_scores_gemma":[0.9278181,0.0014728486,0.05678013,0.0006077756,0.00032561104,0.0008857071,0.00009106754,0.000078161705,0.011940517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955052,0.0021527305,0.00020133702,0.00067040185,0.00094135606,0.0005288653],"domain_scores_gemma":[0.97495246,0.018548403,0.0028254704,0.0016607976,0.0011094593,0.00090338686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005518556,0.0012839162,0.0011494949,0.0019727563,0.0015234889,0.0047509614,0.0028516622,0.0031913419,0.009669079],"category_scores_gemma":[0.026085133,0.0007389083,0.0013267909,0.0013085982,0.0045564487,0.007055175,0.0035970276,0.0025062726,0.00093334087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020023741,0.000026370357,0.00016916453,0.00007274772,0.000025657497,0.000080633676,0.00013364173,0.018471267,0.00049144146,0.9744514,0.00096073904,0.0050969366],"study_design_scores_gemma":[0.00005688806,0.000026451975,0.00009418641,0.000023445837,0.000013633787,0.000072992305,0.000034485474,0.078026794,0.00021189945,0.9189605,0.0024620215,0.000016714233],"about_ca_topic_score_codex":0.0015112939,"about_ca_topic_score_gemma":0.0012862203,"teacher_disagreement_score":0.009669079,"about_ca_system_score_codex":0.0028431383,"about_ca_system_score_gemma":0.0014683057,"threshold_uncertainty_score":0.03234625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23184268,0.00018792013,0.75991154,0.0007619379,0.000037829737,0.00009423354,0.000082012884,0.00015647202,0.00692537],"genre_scores_gemma":[0.9776003,0.000093902694,0.019771075,0.000049172948,0.000015946529,0.000113306196,0.00003106272,0.000011629095,0.0023136153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998865,0.00056427065,0.000034724555,0.0001795996,0.00016388905,0.00019247086],"domain_scores_gemma":[0.9975309,0.0015618954,0.00041740903,0.00012821637,0.00014575447,0.0002158821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017774777,0.00044624685,0.00096448377,0.00036655302,0.00058509223,0.0009009801,0.001273278,0.00090720557,0.0013726164],"category_scores_gemma":[0.004013254,0.00039509087,0.00054372614,0.00033536836,0.0015682329,0.0013618402,0.0014262627,0.0009432071,0.0001611037],"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.00009054874,0.000040070016,0.0008610218,0.000028223447,0.000032130723,0.000116001735,0.00011309325,0.9236497,0.0010621751,0.06847294,0.00026819573,0.0052658767],"study_design_scores_gemma":[0.000025665599,0.00002635108,0.00012953977,0.0000024859717,0.000004241806,0.000016077918,0.000016582544,0.9756604,0.00016376798,0.023707336,0.00024118707,0.000006385877],"about_ca_topic_score_codex":0.0050274334,"about_ca_topic_score_gemma":0.005101113,"teacher_disagreement_score":0.0050274334,"about_ca_system_score_codex":0.0014547914,"about_ca_system_score_gemma":0.0013102869,"threshold_uncertainty_score":0.010555267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8659164,0.0008795494,0.017037816,0.0015441529,0.000090300564,0.00028403944,0.00055968034,0.000098313176,0.113589674],"genre_scores_gemma":[0.99471176,0.00018408115,0.003028038,0.000052391777,0.000010213158,0.000058948535,0.00016488628,0.000004667473,0.0017849987],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992373,0.0003756379,0.000041688534,0.00006293881,0.00018563887,0.00009681198],"domain_scores_gemma":[0.9929033,0.003607158,0.0018793563,0.00021636137,0.0006244661,0.00076929916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012397285,0.0006200056,0.00031540683,0.004237833,0.0004253318,0.0024240264,0.00039900196,0.0006161662,0.010067441],"category_scores_gemma":[0.01523827,0.000110870424,0.00023058892,0.0014920882,0.0020972695,0.0025444746,0.0014452772,0.00063589297,0.0007694363],"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.0023551718,0.0006514085,0.5074719,0.00048606357,0.00020482871,0.0007174728,0.007044188,0.020938355,0.0026191685,0.1873546,0.007779309,0.26237756],"study_design_scores_gemma":[0.00020663717,0.0013291566,0.5194728,0.00046449844,0.00013921605,0.0004760237,0.027752029,0.12106924,0.0018552723,0.3091936,0.017876029,0.00016549871],"about_ca_topic_score_codex":0.0036012738,"about_ca_topic_score_gemma":0.005446983,"teacher_disagreement_score":0.010067441,"about_ca_system_score_codex":0.0011481269,"about_ca_system_score_gemma":0.00061613944,"threshold_uncertainty_score":0.03367889},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09682649,0.00033218702,0.8892657,0.00046553565,0.00004011756,0.00013307689,0.00006623742,0.0000740861,0.012796512],"genre_scores_gemma":[0.9267555,0.00024755014,0.0688341,0.00011518674,0.000027508087,0.00028112513,0.000036826463,0.000015714855,0.0036865517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964696,0.0023657652,0.000107157066,0.00027994742,0.00046082144,0.0003167329],"domain_scores_gemma":[0.99748576,0.0018909139,0.00022631578,0.00006915155,0.00019260787,0.00013519617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027758214,0.0010555087,0.0014023447,0.0006894532,0.0006396658,0.0018928121,0.0010846505,0.0013305722,0.0012865731],"category_scores_gemma":[0.0053456337,0.0004593878,0.00060352037,0.00080490694,0.0021209056,0.001763683,0.001351568,0.0008281699,0.000200804],"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.00031452908,0.00013979002,0.001126632,0.0002013155,0.00014975059,0.00057542673,0.00040553644,0.491716,0.0034431235,0.486509,0.00090604374,0.014512775],"study_design_scores_gemma":[0.00006476917,0.00009275534,0.00018077965,0.000015535827,0.000015898151,0.00009187707,0.00006805919,0.85262126,0.00060974166,0.14546522,0.0007501985,0.00002386099],"about_ca_topic_score_codex":0.0020034781,"about_ca_topic_score_gemma":0.0017661814,"teacher_disagreement_score":0.0027758214,"about_ca_system_score_codex":0.0013186999,"about_ca_system_score_gemma":0.0011958731,"threshold_uncertainty_score":0.014680088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2209749,0.00016195633,0.76245,0.0012574396,0.000042854892,0.00026648212,0.00010280864,0.00012359458,0.014620027],"genre_scores_gemma":[0.735179,0.00011769476,0.263048,0.000060208706,0.000011958209,0.00011042122,0.000054837958,0.000022160426,0.0013957425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9979686,0.0014268373,0.000055465534,0.000105632585,0.00030186604,0.00014163824],"domain_scores_gemma":[0.9971764,0.002249574,0.00012348538,0.00012273315,0.00022707933,0.00010073711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029483025,0.00058676815,0.00064759696,0.00078853336,0.0013059537,0.0012784348,0.0009765439,0.0016317368,0.0018078276],"category_scores_gemma":[0.004627631,0.0003026795,0.0006724425,0.0013616185,0.0010945132,0.0019461864,0.0014332893,0.0009805365,0.00014454791],"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.00035265606,0.00033728077,0.0046902574,0.00015485594,0.000080017206,0.0020656853,0.0010802066,0.67266333,0.0032571794,0.203143,0.0023374623,0.10983809],"study_design_scores_gemma":[0.000050195253,0.0000875941,0.00043602925,0.00001833811,0.00002703055,0.0003074064,0.00051251106,0.9415131,0.002929747,0.0499008,0.0041876617,0.00002953676],"about_ca_topic_score_codex":0.0032104908,"about_ca_topic_score_gemma":0.0034486644,"teacher_disagreement_score":0.0032104908,"about_ca_system_score_codex":0.001091555,"about_ca_system_score_gemma":0.0008918815,"threshold_uncertainty_score":0.015592277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03401527,0.00007016824,0.9478466,0.0008126817,0.00014482831,0.00016791456,0.00010624309,0.0004719666,0.016364414],"genre_scores_gemma":[0.86114603,0.00015868424,0.1236082,0.00044434206,0.00015557806,0.00069434947,0.00013459999,0.00025339995,0.013404827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967439,0.0019276617,0.00015163707,0.00042423283,0.00041897217,0.0003336135],"domain_scores_gemma":[0.9918263,0.0052656555,0.0005985232,0.0013616238,0.00044105694,0.00050687743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042744563,0.0010796331,0.0013589897,0.0009776233,0.001469189,0.0027327023,0.00260386,0.0021578388,0.00865105],"category_scores_gemma":[0.017593928,0.0006418313,0.0014852604,0.0007855873,0.003923822,0.003755007,0.0036411744,0.003564487,0.0011100697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059067974,0.000046762852,0.00018241369,0.000029084133,0.000028223632,0.00006509807,0.0001640968,0.017778901,0.00074296707,0.97180676,0.0011917222,0.007904809],"study_design_scores_gemma":[0.0000444979,0.00004385367,0.000060721966,0.000009605438,0.000017196993,0.000023647244,0.000023971965,0.12573698,0.0003552117,0.8727711,0.0008972662,0.000016011762],"about_ca_topic_score_codex":0.0008543509,"about_ca_topic_score_gemma":0.0010529362,"teacher_disagreement_score":0.00865105,"about_ca_system_score_codex":0.0011760914,"about_ca_system_score_gemma":0.0016482155,"threshold_uncertainty_score":0.028940618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018724882,0.00008646229,0.996232,0.00016356369,0.000016580823,0.00006556517,0.000029474066,0.0003826008,0.0011512594],"genre_scores_gemma":[0.2563414,0.00023160844,0.7401191,0.00021575789,0.00012603855,0.00077512814,0.0002144225,0.00023460065,0.001741954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890808,0.0062250914,0.00066683436,0.0011458397,0.0024173064,0.00046399405],"domain_scores_gemma":[0.9492697,0.040315032,0.0022452245,0.0028860886,0.00455021,0.0007337433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01961254,0.0019708702,0.0024723373,0.0042876136,0.0009651727,0.0034437368,0.002819895,0.0026211343,0.005712128],"category_scores_gemma":[0.08231912,0.00088384893,0.0013664991,0.0019188803,0.002644218,0.0063780197,0.003484381,0.004384559,0.0014563557],"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.00025491678,0.00030795392,0.004576022,0.00028630235,0.00020212517,0.00016805746,0.0003577092,0.38071293,0.0018252889,0.250344,0.0071335384,0.35383114],"study_design_scores_gemma":[0.000021242691,0.000055956305,0.00017290811,0.000037317335,0.0000145206,0.000037199014,0.000022530647,0.9046646,0.0008944783,0.092901275,0.0011623917,0.000015651478],"about_ca_topic_score_codex":0.0012754695,"about_ca_topic_score_gemma":0.001073224,"teacher_disagreement_score":0.01961254,"about_ca_system_score_codex":0.0028916385,"about_ca_system_score_gemma":0.0024173812,"threshold_uncertainty_score":0.103722215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006761482,0.00024564753,0.96375483,0.0008582183,0.000116550385,0.00006661316,0.00020148898,0.000110349894,0.02788484],"genre_scores_gemma":[0.4968666,0.0013394449,0.48216003,0.00052766496,0.00025235274,0.00056099833,0.0006561103,0.00015985235,0.017477049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979963,0.0008993073,0.00011928591,0.00036024232,0.00047921127,0.00014558251],"domain_scores_gemma":[0.9971885,0.0013337187,0.00042437992,0.0004218254,0.0005014558,0.00013012312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002587348,0.0010490753,0.0006141095,0.001918578,0.0011516344,0.003965126,0.0013120739,0.0012256824,0.009613333],"category_scores_gemma":[0.0069927173,0.0003917965,0.0016718006,0.0026965456,0.0027409703,0.007536901,0.0016846075,0.0022006251,0.0016010595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010751331,0.000009109,0.0000910645,0.000028484565,0.000010292722,0.000041318828,0.000110466135,0.013042927,0.0002272995,0.9776909,0.00073984737,0.007997514],"study_design_scores_gemma":[0.000010570818,0.000017517832,0.000058653917,0.000019411602,0.000017453796,0.000044168282,0.00007651067,0.08544226,0.0002066312,0.90688485,0.0072030197,0.000018936742],"about_ca_topic_score_codex":0.00568367,"about_ca_topic_score_gemma":0.0044822423,"teacher_disagreement_score":0.009613333,"about_ca_system_score_codex":0.002430254,"about_ca_system_score_gemma":0.0017067947,"threshold_uncertainty_score":0.032159805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457883,0.00012627122,0.039286666,0.0007665704,0.00005337494,0.000047354642,0.000025748039,0.000045111454,0.013860663],"genre_scores_gemma":[0.9942557,0.000027377435,0.004750997,0.000045432855,0.000017147413,0.000022283013,0.000009932959,0.000004724019,0.0008663702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777335,0.0011406131,0.00010536394,0.00020225429,0.0005403157,0.0002380655],"domain_scores_gemma":[0.991703,0.005847644,0.0009992844,0.0003804661,0.00036122734,0.00070835865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018286357,0.00042866098,0.00063087326,0.0005511165,0.0007412869,0.0029416392,0.0007338452,0.0012323023,0.0025047495],"category_scores_gemma":[0.011013763,0.0003248757,0.0005982886,0.00029382965,0.0016883397,0.0023313242,0.0020699047,0.0008960057,0.00017674583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027013079,0.0007235047,0.017569395,0.00029390588,0.00041340533,0.0018438481,0.002011555,0.30371433,0.034928363,0.5818178,0.0019219889,0.05206063],"study_design_scores_gemma":[0.00042669487,0.0006501885,0.008582329,0.000028562901,0.000110644825,0.0005920186,0.0003489316,0.70170695,0.005155318,0.2794947,0.0027719226,0.00013177095],"about_ca_topic_score_codex":0.0008529868,"about_ca_topic_score_gemma":0.000715377,"teacher_disagreement_score":0.0029416392,"about_ca_system_score_codex":0.0008301064,"about_ca_system_score_gemma":0.0005983091,"threshold_uncertainty_score":0.009670913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013872077,0.0035166356,0.86138207,0.011242888,0.0009639547,0.0001809924,0.00032937631,0.0003903715,0.108121544],"genre_scores_gemma":[0.57515913,0.0075979596,0.3487518,0.0071831625,0.004346371,0.0015313904,0.00043497485,0.00055118644,0.054443903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962857,0.0018644517,0.00019426346,0.0005630369,0.00084242126,0.00025008808],"domain_scores_gemma":[0.9944561,0.003538584,0.00038632084,0.0010697854,0.00030654747,0.00024266349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047918144,0.0014457881,0.0014231842,0.0015243958,0.002298277,0.0048994855,0.0019147906,0.0023740423,0.014842627],"category_scores_gemma":[0.013077394,0.00076680304,0.0019575004,0.001749194,0.0056695635,0.012399026,0.0068206913,0.008441914,0.0018902824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007899699,0.000011007967,0.00010990664,0.000027804286,0.000010280181,0.000032366126,0.000103610524,0.0014623457,0.00007641503,0.99218,0.0022011308,0.0037772306],"study_design_scores_gemma":[0.00001418277,0.000008210887,0.000052142295,0.000021722819,0.0000064405717,0.000044235207,0.000029482546,0.007139215,0.00006448627,0.98289514,0.009718961,0.0000058230457],"about_ca_topic_score_codex":0.0018180098,"about_ca_topic_score_gemma":0.0014910387,"teacher_disagreement_score":0.014842627,"about_ca_system_score_codex":0.0016739196,"about_ca_system_score_gemma":0.0011530844,"threshold_uncertainty_score":0.04965353},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15254152,0.003507635,0.19008315,0.40186697,0.0038602683,0.000114701324,0.0011718607,0.0005441933,0.24630968],"genre_scores_gemma":[0.9223817,0.0029018433,0.024663985,0.020377064,0.004952101,0.00034441284,0.000324383,0.00020625805,0.023848183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971963,0.0012433514,0.00012210889,0.00067777396,0.00046384102,0.00029655785],"domain_scores_gemma":[0.98135006,0.0149099175,0.00088430214,0.0014420851,0.0009760964,0.00043743956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005221418,0.00087779434,0.0022996299,0.0016910014,0.0027431077,0.004243517,0.0022236514,0.00737932,0.016957086],"category_scores_gemma":[0.0284563,0.0006217317,0.001635089,0.0026013153,0.011495452,0.013395005,0.004943464,0.0060272887,0.0018269017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038957784,0.000023325625,0.00022459723,0.000035920002,0.000015839512,0.000051600346,0.00013950374,0.0003851616,0.00006260122,0.9864423,0.009787083,0.0027931314],"study_design_scores_gemma":[0.000017584853,0.0000044023805,0.00005511167,0.000011197159,0.0000045109164,0.000030096178,0.00003224814,0.0012031854,0.000027692415,0.99661875,0.0019909726,0.0000041961125],"about_ca_topic_score_codex":0.0013358822,"about_ca_topic_score_gemma":0.0006998392,"teacher_disagreement_score":0.016957086,"about_ca_system_score_codex":0.0019272491,"about_ca_system_score_gemma":0.0013417719,"threshold_uncertainty_score":0.05672705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15157934,0.0061545176,0.56596595,0.0034663281,0.0004841454,0.0001584349,0.0003692638,0.00029994722,0.2715221],"genre_scores_gemma":[0.88084257,0.00398207,0.039582394,0.00039584778,0.0007471931,0.00029724574,0.00042147,0.00012884171,0.07360248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873716,0.00048130032,0.000084426094,0.0001836116,0.00038892415,0.00012460673],"domain_scores_gemma":[0.9977149,0.0016175322,0.00017946349,0.00019789314,0.00018105448,0.00010918758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011142832,0.0010544227,0.0011258433,0.000878789,0.0010605317,0.0029149682,0.0009632087,0.0016452381,0.0073875887],"category_scores_gemma":[0.0044368226,0.00058774796,0.0014925692,0.0013142945,0.0033571033,0.0033010382,0.0013375704,0.002733108,0.0009893803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009802319,0.000013172084,0.000051849176,0.000037493657,0.000011003925,0.000028891483,0.00006813503,0.004929633,0.00034065466,0.9898427,0.0008976052,0.0037689582],"study_design_scores_gemma":[0.000006016996,0.0000058538267,0.000042119307,0.0000055762866,0.0000028548814,0.000017212706,0.000006482439,0.0061506014,0.00006982644,0.99217755,0.0015108829,0.000005131632],"about_ca_topic_score_codex":0.0014408454,"about_ca_topic_score_gemma":0.0010082008,"teacher_disagreement_score":0.0073875887,"about_ca_system_score_codex":0.0015312758,"about_ca_system_score_gemma":0.0008038151,"threshold_uncertainty_score":0.024713933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020107683,0.005186754,0.8844222,0.012652914,0.00061351777,0.000040718947,0.00012673473,0.00009485007,0.076754704],"genre_scores_gemma":[0.7727419,0.006868099,0.19829004,0.0028352488,0.0016953441,0.00019283856,0.00011745555,0.00018930198,0.01706985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519014,0.0028327715,0.00024016637,0.00053166895,0.0009491547,0.00025605102],"domain_scores_gemma":[0.9929242,0.0037697677,0.0007970744,0.0013160927,0.00090612064,0.00028677747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008576383,0.001527325,0.0020011293,0.0023332883,0.0013388124,0.007651893,0.003935224,0.003650188,0.0053680628],"category_scores_gemma":[0.017818563,0.0007662603,0.0015319138,0.0021066794,0.009087639,0.017332641,0.0044981255,0.004972238,0.0009215061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004446421,0.000005020842,0.000038141094,0.000019537236,0.0000071160753,0.000011831752,0.0000911226,0.0011269187,0.000035086057,0.99595416,0.00022547446,0.0024810804],"study_design_scores_gemma":[0.0000029693686,0.0000034869029,0.000020987363,0.000017882056,0.000005139747,0.000010283736,0.000026956406,0.0047998014,0.000031272186,0.9939798,0.0010972697,0.0000042621546],"about_ca_topic_score_codex":0.0017743796,"about_ca_topic_score_gemma":0.0022569536,"teacher_disagreement_score":0.008576383,"about_ca_system_score_codex":0.0024614271,"about_ca_system_score_gemma":0.001851462,"threshold_uncertainty_score":0.04535675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022576712,0.00083341316,0.97016597,0.00052411115,0.00008381477,0.00011101715,0.00005319437,0.00005185554,0.025918996],"genre_scores_gemma":[0.534046,0.005809793,0.42611563,0.0008206089,0.00045791746,0.0016049424,0.0002380139,0.00016237455,0.030744715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587554,0.0023251928,0.000150987,0.000610807,0.0007403368,0.00029718815],"domain_scores_gemma":[0.99762946,0.0015451519,0.00023572224,0.00014443394,0.0003603207,0.00008494599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042762123,0.0015655854,0.0015637835,0.0011135882,0.0008541258,0.0027477515,0.0018095478,0.0020720442,0.0066753468],"category_scores_gemma":[0.008140355,0.00065317436,0.0008781742,0.0013984678,0.0031669845,0.0027191099,0.0022360533,0.0019689717,0.001083946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026865708,0.000034427827,0.0001272979,0.0002144489,0.00003950981,0.000048960188,0.00007631514,0.19624186,0.0006233899,0.7834838,0.0014502592,0.01763289],"study_design_scores_gemma":[0.000029603541,0.00005881004,0.00006795811,0.00006810669,0.000016179596,0.000042655945,0.000043317596,0.36644244,0.0005590746,0.62361765,0.009032554,0.000021628652],"about_ca_topic_score_codex":0.0024559877,"about_ca_topic_score_gemma":0.0015579966,"teacher_disagreement_score":0.0066753468,"about_ca_system_score_codex":0.0027563586,"about_ca_system_score_gemma":0.0025252372,"threshold_uncertainty_score":0.022615075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6075022,0.0020775876,0.3015888,0.0054418137,0.00024024493,0.00015911358,0.00027714274,0.00017893869,0.08253417],"genre_scores_gemma":[0.99214023,0.0005312123,0.0044759642,0.00010259658,0.00009690342,0.000042920372,0.000024891746,0.000016602096,0.0025687972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703074,0.0015908409,0.00012681933,0.00021644513,0.00051060546,0.00052453583],"domain_scores_gemma":[0.9619007,0.03149427,0.0028351843,0.0008215512,0.0014664148,0.0014819943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006261601,0.0012094699,0.0015081507,0.0022666976,0.0010755074,0.0049060853,0.0018938277,0.0018896599,0.006243265],"category_scores_gemma":[0.032921117,0.00075787917,0.0008498285,0.0013073182,0.005201259,0.008980475,0.0021318751,0.002352125,0.00020512851],"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.00025787717,0.00009439068,0.0008857181,0.00011193637,0.00007245831,0.00007515075,0.00018705046,0.1587426,0.00082941825,0.8270377,0.0010372336,0.010668467],"study_design_scores_gemma":[0.000065880246,0.00009173832,0.00028103852,0.0000325958,0.000050749513,0.000048093003,0.00015845806,0.26723665,0.00055308617,0.73066765,0.00078349304,0.000030568986],"about_ca_topic_score_codex":0.003278131,"about_ca_topic_score_gemma":0.0020108991,"teacher_disagreement_score":0.006261601,"about_ca_system_score_codex":0.00346934,"about_ca_system_score_gemma":0.0019548296,"threshold_uncertainty_score":0.03311491},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25247532,0.001758642,0.69110066,0.00570012,0.0003408883,0.0003195092,0.00049111096,0.000360805,0.04745303],"genre_scores_gemma":[0.97631365,0.0004455557,0.016093824,0.00033408092,0.00019663759,0.00012385088,0.00007489668,0.000027089898,0.006390278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531156,0.0014279826,0.00029416537,0.0011073531,0.00090374314,0.0009552852],"domain_scores_gemma":[0.97412217,0.01665361,0.0035246515,0.0030856654,0.0017497721,0.00086416735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005457377,0.0011872962,0.0017339843,0.0009365197,0.0012586196,0.0032284616,0.0016570685,0.002533802,0.0040582833],"category_scores_gemma":[0.022422515,0.0006879406,0.0010050453,0.0012188241,0.0022075095,0.0067215413,0.0031896315,0.002508689,0.0005220845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051428506,0.00009870468,0.0019114066,0.00023356549,0.00013154495,0.000936944,0.00075080036,0.11357768,0.0044841147,0.8531515,0.0027385866,0.021470867],"study_design_scores_gemma":[0.00012043981,0.00015105744,0.00051933527,0.000030449948,0.00006821698,0.00027632224,0.0001528385,0.29725763,0.00180722,0.6959019,0.003660354,0.000054266497],"about_ca_topic_score_codex":0.0020805616,"about_ca_topic_score_gemma":0.0011170497,"teacher_disagreement_score":0.005457377,"about_ca_system_score_codex":0.0032022656,"about_ca_system_score_gemma":0.0016235103,"threshold_uncertainty_score":0.028861701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020375745,0.00061556493,0.9675903,0.00051376485,0.00006554926,0.00010901475,0.00006994792,0.0002212026,0.010438967],"genre_scores_gemma":[0.8190669,0.0017421899,0.16508725,0.00017177635,0.00021161056,0.000674092,0.00022667841,0.00019595113,0.012623566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965618,0.001570828,0.00017450747,0.00047516052,0.0009319922,0.0002856484],"domain_scores_gemma":[0.9889225,0.0070482953,0.0014025393,0.00085324043,0.0014363226,0.00033709352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055087176,0.0011318717,0.0015189181,0.0015090823,0.0007431595,0.004028441,0.0019743943,0.0016373947,0.004325189],"category_scores_gemma":[0.023783863,0.00066233374,0.001085525,0.0017118052,0.0031475679,0.0050693043,0.002374136,0.0024951275,0.00080569583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078753146,0.000047213805,0.0004460168,0.00014899952,0.000054591987,0.00013252658,0.00022389265,0.41953805,0.0014382852,0.55748737,0.0015051891,0.0188991],"study_design_scores_gemma":[0.000023556317,0.00003470803,0.0001024007,0.000017684744,0.0000088707475,0.000059670478,0.000034829856,0.7987688,0.00041165677,0.19962136,0.0009008784,0.000015529455],"about_ca_topic_score_codex":0.0024464233,"about_ca_topic_score_gemma":0.0012210796,"teacher_disagreement_score":0.0055087176,"about_ca_system_score_codex":0.0028835342,"about_ca_system_score_gemma":0.0016623756,"threshold_uncertainty_score":0.02913326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9647524,0.002667109,0.0020690574,0.01803123,0.00008916068,0.000018216684,0.00014670925,0.000032691016,0.012193465],"genre_scores_gemma":[0.9970228,0.00048379294,0.00020120866,0.0007888896,0.000046415764,0.000005152081,0.000035539462,0.0000022227994,0.0014138746],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99933296,0.00027039557,0.000026498123,0.0000991019,0.00008437895,0.00018669319],"domain_scores_gemma":[0.9900496,0.0052059665,0.0034765508,0.0003459737,0.0004930054,0.00042886252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025236486,0.00021337872,0.0003589629,0.00077185675,0.00038809015,0.0022777424,0.00035097488,0.0022062203,0.0037690215],"category_scores_gemma":[0.01931673,0.00019369238,0.00015620637,0.0005485558,0.0010104,0.0023712711,0.000454837,0.0007398472,0.0006848759],"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.0011488665,0.0005587881,0.6904079,0.00017326468,0.0005222743,0.00065727835,0.004457442,0.0038081005,0.0021006826,0.058356497,0.022089403,0.21571963],"study_design_scores_gemma":[0.00039500033,0.0008651164,0.6702936,0.00037858565,0.00082352775,0.0015184295,0.026253816,0.04594092,0.0036375413,0.1995026,0.05026829,0.00012255108],"about_ca_topic_score_codex":0.002832352,"about_ca_topic_score_gemma":0.004276188,"teacher_disagreement_score":0.0037690215,"about_ca_system_score_codex":0.0009710014,"about_ca_system_score_gemma":0.00055176346,"threshold_uncertainty_score":0.013346493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.423207,0.00201633,0.38166678,0.0049995296,0.0002389258,0.00049974624,0.00047967312,0.0003008774,0.18659113],"genre_scores_gemma":[0.97444135,0.0006897468,0.012711867,0.00024286534,0.00008935752,0.00021391276,0.00008280834,0.000015462174,0.011512593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793744,0.0011859759,0.000049511935,0.000365024,0.00025462717,0.00020753544],"domain_scores_gemma":[0.9965333,0.0019174407,0.0006232105,0.00042966535,0.00017166817,0.00032476886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015048289,0.00050569704,0.0008167353,0.0007208779,0.0015982342,0.0024275156,0.0012555831,0.0017615753,0.009440035],"category_scores_gemma":[0.00572721,0.00038119868,0.00049217365,0.0005837938,0.0034873944,0.0034766379,0.0023396024,0.0010934423,0.001063332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076129734,0.00011499336,0.0036700743,0.00015412853,0.0000814233,0.00037188627,0.0018711186,0.030463006,0.0017120617,0.9434071,0.0026055728,0.015472374],"study_design_scores_gemma":[0.00009557787,0.00020905952,0.0034552028,0.00007560601,0.000067207104,0.00039524,0.0013364849,0.1126496,0.00040878498,0.8541147,0.027147507,0.000045059653],"about_ca_topic_score_codex":0.003296921,"about_ca_topic_score_gemma":0.002256813,"teacher_disagreement_score":0.009440035,"about_ca_system_score_codex":0.0012044442,"about_ca_system_score_gemma":0.0007058605,"threshold_uncertainty_score":0.03158009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15737781,0.0019319191,0.529431,0.013283977,0.00038271176,0.00049751246,0.0005332249,0.0002191849,0.2963427],"genre_scores_gemma":[0.95376515,0.0009713157,0.02174611,0.0005212048,0.0002403282,0.00034241867,0.00011363176,0.00009379623,0.022205925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777114,0.0010126029,0.00008353354,0.00028056878,0.00041109038,0.00044116518],"domain_scores_gemma":[0.99202263,0.0054920064,0.00086147524,0.0003675494,0.0004431801,0.00081304455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037971223,0.00094460195,0.0012043725,0.0016992561,0.002181069,0.0059849042,0.002674439,0.003495168,0.023464657],"category_scores_gemma":[0.013563604,0.0006679043,0.0018460003,0.0015133757,0.0057392186,0.010829731,0.003529615,0.0038828237,0.0010437549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003709504,0.00003750136,0.00027253135,0.000034131994,0.000026766786,0.000102237864,0.0003561802,0.037253875,0.00019319507,0.9561681,0.0022070177,0.0033113952],"study_design_scores_gemma":[0.000028853869,0.000029319826,0.0002573749,0.00003848102,0.000015049751,0.000049220645,0.00032681378,0.2145634,0.000052669293,0.78217244,0.002442725,0.000023570134],"about_ca_topic_score_codex":0.0070751254,"about_ca_topic_score_gemma":0.0031386318,"teacher_disagreement_score":0.023464657,"about_ca_system_score_codex":0.0056789964,"about_ca_system_score_gemma":0.0030515231,"threshold_uncertainty_score":0.07849705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06255936,0.001956615,0.83539665,0.0051079476,0.00022529521,0.0004305602,0.0002749044,0.00013030373,0.09391841],"genre_scores_gemma":[0.811133,0.001951016,0.16173188,0.0009648866,0.000492763,0.0012318194,0.00033042577,0.00011230533,0.022051843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905702,0.005733994,0.00033587692,0.0013695278,0.0010033095,0.000987159],"domain_scores_gemma":[0.9839091,0.011294124,0.001715345,0.0010605755,0.0006685277,0.0013522395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066980994,0.0016088501,0.0016188349,0.0026842975,0.0049725114,0.007260245,0.004174532,0.00476923,0.010581771],"category_scores_gemma":[0.02002146,0.001189003,0.0026805075,0.002701523,0.009821653,0.012461648,0.0055317325,0.0045577986,0.0012826571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127816165,0.000016892727,0.00034013312,0.000033719745,0.00001830756,0.00009850683,0.0004218911,0.006272593,0.00014502757,0.99091035,0.00034935283,0.001380427],"study_design_scores_gemma":[0.000048255537,0.000113599104,0.0003316455,0.000085768974,0.00003555169,0.00028414011,0.0008536748,0.13289896,0.0002640019,0.8468063,0.0182387,0.000039412862],"about_ca_topic_score_codex":0.0052351877,"about_ca_topic_score_gemma":0.002560447,"teacher_disagreement_score":0.010581771,"about_ca_system_score_codex":0.004305651,"about_ca_system_score_gemma":0.0023552566,"threshold_uncertainty_score":0.035423398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022162175,0.0031203441,0.904446,0.00216661,0.00026321868,0.00017469382,0.00009009266,0.00004617242,0.067530684],"genre_scores_gemma":[0.7171788,0.0039221095,0.26059175,0.0006583609,0.00033807138,0.00047277674,0.00007391854,0.0000309525,0.01673338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798584,0.0011609002,0.000082364175,0.00022534824,0.00040895952,0.00013661194],"domain_scores_gemma":[0.99799466,0.0014041486,0.00021367334,0.00006966094,0.0002152837,0.000102517675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020692989,0.0012716261,0.00080052204,0.0013893202,0.00113609,0.0022131756,0.0014764266,0.0019606927,0.005848555],"category_scores_gemma":[0.0042577437,0.0003842049,0.0010777608,0.0010860959,0.0058537084,0.0029723125,0.0012804356,0.0022242712,0.00039441822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000196429,0.000017467157,0.00014917368,0.000075569136,0.000023399467,0.000071624294,0.00033651254,0.037708003,0.00029317156,0.9535669,0.0005598573,0.007178766],"study_design_scores_gemma":[0.000023818277,0.00005841523,0.00018946869,0.00004663192,0.000016210342,0.00006231459,0.00025992782,0.119293444,0.00020677474,0.87194145,0.007877604,0.00002388579],"about_ca_topic_score_codex":0.005279528,"about_ca_topic_score_gemma":0.0038987945,"teacher_disagreement_score":0.005848555,"about_ca_system_score_codex":0.0035622718,"about_ca_system_score_gemma":0.0017018174,"threshold_uncertainty_score":0.025846183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.557024,0.010965565,0.22086076,0.016130831,0.0003232222,0.000106666186,0.00034686073,0.0000909761,0.19415107],"genre_scores_gemma":[0.9844609,0.0016740676,0.0051611285,0.00030718034,0.00014973343,0.000024323439,0.000037159232,0.000009921937,0.008175567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984609,0.0007871783,0.00007234029,0.00019913084,0.00031341097,0.00016703633],"domain_scores_gemma":[0.9864581,0.010030561,0.0015964991,0.0007515796,0.00076888606,0.0003943804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028964698,0.00043434327,0.0012577646,0.0012857615,0.000727497,0.0032139076,0.0006668488,0.0020562871,0.006139439],"category_scores_gemma":[0.014136689,0.00043523315,0.0005843911,0.0018163752,0.0034028422,0.0048899627,0.0014078538,0.0014640767,0.00050860766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008366106,0.000047090016,0.0014001745,0.00008833985,0.000044155036,0.00015331626,0.00025587325,0.015840346,0.00029407273,0.9671022,0.0012837987,0.01340698],"study_design_scores_gemma":[0.000014123806,0.00001243999,0.00092766667,0.000015650994,0.000016419894,0.00006507741,0.000112534435,0.011452244,0.0000800333,0.9858622,0.0014315618,0.000010008748],"about_ca_topic_score_codex":0.0021148075,"about_ca_topic_score_gemma":0.0017903699,"teacher_disagreement_score":0.006139439,"about_ca_system_score_codex":0.0019900524,"about_ca_system_score_gemma":0.0008559842,"threshold_uncertainty_score":0.02053845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09209937,0.00083776173,0.87162024,0.0019681067,0.00024409081,0.00020226288,0.00019593186,0.0001787478,0.03265354],"genre_scores_gemma":[0.93384737,0.0006070529,0.04038029,0.00033691083,0.00021194562,0.00022754476,0.000067035406,0.00009208557,0.024229791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999121,0.00043336756,0.000025710444,0.0001437804,0.0001377429,0.00013840523],"domain_scores_gemma":[0.99682814,0.0020724325,0.00035560035,0.00016568744,0.00034008658,0.0002381239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021471188,0.0016527215,0.003115894,0.0011604832,0.00076405203,0.0029912272,0.0034001009,0.0038156067,0.0060162656],"category_scores_gemma":[0.006843693,0.0014418509,0.0016219598,0.0008577617,0.0024346819,0.0035843705,0.002443532,0.0026262903,0.00032398177],"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.00010356804,0.00014149459,0.0003305065,0.00012846275,0.000108640066,0.0002190126,0.000060573617,0.8671577,0.0011543249,0.12504521,0.0012694704,0.0042809914],"study_design_scores_gemma":[0.000027399872,0.000031414977,0.00007123944,0.0000060831926,0.000024054998,0.000017396018,0.000013838412,0.9743493,0.00009138283,0.025119027,0.00023698268,0.0000117587515],"about_ca_topic_score_codex":0.005013592,"about_ca_topic_score_gemma":0.0036272628,"teacher_disagreement_score":0.0060162656,"about_ca_system_score_codex":0.0020051512,"about_ca_system_score_gemma":0.001991515,"threshold_uncertainty_score":0.020126402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095354475,0.008589597,0.5767647,0.006577957,0.0006710002,0.00018099607,0.00017251933,0.00014489851,0.31154382],"genre_scores_gemma":[0.89157206,0.003630318,0.07171763,0.000442437,0.0010666369,0.00045481938,0.00015477683,0.000121592464,0.03083974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372876,0.003344538,0.00027685167,0.00069317553,0.0012753517,0.0006813139],"domain_scores_gemma":[0.99177635,0.0066979122,0.00034014412,0.00044909198,0.00045343747,0.0002830577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007607806,0.001159402,0.0020187632,0.0012338674,0.0018186244,0.007272875,0.0023681757,0.0026105088,0.0047594444],"category_scores_gemma":[0.01595049,0.0007779151,0.0011554115,0.0023130015,0.008317229,0.008623314,0.002355149,0.0041277735,0.0007290248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004101915,0.000020395713,0.00012631896,0.000040947038,0.000013048152,0.000017066155,0.00013241409,0.005563478,0.00017416528,0.9865589,0.00090615975,0.006406129],"study_design_scores_gemma":[0.000013502275,0.000010835671,0.00013853822,0.000012153524,0.0000071694108,0.000020992578,0.000046607485,0.006890959,0.00010315817,0.9911283,0.0016200992,0.0000075410217],"about_ca_topic_score_codex":0.0018060387,"about_ca_topic_score_gemma":0.0015163898,"teacher_disagreement_score":0.007607806,"about_ca_system_score_codex":0.0031323528,"about_ca_system_score_gemma":0.0028610458,"threshold_uncertainty_score":0.040234387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6210134,0.0071948036,0.26052988,0.0251231,0.00044859416,0.000460168,0.0012036011,0.0006414074,0.08338501],"genre_scores_gemma":[0.98795587,0.001216408,0.004353162,0.00027527142,0.00020519254,0.00006453555,0.000061754916,0.000055015917,0.00581284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99265224,0.003771815,0.00036499783,0.0009469464,0.0011070254,0.0011571378],"domain_scores_gemma":[0.6715753,0.2763116,0.03373255,0.0098411795,0.0051833508,0.0033560288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014397768,0.0011708762,0.0026714162,0.0019677924,0.0021214625,0.006431146,0.002744767,0.0066394177,0.015901405],"category_scores_gemma":[0.14618292,0.0012897969,0.0016651294,0.0015721605,0.0043791546,0.011992262,0.0030885052,0.007690544,0.0013079267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018424377,0.0008316976,0.017667903,0.0009229031,0.00037688375,0.0031344923,0.0017679861,0.20284604,0.010700275,0.6885078,0.007837927,0.063563794],"study_design_scores_gemma":[0.0005776526,0.001012519,0.010317646,0.00028780356,0.00046405333,0.0021839293,0.000778079,0.41801462,0.003811724,0.5573223,0.0049070627,0.0003225918],"about_ca_topic_score_codex":0.0041559893,"about_ca_topic_score_gemma":0.0017870672,"teacher_disagreement_score":0.015901405,"about_ca_system_score_codex":0.003634258,"about_ca_system_score_gemma":0.002293303,"threshold_uncertainty_score":0.07614362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043765184,0.043435466,0.67121536,0.0119176125,0.0012250456,0.00035448986,0.0006470104,0.00066704536,0.2267727],"genre_scores_gemma":[0.56231624,0.06795911,0.22747831,0.0021164906,0.0027744016,0.0005210195,0.0015151532,0.00046199295,0.1348574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985904,0.00066433375,0.00007945936,0.00022017026,0.00032073163,0.00012501463],"domain_scores_gemma":[0.9965442,0.0023899158,0.00011580327,0.00020538732,0.0005750997,0.00016953077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024508073,0.00071011356,0.0008732957,0.0019025465,0.0008205018,0.0043099173,0.0011503537,0.0013540399,0.015574015],"category_scores_gemma":[0.005290711,0.00068031537,0.0017297479,0.0025488688,0.0016537927,0.00463635,0.0018933277,0.0030086336,0.0025934316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001226895,0.00037046862,0.0039713145,0.0007174623,0.00016788131,0.00056183425,0.0012633082,0.041834332,0.0018494043,0.79273254,0.017866468,0.13854235],"study_design_scores_gemma":[0.000043260134,0.00024083897,0.006865357,0.00062440825,0.0001330029,0.00048537963,0.001292753,0.27740908,0.0023247807,0.54394203,0.16650577,0.00013341043],"about_ca_topic_score_codex":0.012016234,"about_ca_topic_score_gemma":0.008786345,"teacher_disagreement_score":0.015574015,"about_ca_system_score_codex":0.0025810737,"about_ca_system_score_gemma":0.0017523309,"threshold_uncertainty_score":0.05210024},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21085459,0.048745736,0.010716644,0.05974109,0.0013950551,0.0001567733,0.000112379734,0.000040066254,0.6682377],"genre_scores_gemma":[0.9671833,0.018683983,0.0017193226,0.0038822428,0.00019636263,0.00008255054,0.00006261599,0.000008990047,0.008180688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973646,0.0014156181,0.00012847147,0.00021077709,0.00053974683,0.00034075475],"domain_scores_gemma":[0.98962224,0.006239811,0.0021827214,0.0003208324,0.0012074049,0.00042700066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041412106,0.0004947539,0.00043535448,0.0025487975,0.0027672853,0.005933834,0.0008145727,0.0018303851,0.008376579],"category_scores_gemma":[0.011893126,0.00014629842,0.0005055428,0.004136028,0.0040656715,0.0046346034,0.0017950654,0.0022497538,0.00035844996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008146999,0.00015613883,0.011322192,0.00045335418,0.000088763525,0.00030024536,0.0031430984,0.0019627812,0.00020897591,0.8902075,0.009928685,0.08214685],"study_design_scores_gemma":[0.000086020955,0.00026252464,0.028645486,0.003110027,0.00016645297,0.00065279537,0.042741016,0.010588117,0.00166848,0.637679,0.27433416,0.000065985754],"about_ca_topic_score_codex":0.0056873253,"about_ca_topic_score_gemma":0.006011628,"teacher_disagreement_score":0.008376579,"about_ca_system_score_codex":0.0039090007,"about_ca_system_score_gemma":0.0037852363,"threshold_uncertainty_score":0.028361976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30497244,0.00037336242,0.67219764,0.0019878945,0.00010382078,0.00009174812,0.00017962726,0.00036390778,0.019729532],"genre_scores_gemma":[0.9794471,0.0001424057,0.015907563,0.000092343165,0.000036826554,0.00007408718,0.00004581094,0.000026537371,0.0042273654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983814,0.0006365706,0.000062438616,0.00035885777,0.00020896744,0.00035175928],"domain_scores_gemma":[0.9911773,0.0056598936,0.0015280432,0.0006931049,0.0002916684,0.00065008533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027414619,0.0008876489,0.0010411588,0.0003895268,0.0004894837,0.0015989298,0.0013818555,0.0015489676,0.0038806514],"category_scores_gemma":[0.013026325,0.0005048244,0.00045542876,0.0005302805,0.0017521197,0.0024158475,0.002097573,0.0012936951,0.00048077336],"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.00033065333,0.0001336263,0.0019414356,0.00009949611,0.000070635644,0.00032600734,0.0002547722,0.7492098,0.0024012087,0.22114949,0.0020106866,0.022072103],"study_design_scores_gemma":[0.00009779729,0.000105498104,0.00037567355,0.00000918255,0.000015140661,0.000056262223,0.000049776638,0.86786765,0.0005810506,0.12972136,0.0011050878,0.000015541053],"about_ca_topic_score_codex":0.0018208503,"about_ca_topic_score_gemma":0.0010489768,"teacher_disagreement_score":0.0038806514,"about_ca_system_score_codex":0.0012897471,"about_ca_system_score_gemma":0.0008958751,"threshold_uncertainty_score":0.014498353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10438748,0.00034052943,0.8717982,0.00031058767,0.00002529737,0.0001873195,0.00028414794,0.00024576747,0.02242077],"genre_scores_gemma":[0.9002138,0.00057024584,0.09086444,0.00011381762,0.000022840419,0.00037719466,0.00035912983,0.00009281333,0.007385743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989097,0.00039689604,0.000053325697,0.0002061218,0.0002629255,0.00017099004],"domain_scores_gemma":[0.99766856,0.0011605854,0.000334653,0.00025944316,0.00035018663,0.00022663201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016059323,0.00074048515,0.0006922431,0.0008664407,0.0011535715,0.0020405313,0.0010407462,0.0011308948,0.004686331],"category_scores_gemma":[0.007965694,0.00036866343,0.000981234,0.00068593933,0.0012293713,0.0024913694,0.0012043638,0.0016208575,0.0009211492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000155196,0.00009763105,0.0025834448,0.00009061391,0.000059453716,0.0006022009,0.00059755414,0.13728191,0.0056289895,0.81442755,0.0024079515,0.036067393],"study_design_scores_gemma":[0.0000290122,0.00011729554,0.0009320467,0.00005156903,0.000019315126,0.000682043,0.00028101896,0.51328033,0.0015979112,0.47585458,0.007102268,0.000052654937],"about_ca_topic_score_codex":0.0011017958,"about_ca_topic_score_gemma":0.000759625,"teacher_disagreement_score":0.004686331,"about_ca_system_score_codex":0.0015099512,"about_ca_system_score_gemma":0.0007942205,"threshold_uncertainty_score":0.015677333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110011205,0.0009923009,0.84558624,0.010135639,0.0002424673,0.000418233,0.00036776293,0.00040124296,0.03184495],"genre_scores_gemma":[0.8776298,0.0005086917,0.111842886,0.00065736973,0.00034742884,0.00033636694,0.00015234308,0.00006523389,0.008459821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99187005,0.004160614,0.0004664261,0.0013544608,0.0013723643,0.0007759862],"domain_scores_gemma":[0.97929335,0.013133542,0.0029302295,0.0019992865,0.0013254557,0.0013181343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012188941,0.0011850365,0.0017302757,0.0012597026,0.002020551,0.005656032,0.002543481,0.005596444,0.007712415],"category_scores_gemma":[0.041296054,0.00071745313,0.0013958712,0.0012310304,0.0036311187,0.009747333,0.003137762,0.0033468874,0.0008484012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041002608,0.00014649169,0.0011760329,0.00021321207,0.00009849687,0.00033732958,0.000927384,0.03763187,0.0024108456,0.92602533,0.0030514114,0.027571578],"study_design_scores_gemma":[0.00019323052,0.0002004789,0.00034564704,0.000080612095,0.00006956716,0.00018940077,0.00018924027,0.16640067,0.0013864451,0.8249151,0.0059786853,0.000050867893],"about_ca_topic_score_codex":0.0012899283,"about_ca_topic_score_gemma":0.0006417548,"teacher_disagreement_score":0.012188941,"about_ca_system_score_codex":0.0029232067,"about_ca_system_score_gemma":0.0030270158,"threshold_uncertainty_score":0.064462066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013869571,0.00008354329,0.99516773,0.00008747208,0.000018285202,0.00018210363,0.00010700574,0.00012567936,0.002841271],"genre_scores_gemma":[0.051220346,0.00016750196,0.9448568,0.000044396005,0.000027773938,0.0005978932,0.00040361256,0.00006317868,0.0026185578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913039,0.0034530312,0.00042131732,0.0008713587,0.003566839,0.00038364908],"domain_scores_gemma":[0.99338466,0.003123305,0.0006775847,0.0009411317,0.0015985176,0.0002747603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006302859,0.001057694,0.0012599372,0.007194323,0.0022553531,0.0038061645,0.0030483955,0.0011030056,0.008071286],"category_scores_gemma":[0.013132514,0.00057896186,0.0026536183,0.0054623773,0.0016863686,0.0036902293,0.004064592,0.0019936156,0.0013362074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039933904,0.00011557165,0.0022706464,0.000302406,0.00017205023,0.00022298995,0.0010939043,0.10526094,0.0015566653,0.675032,0.0049700877,0.20896283],"study_design_scores_gemma":[0.00001995242,0.00006996872,0.0009519821,0.00015888573,0.00006116385,0.00030292064,0.00059680705,0.46093762,0.0027312837,0.49846372,0.035650246,0.000055444427],"about_ca_topic_score_codex":0.0020418493,"about_ca_topic_score_gemma":0.00224991,"teacher_disagreement_score":0.008071286,"about_ca_system_score_codex":0.0032785921,"about_ca_system_score_gemma":0.0029205312,"threshold_uncertainty_score":0.033333123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46207157,0.00019259712,0.5103258,0.0011630238,0.000053139163,0.0002113761,0.00014863376,0.00027416518,0.025559735],"genre_scores_gemma":[0.9641474,0.00005773141,0.034415998,0.00006499217,0.000025492087,0.000083239225,0.00002924988,0.000018550116,0.0011574025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907465,0.00485604,0.00048610527,0.0015499165,0.0017828868,0.00057851785],"domain_scores_gemma":[0.9491291,0.032049652,0.0102270655,0.0063171494,0.00136097,0.00091600185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00910872,0.0007481178,0.0010521219,0.0008817419,0.0009270934,0.0038087706,0.0016969362,0.002153534,0.0050994265],"category_scores_gemma":[0.03658629,0.0006260886,0.0011838457,0.00079910824,0.0045667747,0.008168443,0.0032327133,0.0021719371,0.0004351452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011867683,0.00047732782,0.0035503348,0.00021519429,0.00011487671,0.00065546954,0.0009413877,0.052835483,0.021658165,0.888488,0.00034607865,0.029530818],"study_design_scores_gemma":[0.00022649673,0.0008435009,0.0018734677,0.000036881214,0.00007671458,0.0002655478,0.00024109775,0.27173746,0.013841211,0.7087096,0.0020611181,0.00008688086],"about_ca_topic_score_codex":0.00045433844,"about_ca_topic_score_gemma":0.0002923721,"teacher_disagreement_score":0.00910872,"about_ca_system_score_codex":0.001479599,"about_ca_system_score_gemma":0.001056564,"threshold_uncertainty_score":0.048172116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96072197,0.0006375618,0.0070617907,0.0014522225,0.00018189702,0.00082382397,0.00045906176,0.000058034635,0.028603658],"genre_scores_gemma":[0.98774487,0.00039166107,0.005638629,0.00030176598,0.000066050845,0.0007008331,0.00021756666,0.000033688626,0.0049049025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901598,0.005941768,0.00068720407,0.0008803081,0.0012540339,0.0010769074],"domain_scores_gemma":[0.8235408,0.15399379,0.0062099583,0.010802791,0.0023275942,0.003125024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015431903,0.0014617272,0.0019979074,0.0014695058,0.0031823686,0.0032801242,0.0023037614,0.0072234976,0.016338557],"category_scores_gemma":[0.067252465,0.0007898223,0.0012668227,0.0017320393,0.0061019417,0.0055318354,0.0033036014,0.004519964,0.0017862552],"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.061370626,0.09479016,0.06909539,0.0042050914,0.0013964062,0.014609698,0.020866534,0.03491603,0.025147736,0.5402541,0.037323896,0.096024334],"study_design_scores_gemma":[0.04441557,0.0578946,0.033490706,0.0012387427,0.0019736239,0.0116060665,0.03327396,0.18636325,0.025483714,0.5644052,0.038917914,0.0009366929],"about_ca_topic_score_codex":0.0026357537,"about_ca_topic_score_gemma":0.0021724848,"teacher_disagreement_score":0.016338557,"about_ca_system_score_codex":0.0016905867,"about_ca_system_score_gemma":0.001353343,"threshold_uncertainty_score":0.08161265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037726965,0.00008248511,0.99207073,0.0001106014,0.000026920286,0.000040564813,0.00008455981,0.00007844153,0.003733029],"genre_scores_gemma":[0.31118837,0.0004908069,0.680998,0.000114315735,0.00009703589,0.0004997751,0.00051068875,0.00008097082,0.0060199727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986098,0.000637909,0.000090329384,0.0001999856,0.00035236828,0.0001095443],"domain_scores_gemma":[0.99783355,0.0011422479,0.0003530993,0.00018391687,0.00037842325,0.00010886181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015945968,0.0012022709,0.00078067573,0.0018984627,0.0006268854,0.0022386261,0.0015729511,0.0009550824,0.006349379],"category_scores_gemma":[0.005192705,0.00031586032,0.0008916321,0.0023020117,0.0011619709,0.0033683972,0.0011259768,0.0014741437,0.00095775136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003770947,0.000030352934,0.0003345419,0.00009053472,0.000028002674,0.00012639255,0.00025787423,0.2710356,0.0015187318,0.68963003,0.0019168841,0.03499337],"study_design_scores_gemma":[0.000011777416,0.000029777502,0.00007954568,0.000017932143,0.000010361171,0.000058809015,0.00007441746,0.73902464,0.0004696399,0.25676036,0.0034425547,0.000020236914],"about_ca_topic_score_codex":0.0030472684,"about_ca_topic_score_gemma":0.0028191642,"teacher_disagreement_score":0.006349379,"about_ca_system_score_codex":0.0012608862,"about_ca_system_score_gemma":0.0012033066,"threshold_uncertainty_score":0.02124083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10759482,0.00033057,0.88483065,0.0004059786,0.000074979944,0.00018592045,0.000047336,0.00015079016,0.0063788868],"genre_scores_gemma":[0.8677794,0.00030284224,0.12648572,0.000055220877,0.00004930157,0.00028048235,0.000055954984,0.000030440542,0.0049606194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837154,0.00074485276,0.00008563115,0.00023650669,0.0003391927,0.00022234746],"domain_scores_gemma":[0.99455255,0.0024385366,0.001004265,0.00077134604,0.00068557326,0.0005476119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030770341,0.0005686594,0.0010504804,0.0009909666,0.0013624985,0.0018264652,0.0025224846,0.0016202042,0.0023254913],"category_scores_gemma":[0.010474452,0.0004456649,0.0010430253,0.0009489255,0.0013850505,0.0032978894,0.0019664622,0.0009889642,0.00037653002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033232794,0.00038313857,0.003429812,0.00019363152,0.00034656757,0.0006778414,0.0011543276,0.37682188,0.0117772585,0.5455923,0.00226491,0.05702601],"study_design_scores_gemma":[0.000090152666,0.00023691572,0.0004915936,0.00002137158,0.00008713082,0.00023611184,0.00013822796,0.9225628,0.0019233598,0.07014417,0.0040296395,0.000038465467],"about_ca_topic_score_codex":0.001833751,"about_ca_topic_score_gemma":0.00095494726,"teacher_disagreement_score":0.0030770341,"about_ca_system_score_codex":0.0012092394,"about_ca_system_score_gemma":0.0013380252,"threshold_uncertainty_score":0.016273081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052644294,0.02082145,0.27454942,0.0043506036,0.00097026915,0.00014929865,0.00044248425,0.00020997097,0.6932421],"genre_scores_gemma":[0.5532771,0.026763909,0.08372472,0.0027699794,0.0013782375,0.00077037816,0.00088722253,0.00019405731,0.33023444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992986,0.00021394517,0.000029236604,0.00012345998,0.00023924372,0.00009566997],"domain_scores_gemma":[0.9995753,0.0002078154,0.000022689359,0.000065897104,0.000097000935,0.000031355212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068177085,0.0010669251,0.0009621117,0.0008263041,0.0010144555,0.0031599172,0.0014479547,0.00160685,0.017089194],"category_scores_gemma":[0.0014025965,0.00038380697,0.0007516254,0.0010416886,0.0024900637,0.002481423,0.0012925798,0.0022952068,0.0037533536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004672674,0.000012266886,0.000041795545,0.00007035744,0.000010338042,0.000025093512,0.00008398708,0.002426783,0.00014524376,0.97175074,0.013588803,0.0118398415],"study_design_scores_gemma":[0.000008378059,0.000011553938,0.000080466525,0.000050324663,0.0000069238827,0.000069292764,0.00004383476,0.006509354,0.00010026396,0.9396876,0.05342491,0.000007113601],"about_ca_topic_score_codex":0.0023347782,"about_ca_topic_score_gemma":0.0015598625,"teacher_disagreement_score":0.017089194,"about_ca_system_score_codex":0.002103515,"about_ca_system_score_gemma":0.001219241,"threshold_uncertainty_score":0.05716902},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10352042,0.015622015,0.67617923,0.028243372,0.00097228604,0.000044415458,0.0001789177,0.00016501025,0.1750743],"genre_scores_gemma":[0.93501824,0.0039494354,0.050550386,0.00079196435,0.00043919036,0.000052966545,0.000038270147,0.00003908407,0.009120436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990491,0.0005905465,0.000024003666,0.00012134115,0.00015754675,0.000057340356],"domain_scores_gemma":[0.99830234,0.0011802022,0.00013589798,0.00013693301,0.00010661902,0.00013797187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088945,0.0005111987,0.00090416893,0.0007297359,0.0010996829,0.004362094,0.00064533367,0.002709616,0.0050242622],"category_scores_gemma":[0.0048354706,0.00035553353,0.00056514883,0.0014651701,0.004658735,0.007974588,0.0014120069,0.0023095994,0.0005712308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093414665,0.0000056156046,0.000074093216,0.000023346818,0.000005685691,0.00003238681,0.00007829686,0.00390028,0.00007549552,0.99136364,0.00069320854,0.0037385542],"study_design_scores_gemma":[0.0000034890725,0.000002940022,0.000030689596,0.000006301947,0.0000016977627,0.000020012405,0.000022600661,0.0063640038,0.000017869135,0.9917766,0.0017504876,0.0000033099338],"about_ca_topic_score_codex":0.001199449,"about_ca_topic_score_gemma":0.0011502884,"teacher_disagreement_score":0.0050242622,"about_ca_system_score_codex":0.0012479067,"about_ca_system_score_gemma":0.0011319875,"threshold_uncertainty_score":0.016807795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65622395,0.0011475168,0.1308092,0.0316438,0.00070250186,0.00023178419,0.00049700844,0.0006292129,0.17811498],"genre_scores_gemma":[0.99331725,0.00009066967,0.003203308,0.000332537,0.00011818216,0.00004054488,0.000039935483,0.00005167454,0.002805895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476457,0.0013069054,0.00029523633,0.0016992674,0.0006229631,0.0013110563],"domain_scores_gemma":[0.9500934,0.030117642,0.008147834,0.005414635,0.0027491085,0.0034773604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006861506,0.00040608077,0.0014600451,0.0007483709,0.0013853677,0.0060999063,0.0010688987,0.0028848767,0.016174195],"category_scores_gemma":[0.043439116,0.0005574655,0.0006369584,0.0007858366,0.0028386335,0.013070465,0.0023664762,0.0025955304,0.0021392095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001170955,0.0004046183,0.015602313,0.00046247014,0.00020783361,0.00061127596,0.0014958563,0.012067271,0.0066582817,0.8810778,0.013657596,0.06658368],"study_design_scores_gemma":[0.00017353763,0.00019337157,0.010313387,0.000075904056,0.00006799357,0.00039174364,0.0029941178,0.021198122,0.0027653973,0.95383066,0.0079447115,0.000051027993],"about_ca_topic_score_codex":0.00089367805,"about_ca_topic_score_gemma":0.00072712026,"teacher_disagreement_score":0.016174195,"about_ca_system_score_codex":0.0015967656,"about_ca_system_score_gemma":0.0023982716,"threshold_uncertainty_score":0.054108083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22287436,0.0063046897,0.604958,0.018780423,0.0009122983,0.00023447884,0.0011151062,0.00052934187,0.14429127],"genre_scores_gemma":[0.970401,0.001668462,0.015421776,0.00023918357,0.00030535148,0.00017597346,0.00018669055,0.000028574195,0.011572975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988311,0.00053142983,0.00004573369,0.00021536819,0.00025180078,0.0001245683],"domain_scores_gemma":[0.9964244,0.0022540665,0.0004349517,0.00024250672,0.00034385355,0.00030017208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012251181,0.0006021896,0.0010402367,0.0014976726,0.0010868863,0.004345709,0.0012879156,0.0025581184,0.0087290555],"category_scores_gemma":[0.0072302376,0.00059761043,0.00069819676,0.0011330977,0.0037025604,0.0041057,0.0018620127,0.0012720677,0.00066018343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010816601,0.000033196164,0.0008872455,0.000045165852,0.00005192766,0.0001149528,0.0002503567,0.033660877,0.000425522,0.95753837,0.001762992,0.005218547],"study_design_scores_gemma":[0.000021037991,0.000021498294,0.00075168314,0.000017627002,0.000023641967,0.000093882336,0.0001791493,0.119747706,0.00007010083,0.87501884,0.0040313452,0.000023472689],"about_ca_topic_score_codex":0.0032133288,"about_ca_topic_score_gemma":0.0018622048,"teacher_disagreement_score":0.0087290555,"about_ca_system_score_codex":0.0016122166,"about_ca_system_score_gemma":0.0012247645,"threshold_uncertainty_score":0.029201627},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39563742,0.0020261148,0.5419172,0.0014841954,0.0001061013,0.000109757835,0.0001393019,0.0000975195,0.058482416],"genre_scores_gemma":[0.96997344,0.00092892273,0.019369056,0.00011039897,0.00010020403,0.00011634529,0.0000565993,0.000019352383,0.009325576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978192,0.0010774853,0.00009393939,0.00017773158,0.00057177345,0.00025980623],"domain_scores_gemma":[0.9945437,0.0038854673,0.00052514276,0.00022756362,0.00048353258,0.00033472216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023652753,0.0008416052,0.0012246368,0.00089259853,0.0008872215,0.0030937116,0.0011140566,0.0010540818,0.0018136055],"category_scores_gemma":[0.008299578,0.00040152523,0.0008800745,0.0010084972,0.0031036602,0.0032995434,0.0011255253,0.0014803262,0.00015954397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050268547,0.00003579344,0.0005849029,0.00010286988,0.00005015659,0.00017402583,0.00057336123,0.03150098,0.0011600421,0.9575828,0.00071005616,0.007474764],"study_design_scores_gemma":[0.000020119223,0.000026865557,0.00032141554,0.000011713635,0.000014972326,0.000061821105,0.00011386376,0.061490644,0.00016429236,0.9368002,0.0009622431,0.000011726232],"about_ca_topic_score_codex":0.003993579,"about_ca_topic_score_gemma":0.0042395536,"teacher_disagreement_score":0.003993579,"about_ca_system_score_codex":0.0017851816,"about_ca_system_score_gemma":0.0014083252,"threshold_uncertainty_score":0.012952507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0816753,0.0002719164,0.9041646,0.0006755156,0.00011319239,0.0001452039,0.00008197132,0.0007488602,0.012123336],"genre_scores_gemma":[0.9529711,0.00013150446,0.040741254,0.00013472575,0.00006560081,0.00013805267,0.00006322417,0.000042613075,0.0057119722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00030465622,0.00005158804,0.00024782974,0.00029009543,0.00018258908],"domain_scores_gemma":[0.9980888,0.0007164593,0.00030353552,0.00044444797,0.000246266,0.00020053788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917225,0.00047740902,0.00070151896,0.00039650904,0.0008482097,0.0014070938,0.0018252574,0.0008625577,0.0033424655],"category_scores_gemma":[0.0044730445,0.00032472055,0.0003108555,0.00042890152,0.0009993955,0.002030589,0.0020275386,0.0006252588,0.0005762019],"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.0009469089,0.00020814025,0.001903145,0.0001945808,0.00012618121,0.00050383375,0.0005532133,0.6886549,0.024986684,0.20165928,0.005407984,0.07485518],"study_design_scores_gemma":[0.00006068778,0.00006775217,0.00019150085,0.000007149278,0.000011005493,0.00010295948,0.00004867405,0.9500699,0.0021502364,0.044142287,0.0031347445,0.00001309697],"about_ca_topic_score_codex":0.0008647829,"about_ca_topic_score_gemma":0.00083176635,"teacher_disagreement_score":0.0033424655,"about_ca_system_score_codex":0.00093298167,"about_ca_system_score_gemma":0.0007602318,"threshold_uncertainty_score":0.011181712},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34198475,0.0003964952,0.6403514,0.0015366921,0.00006442126,0.0002467483,0.0001385057,0.00025340106,0.015027638],"genre_scores_gemma":[0.94179696,0.00038389317,0.04686197,0.00021570118,0.00006005936,0.0005122851,0.00010681914,0.00012625201,0.009936106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963594,0.0019907563,0.00016999665,0.00045322278,0.00051662273,0.0005099561],"domain_scores_gemma":[0.9540555,0.038660854,0.002665373,0.0011615847,0.0019209699,0.0015357534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008524915,0.0014518601,0.002786507,0.0021722834,0.0015035312,0.005019359,0.0030529813,0.0033365854,0.0058836564],"category_scores_gemma":[0.05159588,0.0012084225,0.0016089297,0.0013501644,0.0051263743,0.006364303,0.004896922,0.0032836352,0.0006955303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005664413,0.00026386773,0.0015798301,0.00023301181,0.00015623734,0.00023305928,0.0009790225,0.28981042,0.0021873023,0.69013137,0.0015480653,0.012311406],"study_design_scores_gemma":[0.00013058307,0.00009086968,0.0002429615,0.000027749178,0.000022138282,0.000046973157,0.00018495861,0.5492264,0.00041240596,0.44919264,0.00039705727,0.000025352298],"about_ca_topic_score_codex":0.0022078739,"about_ca_topic_score_gemma":0.0013742554,"teacher_disagreement_score":0.008524915,"about_ca_system_score_codex":0.0025263052,"about_ca_system_score_gemma":0.0018678796,"threshold_uncertainty_score":0.045084596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19243184,0.0005023275,0.79210573,0.001088381,0.000043965763,0.00022637969,0.00010215962,0.00020621935,0.013292981],"genre_scores_gemma":[0.96499336,0.0001982558,0.030895308,0.00015499264,0.0000335337,0.00028634674,0.000054174485,0.000059676902,0.0033243357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900934,0.0059413444,0.00033022973,0.0009891145,0.0015143082,0.0011316179],"domain_scores_gemma":[0.97116673,0.020182157,0.002868185,0.0033484485,0.0016830779,0.00075145595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018008256,0.000922926,0.002264529,0.0010957217,0.001043384,0.0032650384,0.003321605,0.0026630242,0.0038414816],"category_scores_gemma":[0.03935649,0.0008740824,0.00085045554,0.0011581855,0.0031062576,0.006689929,0.0032234602,0.0012256614,0.0007429789],"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.00058308465,0.00020184889,0.0021672137,0.00017318959,0.00015949618,0.00023087124,0.00024204698,0.6670156,0.0042873486,0.29381752,0.0012547806,0.02986699],"study_design_scores_gemma":[0.00009063402,0.000111559384,0.0003661001,0.000016059352,0.00002799978,0.00011651786,0.00006964577,0.86836505,0.0014640011,0.1285882,0.00076550356,0.000018721412],"about_ca_topic_score_codex":0.0011446903,"about_ca_topic_score_gemma":0.00057455804,"teacher_disagreement_score":0.018008256,"about_ca_system_score_codex":0.002472207,"about_ca_system_score_gemma":0.0023755198,"threshold_uncertainty_score":0.09523791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3997976,0.00063654216,0.55884117,0.0041540274,0.0003163865,0.0013081492,0.000700642,0.0005501784,0.03369535],"genre_scores_gemma":[0.9592496,0.00008740299,0.038007226,0.00006348637,0.000049264716,0.00016460958,0.00013008731,0.000022770138,0.00222554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960503,0.0019644594,0.00018966444,0.0004942856,0.0007350555,0.0005661892],"domain_scores_gemma":[0.992427,0.0040994687,0.0014563674,0.00045835026,0.00084945356,0.0007094371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007268704,0.00081036997,0.0015108802,0.0022785726,0.0012411482,0.004450792,0.0016002099,0.0018588126,0.0068364698],"category_scores_gemma":[0.012604577,0.00038526743,0.0007763769,0.0015559144,0.0011816325,0.002649117,0.0011755998,0.0016133392,0.0008376018],"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.0019512599,0.0012456661,0.037631914,0.00047685407,0.00024763,0.00020149704,0.0010151928,0.59997326,0.0059524,0.107655264,0.007035292,0.23661387],"study_design_scores_gemma":[0.000061149636,0.0002629257,0.010217074,0.000086125496,0.00004944234,0.000024973473,0.00062060886,0.94168603,0.0013027528,0.043571934,0.0020471269,0.000069849],"about_ca_topic_score_codex":0.0046919347,"about_ca_topic_score_gemma":0.004658907,"teacher_disagreement_score":0.007268704,"about_ca_system_score_codex":0.0030198453,"about_ca_system_score_gemma":0.0027207914,"threshold_uncertainty_score":0.038441002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8178307,0.0012634919,0.08050569,0.0071845413,0.00017299657,0.0003923715,0.00026243855,0.00020029387,0.09218754],"genre_scores_gemma":[0.9920006,0.00018178462,0.003474197,0.0005751388,0.00005077056,0.00009041807,0.00003659626,0.000024794308,0.0035657054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99445033,0.0026966312,0.00013471639,0.0012099643,0.0008270859,0.00068135915],"domain_scores_gemma":[0.98325264,0.008810817,0.0034998131,0.0019918974,0.0007784274,0.0016664016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062803626,0.000533509,0.00095007714,0.0013089535,0.0021840897,0.002289234,0.0013520889,0.0020507914,0.0153635815],"category_scores_gemma":[0.028138816,0.00038085636,0.0009774403,0.0007837703,0.0055150534,0.002815178,0.005026169,0.0026636373,0.0011550088],"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.0013007738,0.00068372267,0.16188134,0.00030321177,0.00019777399,0.0035416712,0.014758146,0.009989142,0.009853408,0.5893536,0.0061716763,0.2019654],"study_design_scores_gemma":[0.00036357137,0.00092365715,0.18948439,0.00030343243,0.00034668774,0.0016718669,0.00831895,0.046168018,0.0039633517,0.72971874,0.01857684,0.00016055409],"about_ca_topic_score_codex":0.0024082577,"about_ca_topic_score_gemma":0.0020566296,"teacher_disagreement_score":0.0153635815,"about_ca_system_score_codex":0.0016371547,"about_ca_system_score_gemma":0.0009772489,"threshold_uncertainty_score":0.05139625},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016757602,0.112449646,0.040805805,0.23029627,0.014146766,0.00009333166,0.0003702621,0.000066777255,0.58501357],"genre_scores_gemma":[0.5465226,0.15412746,0.019088067,0.031146213,0.023539543,0.00048449836,0.00051651045,0.00016269766,0.22441247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983028,0.0007527708,0.000087880544,0.00025910008,0.00047461494,0.00012289736],"domain_scores_gemma":[0.98936975,0.009242872,0.00032997454,0.00028070243,0.00058556156,0.0001910522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024978062,0.0009232584,0.00056649436,0.0010578874,0.0012928162,0.0032441479,0.00069638627,0.002977302,0.01022435],"category_scores_gemma":[0.009990986,0.00028929682,0.00074491824,0.0013094723,0.005172732,0.0035080612,0.0010339539,0.003979799,0.001676619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026226555,0.00004728426,0.00020361519,0.00022686513,0.000017671686,0.0000769735,0.0005607033,0.0026727228,0.00013590368,0.9397719,0.042082436,0.014177713],"study_design_scores_gemma":[0.000018777113,0.000021855492,0.00050786114,0.00052709854,0.000012728746,0.00005186035,0.0003681357,0.0016244588,0.00012575372,0.80526924,0.191459,0.000013210606],"about_ca_topic_score_codex":0.0013246275,"about_ca_topic_score_gemma":0.0008891124,"teacher_disagreement_score":0.01022435,"about_ca_system_score_codex":0.0032326456,"about_ca_system_score_gemma":0.0017907838,"threshold_uncertainty_score":0.034203827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010968671,0.0057498263,0.021898814,0.0037623364,0.0005795909,0.000026173147,0.00005422204,0.00006293659,0.96676934],"genre_scores_gemma":[0.08606703,0.0077808853,0.01169089,0.0022038075,0.00051562116,0.00017452797,0.000107873915,0.00013990015,0.8913194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964535,0.00015839393,0.000008317814,0.000045369285,0.0001076845,0.000034757053],"domain_scores_gemma":[0.99976677,0.00012434514,0.0000118234775,0.000034082233,0.000040980867,0.000022043225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039886482,0.00088073045,0.00049843395,0.00074012147,0.0011218858,0.0033311252,0.00074691675,0.0013971301,0.022698645],"category_scores_gemma":[0.0012316762,0.00028140665,0.0002516283,0.00068062247,0.0032617021,0.0035293968,0.0009816632,0.0023976853,0.0040236358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020482503,0.0000060825437,0.00001214907,0.000019983876,0.0000015936431,0.000007312973,0.000099357516,0.0005384143,0.000036678302,0.96580404,0.021557165,0.0119151035],"study_design_scores_gemma":[0.0000023782193,0.0000036905785,0.000032144562,0.000062315354,0.0000019843571,0.000018191131,0.000074879965,0.000831569,0.000081211394,0.7671005,0.2317879,0.0000031514044],"about_ca_topic_score_codex":0.004363513,"about_ca_topic_score_gemma":0.006658774,"teacher_disagreement_score":0.022698645,"about_ca_system_score_codex":0.00288476,"about_ca_system_score_gemma":0.0015202754,"threshold_uncertainty_score":0.07593453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13109188,0.00041960363,0.8553252,0.00065700617,0.000090301226,0.00010863939,0.00017233641,0.0005743835,0.0115606515],"genre_scores_gemma":[0.8606635,0.00032077308,0.13430874,0.000096449665,0.000040193514,0.00011953274,0.00026408304,0.00014292233,0.0040437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979334,0.0008167902,0.0001527549,0.00047090164,0.000357482,0.00026871293],"domain_scores_gemma":[0.9917734,0.006667321,0.00034090513,0.00034537064,0.0005057988,0.00036727384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002646698,0.0011908426,0.0019651824,0.001945415,0.001250469,0.0057477877,0.002290087,0.0014045386,0.0057851234],"category_scores_gemma":[0.020099076,0.0008180602,0.0009194879,0.0015553916,0.0022011464,0.005664556,0.0030063961,0.0022496874,0.0007457479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004924049,0.00018110833,0.0017830705,0.00028160986,0.000094850235,0.00011906771,0.0004734714,0.25815752,0.0016241826,0.6697068,0.0015685651,0.06551738],"study_design_scores_gemma":[0.00003239866,0.000025323225,0.000079418634,0.000031849737,0.00002089968,0.000017039969,0.00008336975,0.37505034,0.0010948792,0.6229457,0.0006068796,0.000011954636],"about_ca_topic_score_codex":0.0042001293,"about_ca_topic_score_gemma":0.004014522,"teacher_disagreement_score":0.0057851234,"about_ca_system_score_codex":0.0026921213,"about_ca_system_score_gemma":0.0016121017,"threshold_uncertainty_score":0.0195328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26606205,0.0009815312,0.6896462,0.0027512657,0.00008116946,0.00016377163,0.0010956927,0.0006043628,0.038613882],"genre_scores_gemma":[0.95398676,0.0002445494,0.043044124,0.0001726725,0.0001040266,0.0001244544,0.0003763127,0.000060874205,0.0018862195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99054635,0.003064384,0.0007285842,0.0023183224,0.002655848,0.0006866356],"domain_scores_gemma":[0.9337525,0.048108745,0.0054879826,0.0048013725,0.005171055,0.0026782677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007868662,0.0010139883,0.0014933598,0.0038432484,0.0015894315,0.005455988,0.0023564727,0.002327943,0.0061513213],"category_scores_gemma":[0.05970859,0.0011720473,0.001400759,0.0018605331,0.0060736835,0.010584831,0.004436494,0.0039402945,0.00077957223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018117433,0.00007314445,0.0038765827,0.00020096559,0.00011100967,0.00035228973,0.0009263589,0.012189424,0.0018348636,0.96390986,0.00081217923,0.015531979],"study_design_scores_gemma":[0.000034413515,0.000062768115,0.0011172049,0.00006860988,0.00006735185,0.00022166113,0.00020266473,0.033843342,0.0013942805,0.960842,0.0021146224,0.000031135565],"about_ca_topic_score_codex":0.0010697101,"about_ca_topic_score_gemma":0.0010254107,"teacher_disagreement_score":0.007868662,"about_ca_system_score_codex":0.0016308918,"about_ca_system_score_gemma":0.0011426911,"threshold_uncertainty_score":0.041613936},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013742755,0.5510737,0.024325592,0.13619731,0.121602945,0.000038294915,0.0019689135,0.0001558845,0.15089467],"genre_scores_gemma":[0.16160418,0.28297728,0.011488751,0.008437511,0.065715075,0.000093235074,0.0011801478,0.00047409176,0.4680297],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919254,0.00020515533,0.000053538435,0.00018284692,0.00024760453,0.000118359676],"domain_scores_gemma":[0.9981547,0.00063977693,0.00006800529,0.00009275189,0.00064409664,0.0004006219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024316437,0.0010490877,0.0011649177,0.001609991,0.0008241382,0.0029134203,0.0009254034,0.0026603155,0.019716099],"category_scores_gemma":[0.0034484318,0.00062927086,0.0011836174,0.001212764,0.0015889427,0.0019036697,0.0018397227,0.0026972292,0.0031309593],"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.00025477703,0.00017230233,0.001167313,0.00055848435,0.00021865555,0.0003345495,0.00039673233,0.006298094,0.0023306627,0.14532284,0.6662574,0.17668825],"study_design_scores_gemma":[0.000020634881,0.000060906703,0.0040030708,0.0007244897,0.00011425389,0.000204932,0.00018757167,0.0038462407,0.0006848992,0.085042305,0.9050295,0.00008114921],"about_ca_topic_score_codex":0.025175946,"about_ca_topic_score_gemma":0.027577892,"teacher_disagreement_score":0.025175946,"about_ca_system_score_codex":0.0032051788,"about_ca_system_score_gemma":0.0038685529,"threshold_uncertainty_score":0.06595695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10510003,0.000563447,0.88846093,0.0007054099,0.00005882299,0.000027263088,0.00008409868,0.00018698865,0.0048130844],"genre_scores_gemma":[0.97961146,0.00026428778,0.018856084,0.0000826703,0.000030957966,0.0000500273,0.00006643418,0.000028295632,0.0010098336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843043,0.0007684954,0.000060457103,0.00019585356,0.00039452885,0.00015012232],"domain_scores_gemma":[0.994447,0.00421295,0.0004778965,0.00045095882,0.0002836862,0.00012750721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00262087,0.00061545044,0.0013180276,0.00046715478,0.00051357306,0.0015500608,0.001126274,0.0010318574,0.0010001585],"category_scores_gemma":[0.015097012,0.0005204332,0.0005613666,0.00045507267,0.0030077142,0.0026524465,0.0012248678,0.0019069341,0.000109933055],"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.00003106294,0.000015567022,0.00019278306,0.000030568728,0.000017102459,0.000030268195,0.00005484867,0.85960716,0.0003464426,0.13780667,0.00017241931,0.0016950874],"study_design_scores_gemma":[0.000005833084,0.00001143765,0.000036341702,0.0000053292065,0.0000018985098,0.000004431148,0.000008513027,0.95901734,0.00008860759,0.040731497,0.00008450738,0.0000042479996],"about_ca_topic_score_codex":0.0063745906,"about_ca_topic_score_gemma":0.0027963254,"teacher_disagreement_score":0.0063745906,"about_ca_system_score_codex":0.0024021994,"about_ca_system_score_gemma":0.0012295276,"threshold_uncertainty_score":0.017429292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04956546,0.0009403647,0.91491026,0.0050090645,0.0002090032,0.00010630535,0.00049609126,0.00029697726,0.028466348],"genre_scores_gemma":[0.90700036,0.0011602379,0.07882436,0.0017937373,0.00047786528,0.00037505446,0.00021589099,0.00016975013,0.009982804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956292,0.0016264159,0.0002131791,0.0009295265,0.0009421523,0.00065951276],"domain_scores_gemma":[0.96630156,0.025576862,0.003157506,0.002667826,0.0015748733,0.0007212916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073266723,0.0010804809,0.0021753316,0.0012471444,0.0013015077,0.0034662504,0.003102576,0.002708315,0.007254524],"category_scores_gemma":[0.03764548,0.0006996928,0.0020230254,0.001200831,0.0058495,0.010051477,0.0030292328,0.004326896,0.000870214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008342959,0.000046357247,0.0006465204,0.00015493867,0.00006152592,0.00019525005,0.00022436929,0.026958063,0.00054749334,0.9623794,0.0017168352,0.0069857575],"study_design_scores_gemma":[0.000038361075,0.000046413363,0.0002642047,0.00003359918,0.000021073063,0.00009533363,0.000030564286,0.11539927,0.0002730767,0.8826142,0.0011590832,0.000024865516],"about_ca_topic_score_codex":0.002390655,"about_ca_topic_score_gemma":0.0011749957,"teacher_disagreement_score":0.0073266723,"about_ca_system_score_codex":0.0028778568,"about_ca_system_score_gemma":0.0020862708,"threshold_uncertainty_score":0.03874761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5139879,0.0014247088,0.4232125,0.0053156326,0.00010694114,0.0002321048,0.00029810422,0.00020597024,0.055216175],"genre_scores_gemma":[0.98549783,0.00015203134,0.010876319,0.00017555113,0.000039542705,0.00007853102,0.000027060612,0.000011921822,0.0031412423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98986757,0.007338525,0.00028218687,0.0007513989,0.001039587,0.00072079216],"domain_scores_gemma":[0.958462,0.035022996,0.002811696,0.0021185,0.0007112352,0.00087355915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01066229,0.0006673656,0.0018247883,0.0008875863,0.0009051157,0.0032326488,0.0015484102,0.002387743,0.0056909397],"category_scores_gemma":[0.031354517,0.0008152747,0.000960373,0.00071683293,0.0035321165,0.0044756955,0.0025805617,0.002311666,0.00041289156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066154246,0.00014743773,0.0013677492,0.00029523324,0.00015606575,0.00038950524,0.00065591466,0.09050509,0.001546464,0.88945484,0.0011120967,0.013707989],"study_design_scores_gemma":[0.00016325904,0.00018846779,0.0007669046,0.00004929133,0.000036443726,0.0001601456,0.000124639,0.23046075,0.0007109761,0.7654996,0.0017880705,0.00005140173],"about_ca_topic_score_codex":0.0011561486,"about_ca_topic_score_gemma":0.0006341061,"teacher_disagreement_score":0.01066229,"about_ca_system_score_codex":0.0023065468,"about_ca_system_score_gemma":0.001282121,"threshold_uncertainty_score":0.05638826},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016308365,0.00029628913,0.94321704,0.0016323504,0.0001361534,0.00013903741,0.001064484,0.00018814002,0.03701818],"genre_scores_gemma":[0.58264554,0.0009786014,0.39696282,0.0008295443,0.00020592668,0.0010374556,0.0011240465,0.00021789888,0.015998146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958385,0.0018505923,0.0004427056,0.00084774423,0.0007582115,0.0002622061],"domain_scores_gemma":[0.99533564,0.0025036014,0.000501155,0.000996115,0.00052111084,0.00014237982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046004485,0.0013104235,0.00084454706,0.0008294279,0.00064821664,0.004023856,0.0014207351,0.0014791201,0.007813235],"category_scores_gemma":[0.010545846,0.0006872323,0.0010786837,0.0015265021,0.002781573,0.008784958,0.0023950394,0.0033604586,0.001397561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013280133,0.00001194112,0.00009504003,0.000034625744,0.000008782421,0.000036344994,0.00016698094,0.0048024603,0.00027473402,0.99050015,0.00043467933,0.0036209913],"study_design_scores_gemma":[0.00001046732,0.000012589961,0.000040308707,0.000017149116,0.000008800382,0.00003271704,0.000032254007,0.0068926183,0.00029159265,0.9869305,0.005722983,0.000007968519],"about_ca_topic_score_codex":0.00091314386,"about_ca_topic_score_gemma":0.0012203621,"teacher_disagreement_score":0.007813235,"about_ca_system_score_codex":0.0013335325,"about_ca_system_score_gemma":0.0012231517,"threshold_uncertainty_score":0.026137888},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21958093,0.0030582538,0.0611336,0.047127802,0.0008154919,0.00012933854,0.00013647422,0.00012058886,0.6678975],"genre_scores_gemma":[0.98606724,0.00026520318,0.002259683,0.0007618904,0.00014793586,0.000042769225,0.000011171467,0.000014657584,0.01042953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947102,0.0030464074,0.00020842352,0.00053338736,0.0010362191,0.00046528844],"domain_scores_gemma":[0.96085566,0.031475283,0.0032284323,0.0020796792,0.0015567716,0.000804292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005554543,0.00039762285,0.0005370951,0.0011181857,0.0011886815,0.005083502,0.00042388213,0.0035776515,0.011990431],"category_scores_gemma":[0.038354848,0.0003035019,0.00046645734,0.00061271637,0.004358159,0.004404006,0.002000299,0.003457808,0.0008744506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062913234,0.00007169708,0.0009208032,0.00006974927,0.000023849403,0.00008307019,0.0009550649,0.00086706993,0.00037949067,0.9839369,0.0017712355,0.010858155],"study_design_scores_gemma":[0.000030252195,0.000032138494,0.0009651715,0.000037741065,0.000018357163,0.000068885565,0.00032102122,0.002576147,0.00025858867,0.9908178,0.0048615723,0.000012349723],"about_ca_topic_score_codex":0.00055433274,"about_ca_topic_score_gemma":0.000369429,"teacher_disagreement_score":0.011990431,"about_ca_system_score_codex":0.0011510684,"about_ca_system_score_gemma":0.0012093046,"threshold_uncertainty_score":0.04011196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021136554,0.00040346716,0.9206951,0.0017694732,0.000088061766,0.00019530633,0.0012055152,0.00022372387,0.054282684],"genre_scores_gemma":[0.4834518,0.00090332545,0.49484637,0.0006229579,0.00009881925,0.0008970209,0.0015058361,0.0001873508,0.017486464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515355,0.00268272,0.00027765083,0.00092906697,0.0005891943,0.00036783176],"domain_scores_gemma":[0.99386734,0.0037736367,0.00040556584,0.0012542409,0.00042600592,0.00027323648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004438312,0.0011253088,0.00072112563,0.001241338,0.001296744,0.0047116783,0.0020620634,0.0023627372,0.011018033],"category_scores_gemma":[0.011690882,0.0011019423,0.0016128917,0.0018347017,0.004301346,0.011865179,0.0031730975,0.0036975122,0.0018566533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010472442,0.000007563626,0.00017815303,0.000019422932,0.000005367011,0.000037926482,0.00023907631,0.003874684,0.00014721144,0.9932255,0.00038745857,0.0018672069],"study_design_scores_gemma":[0.0000131204415,0.000009178117,0.00006763355,0.00002374181,0.000010107238,0.00004030815,0.00009153454,0.015838875,0.00016275057,0.9763579,0.007375518,0.000009392096],"about_ca_topic_score_codex":0.0040839426,"about_ca_topic_score_gemma":0.00526217,"teacher_disagreement_score":0.011018033,"about_ca_system_score_codex":0.00204789,"about_ca_system_score_gemma":0.0018636289,"threshold_uncertainty_score":0.036859035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046385586,0.00009191045,0.9498369,0.00020495059,0.000015109623,0.00007878795,0.00009939803,0.00057798246,0.0027093163],"genre_scores_gemma":[0.6514973,0.00012607375,0.34470236,0.00014523986,0.000024559955,0.00021463586,0.0004248465,0.00022479096,0.0026402816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758375,0.00091338,0.00012329537,0.000500333,0.0005543402,0.00032494473],"domain_scores_gemma":[0.9939699,0.004113271,0.00042721594,0.0008512676,0.0003976535,0.00024071244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027891581,0.00109347,0.0015857861,0.0009601246,0.00078944495,0.0023205988,0.0021769456,0.0011712969,0.0048343283],"category_scores_gemma":[0.019191308,0.0008185913,0.000995439,0.0011249852,0.0022035576,0.004453034,0.0029686505,0.0028291673,0.00072109746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073396036,0.00013712284,0.0015049969,0.00019310274,0.000079133126,0.00015634998,0.00035508358,0.37067226,0.0033024645,0.555706,0.0025366314,0.0646229],"study_design_scores_gemma":[0.00005235443,0.00004648043,0.00013436815,0.000012487866,0.000009685824,0.000030396855,0.000026315269,0.72384024,0.0018214595,0.2734562,0.0005568292,0.000013208281],"about_ca_topic_score_codex":0.0019043211,"about_ca_topic_score_gemma":0.0023562955,"teacher_disagreement_score":0.0048343283,"about_ca_system_score_codex":0.0021074533,"about_ca_system_score_gemma":0.0016217553,"threshold_uncertainty_score":0.016172409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48268235,0.010243445,0.27146494,0.019203557,0.00052961137,0.000100033736,0.00033239883,0.0002304509,0.21521312],"genre_scores_gemma":[0.9758676,0.0010244158,0.01705782,0.0004413048,0.00012803054,0.000031630843,0.000046221026,0.00004292091,0.0053599924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00028109233,0.000033538217,0.00012330229,0.00020083475,0.0001426916],"domain_scores_gemma":[0.9964855,0.0020812403,0.0005217917,0.00016867818,0.00030321244,0.00043945006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017932404,0.0002980201,0.0004671993,0.000929249,0.0010881138,0.0033892067,0.0010393704,0.00094869675,0.008261477],"category_scores_gemma":[0.004108544,0.00019766108,0.000975218,0.00086105854,0.004546865,0.0030685428,0.0019896566,0.0013551939,0.0003441059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003145825,0.00001988817,0.0030065419,0.00007756746,0.000028591372,0.00008777373,0.0015650681,0.0035343245,0.0012277603,0.97780126,0.0011412008,0.011478415],"study_design_scores_gemma":[0.000016788375,0.000064248736,0.01308566,0.00007659369,0.000029073539,0.00020815022,0.00091935304,0.017968828,0.00032740255,0.95095044,0.016308866,0.000044529184],"about_ca_topic_score_codex":0.006667832,"about_ca_topic_score_gemma":0.0061001517,"teacher_disagreement_score":0.008261477,"about_ca_system_score_codex":0.0025832425,"about_ca_system_score_gemma":0.0010011742,"threshold_uncertainty_score":0.027637362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044699114,0.00014517416,0.9322798,0.0005288288,0.00008411737,0.00019880723,0.00026936326,0.0001862909,0.021608403],"genre_scores_gemma":[0.7081821,0.00048983574,0.27032125,0.0006077622,0.00019112618,0.00074117375,0.0004247994,0.00019837944,0.018843535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976525,0.001028784,0.00009987414,0.00051778427,0.00039522653,0.00030589127],"domain_scores_gemma":[0.9974049,0.0013261085,0.00034173363,0.00048101274,0.00019086454,0.00025548734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026093943,0.0014425493,0.0015591535,0.00078001915,0.0011954277,0.0027703017,0.002787701,0.0012790004,0.0095565375],"category_scores_gemma":[0.007322314,0.000643554,0.0013020625,0.0014008658,0.0025989707,0.005154373,0.0047886427,0.0034311607,0.0012503744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014763148,0.000108597815,0.0003936137,0.00012317182,0.00006097255,0.00016092387,0.00022254346,0.08180564,0.0020294655,0.89166045,0.0026507415,0.020636141],"study_design_scores_gemma":[0.000027254144,0.000059786595,0.0001434247,0.000021034097,0.00001693564,0.000100131634,0.000046091813,0.30786455,0.00091223075,0.68804973,0.0027322315,0.000026618105],"about_ca_topic_score_codex":0.0014605868,"about_ca_topic_score_gemma":0.0016173759,"teacher_disagreement_score":0.0095565375,"about_ca_system_score_codex":0.0013104203,"about_ca_system_score_gemma":0.0014968272,"threshold_uncertainty_score":0.031969786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1503094,0.004142499,0.6943902,0.010119676,0.00032161226,0.00020811975,0.0003505755,0.00010069465,0.14005736],"genre_scores_gemma":[0.95108944,0.00162972,0.030291095,0.00037469977,0.00021526126,0.00024105313,0.0001266796,0.000043023603,0.01598889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968305,0.0018436527,0.00016892028,0.00040812825,0.00041072635,0.00033804605],"domain_scores_gemma":[0.99022406,0.007473002,0.00085413485,0.000616017,0.00045221645,0.0003804692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045137485,0.0008270891,0.0015542709,0.00077250437,0.0010425588,0.005582564,0.0018302813,0.0025717057,0.0065239915],"category_scores_gemma":[0.016752793,0.0006380338,0.00079110137,0.0015241106,0.004049814,0.0059442944,0.001806698,0.0028863542,0.00048705656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060461312,0.00005232251,0.0001920471,0.00006447192,0.000037475857,0.00003257232,0.0001021887,0.02274676,0.0002857768,0.97052157,0.0011056142,0.004798779],"study_design_scores_gemma":[0.00004257067,0.00001942655,0.00016306764,0.000012913528,0.000011580823,0.000023508479,0.000060015496,0.027579991,0.00007780624,0.97077024,0.0012308393,0.0000080742375],"about_ca_topic_score_codex":0.0024300457,"about_ca_topic_score_gemma":0.0019286675,"teacher_disagreement_score":0.0065239915,"about_ca_system_score_codex":0.0027201653,"about_ca_system_score_gemma":0.0025052642,"threshold_uncertainty_score":0.023871303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026855997,0.0002659806,0.989189,0.0005638779,0.000058349397,0.000057806494,0.0001434134,0.00007360483,0.0069622924],"genre_scores_gemma":[0.34661317,0.0016906577,0.6380647,0.00059167785,0.00026482815,0.0009805298,0.0006808732,0.00016625879,0.010947332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955336,0.002693931,0.00020185456,0.00058856496,0.00075742725,0.00022460315],"domain_scores_gemma":[0.9960634,0.0027925733,0.00030426471,0.00032049714,0.00036939883,0.0001499013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00390438,0.0017062245,0.0013614414,0.0018627455,0.001164468,0.0034434898,0.0030810782,0.0023316802,0.007102465],"category_scores_gemma":[0.009219543,0.00061773293,0.002110518,0.0034733599,0.0029015557,0.0067362166,0.002175054,0.0033389663,0.0014506986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003068652,0.000018327777,0.00013192931,0.00007678705,0.000033800272,0.00009307516,0.00017438333,0.122660525,0.00025473896,0.86179614,0.0014499302,0.013279804],"study_design_scores_gemma":[0.00001967839,0.00001954634,0.000041090607,0.000020587699,0.000015392308,0.000051812534,0.000040719275,0.24228172,0.0001234169,0.7527818,0.0045822863,0.00002199881],"about_ca_topic_score_codex":0.0044705505,"about_ca_topic_score_gemma":0.0041651702,"teacher_disagreement_score":0.007102465,"about_ca_system_score_codex":0.0029406394,"about_ca_system_score_gemma":0.002097088,"threshold_uncertainty_score":0.02376008},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2402085,0.011925197,0.45014673,0.007974221,0.00050781027,0.00045599893,0.0019486547,0.00053646707,0.28629637],"genre_scores_gemma":[0.97489786,0.0025775912,0.013645572,0.00064574636,0.00016329017,0.0001569921,0.00033079446,0.000025457688,0.00755675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983192,0.0006304506,0.00006471798,0.000431375,0.00037814103,0.00017613254],"domain_scores_gemma":[0.99691343,0.0014680007,0.00060100696,0.00051595253,0.00027826068,0.00022335089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012568628,0.00036848424,0.0006536336,0.0016316599,0.0009940336,0.0022590368,0.0009474344,0.0014310279,0.009166854],"category_scores_gemma":[0.0069481595,0.00023844233,0.00065744406,0.0014545969,0.002507428,0.002837377,0.001729118,0.0010374197,0.0011056872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003702883,0.000059618134,0.01089155,0.00040490873,0.00018148228,0.00024405977,0.00089885155,0.008187572,0.0020734263,0.9033987,0.0067329057,0.06688986],"study_design_scores_gemma":[0.000020055197,0.00014408806,0.01938462,0.00028572703,0.00014485189,0.001228885,0.000982067,0.028520698,0.0015522543,0.8878381,0.059843916,0.00005475124],"about_ca_topic_score_codex":0.0009531942,"about_ca_topic_score_gemma":0.0010451927,"teacher_disagreement_score":0.009166854,"about_ca_system_score_codex":0.0011984451,"about_ca_system_score_gemma":0.0006997662,"threshold_uncertainty_score":0.030666232},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28678635,0.0035114994,0.061475523,0.027012324,0.00028485642,0.00012261685,0.00026444,0.00007303542,0.62046945],"genre_scores_gemma":[0.9726624,0.0023999808,0.011643557,0.00070449803,0.000058531263,0.00005406875,0.00008782696,0.000015567004,0.012373541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897516,0.000747373,0.00002008683,0.000037107096,0.00011040743,0.00010986126],"domain_scores_gemma":[0.9994855,0.00027080643,0.00009427626,0.000015206539,0.000057205983,0.00007700668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009835473,0.00041269284,0.00026360198,0.0015873762,0.0018833489,0.0035260846,0.0006992552,0.0011650422,0.008908301],"category_scores_gemma":[0.0018237941,0.00019826888,0.00027999547,0.0019483875,0.0030206565,0.00347697,0.0024547928,0.00128177,0.00036774884],"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.000024812078,0.000027566466,0.0008098029,0.00006486407,0.000007028808,0.00038601825,0.0027042595,0.013596871,0.00013754528,0.9705212,0.0027570676,0.008962923],"study_design_scores_gemma":[0.000030895004,0.000040425624,0.0009357088,0.0000870718,0.000010316219,0.00020108394,0.016702302,0.03220674,0.00015224061,0.8766489,0.07296293,0.000021297607],"about_ca_topic_score_codex":0.006452121,"about_ca_topic_score_gemma":0.0130304145,"teacher_disagreement_score":0.008908301,"about_ca_system_score_codex":0.0024243467,"about_ca_system_score_gemma":0.0024325415,"threshold_uncertainty_score":0.02980125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03310476,0.00058272947,0.9558094,0.0008001587,0.00009701649,0.000104660525,0.00006801426,0.00013624658,0.009296976],"genre_scores_gemma":[0.93486583,0.00070419494,0.05609257,0.00023652498,0.0001299296,0.00044387867,0.00008906303,0.00003850221,0.007399446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985574,0.00077403564,0.00006298903,0.00022044263,0.0002229669,0.0001622572],"domain_scores_gemma":[0.9931497,0.0055940505,0.00048458728,0.00014045968,0.00041135037,0.00021998248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021536385,0.0011668146,0.0015514452,0.0005105727,0.00046694177,0.0014443424,0.001200296,0.0014391992,0.0026244423],"category_scores_gemma":[0.008222006,0.00043028712,0.0007163682,0.00045177634,0.0022727468,0.0011483671,0.0011440628,0.0019920224,0.00030036454],"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.00005101395,0.00004929202,0.0005678974,0.000093233626,0.000041608153,0.000083729174,0.00009719007,0.85465807,0.00037830338,0.13466603,0.0006921577,0.008621451],"study_design_scores_gemma":[0.000016746446,0.000020420004,0.00005402536,0.000006469057,0.0000039642123,0.00000612339,0.000009612924,0.9626344,0.000056123237,0.0368609,0.00032708808,0.000004236471],"about_ca_topic_score_codex":0.004815133,"about_ca_topic_score_gemma":0.002822711,"teacher_disagreement_score":0.004815133,"about_ca_system_score_codex":0.0020002124,"about_ca_system_score_gemma":0.001679311,"threshold_uncertainty_score":0.0145125985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34900644,0.00037439566,0.5830076,0.0029057837,0.00008376042,0.0001863513,0.00022860934,0.00014065663,0.06406647],"genre_scores_gemma":[0.95830226,0.00022675405,0.024704337,0.00013177244,0.000031275427,0.00014227034,0.000054956396,0.0000252345,0.016381083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978695,0.0012363322,0.000061117666,0.00020736185,0.0002933155,0.00033233647],"domain_scores_gemma":[0.9967759,0.0023773015,0.00031112504,0.000077044395,0.00019158793,0.0002670921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029947218,0.0007471535,0.0014810953,0.00071137334,0.0010502418,0.004291738,0.0016728155,0.0023728635,0.00594556],"category_scores_gemma":[0.009209919,0.0005372436,0.0005935455,0.0008018249,0.0027392036,0.0044025304,0.0024077662,0.0017625901,0.00046591426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028655134,0.00012549783,0.0007781643,0.00009296068,0.00004963883,0.0001845295,0.00032569558,0.110813834,0.0009188305,0.8785158,0.0011495551,0.0067589884],"study_design_scores_gemma":[0.000111183865,0.00007295476,0.00028367378,0.000021121446,0.000025560608,0.000067763016,0.00021954978,0.3965234,0.0004842077,0.6009039,0.0012547624,0.000031953776],"about_ca_topic_score_codex":0.0033924745,"about_ca_topic_score_gemma":0.0022604621,"teacher_disagreement_score":0.00594556,"about_ca_system_score_codex":0.0021380526,"about_ca_system_score_gemma":0.0022128494,"threshold_uncertainty_score":0.019889891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27193683,0.00029164142,0.68212557,0.0009001896,0.00008483474,0.0001480569,0.00014734654,0.00019997853,0.044165567],"genre_scores_gemma":[0.9736738,0.00015007568,0.024536045,0.000062783125,0.000016755226,0.00008108771,0.00006142816,0.000020392263,0.0013975885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734664,0.0013013514,0.000121354766,0.00028513002,0.00058720924,0.00035819484],"domain_scores_gemma":[0.9878414,0.0090193115,0.0012086593,0.0005840518,0.00084199326,0.00050456234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002622471,0.00056460936,0.0006459074,0.0005380733,0.0009625449,0.0021431115,0.0015235904,0.0011466726,0.0042012483],"category_scores_gemma":[0.017046379,0.00030617244,0.0006236126,0.0008816272,0.0018072064,0.0034907248,0.0018671117,0.0014053696,0.000509781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001667663,0.000111897774,0.00199709,0.00018270232,0.000054579672,0.00086514995,0.00094489544,0.07740367,0.004953609,0.892178,0.0011972025,0.0199445],"study_design_scores_gemma":[0.00005851103,0.00015683919,0.0007248088,0.000041503114,0.000044338878,0.00035985754,0.00049100176,0.25433105,0.0017665445,0.7384915,0.0034987142,0.000035394092],"about_ca_topic_score_codex":0.0010701178,"about_ca_topic_score_gemma":0.001423216,"teacher_disagreement_score":0.0042012483,"about_ca_system_score_codex":0.0006630569,"about_ca_system_score_gemma":0.0011416352,"threshold_uncertainty_score":0.014054596},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01587338,0.005789984,0.9128296,0.0033612486,0.0006960977,0.00025380397,0.00065381196,0.00036995267,0.060172185],"genre_scores_gemma":[0.38124242,0.010378652,0.5477578,0.004487498,0.00137251,0.0006592261,0.0028197414,0.00046596982,0.050816204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964948,0.0010837255,0.00014992447,0.0009702745,0.0010294842,0.0002718302],"domain_scores_gemma":[0.988,0.007863526,0.00043410592,0.0019801923,0.0013350901,0.00038706884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003640967,0.0013864343,0.0021174105,0.0018050685,0.0017949269,0.0029161784,0.002290832,0.0018024225,0.017767046],"category_scores_gemma":[0.021618398,0.0007011994,0.0016489233,0.0026743829,0.0022514863,0.0054844585,0.004094166,0.003241967,0.006228868],"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.00036749558,0.00024159814,0.0026574214,0.00077765173,0.00015384353,0.0001421064,0.00029247403,0.035743676,0.0013341038,0.7499138,0.025464034,0.1829117],"study_design_scores_gemma":[0.000048429265,0.00013079318,0.0008174653,0.00012543901,0.00008600636,0.0003356487,0.00014269355,0.13772766,0.0017708112,0.79797655,0.06078614,0.0000523868],"about_ca_topic_score_codex":0.0023571835,"about_ca_topic_score_gemma":0.0032852134,"teacher_disagreement_score":0.9822329,"about_ca_system_score_codex":0.0020071943,"about_ca_system_score_gemma":0.0019361684,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049831937,0.000092562,0.9928334,0.000118672324,0.000011859013,0.0000583069,0.000050604704,0.00008430728,0.00176702],"genre_scores_gemma":[0.29650727,0.0004234597,0.69805825,0.00018977757,0.0000649708,0.0005979671,0.00029897873,0.00015414525,0.0037051956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826485,0.0005750273,0.00008666145,0.00041539734,0.00044694595,0.00021119481],"domain_scores_gemma":[0.9973029,0.0015380181,0.00032207018,0.0004318778,0.000255403,0.0001498027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030369023,0.0015939523,0.0022347886,0.0017655813,0.00094634143,0.0031526573,0.003038205,0.0018225436,0.008919426],"category_scores_gemma":[0.012146769,0.0008599869,0.0022421768,0.0030770018,0.0031018134,0.004606888,0.0031986316,0.0032437614,0.00073833775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047853977,0.00007283797,0.00023627492,0.000096375894,0.000034487064,0.000056553952,0.000103563616,0.3474433,0.00097378634,0.63495344,0.0010448985,0.014936638],"study_design_scores_gemma":[0.00003312174,0.000042952008,0.00007127227,0.000026378362,0.000013959617,0.000028614359,0.000029310786,0.62169534,0.0005561767,0.37612963,0.0013578988,0.000015374188],"about_ca_topic_score_codex":0.0039283144,"about_ca_topic_score_gemma":0.0034223935,"teacher_disagreement_score":0.008919426,"about_ca_system_score_codex":0.002532867,"about_ca_system_score_gemma":0.0017143536,"threshold_uncertainty_score":0.029838443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097882666,0.0002203828,0.8958427,0.00036130336,0.000056570276,0.00037736687,0.00020005397,0.00066509424,0.004393987],"genre_scores_gemma":[0.50094265,0.00016028632,0.49578923,0.00012324496,0.000030394713,0.00021583872,0.00035889406,0.000047344234,0.0023321288],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651563,0.0010250359,0.0002128825,0.00079129473,0.0011551735,0.00029999635],"domain_scores_gemma":[0.9888797,0.006084828,0.0015552548,0.0017704188,0.0012697718,0.0004400705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002666872,0.00087739265,0.0011895705,0.0029878106,0.001607068,0.0016701635,0.0024011824,0.0019861818,0.0013883718],"category_scores_gemma":[0.016915897,0.0005321157,0.0009602358,0.0013282679,0.0012693421,0.0027878787,0.003737994,0.0014794307,0.0005782066],"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.00074324437,0.0007347388,0.05853577,0.00080896297,0.0004986781,0.0015207801,0.0028085164,0.16320536,0.055222902,0.11261016,0.0066018486,0.5967091],"study_design_scores_gemma":[0.00006927012,0.0003955407,0.007439467,0.00009509567,0.00014229176,0.001680975,0.0013430574,0.8555385,0.038292743,0.08497523,0.009925559,0.00010224933],"about_ca_topic_score_codex":0.0018921384,"about_ca_topic_score_gemma":0.0021225854,"teacher_disagreement_score":0.0029878106,"about_ca_system_score_codex":0.0005730543,"about_ca_system_score_gemma":0.001369814,"threshold_uncertainty_score":0.014103949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5132083,0.0010501911,0.4046863,0.0042995093,0.0002933093,0.00054305734,0.001007528,0.0004745891,0.07443723],"genre_scores_gemma":[0.97216266,0.00031278317,0.016615428,0.0003330841,0.00009652338,0.0002243059,0.00018664477,0.000044092783,0.010024438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973308,0.0014200762,0.00009170857,0.00033609453,0.00036270957,0.0004586675],"domain_scores_gemma":[0.9877193,0.008343296,0.0012731565,0.0010032203,0.0005336932,0.0011272981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024896706,0.0006405386,0.0011999953,0.0009316648,0.0011655266,0.0023154027,0.0022804283,0.0017297223,0.007839983],"category_scores_gemma":[0.0125844395,0.0005347864,0.0007230613,0.0007376735,0.0017039533,0.0051408084,0.0021955455,0.002194805,0.0006401016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039720032,0.00022527591,0.00097170484,0.00015543541,0.000081786,0.00022242682,0.0002043047,0.04614741,0.002011197,0.9286503,0.0069948076,0.013938204],"study_design_scores_gemma":[0.00010990749,0.00007689092,0.0004182128,0.000035429257,0.000039567414,0.00015761174,0.00012592474,0.23634143,0.0008369239,0.75906694,0.002762413,0.000028699504],"about_ca_topic_score_codex":0.0013298976,"about_ca_topic_score_gemma":0.0022012868,"teacher_disagreement_score":0.007839983,"about_ca_system_score_codex":0.0018011437,"about_ca_system_score_gemma":0.001552719,"threshold_uncertainty_score":0.026227355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023112597,0.00055307697,0.93152755,0.0021789733,0.00029212254,0.00017412387,0.00031999598,0.00038979287,0.041451637],"genre_scores_gemma":[0.7208148,0.0016280503,0.20889357,0.00078175595,0.00060327695,0.0003887964,0.0003909723,0.00017007577,0.066328645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981566,0.00049462327,0.00009633531,0.0003419964,0.00058437255,0.00032601252],"domain_scores_gemma":[0.9980008,0.0007225439,0.00022703981,0.00037685168,0.00038533614,0.00028747309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019636753,0.0010914723,0.00083950587,0.0009099594,0.0011993742,0.003881107,0.0041167894,0.0026624645,0.009988265],"category_scores_gemma":[0.0041840435,0.000662211,0.0012521597,0.0013977755,0.0020068095,0.007976165,0.0015766593,0.003165303,0.001644563],"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.000043242624,0.000045002365,0.000119172386,0.000054573888,0.00001568754,0.00012498358,0.00009942052,0.09666921,0.0011969313,0.8929313,0.001999512,0.0067009507],"study_design_scores_gemma":[0.000046422563,0.00006800587,0.000057067253,0.000013434999,0.000016762548,0.00011088263,0.000038552924,0.46939498,0.0003396155,0.52116764,0.008726408,0.000020195248],"about_ca_topic_score_codex":0.0037962785,"about_ca_topic_score_gemma":0.0037431386,"teacher_disagreement_score":0.009988265,"about_ca_system_score_codex":0.0034539797,"about_ca_system_score_gemma":0.0018862168,"threshold_uncertainty_score":0.033414125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090550795,0.00013433232,0.8992607,0.00066029944,0.00003496303,0.00007781375,0.0000828673,0.0001091458,0.009089033],"genre_scores_gemma":[0.9755356,0.00007164051,0.021172717,0.00008500878,0.000031179567,0.000112203146,0.00002944734,0.000016335265,0.0029459181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977622,0.0007413228,0.000099165096,0.00052023475,0.0006394784,0.00023763438],"domain_scores_gemma":[0.99375796,0.0032857072,0.0012973584,0.00051803305,0.00082406355,0.00031700052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004346132,0.00074746215,0.0015617937,0.00078933436,0.0006463157,0.0016511981,0.0016579948,0.0017732987,0.0020488678],"category_scores_gemma":[0.014806295,0.00040902023,0.00078402803,0.0005638661,0.0027272732,0.0021026125,0.0024434417,0.0014326266,0.00017763145],"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.00010940276,0.000075849326,0.0009467505,0.000086781736,0.000086488595,0.00029819604,0.00023232747,0.6342347,0.0010957761,0.35153514,0.00046491093,0.010833601],"study_design_scores_gemma":[0.000018306544,0.000030377745,0.0001246702,0.000005325136,0.000007103747,0.00002959703,0.000020689979,0.9433614,0.00023006849,0.05597435,0.000188357,0.000009877873],"about_ca_topic_score_codex":0.0051332857,"about_ca_topic_score_gemma":0.0016894105,"teacher_disagreement_score":0.0051332857,"about_ca_system_score_codex":0.0012553595,"about_ca_system_score_gemma":0.0012864763,"threshold_uncertainty_score":0.022984803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082977526,0.0015114371,0.86052895,0.0040065236,0.0002084263,0.00030641444,0.00025941172,0.000445702,0.04975558],"genre_scores_gemma":[0.932991,0.0010678105,0.053158216,0.00039837364,0.0003405701,0.0006881871,0.00012221749,0.00009383698,0.011139774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934524,0.0036427416,0.00030004978,0.0007306096,0.0010529993,0.0008212122],"domain_scores_gemma":[0.9674384,0.025706055,0.0021194136,0.0022947828,0.0012176224,0.00122381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060951468,0.0013564146,0.0021335618,0.0022557976,0.0020569214,0.007630932,0.0035591826,0.0043901517,0.010310583],"category_scores_gemma":[0.031042209,0.00091349724,0.0016987734,0.0021031378,0.005987679,0.009065051,0.0037217848,0.0034672732,0.0010338579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003847191,0.000045748173,0.00020618795,0.00008245822,0.000037599064,0.000040438976,0.00014653607,0.009629308,0.00033170287,0.9815701,0.0014101842,0.0064611537],"study_design_scores_gemma":[0.000048725822,0.000015178208,0.00006170851,0.000012607403,0.000015929882,0.000028530529,0.00003057465,0.026709307,0.00012758953,0.9716607,0.001279393,0.000009783968],"about_ca_topic_score_codex":0.0015663838,"about_ca_topic_score_gemma":0.0015840817,"teacher_disagreement_score":0.010310583,"about_ca_system_score_codex":0.0030989028,"about_ca_system_score_gemma":0.002325419,"threshold_uncertainty_score":0.034492373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20762293,0.0060364814,0.41112676,0.020626811,0.00045456135,0.0004453157,0.00042472695,0.00023290556,0.3530296],"genre_scores_gemma":[0.97780085,0.0015507813,0.011219135,0.0005268562,0.00024576398,0.00012509649,0.000056540805,0.000028629287,0.008446368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330807,0.0032236164,0.00034078388,0.000896041,0.0015156597,0.00071574596],"domain_scores_gemma":[0.95406044,0.033176374,0.0055733095,0.0038567467,0.0025947096,0.0007384104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077221324,0.00094068254,0.0009683721,0.0021591883,0.0015259455,0.0056323744,0.0013091044,0.0030819657,0.016407132],"category_scores_gemma":[0.053094048,0.0006497759,0.00072893244,0.0018060928,0.004839488,0.009214301,0.00375309,0.0030053372,0.001331509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118956326,0.00006216983,0.0020583698,0.000272145,0.00007646691,0.00040200428,0.0008600593,0.011879355,0.0012185347,0.95115364,0.001531188,0.030367253],"study_design_scores_gemma":[0.0000851749,0.00015125476,0.0017727079,0.00021116543,0.00008781698,0.0005856233,0.00053554453,0.024539357,0.0012089292,0.96048456,0.010285404,0.000052379888],"about_ca_topic_score_codex":0.0015885639,"about_ca_topic_score_gemma":0.0008782667,"teacher_disagreement_score":0.016407132,"about_ca_system_score_codex":0.0025668594,"about_ca_system_score_gemma":0.0019714274,"threshold_uncertainty_score":0.054887354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025588382,0.00008401733,0.97141135,0.0001706002,0.000018685669,0.000133394,0.00006535038,0.00064837,0.0018798102],"genre_scores_gemma":[0.39515036,0.00013409261,0.6024187,0.0001903076,0.000028917013,0.00042501875,0.00027066743,0.00016609915,0.0012158924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972025,0.001125523,0.00019017326,0.00052756886,0.00059620285,0.00035810223],"domain_scores_gemma":[0.99149865,0.005868759,0.0006501143,0.00093361124,0.00075504364,0.0002939285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034538864,0.002038043,0.0017436442,0.0018140855,0.0010338195,0.00265503,0.0022302244,0.0017866198,0.003963053],"category_scores_gemma":[0.018111302,0.0010214619,0.0014061413,0.0019507414,0.0018467966,0.004459793,0.0023732316,0.0023949507,0.0007960295],"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.00015755794,0.00022030053,0.0021154527,0.00014261813,0.00013892271,0.00012110262,0.00015266583,0.84381527,0.0015668847,0.088224225,0.0010977279,0.062247302],"study_design_scores_gemma":[0.00003099084,0.000033353277,0.000081414386,0.000012027305,0.00001216865,0.000017915077,0.00002029599,0.94850075,0.0011520245,0.049859427,0.00026812626,0.000011533424],"about_ca_topic_score_codex":0.004549371,"about_ca_topic_score_gemma":0.0069729057,"teacher_disagreement_score":0.004549371,"about_ca_system_score_codex":0.0021336826,"about_ca_system_score_gemma":0.0052014715,"threshold_uncertainty_score":0.018266082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01760445,0.12115154,0.2599256,0.22418898,0.0026042452,0.00010441522,0.00044764395,0.00041508107,0.37355807],"genre_scores_gemma":[0.76368046,0.0766546,0.0826263,0.018329892,0.0060920985,0.0006187536,0.0003794729,0.0005073765,0.051111106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944417,0.0036660347,0.00013533473,0.00043691584,0.0010696739,0.00025026998],"domain_scores_gemma":[0.9857115,0.011322893,0.00033388095,0.0014867418,0.00076185743,0.00038314567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009882761,0.0011682014,0.0017907148,0.0019679319,0.002402868,0.008706033,0.0041168286,0.005264979,0.0058264416],"category_scores_gemma":[0.016600415,0.0008612494,0.0011634893,0.002499909,0.022738442,0.023453329,0.0047580595,0.010727397,0.001804097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030414235,0.0000057697807,0.000018489589,0.000023112118,0.0000024429205,0.000012064529,0.00013013101,0.0008253987,0.000010187751,0.9956221,0.0016261716,0.0017209229],"study_design_scores_gemma":[0.0000027209815,0.0000017567959,0.000009757087,0.00004541669,0.0000012753311,0.000009172502,0.000048386493,0.0017133469,0.000010037141,0.989842,0.008312926,0.0000032147457],"about_ca_topic_score_codex":0.003073904,"about_ca_topic_score_gemma":0.0020213644,"teacher_disagreement_score":0.009882761,"about_ca_system_score_codex":0.004145039,"about_ca_system_score_gemma":0.0023781417,"threshold_uncertainty_score":0.052265644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08452025,0.0012551908,0.45152003,0.0038413652,0.0003209873,0.00014712656,0.00026868776,0.00036576256,0.45776066],"genre_scores_gemma":[0.85810244,0.0010047758,0.074508235,0.00049105415,0.00019893679,0.00026771863,0.00009891496,0.00018768737,0.0651402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976063,0.0013130917,0.00010083572,0.00019662667,0.0005621452,0.00022092747],"domain_scores_gemma":[0.99877924,0.00064981595,0.00009959294,0.00014784792,0.00015802866,0.00016555135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021296376,0.00094679784,0.0011954079,0.001083293,0.0022211804,0.005921106,0.0017788386,0.0036407453,0.014451648],"category_scores_gemma":[0.0049716574,0.0008468828,0.00097475824,0.0021262122,0.0047801584,0.0052820854,0.0031876764,0.003227702,0.0019592366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029999326,0.000020412335,0.000033455814,0.000027000822,0.0000069108028,0.000026904663,0.00005236388,0.008333926,0.00031343807,0.987815,0.00090152,0.0024391012],"study_design_scores_gemma":[0.000014278553,0.000008729611,0.0000284303,0.000012365698,0.0000026519053,0.000017231094,0.000021460562,0.015796036,0.00008989347,0.983013,0.0009877943,0.000008172105],"about_ca_topic_score_codex":0.0009960975,"about_ca_topic_score_gemma":0.0013270424,"teacher_disagreement_score":0.014451648,"about_ca_system_score_codex":0.002156486,"about_ca_system_score_gemma":0.0016245123,"threshold_uncertainty_score":0.048345566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0946718,0.0002541717,0.8947217,0.0006797195,0.000033840435,0.00013644226,0.00009051931,0.00013591474,0.009275876],"genre_scores_gemma":[0.9151532,0.00037897832,0.075163074,0.00008626749,0.00005774578,0.0003581261,0.0001777266,0.00005359372,0.008571288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532264,0.0030372448,0.00021255527,0.00060601684,0.00053055293,0.00029101223],"domain_scores_gemma":[0.9760143,0.019544762,0.002003525,0.0008371024,0.0010177898,0.00058241544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046711005,0.0011956926,0.0018921673,0.0013109746,0.000828548,0.0032643324,0.0022755512,0.0024973073,0.0047794324],"category_scores_gemma":[0.03807765,0.00085199455,0.001246689,0.0009893022,0.0022953015,0.0060088625,0.002333398,0.0025811056,0.00052099477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011353684,0.00014108774,0.0021059243,0.00014040574,0.000096677504,0.00018213624,0.00075366296,0.09565521,0.00070833747,0.87924117,0.0007953104,0.020066548],"study_design_scores_gemma":[0.000022387803,0.000043790234,0.0004487035,0.000027857766,0.00001640032,0.000050619987,0.00013797508,0.3157525,0.00024398042,0.68266356,0.00057362014,0.00001867758],"about_ca_topic_score_codex":0.0026054718,"about_ca_topic_score_gemma":0.0016080246,"teacher_disagreement_score":0.0047794324,"about_ca_system_score_codex":0.0016855123,"about_ca_system_score_gemma":0.002118616,"threshold_uncertainty_score":0.024703443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074544027,0.07145908,0.24906409,0.014742605,0.0049015544,0.00020146839,0.0007593924,0.0002765028,0.65114087],"genre_scores_gemma":[0.31479636,0.117668346,0.064778075,0.0042619472,0.0074010566,0.0008263624,0.0022745337,0.00059449737,0.48739886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984724,0.0006073965,0.000069408474,0.00021094803,0.0004773704,0.00016246465],"domain_scores_gemma":[0.99927086,0.0004014051,0.00004780203,0.000077304445,0.00014869763,0.00005399531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011675417,0.0023132632,0.001194874,0.0013131959,0.0010500016,0.0053101596,0.0015225832,0.002603636,0.041249033],"category_scores_gemma":[0.0024766512,0.000766947,0.00094392267,0.0024891733,0.0038407757,0.007270015,0.0019808174,0.0036224322,0.004534988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105336385,0.00003056704,0.000061251354,0.00019166704,0.0000084468165,0.000030739164,0.00017319672,0.0030568037,0.00016617832,0.9454364,0.02527052,0.025563616],"study_design_scores_gemma":[0.000009035889,0.000012602299,0.00018431552,0.00022995252,0.000009876962,0.00006755996,0.00014339223,0.004241194,0.00012007326,0.8711284,0.12383721,0.000016441873],"about_ca_topic_score_codex":0.004374737,"about_ca_topic_score_gemma":0.0047991076,"teacher_disagreement_score":0.041249033,"about_ca_system_score_codex":0.004375528,"about_ca_system_score_gemma":0.001947745,"threshold_uncertainty_score":0.13799179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13198206,0.00024177277,0.84578073,0.0015236215,0.000046484558,0.00014894379,0.000058883612,0.00009840312,0.020119134],"genre_scores_gemma":[0.86758363,0.0003999262,0.12257384,0.00025575366,0.00008582055,0.0002595318,0.00008199175,0.000060405688,0.008699074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984774,0.0008441867,0.00006405434,0.00025735487,0.00020666685,0.00015044399],"domain_scores_gemma":[0.9879497,0.00959836,0.0007088644,0.00056759146,0.0007427149,0.00043279477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003576195,0.00069438724,0.0014742456,0.0014797413,0.0014047961,0.0028511118,0.0029947404,0.003028569,0.007427363],"category_scores_gemma":[0.023162786,0.0008257323,0.001609771,0.0011354663,0.0028410626,0.005084618,0.00329088,0.002298162,0.00047319735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006431028,0.0001451465,0.0024419306,0.000102347374,0.00017755844,0.0001995892,0.00036336892,0.24996927,0.0007599753,0.7265162,0.0010182816,0.01824197],"study_design_scores_gemma":[0.000039543153,0.00004215043,0.0003035057,0.00002052188,0.000036242986,0.000054288732,0.00009399442,0.69181025,0.00013204907,0.306945,0.0005049779,0.00001748031],"about_ca_topic_score_codex":0.0015744847,"about_ca_topic_score_gemma":0.0019652084,"teacher_disagreement_score":0.007427363,"about_ca_system_score_codex":0.0015067455,"about_ca_system_score_gemma":0.001487038,"threshold_uncertainty_score":0.02484703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12589173,0.00030844723,0.8401784,0.0018260877,0.000072153154,0.0001742584,0.00019758647,0.00012521376,0.031226138],"genre_scores_gemma":[0.9367721,0.00041300754,0.050951038,0.00036772047,0.00008908401,0.00034680153,0.00009398134,0.00003707728,0.010929087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995752,0.0020789143,0.00019560869,0.0006744923,0.0007612522,0.00053771853],"domain_scores_gemma":[0.9947395,0.0035783406,0.0007419887,0.00023392153,0.00046041614,0.00024586244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041366406,0.0013636104,0.0012618353,0.0008804397,0.0012026924,0.0028960526,0.0013350924,0.0024100188,0.0041943574],"category_scores_gemma":[0.013164899,0.0005807387,0.001009134,0.00071698905,0.003521077,0.005197345,0.0019292351,0.0018102059,0.0006093163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056726854,0.000029916793,0.00019589334,0.0000457656,0.000035090336,0.00010985666,0.00017039811,0.054159798,0.0007688392,0.93972033,0.00043649334,0.0042708954],"study_design_scores_gemma":[0.00003609835,0.000059854967,0.000104854764,0.000019657953,0.000016508899,0.000068653186,0.0001110065,0.23752092,0.0008479809,0.7602109,0.0009740873,0.00002953866],"about_ca_topic_score_codex":0.0020192235,"about_ca_topic_score_gemma":0.0013021071,"teacher_disagreement_score":0.0041943574,"about_ca_system_score_codex":0.002238363,"about_ca_system_score_gemma":0.0019260993,"threshold_uncertainty_score":0.021876872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04152572,0.00046716523,0.9420872,0.0012169923,0.00010223615,0.0002908709,0.0011078225,0.00033038383,0.012871653],"genre_scores_gemma":[0.7140869,0.00139573,0.25674704,0.00037903112,0.00015637853,0.00070262013,0.001801399,0.00019204975,0.02453877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986052,0.0007326726,0.00005586259,0.00028351837,0.00015490463,0.00016795249],"domain_scores_gemma":[0.99661297,0.0024117604,0.00026572665,0.00016200088,0.00035228836,0.00019524437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023677747,0.0010419084,0.0017920688,0.0020357324,0.0013946347,0.002439436,0.004394176,0.0030411396,0.011485129],"category_scores_gemma":[0.0071142986,0.00079120917,0.0017237879,0.003708123,0.0014796413,0.004446332,0.0017730598,0.0019092271,0.0011136188],"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.00006163132,0.00007958756,0.00078702776,0.00013986033,0.0000614127,0.00024766225,0.00025035947,0.7883744,0.00040084435,0.19283442,0.003393816,0.013368916],"study_design_scores_gemma":[0.000016929864,0.0000135504015,0.00012944164,0.000007463728,0.000018252309,0.000024667459,0.000054234646,0.95098597,0.000028560635,0.0478461,0.0008628979,0.000011930553],"about_ca_topic_score_codex":0.043196507,"about_ca_topic_score_gemma":0.035972573,"teacher_disagreement_score":0.043196507,"about_ca_system_score_codex":0.0031299356,"about_ca_system_score_gemma":0.0035563258,"threshold_uncertainty_score":0.085890114},"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":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03153211,0.00071497547,0.895439,0.005999751,0.00095603877,0.00038463218,0.0010065131,0.0010507334,0.062916234],"genre_scores_gemma":[0.73639405,0.0010858134,0.209509,0.0016053643,0.0012169525,0.00073034526,0.00046900296,0.0005046091,0.04848493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98499805,0.007440556,0.0007468217,0.0029986412,0.0030110767,0.000804887],"domain_scores_gemma":[0.9540881,0.018264614,0.0063389074,0.01487599,0.004107126,0.0023252626],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.009658688,0.000676523,0.0012477736,0.0013850908,0.0022784544,0.0065894346,0.0028834683,0.0026921558,0.017044574],"category_scores_gemma":[0.05401431,0.00060270703,0.0010153686,0.0022455684,0.0069884346,0.008588988,0.002644236,0.003377662,0.00483364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104910054,0.000035696536,0.00071441976,0.000072287316,0.000021093821,0.000064073065,0.00013460893,0.008269536,0.0006708505,0.96028817,0.005869048,0.023755176],"study_design_scores_gemma":[0.00014716505,0.00015829618,0.0005913787,0.000041191015,0.000030292249,0.00023445292,0.000094549556,0.02854933,0.0010588635,0.93685937,0.032166325,0.000068806934],"about_ca_topic_score_codex":0.0013032766,"about_ca_topic_score_gemma":0.0020529814,"teacher_disagreement_score":0.9903413,"about_ca_system_score_codex":0.0031772736,"about_ca_system_score_gemma":0.004310658,"threshold_uncertainty_score":0.05701977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07944579,0.0069661182,0.8469431,0.013639718,0.00030710286,0.00024592632,0.0005287904,0.00021522817,0.051708266],"genre_scores_gemma":[0.923947,0.0036812453,0.0527752,0.0010218379,0.00064259575,0.00033403895,0.00021159077,0.00008156166,0.017304977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99402976,0.0035312513,0.00022338764,0.00083077885,0.00074135436,0.00064351194],"domain_scores_gemma":[0.9639955,0.030609075,0.0022491363,0.0010126627,0.0010746164,0.0010590088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009333294,0.0011308802,0.0027290052,0.0013241355,0.0012132186,0.005325195,0.0023840135,0.005181494,0.010029437],"category_scores_gemma":[0.05251897,0.0011361424,0.0011136825,0.0015080172,0.0049616825,0.014319555,0.0029000593,0.004701352,0.0009923881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010538932,0.00007918274,0.0008794852,0.00014024525,0.00009671345,0.00014489872,0.00012812145,0.05584506,0.00016823315,0.9230197,0.0033405889,0.016052352],"study_design_scores_gemma":[0.00004061925,0.000024131885,0.00019785209,0.000023637005,0.00001596778,0.000032814914,0.000029683744,0.08463051,0.00004275311,0.91400915,0.00093698996,0.000015926125],"about_ca_topic_score_codex":0.0049146945,"about_ca_topic_score_gemma":0.004130842,"teacher_disagreement_score":0.010029437,"about_ca_system_score_codex":0.0034066914,"about_ca_system_score_gemma":0.0024577489,"threshold_uncertainty_score":0.0493598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1010488,0.0010250842,0.8544712,0.0018692103,0.000094406765,0.00016301234,0.00028459125,0.00027461819,0.04076897],"genre_scores_gemma":[0.95428693,0.0009133638,0.028451132,0.00024112631,0.00006897088,0.00046694282,0.00018211917,0.00009065957,0.015298775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992847,0.00031175374,0.000021882475,0.00013777519,0.00014098811,0.00010283313],"domain_scores_gemma":[0.9973585,0.0014584204,0.00049795327,0.00013433561,0.00022026825,0.0003305187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010799108,0.000777042,0.0011449591,0.0008357542,0.0009825283,0.0017133525,0.0014514357,0.0013003468,0.00657275],"category_scores_gemma":[0.0065903277,0.00036099384,0.0007653065,0.0006072315,0.0024799507,0.0026149214,0.0019303536,0.00173012,0.0006140051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033814333,0.000034675486,0.00069603685,0.00009298946,0.000040356408,0.00017003731,0.0003411131,0.32658362,0.0012867255,0.66368735,0.0024004343,0.0046328665],"study_design_scores_gemma":[0.000027687624,0.000029953591,0.00020481535,0.000021702024,0.000009041092,0.000049879705,0.00011795063,0.70459974,0.00018061073,0.2924008,0.0023417803,0.000015997737],"about_ca_topic_score_codex":0.0051531047,"about_ca_topic_score_gemma":0.00330408,"teacher_disagreement_score":0.00657275,"about_ca_system_score_codex":0.0022665467,"about_ca_system_score_gemma":0.0010176712,"threshold_uncertainty_score":0.021988034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3743448,0.00042004665,0.5857045,0.0068686972,0.00014214094,0.0004037335,0.00040575242,0.0003023827,0.031408],"genre_scores_gemma":[0.8743722,0.0003286153,0.11682525,0.0001923667,0.000058314658,0.00016644935,0.00016789247,0.000044342552,0.007844637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832374,0.0008586481,0.00007050956,0.00037197926,0.00016367673,0.00021153828],"domain_scores_gemma":[0.9931055,0.004588682,0.0006952136,0.00031958712,0.000563336,0.0007278388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023240987,0.00081325154,0.0012084295,0.0018413714,0.001388286,0.0030722853,0.0019680434,0.0037835212,0.005566624],"category_scores_gemma":[0.014194835,0.0005496887,0.00055221963,0.00081595045,0.0014684993,0.005098737,0.0020657717,0.0015014004,0.00088467763],"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.0011640924,0.00072251965,0.019590622,0.0006216862,0.00040187396,0.000802105,0.0009989025,0.55935204,0.006131158,0.32198974,0.008119436,0.08010583],"study_design_scores_gemma":[0.00008257677,0.00016894584,0.00097564585,0.000084959895,0.000083716535,0.00016663762,0.000655926,0.8576512,0.0017044224,0.13593788,0.002457278,0.000030853742],"about_ca_topic_score_codex":0.0017979471,"about_ca_topic_score_gemma":0.0024615196,"teacher_disagreement_score":0.005566624,"about_ca_system_score_codex":0.0011535601,"about_ca_system_score_gemma":0.0021777144,"threshold_uncertainty_score":0.01862222},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18499951,0.00088271603,0.7443576,0.0033192972,0.00020464862,0.00013293215,0.00010856044,0.00018236696,0.06581245],"genre_scores_gemma":[0.9711754,0.00031511844,0.01926551,0.00015160785,0.0001046898,0.00012613353,0.000030926683,0.000026169006,0.008804473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587715,0.0025562618,0.00015477579,0.00034418394,0.00069657376,0.00037111083],"domain_scores_gemma":[0.99251986,0.0055874567,0.00058665226,0.00032973115,0.00046077132,0.00051559176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004040946,0.00083548785,0.0017761184,0.0007849434,0.0010021052,0.005926778,0.0021209589,0.0023771406,0.00779816],"category_scores_gemma":[0.020461624,0.0005514196,0.0007916051,0.0010895929,0.0040784827,0.007282628,0.0030562645,0.0026609139,0.00043827487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074139956,0.00010555063,0.0002627229,0.00007335443,0.000032753956,0.00011243299,0.000152086,0.06313283,0.00036744997,0.9274658,0.000700575,0.0075202384],"study_design_scores_gemma":[0.00003401143,0.000029553166,0.000082669096,0.000011626596,0.000009728959,0.000042652486,0.000050958355,0.17449337,0.00010475938,0.8245299,0.000596,0.000014717551],"about_ca_topic_score_codex":0.0014387149,"about_ca_topic_score_gemma":0.0011296705,"teacher_disagreement_score":0.00779816,"about_ca_system_score_codex":0.0022092306,"about_ca_system_score_gemma":0.0013740315,"threshold_uncertainty_score":0.026087463},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028517745,0.007651381,0.008259855,0.34491777,0.06489392,0.00030056437,0.0034246123,0.0005931287,0.541441],"genre_scores_gemma":[0.17715605,0.0010863049,0.0018014015,0.076496184,0.0043980563,0.00028796145,0.0012071453,0.0005140643,0.73705274],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909623,0.0031276166,0.00033179988,0.0009916092,0.002112014,0.002474703],"domain_scores_gemma":[0.9917134,0.0024411085,0.00047321964,0.00089550385,0.0022492327,0.0022274544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010231349,0.0004146318,0.0005406641,0.0008144439,0.008523698,0.006884325,0.0011120474,0.0063729393,0.05403796],"category_scores_gemma":[0.029294116,0.00035636793,0.0009954486,0.00095091923,0.004825314,0.0040991916,0.006903087,0.013449346,0.017953593],"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.00020720444,0.00007145247,0.0009795573,0.000120866935,0.000023740173,0.00048617113,0.0097254915,0.00009204915,0.00040466766,0.27051425,0.68656236,0.030812098],"study_design_scores_gemma":[0.000013961533,0.00002555567,0.0017466136,0.00009622155,0.0000042701536,0.0000815683,0.0019761324,0.000041524563,0.00028202467,0.0073343003,0.9883708,0.000027070997],"about_ca_topic_score_codex":0.022159576,"about_ca_topic_score_gemma":0.041820284,"teacher_disagreement_score":0.05403796,"about_ca_system_score_codex":0.0068484982,"about_ca_system_score_gemma":0.0057251602,"threshold_uncertainty_score":0.18077499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104266755,0.00029390762,0.8795378,0.0011808522,0.00008154355,0.00011319624,0.00020650093,0.000121262914,0.014198031],"genre_scores_gemma":[0.936411,0.0004048199,0.052037876,0.00015144971,0.00008694811,0.00025454967,0.00020904184,0.0000842738,0.010360058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977162,0.0013512756,0.00006965745,0.00037265394,0.0002811152,0.00020898899],"domain_scores_gemma":[0.99206513,0.0057820934,0.00080955075,0.00033337125,0.00063203886,0.0003778456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033656352,0.0010875666,0.0019949367,0.0015932446,0.0014716506,0.0028649538,0.0026100609,0.002239668,0.007955305],"category_scores_gemma":[0.013258539,0.0006640602,0.0012938424,0.0016859006,0.0028457227,0.0044778246,0.0017531911,0.002040135,0.00076609163],"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.00016627426,0.000064129075,0.0004981551,0.000105450425,0.00008804892,0.00018411642,0.00032944573,0.28417635,0.0008687498,0.70381266,0.0015051999,0.008201448],"study_design_scores_gemma":[0.0000312269,0.000025023604,0.00010829095,0.000009060624,0.000018887187,0.000022688953,0.00005121116,0.5921775,0.00013465877,0.40694755,0.00045796158,0.000015917609],"about_ca_topic_score_codex":0.006622356,"about_ca_topic_score_gemma":0.0044035255,"teacher_disagreement_score":0.007955305,"about_ca_system_score_codex":0.0024701534,"about_ca_system_score_gemma":0.00230828,"threshold_uncertainty_score":0.026613176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3750335,0.014004257,0.31255454,0.12535888,0.0010360596,0.00027537724,0.000724248,0.00037199463,0.17064117],"genre_scores_gemma":[0.97497934,0.0037776297,0.012329782,0.0028054346,0.00042487937,0.0001118301,0.00008340218,0.000048992595,0.005438614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911692,0.005588941,0.00030740336,0.00085018063,0.0010892305,0.0009949692],"domain_scores_gemma":[0.9405121,0.045432966,0.0066380342,0.004135458,0.001741017,0.001540496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012256154,0.00054554513,0.0009817333,0.0014966327,0.0027011954,0.006821051,0.0029268586,0.0065853624,0.0055711134],"category_scores_gemma":[0.043266427,0.00068596355,0.0012011536,0.0017255233,0.0064139534,0.011583989,0.0047651893,0.0041301143,0.00078124023],"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.00020766552,0.00013118275,0.0048391507,0.0003659156,0.00016158207,0.0005559262,0.0010548148,0.039860185,0.0007417154,0.8867607,0.008910318,0.056410823],"study_design_scores_gemma":[0.00009411456,0.00012256569,0.0030479787,0.00037235298,0.00007811164,0.00030175276,0.0012939697,0.10889734,0.0008645473,0.8578183,0.027028982,0.00007985563],"about_ca_topic_score_codex":0.0061564744,"about_ca_topic_score_gemma":0.005552476,"teacher_disagreement_score":0.012256154,"about_ca_system_score_codex":0.0035553935,"about_ca_system_score_gemma":0.0020537875,"threshold_uncertainty_score":0.06481755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034221034,0.0004408816,0.93908745,0.0019365603,0.0001758607,0.000056402303,0.000048694586,0.00007976827,0.02395335],"genre_scores_gemma":[0.9007265,0.00046017696,0.091640174,0.00034337485,0.00020245422,0.00012700411,0.00006136845,0.000042069856,0.006396939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983076,0.00087912445,0.000083015075,0.00023604135,0.00036124882,0.00013292035],"domain_scores_gemma":[0.99747,0.0014423104,0.00033182502,0.00031216105,0.0002852662,0.00015844194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019442304,0.0003855915,0.0007756925,0.0003098734,0.0005908301,0.0010868593,0.0007547174,0.0008090783,0.0034258917],"category_scores_gemma":[0.00567578,0.00018786316,0.0010118362,0.00031486753,0.0023002885,0.0027979452,0.0014684938,0.001758124,0.00028922208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003871437,0.000024830275,0.00053899875,0.000055223663,0.000025018102,0.00010021175,0.00011218239,0.045240182,0.0009787639,0.9409339,0.0006729685,0.011279102],"study_design_scores_gemma":[0.000028964321,0.00007345441,0.00017753277,0.000018603045,0.000012291151,0.000060546772,0.000032859833,0.2811206,0.0005897775,0.714905,0.002966962,0.000013463599],"about_ca_topic_score_codex":0.0013021928,"about_ca_topic_score_gemma":0.00068224047,"teacher_disagreement_score":0.0034258917,"about_ca_system_score_codex":0.0014702107,"about_ca_system_score_gemma":0.0015899643,"threshold_uncertainty_score":0.011460781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090132006,0.00041784995,0.8831576,0.0023929689,0.00007396219,0.00023596817,0.0001688094,0.00014175972,0.023279147],"genre_scores_gemma":[0.931612,0.00051770994,0.06254261,0.0003595112,0.00011926297,0.00032506554,0.00007978946,0.000047971913,0.004396093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886199,0.006976609,0.00045450532,0.0013449998,0.0012048713,0.0013989661],"domain_scores_gemma":[0.95035726,0.03750133,0.0060090455,0.0041183326,0.0011905492,0.00082338095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0115556605,0.00160357,0.0021677094,0.0008617066,0.0007657843,0.0029458406,0.0026227054,0.0022259366,0.0042774715],"category_scores_gemma":[0.044994712,0.0007731667,0.0017102106,0.0008938411,0.0046122926,0.0053434763,0.0037970536,0.0028173458,0.0007289939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002712854,0.00026159492,0.0022004955,0.00024162632,0.00019210155,0.00029890137,0.000295593,0.15533271,0.0023654702,0.8172692,0.0018115598,0.019459506],"study_design_scores_gemma":[0.00013137303,0.00017089037,0.0006944625,0.000059974664,0.000059408423,0.00019455823,0.00006759081,0.29999065,0.0017500325,0.6956136,0.0012235316,0.00004384904],"about_ca_topic_score_codex":0.0010809241,"about_ca_topic_score_gemma":0.00079658,"teacher_disagreement_score":0.0115556605,"about_ca_system_score_codex":0.00288397,"about_ca_system_score_gemma":0.0032220138,"threshold_uncertainty_score":0.06111288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2159009,0.00096573285,0.7214182,0.0038189318,0.00021644222,0.0002109603,0.00023279978,0.00034433082,0.05689166],"genre_scores_gemma":[0.9569421,0.00027023169,0.027985044,0.00027377353,0.00009324691,0.0001586061,0.000048973136,0.00005058171,0.014177465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553704,0.0024702454,0.00018768205,0.00055281847,0.0007573374,0.00049499155],"domain_scores_gemma":[0.95970106,0.032621656,0.0020117383,0.0033671407,0.0013124031,0.0009859413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064802277,0.000621743,0.0019114391,0.0010348452,0.0015352966,0.00454914,0.0019545523,0.0029440245,0.009473933],"category_scores_gemma":[0.03757872,0.0008399312,0.0008439927,0.0017514796,0.0049806647,0.011462938,0.003414401,0.0034769517,0.0005027321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018372535,0.00006550168,0.00047854756,0.00007350342,0.000039074883,0.00011734718,0.000245991,0.02986258,0.00054139365,0.9567339,0.0010176998,0.010640836],"study_design_scores_gemma":[0.000022879616,0.00002800338,0.00012670226,0.000011428746,0.0000070968244,0.000031060357,0.00004320747,0.069022365,0.0001799448,0.92985314,0.0006624232,0.000011649301],"about_ca_topic_score_codex":0.001480205,"about_ca_topic_score_gemma":0.0011055118,"teacher_disagreement_score":0.009473933,"about_ca_system_score_codex":0.0019132275,"about_ca_system_score_gemma":0.0017718542,"threshold_uncertainty_score":0.03427118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060306536,0.00064521114,0.06901155,0.0008231512,0.00030209136,0.000077007324,0.00019923194,0.00019145446,0.9227196],"genre_scores_gemma":[0.2135857,0.0018615728,0.030139223,0.0003988549,0.0001931604,0.00024538502,0.00056561804,0.0001917055,0.7528188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950063,0.00013441926,0.00002089386,0.0000859096,0.00018058374,0.00007755382],"domain_scores_gemma":[0.9997495,0.000098136836,0.000013868229,0.00003694905,0.00005230726,0.00004930933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042442494,0.0016225073,0.0005819524,0.0005386,0.0009264661,0.0031333757,0.0012994907,0.000940877,0.045708753],"category_scores_gemma":[0.001678459,0.000313415,0.00048175466,0.0005972312,0.0018253642,0.003548467,0.0013154973,0.0019406178,0.0077082305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026327423,0.0000399352,0.000047055524,0.000048784583,0.000005818408,0.00002081634,0.00013104916,0.0016616,0.00023397492,0.9459702,0.019467507,0.032346904],"study_design_scores_gemma":[0.000015096123,0.000019431744,0.00008572616,0.000052711555,0.00000426757,0.000047821257,0.00010351511,0.0069007347,0.0002661409,0.9071369,0.08535973,0.000007936063],"about_ca_topic_score_codex":0.0018373147,"about_ca_topic_score_gemma":0.0036648887,"teacher_disagreement_score":0.045708753,"about_ca_system_score_codex":0.0016580928,"about_ca_system_score_gemma":0.0010813299,"threshold_uncertainty_score":0.152911},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061936382,0.11396489,0.2104757,0.3621031,0.013272358,0.00014254874,0.0007605598,0.00019017859,0.23715438],"genre_scores_gemma":[0.81264275,0.055309843,0.03585467,0.051207792,0.026398085,0.00027874278,0.00020791689,0.00028829672,0.017811827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958151,0.0013541899,0.00044610898,0.00084378495,0.0011681097,0.0003727128],"domain_scores_gemma":[0.9736032,0.021438211,0.000993752,0.0011008988,0.0024856348,0.000378334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009492454,0.0011299164,0.0019094042,0.002396984,0.0012890889,0.0065865233,0.0038899474,0.0046468056,0.0051432503],"category_scores_gemma":[0.017723195,0.0006215809,0.0016270849,0.0035389941,0.014052035,0.011238307,0.0028896458,0.010572793,0.0011481254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028264694,0.000042354808,0.00048406544,0.00026286073,0.000047006422,0.00010405613,0.0009145097,0.0010083904,0.00014877433,0.9701811,0.008200173,0.018578455],"study_design_scores_gemma":[0.000017506976,0.000019304489,0.0007987491,0.00019938195,0.000033707332,0.00007652883,0.0003303182,0.0016345936,0.0000867421,0.9815886,0.015190125,0.000024488463],"about_ca_topic_score_codex":0.004766275,"about_ca_topic_score_gemma":0.004398964,"teacher_disagreement_score":0.009492454,"about_ca_system_score_codex":0.0031119254,"about_ca_system_score_gemma":0.0033469177,"threshold_uncertainty_score":0.050201535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021933729,0.0006144468,0.93745553,0.0021405844,0.0001675919,0.00016546826,0.00031113776,0.0002225379,0.03698899],"genre_scores_gemma":[0.8001269,0.002005763,0.15820757,0.0008454086,0.00034084235,0.00087730365,0.0005086849,0.00010408337,0.03698358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988632,0.00049213704,0.00004610284,0.00022477248,0.00021967455,0.00015415685],"domain_scores_gemma":[0.99860114,0.0006320028,0.0002517632,0.00014915054,0.0001576552,0.00020834834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087508,0.0012099878,0.00085716206,0.0010954165,0.0011567472,0.0019919227,0.0023505902,0.0025546935,0.0066944966],"category_scores_gemma":[0.0032175286,0.00047165656,0.0011365181,0.0013763824,0.0022755598,0.0033453004,0.00199652,0.0020513427,0.0012678632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013254708,0.000026605621,0.00024455832,0.00004262414,0.000018263954,0.0001718105,0.00013160624,0.08788615,0.0008662114,0.90631354,0.00155395,0.0027314269],"study_design_scores_gemma":[0.000039925104,0.000052574538,0.00011851199,0.00002148802,0.000017991964,0.00018655811,0.00008049755,0.51712483,0.00027187157,0.46906126,0.0130035095,0.000021033435],"about_ca_topic_score_codex":0.0036133635,"about_ca_topic_score_gemma":0.0031686602,"teacher_disagreement_score":0.0066944966,"about_ca_system_score_codex":0.0019337824,"about_ca_system_score_gemma":0.0013421157,"threshold_uncertainty_score":0.022395313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112138025,0.0006585119,0.8381468,0.0035633612,0.00007340268,0.00039918302,0.00025308342,0.00011093604,0.044656713],"genre_scores_gemma":[0.768442,0.0007484367,0.2212314,0.00035878192,0.00012697041,0.0012120432,0.00025398575,0.00004470934,0.007581599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98637474,0.008451066,0.0005639139,0.001377241,0.0018473635,0.0013856494],"domain_scores_gemma":[0.98769593,0.008479475,0.0018168229,0.000562775,0.00088873884,0.00055637665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009700714,0.0017156376,0.0015506491,0.00128349,0.0014584276,0.003952739,0.0022970526,0.0041836603,0.0045952527],"category_scores_gemma":[0.026113253,0.0012032264,0.0014847245,0.0013922009,0.00645813,0.0068995403,0.0036000262,0.0035413257,0.0007733193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007341095,0.00009017007,0.00039844707,0.00008937849,0.000035184185,0.00014535381,0.00048817083,0.032439414,0.00052133907,0.959077,0.00072774047,0.005914446],"study_design_scores_gemma":[0.00010886222,0.00007509248,0.00023486631,0.000069033835,0.000017065708,0.000103933635,0.00020323637,0.10598004,0.0004284075,0.89005977,0.0026751834,0.000044435357],"about_ca_topic_score_codex":0.0019649635,"about_ca_topic_score_gemma":0.0014572415,"teacher_disagreement_score":0.009700714,"about_ca_system_score_codex":0.0018495894,"about_ca_system_score_gemma":0.0023970557,"threshold_uncertainty_score":0.05130291},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049340227,0.00017907181,0.9900705,0.00021660293,0.000038424998,0.00010801282,0.00049949525,0.00030542997,0.003648537],"genre_scores_gemma":[0.21131517,0.00086211006,0.778411,0.00031429878,0.000122024736,0.0008782555,0.0018661328,0.00029869349,0.005932351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989164,0.0004075098,0.00007917314,0.000254342,0.00023884383,0.000103763334],"domain_scores_gemma":[0.99880016,0.0005550199,0.00017616263,0.00024769266,0.00014331497,0.00007750331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089753,0.0016505271,0.0011534397,0.0013476266,0.0005966398,0.002459082,0.0018423577,0.0011626214,0.00579054],"category_scores_gemma":[0.004642181,0.00061457884,0.0017295684,0.0016800833,0.0014591417,0.0047798585,0.0017779202,0.0030468903,0.0011610973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004346558,0.000052811192,0.00031798342,0.000116139374,0.00003385549,0.00013701656,0.00031936425,0.11965629,0.00120602,0.84522945,0.0037137973,0.029173834],"study_design_scores_gemma":[0.000019619989,0.000026589827,0.000075368785,0.000036903297,0.000016336026,0.00007382479,0.000065886445,0.34288746,0.0003922849,0.64642054,0.00996882,0.000016360644],"about_ca_topic_score_codex":0.004604123,"about_ca_topic_score_gemma":0.004912051,"teacher_disagreement_score":0.00579054,"about_ca_system_score_codex":0.001359652,"about_ca_system_score_gemma":0.0011116242,"threshold_uncertainty_score":0.019371271},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012639328,0.00015502532,0.9714441,0.00024733247,0.000037319507,0.0001068302,0.00007771528,0.00008157007,0.015210843],"genre_scores_gemma":[0.6290824,0.00061677414,0.3607622,0.00023346485,0.00009340719,0.0006400632,0.00018138411,0.00010694612,0.008283258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775106,0.0013564191,0.00008643646,0.0003443076,0.00026818717,0.00019359012],"domain_scores_gemma":[0.99771047,0.0014260055,0.00028701586,0.0002525446,0.00014364178,0.00018031428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173757,0.0014481698,0.00093434507,0.0018309646,0.0010407467,0.00261756,0.0023164602,0.0014055001,0.005800863],"category_scores_gemma":[0.0041526495,0.00052475266,0.0020991606,0.0016278342,0.0046958663,0.0050493865,0.0025737148,0.0029345027,0.00068057835],"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.000015789388,0.000022327888,0.00024934026,0.000043016957,0.000022416345,0.000089919195,0.0002987054,0.03737881,0.0008024739,0.9574088,0.0002929941,0.0033753985],"study_design_scores_gemma":[0.0000143794,0.000051385956,0.00016292637,0.000026854934,0.000023755198,0.000084440326,0.00019996682,0.18493123,0.00053670316,0.8106482,0.003295374,0.000024749646],"about_ca_topic_score_codex":0.0029902817,"about_ca_topic_score_gemma":0.0017261164,"teacher_disagreement_score":0.005800863,"about_ca_system_score_codex":0.0030138816,"about_ca_system_score_gemma":0.0014245721,"threshold_uncertainty_score":0.021867335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009638383,0.000063169886,0.9840523,0.000335879,0.000017778948,0.00006351628,0.0000904351,0.00009097263,0.0056474986],"genre_scores_gemma":[0.48054615,0.00038979665,0.5097742,0.00031846119,0.000058796526,0.0007702206,0.00040929852,0.00008188149,0.0076512257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815625,0.0011915864,0.000052511514,0.0002804836,0.00023198551,0.0000871841],"domain_scores_gemma":[0.9972982,0.0020461665,0.00022035747,0.00014009098,0.00021715455,0.00007796783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018329683,0.0008071355,0.0006982826,0.0012064483,0.00062610616,0.0016782929,0.0016554515,0.0011248946,0.005904762],"category_scores_gemma":[0.006184432,0.0002644087,0.0012035152,0.0015658707,0.0016778694,0.0021375644,0.0011231134,0.0013036584,0.0007261034],"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.00004870588,0.00004868953,0.00081149227,0.00006627834,0.000057238034,0.00009512768,0.00026567437,0.43405867,0.000855872,0.5443628,0.0011758785,0.018153602],"study_design_scores_gemma":[0.0000117382515,0.000018227798,0.00015891512,0.0000068790364,0.000009522403,0.000018515746,0.00004523068,0.79921204,0.00011276273,0.19933166,0.0010625153,0.000012016089],"about_ca_topic_score_codex":0.008402959,"about_ca_topic_score_gemma":0.0066214087,"teacher_disagreement_score":0.008402959,"about_ca_system_score_codex":0.0022294205,"about_ca_system_score_gemma":0.0018436138,"threshold_uncertainty_score":0.019753397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10896825,0.0003266006,0.8531124,0.0031736786,0.00013554859,0.00021807579,0.0006527177,0.0003235729,0.03308925],"genre_scores_gemma":[0.93495345,0.00035163533,0.043078203,0.00035027644,0.00012022899,0.0002897103,0.00027541487,0.00008306927,0.020498008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810886,0.00090673356,0.000056965724,0.0002960761,0.0002806961,0.00035066073],"domain_scores_gemma":[0.9981036,0.001109174,0.0001723463,0.0001229176,0.00023409474,0.00025792673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017227263,0.0011737646,0.0018773341,0.0007884259,0.0011397082,0.003929654,0.0028219472,0.0034210193,0.01049011],"category_scores_gemma":[0.0048447014,0.0006696316,0.001271031,0.0019959013,0.002231614,0.0033759659,0.0022626712,0.0025959625,0.00088872324],"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.00016427081,0.00010205275,0.00043466396,0.00012141356,0.00006456305,0.000300945,0.00029400218,0.29762274,0.0014238768,0.6891828,0.0037837836,0.006504852],"study_design_scores_gemma":[0.000051567386,0.00003625237,0.00009631731,0.000013428084,0.000014791813,0.000052395135,0.00007514869,0.7584406,0.00013147111,0.23963605,0.0014359663,0.000015953972],"about_ca_topic_score_codex":0.0058778436,"about_ca_topic_score_gemma":0.005192806,"teacher_disagreement_score":0.01049011,"about_ca_system_score_codex":0.003188128,"about_ca_system_score_gemma":0.0023156803,"threshold_uncertainty_score":0.03509295},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05778151,0.00017148888,0.93772477,0.00024966145,0.00002050484,0.0001166166,0.00021890628,0.0009531008,0.002763436],"genre_scores_gemma":[0.63771945,0.00017063975,0.3588941,0.0001347492,0.000023899973,0.0002720919,0.0006283394,0.0002291088,0.0019276915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848324,0.0005130313,0.00008782671,0.00030117578,0.00036257677,0.00025211187],"domain_scores_gemma":[0.9949941,0.0035616795,0.0003381123,0.0005622329,0.0003417173,0.00020209854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017874219,0.0014070851,0.002217363,0.00094840885,0.0007403737,0.0019479564,0.0023435883,0.0011127933,0.005573828],"category_scores_gemma":[0.0142864585,0.0008631714,0.0011562956,0.0012480565,0.0015687541,0.0039199144,0.00262349,0.0020322797,0.00077591575],"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.0007891094,0.0001689048,0.0016005307,0.00031384875,0.00013252483,0.0001664134,0.0003569811,0.69401747,0.0023198877,0.22213247,0.0032919059,0.07470995],"study_design_scores_gemma":[0.00007121049,0.000040984258,0.000091012924,0.000010998704,0.000013258469,0.000022030883,0.00003334629,0.8521465,0.000986266,0.14615522,0.0004173483,0.000011758257],"about_ca_topic_score_codex":0.003990712,"about_ca_topic_score_gemma":0.006471159,"teacher_disagreement_score":0.005573828,"about_ca_system_score_codex":0.0018778266,"about_ca_system_score_gemma":0.002097637,"threshold_uncertainty_score":0.01864636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3089305,0.0016534418,0.61789215,0.002606654,0.00021386906,0.00022836436,0.00021403577,0.00039928991,0.06786173],"genre_scores_gemma":[0.9748409,0.00074425293,0.01939647,0.00019156534,0.00011344243,0.00014255002,0.000043556138,0.0000558589,0.0044715647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794656,0.000902282,0.00009164817,0.00022652293,0.0004708414,0.00036215803],"domain_scores_gemma":[0.98409826,0.011841611,0.0016719291,0.00063486694,0.00067770755,0.0010756281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037774623,0.001593171,0.0012029038,0.0019049947,0.0011152979,0.0030214605,0.0019220033,0.0015769881,0.0035144363],"category_scores_gemma":[0.020976242,0.0005893644,0.0010673861,0.0008507963,0.005021009,0.0057950765,0.002360562,0.0021378766,0.0002527396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023467944,0.000109828834,0.0008484466,0.00013841281,0.00009060995,0.0001239622,0.00023599101,0.27384377,0.0020801472,0.7024302,0.0011599229,0.018704046],"study_design_scores_gemma":[0.000059323796,0.00011296061,0.00020312017,0.000031901436,0.000034214154,0.00006193297,0.000089022615,0.45687014,0.00097222434,0.5402834,0.0012406225,0.00004109506],"about_ca_topic_score_codex":0.0029176387,"about_ca_topic_score_gemma":0.0018359605,"teacher_disagreement_score":0.0037774623,"about_ca_system_score_codex":0.0033733996,"about_ca_system_score_gemma":0.0018328191,"threshold_uncertainty_score":0.024475813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13358384,0.0005142238,0.8451414,0.0010609757,0.00014139421,0.000138842,0.00032270778,0.00013152206,0.018965228],"genre_scores_gemma":[0.9385978,0.0003309862,0.048265047,0.00017177642,0.00011460447,0.00031911494,0.0002369023,0.000029046634,0.011934695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749917,0.0008833674,0.000088341236,0.0007119954,0.00035562902,0.00046139394],"domain_scores_gemma":[0.99537474,0.0023753003,0.0009767029,0.00029951517,0.00046828805,0.0005054656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022786388,0.0012839645,0.0019528377,0.00074578874,0.0010332922,0.002185309,0.0020660588,0.0025836062,0.00505631],"category_scores_gemma":[0.008176861,0.0007180432,0.0011152193,0.00097127806,0.001498956,0.002260873,0.0028036572,0.0015101747,0.00067760964],"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.00019711303,0.00009339587,0.0015174011,0.00010900231,0.00013429792,0.00052778464,0.00024332017,0.87346274,0.0006921875,0.10956878,0.0014672538,0.011986802],"study_design_scores_gemma":[0.00005977695,0.00011101765,0.00025743688,0.000014344702,0.00002145644,0.000048509963,0.00009648242,0.9418228,0.00015944502,0.056492213,0.00089535926,0.000021018752],"about_ca_topic_score_codex":0.005712954,"about_ca_topic_score_gemma":0.0030353507,"teacher_disagreement_score":0.005712954,"about_ca_system_score_codex":0.001307675,"about_ca_system_score_gemma":0.0010603099,"threshold_uncertainty_score":0.016915083},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007207537,0.5868915,0.048414122,0.05231135,0.16269518,0.00021359298,0.0010974392,0.00047074715,0.14069854],"genre_scores_gemma":[0.05966766,0.5909705,0.02065863,0.009734631,0.07492085,0.0003577312,0.0034901274,0.00085143815,0.23934846],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990225,0.00020241905,0.00011160832,0.00013068772,0.00044478526,0.00008805938],"domain_scores_gemma":[0.99526864,0.0021278814,0.00027469525,0.00029070518,0.0017511538,0.00028693938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021180455,0.0011339453,0.0024266706,0.004982553,0.0007719977,0.0041715396,0.0011659386,0.0024431404,0.022871943],"category_scores_gemma":[0.007684156,0.00053031766,0.0007246124,0.006909683,0.0010780114,0.006031438,0.000971051,0.0024086747,0.0064000813],"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.0000669972,0.0000831513,0.00036868462,0.0012754962,0.000066313405,0.00010689115,0.00012578879,0.0013597775,0.00046507668,0.03353845,0.73573834,0.22680499],"study_design_scores_gemma":[0.000015267353,0.000047342783,0.0010681333,0.0006365794,0.00006338561,0.00025157418,0.00013936279,0.0009422077,0.00023085544,0.019378025,0.97720724,0.000020056139],"about_ca_topic_score_codex":0.0021560222,"about_ca_topic_score_gemma":0.002812768,"teacher_disagreement_score":0.022871943,"about_ca_system_score_codex":0.001631945,"about_ca_system_score_gemma":0.0022457808,"threshold_uncertainty_score":0.076514244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9222875,0.0028898297,0.04889659,0.0014263369,0.00020267048,0.0010955255,0.0011627575,0.00038420688,0.021654613],"genre_scores_gemma":[0.9693066,0.00026432893,0.027823877,0.00013097204,0.000040716506,0.000421828,0.0011067841,0.000057791454,0.00084714824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9608198,0.027843645,0.0022649593,0.0021916013,0.0060979887,0.00078196405],"domain_scores_gemma":[0.65425795,0.30225787,0.008101725,0.018202858,0.0148057565,0.0023738365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.043314002,0.0010630869,0.0009965579,0.0033942582,0.0017990146,0.0021604595,0.0022028647,0.0022854568,0.0044886],"category_scores_gemma":[0.21825644,0.00031028964,0.0006833327,0.0032181512,0.0030088753,0.003387812,0.0019920801,0.0017895832,0.0007023943],"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.010520221,0.0088968435,0.15563792,0.0019624592,0.0011848803,0.00026372276,0.0028205377,0.39915383,0.0022220046,0.070656486,0.019375222,0.3273059],"study_design_scores_gemma":[0.0016869219,0.004471455,0.039460268,0.00033834943,0.00022170192,0.000343001,0.002168507,0.89496976,0.0032273554,0.039624408,0.013384622,0.000103686485],"about_ca_topic_score_codex":0.002968813,"about_ca_topic_score_gemma":0.0023913498,"teacher_disagreement_score":0.043314002,"about_ca_system_score_codex":0.0029674612,"about_ca_system_score_gemma":0.0017509534,"threshold_uncertainty_score":0.22906905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8628988,0.00030970358,0.12540057,0.0006300681,0.00003988289,0.00013610133,0.0003918012,0.000085689906,0.010107385],"genre_scores_gemma":[0.9854673,0.00008321995,0.012120228,0.000042634707,0.000010572897,0.00004423004,0.0001716207,0.000022407212,0.0020377452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891806,0.00067611213,0.000023637032,0.00012723921,0.00007421728,0.0001808848],"domain_scores_gemma":[0.9920169,0.0068505057,0.0004028745,0.00014743303,0.0002605731,0.0003217299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421279,0.0007521976,0.0011686054,0.0016266628,0.0009552786,0.0018270263,0.0017415516,0.0015831777,0.004768035],"category_scores_gemma":[0.00638061,0.0007084923,0.0010176188,0.0016777234,0.0010603186,0.0024307868,0.0010560161,0.001272438,0.00020271752],"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.00014397601,0.00012781433,0.0021633096,0.00004243266,0.00007969725,0.000113087954,0.000087959415,0.9648071,0.00040435756,0.028144525,0.00052042585,0.0033653236],"study_design_scores_gemma":[0.0000108861595,0.000017081265,0.00030689282,0.0000018750806,0.000010322912,0.000005155196,0.000053815747,0.99546635,0.000033720713,0.004001332,0.00008756067,0.000004983833],"about_ca_topic_score_codex":0.059073392,"about_ca_topic_score_gemma":0.054710403,"teacher_disagreement_score":0.059073392,"about_ca_system_score_codex":0.0028897736,"about_ca_system_score_gemma":0.0018861415,"threshold_uncertainty_score":0.11745906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011428215,0.106059335,0.01540017,0.14087762,0.0049806447,0.000044025986,0.00022837253,0.000056638404,0.720925],"genre_scores_gemma":[0.5222797,0.15788022,0.006616995,0.020997737,0.01771892,0.00029239032,0.00037067215,0.0001708639,0.27367255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.0003934499,0.00003091649,0.00008686321,0.00024952856,0.00012051278],"domain_scores_gemma":[0.9975349,0.0018720711,0.00016092969,0.00012943402,0.00017411305,0.0001286209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739346,0.00061673555,0.00046698537,0.00184049,0.0020796442,0.0040088403,0.0006657778,0.0028075206,0.014462328],"category_scores_gemma":[0.0029118003,0.00028855802,0.0006741121,0.0024051184,0.0068376,0.0047909864,0.0012646128,0.0029850476,0.0019904124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036106858,0.000008459907,0.000073511146,0.000033787936,0.000002662099,0.000012834573,0.0001611671,0.00031053598,0.000015784535,0.9818895,0.014155835,0.0033323609],"study_design_scores_gemma":[0.000008133405,0.000008248428,0.00040000497,0.00018054707,0.0000032135908,0.000028268745,0.00026284656,0.0005022644,0.000025034431,0.77321285,0.22536394,0.000004602387],"about_ca_topic_score_codex":0.0018776872,"about_ca_topic_score_gemma":0.0014572144,"teacher_disagreement_score":0.014462328,"about_ca_system_score_codex":0.0037658575,"about_ca_system_score_gemma":0.001426262,"threshold_uncertainty_score":0.04838127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018643889,0.00038625769,0.99130064,0.00025729006,0.00010054229,0.000013281438,0.000022755701,0.00009665471,0.0059582205],"genre_scores_gemma":[0.64186674,0.0016949577,0.32113877,0.00035070305,0.0005004059,0.00022294157,0.00014975398,0.00028010673,0.0337956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925035,0.0003364363,0.0000377531,0.00012294785,0.00019307063,0.00005943703],"domain_scores_gemma":[0.9986199,0.0009472444,0.00008204025,0.00007861403,0.00020258811,0.00006954304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012658739,0.0010343372,0.0011746807,0.00044142312,0.00044503555,0.0014272104,0.0021291259,0.0018466469,0.0044681],"category_scores_gemma":[0.0039569144,0.00078198995,0.00083807326,0.00061134354,0.0012554898,0.0011292375,0.0014901679,0.0024159544,0.0006821872],"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.000023126247,0.000019290628,0.00010880746,0.000051532606,0.000039108683,0.000046304947,0.000034444372,0.83667004,0.0006019613,0.14484887,0.0015372571,0.016019277],"study_design_scores_gemma":[0.000004113599,0.0000064601245,0.000017761507,0.0000054665143,0.0000051766283,0.00000717012,0.0000018595048,0.9656881,0.00008874319,0.033633173,0.00053803175,0.000003924531],"about_ca_topic_score_codex":0.004322309,"about_ca_topic_score_gemma":0.004695648,"teacher_disagreement_score":0.0044681,"about_ca_system_score_codex":0.0014964226,"about_ca_system_score_gemma":0.0012178516,"threshold_uncertainty_score":0.014947355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36996114,0.0016995657,0.35233304,0.01117084,0.00022476145,0.0004937544,0.0015549836,0.00032289696,0.26223904],"genre_scores_gemma":[0.8970149,0.001164574,0.03068546,0.00030709105,0.00012220441,0.00036312971,0.00033154924,0.000040321265,0.06997066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991418,0.00027816498,0.000033511955,0.00021504496,0.00011067508,0.00022080589],"domain_scores_gemma":[0.9984862,0.00044420452,0.00029115254,0.00020045576,0.00016302735,0.00041492085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090312096,0.0006153971,0.0008327616,0.00083528884,0.0015993438,0.0039721904,0.0026458472,0.003217556,0.017618537],"category_scores_gemma":[0.0026635195,0.00048694632,0.0010568071,0.0012419955,0.0013933643,0.0035774356,0.0025611133,0.0011529141,0.0023568708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002052812,0.00037131816,0.0042524287,0.00016153739,0.000075949996,0.0012277773,0.0011238982,0.3231599,0.0018754946,0.64407796,0.0037379267,0.019730465],"study_design_scores_gemma":[0.00028733438,0.00045227067,0.0028841512,0.00012643659,0.000108288645,0.00050257635,0.0008757977,0.58822995,0.0005449399,0.3729785,0.03291327,0.000096486285],"about_ca_topic_score_codex":0.011982826,"about_ca_topic_score_gemma":0.006455463,"teacher_disagreement_score":0.017618537,"about_ca_system_score_codex":0.0023192666,"about_ca_system_score_gemma":0.0023954213,"threshold_uncertainty_score":0.058939874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74432904,0.0007246478,0.20935501,0.0018221292,0.000053823318,0.00005394336,0.00021224936,0.00009367547,0.04335544],"genre_scores_gemma":[0.98835605,0.00020639061,0.0059125987,0.00005008772,0.00002148782,0.000012008495,0.000029188282,0.000010809733,0.005401245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956757,0.0001951208,0.000010922308,0.00007306655,0.00007409447,0.00007921267],"domain_scores_gemma":[0.99805945,0.0013475857,0.00019283411,0.000111199144,0.00014377496,0.00014515362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229523,0.0002993511,0.00059973646,0.0003582969,0.00044223663,0.0021211072,0.0008215052,0.0011798711,0.006737196],"category_scores_gemma":[0.0043482883,0.00034851968,0.00044444072,0.0008093089,0.001033403,0.0028145823,0.0009337648,0.0010763853,0.00037863266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072760624,0.0001857243,0.004043784,0.00019533213,0.00009787916,0.00042247947,0.0004551431,0.32311398,0.009534723,0.60909706,0.0031970753,0.04892918],"study_design_scores_gemma":[0.00004518329,0.00013528054,0.0029260505,0.00002796719,0.00004108975,0.00014260091,0.0003012948,0.6008916,0.0009320165,0.39310288,0.0014197447,0.00003426027],"about_ca_topic_score_codex":0.0018243358,"about_ca_topic_score_gemma":0.002159368,"teacher_disagreement_score":0.006737196,"about_ca_system_score_codex":0.002169825,"about_ca_system_score_gemma":0.00040828125,"threshold_uncertainty_score":0.022538185},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0544587,0.00049411505,0.2891462,0.004964103,0.0004198574,0.00037190245,0.0009577807,0.00060847565,0.6485789],"genre_scores_gemma":[0.6943298,0.00076979515,0.055121496,0.001277005,0.0002820584,0.0006391483,0.0008377423,0.00029733943,0.24644552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984577,0.00045400448,0.000095014606,0.00041398985,0.00026463365,0.0003148176],"domain_scores_gemma":[0.9983551,0.0005081219,0.00012829844,0.0003918197,0.00033075808,0.0002859616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014507013,0.0011232247,0.0016642966,0.001308435,0.0023000927,0.0054617347,0.0016690929,0.0027300033,0.05801597],"category_scores_gemma":[0.004214491,0.00055020396,0.0014552029,0.001478183,0.0024739453,0.0074392688,0.0036036507,0.003071222,0.007715375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002868982,0.000024902552,0.000046998404,0.000037484508,0.000011352568,0.00004131905,0.00008774045,0.0007030615,0.000319491,0.99317414,0.00257327,0.0029515983],"study_design_scores_gemma":[0.00002378475,0.000014990358,0.00006904606,0.000016528973,0.000008353168,0.000058894493,0.00006619192,0.0044079837,0.00021795611,0.9880683,0.007041352,0.000006600738],"about_ca_topic_score_codex":0.0009375567,"about_ca_topic_score_gemma":0.0012712671,"teacher_disagreement_score":0.05801597,"about_ca_system_score_codex":0.001900597,"about_ca_system_score_gemma":0.002381955,"threshold_uncertainty_score":0.19408274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008427098,0.0004425907,0.98524135,0.00029330645,0.000060825332,0.000039448918,0.000023974308,0.0001184263,0.0053529534],"genre_scores_gemma":[0.85848325,0.0008943223,0.12829371,0.00040652332,0.00021236963,0.00019540483,0.0000816798,0.00008039339,0.011352426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847704,0.0007478478,0.000055521796,0.00023036596,0.00029735445,0.00019199964],"domain_scores_gemma":[0.9942017,0.004410401,0.00034142582,0.00027514892,0.0005841272,0.0001871249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024911987,0.0007013722,0.0010670196,0.0005571924,0.0004482639,0.0011651142,0.001293246,0.001047689,0.00433325],"category_scores_gemma":[0.00952285,0.00030489193,0.00041682753,0.00094297534,0.001768915,0.001956922,0.0013450411,0.0015346747,0.0006418579],"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.00021516994,0.0001381394,0.0006983869,0.00021471179,0.000038826387,0.00008646332,0.00011057825,0.7093239,0.0017339108,0.18926688,0.0025187817,0.09565428],"study_design_scores_gemma":[0.000015682677,0.000044761724,0.00007930442,0.0000068474333,0.00000355334,0.00001952489,0.000005062447,0.97399896,0.00028369494,0.025041932,0.00049411267,0.000006589472],"about_ca_topic_score_codex":0.003569598,"about_ca_topic_score_gemma":0.0019418325,"teacher_disagreement_score":0.00433325,"about_ca_system_score_codex":0.0013034808,"about_ca_system_score_gemma":0.0015997491,"threshold_uncertainty_score":0.014496207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06049024,0.00037122006,0.9251237,0.0008904584,0.00005903526,0.00006140171,0.00020864687,0.00007021181,0.012725067],"genre_scores_gemma":[0.8274214,0.0006694961,0.16177972,0.00023030816,0.00008948631,0.0001926182,0.00024654178,0.000068641566,0.009301835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848586,0.0010080694,0.000037690268,0.00016961989,0.00018888354,0.000109887595],"domain_scores_gemma":[0.99790525,0.0015150214,0.00016475092,0.000097825294,0.00014212377,0.00017498969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019481602,0.0008815667,0.0012060262,0.0012101376,0.00069392845,0.0025222483,0.0018634648,0.0017133704,0.007066448],"category_scores_gemma":[0.0050155115,0.0004445096,0.0009623257,0.0021088216,0.0014261642,0.0049314434,0.0011733962,0.0020505337,0.0005802402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012791292,0.00009195876,0.00036325993,0.00010352719,0.000077869976,0.00013053583,0.00024196689,0.23968895,0.0006736653,0.7422588,0.0014810365,0.014760573],"study_design_scores_gemma":[0.000024688803,0.000030350406,0.000108075634,0.000014911998,0.000027049873,0.00003226744,0.00007396001,0.4910087,0.00011458264,0.5076082,0.0009388521,0.000018364473],"about_ca_topic_score_codex":0.0040668473,"about_ca_topic_score_gemma":0.004039942,"teacher_disagreement_score":0.007066448,"about_ca_system_score_codex":0.0016353123,"about_ca_system_score_gemma":0.0009406736,"threshold_uncertainty_score":0.023639679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8797691,0.0013930072,0.0006568364,0.0062739872,0.00007853242,0.00009634141,0.00042590933,0.000034029763,0.11127224],"genre_scores_gemma":[0.98771465,0.0005890085,0.00035578106,0.0005918253,0.000006875117,0.000027597653,0.00015424564,0.000012418778,0.010547559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99722517,0.0006969993,0.00009046293,0.00018924149,0.0007190113,0.0010791476],"domain_scores_gemma":[0.9953206,0.0017068002,0.00037198985,0.00015685715,0.0014536005,0.0009901762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012869776,0.00023230445,0.00068507827,0.0018967143,0.009441417,0.0072983475,0.0018922457,0.0020470757,0.008739024],"category_scores_gemma":[0.00834878,0.00033574025,0.00028872312,0.0056945914,0.0034890021,0.0014859127,0.0017618514,0.0023164703,0.0004553608],"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.0016854352,0.0012463619,0.20971806,0.000730549,0.0006941019,0.017961591,0.035457686,0.065004185,0.0032285957,0.3226143,0.13373977,0.20791945],"study_design_scores_gemma":[0.0004235291,0.0002774256,0.36738822,0.0007167555,0.00038759815,0.0017089732,0.20327346,0.11653457,0.0015928721,0.083000556,0.22376223,0.0009338898],"about_ca_topic_score_codex":0.98264664,"about_ca_topic_score_gemma":0.99190193,"teacher_disagreement_score":0.08206364,"about_ca_system_score_codex":0.08206364,"about_ca_system_score_gemma":0.039023582,"threshold_uncertainty_score":0.5954162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084519714,0.00012203518,0.89371204,0.001044583,0.000059341208,0.00041398325,0.00014942384,0.00043180847,0.019546999],"genre_scores_gemma":[0.8786298,0.00017163895,0.11106027,0.00024089,0.000046741163,0.000811897,0.00017804583,0.00014053911,0.008720237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620396,0.0023766907,0.00012862164,0.00052140106,0.00037339458,0.00039603713],"domain_scores_gemma":[0.97598416,0.020916361,0.000926889,0.00071157754,0.0008268448,0.0006341295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005164366,0.0016994996,0.002783673,0.002762229,0.0013855676,0.0034878931,0.0025847184,0.0035339228,0.010792292],"category_scores_gemma":[0.028939448,0.0010612851,0.0016413407,0.0013413924,0.0020920509,0.0041938317,0.0032820487,0.002665078,0.0014260515],"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.0008096712,0.0005420025,0.0033312493,0.0004051747,0.00031196736,0.00045747837,0.0006431542,0.6238242,0.0034340099,0.3114762,0.0053860145,0.049378913],"study_design_scores_gemma":[0.00009442154,0.00008532058,0.00012006328,0.00003220992,0.00002724545,0.00004796121,0.00011214386,0.8593796,0.0005283865,0.13899243,0.0005570332,0.000023196862],"about_ca_topic_score_codex":0.0013433134,"about_ca_topic_score_gemma":0.0012671641,"teacher_disagreement_score":0.010792292,"about_ca_system_score_codex":0.0015949847,"about_ca_system_score_gemma":0.0015224678,"threshold_uncertainty_score":0.036103785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10693237,0.004127831,0.6230386,0.004379269,0.00028452877,0.0001991663,0.0002744337,0.00025637317,0.26050746],"genre_scores_gemma":[0.8241036,0.0048700417,0.10987438,0.0005790254,0.0004839141,0.00076625345,0.00031198494,0.00022890778,0.05878192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979321,0.0010039551,0.00008794011,0.00027423076,0.00041184778,0.00028993722],"domain_scores_gemma":[0.9940878,0.0047971006,0.00028093182,0.00020809694,0.0003723343,0.00025361855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024414165,0.0017323195,0.0015122261,0.0012288919,0.0012364938,0.005212008,0.0020562273,0.0022403172,0.008831288],"category_scores_gemma":[0.010173143,0.001307969,0.0012527908,0.0016801499,0.0033626535,0.00595009,0.003221475,0.004737493,0.0012655322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006618507,0.000044931767,0.00013402538,0.00013593254,0.000021997732,0.00005882964,0.00023026257,0.013581651,0.0007131273,0.9745173,0.0018186497,0.0086771],"study_design_scores_gemma":[0.000025201714,0.000016991133,0.00005869177,0.00004099769,0.00000973827,0.000029390623,0.00007796982,0.039754637,0.0002472317,0.95799047,0.0017388072,0.000009978756],"about_ca_topic_score_codex":0.0008792409,"about_ca_topic_score_gemma":0.0008705972,"teacher_disagreement_score":0.008831288,"about_ca_system_score_codex":0.0020585388,"about_ca_system_score_gemma":0.00132212,"threshold_uncertainty_score":0.029543638},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022474885,0.00043514138,0.95245475,0.0013553741,0.00012412402,0.000052168805,0.00034752052,0.00013145189,0.022624511],"genre_scores_gemma":[0.7533079,0.0011755459,0.21320356,0.00055989454,0.00030091673,0.00046503427,0.0009103266,0.00024005685,0.02983683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880064,0.0006612777,0.000045340024,0.00016348387,0.00019394538,0.00013528843],"domain_scores_gemma":[0.9964079,0.002414265,0.00034167038,0.00025813686,0.00034588884,0.00023214523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723065,0.001115342,0.0013582452,0.001300927,0.0006837063,0.0033015013,0.0023176705,0.0026688513,0.016317816],"category_scores_gemma":[0.007275557,0.0005130292,0.0010990509,0.001610352,0.0017189238,0.0042596404,0.0015136854,0.0029100303,0.0014343113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004230524,0.000060602462,0.00013128638,0.000070432216,0.000021671376,0.000049396767,0.000129467,0.1314021,0.00033908887,0.85677326,0.0025447472,0.008435661],"study_design_scores_gemma":[0.000014013031,0.000014997158,0.000046957502,0.0000155259,0.000007819207,0.000020858359,0.000045297646,0.38292667,0.000067603454,0.61569744,0.0011285917,0.000014299979],"about_ca_topic_score_codex":0.004759828,"about_ca_topic_score_gemma":0.004514134,"teacher_disagreement_score":0.016317816,"about_ca_system_score_codex":0.0012360759,"about_ca_system_score_gemma":0.0016273181,"threshold_uncertainty_score":0.054588556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05648001,0.0002598303,0.9294918,0.0006400526,0.000055292527,0.000080706435,0.00008159308,0.00014224401,0.012768414],"genre_scores_gemma":[0.9153193,0.00038660868,0.07541078,0.00012261704,0.000055202254,0.00025980145,0.00012028913,0.00007136458,0.008253927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850035,0.0007188084,0.00005814937,0.00031994816,0.00025590992,0.00014676848],"domain_scores_gemma":[0.995545,0.0032768731,0.0004441603,0.00020086483,0.0002827496,0.00025032434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019893812,0.0009589554,0.0011189774,0.0006797243,0.0007567572,0.0016946146,0.0016370495,0.0013528417,0.0025304877],"category_scores_gemma":[0.008369967,0.00047380393,0.0007758855,0.0008209121,0.001959082,0.0023583432,0.002404137,0.0017383265,0.00040288465],"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.000082686405,0.000050444538,0.00037146002,0.00008284292,0.000043998967,0.00014835753,0.00022845084,0.7563883,0.0013022696,0.22951312,0.0009691509,0.01081888],"study_design_scores_gemma":[0.00001606742,0.000019964655,0.000043711283,0.0000057494913,0.000004440791,0.000010390036,0.000023729945,0.90605676,0.00016951679,0.09325866,0.00038492036,0.000006113564],"about_ca_topic_score_codex":0.0034345489,"about_ca_topic_score_gemma":0.0019932825,"teacher_disagreement_score":0.0034345489,"about_ca_system_score_codex":0.0017951868,"about_ca_system_score_gemma":0.0011957018,"threshold_uncertainty_score":0.013025045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18762885,0.0005605304,0.7755135,0.0010376273,0.0000751715,0.00022835075,0.00013687978,0.00015023042,0.034668785],"genre_scores_gemma":[0.95650697,0.00020045791,0.03943573,0.00009196767,0.000048229795,0.00014929834,0.000055193577,0.000019620657,0.0034925677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914397,0.005796358,0.00034464782,0.00058483717,0.001276079,0.0005583995],"domain_scores_gemma":[0.9782754,0.014953779,0.003090655,0.0020034532,0.0011191231,0.0005576288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070238044,0.0007599707,0.0009597373,0.00090063247,0.0008171316,0.002972769,0.0020637373,0.001650483,0.0050319266],"category_scores_gemma":[0.031668685,0.00045127602,0.0011189625,0.000952936,0.004636271,0.0047330074,0.0017583233,0.0018485351,0.0005567272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056561537,0.00003748482,0.0012070214,0.000059526657,0.000030362648,0.00013527153,0.00020559672,0.028270338,0.00090399175,0.96210676,0.0003511745,0.0066359746],"study_design_scores_gemma":[0.000054483568,0.00007116603,0.00084512203,0.000019070088,0.000012189548,0.000106446314,0.00010219673,0.12165373,0.0007483761,0.8751203,0.0012378213,0.000029158446],"about_ca_topic_score_codex":0.0020914127,"about_ca_topic_score_gemma":0.0012162565,"teacher_disagreement_score":0.0070238044,"about_ca_system_score_codex":0.00206261,"about_ca_system_score_gemma":0.00095595175,"threshold_uncertainty_score":0.037145913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35439157,0.0018029187,0.4732989,0.025018532,0.00034367165,0.00050690485,0.00024404086,0.00021102754,0.14418244],"genre_scores_gemma":[0.980589,0.0003406105,0.011637774,0.0005390791,0.0001241337,0.00010218802,0.00002329369,0.000014135076,0.0066297366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897063,0.0064025894,0.0005488884,0.0010278759,0.0011811361,0.0011332853],"domain_scores_gemma":[0.9679097,0.022578523,0.003211567,0.0038863707,0.0009773079,0.001436559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011280232,0.0009506748,0.0016056608,0.00072479126,0.0013418428,0.0037059498,0.0014253992,0.0031314997,0.00788564],"category_scores_gemma":[0.031249076,0.00053285516,0.0008973189,0.00063024287,0.0037777135,0.0038943528,0.003402016,0.0028629424,0.0009088988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091427617,0.000498378,0.005067429,0.0004970342,0.00034957987,0.0012959046,0.0017514344,0.08404405,0.004086884,0.837763,0.0056071086,0.058125015],"study_design_scores_gemma":[0.00021677188,0.00026275867,0.001505171,0.00016626644,0.000108641296,0.00042681396,0.00047542056,0.13460179,0.002138192,0.8494977,0.010535054,0.00006534707],"about_ca_topic_score_codex":0.0011065686,"about_ca_topic_score_gemma":0.0006690306,"teacher_disagreement_score":0.011280232,"about_ca_system_score_codex":0.0017393586,"about_ca_system_score_gemma":0.0020389617,"threshold_uncertainty_score":0.059656322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5452325,0.0011894051,0.21560024,0.0041642985,0.00053334236,0.00026763053,0.005656898,0.0005097825,0.22684588],"genre_scores_gemma":[0.96542835,0.00053431425,0.016849574,0.00035431053,0.00032257417,0.00023823221,0.0013965651,0.00013925917,0.01473674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982412,0.0006109383,0.00007373495,0.00033193434,0.00036418712,0.00037797343],"domain_scores_gemma":[0.9830415,0.011556543,0.001814956,0.0007153916,0.00083029474,0.0020412426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016398974,0.00081433565,0.0010999128,0.0027575372,0.0017319409,0.0037781638,0.0017364136,0.0014500977,0.017933486],"category_scores_gemma":[0.017184181,0.0007886761,0.00076862215,0.001981568,0.0025980598,0.004628316,0.001341747,0.0026479734,0.0013705153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005044439,0.00022198907,0.0045543835,0.00027171653,0.00012128911,0.00012999361,0.00024862547,0.024602864,0.0036747737,0.921357,0.018831164,0.025481697],"study_design_scores_gemma":[0.00012180327,0.00009915028,0.006478662,0.000074414536,0.00008700762,0.0003862411,0.00012037607,0.11951909,0.001778518,0.8639355,0.0073327115,0.00006655245],"about_ca_topic_score_codex":0.0024196543,"about_ca_topic_score_gemma":0.0026298335,"teacher_disagreement_score":0.017933486,"about_ca_system_score_codex":0.0021800334,"about_ca_system_score_gemma":0.0015341392,"threshold_uncertainty_score":0.059993505},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022267883,0.017513659,0.0016205647,0.049034175,0.9128306,0.000068120135,0.000629126,0.00014917592,0.017931936],"genre_scores_gemma":[0.0024534406,0.018234568,0.0007131073,0.013025336,0.8603584,0.00008833031,0.0008201579,0.00029013839,0.10401653],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892837,0.00016491464,0.00011806473,0.00023172943,0.00047220982,0.000084853964],"domain_scores_gemma":[0.9896796,0.0031056763,0.00055348064,0.000349795,0.0046521123,0.0016594295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019229302,0.0018305567,0.0020587016,0.0026193373,0.0014497967,0.0048304414,0.0015612816,0.0032334693,0.09126624],"category_scores_gemma":[0.012069996,0.0004845707,0.0012159883,0.001638513,0.0007581536,0.0038669473,0.0013945497,0.0058623496,0.064998366],"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.000012042317,0.00000880299,0.000018298742,0.00007818703,0.0000028417578,0.000014698266,0.0000056524586,0.00004284096,0.00005756728,0.0005067987,0.9926609,0.006591328],"study_design_scores_gemma":[0.000012150983,0.000032301577,0.00036117705,0.00022340438,0.000009797765,0.0001015259,0.000021915868,0.00025251688,0.00012517886,0.003098959,0.9957476,0.000013460383],"about_ca_topic_score_codex":0.0012587694,"about_ca_topic_score_gemma":0.001525851,"teacher_disagreement_score":0.09126624,"about_ca_system_score_codex":0.0020424905,"about_ca_system_score_gemma":0.001648097,"threshold_uncertainty_score":0.30531603},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026415659,0.013857576,0.08870122,0.012878968,0.0008967164,0.00007664983,0.000032395714,0.00009634721,0.8808186],"genre_scores_gemma":[0.36887515,0.01561765,0.08671006,0.0056063016,0.00109362,0.00070131494,0.00015062622,0.00030594616,0.5209393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954066,0.0027776433,0.00016013504,0.00041812644,0.0009677524,0.00026960432],"domain_scores_gemma":[0.99635136,0.0023596475,0.00017365953,0.0005723154,0.0003545752,0.00018853368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050924737,0.0007920231,0.0005313283,0.0010114122,0.0024577489,0.006176919,0.0017020523,0.0032410535,0.029395172],"category_scores_gemma":[0.009731848,0.00042085876,0.00030756358,0.0016234376,0.01091832,0.00705433,0.004540748,0.00419291,0.0052120895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034072486,0.00000937794,0.000023490002,0.000047711805,0.0000021538592,0.00002170772,0.001091103,0.00035251863,0.000045789136,0.95978487,0.011175926,0.02744191],"study_design_scores_gemma":[0.000005569781,0.0000095430905,0.000056419776,0.00021290267,0.0000017683931,0.00007166512,0.0008453799,0.0006690539,0.0000983423,0.75243855,0.24558523,0.0000055797655],"about_ca_topic_score_codex":0.0017238074,"about_ca_topic_score_gemma":0.002063743,"teacher_disagreement_score":0.029395172,"about_ca_system_score_codex":0.0032133502,"about_ca_system_score_gemma":0.0031239635,"threshold_uncertainty_score":0.09833664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28654853,0.0005336729,0.681131,0.0034976017,0.000050891165,0.00018858747,0.00020652634,0.00023488226,0.027608292],"genre_scores_gemma":[0.9598181,0.00027732068,0.035377488,0.00019280636,0.00005219808,0.00020880369,0.00007634382,0.000024807083,0.003972085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630046,0.0017710238,0.00025371538,0.00070960703,0.000573556,0.0003916956],"domain_scores_gemma":[0.9781058,0.016583508,0.0022839713,0.0014412414,0.00097277755,0.0006127116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054613207,0.0006721369,0.0009911243,0.0011351996,0.0011432328,0.0036455747,0.0011305673,0.0019883986,0.0027378325],"category_scores_gemma":[0.023423206,0.00046315466,0.0013600341,0.00080770324,0.0055988673,0.0061051464,0.00247618,0.0023458358,0.00026448787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047372654,0.000046422818,0.0008099005,0.000051872525,0.000038287813,0.00012269546,0.00040936007,0.024375835,0.0006655846,0.96939677,0.00028315643,0.0037526751],"study_design_scores_gemma":[0.00002580462,0.000022369231,0.00023920365,0.000015774063,0.000011729624,0.000038854014,0.00008267177,0.07664393,0.00029855865,0.922019,0.0005866845,0.00001542102],"about_ca_topic_score_codex":0.00214192,"about_ca_topic_score_gemma":0.0013878404,"teacher_disagreement_score":0.0054613207,"about_ca_system_score_codex":0.002162675,"about_ca_system_score_gemma":0.0016938185,"threshold_uncertainty_score":0.028882563},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007640723,0.017651135,0.63031167,0.0033743426,0.0013926399,0.00007862381,0.00028513963,0.00020837857,0.33905733],"genre_scores_gemma":[0.54697114,0.020387257,0.20311275,0.0026567054,0.004492851,0.0006646478,0.0008619707,0.0007488642,0.22010389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927074,0.00025220367,0.000046672343,0.00017107809,0.00021066699,0.000048694706],"domain_scores_gemma":[0.9993229,0.00032145885,0.00004734659,0.00009724325,0.00016806775,0.00004300132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011287577,0.0011223706,0.000657764,0.0014550755,0.0008423261,0.002983992,0.0010641848,0.0010030168,0.0138720805],"category_scores_gemma":[0.0023757222,0.0003851334,0.0007221723,0.0021241403,0.0028484613,0.0063149747,0.0015708429,0.0028726154,0.0030154008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064366163,0.000008357172,0.000021251806,0.000056445864,0.000005108904,0.000008517525,0.00008371326,0.0006282799,0.00029617373,0.9753763,0.0062884125,0.01722101],"study_design_scores_gemma":[0.0000029165694,0.0000107726,0.00005880515,0.00003483691,0.000004827449,0.00003777849,0.00004641514,0.0024438312,0.00021302642,0.9664306,0.030707996,0.0000081165],"about_ca_topic_score_codex":0.00061555696,"about_ca_topic_score_gemma":0.00057009637,"teacher_disagreement_score":0.0138720805,"about_ca_system_score_codex":0.0015002948,"about_ca_system_score_gemma":0.00049696286,"threshold_uncertainty_score":0.046406746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8292243,0.0028046153,0.07927759,0.040457558,0.00060502515,0.00015179154,0.001221483,0.00023866275,0.046018917],"genre_scores_gemma":[0.98709106,0.00048688453,0.0058996216,0.0006625937,0.00012683251,0.00005721142,0.00025438442,0.000030936677,0.0053903176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998613,0.00046381715,0.000063977684,0.00028816317,0.000250155,0.00032095338],"domain_scores_gemma":[0.9821744,0.010393375,0.0020293533,0.00079731835,0.0016814907,0.0029241976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026016939,0.00022213427,0.000760046,0.00043089275,0.0015123477,0.0025771346,0.0012432946,0.0023911973,0.009781294],"category_scores_gemma":[0.02889333,0.00024035029,0.0005415322,0.0005503624,0.0015351746,0.0055890027,0.0011607402,0.0020704188,0.0014433167],"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.0024667108,0.0012461236,0.16558053,0.0009955616,0.0014128573,0.0010101425,0.0034918066,0.047903653,0.0132825505,0.27038416,0.03416449,0.4580615],"study_design_scores_gemma":[0.00029259984,0.0010021894,0.07970706,0.00026003085,0.0008794578,0.0025722687,0.019810384,0.17893362,0.0038912392,0.68137777,0.031067707,0.00020565014],"about_ca_topic_score_codex":0.007897721,"about_ca_topic_score_gemma":0.008255544,"teacher_disagreement_score":0.009781294,"about_ca_system_score_codex":0.0014534744,"about_ca_system_score_gemma":0.0013231869,"threshold_uncertainty_score":0.0327217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105614014,0.0012716732,0.82859576,0.0028749658,0.00086516375,0.00036985893,0.00036797088,0.00063634495,0.05940433],"genre_scores_gemma":[0.88402075,0.0006903204,0.09517037,0.00055356877,0.0005835167,0.0004234171,0.00015684971,0.00032992428,0.018071298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641293,0.0018277152,0.00014365483,0.00042521048,0.0007005076,0.0004901413],"domain_scores_gemma":[0.9814477,0.014178135,0.0008364793,0.0015818565,0.00083174463,0.0011240054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051184837,0.0018545116,0.0037266146,0.0015940032,0.001177883,0.0037407866,0.0052817324,0.004030812,0.0176603],"category_scores_gemma":[0.02343596,0.0011413351,0.0016764004,0.001521,0.0027813995,0.007192773,0.0029754925,0.005614161,0.0010401397],"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.0005847801,0.00034249533,0.00037924334,0.00039486252,0.00012805636,0.0002147975,0.00017141753,0.26434186,0.002624134,0.6971195,0.008892019,0.024806838],"study_design_scores_gemma":[0.00016732259,0.00017941528,0.0001951731,0.000034980294,0.000047124126,0.000085950844,0.000037894562,0.6353971,0.0003529993,0.36180985,0.0016524687,0.000039722097],"about_ca_topic_score_codex":0.0013143058,"about_ca_topic_score_gemma":0.0014217272,"teacher_disagreement_score":0.0176603,"about_ca_system_score_codex":0.0035608353,"about_ca_system_score_gemma":0.0030577616,"threshold_uncertainty_score":0.059079528},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30219042,0.00015435174,0.64389616,0.0007804063,0.000013916666,0.00022646949,0.00064496265,0.00031377428,0.05177945],"genre_scores_gemma":[0.9268569,0.00021805565,0.066470854,0.00012369214,0.000020479714,0.0005164003,0.0002970445,0.00005620807,0.0054405318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974125,0.0008132219,0.0001544086,0.0005849,0.00062782154,0.00040719207],"domain_scores_gemma":[0.9965969,0.0013870726,0.00072541815,0.0004422065,0.00051380676,0.0003345862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026960724,0.0010259999,0.0015127835,0.0013121227,0.0010386988,0.003108237,0.0015778736,0.0013065141,0.005359431],"category_scores_gemma":[0.0065388875,0.00051897357,0.0011895751,0.0010295328,0.0025830742,0.0039014902,0.0020371547,0.0017758353,0.0007126307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056992547,0.00009498537,0.0008431613,0.00006423275,0.000034404467,0.00010975863,0.00041289578,0.042134855,0.0027788708,0.94464594,0.0006115773,0.00821242],"study_design_scores_gemma":[0.000055031243,0.000105676554,0.0009462141,0.00007447942,0.000026995169,0.00016211135,0.00025915005,0.24425918,0.0026441775,0.7481274,0.0032850613,0.00005445488],"about_ca_topic_score_codex":0.0010109219,"about_ca_topic_score_gemma":0.00067854964,"teacher_disagreement_score":0.005359431,"about_ca_system_score_codex":0.00166939,"about_ca_system_score_gemma":0.002133511,"threshold_uncertainty_score":0.017929137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5070438,0.0010943211,0.14630975,0.02374178,0.0014363402,0.0005435063,0.00013352759,0.0003319395,0.31936508],"genre_scores_gemma":[0.963111,0.00013488083,0.008777486,0.00086446595,0.00010184077,0.00009558837,0.000015935773,0.000037625,0.026861195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976978,0.0009971425,0.00008058931,0.0002976803,0.00034990645,0.00057684927],"domain_scores_gemma":[0.9933982,0.0027815723,0.00056023,0.00086300547,0.00058241707,0.0018146269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030727466,0.00071267894,0.0012998675,0.0009477838,0.002710977,0.0040907827,0.0011233526,0.004437507,0.027551785],"category_scores_gemma":[0.011781006,0.00045133597,0.0007008427,0.00044385923,0.003724811,0.005713151,0.003984707,0.0045301584,0.0022373314],"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.00069438596,0.0003142578,0.0021488878,0.0003630366,0.00014365588,0.0009616744,0.0011852272,0.0071433033,0.012812795,0.941066,0.007930716,0.025236046],"study_design_scores_gemma":[0.00019610579,0.001341815,0.001643987,0.00018409613,0.00013116465,0.0009725755,0.002651509,0.041182544,0.0020589102,0.91212463,0.037425466,0.000087062996],"about_ca_topic_score_codex":0.0006226876,"about_ca_topic_score_gemma":0.0012507216,"teacher_disagreement_score":0.027551785,"about_ca_system_score_codex":0.00077802665,"about_ca_system_score_gemma":0.0016375771,"threshold_uncertainty_score":0.09216994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1437998,0.005370523,0.48675194,0.012708966,0.0005238652,0.000061187355,0.00016086105,0.00020711856,0.35041574],"genre_scores_gemma":[0.9716377,0.00075428723,0.019662816,0.00034654338,0.0002698535,0.00004673582,0.00005125026,0.00007173404,0.0071590175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635774,0.0017591991,0.00023503098,0.00043819708,0.0009315898,0.00027823795],"domain_scores_gemma":[0.9835369,0.013179124,0.0010025896,0.0013149859,0.00054332253,0.00042305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005887886,0.0005947086,0.00076657615,0.001108969,0.0013416889,0.009448514,0.0018804327,0.003541095,0.006670505],"category_scores_gemma":[0.020045353,0.0008427294,0.0009933378,0.0012977781,0.007822895,0.01803064,0.0026973113,0.0049375473,0.0005311169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034180284,0.000015292173,0.00018660762,0.00003726917,0.000013257338,0.000055444532,0.0008758731,0.0021394556,0.00030416079,0.9910166,0.00038529505,0.0049366774],"study_design_scores_gemma":[0.000009288419,0.000011385285,0.00031594065,0.00003214025,0.000013472042,0.000048570655,0.00030911027,0.0050473884,0.00021822691,0.9918901,0.0020861104,0.00001826073],"about_ca_topic_score_codex":0.0009732294,"about_ca_topic_score_gemma":0.0007967808,"teacher_disagreement_score":0.009448514,"about_ca_system_score_codex":0.0016340526,"about_ca_system_score_gemma":0.0013216314,"threshold_uncertainty_score":0.03113848},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018988723,0.0017958065,0.94565207,0.0008133171,0.00013147507,0.00013986081,0.00013061015,0.00009459712,0.032253448],"genre_scores_gemma":[0.7514989,0.0023055621,0.23875678,0.00027649006,0.00021704417,0.00048762062,0.0002540649,0.00011521118,0.0060883597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907069,0.0063601723,0.00025556303,0.0005672707,0.0016525122,0.0004575358],"domain_scores_gemma":[0.98762405,0.010151176,0.0007066982,0.00059572584,0.00060909457,0.00031331176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007938276,0.0017033807,0.0020024648,0.0051643937,0.0012457382,0.0045260442,0.0023774586,0.0020213008,0.0075271977],"category_scores_gemma":[0.020376619,0.0006096384,0.0020145434,0.003985369,0.0053515313,0.008063631,0.0035378525,0.0027590706,0.000700795],"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.00002856714,0.000024276129,0.00035057333,0.00010988975,0.000057832716,0.00006271213,0.0001034255,0.14485434,0.00020157418,0.8370623,0.0006110485,0.01653358],"study_design_scores_gemma":[0.00001743298,0.00004530633,0.00016536923,0.00004976292,0.000024514533,0.000069270536,0.00008186495,0.26279223,0.00018886442,0.733297,0.0032430445,0.00002541215],"about_ca_topic_score_codex":0.0017173233,"about_ca_topic_score_gemma":0.0011929083,"teacher_disagreement_score":0.007938276,"about_ca_system_score_codex":0.002537891,"about_ca_system_score_gemma":0.0014058716,"threshold_uncertainty_score":0.041982114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00904197,0.0002815453,0.9766576,0.0004175742,0.00006922626,0.00015555171,0.00044662386,0.00015864664,0.012771332],"genre_scores_gemma":[0.585533,0.0014409233,0.38056898,0.0003482937,0.00015462322,0.001198071,0.0012628324,0.00015107797,0.029342258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810433,0.00089782785,0.00007991255,0.0004092156,0.00027398372,0.00023459397],"domain_scores_gemma":[0.9983101,0.0009776112,0.0002404859,0.00012576279,0.00020162952,0.00014446302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718866,0.0013603625,0.0012219195,0.0015098649,0.0010420781,0.0020793017,0.0036922144,0.0021321329,0.009870918],"category_scores_gemma":[0.0038639328,0.00062603905,0.0018323986,0.0026014438,0.002030101,0.003907534,0.0017323294,0.0023010536,0.0013123757],"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.00004479714,0.000048543665,0.0004393402,0.000099387275,0.000055816854,0.00020586453,0.0001998299,0.47654402,0.00064744207,0.50881195,0.0022796495,0.010623324],"study_design_scores_gemma":[0.000029155826,0.000028169467,0.00010448943,0.000013241512,0.000019806317,0.00004231219,0.000059909853,0.80190897,0.000097987286,0.19426416,0.003412825,0.000018974628],"about_ca_topic_score_codex":0.016745253,"about_ca_topic_score_gemma":0.014082694,"teacher_disagreement_score":0.016745253,"about_ca_system_score_codex":0.0030611865,"about_ca_system_score_gemma":0.002515222,"threshold_uncertainty_score":0.03329557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035158847,0.00039804264,0.8764802,0.004411388,0.00034245357,0.00014183474,0.00035406428,0.00028572383,0.082427464],"genre_scores_gemma":[0.8386907,0.0005102336,0.14024404,0.0009795547,0.00044327308,0.00039280567,0.00029780788,0.00014475967,0.018296665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956619,0.0015110679,0.00037912454,0.0008218767,0.0010398043,0.0005861883],"domain_scores_gemma":[0.98763007,0.007554835,0.001207881,0.0016922059,0.0010655726,0.00084943284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004073965,0.0011391498,0.0009814397,0.0015201067,0.0014488209,0.005710497,0.0024352854,0.0032475945,0.013200535],"category_scores_gemma":[0.014817185,0.00081399345,0.0013729936,0.0014805616,0.0076330304,0.013001397,0.004813666,0.0064673037,0.0015528345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006873176,0.000017560611,0.00007121502,0.000022660908,0.0000035605678,0.000018060204,0.00009957336,0.00029188357,0.00015384777,0.9972524,0.00022257149,0.0018396968],"study_design_scores_gemma":[0.0000140450065,0.000014765408,0.00007801327,0.000016803517,0.000010651416,0.000045679833,0.00006862583,0.0049217236,0.00016012673,0.99312395,0.0015372921,0.000008283789],"about_ca_topic_score_codex":0.0007842436,"about_ca_topic_score_gemma":0.00090798514,"teacher_disagreement_score":0.013200535,"about_ca_system_score_codex":0.0014540767,"about_ca_system_score_gemma":0.002033424,"threshold_uncertainty_score":0.044160128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07966031,0.0010774059,0.81844956,0.0031390414,0.00014311659,0.00030811815,0.0013610546,0.0005411888,0.09532021],"genre_scores_gemma":[0.8336661,0.0014004997,0.1195624,0.0008410173,0.0002657328,0.00073981757,0.00089281,0.000119644996,0.042511955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980311,0.0006404999,0.00014049548,0.00046215334,0.00047355538,0.0002522105],"domain_scores_gemma":[0.9957088,0.0026746283,0.00043530765,0.00043288997,0.00040854118,0.0003398359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015965163,0.0012083482,0.0013718284,0.00078542455,0.001021726,0.0028957466,0.0015397428,0.0014302159,0.007443967],"category_scores_gemma":[0.010610972,0.00048095558,0.0009273571,0.00071554194,0.0027034713,0.0050728363,0.0024335426,0.0020837162,0.0010016827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052741376,0.000018606752,0.00018034462,0.000050037455,0.000016968903,0.000055354256,0.000086395885,0.014795073,0.00066471624,0.97511953,0.0017593375,0.0072009144],"study_design_scores_gemma":[0.000045744855,0.000035748482,0.0001865777,0.00001799447,0.0000147292585,0.000088439374,0.00003842809,0.08774294,0.00045072194,0.90455717,0.006802924,0.000018508716],"about_ca_topic_score_codex":0.0025808746,"about_ca_topic_score_gemma":0.0019549588,"teacher_disagreement_score":0.007443967,"about_ca_system_score_codex":0.002502499,"about_ca_system_score_gemma":0.0011596147,"threshold_uncertainty_score":0.024902523},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018794913,0.0019774481,0.45483717,0.003162336,0.0005725396,0.00011001789,0.00054181425,0.00020978799,0.5197939],"genre_scores_gemma":[0.5563486,0.0035034262,0.07955711,0.0010336916,0.00051744626,0.00042403446,0.0010521882,0.00029047095,0.35727298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994413,0.00023493869,0.000023446182,0.000081187376,0.00015141176,0.00006761061],"domain_scores_gemma":[0.99957913,0.00020828345,0.00004093525,0.000045576468,0.000066459426,0.000059584985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005314276,0.00093308,0.00055389886,0.0004413831,0.00063044776,0.0020127574,0.0006323541,0.00074531126,0.0287152],"category_scores_gemma":[0.0024136007,0.00023045133,0.00039304935,0.000584845,0.0009652205,0.0018053795,0.0017836018,0.0018188495,0.0033424622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017348751,0.000023181723,0.00005149937,0.000055252603,0.000010695108,0.000037045524,0.0000716974,0.005832027,0.00029373876,0.95450205,0.011223904,0.027881442],"study_design_scores_gemma":[0.000010439317,0.000016954347,0.00006596454,0.000029814493,0.000004853372,0.00004442834,0.00004675285,0.01711746,0.00012356232,0.9546884,0.02784513,0.0000062442446],"about_ca_topic_score_codex":0.00063526724,"about_ca_topic_score_gemma":0.00059228524,"teacher_disagreement_score":0.0287152,"about_ca_system_score_codex":0.0008747435,"about_ca_system_score_gemma":0.0005312033,"threshold_uncertainty_score":0.096061885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096731514,0.0018698559,0.8433369,0.0051400326,0.0002735947,0.00010275389,0.000309551,0.000100174504,0.05213568],"genre_scores_gemma":[0.8868269,0.0017009302,0.0876942,0.0008547856,0.00024129772,0.00027814653,0.00016103782,0.00003719384,0.022205556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996469,0.00015785807,0.000011040346,0.000056641376,0.000082207756,0.000045344263],"domain_scores_gemma":[0.99952877,0.0002768449,0.00006388313,0.00002518725,0.00005180128,0.000053482494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008270173,0.0004941765,0.00047373216,0.0006349546,0.0004653925,0.00087020657,0.0008374306,0.0013654935,0.0025237352],"category_scores_gemma":[0.0022414674,0.00017912427,0.00066933833,0.00036132213,0.0015866214,0.0016744942,0.00090995245,0.00114468,0.000198761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006585288,0.000006474567,0.00021005035,0.000017696371,0.000007017909,0.000041764397,0.0000593577,0.034048237,0.0003894628,0.96169174,0.0008680486,0.0026536486],"study_design_scores_gemma":[0.000014070068,0.000014588534,0.00024647612,0.000012994728,0.0000056729064,0.000049412043,0.000034473855,0.20514983,0.00013316618,0.7911589,0.0031682786,0.000012171578],"about_ca_topic_score_codex":0.0054379804,"about_ca_topic_score_gemma":0.003627482,"teacher_disagreement_score":0.0054379804,"about_ca_system_score_codex":0.0014570277,"about_ca_system_score_gemma":0.000885753,"threshold_uncertainty_score":0.01081264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46060216,0.011885997,0.42237058,0.033623386,0.00033325676,0.0002351241,0.0010351214,0.0004788337,0.06943563],"genre_scores_gemma":[0.98130023,0.0016950608,0.013981658,0.00038617942,0.00017460962,0.00009850975,0.00009301746,0.00004417712,0.0022264968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954608,0.0022391982,0.00023694748,0.00086233,0.00060998846,0.00059067155],"domain_scores_gemma":[0.94601595,0.04345715,0.0036568493,0.0033898535,0.0017280959,0.0017520632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007138742,0.00056923064,0.0015636985,0.0019524114,0.0012462793,0.003519423,0.0016828304,0.0025345748,0.009110413],"category_scores_gemma":[0.054847717,0.00060873525,0.0004870865,0.0019749366,0.0029231135,0.0174148,0.0033957055,0.0016461868,0.0007595453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005438889,0.00028755137,0.01233344,0.0007334966,0.0002065281,0.00033262864,0.0032080892,0.05267395,0.0016425949,0.76834875,0.006255131,0.15343396],"study_design_scores_gemma":[0.00004715889,0.00010052239,0.0021121982,0.00018260967,0.000048809892,0.0002833268,0.0010140069,0.05358577,0.00064871716,0.933197,0.008756842,0.000022930863],"about_ca_topic_score_codex":0.0011965248,"about_ca_topic_score_gemma":0.00088246504,"teacher_disagreement_score":0.009110413,"about_ca_system_score_codex":0.0015093539,"about_ca_system_score_gemma":0.0010559241,"threshold_uncertainty_score":0.03775376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29909098,0.0005982819,0.67672825,0.0025115137,0.000048780006,0.00022505538,0.00046404536,0.00028064544,0.020052534],"genre_scores_gemma":[0.929006,0.00047878094,0.064626664,0.00034089806,0.00004375141,0.00034934783,0.00022315762,0.000132958,0.004798513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944484,0.0027848582,0.0002813877,0.0008538488,0.00077546225,0.00085597276],"domain_scores_gemma":[0.9547536,0.036489554,0.0039768172,0.0015059069,0.0012768783,0.0019972557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077062254,0.0013727956,0.0034783198,0.0015702642,0.002001016,0.0053740107,0.0030495946,0.0027275106,0.009983419],"category_scores_gemma":[0.04476877,0.0013010368,0.0013747226,0.0014459898,0.0042374847,0.00867697,0.0035995853,0.0043186066,0.00081440853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001018256,0.0002473015,0.0023564887,0.00023355272,0.00010737263,0.00026354447,0.00070801366,0.18293343,0.003010311,0.7931643,0.0016354248,0.014322141],"study_design_scores_gemma":[0.00013198142,0.0001448254,0.0007118251,0.00008339657,0.000035381498,0.00017012995,0.00031106945,0.39856786,0.0012383139,0.5975269,0.0010140601,0.00006425933],"about_ca_topic_score_codex":0.0016080904,"about_ca_topic_score_gemma":0.0012663726,"teacher_disagreement_score":0.009983419,"about_ca_system_score_codex":0.0034346387,"about_ca_system_score_gemma":0.0016228001,"threshold_uncertainty_score":0.040754914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099971786,0.000271854,0.89465433,0.00026304225,0.00004346935,0.00009173791,0.00012416081,0.00018400332,0.0043956074],"genre_scores_gemma":[0.95454484,0.00021594447,0.039947066,0.00008231412,0.000045394536,0.000247048,0.00020381802,0.000109876215,0.0046036816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898976,0.00056624983,0.000028442486,0.00015555225,0.00012828283,0.00013167411],"domain_scores_gemma":[0.9917468,0.0062490036,0.00076519535,0.00030156857,0.0005372996,0.00040016588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028002318,0.0015291156,0.0015747884,0.003512004,0.0009781581,0.0020205353,0.002006476,0.0016709794,0.0047943234],"category_scores_gemma":[0.012283661,0.0007962981,0.0018423558,0.0016744448,0.00223908,0.0029979781,0.0025144133,0.0021372784,0.00056602916],"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.00023846008,0.00008975814,0.001540565,0.00010693049,0.00017571695,0.00014666769,0.0002487821,0.8314266,0.0024346437,0.15159634,0.0007738347,0.011221716],"study_design_scores_gemma":[0.000006317893,0.00002053287,0.00009763714,0.0000056988965,0.000010830479,0.00000702929,0.000025115593,0.9708247,0.00010114945,0.02880984,0.000083307124,0.0000078182475],"about_ca_topic_score_codex":0.0048826616,"about_ca_topic_score_gemma":0.004351952,"teacher_disagreement_score":0.0048826616,"about_ca_system_score_codex":0.0011297528,"about_ca_system_score_gemma":0.0010810277,"threshold_uncertainty_score":0.016038656},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020979717,0.00033823386,0.9661986,0.00049056474,0.00005690202,0.00008030994,0.00034490577,0.00010343765,0.011407309],"genre_scores_gemma":[0.7648219,0.0013376824,0.2134508,0.00027562285,0.0001370636,0.00044296225,0.00068106153,0.000071373375,0.018781578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837816,0.0007278211,0.000063112515,0.00034064156,0.00032289902,0.00016739531],"domain_scores_gemma":[0.9990619,0.00039863915,0.00016141108,0.00009975745,0.0001917614,0.0000866407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012637652,0.0012899775,0.0010986375,0.0013770951,0.0007833231,0.0020404924,0.002034506,0.0016076801,0.003908874],"category_scores_gemma":[0.0021904067,0.0004311306,0.0014317505,0.0023034664,0.0011910638,0.0037731992,0.0014174999,0.001732007,0.0006092118],"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.00006203435,0.000032826196,0.00045918775,0.00010983458,0.000061186445,0.00039543747,0.00016113042,0.3731152,0.0014461853,0.60807824,0.0015596192,0.014519103],"study_design_scores_gemma":[0.000026326788,0.00003232425,0.00015321604,0.000012681244,0.000024639421,0.000106522675,0.00006941777,0.77726734,0.00028721447,0.21905251,0.002940542,0.000027288705],"about_ca_topic_score_codex":0.008058675,"about_ca_topic_score_gemma":0.007350689,"teacher_disagreement_score":0.008058675,"about_ca_system_score_codex":0.0019783822,"about_ca_system_score_gemma":0.0014189071,"threshold_uncertainty_score":0.016023517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33134416,0.0032971909,0.5226752,0.013086945,0.00060347124,0.00024169612,0.00022120032,0.00054813636,0.12798212],"genre_scores_gemma":[0.97583336,0.0008561325,0.016086599,0.0005729692,0.00029971218,0.00014819718,0.000025651063,0.00006821307,0.0061091767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895626,0.007075372,0.0003769363,0.00084638403,0.0014480512,0.0006907287],"domain_scores_gemma":[0.85914487,0.13029045,0.0033813787,0.003534737,0.0025161293,0.001132539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017013118,0.0011906577,0.0037145265,0.0019849252,0.0015924218,0.0058287373,0.002892322,0.006172758,0.0062951883],"category_scores_gemma":[0.121559285,0.0020028644,0.0011010388,0.0014003497,0.0047911955,0.010999619,0.003269764,0.005060505,0.0009158219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034523217,0.0003483798,0.0010884602,0.0005067698,0.00009135118,0.00027799988,0.0012575837,0.03848476,0.0018124462,0.93622386,0.0019921332,0.017571066],"study_design_scores_gemma":[0.00010777045,0.00008056545,0.00048172424,0.00008319758,0.00007080658,0.00013895816,0.00018755336,0.11591226,0.0005854714,0.8814578,0.0008500583,0.00004394707],"about_ca_topic_score_codex":0.0016142688,"about_ca_topic_score_gemma":0.000964935,"teacher_disagreement_score":0.017013118,"about_ca_system_score_codex":0.00230197,"about_ca_system_score_gemma":0.0018846878,"threshold_uncertainty_score":0.08997506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007217983,0.00043161793,0.83032745,0.0015078025,0.0003416574,0.00021702844,0.00021021598,0.0002810507,0.1594652],"genre_scores_gemma":[0.55447125,0.0012683362,0.38827786,0.0018835916,0.0004290949,0.0010345986,0.00049758126,0.0002069971,0.05193064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953607,0.0015199545,0.00028580954,0.0010643526,0.0013421657,0.00042702825],"domain_scores_gemma":[0.9972274,0.0008258801,0.00034050975,0.000519353,0.0008358508,0.0002511015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040580058,0.00095022423,0.0006994395,0.0013258114,0.0013030805,0.0026958839,0.0024452913,0.0015864598,0.010512903],"category_scores_gemma":[0.0062288614,0.0003363573,0.0013063871,0.0007722743,0.004948237,0.005471656,0.003106856,0.0029372524,0.0022678787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095508985,0.000006998557,0.000031701416,0.000017942535,0.000005291688,0.000014282041,0.00005067529,0.00095298956,0.00018616788,0.9954868,0.0005939554,0.0026436928],"study_design_scores_gemma":[0.000020159343,0.000037765116,0.000067763096,0.000029710502,0.0000095669375,0.00007656445,0.000058345846,0.0123886345,0.0007478527,0.9628132,0.023729812,0.000020653119],"about_ca_topic_score_codex":0.0014809113,"about_ca_topic_score_gemma":0.0014192902,"teacher_disagreement_score":0.010512903,"about_ca_system_score_codex":0.0023128253,"about_ca_system_score_gemma":0.0023529753,"threshold_uncertainty_score":0.035169244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15498073,0.019559467,0.6289499,0.0085882805,0.0006949504,0.00021375736,0.00074824627,0.00035346183,0.1859113],"genre_scores_gemma":[0.8819396,0.009132793,0.06657701,0.00041836465,0.0014170503,0.00039366126,0.0005194941,0.00014243754,0.03945977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909735,0.0003843238,0.000031990854,0.00015775731,0.00023399753,0.00009447018],"domain_scores_gemma":[0.99619365,0.0026844805,0.0003265807,0.00022302239,0.00028593332,0.0002862665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011262331,0.0006530116,0.00089690124,0.0028623652,0.0014635156,0.0030755496,0.0010335536,0.0015587868,0.004433698],"category_scores_gemma":[0.0060621602,0.00057157874,0.0005195507,0.003419906,0.0026491636,0.004856205,0.0018640574,0.0020804994,0.0005565292],"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.000008439443,0.000011305992,0.00014062038,0.000048913604,0.000009476965,0.000025192785,0.0001284601,0.0059067053,0.00015930852,0.9831587,0.0022905276,0.008112401],"study_design_scores_gemma":[0.000004306895,0.000004370911,0.00011760615,0.000011539431,0.0000034933191,0.000022866147,0.000029618377,0.017769808,0.000033781278,0.97963285,0.002366126,0.0000036790022],"about_ca_topic_score_codex":0.0012849566,"about_ca_topic_score_gemma":0.001371703,"teacher_disagreement_score":0.004433698,"about_ca_system_score_codex":0.0016161575,"about_ca_system_score_gemma":0.00051948335,"threshold_uncertainty_score":0.014832199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5461903,0.0003700171,0.39756858,0.0019833657,0.000053945427,0.0002823731,0.00017625652,0.00008855419,0.05328654],"genre_scores_gemma":[0.9758613,0.00014756944,0.019498814,0.00012480048,0.000021099888,0.00016832352,0.000032183983,0.000008977421,0.004137028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518377,0.0029165226,0.00015829178,0.0005946226,0.00047370364,0.0006730873],"domain_scores_gemma":[0.98547965,0.01072013,0.0018697806,0.0009708642,0.00034466176,0.0006149135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004687888,0.0010113303,0.0012810585,0.0006820305,0.00090902305,0.0029439211,0.0015588098,0.0026829,0.0052670795],"category_scores_gemma":[0.0141312005,0.00059763406,0.0013351305,0.0006152141,0.0032107409,0.003943391,0.0026510793,0.0019029549,0.00047249984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007203766,0.0003751225,0.0032641657,0.00018914301,0.000200416,0.00066989526,0.00053897506,0.23890817,0.0043609543,0.7391643,0.00050686975,0.011101625],"study_design_scores_gemma":[0.00022161382,0.0002717763,0.0007002137,0.00004437764,0.000059587568,0.00018934885,0.00026770687,0.4770064,0.0013032578,0.51789844,0.0019889374,0.000048312668],"about_ca_topic_score_codex":0.0012520422,"about_ca_topic_score_gemma":0.0010299825,"teacher_disagreement_score":0.0052670795,"about_ca_system_score_codex":0.0014382505,"about_ca_system_score_gemma":0.0011239129,"threshold_uncertainty_score":0.024792254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024314907,0.00003859051,0.9962631,0.000061349594,0.000008226273,0.000027638638,0.000020836056,0.000034268167,0.0011144731],"genre_scores_gemma":[0.22398621,0.00038862778,0.77021396,0.00017937372,0.000051153198,0.00054460694,0.00023916962,0.00011009385,0.004286771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997265,0.0015559566,0.00009697602,0.00044506855,0.0004901767,0.00014681298],"domain_scores_gemma":[0.9957034,0.0033121095,0.00031863808,0.00022428804,0.00031901692,0.00012251634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029547922,0.00133381,0.0013701036,0.0014500901,0.0008292975,0.001999611,0.002227051,0.001324565,0.0047654337],"category_scores_gemma":[0.008291771,0.000579704,0.001783696,0.0016039793,0.0021087846,0.004358724,0.0019101368,0.0027085994,0.00078689767],"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.000054495387,0.0000521575,0.00032308916,0.00013154151,0.00004335525,0.000081643586,0.0001933618,0.53049046,0.0007612302,0.43272597,0.00086611323,0.034276586],"study_design_scores_gemma":[0.000011850306,0.000024098337,0.00004279902,0.000016133054,0.000010206866,0.000032378048,0.000033125078,0.746202,0.00030183556,0.25222674,0.0010831102,0.000015704585],"about_ca_topic_score_codex":0.0034161217,"about_ca_topic_score_gemma":0.0026548153,"teacher_disagreement_score":0.0047654337,"about_ca_system_score_codex":0.001796102,"about_ca_system_score_gemma":0.0016404376,"threshold_uncertainty_score":0.015941918},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048165093,0.000081355334,0.9891956,0.00022119713,0.000030005947,0.000060385315,0.000050387127,0.00012408555,0.005420535],"genre_scores_gemma":[0.5609212,0.0005575653,0.43457282,0.00029619486,0.00018183255,0.0004993155,0.00018725848,0.0001581459,0.002625662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99423754,0.0031655084,0.00030640207,0.00071533566,0.0012709252,0.00030429492],"domain_scores_gemma":[0.98337007,0.013069851,0.00096700207,0.0011476958,0.0011804599,0.0002648958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059456415,0.0012996126,0.0014816555,0.0035655776,0.0010784607,0.0041851383,0.0021757912,0.0015592581,0.0056064515],"category_scores_gemma":[0.025557185,0.00084306113,0.0027252885,0.0022153545,0.0041830763,0.005281755,0.00335496,0.0029604533,0.0005649396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002727868,0.000039013656,0.00025700196,0.00007191034,0.00006387323,0.000053465996,0.00011012921,0.09273107,0.00074626994,0.8925821,0.0003685268,0.012949413],"study_design_scores_gemma":[0.000013753631,0.000029496789,0.00009663613,0.000029578085,0.000038812974,0.00003684431,0.000026789447,0.3284742,0.00057267497,0.6696121,0.001047403,0.000021631971],"about_ca_topic_score_codex":0.002041183,"about_ca_topic_score_gemma":0.0012170097,"teacher_disagreement_score":0.0059456415,"about_ca_system_score_codex":0.0019283767,"about_ca_system_score_gemma":0.0020559367,"threshold_uncertainty_score":0.031443894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1748829,0.00010609483,0.8149413,0.00043179508,0.000044958735,0.00018446198,0.00040561787,0.0012378542,0.007765118],"genre_scores_gemma":[0.7028707,0.0001294288,0.29211256,0.000110998204,0.000026340811,0.00014889834,0.0006601845,0.00022577692,0.003715077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987447,0.00045551604,0.00007870263,0.00030462327,0.00020875542,0.00020764311],"domain_scores_gemma":[0.9954057,0.003519249,0.00029174122,0.00031702418,0.00025381238,0.00021246396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018136909,0.0015385557,0.0012078587,0.0012407671,0.00073191413,0.0022845012,0.001573575,0.0011912521,0.004239227],"category_scores_gemma":[0.011856383,0.0007260003,0.0010054125,0.00082677626,0.0016638038,0.0035455683,0.0021437593,0.001690108,0.0006814279],"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.00029262019,0.00020622576,0.002764899,0.00017998055,0.000079813806,0.00028123046,0.00031367454,0.74505705,0.0027985077,0.20023946,0.0022754744,0.04551107],"study_design_scores_gemma":[0.000028992787,0.00001697316,0.00008784753,0.000008676312,0.000008432362,0.000014200851,0.000046333254,0.8364449,0.0009791105,0.16197442,0.00038259622,0.0000075454104],"about_ca_topic_score_codex":0.0064121005,"about_ca_topic_score_gemma":0.008704885,"teacher_disagreement_score":0.0064121005,"about_ca_system_score_codex":0.0021715467,"about_ca_system_score_gemma":0.0018847127,"threshold_uncertainty_score":0.015755773},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18150568,0.00055546814,0.7891336,0.0015796975,0.00009401573,0.00015354257,0.00033252448,0.000100981095,0.026544435],"genre_scores_gemma":[0.9217794,0.0008526743,0.07271141,0.00022852751,0.00013994757,0.000318963,0.00030372984,0.000042285363,0.0036229705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835014,0.0005468976,0.00008569867,0.0004768133,0.000262888,0.00027760412],"domain_scores_gemma":[0.99201256,0.0056837844,0.0010695022,0.0003037802,0.00049836555,0.00043204046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030518859,0.0006328597,0.0011193441,0.0008379926,0.0009056454,0.0015273388,0.0008902369,0.0014001696,0.004549939],"category_scores_gemma":[0.014567238,0.00043920043,0.0010028572,0.00061297184,0.0021776927,0.0025085874,0.0018747956,0.0014693794,0.0003153422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012615748,0.00010809185,0.0014608155,0.00021296722,0.000072253366,0.00021594169,0.00028442964,0.19120514,0.0017327311,0.7906459,0.0018987617,0.012036803],"study_design_scores_gemma":[0.000071193455,0.000121851146,0.00079245603,0.000080102225,0.000025629473,0.000099614415,0.00029095073,0.53921795,0.0007861275,0.456099,0.0023905078,0.000024601197],"about_ca_topic_score_codex":0.001009072,"about_ca_topic_score_gemma":0.00057530164,"teacher_disagreement_score":0.004549939,"about_ca_system_score_codex":0.0011374847,"about_ca_system_score_gemma":0.0014181776,"threshold_uncertainty_score":0.016140163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16519311,0.00097354135,0.75674504,0.009447277,0.0002988757,0.0002253123,0.000563013,0.0006170481,0.06593675],"genre_scores_gemma":[0.9527148,0.0005796801,0.030364586,0.0008404082,0.00018386169,0.00018629566,0.00018021268,0.00015478545,0.014795416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968477,0.0013342786,0.000094417344,0.0007532939,0.00052201643,0.00044823778],"domain_scores_gemma":[0.98678756,0.008039413,0.0013946337,0.0020077056,0.0009959036,0.0007747776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004961019,0.00083553675,0.0012313765,0.0010099164,0.0019363556,0.0031396137,0.0024643806,0.0024890902,0.007658573],"category_scores_gemma":[0.026387462,0.00049837364,0.0011129773,0.00088776724,0.002833936,0.008805168,0.0030730036,0.0024493842,0.00085895386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002575156,0.00006349835,0.00083084346,0.000101651196,0.00006787218,0.00017058216,0.00023918775,0.19058894,0.0015284391,0.78851396,0.0038796023,0.013757795],"study_design_scores_gemma":[0.00006349714,0.00011585783,0.00019747666,0.000023614997,0.000036979425,0.00017646878,0.00009899842,0.4936524,0.00057263934,0.50067586,0.004365704,0.000020546438],"about_ca_topic_score_codex":0.0027732712,"about_ca_topic_score_gemma":0.001746777,"teacher_disagreement_score":0.007658573,"about_ca_system_score_codex":0.0027916047,"about_ca_system_score_gemma":0.0013684123,"threshold_uncertainty_score":0.026236653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38310373,0.0015286639,0.38727045,0.042504553,0.0009978467,0.0004492526,0.0010276824,0.0016174006,0.18150048],"genre_scores_gemma":[0.9784985,0.00025009073,0.012432336,0.0010847566,0.00027684474,0.00012915464,0.00007431354,0.0001423837,0.0071116695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99083835,0.005090526,0.0004713362,0.0012490429,0.0012484224,0.0011024263],"domain_scores_gemma":[0.8549306,0.11956152,0.0071433065,0.011679542,0.002178569,0.004506482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0134837,0.0012643997,0.0031523933,0.0007632072,0.0015621738,0.005907302,0.0044751624,0.0108237015,0.017750535],"category_scores_gemma":[0.101266675,0.0011756478,0.0012721701,0.0009153543,0.005152276,0.015944444,0.0032534746,0.008027403,0.0011028511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026362927,0.000254758,0.002164385,0.0006712191,0.00021285586,0.0006422218,0.00047822553,0.12141441,0.0030730576,0.8083738,0.014880151,0.045198623],"study_design_scores_gemma":[0.00033860523,0.00029874197,0.0010498182,0.00007307315,0.00009228471,0.00043310865,0.00020033035,0.18526255,0.0007138168,0.8082941,0.00316847,0.00007509846],"about_ca_topic_score_codex":0.0014136328,"about_ca_topic_score_gemma":0.0015478743,"teacher_disagreement_score":0.017750535,"about_ca_system_score_codex":0.0030199313,"about_ca_system_score_gemma":0.002578714,"threshold_uncertainty_score":0.07130951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22275439,0.00021588107,0.7642786,0.0045337053,0.00009770759,0.0003152509,0.00032020072,0.00078934396,0.0066949464],"genre_scores_gemma":[0.9141384,0.00013134547,0.081827596,0.00078440213,0.00010224494,0.00033309948,0.0002804047,0.000120150195,0.002282306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.988598,0.0068582967,0.0004244051,0.0021417947,0.0011688273,0.0008086414],"domain_scores_gemma":[0.82106537,0.15147416,0.00957991,0.008941951,0.0050718603,0.0038668371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019745912,0.0012685335,0.0025220502,0.0012999696,0.0013618317,0.0022080075,0.00398585,0.0044533894,0.0036464042],"category_scores_gemma":[0.13237013,0.00070402276,0.0010329384,0.0010434297,0.0070050824,0.005514018,0.0032144852,0.004965999,0.00070560764],"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.002485992,0.0010771513,0.032827206,0.00037290537,0.00062035857,0.00054092443,0.0007952697,0.51811934,0.0040630917,0.31174362,0.008762787,0.11859135],"study_design_scores_gemma":[0.00018213244,0.00023402933,0.00090987876,0.000029942017,0.000034044195,0.00004256771,0.000054328022,0.9087741,0.0014390497,0.08787585,0.00039553305,0.000028539172],"about_ca_topic_score_codex":0.0031577353,"about_ca_topic_score_gemma":0.0023277514,"teacher_disagreement_score":0.019745912,"about_ca_system_score_codex":0.0021026225,"about_ca_system_score_gemma":0.0041031,"threshold_uncertainty_score":0.104427636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054675993,0.00008332774,0.99225557,0.00014785491,0.000011697542,0.00006941496,0.000055038465,0.00011474086,0.0017948542],"genre_scores_gemma":[0.30256355,0.00042663873,0.6924542,0.0002128816,0.00007080968,0.00062249706,0.0003421418,0.00017251683,0.0031347526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771106,0.00078574405,0.00011858373,0.0005794318,0.0005476123,0.00025753627],"domain_scores_gemma":[0.99618477,0.0022870298,0.00038977584,0.0006375645,0.00030373235,0.00019710332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034947097,0.0019125075,0.0024680793,0.0021631822,0.0011128337,0.0038151897,0.0033797012,0.0021517293,0.007183772],"category_scores_gemma":[0.015716199,0.0010515829,0.0023395468,0.0031434875,0.0036145959,0.005989839,0.0035576595,0.0044425195,0.0007426225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044080596,0.00006374237,0.00023493278,0.00009910061,0.00003350285,0.000050338745,0.000118837735,0.31957197,0.00087885815,0.6651474,0.0008777525,0.012879384],"study_design_scores_gemma":[0.000031028278,0.000037623216,0.000054421802,0.0000235019,0.000012751066,0.000024206549,0.00003300808,0.5368165,0.0005386603,0.46114895,0.0012643882,0.000014932349],"about_ca_topic_score_codex":0.0033041837,"about_ca_topic_score_gemma":0.002976528,"teacher_disagreement_score":0.007183772,"about_ca_system_score_codex":0.0030685326,"about_ca_system_score_gemma":0.0021001815,"threshold_uncertainty_score":0.024032056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03688419,0.00065955496,0.942237,0.0012084907,0.00009372834,0.000766187,0.0010675018,0.0029135128,0.01416977],"genre_scores_gemma":[0.36149576,0.0006545686,0.620368,0.000865766,0.00018705834,0.0011111574,0.00312537,0.0009156817,0.0112766465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750334,0.00054988917,0.00013297041,0.0006593851,0.0005280084,0.00062654185],"domain_scores_gemma":[0.9961414,0.0024274113,0.00027659163,0.00058889115,0.00029708666,0.00026865155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023371475,0.0026800334,0.0027019754,0.0015997263,0.0013668772,0.0034490218,0.0039266637,0.002166768,0.011233988],"category_scores_gemma":[0.009207538,0.0012227031,0.0023687154,0.0019188292,0.0013579568,0.0077679018,0.0047754375,0.0051823524,0.0022037483],"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.0008142274,0.0010708995,0.0017605579,0.0007226748,0.0001568171,0.00024460227,0.0007523603,0.37656036,0.003518568,0.3242331,0.026976332,0.26318958],"study_design_scores_gemma":[0.00013816559,0.00006407209,0.00010886398,0.000042152195,0.00002182148,0.00008821068,0.00013197528,0.6787244,0.0010116628,0.31642863,0.0032177954,0.000022321474],"about_ca_topic_score_codex":0.005680302,"about_ca_topic_score_gemma":0.0073514367,"teacher_disagreement_score":0.011233988,"about_ca_system_score_codex":0.0033643688,"about_ca_system_score_gemma":0.002989338,"threshold_uncertainty_score":0.037581444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07471818,0.00097105076,0.46488056,0.00510271,0.0004391796,0.00020963988,0.0012053892,0.00033368927,0.45213953],"genre_scores_gemma":[0.71811634,0.0012565306,0.05054716,0.0009151328,0.00044123922,0.00031117335,0.0012832682,0.00014788663,0.22698128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857724,0.0005748218,0.00006396747,0.00020042012,0.0003706235,0.00021298406],"domain_scores_gemma":[0.9983398,0.0008990727,0.000103964456,0.00016179001,0.00024758084,0.00024784237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411079,0.0008828469,0.00093986193,0.000941856,0.0010943876,0.005131143,0.0011003682,0.001783241,0.02203209],"category_scores_gemma":[0.0046016434,0.00032696995,0.0007399283,0.0012247325,0.0016796035,0.0047054635,0.0015311496,0.0036114925,0.0035684162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019337793,0.00002481301,0.000039351402,0.000019106323,0.00000464413,0.000022263714,0.00003618151,0.0014155398,0.0002242123,0.9908098,0.0030722872,0.0043125045],"study_design_scores_gemma":[0.000015598782,0.000015285947,0.00006696612,0.000009755856,0.0000056913977,0.00004634738,0.00002918853,0.013997634,0.0001968589,0.978513,0.0070972997,0.000006461598],"about_ca_topic_score_codex":0.000732443,"about_ca_topic_score_gemma":0.0006829118,"teacher_disagreement_score":0.02203209,"about_ca_system_score_codex":0.0013808886,"about_ca_system_score_gemma":0.0009881416,"threshold_uncertainty_score":0.07370466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4334953,0.0012264308,0.48125362,0.001677365,0.00019040426,0.0001879082,0.00084478135,0.0003145166,0.08080969],"genre_scores_gemma":[0.93474185,0.00046166952,0.04700707,0.00016159208,0.0001857639,0.00024315655,0.00045664783,0.00015407434,0.016588226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742764,0.0008941253,0.0001435185,0.0003996549,0.00059387065,0.0005411282],"domain_scores_gemma":[0.9894917,0.00637457,0.0010086261,0.00059098226,0.00090959406,0.00162457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024947168,0.00065007916,0.001737973,0.0037643802,0.0029128334,0.0063921204,0.0016475572,0.001409918,0.010021506],"category_scores_gemma":[0.015816743,0.0011239487,0.0013114786,0.0027990737,0.004250817,0.008269575,0.0029286903,0.0036688957,0.000715498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004585816,0.00002590435,0.00067583047,0.00004108363,0.0000115055145,0.00004880668,0.00037662135,0.0027452032,0.00024740095,0.9907301,0.0006515176,0.0044002826],"study_design_scores_gemma":[0.000011613453,0.000014199101,0.0005057456,0.000021547414,0.000013388896,0.000051689363,0.00015390059,0.01450054,0.00013161343,0.9829427,0.0016410992,0.0000119069555],"about_ca_topic_score_codex":0.0015989168,"about_ca_topic_score_gemma":0.002002339,"teacher_disagreement_score":0.010021506,"about_ca_system_score_codex":0.0017532436,"about_ca_system_score_gemma":0.0009033629,"threshold_uncertainty_score":0.033525288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010017267,0.00068690797,0.95423096,0.0035726472,0.0001578614,0.000034919074,0.000101007405,0.000114333314,0.031084102],"genre_scores_gemma":[0.62938094,0.0033226635,0.33373952,0.0011065915,0.0013303569,0.00037450544,0.00022008692,0.00046559615,0.030059746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966954,0.0018062929,0.00016576145,0.00035962352,0.0007476797,0.00022525439],"domain_scores_gemma":[0.99197316,0.0055093374,0.0005608655,0.0008417196,0.00077894825,0.00033597142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055262554,0.0016121116,0.0019125193,0.0035937221,0.0012637428,0.008210948,0.003311148,0.004014905,0.010368876],"category_scores_gemma":[0.025487138,0.0008208949,0.0016975786,0.0031313626,0.0058486103,0.019531084,0.003565315,0.005204159,0.0013266609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000412146,0.0000049026225,0.000031111045,0.000010998233,0.00000301397,0.000010892161,0.000034190507,0.0041131964,0.000045866986,0.99318576,0.00033990777,0.0022160404],"study_design_scores_gemma":[0.0000039627007,0.0000046970445,0.000019332849,0.00001439835,0.0000041643484,0.00001725003,0.00001560555,0.026909584,0.000057413305,0.9714603,0.001487033,0.00000620988],"about_ca_topic_score_codex":0.0018379792,"about_ca_topic_score_gemma":0.0008444649,"teacher_disagreement_score":0.010368876,"about_ca_system_score_codex":0.0031323184,"about_ca_system_score_gemma":0.0018076272,"threshold_uncertainty_score":0.0346874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0853254,0.0002556427,0.90019333,0.00068466656,0.00012049777,0.00015572556,0.0000887421,0.00076418626,0.0124118],"genre_scores_gemma":[0.9529914,0.00012706229,0.040178757,0.00013036458,0.000060725964,0.00015067248,0.00006702631,0.000045719786,0.00624815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00028403994,0.00004961747,0.0002540539,0.00029202492,0.0001767591],"domain_scores_gemma":[0.99827766,0.0006057016,0.00027507785,0.0004119252,0.00023917896,0.0001904255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647641,0.00048129036,0.0007002752,0.00038564278,0.0008683308,0.001389446,0.0019569984,0.00084197137,0.0036502315],"category_scores_gemma":[0.0042623635,0.00031934574,0.000314963,0.00042078673,0.0009948844,0.0020109469,0.0020499816,0.00063275534,0.00060545333],"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.0008584269,0.00021376637,0.0020246746,0.00020034742,0.00012293636,0.0005063142,0.00060720835,0.6838487,0.02566433,0.20966597,0.0057309866,0.070556365],"study_design_scores_gemma":[0.000055647208,0.00006901599,0.00020808275,0.0000072209828,0.000011806917,0.00010511635,0.00005330793,0.94912124,0.0021799712,0.04476003,0.003415549,0.000013012218],"about_ca_topic_score_codex":0.00089787605,"about_ca_topic_score_gemma":0.00086672103,"teacher_disagreement_score":0.0036502315,"about_ca_system_score_codex":0.00095758314,"about_ca_system_score_gemma":0.00080935244,"threshold_uncertainty_score":0.012211204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06503112,0.00011062143,0.93036664,0.00029239774,0.000016340426,0.000129316,0.00022024766,0.0011021345,0.0027311617],"genre_scores_gemma":[0.60986334,0.00010815616,0.38647634,0.00016646208,0.000022118726,0.00024679094,0.0006796713,0.00025820933,0.0021788399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749595,0.0008573448,0.00015219164,0.000551495,0.00058757665,0.00035549293],"domain_scores_gemma":[0.99231404,0.0055589466,0.00049706956,0.0009578681,0.00042460897,0.00024750174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024919559,0.0011563523,0.0018099182,0.0009868306,0.00079404487,0.002550045,0.0024067275,0.0012394193,0.005550954],"category_scores_gemma":[0.019753214,0.00081696454,0.0010695603,0.0012394476,0.0018551977,0.0043432293,0.002874151,0.0025857782,0.000917109],"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.0013615162,0.00025153282,0.0027708048,0.00033178178,0.00014188109,0.00021684518,0.00050943776,0.5075057,0.00520554,0.36250913,0.004260007,0.11493575],"study_design_scores_gemma":[0.00007581213,0.00005340224,0.00016443353,0.000014348309,0.000015046426,0.000038208156,0.000036669404,0.7973289,0.0024613878,0.19922891,0.000567517,0.000015382366],"about_ca_topic_score_codex":0.0023030185,"about_ca_topic_score_gemma":0.0031069089,"teacher_disagreement_score":0.005550954,"about_ca_system_score_codex":0.0022518195,"about_ca_system_score_gemma":0.0020009866,"threshold_uncertainty_score":0.018569767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121301726,0.0010291911,0.82600456,0.012123007,0.00025885992,0.0004258186,0.0004031973,0.00039763702,0.03805594],"genre_scores_gemma":[0.8851687,0.0005028906,0.10394542,0.0007141562,0.00035387767,0.00032877334,0.00015182556,0.00006747725,0.0087668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918887,0.004316171,0.0004471728,0.0013333432,0.001281664,0.0007329853],"domain_scores_gemma":[0.9806598,0.012346273,0.0026922245,0.0018066468,0.0012557866,0.0012393738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011135478,0.0011242363,0.0015881411,0.0012110913,0.0020924162,0.0056506256,0.002397846,0.0055708652,0.0071047326],"category_scores_gemma":[0.038277537,0.0006887416,0.0013209166,0.0012152907,0.0038214058,0.009301111,0.0031595163,0.0033594684,0.00082344736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033142327,0.00012433779,0.0010970134,0.00019295997,0.000088229666,0.0002985913,0.0008970229,0.03043768,0.00214788,0.9388429,0.0028950786,0.022646898],"study_design_scores_gemma":[0.0001558527,0.00016082791,0.00031301417,0.00007027713,0.0000611278,0.00016184045,0.00019077251,0.14054051,0.0012216575,0.8510366,0.006043184,0.000044339424],"about_ca_topic_score_codex":0.0013101952,"about_ca_topic_score_gemma":0.0006514206,"teacher_disagreement_score":0.011135478,"about_ca_system_score_codex":0.0030259772,"about_ca_system_score_gemma":0.0028277661,"threshold_uncertainty_score":0.0588907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21550435,0.00076238636,0.776591,0.0020145664,0.00009805697,0.00016730299,0.00013350394,0.000384884,0.0043438617],"genre_scores_gemma":[0.9650208,0.00017472998,0.033345044,0.00010847328,0.00006972353,0.00006636482,0.000042808115,0.00003092296,0.0011412074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99107695,0.0052559394,0.00033780086,0.0014113397,0.0012315806,0.0006864638],"domain_scores_gemma":[0.9209665,0.060235962,0.007295167,0.0069216457,0.0028784757,0.0017021759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010268893,0.0007289432,0.0015130738,0.0009925436,0.0013182623,0.0036315513,0.0021196967,0.0023898794,0.0017593111],"category_scores_gemma":[0.055978414,0.0007068568,0.000929633,0.0014304209,0.0030808467,0.006022086,0.0022644782,0.0025385984,0.000248478],"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.001234619,0.0005871723,0.022363648,0.00031251827,0.000346586,0.0009801182,0.0010507575,0.643877,0.0053474247,0.1995748,0.0023994388,0.121925846],"study_design_scores_gemma":[0.000040510564,0.00015287126,0.0017491219,0.000016325328,0.000044571054,0.00013067905,0.00011382508,0.93018806,0.0013463345,0.065481246,0.000693222,0.000043195665],"about_ca_topic_score_codex":0.003609264,"about_ca_topic_score_gemma":0.0028686954,"teacher_disagreement_score":0.010268893,"about_ca_system_score_codex":0.0023969884,"about_ca_system_score_gemma":0.0013818003,"threshold_uncertainty_score":0.05430776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00400776,0.00003031399,0.99478936,0.000024416002,0.0000067008077,0.00004330443,0.000021000631,0.00015706374,0.00092013355],"genre_scores_gemma":[0.14498569,0.00012564509,0.8524453,0.00004453212,0.000015598946,0.00030718124,0.00011800677,0.00013773487,0.0018202993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989441,0.00035588292,0.00005334284,0.00019907679,0.00034193505,0.000105730294],"domain_scores_gemma":[0.9982919,0.0010044934,0.00014330613,0.00034403394,0.00017072333,0.000045453184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014333383,0.0008886441,0.0013239426,0.0008015583,0.0007454981,0.0010536761,0.0020027424,0.00072609406,0.0047749234],"category_scores_gemma":[0.0056274547,0.0005856689,0.0016163528,0.00078227505,0.0011232332,0.0023495003,0.0013412379,0.0023083768,0.0008866476],"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.00018006883,0.00008904198,0.0007372169,0.00019691024,0.00011452838,0.000142893,0.00048426617,0.66276115,0.006869862,0.22728552,0.0010418171,0.1000967],"study_design_scores_gemma":[0.000019597279,0.000048572747,0.00006749448,0.000020180718,0.000020767699,0.00004698987,0.000027312273,0.9158458,0.0023594561,0.07952467,0.002006636,0.000012426034],"about_ca_topic_score_codex":0.0038026313,"about_ca_topic_score_gemma":0.0034646716,"teacher_disagreement_score":0.0047749234,"about_ca_system_score_codex":0.001211655,"about_ca_system_score_gemma":0.0012192003,"threshold_uncertainty_score":0.015973747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32894337,0.001975258,0.48051566,0.0036684813,0.00046241592,0.0001413819,0.00024219631,0.00020110322,0.18385026],"genre_scores_gemma":[0.9197426,0.00078659947,0.027793642,0.0003325993,0.00030897855,0.00019882033,0.00012642948,0.00009109085,0.050619185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988593,0.00049881125,0.000039430266,0.00018137059,0.00024114517,0.0001799811],"domain_scores_gemma":[0.9964868,0.002073064,0.00038048314,0.00025636217,0.0002703652,0.0005328907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012255692,0.0006879548,0.0011760489,0.0012929868,0.001309062,0.0023956012,0.0010516704,0.0015399635,0.015897162],"category_scores_gemma":[0.007551003,0.00044165188,0.0006379772,0.0009092552,0.0033262987,0.003931766,0.0027438474,0.0019906424,0.00079562754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000370142,0.00001905168,0.00016818252,0.000055707576,0.000015052445,0.0000701568,0.00013202975,0.007440729,0.0003702838,0.98366076,0.0016673828,0.0063637043],"study_design_scores_gemma":[0.000013298827,0.000024967736,0.0002705993,0.000021341355,0.000006993969,0.000059316324,0.00009394335,0.026553323,0.00013122131,0.97024506,0.0025710159,0.000008892355],"about_ca_topic_score_codex":0.0011685215,"about_ca_topic_score_gemma":0.00089580467,"teacher_disagreement_score":0.015897162,"about_ca_system_score_codex":0.00081359525,"about_ca_system_score_gemma":0.0006920495,"threshold_uncertainty_score":0.05318129},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14895634,0.0013490805,0.80580723,0.003083791,0.00013183268,0.00022365605,0.0006079527,0.00018404501,0.039656058],"genre_scores_gemma":[0.87662226,0.0006302026,0.11808841,0.00032450413,0.000111334244,0.00037609602,0.0003544918,0.000057926925,0.0034348632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98905677,0.0038175648,0.0008241906,0.002011089,0.0034268699,0.0008634623],"domain_scores_gemma":[0.96544147,0.023828693,0.0030651405,0.0031770724,0.0028757886,0.0016118173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074990056,0.0008424837,0.0012473898,0.003688375,0.0014801212,0.005839224,0.0025825887,0.0025135248,0.0040946677],"category_scores_gemma":[0.04547557,0.0005742052,0.0011065066,0.0020833048,0.006474792,0.0128546925,0.005384685,0.003316605,0.0008040388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006046808,0.000037220878,0.000634688,0.00008320865,0.000038409577,0.0000683493,0.000318864,0.009977486,0.0007269645,0.97613496,0.0003431904,0.011576201],"study_design_scores_gemma":[0.000013317337,0.00005304467,0.000212949,0.000027035783,0.000010383151,0.00006920572,0.000083118575,0.018381286,0.0004586175,0.9791504,0.0015224062,0.000018284118],"about_ca_topic_score_codex":0.0006302482,"about_ca_topic_score_gemma":0.0003088073,"teacher_disagreement_score":0.0074990056,"about_ca_system_score_codex":0.0027691398,"about_ca_system_score_gemma":0.0014419607,"threshold_uncertainty_score":0.039659023},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002686852,0.41373235,0.037484378,0.25554547,0.023940638,0.000052569845,0.0012683083,0.00045161083,0.26483777],"genre_scores_gemma":[0.19741593,0.35831505,0.02928843,0.04868925,0.07429263,0.00047248145,0.0020428696,0.0010406936,0.2884427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962458,0.0017468655,0.00021634238,0.0005360289,0.0010760099,0.0001789347],"domain_scores_gemma":[0.98914963,0.007855322,0.00041454742,0.0010793521,0.0012065434,0.0002945781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005310288,0.0012884929,0.0012294188,0.002868926,0.0013009451,0.0046222904,0.0010548829,0.0036354994,0.023452323],"category_scores_gemma":[0.021303516,0.00058626814,0.001146278,0.0043353634,0.004904884,0.0052549536,0.0018644761,0.0049946625,0.008217365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002554105,0.00002656315,0.000802869,0.00027982195,0.000052837662,0.000068908776,0.00032019298,0.0013904161,0.00006570639,0.6332526,0.2993545,0.06435999],"study_design_scores_gemma":[0.000011239509,0.000011686927,0.0010028892,0.0004441778,0.00001076102,0.00006731991,0.00021171205,0.0011888248,0.000039616076,0.35472533,0.6422726,0.000013748782],"about_ca_topic_score_codex":0.0030872577,"about_ca_topic_score_gemma":0.0022430143,"teacher_disagreement_score":0.023452323,"about_ca_system_score_codex":0.0044464585,"about_ca_system_score_gemma":0.0025369122,"threshold_uncertainty_score":0.078455806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08030112,0.0026586356,0.86378455,0.006550833,0.00062446314,0.00022148082,0.00170525,0.0016291982,0.042524572],"genre_scores_gemma":[0.88088334,0.0029925958,0.09291661,0.0015780223,0.0013504376,0.00077740004,0.0014731652,0.0017998151,0.016228713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98786175,0.00353849,0.00050132815,0.0023617994,0.0029327406,0.0028039208],"domain_scores_gemma":[0.7340075,0.2359094,0.005369608,0.011292264,0.006331278,0.0070899553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016634911,0.003799024,0.0045719543,0.004078055,0.0030429764,0.00978803,0.009403328,0.0048833312,0.020431407],"category_scores_gemma":[0.107405476,0.002822158,0.004186812,0.0034377053,0.007932886,0.018789982,0.0091502,0.012516469,0.0022565576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017425095,0.00033543032,0.0024160508,0.0009990982,0.00034938075,0.00028189216,0.00075940613,0.20101789,0.006849366,0.7477846,0.009106062,0.02835833],"study_design_scores_gemma":[0.00010111397,0.00011810164,0.0005490856,0.00015454326,0.00016603901,0.00018996226,0.00009261703,0.32638606,0.0023430558,0.6683641,0.0014447888,0.00009054034],"about_ca_topic_score_codex":0.0017106703,"about_ca_topic_score_gemma":0.0021678116,"teacher_disagreement_score":0.020431407,"about_ca_system_score_codex":0.0068281544,"about_ca_system_score_gemma":0.006694338,"threshold_uncertainty_score":0.08797485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08875172,0.00081680506,0.8837449,0.0034543343,0.0001279817,0.000381088,0.00083356193,0.00018351126,0.021706248],"genre_scores_gemma":[0.6057852,0.00093124213,0.38807157,0.000590198,0.00020240553,0.00084223604,0.0012014906,0.00012198882,0.0022536104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9865139,0.005357979,0.0013591413,0.003784903,0.0020234836,0.00096068037],"domain_scores_gemma":[0.9235219,0.05865315,0.00821492,0.004280911,0.0033783002,0.0019508926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022011416,0.00202811,0.0022886503,0.006745814,0.0022170795,0.0074993395,0.0023275986,0.004252856,0.008230437],"category_scores_gemma":[0.090239234,0.0013115997,0.002881414,0.0031122912,0.00913796,0.016238825,0.007472251,0.0064766174,0.00077427493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047101516,0.0000688023,0.0009137261,0.00013288311,0.00003184131,0.000057649253,0.00043930853,0.012557746,0.00028084125,0.9730546,0.00066172745,0.011753799],"study_design_scores_gemma":[0.000025532532,0.000030818177,0.00017299908,0.00007267004,0.000009497417,0.00003134382,0.00017839059,0.041047268,0.00026235354,0.9571146,0.0010348988,0.00001950428],"about_ca_topic_score_codex":0.001210883,"about_ca_topic_score_gemma":0.0007077371,"teacher_disagreement_score":0.022011416,"about_ca_system_score_codex":0.0029185906,"about_ca_system_score_gemma":0.0039269677,"threshold_uncertainty_score":0.116408885},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01967769,0.0000920068,0.9771786,0.00033446314,0.00002130564,0.00006971162,0.00004678753,0.00010028445,0.0024791437],"genre_scores_gemma":[0.7823642,0.00038869976,0.2127431,0.0003158784,0.000080598664,0.00048904284,0.00028985678,0.00011438296,0.00321433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99078053,0.0062893834,0.00032571654,0.0010905149,0.0010389024,0.0004749477],"domain_scores_gemma":[0.9310318,0.06142879,0.002935819,0.0021067287,0.002008982,0.00048778244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011919974,0.0013147164,0.0020310779,0.0013418536,0.001082394,0.002773593,0.0020165269,0.001861481,0.0028755043],"category_scores_gemma":[0.10520351,0.0012514694,0.001192204,0.001275452,0.0038515658,0.005425726,0.0032646582,0.0035979147,0.0005020708],"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.00006992186,0.00008202619,0.002499576,0.00012984675,0.00007632773,0.0001381679,0.00020900546,0.6384712,0.00062800717,0.33864546,0.00072924653,0.018321184],"study_design_scores_gemma":[0.00002536089,0.000029497924,0.0003891842,0.000027659777,0.000009570958,0.000022839293,0.000032765514,0.8715926,0.00042649705,0.1268903,0.0005327828,0.000020940011],"about_ca_topic_score_codex":0.0117715625,"about_ca_topic_score_gemma":0.008035563,"teacher_disagreement_score":0.011919974,"about_ca_system_score_codex":0.002213678,"about_ca_system_score_gemma":0.0035346332,"threshold_uncertainty_score":0.0630396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006906923,0.00011997094,0.9884856,0.00010559456,0.00002255404,0.00004362198,0.0000481319,0.00007240671,0.0041952496],"genre_scores_gemma":[0.6103708,0.00071289163,0.37883833,0.00014831577,0.00008451261,0.00043033826,0.00030484676,0.00012848557,0.008981576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00030752248,0.000024406514,0.00014106769,0.0001594584,0.00008309725],"domain_scores_gemma":[0.9992162,0.00042611914,0.00012752884,0.000061761144,0.00010957676,0.00005868455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010728043,0.0011871137,0.0008804381,0.001802275,0.00079535996,0.0015467972,0.0017480104,0.0010684619,0.0035028895],"category_scores_gemma":[0.0023859402,0.00038925637,0.0017106225,0.0016503667,0.0015134072,0.0023040245,0.0017903348,0.0017014067,0.00045934468],"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.000029354704,0.000023239316,0.00037854852,0.000059183105,0.000053452946,0.00011839348,0.000096655465,0.7817903,0.0010772399,0.20147122,0.0006206807,0.01428162],"study_design_scores_gemma":[0.0000039020438,0.000012540301,0.000042883392,0.000005799298,0.000008933955,0.000018892199,0.000022625778,0.94706005,0.00015229355,0.051919177,0.00074414414,0.00000875546],"about_ca_topic_score_codex":0.008001223,"about_ca_topic_score_gemma":0.008094668,"teacher_disagreement_score":0.008001223,"about_ca_system_score_codex":0.0014506496,"about_ca_system_score_gemma":0.0015916147,"threshold_uncertainty_score":0.015909255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04882548,0.003095618,0.5111225,0.0136477,0.0004924334,0.00028258536,0.00036292901,0.00025861178,0.4219121],"genre_scores_gemma":[0.84546685,0.0035951324,0.080345534,0.0009036533,0.00068942556,0.00092952035,0.00023298491,0.00021818113,0.067618735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968054,0.0017324397,0.00017082064,0.00032727528,0.00061024464,0.00035374647],"domain_scores_gemma":[0.9898617,0.006474693,0.001145943,0.0011217815,0.00055538485,0.0008404191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004959746,0.0008444271,0.001016969,0.002436713,0.0022603762,0.008750057,0.0029868605,0.0040746187,0.024190895],"category_scores_gemma":[0.012831315,0.00048637434,0.0021023892,0.0025936658,0.007719458,0.023487886,0.003719936,0.0027242894,0.00270866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005934996,0.0000055381,0.000029945255,0.0000063201624,0.0000020484172,0.000014450064,0.00008138427,0.00086961273,0.000017722494,0.99831724,0.00013596106,0.00051385455],"study_design_scores_gemma":[0.000023186298,0.000020493906,0.00007788092,0.000021856089,0.000008594154,0.00005945692,0.00016551321,0.015163395,0.000046719037,0.97855765,0.0058427798,0.000012389221],"about_ca_topic_score_codex":0.0027316422,"about_ca_topic_score_gemma":0.0010268864,"teacher_disagreement_score":0.024190895,"about_ca_system_score_codex":0.0043855836,"about_ca_system_score_gemma":0.002188437,"threshold_uncertainty_score":0.08092666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1762576,0.00058275525,0.7276433,0.007358582,0.00019515406,0.00037313125,0.0006516026,0.00067662675,0.08626132],"genre_scores_gemma":[0.9594446,0.00019884946,0.032131493,0.00043007883,0.00010724587,0.00023812105,0.00016240118,0.00003955542,0.007247576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99152935,0.0044576665,0.000496241,0.0013897778,0.0011085528,0.0010183612],"domain_scores_gemma":[0.96932834,0.019870354,0.0034902073,0.004768414,0.0015412702,0.0010015263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056789964,0.0009774189,0.0014167724,0.0006830758,0.0011758258,0.00307994,0.0020642607,0.0032947047,0.008567702],"category_scores_gemma":[0.032040197,0.0006346131,0.0010242601,0.0006334592,0.003573841,0.004858833,0.0041725026,0.0025512292,0.0012067144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027455782,0.000085569205,0.0007930854,0.00018078207,0.00006229616,0.00020016286,0.00028370117,0.022433981,0.0023135173,0.9553769,0.0021541466,0.015841262],"study_design_scores_gemma":[0.000106606574,0.00012822115,0.00029597935,0.00004594025,0.000028255505,0.00016528124,0.00006376092,0.11508371,0.0014151431,0.879796,0.002833192,0.00003776074],"about_ca_topic_score_codex":0.0010823157,"about_ca_topic_score_gemma":0.00082659314,"teacher_disagreement_score":0.008567702,"about_ca_system_score_codex":0.0021715167,"about_ca_system_score_gemma":0.0026240963,"threshold_uncertainty_score":0.030033767},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126615055,0.1304354,0.2885645,0.44615784,0.0030703829,0.00015202317,0.00044539743,0.00024328359,0.11826964],"genre_scores_gemma":[0.556055,0.15186577,0.21712409,0.047569167,0.0048348866,0.0009301987,0.0005641768,0.00061390037,0.020442838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904032,0.0064480416,0.0003311298,0.00080994685,0.001533202,0.00047449252],"domain_scores_gemma":[0.9271975,0.06263667,0.0009526866,0.003731611,0.0042147124,0.0012667769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023573123,0.0013417387,0.0027041477,0.0041588657,0.0026937681,0.01313989,0.006295314,0.010565258,0.014874895],"category_scores_gemma":[0.03882742,0.0009857147,0.001591063,0.0053072916,0.042993538,0.03641624,0.005272066,0.011904282,0.0020882664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015714477,0.00002634673,0.000092461065,0.000117924916,0.0000129174905,0.000015264875,0.00038600565,0.0024553358,0.00001540079,0.9834063,0.0044898754,0.008966491],"study_design_scores_gemma":[0.0000112826965,0.00000781774,0.000049554514,0.00016793584,0.0000038268718,0.000015127693,0.00035551388,0.0027114742,0.000025561492,0.9668591,0.029777752,0.000015056765],"about_ca_topic_score_codex":0.019538455,"about_ca_topic_score_gemma":0.010765137,"teacher_disagreement_score":0.023573123,"about_ca_system_score_codex":0.014507131,"about_ca_system_score_gemma":0.00891882,"threshold_uncertainty_score":0.12466806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26065868,0.0067233476,0.55463314,0.006336637,0.000724892,0.00014506094,0.00040277155,0.00025870223,0.17011674],"genre_scores_gemma":[0.93554354,0.001605274,0.021273836,0.00036256725,0.0003095789,0.00010231089,0.00011969136,0.00010122188,0.040581986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862754,0.0005172588,0.000051494033,0.00029210522,0.000259806,0.00025177852],"domain_scores_gemma":[0.9945545,0.0033318957,0.00073396636,0.0004789854,0.00037038827,0.00053022034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014160344,0.0009723161,0.002186883,0.0012747851,0.0013381464,0.0029488842,0.00197781,0.0027040914,0.013777886],"category_scores_gemma":[0.011050191,0.0008308126,0.00092091446,0.0012006344,0.004295038,0.005704925,0.003089846,0.0025296165,0.00078890694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009040569,0.000046926638,0.00028920607,0.00015964045,0.00004492888,0.00017200987,0.00017966307,0.029316317,0.00046102525,0.9581119,0.0034442337,0.0076837107],"study_design_scores_gemma":[0.000030952666,0.000060280858,0.00050986523,0.000051364248,0.000020413094,0.00016207091,0.00014846218,0.08565563,0.00020951625,0.9087265,0.0043996284,0.000025434469],"about_ca_topic_score_codex":0.002781163,"about_ca_topic_score_gemma":0.0015652821,"teacher_disagreement_score":0.013777886,"about_ca_system_score_codex":0.0011154131,"about_ca_system_score_gemma":0.0009985579,"threshold_uncertainty_score":0.046091616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074032038,0.00061284,0.9793946,0.0010124752,0.000115103656,0.000046996156,0.0001032126,0.00007459514,0.0112369815],"genre_scores_gemma":[0.87861025,0.0018742698,0.1000452,0.00047879372,0.0006126254,0.0003580805,0.00017760263,0.000085495754,0.01775767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740607,0.0012783401,0.00009614415,0.0004252079,0.0005339979,0.00026018353],"domain_scores_gemma":[0.99562305,0.0029269275,0.0005795126,0.00020686741,0.00043333677,0.00023028262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026225909,0.0015145707,0.0013515475,0.0010615673,0.0007208236,0.0025514646,0.0027267935,0.0017299562,0.004824343],"category_scores_gemma":[0.0087610185,0.0005531178,0.0011794908,0.0010479225,0.002414393,0.0027030332,0.0016355794,0.0028462762,0.0004150237],"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.000014835244,0.000029817784,0.00019053675,0.00005645904,0.00003933283,0.000093040675,0.00006945707,0.20186627,0.0004692369,0.7925352,0.0008060188,0.003829769],"study_design_scores_gemma":[0.000012436962,0.000026416546,0.000088475026,0.00001418096,0.0000122809115,0.000021982823,0.000017277123,0.7031936,0.00013056149,0.29521874,0.0012483501,0.000015683037],"about_ca_topic_score_codex":0.0055151344,"about_ca_topic_score_gemma":0.0037511417,"teacher_disagreement_score":0.0055151344,"about_ca_system_score_codex":0.0036695998,"about_ca_system_score_gemma":0.0019474113,"threshold_uncertainty_score":0.026624978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50505775,0.00035262137,0.45397416,0.002110248,0.00009834079,0.00013387477,0.00015723356,0.000443423,0.03767244],"genre_scores_gemma":[0.986524,0.000095940886,0.011638412,0.00012771267,0.000019451778,0.00006881741,0.000023644257,0.00004494832,0.001457155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983689,0.0007588966,0.000060805214,0.00019391645,0.00027373296,0.0003437499],"domain_scores_gemma":[0.98001343,0.015693542,0.0016442785,0.00088316214,0.0005918014,0.0011737273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032032384,0.0006416549,0.0011935988,0.0010629719,0.0011504606,0.002563219,0.0012679084,0.0015930565,0.007830079],"category_scores_gemma":[0.03340008,0.0006216431,0.0011886633,0.0003513294,0.00323716,0.0057694134,0.002251859,0.0025623888,0.00050684606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030037717,0.00012400879,0.0010876571,0.0001920902,0.00006183395,0.0002883192,0.0005183241,0.23649807,0.005847873,0.7480126,0.001497301,0.005571582],"study_design_scores_gemma":[0.00007344525,0.00008088429,0.00056885445,0.000030200652,0.00002688921,0.000095257004,0.00020475118,0.52710533,0.0015313225,0.46948472,0.00076151016,0.00003683379],"about_ca_topic_score_codex":0.0015537929,"about_ca_topic_score_gemma":0.0007142131,"teacher_disagreement_score":0.007830079,"about_ca_system_score_codex":0.0019769047,"about_ca_system_score_gemma":0.0012269416,"threshold_uncertainty_score":0.026194215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2768524,0.00045779848,0.6291493,0.0039057164,0.00014018088,0.00029985962,0.00044464844,0.00025373604,0.0884963],"genre_scores_gemma":[0.9456901,0.0002714207,0.033741,0.00025948466,0.00012885408,0.00022981242,0.00013398666,0.000047302874,0.019498143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943756,0.0026855934,0.00026805975,0.0006891931,0.0012544186,0.0007272523],"domain_scores_gemma":[0.9875507,0.00787544,0.0015036699,0.00047140993,0.0016639491,0.00093489105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00588101,0.0012826144,0.0022187603,0.0016629582,0.0017985223,0.005969203,0.0021971515,0.0030051728,0.0065355026],"category_scores_gemma":[0.020277489,0.00089652964,0.0011571342,0.0016333775,0.0041109305,0.007597031,0.0032366877,0.0023633474,0.0007393485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019209414,0.00006204966,0.00033583288,0.00006758281,0.000033702243,0.00009472637,0.00014380082,0.027321383,0.0007752949,0.9653135,0.00097244186,0.0046877065],"study_design_scores_gemma":[0.00007444764,0.000084664964,0.0002095616,0.000016618313,0.000017982993,0.000058253452,0.000081270766,0.14084056,0.0002921823,0.8575331,0.00076575315,0.000025669742],"about_ca_topic_score_codex":0.0032227996,"about_ca_topic_score_gemma":0.0023866564,"teacher_disagreement_score":0.0065355026,"about_ca_system_score_codex":0.0031843495,"about_ca_system_score_gemma":0.0029609716,"threshold_uncertainty_score":0.03110212},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047460582,0.00013916094,0.948212,0.00060579047,0.000020157677,0.00009307039,0.00009096402,0.0001054499,0.0032727337],"genre_scores_gemma":[0.8999262,0.0003025839,0.09430854,0.0003131312,0.000053097207,0.00029743632,0.0001287308,0.00005078936,0.0046195975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581546,0.0020266727,0.0002130275,0.00082030986,0.00055310305,0.000571452],"domain_scores_gemma":[0.97963446,0.016330618,0.0016564818,0.0007856602,0.00090683263,0.0006860294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077254577,0.0013660112,0.0021353003,0.0008593819,0.00087784213,0.0024834895,0.0022557501,0.0022911155,0.0023420914],"category_scores_gemma":[0.02828195,0.0008724881,0.0012665319,0.00059302355,0.003774549,0.004579682,0.0027017982,0.0030048857,0.0003230522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031947318,0.00010344116,0.002706971,0.00022432089,0.00014851528,0.00039847862,0.0010042096,0.3411097,0.0028072274,0.6301477,0.0011386735,0.019891236],"study_design_scores_gemma":[0.00004084691,0.0000679741,0.00027732024,0.000024866318,0.000023510538,0.00006119457,0.00009384567,0.7028128,0.0005373593,0.2953522,0.0006744644,0.000033730004],"about_ca_topic_score_codex":0.0057927254,"about_ca_topic_score_gemma":0.0038368185,"teacher_disagreement_score":0.0077254577,"about_ca_system_score_codex":0.0022588195,"about_ca_system_score_gemma":0.0017694791,"threshold_uncertainty_score":0.04085666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024788566,0.0025021138,0.9546476,0.003627596,0.00016977837,0.00006815813,0.00006812259,0.00007165269,0.014056391],"genre_scores_gemma":[0.8472959,0.005062827,0.1405397,0.0009079344,0.00058326515,0.00025109833,0.00008610146,0.00008941915,0.005183791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528545,0.0026177587,0.00023753916,0.0006408361,0.000827262,0.00039124204],"domain_scores_gemma":[0.961495,0.0339963,0.0014893798,0.0011974587,0.0010675027,0.00075443194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076583265,0.0013273073,0.0017114541,0.001177515,0.001373365,0.0032248148,0.001985643,0.002773477,0.002402829],"category_scores_gemma":[0.03233714,0.0006930326,0.0010384722,0.0012071835,0.00782986,0.009894751,0.003057135,0.004205256,0.00030302713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009374486,0.000052047155,0.00055151957,0.0001907046,0.00005242031,0.00011816908,0.0002370493,0.20774592,0.0006165791,0.7713751,0.0007590879,0.018207667],"study_design_scores_gemma":[0.00002665469,0.00006456863,0.00012941028,0.00005559491,0.000019619216,0.000036041652,0.00003551741,0.34307218,0.00033243507,0.65477717,0.0014255565,0.00002535951],"about_ca_topic_score_codex":0.0028240385,"about_ca_topic_score_gemma":0.0017279332,"teacher_disagreement_score":0.0076583265,"about_ca_system_score_codex":0.0020900648,"about_ca_system_score_gemma":0.001351794,"threshold_uncertainty_score":0.040501595},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22673553,0.008067569,0.04129368,0.2134206,0.0017820208,0.00005376512,0.00018263437,0.00007774081,0.5083865],"genre_scores_gemma":[0.98668706,0.0010062392,0.0028605743,0.0033135193,0.00049092167,0.000022892407,0.000017614331,0.00002587354,0.0055753365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805826,0.0010353576,0.00006664917,0.0002440945,0.0004147889,0.00018083496],"domain_scores_gemma":[0.98284346,0.013916504,0.000828883,0.0009963667,0.0008726667,0.00054217153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053603,0.00032128306,0.00089899614,0.0011380482,0.0023765608,0.0044423207,0.00100037,0.0037090338,0.008662761],"category_scores_gemma":[0.021660566,0.00023278648,0.0003524682,0.0007911925,0.012858414,0.008170572,0.002650231,0.004907543,0.00050875044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029858269,0.000018782803,0.00016766976,0.000022557684,0.000008563671,0.000049325336,0.00030806678,0.0004033497,0.00008148233,0.9919602,0.002946533,0.0040035546],"study_design_scores_gemma":[0.000009932889,0.0000027544393,0.00010976242,0.000013144455,0.00000227229,0.000016921505,0.00010417847,0.0006245763,0.00002698806,0.9974607,0.0016252703,0.0000035834494],"about_ca_topic_score_codex":0.0018622846,"about_ca_topic_score_gemma":0.0013977281,"teacher_disagreement_score":0.008662761,"about_ca_system_score_codex":0.0021226127,"about_ca_system_score_gemma":0.0011640709,"threshold_uncertainty_score":0.028979838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026976358,0.0015465431,0.90500546,0.0002805759,0.000093292234,0.00007044311,0.00014093587,0.000121138204,0.06576527],"genre_scores_gemma":[0.7404628,0.003488284,0.16821869,0.00013465402,0.00015573303,0.0004416363,0.00033338525,0.00020255648,0.086562276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999767,0.00009097877,0.000014524361,0.000047902682,0.00006147794,0.000018097524],"domain_scores_gemma":[0.9997346,0.00017819337,0.000031727268,0.00001868048,0.000023369292,0.000013425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042666032,0.0010639217,0.00078256236,0.0004995534,0.0004224668,0.0017123268,0.0011119616,0.0008453675,0.0053685466],"category_scores_gemma":[0.0014333349,0.0005793825,0.0007203172,0.00066999986,0.0010778753,0.002307335,0.0012886163,0.0014288859,0.0007168869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005904823,0.000042076816,0.0001534668,0.00016834355,0.000034661058,0.000106864834,0.00020844767,0.19486281,0.0040021953,0.77182686,0.0021570695,0.026378227],"study_design_scores_gemma":[0.0000108839195,0.000027907858,0.00012354329,0.000033397097,0.000008394223,0.000033251,0.00004660334,0.5871954,0.0006534654,0.4076515,0.004200327,0.000015378326],"about_ca_topic_score_codex":0.0018340232,"about_ca_topic_score_gemma":0.002491258,"teacher_disagreement_score":0.0053685466,"about_ca_system_score_codex":0.0010079329,"about_ca_system_score_gemma":0.00045767266,"threshold_uncertainty_score":0.017959595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016282557,0.0010955051,0.94914705,0.0023380006,0.00015403237,0.00011474999,0.00024432252,0.0003513795,0.030272515],"genre_scores_gemma":[0.7623182,0.0029510974,0.20841435,0.0019298348,0.0006528756,0.0012538534,0.0006083856,0.0007622828,0.021109218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949039,0.0021684645,0.00019669603,0.00088055496,0.0011789539,0.00067150843],"domain_scores_gemma":[0.9601896,0.032810207,0.0019832116,0.0018990649,0.0021164499,0.0010015293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073143193,0.0021773984,0.0016730728,0.0018814085,0.0011780406,0.0043768184,0.0025851363,0.0021433767,0.012435374],"category_scores_gemma":[0.045448687,0.00079315633,0.001428788,0.0014201994,0.005412675,0.008344068,0.003568623,0.007547845,0.001578262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007250297,0.000066198416,0.00038974674,0.00014522496,0.000023658806,0.00005186379,0.0001439444,0.09947602,0.0010274845,0.883565,0.0029507307,0.012087708],"study_design_scores_gemma":[0.000014465852,0.00003597981,0.00013687552,0.00006241525,0.000009480027,0.000026745269,0.000025327032,0.4779672,0.0008735776,0.51910543,0.0017200869,0.000022448909],"about_ca_topic_score_codex":0.0016385838,"about_ca_topic_score_gemma":0.0017459508,"teacher_disagreement_score":0.012435374,"about_ca_system_score_codex":0.0048388354,"about_ca_system_score_gemma":0.002574283,"threshold_uncertainty_score":0.041600466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016706502,0.00033551996,0.9749786,0.00066164497,0.00009249081,0.00011515849,0.0001287352,0.0006904135,0.006290847],"genre_scores_gemma":[0.4735332,0.00022527397,0.5151842,0.0006829613,0.00006067655,0.00044451543,0.00042904855,0.0004855015,0.00895454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993099,0.00023136869,0.000025237077,0.000220634,0.00012968671,0.000083115854],"domain_scores_gemma":[0.99809664,0.0012061602,0.0001525314,0.00019760594,0.00024558543,0.00010143325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577124,0.0010671202,0.0016946879,0.0010836879,0.0010811631,0.0015227,0.002413029,0.002085725,0.006316923],"category_scores_gemma":[0.0056881183,0.0008245371,0.0012340477,0.0011056461,0.0015845033,0.0018669013,0.001579394,0.0015961021,0.0009974355],"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.000059561404,0.000037226324,0.00030185733,0.000060211565,0.000026499314,0.000030599324,0.000068409834,0.954889,0.00075387047,0.017698776,0.002403385,0.023670582],"study_design_scores_gemma":[0.000007821448,0.00000784962,0.000033016506,0.0000035576165,0.0000023469333,0.000004510289,0.000008653179,0.99106747,0.00012748112,0.008277917,0.00045617123,0.000003134365],"about_ca_topic_score_codex":0.013326113,"about_ca_topic_score_gemma":0.016728742,"teacher_disagreement_score":0.013326113,"about_ca_system_score_codex":0.002699955,"about_ca_system_score_gemma":0.0019609567,"threshold_uncertainty_score":0.026497066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3493766,0.00032600178,0.5343483,0.0024456896,0.00012250789,0.00013920845,0.0001399746,0.00037766626,0.1127242],"genre_scores_gemma":[0.97563213,0.00008765514,0.018676957,0.000058056314,0.000022756198,0.00010912521,0.000042142598,0.00003078793,0.0053403485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980648,0.0009553937,0.00009290537,0.0003969826,0.00026453458,0.00022543593],"domain_scores_gemma":[0.99148,0.0047212974,0.0011480058,0.0014373597,0.0006045638,0.00060873915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017453474,0.00035018663,0.00051761523,0.00093771564,0.0007932758,0.0035438624,0.0008900665,0.0012593757,0.006131437],"category_scores_gemma":[0.012495965,0.00041551894,0.00045431464,0.00094887486,0.0026345954,0.0041333833,0.0020243283,0.0009266638,0.000746668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009263368,0.00008969977,0.0021142687,0.00006306738,0.000053047825,0.00012097551,0.0009925067,0.03235963,0.0018739118,0.9324456,0.0011036365,0.028691119],"study_design_scores_gemma":[0.00004504574,0.000088687855,0.0027903772,0.000032720665,0.00003476317,0.000057532678,0.00072275684,0.11184695,0.00070918526,0.8794199,0.0042241868,0.000027879312],"about_ca_topic_score_codex":0.0012915443,"about_ca_topic_score_gemma":0.0008984566,"teacher_disagreement_score":0.006131437,"about_ca_system_score_codex":0.00095634995,"about_ca_system_score_gemma":0.0012703714,"threshold_uncertainty_score":0.020511687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6939736,0.00032650898,0.30138165,0.00063551206,0.000016196023,0.000118485805,0.0002834382,0.00009150391,0.0031731362],"genre_scores_gemma":[0.9810013,0.00013350052,0.017152634,0.000058052152,0.000013073193,0.00006552937,0.00017275888,0.000008855285,0.0013942346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978745,0.0012026547,0.000063343876,0.00056721846,0.00014369993,0.00014860231],"domain_scores_gemma":[0.98767483,0.009640531,0.001425917,0.0006768679,0.00031113924,0.00027065267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042056097,0.0005923773,0.0011775268,0.00095262635,0.00047049014,0.0011589653,0.0014326328,0.0011331263,0.001990906],"category_scores_gemma":[0.018722087,0.0006723365,0.00071714073,0.0009573893,0.0011093647,0.0025746906,0.0014904652,0.0012365144,0.000424705],"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.00049668184,0.00042834503,0.14225179,0.00017367,0.00088807056,0.0005119886,0.00094683573,0.74448067,0.0025506679,0.059017405,0.0009307112,0.047323126],"study_design_scores_gemma":[0.000032908607,0.00012114745,0.015909709,0.000025540605,0.00009678044,0.00009038702,0.0004762335,0.94409245,0.0008761116,0.037625786,0.00061366,0.000039149847],"about_ca_topic_score_codex":0.007408244,"about_ca_topic_score_gemma":0.008815666,"teacher_disagreement_score":0.007408244,"about_ca_system_score_codex":0.00097214145,"about_ca_system_score_gemma":0.00054284476,"threshold_uncertainty_score":0.022241652},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048817496,0.14855196,0.008454924,0.1580652,0.6503848,0.000045289646,0.0003063979,0.00014055787,0.033562765],"genre_scores_gemma":[0.008298805,0.09263727,0.0026711584,0.03238488,0.764043,0.00008659977,0.000276448,0.0003794369,0.099222526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985049,0.0003112126,0.00011476093,0.00040271334,0.000526375,0.00014009603],"domain_scores_gemma":[0.9938127,0.0027355712,0.00032427907,0.00025691462,0.0018395416,0.0010310542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988994,0.0017888484,0.0019305474,0.0031050765,0.0015183171,0.005267207,0.0016056577,0.004731103,0.02246478],"category_scores_gemma":[0.0115726935,0.00055007864,0.0009618679,0.0025560753,0.001909307,0.0047089555,0.0024461998,0.007851118,0.011895138],"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.000017593105,0.000014805388,0.000055329103,0.00019497587,0.000010553371,0.00003379134,0.000032940512,0.00024466414,0.00009865473,0.011526095,0.9622909,0.025479814],"study_design_scores_gemma":[0.000008193836,0.000017786013,0.00020698423,0.00028925203,0.000012227481,0.00008686014,0.000040727107,0.0005297381,0.00011766689,0.018648574,0.98002094,0.000020952468],"about_ca_topic_score_codex":0.0028429057,"about_ca_topic_score_gemma":0.0036546043,"teacher_disagreement_score":0.02246478,"about_ca_system_score_codex":0.0027280254,"about_ca_system_score_gemma":0.0020224892,"threshold_uncertainty_score":0.07515216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029842616,0.0021389744,0.98254806,0.0040062726,0.00028738898,0.00014500607,0.00022417851,0.00014075288,0.0075251875],"genre_scores_gemma":[0.36187539,0.007824227,0.6121134,0.005304973,0.0034557881,0.0020794047,0.00088154525,0.00031404372,0.006151203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.950693,0.035886988,0.0022313881,0.004952718,0.0052060196,0.001029942],"domain_scores_gemma":[0.78694385,0.19243826,0.006773639,0.008045782,0.0045451913,0.0012532726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03713919,0.0026463165,0.0043445965,0.004448276,0.0018961203,0.007051906,0.0042632218,0.0045430763,0.005763577],"category_scores_gemma":[0.13523498,0.0014858574,0.0032420747,0.0041324706,0.012812592,0.009767536,0.0049952357,0.007824532,0.0010072974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018255741,0.000040653827,0.00083092187,0.00023065241,0.00016115837,0.000090653404,0.00021929391,0.030543933,0.00010083101,0.95406556,0.0019086942,0.0117894355],"study_design_scores_gemma":[0.00001814626,0.000020586267,0.00010469274,0.000052628617,0.000016595553,0.00002804232,0.00003139893,0.0661255,0.000059965667,0.9308602,0.0026692818,0.000012761377],"about_ca_topic_score_codex":0.006056933,"about_ca_topic_score_gemma":0.0027671445,"teacher_disagreement_score":0.03713919,"about_ca_system_score_codex":0.0055316696,"about_ca_system_score_gemma":0.0047951215,"threshold_uncertainty_score":0.19641316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5163398,0.0013551085,0.43622878,0.004809707,0.00012076049,0.00015256576,0.000163328,0.00010163003,0.04072842],"genre_scores_gemma":[0.9871409,0.00025291077,0.010092123,0.0001269546,0.000072221585,0.0000747893,0.000054576467,0.00001221851,0.0021733248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983432,0.0007241891,0.000049641683,0.0002835286,0.0003688406,0.00023062677],"domain_scores_gemma":[0.9931739,0.004165632,0.0009299902,0.00032909834,0.0007418256,0.00065945747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020424393,0.00028183515,0.00044892388,0.0011465352,0.002071356,0.0015398499,0.00087882625,0.0011482051,0.0018360085],"category_scores_gemma":[0.0076567642,0.00017874858,0.0004194455,0.000618836,0.003909127,0.0026470227,0.0021303978,0.0007986976,0.0001758247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004280629,0.000028295171,0.002596885,0.00006127392,0.000036678357,0.00016806796,0.0006641909,0.0139479935,0.0014816626,0.972868,0.0008024331,0.0073016984],"study_design_scores_gemma":[0.000027723956,0.0000421915,0.0012406129,0.000023163988,0.000012775849,0.0001364759,0.00035699373,0.058248933,0.0005819909,0.93470895,0.0046052667,0.000014855622],"about_ca_topic_score_codex":0.0018246989,"about_ca_topic_score_gemma":0.0013282335,"teacher_disagreement_score":0.002071356,"about_ca_system_score_codex":0.0012060646,"about_ca_system_score_gemma":0.0007352207,"threshold_uncertainty_score":0.010801613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13549285,0.00019982531,0.8561496,0.000876457,0.000061098894,0.00010272951,0.00016981775,0.00011306368,0.0068344823],"genre_scores_gemma":[0.9302242,0.0002924224,0.065755844,0.00016950569,0.000060147126,0.00029527745,0.00021075294,0.00006080937,0.0029310898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995883,0.0020065145,0.00022220459,0.00089735247,0.00048385785,0.00050701265],"domain_scores_gemma":[0.98353565,0.011199768,0.0030823692,0.0007486155,0.00065257837,0.0007809148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051682238,0.0014051361,0.0021225258,0.00069925754,0.0006324533,0.0018323794,0.0016776194,0.0021019562,0.002797405],"category_scores_gemma":[0.022498114,0.000834188,0.0015489453,0.00050147605,0.0024125183,0.0025479174,0.0021639615,0.0025648056,0.0003707996],"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.00022367957,0.00014395088,0.0008545278,0.00014122964,0.00010406511,0.0001157213,0.00014577946,0.770865,0.0017667928,0.21775462,0.00063867675,0.007245992],"study_design_scores_gemma":[0.00003702182,0.000076301745,0.00012801605,0.000020190935,0.0000110790725,0.000014419274,0.000029602093,0.9293875,0.0006319638,0.06943969,0.00021244369,0.000011793521],"about_ca_topic_score_codex":0.0014896734,"about_ca_topic_score_gemma":0.0009733105,"teacher_disagreement_score":0.0051682238,"about_ca_system_score_codex":0.0023214014,"about_ca_system_score_gemma":0.0027933351,"threshold_uncertainty_score":0.027332544},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5298455,0.0012035717,0.013301251,0.14549361,0.0013964054,0.0004072392,0.00014678272,0.00011184525,0.30809388],"genre_scores_gemma":[0.98339117,0.00030102383,0.0022462397,0.0050294376,0.00006290023,0.00015005622,0.000041162835,0.00002748128,0.008750478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99541324,0.0031502973,0.000039826566,0.00024792814,0.0002572349,0.0008914579],"domain_scores_gemma":[0.9949485,0.002053948,0.00040666616,0.00040021617,0.0003829508,0.0018076173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059836055,0.0003569368,0.0006511137,0.00036937918,0.0025083548,0.0065890383,0.0021449449,0.0030810707,0.014905313],"category_scores_gemma":[0.01600223,0.00022772195,0.0006423028,0.00040543094,0.0043953066,0.0037621509,0.004238024,0.004539823,0.0012621966],"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.0035287149,0.0025665606,0.027284952,0.00031108072,0.00025172834,0.0008452072,0.012007204,0.015568446,0.0004301124,0.7960585,0.036828607,0.10431876],"study_design_scores_gemma":[0.0029849743,0.0025246658,0.039478548,0.0018777854,0.0002490613,0.0005500656,0.05964184,0.07133088,0.00055577414,0.72416043,0.09635381,0.00029221844],"about_ca_topic_score_codex":0.029053925,"about_ca_topic_score_gemma":0.06294356,"teacher_disagreement_score":0.029053925,"about_ca_system_score_codex":0.005749745,"about_ca_system_score_gemma":0.008924512,"threshold_uncertainty_score":0.057769656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98458624,0.00017565908,0.0023886901,0.0011634493,0.00007228379,0.00047675375,0.00016142582,0.00022730544,0.010748086],"genre_scores_gemma":[0.98850703,0.00019166927,0.007310812,0.0006894578,0.00003244967,0.0009686735,0.00023296414,0.000082969964,0.0019839993],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98146194,0.014171556,0.00090048363,0.0010410363,0.0018486867,0.0005763612],"domain_scores_gemma":[0.6981523,0.2577316,0.0309264,0.0060534035,0.0041602305,0.0029760979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014392147,0.0006008599,0.0004065111,0.0005832496,0.00090483855,0.0018395905,0.0018607493,0.0015579684,0.009419763],"category_scores_gemma":[0.30237517,0.00062293455,0.00027519593,0.00043933903,0.0012106206,0.0032187768,0.0018078871,0.0018961295,0.001417834],"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.03705619,0.013839417,0.1695963,0.002018167,0.00029932449,0.0012522566,0.046970844,0.003998727,0.013519117,0.0063448474,0.028369665,0.6767351],"study_design_scores_gemma":[0.004690873,0.021824436,0.77960205,0.0037465473,0.0010157124,0.0015257373,0.04900125,0.035155818,0.035632886,0.021930458,0.045081556,0.0007926885],"about_ca_topic_score_codex":0.004175672,"about_ca_topic_score_gemma":0.006936769,"teacher_disagreement_score":0.014392147,"about_ca_system_score_codex":0.0013009952,"about_ca_system_score_gemma":0.0021090303,"threshold_uncertainty_score":0.07611388},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1581227,0.019230649,0.20919627,0.042444993,0.00047570726,0.0002453096,0.0008846019,0.00016289718,0.56923693],"genre_scores_gemma":[0.9609527,0.007836512,0.014224215,0.0011005157,0.00019592103,0.00013948108,0.00018017224,0.000021780445,0.015348651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986039,0.0008417065,0.000041663145,0.00019306611,0.00019883314,0.000120850644],"domain_scores_gemma":[0.99699855,0.0018507065,0.0005317311,0.00015329449,0.00021750294,0.00024826307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014281016,0.0004363132,0.00039521954,0.0013931302,0.0012026426,0.0034733964,0.00046430132,0.0013338596,0.009464116],"category_scores_gemma":[0.004827293,0.00021467006,0.00027352836,0.001773882,0.004635424,0.0036953522,0.0017893336,0.0008734027,0.0005876827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068747695,0.000007806242,0.0010767435,0.000067369634,0.000022153503,0.00004233511,0.00029102754,0.0039789146,0.000107725275,0.98212117,0.0019324821,0.010345332],"study_design_scores_gemma":[0.0000075712287,0.000013394515,0.001448092,0.000055518085,0.000011572369,0.00009672724,0.0005332309,0.0052925562,0.000053639356,0.9598542,0.032625068,0.000008527634],"about_ca_topic_score_codex":0.0030424541,"about_ca_topic_score_gemma":0.0027978932,"teacher_disagreement_score":0.009464116,"about_ca_system_score_codex":0.002107992,"about_ca_system_score_gemma":0.001089933,"threshold_uncertainty_score":0.031660616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13370624,0.0005812151,0.7588435,0.0031194796,0.00018375019,0.00057812314,0.00089599803,0.0004764504,0.10161525],"genre_scores_gemma":[0.8232727,0.00064351177,0.1486404,0.0005969246,0.00007674564,0.00078038446,0.000631533,0.000106383435,0.025251348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847955,0.000745908,0.000045026798,0.0002621654,0.00024849197,0.00021892626],"domain_scores_gemma":[0.9980129,0.0010986562,0.0001792815,0.00017896156,0.00014909027,0.00038109673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011680673,0.0009757734,0.00077135017,0.0004713502,0.0010431051,0.0022588368,0.0018170911,0.001832498,0.008258317],"category_scores_gemma":[0.004990541,0.0004823867,0.0005613541,0.00055413356,0.0016012081,0.004360802,0.002189547,0.0017901532,0.0007228164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036056933,0.00019644576,0.0007669819,0.00019634707,0.000045130117,0.00055117067,0.00036166966,0.1633653,0.0055967662,0.80131084,0.0064671286,0.020781634],"study_design_scores_gemma":[0.00020088733,0.00022075353,0.00034525534,0.00005405301,0.000030922616,0.0004948874,0.00022975028,0.5883403,0.0018133693,0.3822562,0.02596523,0.000048505884],"about_ca_topic_score_codex":0.0018769704,"about_ca_topic_score_gemma":0.0019254192,"teacher_disagreement_score":0.008258317,"about_ca_system_score_codex":0.0019688283,"about_ca_system_score_gemma":0.0010731064,"threshold_uncertainty_score":0.027626812},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16552113,0.00090729375,0.75276583,0.0048563727,0.00016883912,0.00020063625,0.0002968907,0.00021238008,0.07507071],"genre_scores_gemma":[0.9543192,0.0003271223,0.02815518,0.00055652484,0.00018705697,0.0002519192,0.00007708128,0.00004685723,0.016079022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913368,0.004873484,0.00032444624,0.0012594275,0.0011127417,0.0010931077],"domain_scores_gemma":[0.9571366,0.032140978,0.005457829,0.0028513009,0.0012364001,0.0011769572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008749155,0.0012154632,0.0020848578,0.0011124066,0.0014256557,0.005626844,0.0025541976,0.0034096015,0.012987906],"category_scores_gemma":[0.041398823,0.0012239424,0.0013551093,0.0011909996,0.004538184,0.0080418065,0.004086975,0.004659146,0.0016540595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021139001,0.000061755294,0.00062094256,0.0001235309,0.00005557555,0.0007551647,0.00045017555,0.03375279,0.0011112812,0.9556407,0.0014034974,0.005813292],"study_design_scores_gemma":[0.00011287788,0.00009796036,0.00040368692,0.000039821953,0.00003870967,0.00045395683,0.00019122851,0.14461413,0.0006049015,0.8513267,0.0020548243,0.00006123682],"about_ca_topic_score_codex":0.0011249589,"about_ca_topic_score_gemma":0.00080726354,"teacher_disagreement_score":0.012987906,"about_ca_system_score_codex":0.0023141284,"about_ca_system_score_gemma":0.001386027,"threshold_uncertainty_score":0.04627049},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058014408,0.0010122322,0.9235517,0.0008510557,0.000087146225,0.00015670083,0.00008482538,0.00025639558,0.015985634],"genre_scores_gemma":[0.8898147,0.001132174,0.10091776,0.0003025552,0.00007488838,0.00033814108,0.00010815969,0.00022643337,0.007085264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980574,0.00091620826,0.000083515435,0.0002690002,0.00043606237,0.0002377786],"domain_scores_gemma":[0.98444957,0.011255339,0.0009795623,0.00065124343,0.0019509161,0.0007133076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062771086,0.0018249872,0.0012122258,0.001213948,0.0008824588,0.0020762673,0.001895173,0.0015633606,0.004581247],"category_scores_gemma":[0.038188607,0.0005856686,0.0011298308,0.00052064727,0.002985468,0.004152474,0.002477272,0.0034116097,0.00061332283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017399694,0.000081405036,0.0013310544,0.00030833267,0.00006271565,0.00022891194,0.00040826804,0.32911727,0.003963464,0.6472301,0.0014588216,0.015635723],"study_design_scores_gemma":[0.000018523891,0.000082844555,0.00018504249,0.000054702785,0.000013691121,0.00009324472,0.0000645204,0.8921351,0.0010635292,0.10521191,0.0010553045,0.000021510028],"about_ca_topic_score_codex":0.0018601312,"about_ca_topic_score_gemma":0.0012376898,"teacher_disagreement_score":0.0062771086,"about_ca_system_score_codex":0.0026213138,"about_ca_system_score_gemma":0.00169073,"threshold_uncertainty_score":0.033196926},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106712334,0.0003012079,0.88692755,0.00079770683,0.000036685473,0.00032336105,0.001850656,0.00037199928,0.0026784395],"genre_scores_gemma":[0.7678752,0.00068459834,0.21948777,0.00017749426,0.00008537141,0.0012772629,0.004086739,0.00010849095,0.0062170904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973822,0.0015325267,0.00010937939,0.0004994209,0.0002240017,0.0002524179],"domain_scores_gemma":[0.9844492,0.011651005,0.0020111825,0.0009350522,0.0006874768,0.00026596047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063925325,0.0009935574,0.0013047534,0.0019408043,0.00058851147,0.0020254354,0.0027525325,0.0019515137,0.0036379066],"category_scores_gemma":[0.02681551,0.0012346156,0.0013625304,0.002034841,0.0009968702,0.0024728044,0.0019051199,0.0025611608,0.00080798654],"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.00005921933,0.00012604766,0.01665025,0.000071102106,0.00011365097,0.000120587225,0.00019073366,0.8672455,0.00024514055,0.09524772,0.0020405967,0.017889565],"study_design_scores_gemma":[0.000016793414,0.000014577937,0.0013988722,0.000011903023,0.000014767441,0.00002279952,0.00003854502,0.97329897,0.00008669619,0.024298402,0.0007877949,0.000009748533],"about_ca_topic_score_codex":0.023793431,"about_ca_topic_score_gemma":0.024386048,"teacher_disagreement_score":0.023793431,"about_ca_system_score_codex":0.0021414012,"about_ca_system_score_gemma":0.0019793531,"threshold_uncertainty_score":0.047309875},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005908125,0.22107111,0.17954221,0.22893292,0.011582456,0.00018184105,0.0015180521,0.0004288053,0.35083443],"genre_scores_gemma":[0.34791926,0.39559188,0.0804555,0.028037585,0.09072952,0.0010696367,0.0013792843,0.00070593157,0.054111473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.97769153,0.012505656,0.0016876076,0.0009735199,0.0065696645,0.00057191326],"domain_scores_gemma":[0.9104316,0.068716966,0.0038750872,0.0018265066,0.013228591,0.0019211377],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.023618534,0.0014873482,0.0028154964,0.06235471,0.0030723978,0.024661139,0.0024332707,0.008211584,0.021453608],"category_scores_gemma":[0.074264,0.00072123966,0.0011616019,0.06347468,0.009312309,0.01418643,0.00424393,0.0039121546,0.0040344377],"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.000008976751,0.00004714798,0.0005327285,0.0009086867,0.000039073704,0.000066828645,0.00028617991,0.0007150524,0.00011013234,0.9254311,0.025116839,0.046737317],"study_design_scores_gemma":[0.000012385189,0.000023958197,0.0015927852,0.0019287907,0.0000397113,0.00021060515,0.001085568,0.0029345981,0.0002291362,0.77819365,0.21370888,0.00003999407],"about_ca_topic_score_codex":0.0018235276,"about_ca_topic_score_gemma":0.0014335432,"teacher_disagreement_score":0.9763815,"about_ca_system_score_codex":0.007768743,"about_ca_system_score_gemma":0.0055613955,"threshold_uncertainty_score":0.12490827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018250302,0.005135857,0.95983,0.0027736418,0.00035398282,0.00017097195,0.0003621424,0.00021247753,0.029335864],"genre_scores_gemma":[0.28355435,0.020340143,0.6658792,0.0021541752,0.0011553965,0.0016329074,0.0014475398,0.00030368974,0.02353258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953467,0.0028293184,0.00025393706,0.00059435645,0.000763023,0.00021261434],"domain_scores_gemma":[0.99615735,0.002715356,0.00029625086,0.0003785895,0.0003047459,0.00014769554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003370951,0.0021890367,0.0016257997,0.0024447609,0.0012777719,0.004936514,0.003377195,0.0031684313,0.010629494],"category_scores_gemma":[0.00678325,0.00070728397,0.002393101,0.0044529093,0.0046341657,0.005762046,0.002297044,0.0039051014,0.0023809355],"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.000019491006,0.000021501719,0.00011640947,0.00017112587,0.0000529272,0.00007870832,0.00012149091,0.056109693,0.00015554138,0.92295605,0.003319349,0.016877886],"study_design_scores_gemma":[0.000019420539,0.000023153827,0.000048703016,0.0000675155,0.000018705694,0.00006369886,0.000049280683,0.095226064,0.00009746871,0.8787621,0.025601208,0.000022724143],"about_ca_topic_score_codex":0.008425405,"about_ca_topic_score_gemma":0.0047683856,"teacher_disagreement_score":0.010629494,"about_ca_system_score_codex":0.004605878,"about_ca_system_score_gemma":0.0034879975,"threshold_uncertainty_score":0.035559237},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3300964,0.00455682,0.60819197,0.00256058,0.00024810736,0.00030886085,0.00035988961,0.00065084675,0.05302655],"genre_scores_gemma":[0.94712967,0.0022760273,0.044982847,0.00024940286,0.00008035562,0.00039736205,0.00021852048,0.00034300485,0.0043227235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974438,0.0014718476,0.00009517319,0.00023741178,0.0003842769,0.0003674704],"domain_scores_gemma":[0.900606,0.08864336,0.0026587555,0.0021548173,0.0038959824,0.0020410928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010463294,0.0013936629,0.001530955,0.0020317961,0.0013027764,0.0023540782,0.0018641675,0.0015333672,0.0049750013],"category_scores_gemma":[0.08077587,0.0005303209,0.0012759896,0.0009795798,0.003297443,0.0037150243,0.0024664223,0.0031839162,0.00055779074],"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.0004424791,0.00012833017,0.0040921886,0.00036898145,0.00011465787,0.00027882878,0.000779549,0.5150923,0.003201599,0.456891,0.0030344022,0.015575658],"study_design_scores_gemma":[0.00002640531,0.00010852361,0.00064831245,0.00009286199,0.000024595702,0.000106586784,0.0001428971,0.8971495,0.0007756794,0.09997833,0.00090566796,0.000040573894],"about_ca_topic_score_codex":0.003100105,"about_ca_topic_score_gemma":0.0012742085,"teacher_disagreement_score":0.010463294,"about_ca_system_score_codex":0.0021161726,"about_ca_system_score_gemma":0.0013051467,"threshold_uncertainty_score":0.05533588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005588727,0.000185614,0.9890592,0.00030612794,0.000069084985,0.00006559551,0.00006559144,0.00046518372,0.004194913],"genre_scores_gemma":[0.2744657,0.00018466778,0.717093,0.00046258277,0.00006005854,0.00034499395,0.00027808634,0.0004426866,0.006668311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.00021302408,0.00002749192,0.00018436207,0.00017991589,0.00007487539],"domain_scores_gemma":[0.9983053,0.0009842484,0.00014448012,0.00023376924,0.00024592018,0.00008625072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015160996,0.0009399067,0.0015814458,0.0010311592,0.0010261119,0.0015158043,0.0023946182,0.0020043754,0.007648233],"category_scores_gemma":[0.0051604677,0.00078889634,0.0011916892,0.0011748726,0.001379858,0.0018991946,0.0018098801,0.0017967408,0.0012005566],"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.00006352556,0.00005277998,0.00029444683,0.00008208894,0.000033740096,0.000036793197,0.00007847419,0.91565496,0.0012641376,0.032548137,0.0033250302,0.046565868],"study_design_scores_gemma":[0.0000066662324,0.000007734491,0.00002868518,0.0000037701047,0.0000023385037,0.0000060251155,0.0000063436614,0.9903909,0.00017863573,0.008672812,0.0006926729,0.0000033913811],"about_ca_topic_score_codex":0.009376875,"about_ca_topic_score_gemma":0.012542894,"teacher_disagreement_score":0.009376875,"about_ca_system_score_codex":0.0021305508,"about_ca_system_score_gemma":0.00199331,"threshold_uncertainty_score":0.02558589},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16310792,0.0011491884,0.7225857,0.0027752498,0.00013654586,0.00026588913,0.00044164722,0.0004119924,0.109125875],"genre_scores_gemma":[0.91104066,0.00051421975,0.079555556,0.00041476422,0.00011181777,0.0002000345,0.00028175776,0.00007763391,0.0078034345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908415,0.0035614695,0.0006509791,0.002422231,0.0017497196,0.00077417825],"domain_scores_gemma":[0.98675716,0.0063968995,0.0011038014,0.0034741848,0.001722245,0.000545737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009573888,0.0007658756,0.001320528,0.0015201813,0.0011239691,0.003439189,0.0012562398,0.0012658276,0.0040906915],"category_scores_gemma":[0.014514884,0.00049443304,0.0018575601,0.0011541938,0.009952216,0.008120452,0.004407221,0.0041980236,0.0006789597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039245373,0.000016243896,0.00019352099,0.00004425122,0.000017103423,0.000052170275,0.0001848151,0.0020671769,0.00059680705,0.99329597,0.00023644502,0.0032561913],"study_design_scores_gemma":[0.000014949788,0.000024709603,0.00013584671,0.000013008473,0.000010877499,0.000054187345,0.00006291521,0.0055752555,0.0005614419,0.9917854,0.0017522168,0.000009257498],"about_ca_topic_score_codex":0.0010037582,"about_ca_topic_score_gemma":0.00073546,"teacher_disagreement_score":0.009573888,"about_ca_system_score_codex":0.0020490696,"about_ca_system_score_gemma":0.0013392287,"threshold_uncertainty_score":0.05063218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936107,0.00010002848,0.0025880693,0.00012339541,0.0000021443448,0.000007601616,0.000013917828,0.0000031404788,0.0035510708],"genre_scores_gemma":[0.9994778,0.000024640007,0.00017516402,0.0000033800443,0.0000015412081,0.0000021103037,0.00000689702,5.82845e-7,0.00030783965],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988404,0.00049191,0.0000936958,0.00012253976,0.00026237173,0.00018920503],"domain_scores_gemma":[0.97676486,0.016801855,0.0033765067,0.0010694804,0.00094285375,0.0010444728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024774547,0.00015117969,0.0002975324,0.00090482086,0.0004015312,0.0021730557,0.00043074632,0.0007526453,0.0026413866],"category_scores_gemma":[0.021447448,0.00021893714,0.00019077587,0.0009763556,0.0014350319,0.003521328,0.0012688272,0.0005158448,0.0001195182],"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.001066029,0.00045706576,0.62828666,0.00029804328,0.00030481862,0.00053870917,0.002537539,0.07859033,0.011922061,0.19812329,0.00047403196,0.07740146],"study_design_scores_gemma":[0.00007645358,0.0007311965,0.62525356,0.00007377783,0.0002505595,0.0006423659,0.0050844774,0.12492499,0.0050722724,0.23567578,0.002167655,0.000046873505],"about_ca_topic_score_codex":0.0010143453,"about_ca_topic_score_gemma":0.0023746882,"teacher_disagreement_score":0.0026413866,"about_ca_system_score_codex":0.0014389388,"about_ca_system_score_gemma":0.00045815326,"threshold_uncertainty_score":0.013102174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09096058,0.00044220683,0.77137375,0.004025015,0.00013322562,0.00024619047,0.0012213868,0.0010547701,0.13054298],"genre_scores_gemma":[0.8218115,0.0006369217,0.1612999,0.00047074884,0.00010239787,0.00027058614,0.000378682,0.0003078243,0.014721344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948525,0.00013205387,0.000025080377,0.0000957785,0.00017073892,0.00009111087],"domain_scores_gemma":[0.997036,0.0016438192,0.00036245387,0.00040775168,0.00036964458,0.00018024808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007101061,0.00040922657,0.00041843773,0.0014057036,0.00073461205,0.0030706807,0.0013149086,0.0017304996,0.024558945],"category_scores_gemma":[0.0069527742,0.00037012927,0.0007616259,0.0009780457,0.0019416995,0.004789688,0.0014170111,0.0019878016,0.0028288593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000636975,0.00003831665,0.0007202821,0.00006344372,0.000010750677,0.0002357598,0.00028803753,0.011842273,0.0047251554,0.9731496,0.001854124,0.0070086042],"study_design_scores_gemma":[0.000034031447,0.000052096646,0.0007602261,0.000033040164,0.000013565438,0.00021635221,0.00010754376,0.08029251,0.0021066922,0.9087014,0.007656287,0.000026270793],"about_ca_topic_score_codex":0.0013438642,"about_ca_topic_score_gemma":0.0005353367,"teacher_disagreement_score":0.024558945,"about_ca_system_score_codex":0.0010810373,"about_ca_system_score_gemma":0.0005558024,"threshold_uncertainty_score":0.08215779},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049210228,0.00032099275,0.93504703,0.0017816315,0.00009301409,0.00018521928,0.00041158366,0.00041957718,0.012530748],"genre_scores_gemma":[0.9292576,0.00039803438,0.052385163,0.00039227956,0.00019916023,0.00035576514,0.00031377547,0.00011189343,0.01658633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924366,0.0037062366,0.00027588557,0.0017690734,0.0010238377,0.0007884023],"domain_scores_gemma":[0.9524643,0.03759409,0.00342704,0.003682167,0.0018327389,0.0009997615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008532661,0.0018850664,0.004400215,0.0015180889,0.0010485072,0.0037491962,0.0043489737,0.004429198,0.0077891843],"category_scores_gemma":[0.04917045,0.0011808702,0.0014967538,0.0011656116,0.0045085363,0.0056467257,0.00407795,0.0031641375,0.0018426487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053767604,0.0002644234,0.0016518846,0.00032567748,0.00036469524,0.00024036867,0.00015552882,0.45824873,0.0015888776,0.49850482,0.0045111245,0.033606093],"study_design_scores_gemma":[0.00006499401,0.0000749514,0.00038925436,0.00002171308,0.000031081203,0.000051186755,0.000029396882,0.69781363,0.00028298382,0.30059737,0.0006159337,0.00002752702],"about_ca_topic_score_codex":0.0031280082,"about_ca_topic_score_gemma":0.002333631,"teacher_disagreement_score":0.008532661,"about_ca_system_score_codex":0.003065762,"about_ca_system_score_gemma":0.0024629615,"threshold_uncertainty_score":0.045125544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3184116,0.0008184762,0.62984425,0.006780338,0.00010568989,0.00017722492,0.0006190784,0.00033573734,0.04290767],"genre_scores_gemma":[0.9706014,0.0005154566,0.02111251,0.00021743079,0.00005589876,0.00018437297,0.00012368787,0.000029920679,0.007159332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848217,0.0007256689,0.000055010205,0.0002686308,0.00028354564,0.00018503777],"domain_scores_gemma":[0.9932199,0.0043220194,0.0012865966,0.0004677563,0.000371238,0.00033263315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016373168,0.0006180509,0.0008464984,0.0010230127,0.0011650171,0.0023279462,0.0019395744,0.0022423228,0.0050942763],"category_scores_gemma":[0.011349519,0.00042078018,0.0006175896,0.0013871229,0.0019887364,0.0049398486,0.0018553962,0.001489075,0.0005404441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048550693,0.00004993437,0.0012301661,0.000049053335,0.000030550273,0.00026062294,0.00039835053,0.2696271,0.00091210485,0.7200912,0.001304903,0.005997409],"study_design_scores_gemma":[0.000030217652,0.000023134055,0.0003569262,0.00001550133,0.0000085527145,0.000057918354,0.00010390811,0.69143516,0.00016355648,0.30561548,0.0021705655,0.000019076435],"about_ca_topic_score_codex":0.0043902686,"about_ca_topic_score_gemma":0.0023478465,"teacher_disagreement_score":0.0050942763,"about_ca_system_score_codex":0.0026084525,"about_ca_system_score_gemma":0.0009709297,"threshold_uncertainty_score":0.018925726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61149544,0.00070463243,0.2920057,0.004545275,0.00018906612,0.00037772625,0.0005099615,0.00021535906,0.08995687],"genre_scores_gemma":[0.9821852,0.0001747191,0.005684253,0.00015183796,0.000032646945,0.00009989203,0.000050304705,0.0000097998945,0.011611418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869114,0.00047301254,0.000037605845,0.0002898986,0.00017694346,0.0003313807],"domain_scores_gemma":[0.996837,0.0021168394,0.00037086607,0.000120616,0.00019478404,0.00035988342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013876567,0.0012915597,0.0016140376,0.00048862176,0.00088627974,0.0026264475,0.0024737867,0.0039937175,0.007650648],"category_scores_gemma":[0.0050661406,0.0006236688,0.000918422,0.00048665836,0.0016081333,0.0028361413,0.0018406853,0.0015912796,0.0005657335],"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.0013836959,0.000835456,0.0050927727,0.00047999312,0.0002911433,0.0034636057,0.0008288631,0.47658932,0.007822353,0.47754842,0.003559649,0.022104714],"study_design_scores_gemma":[0.00029185516,0.00042176046,0.001529443,0.000035652876,0.00011026974,0.000399362,0.0003946237,0.8690632,0.0009126849,0.12394898,0.002804546,0.000087632696],"about_ca_topic_score_codex":0.0065311915,"about_ca_topic_score_gemma":0.0036609333,"teacher_disagreement_score":0.007650648,"about_ca_system_score_codex":0.0026379442,"about_ca_system_score_gemma":0.0011560417,"threshold_uncertainty_score":0.025593936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86043334,0.00031629473,0.103502706,0.003475904,0.000032956843,0.000121787794,0.00015036776,0.00009489909,0.031871792],"genre_scores_gemma":[0.995676,0.00008600312,0.0023587556,0.00011675094,0.000047199726,0.000061682746,0.000030022578,0.0000066665543,0.001616859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99405366,0.00302967,0.00019004084,0.0010869976,0.00082257995,0.00081692106],"domain_scores_gemma":[0.96928173,0.019547561,0.005673971,0.0024053087,0.0012734362,0.00181804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007808301,0.00036339255,0.00096114835,0.0014661868,0.0015429497,0.002875105,0.00094024616,0.001970343,0.0041862],"category_scores_gemma":[0.034482524,0.00026660113,0.0007696896,0.00081398885,0.005719073,0.0042852527,0.0037285874,0.0016564603,0.0003046301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028343187,0.00024052762,0.022279266,0.00013749281,0.00017625693,0.0005056397,0.0024630143,0.07957309,0.0017107748,0.8541522,0.0013349684,0.037143398],"study_design_scores_gemma":[0.000073365925,0.00012181568,0.0052481834,0.000023723871,0.000027692087,0.00017037684,0.00046718484,0.114506565,0.00026837928,0.87794214,0.0011218489,0.00002869543],"about_ca_topic_score_codex":0.0012160648,"about_ca_topic_score_gemma":0.0007698364,"teacher_disagreement_score":0.007808301,"about_ca_system_score_codex":0.0021594225,"about_ca_system_score_gemma":0.00063961436,"threshold_uncertainty_score":0.041294694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40081182,0.009729159,0.13677531,0.1327303,0.0018242161,0.00036894044,0.0015970384,0.00042556933,0.31573772],"genre_scores_gemma":[0.98479754,0.0008158081,0.0033236628,0.003218521,0.0004094414,0.00008981239,0.0001148097,0.000100123136,0.007130278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895745,0.004884874,0.0004530448,0.002073942,0.0015845952,0.0014290554],"domain_scores_gemma":[0.94305235,0.03569163,0.0074383435,0.0055758934,0.004391723,0.0038501117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017654996,0.000493557,0.0020271172,0.0008942556,0.0029242076,0.007460809,0.0023135298,0.0053547104,0.031996023],"category_scores_gemma":[0.07004453,0.00042048705,0.000768118,0.0009400836,0.0072226124,0.018341731,0.0037651437,0.005321195,0.0027534622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085734297,0.0001572034,0.0041728173,0.00035418425,0.00014989983,0.00014380274,0.0012765361,0.0021038807,0.0008191637,0.94384634,0.011804988,0.034313858],"study_design_scores_gemma":[0.00012560101,0.00012225067,0.0018250413,0.00009769938,0.000068877445,0.00009016185,0.0013033245,0.0049730837,0.00027225664,0.9860616,0.005030534,0.000029592704],"about_ca_topic_score_codex":0.0017802591,"about_ca_topic_score_gemma":0.002177276,"teacher_disagreement_score":0.031996023,"about_ca_system_score_codex":0.0024989913,"about_ca_system_score_gemma":0.0020396302,"threshold_uncertainty_score":0.107037306},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031258564,0.0001443903,0.9504262,0.00021329979,0.000024402629,0.0003044695,0.00020569946,0.00030772167,0.017115233],"genre_scores_gemma":[0.26382986,0.00032401207,0.7241996,0.00013476578,0.000034098834,0.00078978715,0.00073264627,0.00014060181,0.009814672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831474,0.00077790616,0.000085440304,0.00024949972,0.00037023672,0.00020214375],"domain_scores_gemma":[0.9977062,0.001775623,0.00012980487,0.00013082133,0.0001599134,0.000097582735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526446,0.0013666189,0.0012937944,0.0017387607,0.0011891259,0.0025076047,0.0017266547,0.0014777017,0.010555716],"category_scores_gemma":[0.0066923,0.0005818043,0.0010950821,0.0013891403,0.0016825045,0.003902995,0.0023013875,0.0015504158,0.0016239523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024597545,0.0002789785,0.0013275462,0.00044821692,0.00006716243,0.00021142214,0.00063237926,0.26941448,0.002222316,0.6051152,0.0042887894,0.11574765],"study_design_scores_gemma":[0.00006928243,0.00005923254,0.00014619762,0.000051017156,0.000013820403,0.00010241252,0.00018917934,0.48558673,0.0017068584,0.5077603,0.0042904275,0.000024538649],"about_ca_topic_score_codex":0.0016963691,"about_ca_topic_score_gemma":0.0023196386,"teacher_disagreement_score":0.010555716,"about_ca_system_score_codex":0.0011575293,"about_ca_system_score_gemma":0.0013923827,"threshold_uncertainty_score":0.035312355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1113679,0.00037116234,0.8338386,0.0017180698,0.000101423895,0.00024348781,0.0005595354,0.0002461985,0.05155359],"genre_scores_gemma":[0.8311261,0.00078096456,0.12065035,0.00030923408,0.00010234583,0.00049747736,0.00044562886,0.00007787463,0.046009973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850744,0.00070935005,0.00004868322,0.00032527975,0.00022960159,0.00017958498],"domain_scores_gemma":[0.9983859,0.00070265477,0.0002778938,0.00020582223,0.00018051587,0.00024718983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181675,0.000725521,0.0007591253,0.0008511377,0.0009198007,0.002141167,0.0023851458,0.0017678797,0.009721532],"category_scores_gemma":[0.0047458685,0.000476796,0.0007161027,0.001386027,0.0015988293,0.0047657364,0.0018675812,0.0012012824,0.0010637703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077354176,0.00006442678,0.00051154784,0.00006926772,0.00004546446,0.00027395212,0.0002524119,0.18030001,0.0016351363,0.80491495,0.0016890526,0.0101663815],"study_design_scores_gemma":[0.000066745066,0.00006877917,0.0002330396,0.000018867217,0.000022043418,0.00017078182,0.00011195276,0.5375909,0.00044989525,0.45040897,0.010834205,0.000023733362],"about_ca_topic_score_codex":0.003417419,"about_ca_topic_score_gemma":0.0029075227,"teacher_disagreement_score":0.009721532,"about_ca_system_score_codex":0.0015771225,"about_ca_system_score_gemma":0.00086263043,"threshold_uncertainty_score":0.032521844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24330184,0.0010514753,0.7479911,0.000916223,0.000073772084,0.0009044793,0.001076008,0.00040363826,0.0042815027],"genre_scores_gemma":[0.82071525,0.0004654099,0.17479527,0.0002647,0.0000720517,0.0022124466,0.00101144,0.00008714133,0.00037631934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95702964,0.036272462,0.0009039369,0.0027741042,0.0025741768,0.00044576006],"domain_scores_gemma":[0.6674243,0.30280194,0.0117749525,0.013817388,0.003537843,0.0006435181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04486573,0.001111089,0.002099732,0.0035218569,0.0010024479,0.0028801262,0.002517283,0.0016907542,0.0029054226],"category_scores_gemma":[0.21797028,0.0007886618,0.001838073,0.0028149423,0.0048011374,0.004496057,0.0020492247,0.0028016195,0.00021877915],"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.0017631135,0.001570091,0.06021303,0.0023427599,0.0025265263,0.0006038381,0.0029756955,0.2545844,0.008276619,0.5603821,0.004075255,0.10068663],"study_design_scores_gemma":[0.00022537264,0.00046195986,0.0136849275,0.00012516929,0.00017834378,0.00023752684,0.00038664512,0.644866,0.0019237649,0.33601603,0.001805376,0.00008886851],"about_ca_topic_score_codex":0.002544841,"about_ca_topic_score_gemma":0.001545983,"teacher_disagreement_score":0.04486573,"about_ca_system_score_codex":0.0029001918,"about_ca_system_score_gemma":0.0015219469,"threshold_uncertainty_score":0.23727548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036772467,0.0003407681,0.94439626,0.0014939226,0.00008167877,0.0003145823,0.00011759634,0.00012573112,0.016356956],"genre_scores_gemma":[0.8733288,0.0004925323,0.11240592,0.0003275112,0.00016163009,0.0007017724,0.000107716485,0.00007018062,0.012403811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911805,0.005700831,0.00037746347,0.0010718768,0.0010272912,0.0006420469],"domain_scores_gemma":[0.967902,0.026959112,0.0016269162,0.0012276095,0.0014772526,0.00080714934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008783471,0.0015561982,0.0029191857,0.0014452994,0.0011816774,0.0043788156,0.0027565171,0.003641382,0.006841296],"category_scores_gemma":[0.034405984,0.0012140065,0.0011300805,0.0015235767,0.0030386397,0.0052159973,0.0024964844,0.0024223526,0.00085933984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040607012,0.00021046701,0.00076282857,0.00034290968,0.00013589043,0.00024310523,0.0003800364,0.24266945,0.001354054,0.7230791,0.0023474412,0.028068652],"study_design_scores_gemma":[0.0002124284,0.00019033786,0.00015584442,0.000032480657,0.00004389962,0.00006759422,0.00005929352,0.40546754,0.00046731107,0.59211767,0.0011507039,0.000034854635],"about_ca_topic_score_codex":0.0017765819,"about_ca_topic_score_gemma":0.0012091007,"teacher_disagreement_score":0.008783471,"about_ca_system_score_codex":0.0026916233,"about_ca_system_score_gemma":0.0028104312,"threshold_uncertainty_score":0.046451986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001500024,0.10068915,0.09362095,0.0042484584,0.0027130765,0.00009861461,0.0009258832,0.00058572757,0.7956182],"genre_scores_gemma":[0.05604033,0.13311404,0.05824327,0.0025232225,0.003463979,0.00044483252,0.002076815,0.00062749564,0.7434661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999734,0.000053408196,0.000011865653,0.000053956494,0.00012251249,0.000024243585],"domain_scores_gemma":[0.99979204,0.0001005881,0.000012623056,0.000029314462,0.000047027046,0.000018344206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002752408,0.0012380081,0.0010483839,0.0012585393,0.00062261283,0.0027672576,0.0010385038,0.0009987117,0.043243006],"category_scores_gemma":[0.0009893153,0.00047960025,0.0003903132,0.002237405,0.0012722906,0.0031055654,0.0010281164,0.0022542258,0.015324432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007720718,0.000029430363,0.000059660662,0.00026595232,0.000014307065,0.000035286474,0.00012725945,0.0017822073,0.00036601207,0.70587265,0.17325854,0.118181],"study_design_scores_gemma":[0.0000048775337,0.000008283176,0.00015494067,0.00017474293,0.000005526601,0.00009412453,0.00004312061,0.0015367622,0.0001291612,0.42752317,0.57031584,0.000009474021],"about_ca_topic_score_codex":0.0020175674,"about_ca_topic_score_gemma":0.0031792177,"teacher_disagreement_score":0.043243006,"about_ca_system_score_codex":0.0013869426,"about_ca_system_score_gemma":0.001141352,"threshold_uncertainty_score":0.14466232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011842736,0.039609786,0.63964254,0.012677917,0.0019122319,0.00041275442,0.0017292026,0.0003496623,0.29182318],"genre_scores_gemma":[0.5877238,0.08641144,0.21115007,0.0049378737,0.0045537245,0.0020568462,0.002483068,0.00028907426,0.10039415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.00072722405,0.00010601961,0.0002616701,0.00036368187,0.0001503667],"domain_scores_gemma":[0.9985122,0.0009561534,0.00014032827,0.00014875544,0.00014946189,0.00009305345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010851341,0.001464039,0.0009486516,0.0017153576,0.0010670186,0.003347339,0.0012104685,0.0016897598,0.012297114],"category_scores_gemma":[0.0039462163,0.00037799106,0.0008772856,0.0022494735,0.0025271429,0.004719323,0.0017298952,0.001967282,0.0015204288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025783631,0.0000039582,0.000035266945,0.000066627246,0.000005642323,0.000024210267,0.00006242228,0.0029745363,0.000085843734,0.9904925,0.0023813692,0.0038649437],"study_design_scores_gemma":[0.0000072758517,0.000010113722,0.000110478766,0.00009022949,0.000006335008,0.000092608614,0.00006225107,0.009838347,0.000069912785,0.90665287,0.08305033,0.000009134808],"about_ca_topic_score_codex":0.0031689298,"about_ca_topic_score_gemma":0.00242483,"teacher_disagreement_score":0.012297114,"about_ca_system_score_codex":0.002138767,"about_ca_system_score_gemma":0.0010310689,"threshold_uncertainty_score":0.041137993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6089559,0.006034245,0.22103293,0.006789559,0.00018169227,0.0000757503,0.00034166314,0.0001142095,0.15647401],"genre_scores_gemma":[0.9844317,0.0010272823,0.0059899455,0.00017474219,0.000060028517,0.00002429923,0.00004191721,0.000014522719,0.008235554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982322,0.0005680997,0.00010293949,0.00034945444,0.00050650333,0.0002409499],"domain_scores_gemma":[0.99322355,0.003490694,0.0014490612,0.0008141919,0.00069330994,0.00032908845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022995512,0.0003937895,0.0007742683,0.0010962714,0.00083266327,0.0032585599,0.00060922885,0.0013728065,0.0073380354],"category_scores_gemma":[0.012150151,0.00037400305,0.00069738145,0.0011763244,0.003185462,0.0031566892,0.0023721028,0.0013403905,0.00070487807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016916728,0.00002700419,0.0032191526,0.00011876779,0.000047300542,0.0003346371,0.00051042874,0.015114515,0.0027292338,0.95199376,0.00081104797,0.024924964],"study_design_scores_gemma":[0.00002681771,0.0000475181,0.0037049458,0.000034421195,0.00002562478,0.00024102107,0.00020172028,0.015717942,0.0010861981,0.9751311,0.0037597355,0.000023007504],"about_ca_topic_score_codex":0.0012657245,"about_ca_topic_score_gemma":0.0008920013,"teacher_disagreement_score":0.0073380354,"about_ca_system_score_codex":0.002089835,"about_ca_system_score_gemma":0.0007890377,"threshold_uncertainty_score":0.024548233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19591238,0.0011812396,0.67208,0.009297094,0.00033053634,0.00051370903,0.0005265778,0.00028328112,0.11987516],"genre_scores_gemma":[0.9435237,0.00061267806,0.026858244,0.0004960461,0.00017331095,0.00034119142,0.00010646346,0.00003868658,0.027849585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909089,0.0048460923,0.0003300293,0.0013847024,0.0010959185,0.0014342027],"domain_scores_gemma":[0.98838973,0.0065450817,0.0012540044,0.001969758,0.00077724695,0.0010640584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072239526,0.0013560163,0.001612216,0.0009319076,0.0014334515,0.004457812,0.0023067445,0.0041487,0.012103709],"category_scores_gemma":[0.022436367,0.0007472553,0.0014876286,0.0011486964,0.002981298,0.003955071,0.0029890735,0.002408945,0.0020529637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004741496,0.00022602719,0.00240955,0.00019691141,0.00015214684,0.0010082349,0.0015478065,0.19675733,0.0012370979,0.76127833,0.0051098885,0.029602459],"study_design_scores_gemma":[0.00031709735,0.0002121629,0.00068781764,0.000075343014,0.00009567365,0.00031990578,0.00044130892,0.3137963,0.00074890023,0.66789323,0.015343723,0.00006851599],"about_ca_topic_score_codex":0.0033167421,"about_ca_topic_score_gemma":0.0020384407,"teacher_disagreement_score":0.012103709,"about_ca_system_score_codex":0.0025689735,"about_ca_system_score_gemma":0.0017841375,"threshold_uncertainty_score":0.040490925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.573543,0.002083575,0.28653276,0.018025706,0.00025374966,0.00014769346,0.00033528483,0.00017916903,0.11889907],"genre_scores_gemma":[0.99337727,0.00041815478,0.0030597802,0.00010687334,0.00008301955,0.000040344366,0.000019294737,0.000012294495,0.0028830126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841285,0.00093227025,0.000046698988,0.00023553552,0.00014366423,0.00022898485],"domain_scores_gemma":[0.98549104,0.010437197,0.0015720676,0.00058120186,0.0007878031,0.0011306345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003650901,0.0004309673,0.0008867782,0.0010982046,0.0014874565,0.005035762,0.0012831973,0.002700552,0.008722328],"category_scores_gemma":[0.018856093,0.00032630074,0.000613189,0.0007914037,0.0042610117,0.007312965,0.0022215692,0.0014502847,0.00044789724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014628861,0.000062153085,0.0017876215,0.00007299556,0.000050692764,0.00012309574,0.00023676288,0.048183724,0.0005913811,0.9409681,0.0016416524,0.0061356914],"study_design_scores_gemma":[0.00006525156,0.000056738372,0.00077151495,0.000032225496,0.000035120367,0.00005602016,0.00030760883,0.10791121,0.00023087357,0.88874,0.0017712812,0.000022087066],"about_ca_topic_score_codex":0.00268595,"about_ca_topic_score_gemma":0.0020751206,"teacher_disagreement_score":0.008722328,"about_ca_system_score_codex":0.0022892088,"about_ca_system_score_gemma":0.0017814822,"threshold_uncertainty_score":0.029179096},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07072255,0.0037408466,0.32072866,0.004974075,0.00049636804,0.00053974043,0.0010269764,0.00036064666,0.59741014],"genre_scores_gemma":[0.87342614,0.002840119,0.038927935,0.00075021834,0.00035810357,0.00059898704,0.00072388153,0.00006789247,0.08230685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954176,0.0018474167,0.00031753205,0.0007963923,0.001106435,0.0005146083],"domain_scores_gemma":[0.98441005,0.008589182,0.0019033382,0.0032873692,0.0012096127,0.00060038455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002785643,0.0011659159,0.0009581458,0.0019673437,0.0016612404,0.0058919704,0.0020558145,0.002804425,0.04258478],"category_scores_gemma":[0.020101484,0.0005437381,0.0008818179,0.0018532666,0.0024967787,0.008877604,0.006051161,0.002130286,0.0041414225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010905312,0.00008957488,0.0017324226,0.0003567039,0.000101562146,0.0005690832,0.00063661434,0.006096005,0.00087435986,0.9439653,0.004238819,0.0412305],"study_design_scores_gemma":[0.00007750466,0.00016192844,0.0011153053,0.000257297,0.000116932606,0.0013128067,0.0004774735,0.019157397,0.001547082,0.914009,0.06170756,0.00005975677],"about_ca_topic_score_codex":0.0009724165,"about_ca_topic_score_gemma":0.00078458147,"teacher_disagreement_score":0.04258478,"about_ca_system_score_codex":0.0012680159,"about_ca_system_score_gemma":0.0012154579,"threshold_uncertainty_score":0.14246029},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030998737,0.0025707888,0.91333294,0.0028031075,0.00033173859,0.00014090017,0.0001793573,0.00035590204,0.049286563],"genre_scores_gemma":[0.7628134,0.00393377,0.19524758,0.0018034981,0.0010499246,0.0017695897,0.00042494482,0.0004187263,0.03253853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968273,0.0010354213,0.00018710179,0.00066262664,0.0010196788,0.00026775853],"domain_scores_gemma":[0.99351317,0.004042731,0.00044583654,0.00050426635,0.0010737361,0.0004203308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005969011,0.0011148269,0.0014389622,0.0019720101,0.0020693077,0.0031611728,0.0022064887,0.0022445621,0.006559136],"category_scores_gemma":[0.015135504,0.0004729944,0.0017325076,0.0010370624,0.0043365886,0.008077305,0.0035668719,0.0033866274,0.0011395643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008977161,0.000011391981,0.00019318268,0.000077036624,0.000025204556,0.0000764353,0.00020477301,0.004895551,0.0005173366,0.98998356,0.0006008494,0.0034055226],"study_design_scores_gemma":[0.000019875535,0.00003768514,0.00019485003,0.000049954557,0.000015373585,0.00017687102,0.000060922637,0.06730103,0.0003883457,0.9247838,0.0069540055,0.000017268065],"about_ca_topic_score_codex":0.0016815356,"about_ca_topic_score_gemma":0.0006954263,"teacher_disagreement_score":0.006559136,"about_ca_system_score_codex":0.0022190635,"about_ca_system_score_gemma":0.0012958939,"threshold_uncertainty_score":0.031567574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36207277,0.0038228321,0.51349515,0.011430814,0.0002738041,0.00018414122,0.0006134102,0.00027256008,0.107834436],"genre_scores_gemma":[0.9847408,0.0006184551,0.0067933304,0.0001303051,0.00011680642,0.000083455496,0.00006532779,0.000023018189,0.007428606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956583,0.0020649855,0.00021320645,0.0008235224,0.00059818104,0.00064191065],"domain_scores_gemma":[0.95219064,0.03660793,0.004539403,0.002888417,0.001205281,0.0025684356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007505852,0.00064790866,0.0015050174,0.0014583715,0.0011957843,0.0059289304,0.0016186706,0.002704567,0.0121256625],"category_scores_gemma":[0.03826644,0.0005438692,0.0006835226,0.0016777192,0.005472367,0.008693338,0.0030387552,0.0026616696,0.0006813928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021869347,0.000098909804,0.0013950526,0.00007392567,0.00005670176,0.000081422615,0.00022461468,0.01580196,0.00030176793,0.96805257,0.0010622565,0.012632215],"study_design_scores_gemma":[0.000043657783,0.00003057828,0.00054865377,0.00001539966,0.000014589411,0.000027450875,0.00008126308,0.014393934,0.00010166462,0.98387074,0.0008552921,0.000016728662],"about_ca_topic_score_codex":0.002071201,"about_ca_topic_score_gemma":0.0018632944,"teacher_disagreement_score":0.0121256625,"about_ca_system_score_codex":0.002845597,"about_ca_system_score_gemma":0.0022366862,"threshold_uncertainty_score":0.040564418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05213045,0.0029136748,0.9156486,0.0066284677,0.0001344378,0.00013565006,0.0002690065,0.00014040832,0.021999383],"genre_scores_gemma":[0.89132935,0.00349788,0.099208064,0.0005769837,0.00029705334,0.0003188705,0.00014178673,0.000043321095,0.0045866366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99432904,0.0032542772,0.00020078526,0.0011008773,0.0007697843,0.00034526],"domain_scores_gemma":[0.9755617,0.021359676,0.0014587594,0.00075590797,0.0004799821,0.00038398203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005157592,0.00096312835,0.0011628257,0.0013430268,0.0012427842,0.004374855,0.0015606082,0.0025218378,0.0029979455],"category_scores_gemma":[0.020110203,0.00080514356,0.001110499,0.0015420928,0.00574016,0.005672702,0.0028817046,0.0021883212,0.00035701506],"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.000049132293,0.00005348224,0.0015173937,0.00023188218,0.00010540858,0.00027575536,0.0007829761,0.14569047,0.0009477675,0.8300432,0.001198142,0.019104322],"study_design_scores_gemma":[0.000012915219,0.00002183547,0.00047634236,0.000041075025,0.000017132026,0.000060273916,0.00014927187,0.21361575,0.00027134584,0.7830554,0.0022536027,0.000025000993],"about_ca_topic_score_codex":0.0038136805,"about_ca_topic_score_gemma":0.0029206048,"teacher_disagreement_score":0.005157592,"about_ca_system_score_codex":0.0020868867,"about_ca_system_score_gemma":0.0012704815,"threshold_uncertainty_score":0.027276278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8086038,0.0010648501,0.14028004,0.006713694,0.000116643765,0.00009471465,0.00014790798,0.000107337844,0.042871065],"genre_scores_gemma":[0.9944214,0.00029743707,0.002590649,0.00007105818,0.00006190621,0.000024574201,0.0000135285445,0.000009088596,0.0025103542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987469,0.0006184477,0.00004462303,0.00022823198,0.00011470415,0.0002471224],"domain_scores_gemma":[0.9894861,0.0066893124,0.0021990978,0.000423967,0.00040584628,0.00079570647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024552834,0.0006279219,0.0008867588,0.0006674926,0.00093438104,0.0027635652,0.0008775101,0.0022217701,0.0046014097],"category_scores_gemma":[0.012215586,0.00043028587,0.0007635226,0.00044424483,0.0032479018,0.0037185699,0.0012238462,0.0017146579,0.00030455494],"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.00094725075,0.0003938995,0.009435529,0.00018535511,0.0001802829,0.0013193019,0.0015925264,0.28339362,0.005779998,0.6650556,0.0028327783,0.02888392],"study_design_scores_gemma":[0.00013966106,0.00030542185,0.0052299355,0.000032978074,0.0001020264,0.00022873208,0.00083320425,0.5921145,0.001044848,0.3974948,0.002389702,0.000084093044],"about_ca_topic_score_codex":0.0033993884,"about_ca_topic_score_gemma":0.0016330765,"teacher_disagreement_score":0.0046014097,"about_ca_system_score_codex":0.0020349757,"about_ca_system_score_gemma":0.00078094477,"threshold_uncertainty_score":0.015393257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04046916,0.0025796306,0.122588344,0.0066216607,0.00022661177,0.00018203071,0.001036418,0.0002899148,0.82600635],"genre_scores_gemma":[0.8480081,0.004183901,0.021032728,0.00059230847,0.00017322028,0.00032580417,0.0006922807,0.000056230325,0.124935366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844617,0.0005414407,0.000060019902,0.0003664039,0.00037817308,0.00020784946],"domain_scores_gemma":[0.9982651,0.0005281954,0.00033306962,0.00033046753,0.00027410573,0.00026909285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010939159,0.00044853787,0.00044734505,0.0012664371,0.0010961159,0.0042313724,0.0013143577,0.0017774123,0.04570158],"category_scores_gemma":[0.0033355358,0.00025979406,0.00050400366,0.0025126452,0.0015438279,0.00401898,0.0022472003,0.0009985608,0.0049273735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028332339,0.000030509484,0.0007463367,0.000069328395,0.000014494831,0.00011119748,0.00009470918,0.023320701,0.0002658354,0.9452648,0.0069684596,0.023085281],"study_design_scores_gemma":[0.000060516235,0.00007342787,0.0014487322,0.00015513551,0.000034646124,0.00032079226,0.00041045784,0.05450224,0.0009858818,0.6439489,0.29802632,0.000032835655],"about_ca_topic_score_codex":0.0027505883,"about_ca_topic_score_gemma":0.0014872262,"teacher_disagreement_score":0.04570158,"about_ca_system_score_codex":0.0022852784,"about_ca_system_score_gemma":0.0016187069,"threshold_uncertainty_score":0.15288705},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110641964,0.007673733,0.4076775,0.037461843,0.0016496674,0.00015420683,0.00079122477,0.00032718052,0.4336227],"genre_scores_gemma":[0.8721328,0.0030611027,0.05857001,0.0026801713,0.0010500757,0.00029579637,0.000241575,0.00018408544,0.061784472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975434,0.0009356661,0.0001824033,0.0004036846,0.0006461359,0.00028861593],"domain_scores_gemma":[0.98945516,0.007520549,0.00048630184,0.0013165434,0.00069696666,0.0005244074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005819295,0.0006884181,0.0014016185,0.0020544445,0.0028843281,0.006813292,0.0017894948,0.005212616,0.01395997],"category_scores_gemma":[0.02816567,0.0005789221,0.0012700193,0.0025210956,0.008931026,0.021341803,0.0034369149,0.006930278,0.0011730833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006037935,0.000002981251,0.000015913014,0.000009876376,0.0000024526328,0.000013843607,0.000059902988,0.00028517787,0.000030707353,0.99767953,0.00068975246,0.0012038851],"study_design_scores_gemma":[0.0000030809067,9.153658e-7,0.000007737498,0.0000033379708,8.693163e-7,0.000013581805,0.0000107108835,0.00055106834,0.000010333685,0.99860674,0.00078958925,0.000001948496],"about_ca_topic_score_codex":0.0013826513,"about_ca_topic_score_gemma":0.0008880059,"teacher_disagreement_score":0.01395997,"about_ca_system_score_codex":0.002541469,"about_ca_system_score_gemma":0.0018016676,"threshold_uncertainty_score":0.046700776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2774155,0.0009193717,0.68487847,0.004641036,0.000092616945,0.00012894336,0.00038560817,0.00012221123,0.03141624],"genre_scores_gemma":[0.95870477,0.00056127756,0.036032755,0.0002446525,0.00012486824,0.00014362737,0.00018522142,0.00003935611,0.0039634937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709964,0.0013905126,0.00011654816,0.00040483402,0.0007137759,0.000274644],"domain_scores_gemma":[0.985104,0.01225042,0.0009114149,0.0007557416,0.00058851775,0.00039000402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029209894,0.0006164314,0.0012132967,0.0011818863,0.0011765352,0.003626291,0.0017334677,0.0019025719,0.0037809147],"category_scores_gemma":[0.015942551,0.0004742463,0.0009026204,0.0011946071,0.0044094687,0.007427238,0.002381452,0.0031644548,0.00023037576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029302606,0.00002087475,0.0002986899,0.000041275514,0.000016131633,0.000029203788,0.000088929075,0.05604909,0.00024147483,0.940379,0.00041388036,0.0023921016],"study_design_scores_gemma":[0.0000104417095,0.0000099584,0.00010429572,0.000006365157,0.000003844152,0.00001390131,0.00003037194,0.20667104,0.000121242156,0.7926234,0.0003984481,0.0000067998258],"about_ca_topic_score_codex":0.0027899235,"about_ca_topic_score_gemma":0.001945529,"teacher_disagreement_score":0.0037809147,"about_ca_system_score_codex":0.0030619113,"about_ca_system_score_gemma":0.0015352374,"threshold_uncertainty_score":0.022215784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7543295,0.00056072103,0.0533433,0.016238485,0.000075226606,0.0001012893,0.00006537323,0.000018619217,0.17526743],"genre_scores_gemma":[0.9976299,0.00008710298,0.0011260296,0.00010598759,0.0000052878136,0.0000117391255,0.000003668337,0.0000018020706,0.0010286017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989328,0.00065500697,0.000026874011,0.000061051534,0.0000862123,0.00023804004],"domain_scores_gemma":[0.99873906,0.0007327665,0.00018728801,0.000046163448,0.00007434933,0.0002204924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017941822,0.00024152,0.0003747029,0.0005942052,0.0029482814,0.0055570826,0.0008813638,0.0022289813,0.0040682806],"category_scores_gemma":[0.0037813527,0.00026586503,0.00038853087,0.0006725137,0.0070161624,0.005852798,0.002711984,0.0020592355,0.00014144601],"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.000067798894,0.00003608947,0.0015560988,0.000035434598,0.000029096494,0.00027427514,0.004234266,0.0139946155,0.0003303019,0.9751764,0.0005607207,0.003704924],"study_design_scores_gemma":[0.0000318382,0.000045544053,0.0024285333,0.00005927943,0.000034704306,0.00010800245,0.022946069,0.046308275,0.00016940368,0.9228819,0.00495391,0.000032472537],"about_ca_topic_score_codex":0.014415928,"about_ca_topic_score_gemma":0.021088345,"teacher_disagreement_score":0.014415928,"about_ca_system_score_codex":0.0034270415,"about_ca_system_score_gemma":0.0024959429,"threshold_uncertainty_score":0.028663993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123620495,0.00064126315,0.67206764,0.0059239687,0.00033992447,0.00018822069,0.00046639075,0.00016968892,0.19658244],"genre_scores_gemma":[0.9033416,0.00047374723,0.07066239,0.0007802626,0.00017433462,0.00019192087,0.00020862617,0.000056566223,0.024110595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968761,0.0012368854,0.00019078083,0.00047613474,0.00060999463,0.0006101407],"domain_scores_gemma":[0.99727434,0.0015698597,0.00020330698,0.00038717999,0.00034711589,0.00021813279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031869386,0.0009880522,0.0013302155,0.0010425578,0.0019820349,0.0038142658,0.0013422761,0.002448866,0.0041984883],"category_scores_gemma":[0.0066484814,0.00037503205,0.0016267566,0.0009771981,0.0052355826,0.0099549,0.0032106172,0.00353018,0.00066929817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000599851,0.0000041379785,0.000027526701,0.000004779971,0.000001984593,0.000016418175,0.000050425184,0.0006223535,0.000049938622,0.9983694,0.00018128025,0.0006657026],"study_design_scores_gemma":[0.0000066748385,0.0000075884222,0.000026122361,0.0000067749365,0.0000035121136,0.000021507289,0.000030116385,0.004950903,0.000121415695,0.99297935,0.0018403424,0.0000056341087],"about_ca_topic_score_codex":0.0030211492,"about_ca_topic_score_gemma":0.0024720104,"teacher_disagreement_score":0.0041984883,"about_ca_system_score_codex":0.0027625798,"about_ca_system_score_gemma":0.0014921416,"threshold_uncertainty_score":0.020044029},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86657643,0.0002816028,0.10436053,0.002403022,0.000045885907,0.00009131526,0.00010150296,0.00005276124,0.026087083],"genre_scores_gemma":[0.99533796,0.000118546865,0.0025744098,0.000068877336,0.000022815284,0.000032002234,0.000012719174,0.0000060091093,0.0018266133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660385,0.002343223,0.000117526746,0.00033508748,0.00020881354,0.00039150036],"domain_scores_gemma":[0.9701403,0.024252318,0.002907933,0.0008892896,0.00050418096,0.0013060047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005976465,0.00049753254,0.0015893324,0.0006189467,0.0009444175,0.0033363665,0.0011125919,0.0024263854,0.005959995],"category_scores_gemma":[0.027982619,0.0005446175,0.0005550118,0.00060584006,0.0026421011,0.0043538576,0.0018116918,0.0019260762,0.00034910627],"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.00048966013,0.00029355675,0.011064224,0.00027524921,0.00019085166,0.0005278894,0.0012805852,0.04716665,0.0026655574,0.9214193,0.0013346339,0.013291765],"study_design_scores_gemma":[0.00019374983,0.00023017688,0.0070380005,0.00004339335,0.00011079792,0.00029280977,0.0007211518,0.16015787,0.0004916565,0.8294371,0.0012043522,0.00007903447],"about_ca_topic_score_codex":0.0011973024,"about_ca_topic_score_gemma":0.0010546282,"teacher_disagreement_score":0.005976465,"about_ca_system_score_codex":0.00086122233,"about_ca_system_score_gemma":0.0007710926,"threshold_uncertainty_score":0.031606972},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28187406,0.0045955833,0.31834337,0.030966986,0.0012439889,0.0003097289,0.0002566133,0.00040435808,0.36200538],"genre_scores_gemma":[0.9756353,0.00044390038,0.008472977,0.0006554675,0.0003434578,0.000082418665,0.000021681863,0.000024542378,0.014320284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99325573,0.0037532968,0.00025163213,0.0007727173,0.0014192326,0.0005473607],"domain_scores_gemma":[0.93938935,0.050325837,0.0031420738,0.0048687253,0.0017144753,0.00055951136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005958727,0.00093241164,0.0015073115,0.0013653517,0.0009596577,0.004674196,0.0010277124,0.0049731038,0.010714274],"category_scores_gemma":[0.051100276,0.00069171685,0.0008198059,0.00095484947,0.0036700934,0.005331621,0.0021189193,0.0041028373,0.00096930994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017447441,0.00010034685,0.00056167465,0.00023384091,0.00008501655,0.00017166021,0.00036292066,0.011381551,0.0006295973,0.96285784,0.0028530338,0.02058811],"study_design_scores_gemma":[0.000073936,0.000058252273,0.00033483433,0.00003178098,0.000033906777,0.00013498373,0.000074327094,0.027872575,0.00029718704,0.96945816,0.0016131328,0.000016971595],"about_ca_topic_score_codex":0.00050795526,"about_ca_topic_score_gemma":0.0003362656,"teacher_disagreement_score":0.010714274,"about_ca_system_score_codex":0.0014337158,"about_ca_system_score_gemma":0.00097132905,"threshold_uncertainty_score":0.035842776},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06055895,0.0011762202,0.42833632,0.023927996,0.0006927764,0.0004781345,0.0011426512,0.00031402402,0.4833729],"genre_scores_gemma":[0.91639256,0.00075183663,0.044190105,0.0025172436,0.00071713014,0.00079811446,0.00049853453,0.000107855354,0.034026686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98686635,0.0035627545,0.0010412966,0.0035028628,0.0034059677,0.0016206689],"domain_scores_gemma":[0.96564376,0.016248425,0.0020181332,0.010046651,0.0051638107,0.0008792633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008073699,0.0011616793,0.0034583567,0.0019040701,0.0027803774,0.007289157,0.0032513724,0.006422848,0.013238977],"category_scores_gemma":[0.038675006,0.0011195291,0.0030175564,0.001434208,0.008454468,0.011247848,0.0040215557,0.008185323,0.0032731504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019229648,0.000018244538,0.00014624953,0.000025518013,0.000031466097,0.00005195066,0.000116573836,0.0008897811,0.0000763894,0.9954074,0.0014360298,0.001781042],"study_design_scores_gemma":[0.00001536973,0.0000070252418,0.000083689265,0.000013747412,0.000012002512,0.00006282411,0.000041678257,0.0026495599,0.000080717546,0.99512935,0.0018966906,0.0000074147156],"about_ca_topic_score_codex":0.0020139646,"about_ca_topic_score_gemma":0.001062274,"teacher_disagreement_score":0.013238977,"about_ca_system_score_codex":0.002786565,"about_ca_system_score_gemma":0.0038278787,"threshold_uncertainty_score":0.044288754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04666252,0.00027569622,0.8997635,0.0019493517,0.0002478552,0.00018673726,0.0002707859,0.00028985832,0.050353546],"genre_scores_gemma":[0.87703454,0.00046388037,0.09144061,0.00061353855,0.0002504025,0.00030104173,0.00012898444,0.00012776421,0.029639222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985103,0.00074420613,0.00006668851,0.00030200658,0.00022263343,0.00015421616],"domain_scores_gemma":[0.9978871,0.0011051359,0.00021818854,0.00034251093,0.0002552435,0.00019187614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108007,0.0007848981,0.0013551816,0.0007153357,0.0008492845,0.0019810267,0.002555284,0.002018917,0.013106566],"category_scores_gemma":[0.008042506,0.0004783985,0.0014170106,0.0009082414,0.0023615484,0.004097856,0.0027749294,0.002423248,0.0012630046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039325914,0.000029602885,0.00008704814,0.000044315868,0.000024191628,0.00007134728,0.00008694792,0.020403417,0.00081990624,0.973597,0.0009880096,0.003808866],"study_design_scores_gemma":[0.000022280336,0.00002945841,0.00007193806,0.000009998642,0.000008114262,0.00005313599,0.000028852011,0.13706897,0.0001675129,0.86145914,0.0010648281,0.000015769094],"about_ca_topic_score_codex":0.0013561938,"about_ca_topic_score_gemma":0.0007116172,"teacher_disagreement_score":0.013106566,"about_ca_system_score_codex":0.0016949712,"about_ca_system_score_gemma":0.0012122067,"threshold_uncertainty_score":0.043845773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7738591,0.0043004653,0.04531101,0.054897837,0.00037638177,0.0002783843,0.000822491,0.0002702654,0.11988406],"genre_scores_gemma":[0.990158,0.0004755922,0.0031693317,0.0016395247,0.000085752086,0.000022258322,0.00007284955,0.00002235746,0.0043543247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666566,0.0010072831,0.00021415066,0.0006735391,0.00083223905,0.00060716615],"domain_scores_gemma":[0.96971387,0.013238776,0.010555084,0.0024147637,0.0021444566,0.001932971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005304986,0.00046840528,0.001120791,0.0008974873,0.0014613506,0.0061276723,0.00079550897,0.004013839,0.022121416],"category_scores_gemma":[0.02768692,0.00038755094,0.00076788414,0.0008907528,0.0030324734,0.0055605914,0.0021250877,0.0024633093,0.0024379895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031938525,0.0014156032,0.18540692,0.0027271833,0.0009709902,0.0033953488,0.0058515365,0.017255506,0.022715488,0.38778326,0.039044715,0.33023965],"study_design_scores_gemma":[0.000991872,0.003035513,0.20956133,0.0008259174,0.0009269351,0.005184291,0.013235645,0.04881393,0.015969947,0.6352608,0.06562413,0.0005695719],"about_ca_topic_score_codex":0.002702388,"about_ca_topic_score_gemma":0.0022578838,"teacher_disagreement_score":0.022121416,"about_ca_system_score_codex":0.0017127239,"about_ca_system_score_gemma":0.001172431,"threshold_uncertainty_score":0.07400358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86197644,0.00075295346,0.10680262,0.0035894497,0.00013948357,0.000120886696,0.00023843137,0.00021836002,0.02616146],"genre_scores_gemma":[0.9924843,0.00013545675,0.003296775,0.00007047195,0.000054362223,0.00003688962,0.000039367453,0.00001693795,0.0038655868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982816,0.0008046505,0.000089025285,0.00029870216,0.00024100802,0.0002850138],"domain_scores_gemma":[0.9603064,0.03356306,0.0024241356,0.0015779841,0.0009663337,0.0011620764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033892067,0.00036645468,0.0019439037,0.0011838118,0.0014528906,0.003237663,0.0011008679,0.002465675,0.0075122872],"category_scores_gemma":[0.024512516,0.0007809697,0.0009267309,0.0014239162,0.0020211393,0.0050264625,0.0020573097,0.0017360598,0.00043969054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009603822,0.00047489445,0.012058512,0.0005057549,0.00030599252,0.0019074716,0.0020864191,0.21828744,0.0030847334,0.71228844,0.00855398,0.03948598],"study_design_scores_gemma":[0.00008171989,0.00015600836,0.0052365307,0.000046112902,0.000069945,0.00021794444,0.00080900226,0.38991237,0.00047423277,0.60176885,0.0011753812,0.000051880954],"about_ca_topic_score_codex":0.0029733472,"about_ca_topic_score_gemma":0.002559154,"teacher_disagreement_score":0.0075122872,"about_ca_system_score_codex":0.0013783494,"about_ca_system_score_gemma":0.0007146468,"threshold_uncertainty_score":0.025131166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23602615,0.0004558479,0.7372712,0.0020941766,0.00006266568,0.00017816004,0.00085212267,0.00024152249,0.022818198],"genre_scores_gemma":[0.92704576,0.00024218035,0.06773627,0.00037479916,0.000063036896,0.0003225823,0.0005586848,0.00007532904,0.0035814783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98970264,0.0049045812,0.0006394922,0.002447796,0.0013676421,0.0009378678],"domain_scores_gemma":[0.95007366,0.03155752,0.009006833,0.0070358193,0.0014665172,0.0008595785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014577338,0.001161702,0.0024590713,0.0018901295,0.0014088616,0.0036734096,0.003979056,0.002186162,0.0059108445],"category_scores_gemma":[0.06984967,0.0014374555,0.002722607,0.001224673,0.004575052,0.0059741535,0.005107697,0.005856131,0.00042901764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024252955,0.0001163279,0.004028506,0.0001855245,0.00017241409,0.00060478726,0.0012718462,0.15680565,0.000976979,0.82057786,0.0016060455,0.013411516],"study_design_scores_gemma":[0.00004652901,0.00007767421,0.0017747083,0.00007024445,0.000044982,0.00018928235,0.00028939618,0.29000622,0.00054712483,0.70470446,0.0022039805,0.00004541516],"about_ca_topic_score_codex":0.0024445052,"about_ca_topic_score_gemma":0.0019394166,"teacher_disagreement_score":0.014577338,"about_ca_system_score_codex":0.0029275666,"about_ca_system_score_gemma":0.001257216,"threshold_uncertainty_score":0.0770933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036312763,0.0007088364,0.9571548,0.0014761153,0.000058808197,0.000056889643,0.00012286146,0.00009316719,0.0040157437],"genre_scores_gemma":[0.92241955,0.0013198942,0.06968128,0.00037838097,0.00020620691,0.000299591,0.00017843493,0.00008497141,0.005431674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99448216,0.0034054706,0.00020165407,0.00065748644,0.00073865894,0.00051454746],"domain_scores_gemma":[0.947986,0.04181638,0.004122071,0.0025610917,0.0025184632,0.0009958241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017063918,0.0011936352,0.002352059,0.0022250072,0.0006412297,0.0028153975,0.0029459344,0.0028443157,0.0033884596],"category_scores_gemma":[0.056784242,0.0009767723,0.001895542,0.000812789,0.0061094593,0.006780796,0.003291435,0.00498497,0.00034775815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056901583,0.00003747764,0.0015746558,0.00015762763,0.00011682063,0.00019457513,0.0002373236,0.23917918,0.0005079899,0.7527454,0.00051494397,0.0046772147],"study_design_scores_gemma":[0.00001407462,0.000049208713,0.00049328315,0.000060763723,0.000019299854,0.000038870796,0.00003553875,0.5788227,0.00027832703,0.41968396,0.00047844212,0.000025513908],"about_ca_topic_score_codex":0.0019449317,"about_ca_topic_score_gemma":0.0010624405,"teacher_disagreement_score":0.017063918,"about_ca_system_score_codex":0.0030897243,"about_ca_system_score_gemma":0.0013974833,"threshold_uncertainty_score":0.0902437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067354955,0.006673919,0.5386084,0.029158419,0.003628526,0.00050029886,0.003388368,0.0022365106,0.3484507],"genre_scores_gemma":[0.674052,0.0076842275,0.19682509,0.010951507,0.0072523477,0.0019818968,0.0048712716,0.0027652984,0.09361627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916536,0.002377,0.0002598713,0.0017162748,0.0022093854,0.0017838156],"domain_scores_gemma":[0.93273145,0.05427473,0.0013502815,0.0056455815,0.0031723494,0.0028255675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071920236,0.0036806853,0.006115033,0.0042858226,0.0048593795,0.010684142,0.011353367,0.008372884,0.055576876],"category_scores_gemma":[0.0527676,0.0020666164,0.005035872,0.0070383926,0.008474098,0.028494084,0.010339892,0.020377671,0.010359129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007226102,0.0004065222,0.0008606591,0.00070628175,0.00011923497,0.0001860493,0.0005000492,0.031096958,0.0018320323,0.8657133,0.06110827,0.036747996],"study_design_scores_gemma":[0.00008919152,0.000049802024,0.00028572197,0.0001172454,0.000084970816,0.00009111153,0.000068645895,0.06874297,0.00047356362,0.9230703,0.006882511,0.000043979315],"about_ca_topic_score_codex":0.004496817,"about_ca_topic_score_gemma":0.0056324517,"teacher_disagreement_score":0.055576876,"about_ca_system_score_codex":0.007969071,"about_ca_system_score_gemma":0.0043515717,"threshold_uncertainty_score":0.18592316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40021864,0.0022583234,0.30811104,0.007004274,0.00027002324,0.00008146484,0.00015411997,0.00005881575,0.2818433],"genre_scores_gemma":[0.9780121,0.00040948787,0.0068644695,0.0001550099,0.00010770306,0.00003506086,0.000022731163,0.000008508348,0.014384903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823296,0.0008998149,0.00007895744,0.00013715088,0.0004386381,0.00021239529],"domain_scores_gemma":[0.99611366,0.0026073991,0.00046126655,0.00016896374,0.00035058512,0.00029821382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021434624,0.0004319732,0.00046309666,0.00084661046,0.00066633645,0.002879743,0.0003835661,0.00072082225,0.007604736],"category_scores_gemma":[0.008090389,0.00019621893,0.00039918436,0.00074597955,0.0018854521,0.0022973302,0.0014045688,0.0014193564,0.00036116148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046180503,0.000037767924,0.0011245036,0.00004139009,0.000023978542,0.000070340546,0.0002769953,0.0025327972,0.00043608452,0.9820877,0.00070891797,0.012613321],"study_design_scores_gemma":[0.0000130146,0.00002160076,0.00090580655,0.000012763898,0.000011734053,0.000082292936,0.00017866318,0.004782978,0.00008565725,0.99178517,0.0021116894,0.000008647422],"about_ca_topic_score_codex":0.0005637519,"about_ca_topic_score_gemma":0.0006084411,"teacher_disagreement_score":0.007604736,"about_ca_system_score_codex":0.0008168245,"about_ca_system_score_gemma":0.00053016125,"threshold_uncertainty_score":0.025440395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31165558,0.0006519788,0.61057484,0.0023204063,0.0001528993,0.00024303587,0.0005128007,0.0001984738,0.073690094],"genre_scores_gemma":[0.96483296,0.00030552832,0.02145743,0.00019152522,0.00004098901,0.00028829812,0.00013521568,0.000020637159,0.012727459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992077,0.00031290564,0.00003776863,0.00017526688,0.000105676525,0.00016077828],"domain_scores_gemma":[0.99912804,0.000533012,0.00011645883,0.000025214877,0.00009487487,0.00010229073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007695566,0.0008747861,0.001094411,0.00046938437,0.000954377,0.0014678031,0.0011451893,0.0019402103,0.004886873],"category_scores_gemma":[0.0028350872,0.00032366414,0.000624226,0.00035794987,0.0011233316,0.0015366612,0.0017248933,0.001018257,0.0003750115],"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.0003733484,0.00015742084,0.0019518303,0.00034872355,0.00013215582,0.0007536686,0.00047586148,0.5596877,0.0045488416,0.41306874,0.0044394922,0.0140622575],"study_design_scores_gemma":[0.00010460884,0.00010750973,0.0004073708,0.00002861478,0.000021452748,0.00008038381,0.00016067772,0.8238501,0.0005092684,0.17317022,0.0015294568,0.000030404874],"about_ca_topic_score_codex":0.005674262,"about_ca_topic_score_gemma":0.0038758786,"teacher_disagreement_score":0.005674262,"about_ca_system_score_codex":0.0015559825,"about_ca_system_score_gemma":0.0013463976,"threshold_uncertainty_score":0.016348183},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03586284,0.00015092613,0.9459358,0.00041502772,0.000063199346,0.00012895615,0.00044843837,0.00029464133,0.016700124],"genre_scores_gemma":[0.55540144,0.00034860015,0.43434748,0.00038009594,0.000091288915,0.0003820406,0.00083731965,0.00010234389,0.008109371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712104,0.0012620793,0.00039407212,0.0005184512,0.00045267775,0.00025168993],"domain_scores_gemma":[0.99786407,0.0010988123,0.00016841611,0.00041086567,0.00034810524,0.00010971563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027372972,0.00052867335,0.0006056749,0.0012066046,0.00075198006,0.003204344,0.00081707665,0.00077799,0.004662889],"category_scores_gemma":[0.003661516,0.00044653768,0.0012132186,0.0010971084,0.002182136,0.005715603,0.001854622,0.0013546138,0.0006472008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019405623,0.000018687158,0.00024557798,0.000032346547,0.000010881282,0.00011769169,0.00033858037,0.0105709145,0.0009498343,0.9800285,0.00043720056,0.007230364],"study_design_scores_gemma":[0.000019367628,0.000058626174,0.00024582446,0.000052643612,0.000022832595,0.00017993446,0.00023647181,0.041003805,0.001964573,0.9332965,0.022894002,0.000025381105],"about_ca_topic_score_codex":0.0019929544,"about_ca_topic_score_gemma":0.0021948686,"teacher_disagreement_score":0.004662889,"about_ca_system_score_codex":0.0012257588,"about_ca_system_score_gemma":0.0007978536,"threshold_uncertainty_score":0.015598953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003579487,0.00012110143,0.9884531,0.00039141672,0.000058782007,0.00007655579,0.00007053585,0.000053560532,0.007195339],"genre_scores_gemma":[0.17088683,0.0004719847,0.8191946,0.00028763013,0.00014344796,0.0006160213,0.00027208222,0.000120756486,0.008006675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980438,0.0011371768,0.0000642175,0.00023829793,0.00031714764,0.00019926036],"domain_scores_gemma":[0.99606484,0.0033597234,0.0001613941,0.00007838806,0.00021636684,0.00011931114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033572786,0.0018680255,0.002109223,0.0017455628,0.0011569958,0.0030501222,0.0035899915,0.0028816096,0.009348013],"category_scores_gemma":[0.008258028,0.001442734,0.002331077,0.0022513182,0.0019372524,0.003605615,0.0020221618,0.004524912,0.0006841335],"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.000045279474,0.000116089686,0.0001797187,0.00012940691,0.000052855245,0.000091097594,0.00013953126,0.79903567,0.00026360693,0.18332374,0.0018935965,0.014729374],"study_design_scores_gemma":[0.00001704943,0.000015817019,0.000022773616,0.000014022273,0.000013233257,0.000011135148,0.00003256084,0.9426459,0.000081883794,0.056285966,0.0008507843,0.000008768515],"about_ca_topic_score_codex":0.011100448,"about_ca_topic_score_gemma":0.008844775,"teacher_disagreement_score":0.011100448,"about_ca_system_score_codex":0.0023233537,"about_ca_system_score_gemma":0.0033703106,"threshold_uncertainty_score":0.031272173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051020835,0.0005082945,0.87005043,0.0004502875,0.00017570771,0.00040212725,0.026656369,0.043654595,0.0070812954],"genre_scores_gemma":[0.27932277,0.00043023695,0.6737206,0.00027120154,0.000105660074,0.0020221476,0.023640271,0.006975711,0.01351144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.000813325,0.00004434258,0.00017176144,0.00014300657,0.00008069429],"domain_scores_gemma":[0.9952236,0.0037215464,0.00026097728,0.000519737,0.00018140697,0.00009278705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026056168,0.00092890026,0.0012191115,0.0016157612,0.0005001966,0.0013051244,0.0021332907,0.0010110134,0.028616626],"category_scores_gemma":[0.01517129,0.0007488849,0.0013954472,0.0017171884,0.00041935698,0.0012455964,0.001483029,0.001337054,0.0072803227],"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.00081282895,0.0004351212,0.04638828,0.0014254202,0.002000217,0.00074772665,0.0011151278,0.35660416,0.0026395437,0.10440522,0.15929854,0.3241278],"study_design_scores_gemma":[0.00024518036,0.0001159569,0.0069301906,0.00012689305,0.00020447328,0.00026334584,0.00022723965,0.89860094,0.0032554865,0.05327979,0.03666688,0.00008356428],"about_ca_topic_score_codex":0.013818225,"about_ca_topic_score_gemma":0.018350048,"teacher_disagreement_score":0.028616626,"about_ca_system_score_codex":0.00069744623,"about_ca_system_score_gemma":0.0016163421,"threshold_uncertainty_score":0.09573221},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1564458,0.0010614378,0.8176467,0.0030979244,0.000109520515,0.0003967359,0.0005247595,0.00035040645,0.02036674],"genre_scores_gemma":[0.90368354,0.0014994289,0.081108585,0.000869798,0.00031224996,0.000827257,0.00036578276,0.00011314877,0.011220136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954021,0.0025854895,0.00014149456,0.00088219775,0.0005298409,0.00045890652],"domain_scores_gemma":[0.98250335,0.012392773,0.0015821216,0.0016675576,0.00068168674,0.0011724897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005700413,0.0012316909,0.001962825,0.0012799187,0.0013079952,0.0023539595,0.002709196,0.0023875306,0.005613543],"category_scores_gemma":[0.017867824,0.00069559796,0.0020655831,0.0012053238,0.0059670247,0.0061844466,0.0031921917,0.004420659,0.00065857504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076188466,0.0000483225,0.0005353634,0.00007210153,0.000038537637,0.00012795991,0.00025050255,0.04686462,0.0007664179,0.9466486,0.0011581634,0.0034132458],"study_design_scores_gemma":[0.000096380645,0.00006539951,0.00032645382,0.000024512121,0.000021829534,0.00011076166,0.000060853738,0.34108555,0.00034487812,0.65635645,0.0014740452,0.00003283771],"about_ca_topic_score_codex":0.004555997,"about_ca_topic_score_gemma":0.0031715308,"teacher_disagreement_score":0.005700413,"about_ca_system_score_codex":0.0023898066,"about_ca_system_score_gemma":0.0015022526,"threshold_uncertainty_score":0.030147016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021927703,0.0010824872,0.53233945,0.01725107,0.00026118607,0.00021215534,0.00069143134,0.00038212736,0.42585233],"genre_scores_gemma":[0.71342266,0.0010891426,0.22667606,0.002895085,0.000468373,0.0007581094,0.0006717143,0.000084548774,0.053934257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966091,0.0016935647,0.00017274069,0.0004454423,0.00082395086,0.00025521973],"domain_scores_gemma":[0.9968081,0.0017315716,0.00024461222,0.00050717755,0.00053653755,0.0001719405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027636124,0.0006844798,0.0004384364,0.0012518985,0.0018432243,0.0044439514,0.0023680427,0.003370828,0.012825047],"category_scores_gemma":[0.005625694,0.0003751747,0.00095783,0.0013114724,0.004838526,0.0054260506,0.0023850286,0.0025873075,0.0020968874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019900283,0.000005305715,0.000025361032,0.000008578157,0.000002188307,0.000018856732,0.00006881941,0.00062116823,0.00003381108,0.997607,0.00046922368,0.0011376269],"study_design_scores_gemma":[0.000011399222,0.0000055040823,0.00003843534,0.000009883342,0.0000028395723,0.000045450233,0.000038951872,0.0051611536,0.00003353515,0.9868759,0.0077728783,0.0000040544246],"about_ca_topic_score_codex":0.0022762984,"about_ca_topic_score_gemma":0.0018204032,"teacher_disagreement_score":0.012825047,"about_ca_system_score_codex":0.0024884653,"about_ca_system_score_gemma":0.0016525083,"threshold_uncertainty_score":0.04290402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1567572,0.0013647124,0.78919846,0.0044223787,0.00014755475,0.00022604926,0.0012668533,0.00019308852,0.046423644],"genre_scores_gemma":[0.8208867,0.0010940749,0.16766585,0.00054519245,0.00017416726,0.00057128543,0.00077637786,0.0000988972,0.008187412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991104,0.002994409,0.000707316,0.0022512288,0.0022522637,0.00069080654],"domain_scores_gemma":[0.98158216,0.010817892,0.0021078796,0.0026490497,0.001545743,0.0012972109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048965267,0.00094370596,0.0014098798,0.0031503907,0.0019238081,0.006954141,0.0025816457,0.0027389796,0.006520571],"category_scores_gemma":[0.026088003,0.00070707337,0.0014221822,0.0024809442,0.006517897,0.013317233,0.0062826783,0.004380423,0.0013310221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065617634,0.000035391167,0.00046022216,0.00009136668,0.000033665692,0.000057295838,0.00026308149,0.007216412,0.00072017504,0.97836316,0.0005046862,0.012189041],"study_design_scores_gemma":[0.000010265769,0.000051459807,0.00019358857,0.000029043338,0.000011330447,0.00009252603,0.00008323044,0.013112588,0.0005358647,0.9830579,0.002805701,0.000016465121],"about_ca_topic_score_codex":0.00070301705,"about_ca_topic_score_gemma":0.0004156358,"teacher_disagreement_score":0.006954141,"about_ca_system_score_codex":0.0026675202,"about_ca_system_score_gemma":0.0014957722,"threshold_uncertainty_score":0.025895596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27599746,0.0012419405,0.54706717,0.027582262,0.00029952553,0.00035644992,0.0007755081,0.0005060236,0.14617367],"genre_scores_gemma":[0.94591194,0.00021770343,0.050536823,0.00076083996,0.000119662516,0.00024399585,0.00015752249,0.000045119974,0.0020064313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98536336,0.008175346,0.00086986943,0.0021161973,0.0024770834,0.0009981489],"domain_scores_gemma":[0.9062975,0.07165788,0.004984852,0.011972347,0.0037946233,0.0012927946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012332487,0.0006993009,0.0011247328,0.0012119262,0.002306675,0.0041258237,0.0026079712,0.0032881717,0.006426711],"category_scores_gemma":[0.067216165,0.00066581654,0.0016634855,0.00098304,0.014345246,0.0127166,0.003376797,0.005753794,0.000526144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063774874,0.00004911241,0.00057534105,0.00004454663,0.000018184108,0.000073726806,0.00030114246,0.0048466525,0.00026303792,0.98795986,0.0003935895,0.0054110303],"study_design_scores_gemma":[0.000018206027,0.000008700486,0.00014831232,0.000008525681,0.0000032024584,0.000016513124,0.000060802497,0.006421832,0.00012293446,0.99272764,0.0004579837,0.0000052175765],"about_ca_topic_score_codex":0.0021513298,"about_ca_topic_score_gemma":0.0015782124,"teacher_disagreement_score":0.012332487,"about_ca_system_score_codex":0.0034292878,"about_ca_system_score_gemma":0.002482375,"threshold_uncertainty_score":0.06522119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066525507,0.0020481884,0.012602604,0.0034494752,0.00069079595,0.00012159968,0.0003428207,0.00020622049,0.97987306],"genre_scores_gemma":[0.050953448,0.00550998,0.031025892,0.0030239588,0.00050650735,0.00047056418,0.0010072608,0.00040590824,0.9070965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991928,0.00020072027,0.000059543323,0.00019004665,0.00025422272,0.00010275162],"domain_scores_gemma":[0.9995215,0.00014658604,0.000027178707,0.000091454305,0.00015148934,0.00006186107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074586546,0.0012426842,0.00042591846,0.0009779205,0.0028486915,0.007087521,0.0014196471,0.0019124274,0.072975524],"category_scores_gemma":[0.0024537249,0.0004765629,0.00050176267,0.0009396116,0.0041819518,0.0048843394,0.0014876929,0.0034707217,0.031639565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012318597,0.000023065233,0.00007226232,0.000049206817,0.0000019780878,0.000044065735,0.00047578718,0.00047848118,0.00009056415,0.85419846,0.11449322,0.030060537],"study_design_scores_gemma":[0.000004792052,0.000011550216,0.000113980685,0.00011380299,0.000001369047,0.00008552909,0.00023180919,0.0005899589,0.0000920677,0.19538397,0.80336136,0.0000097313705],"about_ca_topic_score_codex":0.01150335,"about_ca_topic_score_gemma":0.015902683,"teacher_disagreement_score":0.072975524,"about_ca_system_score_codex":0.002799445,"about_ca_system_score_gemma":0.002158799,"threshold_uncertainty_score":0.2441274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70701224,0.004163625,0.2180667,0.007306136,0.00028816314,0.00012426377,0.00032615426,0.000060011233,0.06265267],"genre_scores_gemma":[0.98943734,0.0007542874,0.0041412185,0.00018966862,0.00010405389,0.000026769136,0.000027659447,0.000009062539,0.0053100064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984364,0.00077723706,0.00006850232,0.0002394674,0.00016156513,0.0003168802],"domain_scores_gemma":[0.985053,0.011667432,0.0016773412,0.0006252959,0.0004613608,0.00051554997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033694713,0.00050575443,0.0017051592,0.00064671994,0.00057194935,0.0041018496,0.0016969766,0.0040516257,0.0060937833],"category_scores_gemma":[0.013515425,0.00048945966,0.00088335725,0.0011039554,0.002938631,0.0057522017,0.0013002756,0.002393073,0.00030951967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031743955,0.00017434974,0.0023482933,0.00021871214,0.00008819241,0.00038589674,0.00029913225,0.049619995,0.0013784185,0.9303258,0.0014605366,0.013383268],"study_design_scores_gemma":[0.00008444863,0.00009401225,0.0020373724,0.00005796817,0.000060124523,0.00023429758,0.00031300497,0.15124308,0.00035805607,0.8440283,0.0014396759,0.00004968116],"about_ca_topic_score_codex":0.0020870822,"about_ca_topic_score_gemma":0.001960133,"teacher_disagreement_score":0.0060937833,"about_ca_system_score_codex":0.0020356537,"about_ca_system_score_gemma":0.0012171825,"threshold_uncertainty_score":0.020385683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008108772,0.00019185802,0.98734075,0.00015319481,0.000043969394,0.00007573885,0.000055191274,0.0004469656,0.003583517],"genre_scores_gemma":[0.20051038,0.00024874468,0.793543,0.00017971358,0.000050175193,0.00035576045,0.00030366099,0.0005121973,0.0042963275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987676,0.000507836,0.000051732964,0.00017442666,0.00029856813,0.00019974825],"domain_scores_gemma":[0.99480915,0.0042135823,0.00020947373,0.00023301144,0.0003361171,0.00019867273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028597098,0.0026625332,0.002172275,0.0018246224,0.0011201244,0.0024132438,0.0024314749,0.0021435726,0.0064927526],"category_scores_gemma":[0.0130458595,0.0012065868,0.0011451244,0.0012352107,0.0019709817,0.0028968882,0.0025794106,0.0031961834,0.0014454514],"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.00021663806,0.000120114484,0.00085205614,0.00012822215,0.00006457372,0.00008276419,0.00015774259,0.8840891,0.0008446819,0.0540196,0.0031982958,0.05622615],"study_design_scores_gemma":[0.000017952798,0.000013670942,0.00002555106,0.000012767608,0.0000051477286,0.000007887635,0.000015103231,0.9802051,0.0002164888,0.01898586,0.0004901125,0.0000042510646],"about_ca_topic_score_codex":0.0102840485,"about_ca_topic_score_gemma":0.009293043,"teacher_disagreement_score":0.0102840485,"about_ca_system_score_codex":0.001839842,"about_ca_system_score_gemma":0.002951646,"threshold_uncertainty_score":0.021720469},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15449183,0.00022292932,0.7322015,0.003520343,0.00016792814,0.00035595952,0.00046821954,0.00023550855,0.108335786],"genre_scores_gemma":[0.8935775,0.00016855318,0.0829104,0.00029683486,0.000057574962,0.000288592,0.00012514275,0.000025623012,0.022549827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681467,0.0016962354,0.00011146643,0.0004901072,0.0005349772,0.00035259666],"domain_scores_gemma":[0.9975925,0.0014727938,0.0001899668,0.00014712305,0.00017899233,0.00041865878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022619502,0.00077516417,0.0008605816,0.00070660055,0.0013719577,0.003373913,0.0017875658,0.0033054764,0.0071456134],"category_scores_gemma":[0.0046565686,0.00050163094,0.0006665622,0.00075522636,0.002315103,0.0038676546,0.0028117986,0.00180487,0.00079899945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003774967,0.000121241945,0.000543632,0.00011248199,0.000053782525,0.00044101983,0.00028014835,0.06540647,0.0034728087,0.92055094,0.001708942,0.006930998],"study_design_scores_gemma":[0.00026120694,0.00031281554,0.00044031552,0.0000369428,0.000068332134,0.0004976617,0.00032568627,0.33018285,0.0013179368,0.6546905,0.011766522,0.00009919509],"about_ca_topic_score_codex":0.0014020704,"about_ca_topic_score_gemma":0.0012873337,"teacher_disagreement_score":0.0071456134,"about_ca_system_score_codex":0.001659508,"about_ca_system_score_gemma":0.0020473113,"threshold_uncertainty_score":0.023904443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062496915,0.00014074973,0.9321464,0.0006527951,0.000030912834,0.00010390118,0.0000830555,0.00025706398,0.004088256],"genre_scores_gemma":[0.9005009,0.00013501818,0.09674899,0.00018236018,0.00002593113,0.00012004907,0.00007838323,0.000037571186,0.0021707544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979797,0.0009265696,0.00008354645,0.00046281278,0.00032775864,0.00021963811],"domain_scores_gemma":[0.9904456,0.007361503,0.0008970105,0.0005803433,0.0004010646,0.00031441308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026802884,0.0010405846,0.0012703846,0.00077315205,0.00081023056,0.0011697955,0.0014531596,0.0015623916,0.0012559982],"category_scores_gemma":[0.011837035,0.00048269102,0.0007197031,0.0006369936,0.0022520348,0.0022255396,0.0021588851,0.0017910098,0.0001915655],"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.00021440689,0.00006614575,0.0008311326,0.000103380444,0.0001015973,0.0001949581,0.00024083919,0.87446666,0.002658676,0.1022626,0.001041504,0.017818093],"study_design_scores_gemma":[0.000024026134,0.00005086784,0.0001279343,0.000009405737,0.00001263201,0.000043144923,0.000026699612,0.90802467,0.00083931535,0.09046519,0.00036253323,0.000013580813],"about_ca_topic_score_codex":0.002730333,"about_ca_topic_score_gemma":0.002040032,"teacher_disagreement_score":0.002730333,"about_ca_system_score_codex":0.0016530991,"about_ca_system_score_gemma":0.0013698335,"threshold_uncertainty_score":0.014174879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2200772,0.00049974915,0.7607628,0.0016935779,0.00004682611,0.00021435665,0.00043433576,0.00026609248,0.016005056],"genre_scores_gemma":[0.9411923,0.00042993037,0.04900518,0.00029307327,0.0000510194,0.0002988995,0.00021844047,0.00010916354,0.008401848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975828,0.0010465794,0.0001051501,0.0003792987,0.00041113512,0.0004750442],"domain_scores_gemma":[0.9808806,0.014593217,0.0019955027,0.0006600243,0.0009310502,0.00093955017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003713392,0.0014970647,0.002569037,0.0011369701,0.0012355644,0.0031936807,0.0029845452,0.0026486244,0.007767964],"category_scores_gemma":[0.025356377,0.0008730053,0.0015312721,0.0013577,0.0029444054,0.0054132785,0.0022978112,0.0035807975,0.0008844626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000566228,0.00021417004,0.0011866837,0.00019062526,0.000073261435,0.00041473896,0.00045185324,0.22475716,0.0057962285,0.75494957,0.0015182665,0.009881194],"study_design_scores_gemma":[0.000104933606,0.00007918493,0.00032092383,0.0000428339,0.000018534498,0.0001301382,0.00015284153,0.7294024,0.0011708562,0.26784113,0.0006950265,0.00004120113],"about_ca_topic_score_codex":0.0019619835,"about_ca_topic_score_gemma":0.0013806899,"teacher_disagreement_score":0.007767964,"about_ca_system_score_codex":0.0029287431,"about_ca_system_score_gemma":0.0013713391,"threshold_uncertainty_score":0.025986493},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21280947,0.0004530301,0.74975556,0.00285265,0.00011675801,0.00016666458,0.0006290594,0.00033137313,0.03288539],"genre_scores_gemma":[0.95582134,0.0003204363,0.03153592,0.0002148146,0.000057284356,0.00019378807,0.00027386757,0.00010588666,0.011476621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978161,0.0012519975,0.00006158491,0.00037518077,0.00021741904,0.000277718],"domain_scores_gemma":[0.9864016,0.010802979,0.00095106056,0.0005481066,0.00058881484,0.0007075225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002846616,0.0010675717,0.0022730574,0.0019401577,0.001573823,0.0041621807,0.0027167317,0.002977032,0.014770799],"category_scores_gemma":[0.017005656,0.0007962055,0.0015820814,0.0020036278,0.0040594954,0.006111295,0.002643381,0.0035433755,0.0012932689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000252063,0.000103082464,0.00062582607,0.000113594426,0.00007983644,0.0001512317,0.00032861443,0.2159682,0.00070072425,0.7719551,0.0019298772,0.0077919196],"study_design_scores_gemma":[0.000053003852,0.00002719131,0.00012515507,0.000012057467,0.000018780718,0.000025160252,0.00007723725,0.3539273,0.00011295955,0.64509416,0.00050466077,0.000022185684],"about_ca_topic_score_codex":0.008116842,"about_ca_topic_score_gemma":0.0056658634,"teacher_disagreement_score":0.014770799,"about_ca_system_score_codex":0.002453608,"about_ca_system_score_gemma":0.0020508235,"threshold_uncertainty_score":0.049413264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08020822,0.0007364387,0.9068799,0.0012576886,0.00023566568,0.00006665042,0.00008525751,0.0003861179,0.010143992],"genre_scores_gemma":[0.9210703,0.00041492746,0.06873067,0.00013829036,0.00018723501,0.000067900815,0.00004864514,0.00015423726,0.009187751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616855,0.0023593341,0.00015488044,0.00054338295,0.00041478072,0.0003591071],"domain_scores_gemma":[0.9721624,0.0208347,0.002114735,0.0030035097,0.0011492507,0.00073523144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006448934,0.0010261221,0.00243927,0.0012800065,0.0013136832,0.0029992724,0.003991823,0.003591184,0.0031728998],"category_scores_gemma":[0.03062281,0.0015104365,0.0017517396,0.0013687771,0.0034361277,0.009170034,0.0027752619,0.0031488128,0.00048540934],"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.00035586162,0.0001267271,0.0011180917,0.00021826719,0.00019196322,0.00024183614,0.00029574527,0.5033593,0.0018397442,0.4539943,0.0028345447,0.03542362],"study_design_scores_gemma":[0.000025281986,0.000059738883,0.00011975445,0.000021011738,0.00004951842,0.00008240129,0.00003615921,0.75820553,0.00034513627,0.24050033,0.000514011,0.000041059968],"about_ca_topic_score_codex":0.0018313141,"about_ca_topic_score_gemma":0.0019587025,"teacher_disagreement_score":0.006448934,"about_ca_system_score_codex":0.002173249,"about_ca_system_score_gemma":0.0010508773,"threshold_uncertainty_score":0.03410566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043978237,0.00018154972,0.94934094,0.00036102516,0.0000462351,0.00006896037,0.000040597126,0.00013311056,0.0058493465],"genre_scores_gemma":[0.9044321,0.00023802603,0.0902732,0.0001612761,0.000039431223,0.00014883828,0.000052928102,0.000065173306,0.0045889514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925345,0.00035730892,0.00003295577,0.00009557474,0.00016079989,0.00009977849],"domain_scores_gemma":[0.99751866,0.0015214236,0.00018387231,0.000264608,0.00031600104,0.00019559616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023725305,0.0010442975,0.0010619796,0.0005023844,0.0005068344,0.0016664134,0.0012632073,0.0011568916,0.0024802939],"category_scores_gemma":[0.008416204,0.00050749356,0.00092228863,0.00033496,0.0014919711,0.0018943668,0.0020605559,0.0016704887,0.00028910048],"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.00013639255,0.00008604698,0.001218143,0.00011565985,0.000063824365,0.00021634292,0.00017391585,0.6650357,0.0046075997,0.30784613,0.001339468,0.01916064],"study_design_scores_gemma":[0.0000064413484,0.000033416276,0.000047706006,0.0000044540116,0.0000024283179,0.000018460398,0.000006503593,0.97901136,0.00034599684,0.02028657,0.00023180278,0.000004846496],"about_ca_topic_score_codex":0.0030216489,"about_ca_topic_score_gemma":0.0020205672,"teacher_disagreement_score":0.0030216489,"about_ca_system_score_codex":0.0013664431,"about_ca_system_score_gemma":0.0016460082,"threshold_uncertainty_score":0.012547314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050159767,0.000101363876,0.94614357,0.00032764842,0.000028042727,0.00010371392,0.00003149707,0.00030343593,0.002800988],"genre_scores_gemma":[0.8733949,0.00009741248,0.12338638,0.0001577931,0.000019007965,0.00013371895,0.00007261102,0.000049161452,0.00268895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982241,0.00064260256,0.00008661197,0.00046057612,0.00035170486,0.00023436628],"domain_scores_gemma":[0.9921829,0.0051110396,0.0008421553,0.00090433436,0.00067315204,0.00028648492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026607027,0.0008694581,0.0012265396,0.00056152104,0.000775183,0.0011098007,0.0015941217,0.0013066416,0.0014726804],"category_scores_gemma":[0.013125829,0.00041850196,0.0007060916,0.00044166006,0.0016853284,0.0020516133,0.0022369046,0.0018216356,0.00030810767],"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.0002541735,0.000106655716,0.0018563049,0.00013472019,0.00010343659,0.0002673761,0.00031451156,0.86699593,0.009907666,0.07905263,0.0015119984,0.039494455],"study_design_scores_gemma":[0.00001803477,0.000059591956,0.000110901456,0.000008726146,0.000010580641,0.0000836146,0.000030206707,0.9668969,0.0020236028,0.030233137,0.0005149322,0.000009808449],"about_ca_topic_score_codex":0.0012052193,"about_ca_topic_score_gemma":0.0011611632,"teacher_disagreement_score":0.0026607027,"about_ca_system_score_codex":0.0011047187,"about_ca_system_score_gemma":0.0013021487,"threshold_uncertainty_score":0.014071345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23639083,0.0013599502,0.33062488,0.007882318,0.00013149004,0.0001524395,0.00022623142,0.000102268896,0.4231297],"genre_scores_gemma":[0.9773498,0.0004970918,0.0056544105,0.00020307182,0.00008947341,0.00010950913,0.0000413398,0.000020697586,0.016034596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810445,0.0008975343,0.000045236837,0.00023568113,0.00033754486,0.00037959695],"domain_scores_gemma":[0.99663734,0.0020585943,0.00054298836,0.00033051948,0.00024058307,0.00018996581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016946702,0.00035202087,0.00043702708,0.00062683667,0.0009441633,0.0026949814,0.00065498747,0.0012268504,0.010419174],"category_scores_gemma":[0.00641313,0.00025665946,0.00040502724,0.0005999708,0.0036847775,0.0024474347,0.001149484,0.0013104815,0.00053251773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022038117,0.000023800247,0.00044093851,0.00002008732,0.0000098368155,0.00004462453,0.00009520272,0.023576336,0.00025817548,0.97020096,0.0005965457,0.0047114203],"study_design_scores_gemma":[0.00004637904,0.000033978744,0.0008980444,0.000026499647,0.00001017061,0.000046535435,0.00009982709,0.07905822,0.00032332816,0.90959007,0.009854123,0.0000128923275],"about_ca_topic_score_codex":0.0025126573,"about_ca_topic_score_gemma":0.0021554527,"teacher_disagreement_score":0.010419174,"about_ca_system_score_codex":0.002649596,"about_ca_system_score_gemma":0.0014251847,"threshold_uncertainty_score":0.034855545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660535,0.00072788046,0.15251264,0.0038784912,0.00018811198,0.00015203394,0.00036098956,0.00034798132,0.075778484],"genre_scores_gemma":[0.99368864,0.00014859498,0.0027798247,0.00008701632,0.000022648272,0.000024909468,0.000030217301,0.00002685456,0.0031913065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979665,0.0012851438,0.00004221917,0.00017266184,0.00015658898,0.00037686893],"domain_scores_gemma":[0.9755347,0.020146744,0.0013256846,0.00087098987,0.0006821421,0.0014396532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034480647,0.0011055435,0.0017783433,0.0012275149,0.0010847532,0.002712011,0.002135958,0.0029056573,0.016794778],"category_scores_gemma":[0.027037174,0.00047083516,0.0008055304,0.000976222,0.002169636,0.0044058026,0.0019526762,0.0026080331,0.00061924674],"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.0009960004,0.00040341038,0.0017800548,0.00026488764,0.00013515262,0.00032746964,0.00026608584,0.6789825,0.0022042973,0.29400507,0.0030996338,0.017535392],"study_design_scores_gemma":[0.00017826121,0.00032757924,0.0011419395,0.000030579464,0.00011475226,0.00008221749,0.00023138252,0.7804021,0.0005526606,0.21602178,0.0008661017,0.000050654566],"about_ca_topic_score_codex":0.0048658033,"about_ca_topic_score_gemma":0.005754605,"teacher_disagreement_score":0.016794778,"about_ca_system_score_codex":0.0016794524,"about_ca_system_score_gemma":0.001637708,"threshold_uncertainty_score":0.056184113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19877164,0.0005083582,0.7787923,0.0011739146,0.00012330398,0.00025971452,0.00045922695,0.0010414858,0.018870037],"genre_scores_gemma":[0.77690655,0.0003400395,0.21495406,0.00017102972,0.00006854697,0.00022501808,0.00080035615,0.00031447792,0.0062199594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979494,0.0008250586,0.000114659575,0.0004084671,0.0002896278,0.00041275143],"domain_scores_gemma":[0.9883463,0.010087323,0.0004469713,0.00031072402,0.00042946293,0.00037923723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002815601,0.0016992893,0.0019661065,0.001884807,0.0012112926,0.004814822,0.002219356,0.0017580546,0.011172077],"category_scores_gemma":[0.018040828,0.0010505185,0.0015007134,0.0013508069,0.0017999181,0.004528479,0.002363368,0.0031404046,0.0012081699],"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.0011231934,0.0008326444,0.0037041833,0.00052428077,0.00019456279,0.00023088715,0.00061702373,0.61901355,0.0027164905,0.27259183,0.0052482756,0.09320309],"study_design_scores_gemma":[0.00010019566,0.00009297709,0.00018637929,0.00005244761,0.00003455775,0.00003255034,0.0001760959,0.7080939,0.0013243633,0.28921914,0.00067183725,0.000015506472],"about_ca_topic_score_codex":0.0033270924,"about_ca_topic_score_gemma":0.0038781033,"teacher_disagreement_score":0.011172077,"about_ca_system_score_codex":0.0018724218,"about_ca_system_score_gemma":0.0017367641,"threshold_uncertainty_score":0.037374377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25980636,0.0038691345,0.62014264,0.011103682,0.00029209896,0.00083411945,0.00017737456,0.00044177021,0.10333284],"genre_scores_gemma":[0.9770344,0.000713643,0.017145997,0.0003807159,0.00016710407,0.00017669649,0.000023418404,0.000020838872,0.0043371366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928343,0.00405929,0.0003174404,0.0010786207,0.0011190202,0.00059127784],"domain_scores_gemma":[0.9447865,0.041912407,0.0065646716,0.004153131,0.0019990858,0.0005841404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069322996,0.00090829324,0.0008779838,0.001228322,0.00078837894,0.0028872658,0.001137631,0.0025626754,0.0049407557],"category_scores_gemma":[0.042384375,0.00037987423,0.00071416545,0.00087423075,0.003034006,0.005333513,0.002127619,0.002137551,0.0004270953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004227348,0.00072542165,0.0047253906,0.0008981997,0.00025550165,0.0004403691,0.0014281723,0.069021724,0.008603228,0.75838137,0.0029175337,0.1521804],"study_design_scores_gemma":[0.00028981114,0.00062494574,0.0026716418,0.00017267083,0.0001586357,0.00028098887,0.00033163585,0.18914905,0.0077686217,0.7851719,0.013296896,0.00008317319],"about_ca_topic_score_codex":0.0008742415,"about_ca_topic_score_gemma":0.0004894984,"teacher_disagreement_score":0.0069322996,"about_ca_system_score_codex":0.0018826034,"about_ca_system_score_gemma":0.0016603012,"threshold_uncertainty_score":0.036661983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002275455,0.0020979117,0.04141743,0.0012217134,0.00038249738,0.00005184805,0.00027018206,0.00013419689,0.9521487],"genre_scores_gemma":[0.11259446,0.00508171,0.014592546,0.0008159823,0.00041985046,0.00021800342,0.00074805046,0.00025416014,0.8652752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963665,0.00008332321,0.000011992108,0.00006361364,0.00015341263,0.000051032628],"domain_scores_gemma":[0.9998592,0.000045911976,0.000009650823,0.000030291894,0.000035346013,0.000019549487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814654,0.0013149857,0.00063141464,0.00073827413,0.00076896424,0.0026541145,0.0009609273,0.0009827295,0.057416327],"category_scores_gemma":[0.001045593,0.00031662703,0.0005907191,0.00079163036,0.0014403481,0.002897063,0.0012215531,0.0020291333,0.0130202025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055603136,0.000014808777,0.00002397045,0.00005080471,0.0000053762014,0.000018591116,0.00006411638,0.0014285992,0.00015016792,0.94430065,0.03262662,0.02131077],"study_design_scores_gemma":[0.000005925107,0.0000063417074,0.00007591293,0.000039685183,0.000003861627,0.000042750984,0.000045210698,0.0028202953,0.000097831005,0.84516776,0.15168919,0.0000052956034],"about_ca_topic_score_codex":0.002253517,"about_ca_topic_score_gemma":0.0025590167,"teacher_disagreement_score":0.057416327,"about_ca_system_score_codex":0.00196943,"about_ca_system_score_gemma":0.00097184186,"threshold_uncertainty_score":0.19207674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16750129,0.0008495057,0.79548794,0.0010395376,0.000116946416,0.000097532335,0.0001600973,0.00012461685,0.03462262],"genre_scores_gemma":[0.96158624,0.00048023096,0.026455613,0.00015259322,0.000045673092,0.00015340828,0.00007572608,0.0000293687,0.011021254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.0001505191,0.000013461233,0.00006666544,0.00009767359,0.00004362929],"domain_scores_gemma":[0.999479,0.00024653773,0.00010134229,0.000023365723,0.00008652953,0.00006324414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053411064,0.00048453631,0.00047707968,0.00038902953,0.0003892391,0.0010326707,0.000575662,0.0006018167,0.0020667964],"category_scores_gemma":[0.0020457434,0.00022933347,0.00043022784,0.00021518319,0.0014943449,0.0009948304,0.000991317,0.00072655466,0.00013963581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024525116,0.000017259277,0.00059268373,0.000055036722,0.000029103054,0.00017729714,0.00012803843,0.30852968,0.00196136,0.68257874,0.0008838254,0.005022461],"study_design_scores_gemma":[0.000007627324,0.000014127029,0.0002086175,0.0000068600525,0.000003304066,0.000024190187,0.00003515837,0.8432657,0.00012708666,0.15508083,0.0012193323,0.0000071942795],"about_ca_topic_score_codex":0.006725136,"about_ca_topic_score_gemma":0.003894684,"teacher_disagreement_score":0.006725136,"about_ca_system_score_codex":0.0009818003,"about_ca_system_score_gemma":0.0008024085,"threshold_uncertainty_score":0.013372004},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02691656,0.0012471233,0.091451935,0.0057578646,0.0013895204,0.0025192585,0.01046491,0.0052509513,0.85500187],"genre_scores_gemma":[0.15845568,0.00070126465,0.023607822,0.001612305,0.00083675684,0.0016442413,0.009794394,0.0011537501,0.8021938],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993919,0.0021841708,0.00033698283,0.0009888563,0.0017206813,0.0008503916],"domain_scores_gemma":[0.98834956,0.0029071763,0.0006578771,0.0033326854,0.002827703,0.001924933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036974996,0.0010534087,0.0015957564,0.0046584387,0.0026017248,0.0047253654,0.002066881,0.0024109604,0.27992123],"category_scores_gemma":[0.019819088,0.0005822323,0.0009941653,0.0033644647,0.00074338936,0.002987667,0.0023493168,0.0021363024,0.16443641],"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.0008758972,0.00045764993,0.0025033886,0.00051000935,0.00009430127,0.00018642044,0.00033838156,0.0039031662,0.005907217,0.15325908,0.55459607,0.27736852],"study_design_scores_gemma":[0.00031863595,0.00032055977,0.0030615504,0.00015299009,0.00009604218,0.00059098395,0.00049750373,0.025781155,0.0074189287,0.083025075,0.87864983,0.00008666673],"about_ca_topic_score_codex":0.0017073544,"about_ca_topic_score_gemma":0.0033618484,"teacher_disagreement_score":0.27992123,"about_ca_system_score_codex":0.0011671464,"about_ca_system_score_gemma":0.003324846,"threshold_uncertainty_score":0.9364298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013518274,0.004070889,0.09367089,0.002142319,0.00047166136,0.000050505718,0.00020915041,0.00013184348,0.897901],"genre_scores_gemma":[0.072645456,0.010040862,0.033696454,0.0010943867,0.0006448224,0.00021299209,0.0005183542,0.00020812322,0.8809385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994842,0.00016608107,0.000016334996,0.00007107844,0.00021894851,0.000043268185],"domain_scores_gemma":[0.99973303,0.00012586387,0.000014727958,0.000035661225,0.00006642055,0.000024308616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165312,0.0012804467,0.00058657245,0.0008094053,0.000713861,0.0025934489,0.00091422163,0.0011973566,0.041771762],"category_scores_gemma":[0.0017645714,0.00043093876,0.00037204917,0.00090897584,0.0014073699,0.0029410475,0.0009799065,0.0018036815,0.010743811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005461291,0.000021640051,0.000025841475,0.000048041147,0.0000055514956,0.00001597108,0.000064010805,0.0019895264,0.00014226075,0.9162072,0.040409815,0.041064702],"study_design_scores_gemma":[0.0000037768166,0.0000045064585,0.00005096836,0.000065372995,0.0000038450944,0.000034646568,0.000033210785,0.0030773433,0.00011887319,0.81586766,0.18073241,0.0000074481754],"about_ca_topic_score_codex":0.0027662592,"about_ca_topic_score_gemma":0.0042220904,"teacher_disagreement_score":0.041771762,"about_ca_system_score_codex":0.0019723752,"about_ca_system_score_gemma":0.0014447125,"threshold_uncertainty_score":0.13974047},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045685265,0.0059712585,0.07691258,0.0050654705,0.00070215407,0.00016830576,0.0012663156,0.00038346348,0.90496194],"genre_scores_gemma":[0.26491275,0.018914359,0.06740833,0.0040520323,0.0008447947,0.00066563237,0.0034909423,0.00031113715,0.63940006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934,0.00025179287,0.000033834403,0.000101311765,0.00019453446,0.00007849917],"domain_scores_gemma":[0.99967194,0.00015467103,0.000028977967,0.000047867394,0.00005354992,0.000043094446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047903575,0.00111668,0.0006390885,0.0005639658,0.00093442283,0.0033596314,0.0009086542,0.0014226576,0.045771785],"category_scores_gemma":[0.0013670034,0.00034637592,0.000560356,0.00097540475,0.0014204084,0.0026201596,0.001251737,0.0019368292,0.012664681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071001264,0.000013411407,0.000049581882,0.00005973147,0.000008250277,0.000032189444,0.00009879096,0.0014723833,0.0001575461,0.94891,0.034942828,0.014248098],"study_design_scores_gemma":[0.000013349026,0.00001763961,0.00012130589,0.00008128069,0.0000066330285,0.0001062747,0.00009427161,0.0037987148,0.00010768507,0.70250344,0.29314053,0.00000877167],"about_ca_topic_score_codex":0.0016896494,"about_ca_topic_score_gemma":0.002776962,"teacher_disagreement_score":0.045771785,"about_ca_system_score_codex":0.0015357323,"about_ca_system_score_gemma":0.0010211748,"threshold_uncertainty_score":0.15312183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015908601,0.0043790964,0.103426665,0.0026474588,0.00060733285,0.00005797308,0.00027841175,0.00016205979,0.88685],"genre_scores_gemma":[0.08474573,0.01062274,0.036360368,0.001303061,0.00082544464,0.00025440427,0.0007203327,0.00026094672,0.86490697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994097,0.00018580427,0.00001877355,0.00008658957,0.00024746923,0.000051674375],"domain_scores_gemma":[0.9996747,0.00015271123,0.000017935177,0.000043652057,0.00007976707,0.00003128216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005863718,0.0013812516,0.00062388636,0.00082246907,0.00074803585,0.0030112264,0.0009666778,0.0013401277,0.04472797],"category_scores_gemma":[0.0021706293,0.00044173017,0.00041660212,0.0009354914,0.0014504173,0.0031547516,0.0010818724,0.0019345897,0.012524824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060847437,0.000021560463,0.000026332673,0.000052584517,0.0000057919506,0.000015781887,0.00006160465,0.0018864906,0.00013569003,0.92283005,0.03875826,0.036199808],"study_design_scores_gemma":[0.0000040166333,0.0000043225664,0.000047084923,0.00006647432,0.0000040132063,0.000030420495,0.00002999509,0.0028508164,0.000100127625,0.83216876,0.16468684,0.0000070922506],"about_ca_topic_score_codex":0.0025557165,"about_ca_topic_score_gemma":0.00363008,"teacher_disagreement_score":0.04472797,"about_ca_system_score_codex":0.0020308082,"about_ca_system_score_gemma":0.0015210499,"threshold_uncertainty_score":0.14963001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16058014,0.00044713722,0.81739336,0.0008457704,0.000050813684,0.00018417148,0.00011268585,0.0002499013,0.020136083],"genre_scores_gemma":[0.9157442,0.0003498658,0.07722475,0.0001908709,0.000065208405,0.0004009747,0.000111073445,0.000050337276,0.0058627347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971884,0.0016008905,0.00008101494,0.0003749478,0.00045353413,0.00030122502],"domain_scores_gemma":[0.99431604,0.0042494778,0.00053985126,0.00026336257,0.00041124612,0.00021996963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526394,0.00085017557,0.001076005,0.0013727158,0.00084679964,0.0022563115,0.0012730828,0.0012079898,0.004257788],"category_scores_gemma":[0.011573048,0.0006155575,0.0007085159,0.0006459213,0.002317385,0.0031466223,0.0016389808,0.0011439817,0.00060404633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010736472,0.000056909925,0.00053308764,0.00007335532,0.000054228687,0.0001443702,0.00017399415,0.13755439,0.001052359,0.8504711,0.0013189152,0.008459987],"study_design_scores_gemma":[0.000060214174,0.0000453285,0.00012546779,0.000018920146,0.000011270746,0.00007431998,0.000061543666,0.500717,0.0005460749,0.49654016,0.001783946,0.000015722464],"about_ca_topic_score_codex":0.0015455098,"about_ca_topic_score_gemma":0.0010847155,"teacher_disagreement_score":0.004257788,"about_ca_system_score_codex":0.0014245781,"about_ca_system_score_gemma":0.0007927223,"threshold_uncertainty_score":0.014243782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047113,0.005391436,0.47742292,0.005483049,0.0007884405,0.00035888224,0.0015981246,0.0002794622,0.49363053],"genre_scores_gemma":[0.7116526,0.009485429,0.10252882,0.0020952374,0.00082498865,0.000935375,0.0013820974,0.00008593767,0.17100953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987741,0.00045687033,0.000081571365,0.00023822408,0.0003265899,0.00012262023],"domain_scores_gemma":[0.9992859,0.0003748406,0.00006139909,0.00008074639,0.00014604321,0.000051149418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079485646,0.0009224386,0.0009487899,0.0008256524,0.0007388829,0.002541586,0.0010157039,0.0011815368,0.020769523],"category_scores_gemma":[0.0023412548,0.00024238325,0.0007222625,0.0010761024,0.0020040846,0.0017950578,0.0015899499,0.0016603905,0.0029749803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008829213,0.000009843144,0.00007018184,0.000059854727,0.000008498796,0.000053296753,0.000060818064,0.0041108653,0.00019804754,0.9826812,0.004106003,0.008632601],"study_design_scores_gemma":[0.000030285279,0.000026325712,0.0001335178,0.00006850592,0.000012669675,0.00015869382,0.00007665198,0.021735534,0.00030234706,0.89620906,0.08123336,0.000013122641],"about_ca_topic_score_codex":0.0016400479,"about_ca_topic_score_gemma":0.00095410645,"teacher_disagreement_score":0.020769523,"about_ca_system_score_codex":0.0021499025,"about_ca_system_score_gemma":0.00094659347,"threshold_uncertainty_score":0.069481015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039182045,0.011608609,0.35610378,0.0077812592,0.00095168286,0.0005926287,0.0017084588,0.00036126407,0.6169742],"genre_scores_gemma":[0.4733616,0.04031049,0.2431192,0.005200531,0.00185414,0.0025119109,0.0033029057,0.00033235198,0.23000696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969854,0.0013699437,0.00017821656,0.00040787176,0.0008896588,0.000168818],"domain_scores_gemma":[0.998073,0.0011820468,0.000107296335,0.00021888096,0.0003470025,0.00007183215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022821939,0.001268159,0.0013291067,0.0017147657,0.0012028883,0.0052836817,0.0017390142,0.0016778599,0.02671566],"category_scores_gemma":[0.005555141,0.00033845246,0.00095409923,0.001911539,0.0032622819,0.0032503759,0.0018315162,0.0023885623,0.005926345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006419446,0.000012496428,0.00009326172,0.00012460981,0.00001729087,0.00004676386,0.00010367696,0.004880089,0.00008626549,0.9684036,0.009545706,0.016679967],"study_design_scores_gemma":[0.000013811871,0.000019758007,0.000109093744,0.00018822492,0.000010993327,0.000109738176,0.00010657299,0.009454504,0.00010729398,0.83561766,0.15424967,0.000012561049],"about_ca_topic_score_codex":0.004040015,"about_ca_topic_score_gemma":0.0020983156,"teacher_disagreement_score":0.02671566,"about_ca_system_score_codex":0.003212669,"about_ca_system_score_gemma":0.0023926266,"threshold_uncertainty_score":0.08937281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036495507,0.017252607,0.021758173,0.015602512,0.0007701907,0.000035464363,0.00008962603,0.00014093255,0.9407009],"genre_scores_gemma":[0.3224837,0.027756657,0.019490473,0.007803192,0.0017518038,0.00019120092,0.00022341653,0.00020358009,0.6200961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945337,0.00019459327,0.00001608533,0.000107674496,0.0001637026,0.000064567525],"domain_scores_gemma":[0.9992612,0.00040453207,0.000048493577,0.00012284347,0.00007516478,0.00008781746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092457014,0.0004146065,0.00029587644,0.00046454283,0.0012716207,0.003501881,0.00085941557,0.001433453,0.022201234],"category_scores_gemma":[0.0024703706,0.00015708897,0.00021487851,0.00053203735,0.0068491083,0.005001288,0.0014700595,0.0024638951,0.0046932017],"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.0000064255064,0.000015144757,0.000082721366,0.00006840389,0.0000025906907,0.00001895199,0.0006298195,0.00040914133,0.00009568204,0.9320425,0.015476363,0.051152304],"study_design_scores_gemma":[0.0000053246627,0.000013475733,0.00016767999,0.00013059255,0.0000023827495,0.000048800586,0.00021939512,0.00048789516,0.0002830905,0.5929183,0.40571755,0.0000055413375],"about_ca_topic_score_codex":0.0025354347,"about_ca_topic_score_gemma":0.002891784,"teacher_disagreement_score":0.022201234,"about_ca_system_score_codex":0.0025742291,"about_ca_system_score_gemma":0.0015448167,"threshold_uncertainty_score":0.07427055},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043157496,0.00046880168,0.78504056,0.0038091722,0.0003546664,0.0003302243,0.003557582,0.00064162404,0.16263987],"genre_scores_gemma":[0.8249239,0.001029208,0.108602926,0.00046829425,0.0003874802,0.0007019807,0.0022273567,0.00027526135,0.061383665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766797,0.00065152347,0.000083298495,0.0006628863,0.0007272492,0.0002070781],"domain_scores_gemma":[0.9943856,0.0031595794,0.00039154684,0.00084517035,0.0008903868,0.000327828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018850681,0.0007426876,0.00070058793,0.0028463344,0.0010259178,0.0036844257,0.0016848905,0.0018494354,0.028080799],"category_scores_gemma":[0.020018829,0.00046932197,0.0007079044,0.002536034,0.0012907081,0.007580128,0.0016845986,0.0020889114,0.0033992347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076780845,0.000043405682,0.001134907,0.00008847136,0.000034940233,0.00007076304,0.00012493094,0.032665834,0.00070417527,0.9203315,0.0072828922,0.037441384],"study_design_scores_gemma":[0.00001240707,0.000017536346,0.0005686691,0.000033033055,0.00002043628,0.000107092856,0.00006631682,0.0773607,0.0005622524,0.91164863,0.009583003,0.000019995572],"about_ca_topic_score_codex":0.0012252978,"about_ca_topic_score_gemma":0.001582257,"teacher_disagreement_score":0.028080799,"about_ca_system_score_codex":0.0018271592,"about_ca_system_score_gemma":0.0009433406,"threshold_uncertainty_score":0.0939396},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040735994,0.017276982,0.66378045,0.0045638056,0.0010531235,0.00010791844,0.00025592904,0.00020785582,0.30868036],"genre_scores_gemma":[0.30466527,0.04828383,0.41377157,0.0021052456,0.0016289478,0.0006667974,0.00087129656,0.000554868,0.22745222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992829,0.00038203577,0.00002153864,0.00009253001,0.00018241198,0.000038592705],"domain_scores_gemma":[0.9991667,0.0006442927,0.00003856828,0.000065637396,0.00005469517,0.000030078914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084261544,0.0011116771,0.00084241916,0.00089875853,0.0007128087,0.003409255,0.0019097741,0.0020071894,0.011205143],"category_scores_gemma":[0.0024135099,0.000570497,0.0009583201,0.0023177057,0.0021951736,0.004482576,0.0014193848,0.002259616,0.0023213958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066365646,0.000017475651,0.000047867692,0.00011406777,0.000017219307,0.00003303392,0.000102778,0.013854008,0.00023952137,0.9439486,0.014424097,0.027194694],"study_design_scores_gemma":[0.000003843224,0.000005359917,0.00004255699,0.000049575785,0.000008058244,0.00004850201,0.00006577314,0.02179778,0.0001108078,0.9485292,0.029329605,0.000008976386],"about_ca_topic_score_codex":0.002421136,"about_ca_topic_score_gemma":0.0030436188,"teacher_disagreement_score":0.011205143,"about_ca_system_score_codex":0.0015904587,"about_ca_system_score_gemma":0.0011598566,"threshold_uncertainty_score":0.037484944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010640883,0.00033141268,0.9778015,0.00069456786,0.000058552796,0.000056263347,0.00017840206,0.00010849264,0.01012989],"genre_scores_gemma":[0.6982234,0.0011640813,0.28651115,0.00043082816,0.00023667015,0.0006231888,0.00069859996,0.00018567986,0.011926343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980635,0.0011525052,0.000061967374,0.0002724862,0.00032877768,0.000120776494],"domain_scores_gemma":[0.9967302,0.0022107172,0.0003415541,0.00024840698,0.0003040445,0.00016504872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021515777,0.0009883567,0.0010957865,0.0020027328,0.0009044765,0.0021221894,0.0019740814,0.0013446632,0.0054854727],"category_scores_gemma":[0.0069654346,0.0003345432,0.0012749915,0.0022698822,0.002620911,0.0036291715,0.0020868608,0.0018487585,0.0008010555],"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.00002049105,0.000014691295,0.00015745647,0.000030370928,0.0000307542,0.00006508604,0.000097183445,0.14689986,0.0002429455,0.84590006,0.0013282173,0.0052128895],"study_design_scores_gemma":[0.00000956762,0.000006452756,0.0000429844,0.000006783766,0.000007175985,0.000020443065,0.000028321869,0.42372477,0.00006509798,0.57414985,0.0019305231,0.000008109401],"about_ca_topic_score_codex":0.0060288366,"about_ca_topic_score_gemma":0.00454941,"teacher_disagreement_score":0.0060288366,"about_ca_system_score_codex":0.002478935,"about_ca_system_score_gemma":0.0013668375,"threshold_uncertainty_score":0.01835072},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056503665,0.00065893866,0.8779506,0.0032546218,0.0003636887,0.00017977456,0.00034080032,0.00022389932,0.060524076],"genre_scores_gemma":[0.8334479,0.0011752998,0.115605235,0.0008497722,0.00033601944,0.00024202572,0.00021910289,0.00010437718,0.04802026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909306,0.00022619587,0.000035283207,0.00018161314,0.00022999031,0.00023386268],"domain_scores_gemma":[0.99877113,0.0004552634,0.00020327064,0.00016107781,0.00017925746,0.00022990437],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008501241,0.00086625875,0.0007996126,0.0004987645,0.0012964334,0.002451536,0.0035060167,0.0023056176,0.011260604],"category_scores_gemma":[0.0029093218,0.0005401143,0.0011984966,0.0007771327,0.0016641302,0.0053941524,0.0017379267,0.002558037,0.0013358701],"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.00006062754,0.00008809478,0.00027550643,0.000075709155,0.000030857325,0.0002325876,0.000116671115,0.19261208,0.001140154,0.7944687,0.003257108,0.0076419585],"study_design_scores_gemma":[0.00003643336,0.000067064786,0.0000906416,0.000014873376,0.000026189464,0.00011013901,0.00007104141,0.62506855,0.00044289845,0.36453822,0.009511687,0.000022340702],"about_ca_topic_score_codex":0.00490551,"about_ca_topic_score_gemma":0.0051166047,"teacher_disagreement_score":0.9887394,"about_ca_system_score_codex":0.0022802013,"about_ca_system_score_gemma":0.0014966114,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006706701,0.013078925,0.0066284207,0.004690164,0.007375128,0.000114313705,0.002187549,0.0008806382,0.96437407],"genre_scores_gemma":[0.002944842,0.007645889,0.002889225,0.0017935655,0.0012807562,0.000075814554,0.0021707402,0.0003588029,0.98084027],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992901,0.00007081,0.000036334124,0.0001660311,0.0003662952,0.00007033947],"domain_scores_gemma":[0.99936193,0.00013729514,0.00003232636,0.0000909773,0.00026161724,0.00011591516],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047237668,0.0010309234,0.0009363587,0.0014904027,0.0012928108,0.0043678656,0.0018660822,0.0019856251,0.3939836],"category_scores_gemma":[0.0021752724,0.00034537038,0.0006264317,0.00204186,0.00067680195,0.003990807,0.0021999686,0.0019832633,0.28365058],"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.00002749761,0.00004097906,0.00016486393,0.00027973487,0.000004979803,0.00009749539,0.00023725379,0.00022351807,0.00040198164,0.05348615,0.73647255,0.20856303],"study_design_scores_gemma":[0.0000011573705,0.0000054896245,0.000065164895,0.000070102134,8.8925987e-7,0.00006849109,0.000032570006,0.000026343241,0.000038976323,0.0042686407,0.99541986,0.000002396079],"about_ca_topic_score_codex":0.0012860915,"about_ca_topic_score_gemma":0.0019604054,"teacher_disagreement_score":0.6060164,"about_ca_system_score_codex":0.0012658486,"about_ca_system_score_gemma":0.0011821525,"threshold_uncertainty_score":0.86440885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060332506,0.44067037,0.034425583,0.022333171,0.0072079347,0.00010489143,0.00037837014,0.0004134462,0.48843294],"genre_scores_gemma":[0.13654925,0.6551838,0.0072094747,0.015118686,0.012671469,0.00016496216,0.0005582919,0.0002208838,0.1723233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993998,0.00009616302,0.000025992496,0.00009568642,0.00033139548,0.00005089938],"domain_scores_gemma":[0.99887747,0.0005109973,0.00012777795,0.00008598059,0.0003058188,0.00009205117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057834963,0.0005159481,0.0005106304,0.0011474426,0.00033396896,0.0017001445,0.0009986789,0.0014768239,0.019617543],"category_scores_gemma":[0.002908751,0.00017825142,0.0003430595,0.0015644841,0.0013811792,0.0020256098,0.0008192585,0.0012489264,0.006083897],"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.000060982075,0.000104276754,0.0004253471,0.002701391,0.000066158114,0.0002804381,0.000106474676,0.0037226793,0.0016578045,0.25073245,0.22995134,0.51019055],"study_design_scores_gemma":[0.00001538645,0.0000865891,0.0007192626,0.0009878625,0.000032164437,0.00036992718,0.000059971597,0.0018301926,0.0006185059,0.10091922,0.89433485,0.000026105474],"about_ca_topic_score_codex":0.0014114657,"about_ca_topic_score_gemma":0.0014400107,"teacher_disagreement_score":0.019617543,"about_ca_system_score_codex":0.0011991411,"about_ca_system_score_gemma":0.0011150759,"threshold_uncertainty_score":0.06562716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003350378,0.038638406,0.3859714,0.011823825,0.0018548842,0.00059553265,0.0020442125,0.00047314796,0.55524826],"genre_scores_gemma":[0.3557444,0.12816755,0.2733585,0.010038805,0.004082544,0.0027184119,0.0039459523,0.00046803357,0.22147584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757034,0.0010289523,0.00015673549,0.0003349689,0.0007727346,0.0001362626],"domain_scores_gemma":[0.9983912,0.0010304435,0.0000947946,0.00016025486,0.0002619193,0.00006139129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020809884,0.0014327678,0.0012744095,0.0021765893,0.0011322793,0.004246774,0.0017812194,0.0019534335,0.020937812],"category_scores_gemma":[0.0045742486,0.0003832357,0.0009791123,0.0023284291,0.0030763347,0.0034623044,0.0014470582,0.0024269833,0.0068516773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064630044,0.000017606308,0.00011527734,0.00024233379,0.000023239616,0.00006392751,0.00011904398,0.004463616,0.00012760378,0.9451832,0.02147148,0.028166246],"study_design_scores_gemma":[0.000011409238,0.000022692793,0.00013098113,0.0003097885,0.000013240124,0.00015898644,0.0001044703,0.005657657,0.00012849957,0.73165834,0.2617881,0.000015758342],"about_ca_topic_score_codex":0.003640161,"about_ca_topic_score_gemma":0.0024289952,"teacher_disagreement_score":0.020937812,"about_ca_system_score_codex":0.003083651,"about_ca_system_score_gemma":0.002257308,"threshold_uncertainty_score":0.07004392},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02125472,0.006067386,0.34601688,0.016414499,0.0012175873,0.00067905185,0.0037081176,0.0012639562,0.6033778],"genre_scores_gemma":[0.59555364,0.008196796,0.12213584,0.003565803,0.0010460621,0.0012268209,0.0043518473,0.00022712881,0.2636961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00042599015,0.00013679353,0.000560468,0.00040613738,0.00020679274],"domain_scores_gemma":[0.99819404,0.0005934298,0.00020226085,0.0003628306,0.00047700276,0.0001704169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011463189,0.0007218548,0.0007270524,0.0012355149,0.001770593,0.005188152,0.0014447145,0.0021593291,0.04735024],"category_scores_gemma":[0.004737351,0.0002696547,0.0007811174,0.001112938,0.002685592,0.004078175,0.0037155836,0.0017711492,0.0101974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011443349,0.000021802378,0.00046812627,0.0000935758,0.000022510189,0.000097750155,0.00016745782,0.00551102,0.00025564627,0.957402,0.010087651,0.02586104],"study_design_scores_gemma":[0.00001856369,0.000025795656,0.00035243522,0.00007820885,0.000012402981,0.00013303773,0.00015994946,0.010860963,0.00023673107,0.803398,0.1847047,0.000019329931],"about_ca_topic_score_codex":0.0039560273,"about_ca_topic_score_gemma":0.002090214,"teacher_disagreement_score":0.04735024,"about_ca_system_score_codex":0.0027281984,"about_ca_system_score_gemma":0.002369209,"threshold_uncertainty_score":0.15840226},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45992312,0.0032797602,0.015058195,0.0035055242,0.0013540757,0.00069341826,0.011831199,0.00040831033,0.50394636],"genre_scores_gemma":[0.7664886,0.0007940387,0.0051407604,0.0024806,0.00032034633,0.0008169902,0.013788348,0.00029354554,0.20987675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929426,0.0023167536,0.0004377674,0.0017386269,0.0015072047,0.0010571242],"domain_scores_gemma":[0.9569468,0.017280653,0.0024447103,0.0078047453,0.013919961,0.0016031183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008545296,0.00047511846,0.0006604739,0.0045488705,0.002726262,0.0032610325,0.0014457145,0.0011236939,0.13498318],"category_scores_gemma":[0.046033934,0.0003516717,0.0009911872,0.0039249053,0.000713711,0.002564757,0.0047828653,0.0020147497,0.025307769],"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.0013561306,0.001844003,0.33209586,0.0010890617,0.0013119032,0.0012115339,0.021170925,0.0011730853,0.0037019108,0.10088506,0.19305544,0.3411052],"study_design_scores_gemma":[0.00009753825,0.00057976437,0.57940936,0.0009692056,0.00050548854,0.0008583198,0.0276925,0.001298366,0.0033440748,0.012620949,0.3725569,0.00006754666],"about_ca_topic_score_codex":0.01282081,"about_ca_topic_score_gemma":0.014237355,"teacher_disagreement_score":0.13498318,"about_ca_system_score_codex":0.0017166882,"about_ca_system_score_gemma":0.001991737,"threshold_uncertainty_score":0.45156372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10759482,0.00033057,0.88483065,0.0004059786,0.000074979944,0.00018592045,0.000047336,0.00015079016,0.0063788868],"genre_scores_gemma":[0.8677794,0.00030284224,0.12648572,0.000055220877,0.00004930157,0.00028048235,0.000055954984,0.000030440542,0.0049606194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837154,0.00074485276,0.00008563115,0.00023650669,0.0003391927,0.00022234746],"domain_scores_gemma":[0.99455255,0.0024385366,0.001004265,0.00077134604,0.00068557326,0.0005476119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030770341,0.0005686594,0.0010504804,0.0009909666,0.0013624985,0.0018264652,0.0025224846,0.0016202042,0.0023254913],"category_scores_gemma":[0.010474452,0.0004456649,0.0010430253,0.0009489255,0.0013850505,0.0032978894,0.0019664622,0.0009889642,0.00037653002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033232794,0.00038313857,0.003429812,0.00019363152,0.00034656757,0.0006778414,0.0011543276,0.37682188,0.0117772585,0.5455923,0.00226491,0.05702601],"study_design_scores_gemma":[0.000090152666,0.00023691572,0.0004915936,0.00002137158,0.00008713082,0.00023611184,0.00013822796,0.9225628,0.0019233598,0.07014417,0.0040296395,0.000038465467],"about_ca_topic_score_codex":0.001833751,"about_ca_topic_score_gemma":0.00095494726,"teacher_disagreement_score":0.0030770341,"about_ca_system_score_codex":0.0012092394,"about_ca_system_score_gemma":0.0013380252,"threshold_uncertainty_score":0.016273081},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052359127,0.0016007336,0.22004877,0.015452522,0.0024269514,0.000294117,0.0005207676,0.0014820541,0.70581496],"genre_scores_gemma":[0.82705754,0.0007794462,0.024439234,0.0021449577,0.0008298974,0.0002535574,0.0003206348,0.00018726611,0.14398749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794346,0.00092194247,0.000104483865,0.00028268548,0.00057678827,0.00017071566],"domain_scores_gemma":[0.99107575,0.0058620195,0.00047972225,0.0013009323,0.0009262174,0.00035533827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018995391,0.00077707827,0.00046575262,0.0011483436,0.00086824823,0.003357301,0.00083029264,0.0033182479,0.05030519],"category_scores_gemma":[0.019273985,0.00032299582,0.0005115131,0.0006140589,0.0011622322,0.0030674154,0.0018613907,0.0024705094,0.011725163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004637543,0.00026997898,0.00062703545,0.00040977026,0.000061443294,0.00030300624,0.00088652293,0.0035490252,0.008782415,0.83833164,0.025826769,0.12048861],"study_design_scores_gemma":[0.00014550114,0.00024622364,0.0008370868,0.00016713125,0.00006879322,0.00072342926,0.0003943779,0.026569422,0.0050404603,0.8910371,0.07470228,0.00006813357],"about_ca_topic_score_codex":0.00018309403,"about_ca_topic_score_gemma":0.00016227062,"teacher_disagreement_score":0.05030519,"about_ca_system_score_codex":0.00050215865,"about_ca_system_score_gemma":0.0005650438,"threshold_uncertainty_score":0.16828763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3352181,0.001357348,0.54189336,0.0077317283,0.0005130885,0.000252475,0.0005925818,0.0003166005,0.11212467],"genre_scores_gemma":[0.9655895,0.0008267772,0.023209687,0.00059073017,0.00030518437,0.000195923,0.0000787523,0.00006449755,0.009138947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806255,0.00081379147,0.00006545265,0.00031291982,0.00044788572,0.00029742753],"domain_scores_gemma":[0.9922374,0.00591518,0.00046439786,0.00035435075,0.00035178667,0.0006768764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030571655,0.0009316972,0.0011435781,0.0011086415,0.0013566809,0.0031447576,0.0015077256,0.0015818321,0.0045124735],"category_scores_gemma":[0.01487226,0.0006533655,0.00097401085,0.0007320522,0.004337433,0.005471075,0.0029799659,0.0037211922,0.0005410482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106633386,0.000020282303,0.00038338354,0.00007316201,0.000035915924,0.00011165506,0.0001438016,0.008201668,0.00094237813,0.9818388,0.001950398,0.0061920155],"study_design_scores_gemma":[0.000037378704,0.000039419927,0.00023649588,0.000023848157,0.000020474616,0.00011227614,0.00003637638,0.03206017,0.00076381094,0.9650082,0.0016421265,0.000019353518],"about_ca_topic_score_codex":0.0008996002,"about_ca_topic_score_gemma":0.0007484348,"teacher_disagreement_score":0.0045124735,"about_ca_system_score_codex":0.0018893102,"about_ca_system_score_gemma":0.0018380677,"threshold_uncertainty_score":0.016168058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025326492,0.00021540352,0.9680836,0.00022821118,0.00006312501,0.00008586089,0.000052598505,0.0001456751,0.0057990276],"genre_scores_gemma":[0.48767853,0.00023597453,0.5048114,0.00021675129,0.00007737078,0.0004539969,0.00023304037,0.0001263215,0.0061665694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.00025824082,0.0000217097,0.00010993996,0.00011922891,0.00009279148],"domain_scores_gemma":[0.9987357,0.0009524241,0.000075321106,0.00005469958,0.00012722402,0.000054493496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012286362,0.0012861388,0.0019863746,0.0016170378,0.0008655199,0.0016310938,0.0026620252,0.0029302072,0.0038385962],"category_scores_gemma":[0.0024034898,0.00094142446,0.0018855723,0.0012596193,0.0010205484,0.0016997261,0.0016473595,0.0021708182,0.0003269556],"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.0000405175,0.000051578856,0.00017154071,0.00004538156,0.000049321905,0.000057562604,0.000031800064,0.9767984,0.00041746057,0.010215668,0.00044512207,0.011675564],"study_design_scores_gemma":[0.000008779628,0.00000989919,0.000017037537,0.000002941068,0.0000067054457,0.000007882875,0.000006396081,0.99703515,0.0000727855,0.0027108074,0.00011885176,0.0000027819008],"about_ca_topic_score_codex":0.0097331945,"about_ca_topic_score_gemma":0.0069406456,"teacher_disagreement_score":0.0097331945,"about_ca_system_score_codex":0.0011033482,"about_ca_system_score_gemma":0.0020370435,"threshold_uncertainty_score":0.019353092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16934972,0.00057327404,0.8149442,0.00058180664,0.00006654488,0.00016138032,0.00015411917,0.000055436303,0.014113472],"genre_scores_gemma":[0.94950616,0.0004679064,0.043225035,0.00011790001,0.00003633653,0.0002021851,0.00007987807,0.0000307533,0.00633389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987728,0.00060605287,0.00003272247,0.00016247774,0.00022900233,0.00019690167],"domain_scores_gemma":[0.9979652,0.0013858537,0.00027308267,0.000041881136,0.00019183134,0.00014223983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024350432,0.0012217311,0.0017352386,0.00084220804,0.0006356349,0.0018660768,0.0016471902,0.0014140556,0.0039829114],"category_scores_gemma":[0.0031775092,0.0008071232,0.0014752089,0.00087143626,0.0011952565,0.0021013792,0.0012413758,0.0013059761,0.00018169299],"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.00003989404,0.00004223608,0.00035360546,0.00008136963,0.00005814089,0.00014274853,0.00004858622,0.9615442,0.0006661612,0.03459585,0.0002781959,0.0021489873],"study_design_scores_gemma":[0.000008325938,0.000025822888,0.000100058525,0.0000039693427,0.000009317168,0.000012066928,0.000019369632,0.9920616,0.00008103442,0.007536755,0.00013566016,0.000006133766],"about_ca_topic_score_codex":0.006699137,"about_ca_topic_score_gemma":0.005151164,"teacher_disagreement_score":0.006699137,"about_ca_system_score_codex":0.0019084894,"about_ca_system_score_gemma":0.0021964149,"threshold_uncertainty_score":0.013847172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031020073,0.0046970267,0.40598175,0.0016732318,0.00091253914,0.00010906982,0.00026599443,0.00023578704,0.5551046],"genre_scores_gemma":[0.6315237,0.0058724214,0.13318959,0.00060093834,0.00067741255,0.00027906997,0.00046068203,0.00022656098,0.22716963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993063,0.0002730559,0.000030536026,0.00009975427,0.0002110624,0.00007928658],"domain_scores_gemma":[0.99950135,0.00023228505,0.000033987897,0.00010847164,0.00007300828,0.000050843806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007186825,0.0009235211,0.00056050904,0.0005352196,0.00051831186,0.0025652533,0.0013994197,0.0008138647,0.008431184],"category_scores_gemma":[0.0022822774,0.00033252029,0.00097541924,0.00096105767,0.0014249797,0.002652878,0.0011845987,0.0029128015,0.0013564102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016739486,0.000014415773,0.000050358525,0.00002893011,0.000008495198,0.000019777955,0.000057496432,0.0035461464,0.00031350806,0.98015493,0.0031563744,0.012632899],"study_design_scores_gemma":[0.000013516433,0.000025970601,0.00013805956,0.00002789203,0.000008932769,0.000109071094,0.00003900847,0.023587916,0.00021213463,0.9539017,0.021925874,0.000009959609],"about_ca_topic_score_codex":0.0011560852,"about_ca_topic_score_gemma":0.0011132143,"teacher_disagreement_score":0.008431184,"about_ca_system_score_codex":0.00092056097,"about_ca_system_score_gemma":0.0005982404,"threshold_uncertainty_score":0.028205156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027358951,0.0012338911,0.8810604,0.004826403,0.00033780062,0.00025339966,0.0005405135,0.00013500001,0.08425373],"genre_scores_gemma":[0.8063941,0.0021558881,0.15658858,0.0017633187,0.0005008941,0.00069957366,0.0004310152,0.0000695535,0.031397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979887,0.0007900452,0.00009908644,0.00035907238,0.0005409996,0.00022218082],"domain_scores_gemma":[0.997537,0.0013384784,0.000268091,0.00029567824,0.00031093496,0.0002498645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019631307,0.0007072692,0.0009832536,0.00075589813,0.0010215236,0.0029110722,0.0017917568,0.0017754844,0.008369354],"category_scores_gemma":[0.005991537,0.00037859313,0.0008971303,0.0009349202,0.003567165,0.0048392173,0.0022622289,0.002423339,0.0007233701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077774575,0.000014613696,0.00009233251,0.000019866628,0.000008256179,0.000031111755,0.00003821367,0.011049843,0.00013028027,0.9847136,0.0009871651,0.0029069819],"study_design_scores_gemma":[0.00001611227,0.000015704753,0.00006563047,0.00001531194,0.000006267089,0.000036965477,0.000022619633,0.07693013,0.00012897016,0.91607535,0.006675447,0.000011557916],"about_ca_topic_score_codex":0.0018346389,"about_ca_topic_score_gemma":0.0015133555,"teacher_disagreement_score":0.008369354,"about_ca_system_score_codex":0.0018185931,"about_ca_system_score_gemma":0.0015670746,"threshold_uncertainty_score":0.027998269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022933727,0.00039447786,0.9513857,0.0013814901,0.00006945658,0.00008706706,0.00024297214,0.00017162068,0.023333624],"genre_scores_gemma":[0.84805685,0.0010653943,0.1324097,0.00044065443,0.00017339832,0.00051979953,0.00033435036,0.00016167249,0.016838226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979247,0.0011956567,0.000059700964,0.0003698698,0.00027218758,0.00017788062],"domain_scores_gemma":[0.9944265,0.0041463166,0.0005528472,0.00029276326,0.00034111776,0.00024031416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563413,0.0015599412,0.0012847718,0.0015836835,0.0013855036,0.0030067791,0.002245251,0.002990488,0.010531629],"category_scores_gemma":[0.0102564795,0.0005355533,0.0014303671,0.0020299444,0.004620128,0.0048477533,0.0022718064,0.003210787,0.0013322624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041702617,0.000022693308,0.00020302585,0.000045112356,0.00003294434,0.0000960063,0.0001681151,0.17550044,0.00042421816,0.8176978,0.0010648847,0.004703004],"study_design_scores_gemma":[0.000024979961,0.000025120838,0.00007436928,0.000013646415,0.000009813071,0.00003576512,0.000048627568,0.34063557,0.00009061126,0.6572814,0.0017425517,0.00001754398],"about_ca_topic_score_codex":0.004519436,"about_ca_topic_score_gemma":0.0033304018,"teacher_disagreement_score":0.010531629,"about_ca_system_score_codex":0.003062607,"about_ca_system_score_gemma":0.0015326039,"threshold_uncertainty_score":0.03523183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26154792,0.00046481108,0.7124087,0.002166015,0.000060261922,0.00019789864,0.00045192285,0.00031896713,0.022383446],"genre_scores_gemma":[0.95425415,0.000397081,0.03580126,0.0003035127,0.00004885873,0.000255567,0.00016570205,0.00009655375,0.008677233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820316,0.00073213247,0.00007539015,0.00029620263,0.00028823808,0.00040483047],"domain_scores_gemma":[0.9855057,0.010720996,0.0014856166,0.00057368935,0.0007265065,0.0009873535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030202,0.0012724057,0.00201884,0.0009191985,0.0013197302,0.0028837714,0.0028425625,0.002290842,0.0075005325],"category_scores_gemma":[0.019877844,0.0008292861,0.00137415,0.0010234918,0.0033395025,0.0048175533,0.0022046138,0.0032549284,0.0007301644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039631873,0.00015042555,0.0009386251,0.00013479739,0.00004515117,0.00025978417,0.00038445898,0.17930084,0.004789826,0.8058016,0.0014004238,0.0063977763],"study_design_scores_gemma":[0.000081367354,0.00006290634,0.00029794677,0.000034148397,0.00001458629,0.000085500666,0.00014192748,0.74714404,0.0011613899,0.2502816,0.00065752707,0.000037135775],"about_ca_topic_score_codex":0.00269667,"about_ca_topic_score_gemma":0.0020704712,"teacher_disagreement_score":0.0075005325,"about_ca_system_score_codex":0.0029234833,"about_ca_system_score_gemma":0.0015608439,"threshold_uncertainty_score":0.025091767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029925406,0.00023019144,0.9546346,0.0010232453,0.00012890581,0.0001383468,0.00028596088,0.0001566687,0.013476627],"genre_scores_gemma":[0.6618232,0.000836871,0.32221127,0.00035371346,0.00015545926,0.0005724497,0.00048230938,0.00025404178,0.013310676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815685,0.0012540859,0.000050550698,0.00021142184,0.00019633409,0.00013070827],"domain_scores_gemma":[0.9918498,0.006859722,0.00030222957,0.00021759336,0.00041520008,0.00035542625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030607486,0.0012820123,0.0017798168,0.0020190675,0.0012786735,0.0032443455,0.0028819442,0.0036713977,0.009494588],"category_scores_gemma":[0.010359388,0.0006183691,0.0020823188,0.0036701404,0.002439335,0.004280612,0.0020968197,0.0027801765,0.0008374306],"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.000066210014,0.00007443667,0.00050421036,0.00006914137,0.00004513305,0.00017509384,0.00020853417,0.58875054,0.0003737263,0.3998798,0.001608069,0.008245013],"study_design_scores_gemma":[0.000017911421,0.000020043393,0.00007350233,0.0000066758034,0.000013342513,0.000024057234,0.000052232816,0.8952092,0.00004457691,0.10373492,0.0007868098,0.00001667531],"about_ca_topic_score_codex":0.0179242,"about_ca_topic_score_gemma":0.0134508135,"teacher_disagreement_score":0.0179242,"about_ca_system_score_codex":0.0029410727,"about_ca_system_score_gemma":0.0025132736,"threshold_uncertainty_score":0.035639703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06159953,0.021006644,0.62711215,0.047768496,0.0043284576,0.00013073278,0.00064770615,0.0015906083,0.23581573],"genre_scores_gemma":[0.83241767,0.010900843,0.1159586,0.0049549597,0.0024453888,0.00023024502,0.000590244,0.001998347,0.030503644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955792,0.0017287607,0.00021968059,0.0010157021,0.0010985349,0.0003581568],"domain_scores_gemma":[0.9873131,0.007449474,0.00064590044,0.0031180477,0.0009983792,0.00047509308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046652425,0.001137261,0.0010253843,0.0016792917,0.0015927098,0.007091048,0.0025195,0.0034869798,0.023953037],"category_scores_gemma":[0.026053952,0.0008024364,0.0011894295,0.001151863,0.010847006,0.024851995,0.008863078,0.0049594464,0.0025573059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005490145,0.00003186465,0.00048250452,0.00025291063,0.00003054345,0.00011474781,0.0011623242,0.0019896708,0.001922282,0.94974375,0.0043820003,0.039832547],"study_design_scores_gemma":[0.000015722331,0.00003477609,0.00034019866,0.00015424419,0.000026067808,0.00013923098,0.00046491929,0.005089236,0.0012861445,0.91399753,0.07841134,0.000040583844],"about_ca_topic_score_codex":0.0020606578,"about_ca_topic_score_gemma":0.00177981,"teacher_disagreement_score":0.023953037,"about_ca_system_score_codex":0.0015278305,"about_ca_system_score_gemma":0.0011519014,"threshold_uncertainty_score":0.080130935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5028117,0.00051054393,0.466099,0.002158551,0.00015468556,0.00018163529,0.00042386167,0.00028335972,0.027376665],"genre_scores_gemma":[0.987158,0.00019958906,0.008231926,0.00010154705,0.00007457437,0.00006216362,0.00010600458,0.00003377406,0.004032333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654007,0.0017015425,0.00015622446,0.00065993704,0.0005096382,0.00043259183],"domain_scores_gemma":[0.93921906,0.05035986,0.0049663805,0.0020066623,0.0021326635,0.0013153263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071183546,0.0009894817,0.0028816715,0.0015659729,0.0014060275,0.004870488,0.003046999,0.0033642522,0.0073470776],"category_scores_gemma":[0.057629082,0.0011385656,0.0015169315,0.0011123487,0.004525213,0.007081687,0.002428465,0.0034138092,0.00061334413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004022027,0.00010180795,0.0045579537,0.00012877035,0.00016187473,0.0003483577,0.00069174304,0.3190568,0.00066554226,0.6628557,0.0026591267,0.008370099],"study_design_scores_gemma":[0.000049337646,0.00003334696,0.0007640592,0.000022405646,0.000023869325,0.000047895406,0.00010422372,0.6672164,0.00013076661,0.33132815,0.00022211461,0.00005729367],"about_ca_topic_score_codex":0.0059629595,"about_ca_topic_score_gemma":0.0053035575,"teacher_disagreement_score":0.0073470776,"about_ca_system_score_codex":0.0021774843,"about_ca_system_score_gemma":0.0016260713,"threshold_uncertainty_score":0.037645936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17306495,0.0016737385,0.43382686,0.017688919,0.0034449,0.1405796,0.07637035,0.0021111316,0.15123963],"genre_scores_gemma":[0.34609962,0.001407019,0.30360532,0.007131908,0.0017303848,0.15816873,0.025875732,0.0007565113,0.15522483],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95623744,0.025147924,0.0057168626,0.006436057,0.0047432734,0.0017185429],"domain_scores_gemma":[0.890644,0.040926214,0.00524323,0.04401545,0.016111275,0.0030599276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.043771103,0.0010975866,0.00202775,0.0020820294,0.0022441924,0.004031153,0.0025595666,0.0031102914,0.09259801],"category_scores_gemma":[0.10749935,0.0018361912,0.0010347945,0.002467003,0.0017868844,0.0033465566,0.0031906974,0.0026602964,0.04623408],"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.030302387,0.005713244,0.10513373,0.004786943,0.00067572895,0.004048178,0.012405744,0.006233795,0.019299155,0.08637347,0.277824,0.44720352],"study_design_scores_gemma":[0.004178126,0.0040655923,0.030394293,0.002094283,0.00055433944,0.001757715,0.0057370085,0.022046717,0.022862367,0.055988286,0.85003597,0.00028524638],"about_ca_topic_score_codex":0.0024815176,"about_ca_topic_score_gemma":0.0022541068,"teacher_disagreement_score":0.09259801,"about_ca_system_score_codex":0.0016280334,"about_ca_system_score_gemma":0.009008272,"threshold_uncertainty_score":0.30977124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51582694,0.0007946569,0.079889536,0.008670154,0.00021453027,0.00013661673,0.0001361942,0.00010717403,0.3942242],"genre_scores_gemma":[0.99479514,0.000083839186,0.0009146564,0.0001773894,0.000039180577,0.000034529818,0.000013606489,0.000010486561,0.00393124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99333173,0.0032026705,0.00033367975,0.00068912416,0.0012806992,0.0011621354],"domain_scores_gemma":[0.9525773,0.03417659,0.005029164,0.003254764,0.0027648308,0.0021973564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00890538,0.00045963813,0.0010118315,0.0015162381,0.0019222284,0.007583623,0.0012643231,0.0039054689,0.011497316],"category_scores_gemma":[0.052496485,0.00038106626,0.00069696753,0.0011533607,0.006527241,0.006939949,0.00445828,0.0043136617,0.00086649734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014112737,0.00012426649,0.0049416297,0.000084858926,0.000033847253,0.00019969187,0.0017011672,0.005104804,0.0007917872,0.9767372,0.0010219782,0.0091176275],"study_design_scores_gemma":[0.000044323842,0.00008223994,0.00279416,0.000039552364,0.000021385935,0.0001029626,0.002074752,0.0099993795,0.00036634016,0.9814817,0.002971622,0.000021541871],"about_ca_topic_score_codex":0.0008006003,"about_ca_topic_score_gemma":0.00056768674,"teacher_disagreement_score":0.011497316,"about_ca_system_score_codex":0.0032957038,"about_ca_system_score_gemma":0.0013021587,"threshold_uncertainty_score":0.04709673},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01669028,0.00020087471,0.9792291,0.00026537827,0.000025231799,0.000048061058,0.000018872746,0.00012241435,0.0033997567],"genre_scores_gemma":[0.8536125,0.00029366201,0.14345191,0.000121438294,0.000052832424,0.00012101217,0.000017013523,0.000048249105,0.0022813207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990038,0.00048461882,0.00003394277,0.00013094563,0.00021720442,0.00012943709],"domain_scores_gemma":[0.99831593,0.0010345046,0.00016417303,0.0001588451,0.0002057203,0.00012079414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028432857,0.0007431113,0.0007853957,0.0005755243,0.0005367768,0.0011227572,0.0017547531,0.0008952551,0.0017917942],"category_scores_gemma":[0.0074282917,0.00036734468,0.0005270309,0.0004789216,0.0015828777,0.0022197878,0.0015558358,0.0014026352,0.00021224284],"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.0000932658,0.0000766347,0.0004277646,0.00008069266,0.00003612318,0.000054445063,0.00009347194,0.7040732,0.0028638456,0.2564332,0.0017378337,0.034029536],"study_design_scores_gemma":[0.000011001914,0.000041407693,0.000051855666,0.000006242541,0.00000597099,0.00001886845,0.000006774114,0.9623008,0.00034388457,0.036699086,0.00050662045,0.000007467931],"about_ca_topic_score_codex":0.0019684462,"about_ca_topic_score_gemma":0.0016412125,"teacher_disagreement_score":0.0028432857,"about_ca_system_score_codex":0.0020437993,"about_ca_system_score_gemma":0.0019096333,"threshold_uncertainty_score":0.015036941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6629073,0.000825209,0.27436703,0.0034182833,0.00021626323,0.00017742736,0.0003343292,0.00045180586,0.057302333],"genre_scores_gemma":[0.99223584,0.00013421683,0.0049618883,0.00008585061,0.000021599159,0.00002882142,0.000032784457,0.000035834477,0.0024631226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974711,0.0016038402,0.0000564246,0.0002352292,0.00022033516,0.00041307305],"domain_scores_gemma":[0.9638986,0.030443104,0.0015847706,0.0013962704,0.0011069846,0.0015702994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004458263,0.0011278033,0.0016697287,0.0012917165,0.0010871954,0.0025153356,0.0024058484,0.002602486,0.013678525],"category_scores_gemma":[0.03756248,0.00049632613,0.0008166638,0.000978681,0.0022298426,0.00499958,0.0020539262,0.0026429712,0.000517128],"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.0007305308,0.00028212392,0.001277168,0.00019122055,0.00011198316,0.00021570956,0.00018446041,0.80508757,0.0016262546,0.17227627,0.0018597932,0.016157009],"study_design_scores_gemma":[0.00010427809,0.00022141349,0.0006961722,0.00002488245,0.00009105738,0.000057096317,0.00013897759,0.87560356,0.0005388176,0.12190968,0.0005778525,0.000036208934],"about_ca_topic_score_codex":0.005366428,"about_ca_topic_score_gemma":0.006130562,"teacher_disagreement_score":0.013678525,"about_ca_system_score_codex":0.001645386,"about_ca_system_score_gemma":0.001812476,"threshold_uncertainty_score":0.0457592},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4939583,0.0017734999,0.3516032,0.0037574992,0.00036433537,0.00022629477,0.00058221957,0.0001780762,0.14755665],"genre_scores_gemma":[0.98543674,0.00037359158,0.0068879738,0.00013851367,0.00007133153,0.000055721255,0.00007347662,0.000014780652,0.0069479747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842876,0.0006904917,0.000040680596,0.00021686152,0.00031183416,0.00031134358],"domain_scores_gemma":[0.99612194,0.002172167,0.00065243174,0.00039357776,0.00021890814,0.00044105764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012457465,0.0010953759,0.0011961795,0.0007446986,0.0009758199,0.0017877794,0.0014630759,0.0019948257,0.0061720037],"category_scores_gemma":[0.0067377896,0.00032398457,0.0006272084,0.0006570144,0.0021709143,0.0030753142,0.0018439455,0.001795503,0.00049258716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024327483,0.000095527896,0.00049826055,0.00016676306,0.00008052399,0.0004533859,0.00012393901,0.13273098,0.002882637,0.8532132,0.0022209939,0.00729045],"study_design_scores_gemma":[0.0001775913,0.00016034584,0.0004371794,0.000039797305,0.000032724445,0.00033385237,0.00011467053,0.3478784,0.0017044896,0.6426328,0.006440782,0.000047462687],"about_ca_topic_score_codex":0.00089721795,"about_ca_topic_score_gemma":0.0005944539,"teacher_disagreement_score":0.0061720037,"about_ca_system_score_codex":0.0012168973,"about_ca_system_score_gemma":0.0006007915,"threshold_uncertainty_score":0.020647407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11058937,0.00011396301,0.8822041,0.00029468082,0.0000226961,0.00012233316,0.00019178777,0.0013481177,0.005112861],"genre_scores_gemma":[0.7043401,0.000093382165,0.2918157,0.00013145657,0.00001680838,0.00016703324,0.000501088,0.0002145979,0.002719942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868613,0.0003824273,0.00007740583,0.00031448566,0.00030907962,0.00023051004],"domain_scores_gemma":[0.9967631,0.002213823,0.00023551889,0.00040551138,0.00022490328,0.00015715115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016079633,0.0009281376,0.00128198,0.0007668947,0.0006896757,0.0019011961,0.0021683346,0.00093037327,0.0044056913],"category_scores_gemma":[0.010967818,0.00065329636,0.00088057434,0.0007764683,0.0015106034,0.0031807823,0.0024454484,0.0017274471,0.0007090198],"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.0010296113,0.00019498644,0.0029530963,0.00028176705,0.000100303376,0.0002139134,0.00047792413,0.50043225,0.0050425655,0.3816068,0.0037154523,0.10395126],"study_design_scores_gemma":[0.000046762587,0.000043608856,0.00014701828,0.000012137131,0.000010403192,0.000029462995,0.0000324025,0.856509,0.0021967848,0.14041273,0.00054607354,0.000013625571],"about_ca_topic_score_codex":0.0037646051,"about_ca_topic_score_gemma":0.005937007,"teacher_disagreement_score":0.0044056913,"about_ca_system_score_codex":0.0020423662,"about_ca_system_score_gemma":0.0017968906,"threshold_uncertainty_score":0.01481849},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10854231,0.0006199646,0.8786373,0.0013534572,0.000081623206,0.00003670957,0.000116164294,0.0001918712,0.01042066],"genre_scores_gemma":[0.975966,0.00030672734,0.021155117,0.00013388404,0.00003991171,0.00006973902,0.00007182107,0.000030196406,0.0022266814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987355,0.00061454566,0.00004342586,0.00015592967,0.0003010761,0.00014952768],"domain_scores_gemma":[0.99569786,0.0032739586,0.00038691354,0.00028472056,0.00022018564,0.00013636857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023777334,0.0006361251,0.0012590627,0.0005158578,0.00055490976,0.0015860352,0.0012462349,0.0012214268,0.0014258451],"category_scores_gemma":[0.012572635,0.0005247581,0.00064362644,0.00043755898,0.0030958047,0.002479085,0.0013690034,0.001951056,0.00013188305],"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.000030875224,0.00001965774,0.0001988122,0.00003862098,0.000018732877,0.000031595893,0.00006084265,0.7640949,0.00028814518,0.23299743,0.00033566027,0.0018847277],"study_design_scores_gemma":[0.000005736633,0.000009664494,0.00003205932,0.0000059227254,0.0000020097973,0.0000036551194,0.000009189714,0.94970804,0.00005895746,0.050056662,0.00010423092,0.0000038505486],"about_ca_topic_score_codex":0.0077829217,"about_ca_topic_score_gemma":0.0041209827,"teacher_disagreement_score":0.0077829217,"about_ca_system_score_codex":0.003062942,"about_ca_system_score_gemma":0.0015642846,"threshold_uncertainty_score":0.022223353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3859266,0.0026089642,0.46812242,0.012074814,0.00033522342,0.0005384431,0.0006364032,0.00020926654,0.12954772],"genre_scores_gemma":[0.96288157,0.0011916691,0.023845816,0.00092452613,0.00032121554,0.00032396865,0.00019689761,0.000084513726,0.010229824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98559153,0.009957927,0.0004713979,0.0012880397,0.0012280261,0.0014631567],"domain_scores_gemma":[0.82443404,0.16414699,0.0042869397,0.0025258984,0.0024386146,0.0021675178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018550852,0.0022172693,0.006573709,0.0021767924,0.0018449298,0.005599018,0.0035620213,0.0069136955,0.012663251],"category_scores_gemma":[0.09369376,0.0018296132,0.0018184675,0.0015394686,0.0067175683,0.00768449,0.004003768,0.0056127585,0.0009845949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007829251,0.00038187683,0.0020381687,0.00040385465,0.0002580314,0.00031439634,0.00093878957,0.24003042,0.0011358657,0.73084927,0.0058061993,0.017060207],"study_design_scores_gemma":[0.0002805485,0.0001928396,0.0012581155,0.000101604295,0.000086828724,0.00011501489,0.000290354,0.27672303,0.00034635633,0.71926326,0.0012863312,0.000055699147],"about_ca_topic_score_codex":0.0038337817,"about_ca_topic_score_gemma":0.0027165636,"teacher_disagreement_score":0.018550852,"about_ca_system_score_codex":0.0032772867,"about_ca_system_score_gemma":0.0027905724,"threshold_uncertainty_score":0.09810746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2985672,0.0014946739,0.68461233,0.003243033,0.00012038349,0.00034671224,0.0006136546,0.00061397365,0.010387945],"genre_scores_gemma":[0.94173425,0.0010800067,0.046460915,0.0003780587,0.00019579881,0.0002763748,0.00041231693,0.00016756073,0.009294764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651945,0.0013857465,0.0001931779,0.00092027313,0.00052733516,0.00045406356],"domain_scores_gemma":[0.8459422,0.13186172,0.009838757,0.006031198,0.004693291,0.0016328625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012052968,0.00084983866,0.002445296,0.0016897226,0.00080167217,0.0031000385,0.0023422085,0.002421052,0.0066602947],"category_scores_gemma":[0.10388829,0.0011988482,0.0013511807,0.0010905525,0.0025786918,0.008989931,0.0018380773,0.0033677921,0.0011971445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013388685,0.00046599327,0.023107551,0.000736377,0.0003460667,0.00082901015,0.0016323113,0.38668343,0.00681528,0.4162037,0.0059789517,0.15586239],"study_design_scores_gemma":[0.00015910332,0.00021295433,0.0049756886,0.00006223953,0.00007175816,0.00040230402,0.00009824907,0.7886973,0.0017507516,0.20141165,0.002064157,0.000093914205],"about_ca_topic_score_codex":0.0039250283,"about_ca_topic_score_gemma":0.0019504218,"teacher_disagreement_score":0.012052968,"about_ca_system_score_codex":0.0015908229,"about_ca_system_score_gemma":0.0009686388,"threshold_uncertainty_score":0.063742936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14270383,0.000595325,0.824713,0.0042449906,0.00018519019,0.00015349733,0.00020542403,0.00024930405,0.026949443],"genre_scores_gemma":[0.9619027,0.00023392038,0.027126003,0.0002193245,0.00009466626,0.00014436313,0.000053573687,0.00003371463,0.010191618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520564,0.0022469796,0.00019715971,0.00096395856,0.000559437,0.00082681316],"domain_scores_gemma":[0.9911724,0.0050546504,0.0012125452,0.0015625533,0.0004180535,0.00057989254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055789226,0.0010057287,0.0016040411,0.00045539511,0.0012384817,0.003315333,0.0018472386,0.0029717912,0.0062769866],"category_scores_gemma":[0.016287718,0.0007769024,0.0014311397,0.0005590831,0.0031469662,0.0059071365,0.0038822354,0.0031288273,0.0008408277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028863247,0.00020973384,0.0015807002,0.00015290259,0.00010342731,0.0006582895,0.00062683964,0.19972932,0.0015961636,0.77639216,0.0020524103,0.0166094],"study_design_scores_gemma":[0.00018130738,0.00015041204,0.00045632294,0.00003587253,0.00003937441,0.00021647256,0.00018732011,0.41961542,0.0008292188,0.57411134,0.004121642,0.000055322682],"about_ca_topic_score_codex":0.0022388871,"about_ca_topic_score_gemma":0.0014081174,"teacher_disagreement_score":0.0062769866,"about_ca_system_score_codex":0.001993791,"about_ca_system_score_gemma":0.0017586873,"threshold_uncertainty_score":0.029504478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005466828,0.029433312,0.186467,0.0029429737,0.0014306052,0.000083798186,0.00037666163,0.00020695677,0.7735919],"genre_scores_gemma":[0.27765098,0.026977172,0.048114695,0.0023336962,0.0018580972,0.00064440095,0.00089815335,0.00022668995,0.64129615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995851,0.000107105814,0.00001875739,0.00006734836,0.00017936814,0.000042401847],"domain_scores_gemma":[0.9996977,0.00015775654,0.000017558234,0.000046812358,0.00005737873,0.00002292923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037371635,0.0011087877,0.000951275,0.00072605256,0.00074826257,0.0026027285,0.00087386963,0.0010072216,0.014545952],"category_scores_gemma":[0.0010426268,0.00037327234,0.0004573268,0.0011950949,0.0015790579,0.0017943496,0.0009470008,0.0021878611,0.0039433367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075706594,0.000018490604,0.000042150634,0.00007381,0.000009488945,0.000028369148,0.00006453756,0.0021821142,0.00034520874,0.94445693,0.025795203,0.026976103],"study_design_scores_gemma":[0.0000070184446,0.000010050965,0.000111953144,0.000047071484,0.0000056131653,0.00007826718,0.000021989785,0.005277823,0.0001657558,0.9159897,0.07827857,0.000006241989],"about_ca_topic_score_codex":0.0010491601,"about_ca_topic_score_gemma":0.0011511989,"teacher_disagreement_score":0.014545952,"about_ca_system_score_codex":0.0015174081,"about_ca_system_score_gemma":0.0009397361,"threshold_uncertainty_score":0.048661053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113630064,0.0013226921,0.6910692,0.00894222,0.0002772442,0.00034523578,0.0007559493,0.00018645114,0.18347096],"genre_scores_gemma":[0.93564194,0.0009867321,0.028364351,0.00078269606,0.00021311735,0.00035106583,0.00024049683,0.00002910868,0.03339043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979907,0.0010079356,0.00007109458,0.00022718568,0.0004784095,0.00022468154],"domain_scores_gemma":[0.99545467,0.0033635912,0.00023097997,0.00030606645,0.00032774912,0.0003169509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019328153,0.00087451976,0.0014503124,0.0006736507,0.0009460885,0.004279899,0.0015259644,0.002340316,0.007936012],"category_scores_gemma":[0.009441876,0.00048544057,0.0005516186,0.0011357297,0.0027645773,0.0043148436,0.0020246904,0.0021550786,0.0006208896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002198053,0.00003187609,0.000065719876,0.000023290153,0.0000097565635,0.000027109656,0.00004767786,0.016279126,0.00014295864,0.97953355,0.0012466678,0.0025702363],"study_design_scores_gemma":[0.000025369209,0.000010179608,0.000058353937,0.000008596099,0.000005007489,0.000014437265,0.00002134304,0.067955405,0.00008561268,0.93053466,0.0012744792,0.0000066222783],"about_ca_topic_score_codex":0.0017360591,"about_ca_topic_score_gemma":0.0013867491,"teacher_disagreement_score":0.007936012,"about_ca_system_score_codex":0.0021275815,"about_ca_system_score_gemma":0.0018198374,"threshold_uncertainty_score":0.026548564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33687916,0.00094388676,0.4624766,0.0023733329,0.00045900684,0.000220542,0.00022276066,0.00038505308,0.19603959],"genre_scores_gemma":[0.94934046,0.0003538362,0.014388368,0.0001866468,0.00006626654,0.0001478421,0.000066266664,0.000057618738,0.035392664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996902,0.00008394519,0.000016464686,0.00004406422,0.000071643575,0.00009373118],"domain_scores_gemma":[0.9991903,0.00042902294,0.00009391858,0.00008068785,0.000071648195,0.00013449881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048595818,0.0005520265,0.0005438858,0.00046079015,0.001154534,0.0019479173,0.0010224467,0.0017966545,0.009024637],"category_scores_gemma":[0.0024810703,0.00023974126,0.0006125391,0.00038523163,0.001092176,0.0016717567,0.0019212122,0.0015232321,0.0011854452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010432367,0.000065207045,0.000402288,0.00008560285,0.000036203655,0.00045329402,0.00039468106,0.03823119,0.0052617313,0.9275069,0.0053919298,0.022066616],"study_design_scores_gemma":[0.00002708195,0.00007545432,0.00028212558,0.000028333445,0.000014010858,0.00024088343,0.00021505187,0.13650467,0.0010156689,0.8586852,0.002889481,0.000022135366],"about_ca_topic_score_codex":0.0006014933,"about_ca_topic_score_gemma":0.000640919,"teacher_disagreement_score":0.009024637,"about_ca_system_score_codex":0.0005590394,"about_ca_system_score_gemma":0.00049019506,"threshold_uncertainty_score":0.030190468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64337367,0.0006765469,0.2873348,0.002979161,0.0000781166,0.00028753022,0.0006135938,0.00035183784,0.064304695],"genre_scores_gemma":[0.9723688,0.0002482715,0.01987724,0.00018907145,0.000054234337,0.00018226451,0.00013214517,0.000027457692,0.006920519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969796,0.0012514617,0.00017206524,0.00054396206,0.00060543575,0.00044754354],"domain_scores_gemma":[0.9756958,0.015997874,0.0033801722,0.0012351327,0.0015249832,0.0021660519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050138202,0.0007876494,0.0034069698,0.001742904,0.0023007581,0.0061732586,0.0025163323,0.004238825,0.009573224],"category_scores_gemma":[0.027972754,0.0015281024,0.0014272499,0.0016603424,0.0036719334,0.005911383,0.0037899322,0.0027092565,0.0009254021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048083227,0.00017152756,0.0017199457,0.00020686186,0.000111056615,0.00020615623,0.00052418653,0.025577815,0.002180278,0.95603234,0.0018750334,0.010914071],"study_design_scores_gemma":[0.00015478836,0.00009634483,0.0005152551,0.00003171893,0.00002161509,0.00011355347,0.00015809934,0.062458064,0.00046335737,0.9352778,0.0006828781,0.000026528254],"about_ca_topic_score_codex":0.00072390627,"about_ca_topic_score_gemma":0.0008727941,"teacher_disagreement_score":0.009573224,"about_ca_system_score_codex":0.0017396118,"about_ca_system_score_gemma":0.0019177994,"threshold_uncertainty_score":0.032025635},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2368916,0.0021905517,0.32460216,0.07067919,0.003409803,0.0009405771,0.00448017,0.011370032,0.34543595],"genre_scores_gemma":[0.69474113,0.0018517815,0.15630773,0.0022175799,0.00077627716,0.0007459186,0.00306741,0.0029187398,0.13737348],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964976,0.0017208843,0.000119882265,0.00024032782,0.0011292113,0.00029213648],"domain_scores_gemma":[0.96952426,0.017071307,0.0006874726,0.0045124916,0.0064158314,0.0017886464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011364993,0.00036234353,0.00038863163,0.0012754654,0.001157617,0.0034151755,0.0015947926,0.0011009286,0.05541045],"category_scores_gemma":[0.037949443,0.00038753668,0.0007123998,0.0011202679,0.00038518957,0.005437898,0.0029010633,0.0015946552,0.010054799],"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.0010793437,0.0012278857,0.011520639,0.00046602997,0.000068915666,0.00034586826,0.002902594,0.026927054,0.004507206,0.03629717,0.2906829,0.6239744],"study_design_scores_gemma":[0.00042743227,0.0011912175,0.012761703,0.00065693463,0.00010656997,0.00045292987,0.004520959,0.18461722,0.025443468,0.04539695,0.7242002,0.000224423],"about_ca_topic_score_codex":0.0013222565,"about_ca_topic_score_gemma":0.0021580944,"teacher_disagreement_score":0.05541045,"about_ca_system_score_codex":0.001708452,"about_ca_system_score_gemma":0.002729174,"threshold_uncertainty_score":0.18536639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50829107,0.0010974065,0.4047136,0.007640036,0.00015831925,0.00024237299,0.0002416795,0.00021352535,0.0774019],"genre_scores_gemma":[0.98710525,0.00035586618,0.005153051,0.00016239757,0.0000707522,0.00008514816,0.000022998109,0.00001760577,0.007026868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559104,0.0026335677,0.00012661579,0.00045836697,0.0004565741,0.000733865],"domain_scores_gemma":[0.9688775,0.024994725,0.0033419859,0.0008475096,0.0008567065,0.0010816533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055427607,0.0008766576,0.0022785875,0.0012886088,0.0012664613,0.0046145064,0.0020044262,0.004698519,0.005602354],"category_scores_gemma":[0.030006574,0.0009057093,0.000752774,0.0012886659,0.0034706446,0.0062269433,0.0024000907,0.0024498748,0.00044169035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019678209,0.00012922676,0.0010849674,0.0001475056,0.00006751508,0.00023447881,0.00025385988,0.2483139,0.0007204302,0.73759955,0.0017488273,0.00950287],"study_design_scores_gemma":[0.00006448167,0.00008014632,0.00042988904,0.00003223734,0.000036991398,0.00007920821,0.00019188863,0.34505555,0.00021700472,0.65280545,0.0009841465,0.000022921216],"about_ca_topic_score_codex":0.00355069,"about_ca_topic_score_gemma":0.0028515214,"teacher_disagreement_score":0.005602354,"about_ca_system_score_codex":0.0038775173,"about_ca_system_score_gemma":0.0016764213,"threshold_uncertainty_score":0.029313266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006820532,0.0000852784,0.9887565,0.00025636164,0.00004861084,0.00016099901,0.000049519516,0.0008111842,0.003011081],"genre_scores_gemma":[0.27008152,0.00012524326,0.7242383,0.00026010248,0.000049098147,0.0005614202,0.00025970355,0.00019888069,0.0042257067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881303,0.00025741584,0.00008007789,0.0003672397,0.00029698882,0.00018521564],"domain_scores_gemma":[0.998013,0.001172943,0.00017864814,0.00022939446,0.0002919976,0.00011400034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013459995,0.001253104,0.0013508976,0.0011520688,0.001164449,0.0011714497,0.0025010996,0.0023037866,0.004869367],"category_scores_gemma":[0.005600086,0.00053778384,0.0008489431,0.00092471414,0.0011104859,0.0018480143,0.0030052327,0.001907772,0.0010892282],"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.00037159375,0.00023499865,0.0009557639,0.0002250222,0.000109624074,0.0002795946,0.0004128991,0.64756113,0.005614755,0.0891568,0.009355485,0.24572235],"study_design_scores_gemma":[0.000084067804,0.00006484768,0.000066464236,0.000013317476,0.00001279423,0.000084556355,0.000033514214,0.964992,0.0009764236,0.032019023,0.0016357962,0.000017219012],"about_ca_topic_score_codex":0.0036321555,"about_ca_topic_score_gemma":0.0042228806,"teacher_disagreement_score":0.004869367,"about_ca_system_score_codex":0.0015195394,"about_ca_system_score_gemma":0.0027888825,"threshold_uncertainty_score":0.016289651},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012830812,0.0066029974,0.69514936,0.011408131,0.0009929535,0.00027215297,0.000077937475,0.00010066997,0.27256495],"genre_scores_gemma":[0.65541446,0.012221396,0.28890562,0.002601501,0.0007163567,0.0006592386,0.00007555386,0.00007978952,0.039325967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604636,0.0024896134,0.00013041835,0.0004025233,0.0007090652,0.00022203854],"domain_scores_gemma":[0.9987286,0.00083071785,0.00008141043,0.00007109614,0.00021383863,0.000074346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027844952,0.0011579853,0.00080565317,0.0015214144,0.0021815475,0.0031153755,0.0016982163,0.0037044361,0.0037435654],"category_scores_gemma":[0.004988003,0.00034776694,0.0012194837,0.0013612385,0.0049002315,0.004994224,0.004127795,0.0026080876,0.00056223356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011043844,0.000020772779,0.00014250199,0.00007845263,0.0000175622,0.00024715532,0.0003119876,0.00839389,0.0002163859,0.9828387,0.0011555051,0.0065661245],"study_design_scores_gemma":[0.00001684872,0.00004405913,0.0001341096,0.00010547276,0.000016670541,0.00026872888,0.00033844594,0.04315759,0.00036551515,0.92557055,0.029947408,0.000034616198],"about_ca_topic_score_codex":0.004612514,"about_ca_topic_score_gemma":0.0040448587,"teacher_disagreement_score":0.004612514,"about_ca_system_score_codex":0.0029015793,"about_ca_system_score_gemma":0.002345451,"threshold_uncertainty_score":0.02105254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45360947,0.003091062,0.26868707,0.022174256,0.00061120524,0.00038602657,0.0003176481,0.0003060185,0.25081727],"genre_scores_gemma":[0.9914288,0.0002016261,0.0046773683,0.000219018,0.0001267024,0.000072507486,0.00002297068,0.000015232773,0.0032357357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864162,0.008339865,0.00053667626,0.0012174167,0.002430196,0.0010595478],"domain_scores_gemma":[0.7949446,0.17942482,0.012196433,0.007900486,0.0038808247,0.0016529263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011627513,0.0009686148,0.0014587784,0.0018580722,0.0012366793,0.005864532,0.0013708078,0.006157023,0.0124314865],"category_scores_gemma":[0.096902326,0.00068004284,0.00077344093,0.0009335868,0.006821738,0.009465449,0.0025391974,0.0040760743,0.00076898915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002882006,0.00023443552,0.002021796,0.00027712938,0.00008313882,0.0002237428,0.0011615314,0.006035047,0.0011883078,0.9649886,0.0011073152,0.022390809],"study_design_scores_gemma":[0.000090696674,0.000094402574,0.00083892996,0.0000342992,0.000029531431,0.00009992889,0.00019469735,0.013346725,0.0005161363,0.98370934,0.0010242971,0.000020927486],"about_ca_topic_score_codex":0.0008856918,"about_ca_topic_score_gemma":0.00043945297,"teacher_disagreement_score":0.0124314865,"about_ca_system_score_codex":0.0015655532,"about_ca_system_score_gemma":0.0019175931,"threshold_uncertainty_score":0.06149286},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13495764,0.0013551945,0.31011572,0.010936355,0.00053440983,0.0003578094,0.0020173178,0.00038537147,0.53934026],"genre_scores_gemma":[0.9049381,0.0010177998,0.03441379,0.0011981948,0.00064818194,0.00091247784,0.00093721243,0.00018265157,0.055751614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189055,0.0034251236,0.0003989081,0.0020556513,0.0013431697,0.00088661927],"domain_scores_gemma":[0.981928,0.011003522,0.0012025503,0.0029955048,0.0017337792,0.0011366006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00559849,0.0012343245,0.0026100061,0.0032015124,0.004794848,0.009484065,0.0023492365,0.004300435,0.02478908],"category_scores_gemma":[0.024311196,0.0009300542,0.0017433888,0.0023245688,0.0078094946,0.012990805,0.005433332,0.005807623,0.0041336464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148316085,0.0000089781015,0.00006142584,0.000014390062,0.000009762232,0.000015923211,0.00008993668,0.00041167397,0.000074143056,0.9962798,0.0009862835,0.0020328183],"study_design_scores_gemma":[0.000010949295,0.000006220914,0.00004721399,0.000009833425,0.0000064889937,0.000047811052,0.000037013262,0.0025346654,0.00006975234,0.99527055,0.0019527383,0.0000068171985],"about_ca_topic_score_codex":0.0008835812,"about_ca_topic_score_gemma":0.00044802,"teacher_disagreement_score":0.02478908,"about_ca_system_score_codex":0.0023767734,"about_ca_system_score_gemma":0.002380119,"threshold_uncertainty_score":0.082927704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024083424,0.00036591955,0.9654319,0.00053243566,0.00006530419,0.00006986702,0.00008219057,0.000063964806,0.009304903],"genre_scores_gemma":[0.76895875,0.0015917193,0.20879239,0.0003825653,0.00060058536,0.0006610224,0.00033564956,0.00031384177,0.018363485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779654,0.0011975731,0.00010587768,0.00037860975,0.00032576628,0.0001956469],"domain_scores_gemma":[0.9891773,0.008352831,0.0006689473,0.0005899671,0.0006933037,0.0005177026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052896747,0.0019492937,0.0022661004,0.002675574,0.0007641394,0.0025379756,0.0018259682,0.001695926,0.005823067],"category_scores_gemma":[0.012056732,0.0011094786,0.003510237,0.0012600409,0.003085434,0.0050361305,0.0031720162,0.003376184,0.00042958034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085040985,0.00009612964,0.00048539697,0.00014422774,0.00013660952,0.00013422634,0.00030931487,0.14703256,0.0028582937,0.83284575,0.0012863954,0.014586114],"study_design_scores_gemma":[0.000015976946,0.000060820705,0.00020348706,0.000025095602,0.000032176835,0.000028113756,0.000052288913,0.5514322,0.0003507418,0.44707066,0.00071132317,0.000017174305],"about_ca_topic_score_codex":0.0015821017,"about_ca_topic_score_gemma":0.0006868479,"teacher_disagreement_score":0.005823067,"about_ca_system_score_codex":0.0014861567,"about_ca_system_score_gemma":0.0011983755,"threshold_uncertainty_score":0.027974784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037420557,0.00013779146,0.9942568,0.0001072591,0.00003233455,0.000077303,0.00002306676,0.00022141165,0.0014019153],"genre_scores_gemma":[0.15307021,0.00023022332,0.8432798,0.00012711922,0.000038771977,0.0004601102,0.00013762282,0.000085792955,0.0025704391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.00031423522,0.000050692746,0.00023886748,0.00018733267,0.00016874957],"domain_scores_gemma":[0.9990883,0.00048903713,0.000089930836,0.00009658997,0.0001618599,0.00007427935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012069339,0.0013359853,0.0012990704,0.00095751195,0.0010051583,0.0011241887,0.0021259645,0.0015430187,0.00373335],"category_scores_gemma":[0.003406455,0.0005119843,0.00074752414,0.0012676512,0.0006543211,0.0019387078,0.0017701936,0.0014234458,0.0008273082],"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.00018317462,0.00018264502,0.00062371045,0.00023333402,0.00006295475,0.00009431179,0.00017087875,0.7398977,0.0026176982,0.044789612,0.006567253,0.20457673],"study_design_scores_gemma":[0.000053190113,0.000036638914,0.00006832827,0.000011572523,0.0000082683955,0.000050841758,0.000027507804,0.98272324,0.0005394899,0.014169524,0.0023030716,0.000008313401],"about_ca_topic_score_codex":0.0042296047,"about_ca_topic_score_gemma":0.003993892,"teacher_disagreement_score":0.0042296047,"about_ca_system_score_codex":0.0012225372,"about_ca_system_score_gemma":0.0033057812,"threshold_uncertainty_score":0.012489259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022056675,0.007803801,0.19847229,0.0059684757,0.00042556235,0.00032376713,0.00261426,0.00036538634,0.7619698],"genre_scores_gemma":[0.6801002,0.016478818,0.062087707,0.0022315143,0.0005490624,0.0011949504,0.0031012518,0.00017139164,0.23408513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998884,0.0005556459,0.000060503837,0.00013675849,0.00021946448,0.00014368133],"domain_scores_gemma":[0.9987546,0.00086780736,0.00007672028,0.000096267155,0.00010461159,0.00009994061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729159,0.0014500797,0.0012319913,0.0006189508,0.0009932886,0.0037824395,0.0016007951,0.0017465831,0.027246427],"category_scores_gemma":[0.0031505944,0.00034645948,0.000635796,0.0010021523,0.0020325168,0.00279012,0.0016185712,0.0019107033,0.004200271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032596643,0.000040912342,0.000182663,0.00012900747,0.000026100977,0.00012748066,0.00013328464,0.030335976,0.00019387215,0.9325841,0.021482227,0.014731754],"study_design_scores_gemma":[0.000035935733,0.000022488994,0.00013376151,0.00006539246,0.000010932137,0.000079419566,0.00009057612,0.035257153,0.00008170994,0.9039346,0.06027595,0.000012060909],"about_ca_topic_score_codex":0.0035486626,"about_ca_topic_score_gemma":0.0039213724,"teacher_disagreement_score":0.027246427,"about_ca_system_score_codex":0.0026072518,"about_ca_system_score_gemma":0.0015993044,"threshold_uncertainty_score":0.09114832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022056675,0.007803801,0.19847229,0.0059684757,0.00042556235,0.00032376713,0.00261426,0.00036538634,0.7619698],"genre_scores_gemma":[0.6801002,0.016478818,0.062087707,0.0022315143,0.0005490624,0.0011949504,0.0031012518,0.00017139164,0.23408513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998884,0.0005556459,0.000060503837,0.00013675849,0.00021946448,0.00014368133],"domain_scores_gemma":[0.9987546,0.00086780736,0.00007672028,0.000096267155,0.00010461159,0.00009994061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729159,0.0014500797,0.0012319913,0.0006189508,0.0009932886,0.0037824395,0.0016007951,0.0017465831,0.027246427],"category_scores_gemma":[0.0031505944,0.00034645948,0.000635796,0.0010021523,0.0020325168,0.00279012,0.0016185712,0.0019107033,0.004200271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032596643,0.000040912342,0.000182663,0.00012900747,0.000026100977,0.00012748066,0.00013328464,0.030335976,0.00019387215,0.9325841,0.021482227,0.014731754],"study_design_scores_gemma":[0.000035935733,0.000022488994,0.00013376151,0.00006539246,0.000010932137,0.000079419566,0.00009057612,0.035257153,0.00008170994,0.9039346,0.06027595,0.000012060909],"about_ca_topic_score_codex":0.0035486626,"about_ca_topic_score_gemma":0.0039213724,"teacher_disagreement_score":0.027246427,"about_ca_system_score_codex":0.0026072518,"about_ca_system_score_gemma":0.0015993044,"threshold_uncertainty_score":0.09114832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057359938,0.00008417858,0.94097084,0.00025085657,0.000012343673,0.00007933332,0.000082954415,0.000080217585,0.0010793166],"genre_scores_gemma":[0.92751634,0.00014140937,0.07009069,0.00007450997,0.00001709715,0.00019075241,0.00016956343,0.000038847284,0.0017607771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998321,0.0009622179,0.00005413322,0.0003274242,0.0002064129,0.00012880283],"domain_scores_gemma":[0.989641,0.008695217,0.00080623565,0.00036794788,0.00032535585,0.0001642049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033847466,0.0013103512,0.0012605337,0.00071226404,0.00043930698,0.0010658746,0.0016877282,0.0012761324,0.001012112],"category_scores_gemma":[0.019669797,0.00064178725,0.00053276756,0.0005672105,0.002210017,0.0025006833,0.0016389731,0.001633729,0.000116912204],"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.000038835406,0.000016594346,0.0005407298,0.000024393135,0.000016787953,0.00005506107,0.00003434175,0.9781545,0.00035982224,0.01845761,0.0001006513,0.0022006521],"study_design_scores_gemma":[0.0000056348213,0.00000861404,0.00010243488,0.000003031172,0.0000022744819,0.000006984516,0.000008852162,0.9884071,0.00017787778,0.011203879,0.000068707675,0.000004657019],"about_ca_topic_score_codex":0.008375779,"about_ca_topic_score_gemma":0.00556521,"teacher_disagreement_score":0.008375779,"about_ca_system_score_codex":0.0016857048,"about_ca_system_score_gemma":0.0009199402,"threshold_uncertainty_score":0.017900527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49264106,0.0004825136,0.46338114,0.0015511567,0.00012317052,0.00010168204,0.00022397598,0.0005232444,0.04097218],"genre_scores_gemma":[0.9834236,0.00010366517,0.010349601,0.00009530648,0.000023285555,0.00009272125,0.000060161005,0.00005951763,0.0057921642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.00021634049,0.000024278472,0.00015230078,0.00007575213,0.00013874989],"domain_scores_gemma":[0.9970982,0.001664328,0.00033138707,0.00025658257,0.00022552346,0.00042406318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011493323,0.0004994372,0.0010349975,0.0006083779,0.00067849853,0.0013886509,0.0011759889,0.001262835,0.0060442155],"category_scores_gemma":[0.009587829,0.00046241688,0.0007125716,0.00025198987,0.0017347307,0.0019894815,0.0016151291,0.0010410397,0.0006061681],"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.00023412239,0.00008325233,0.0019355419,0.00011445624,0.00009323383,0.00038494513,0.00040585655,0.6366685,0.008782693,0.33655807,0.0019346717,0.012804625],"study_design_scores_gemma":[0.000029334298,0.000065337765,0.0007361828,0.000014271451,0.000014999519,0.0000715901,0.00009063492,0.87649494,0.00084549474,0.12067791,0.00093672116,0.000022655056],"about_ca_topic_score_codex":0.0020769946,"about_ca_topic_score_gemma":0.0011878585,"teacher_disagreement_score":0.0060442155,"about_ca_system_score_codex":0.0010997416,"about_ca_system_score_gemma":0.000672689,"threshold_uncertainty_score":0.020219922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18328577,0.00075370143,0.76217556,0.004324696,0.00029648803,0.000463487,0.00037153825,0.00088589574,0.04744283],"genre_scores_gemma":[0.95078266,0.0004434376,0.03224341,0.00048639806,0.00024279961,0.0006336171,0.00018787202,0.00025844996,0.014721493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99180907,0.004963497,0.00031532397,0.0011474197,0.00088301813,0.00088175165],"domain_scores_gemma":[0.89226395,0.09036203,0.0034061635,0.009817401,0.0027279013,0.0014225486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010563444,0.0011511698,0.0025863328,0.0017513427,0.0014460317,0.00379921,0.003815632,0.0036286972,0.014265188],"category_scores_gemma":[0.0821489,0.00092788565,0.001881422,0.0010014175,0.0044341083,0.00659528,0.003556554,0.004894659,0.0015472488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031817742,0.00014785976,0.00056507933,0.00013172267,0.00006386901,0.000092776194,0.0002352698,0.046762455,0.001594002,0.93547934,0.0025893496,0.0120199835],"study_design_scores_gemma":[0.00013984533,0.00007633352,0.00022049088,0.000029007024,0.000025655796,0.00008959913,0.000035626,0.23216787,0.00074686983,0.7656107,0.0008284839,0.00002954767],"about_ca_topic_score_codex":0.0010323264,"about_ca_topic_score_gemma":0.0006449819,"teacher_disagreement_score":0.014265188,"about_ca_system_score_codex":0.0026903641,"about_ca_system_score_gemma":0.0033960813,"threshold_uncertainty_score":0.055865526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27894226,0.0004605309,0.7084702,0.000994953,0.000053485626,0.00016120037,0.00023508843,0.0002292354,0.01045295],"genre_scores_gemma":[0.9152907,0.00048306695,0.078238815,0.00016456716,0.00007565278,0.0001466636,0.00014201683,0.000077074896,0.0053815236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793243,0.00077473023,0.00009437488,0.0003887761,0.00040887287,0.00040084164],"domain_scores_gemma":[0.98720366,0.008716903,0.001202297,0.0017346023,0.0005050436,0.000637436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029894146,0.0007384954,0.0011667158,0.0010054829,0.0015195061,0.0023095545,0.0019885425,0.00095014455,0.004946798],"category_scores_gemma":[0.014560231,0.00036548512,0.00083988474,0.0012797175,0.0027020578,0.0068266867,0.0026940694,0.001577022,0.0003413479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009787162,0.00014457776,0.004588865,0.0003391762,0.00016372671,0.0005323981,0.0008740602,0.37249807,0.017925696,0.5127099,0.0029678408,0.08627695],"study_design_scores_gemma":[0.000055780725,0.00011860313,0.00063986256,0.00003448787,0.000038877766,0.00040129328,0.00025399902,0.6150903,0.004566207,0.3747283,0.0040386333,0.000033671586],"about_ca_topic_score_codex":0.0015360803,"about_ca_topic_score_gemma":0.0018428803,"teacher_disagreement_score":0.004946798,"about_ca_system_score_codex":0.0013969177,"about_ca_system_score_gemma":0.000942088,"threshold_uncertainty_score":0.016548693},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23998974,0.0010914375,0.68842053,0.0032115313,0.00012535686,0.00025979028,0.00041823974,0.00023136656,0.06625204],"genre_scores_gemma":[0.92170626,0.0015053313,0.06251343,0.00043579977,0.00017825988,0.00042404342,0.000264495,0.00012929781,0.012843057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861765,0.00053577306,0.00006218684,0.00026312296,0.00025752262,0.00026382378],"domain_scores_gemma":[0.9940455,0.00359833,0.0010280904,0.0002946127,0.0005442991,0.00048913364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019917844,0.0015734364,0.0019329793,0.0021134405,0.001793598,0.0048027504,0.0020333168,0.0032789565,0.008932364],"category_scores_gemma":[0.012684737,0.0011144663,0.0016736392,0.0020167313,0.0037027767,0.006954052,0.003169317,0.00351549,0.00096599286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028708368,0.000034885026,0.00019496797,0.000043718253,0.00001837318,0.000046430916,0.00010611937,0.0176247,0.00088275323,0.97629094,0.0011492798,0.003579103],"study_design_scores_gemma":[0.000030647876,0.000025290565,0.00018373282,0.000021693791,0.000010307789,0.000066284185,0.00011228546,0.088675134,0.00023655631,0.9098585,0.0007597498,0.00001991152],"about_ca_topic_score_codex":0.0015391449,"about_ca_topic_score_gemma":0.0013213004,"teacher_disagreement_score":0.008932364,"about_ca_system_score_codex":0.002353309,"about_ca_system_score_gemma":0.0020051263,"threshold_uncertainty_score":0.029881716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9152347,0.00083885976,0.06504962,0.002302392,0.000039487968,0.00009492432,0.0002718283,0.00012284167,0.016045405],"genre_scores_gemma":[0.99363565,0.00029196325,0.0033148453,0.0000915221,0.000030785617,0.000027192216,0.00004123258,0.000010271198,0.002556471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980172,0.00078738923,0.000100536694,0.00036766866,0.00033200104,0.00039513558],"domain_scores_gemma":[0.92013764,0.06502769,0.009399264,0.0028213833,0.001511654,0.001102401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006405435,0.00047672304,0.001717191,0.0010549367,0.0006019048,0.0032610092,0.0008583614,0.0030888019,0.008388049],"category_scores_gemma":[0.03542083,0.0008104916,0.00091423246,0.0009200628,0.0022084508,0.0058754846,0.0015520746,0.003105397,0.0005463309],"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.0036524816,0.0012642933,0.06593093,0.0013164403,0.00062898593,0.0024387923,0.0025579392,0.17701483,0.014237757,0.6188564,0.0041727945,0.10792841],"study_design_scores_gemma":[0.0003989589,0.0011092549,0.0476464,0.0001226196,0.00029297863,0.00061241613,0.0014605743,0.301226,0.0032393734,0.64037144,0.0033473363,0.00017267252],"about_ca_topic_score_codex":0.0018255363,"about_ca_topic_score_gemma":0.0014660228,"teacher_disagreement_score":0.008388049,"about_ca_system_score_codex":0.0012564935,"about_ca_system_score_gemma":0.00085527694,"threshold_uncertainty_score":0.033875525},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16879596,0.0009423963,0.018616958,0.005383028,0.00017618113,0.000043445958,0.000060814556,0.00004320915,0.805938],"genre_scores_gemma":[0.9899367,0.00019348513,0.0011339097,0.000207259,0.000077021374,0.000018089948,0.000017147613,0.00001293533,0.008403389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702543,0.0011967184,0.000076669814,0.00039683687,0.00087768724,0.00042665427],"domain_scores_gemma":[0.9901883,0.0051000807,0.0008308061,0.0012426014,0.0013037884,0.0013344422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025373972,0.0003863042,0.0005335868,0.0015903731,0.0014259333,0.005812303,0.00043150174,0.0017993752,0.011293493],"category_scores_gemma":[0.018302726,0.00012656277,0.00030654832,0.0013003752,0.003850369,0.003974633,0.0017675717,0.0012816308,0.0008346739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042556832,0.00004715075,0.0040204125,0.000035725137,0.00003083499,0.00007388498,0.0011924545,0.0008623637,0.00049267954,0.96246916,0.0013120554,0.029420706],"study_design_scores_gemma":[0.0000112199905,0.00004688019,0.003937757,0.000038891296,0.0000269471,0.00007441447,0.0010143828,0.0019843034,0.00035295184,0.97685117,0.015648281,0.000012669155],"about_ca_topic_score_codex":0.00087143993,"about_ca_topic_score_gemma":0.0009988438,"teacher_disagreement_score":0.011293493,"about_ca_system_score_codex":0.0017912767,"about_ca_system_score_gemma":0.0010522777,"threshold_uncertainty_score":0.037780523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15379567,0.0032938428,0.5947411,0.0044761095,0.00054075016,0.0001693387,0.00035810392,0.00018629283,0.24243884],"genre_scores_gemma":[0.8925727,0.0020386355,0.028706228,0.00034656122,0.00034154332,0.00019235544,0.00012388644,0.000058078916,0.07562007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995944,0.00016374944,0.000011490503,0.00004351082,0.00010439375,0.000082573744],"domain_scores_gemma":[0.99870574,0.0010018646,0.000064678236,0.00003765581,0.00007199713,0.00011807917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007626641,0.00051631435,0.0007449683,0.00049849023,0.0006957819,0.0017469415,0.0012027165,0.001589156,0.0071607446],"category_scores_gemma":[0.0031439236,0.00024257766,0.0004438167,0.0007683848,0.0012862079,0.0022576659,0.001174434,0.0018915955,0.00046632037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056882083,0.00003071709,0.00014257191,0.00009239884,0.000019915913,0.000055019074,0.00011149979,0.059546407,0.0011165583,0.9204987,0.0045287404,0.013800627],"study_design_scores_gemma":[0.00002100107,0.000035466608,0.0001506287,0.000024774046,0.0000073113306,0.000038082246,0.000059892187,0.14435168,0.0002543968,0.8514566,0.0035882096,0.000012004501],"about_ca_topic_score_codex":0.0009007324,"about_ca_topic_score_gemma":0.0008944205,"teacher_disagreement_score":0.0071607446,"about_ca_system_score_codex":0.0011978305,"about_ca_system_score_gemma":0.00050083594,"threshold_uncertainty_score":0.023955107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14335777,0.0005637967,0.84294266,0.005566698,0.00010322147,0.00019550929,0.0005860529,0.0002692535,0.0064150896],"genre_scores_gemma":[0.88839436,0.0008942419,0.09467393,0.0006657716,0.00034667522,0.00031928477,0.0006102994,0.00011657391,0.013978882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926595,0.004433875,0.00036272846,0.001265923,0.00069507246,0.00058292714],"domain_scores_gemma":[0.8349208,0.15584458,0.0041746376,0.002397194,0.0013397043,0.0013231747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016143009,0.0014910444,0.0053896033,0.0024994512,0.0011485011,0.00568653,0.0039371965,0.0058335196,0.008218761],"category_scores_gemma":[0.09623632,0.0027361275,0.0020949736,0.0020541502,0.005479719,0.0109055005,0.0035599556,0.0049826666,0.0007470015],"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.00035186074,0.00024472238,0.0027730828,0.000160467,0.00023612846,0.0005504096,0.00027325473,0.5584936,0.0005246028,0.42136607,0.0023742246,0.012651542],"study_design_scores_gemma":[0.00008813418,0.000029087634,0.00046165552,0.000018089659,0.000033148295,0.000058816328,0.000046964833,0.79121584,0.00008770262,0.20764823,0.00028060717,0.000031716925],"about_ca_topic_score_codex":0.013975069,"about_ca_topic_score_gemma":0.008109924,"teacher_disagreement_score":0.016143009,"about_ca_system_score_codex":0.003439756,"about_ca_system_score_gemma":0.0024110968,"threshold_uncertainty_score":0.0853734},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13495764,0.0013551945,0.31011572,0.010936355,0.00053440983,0.0003578094,0.0020173178,0.00038537147,0.53934026],"genre_scores_gemma":[0.9049381,0.0010177998,0.03441379,0.0011981948,0.00064818194,0.00091247784,0.00093721243,0.00018265157,0.055751614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189055,0.0034251236,0.0003989081,0.0020556513,0.0013431697,0.00088661927],"domain_scores_gemma":[0.981928,0.011003522,0.0012025503,0.0029955048,0.0017337792,0.0011366006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00559849,0.0012343245,0.0026100061,0.0032015124,0.004794848,0.009484065,0.0023492365,0.004300435,0.02478908],"category_scores_gemma":[0.024311196,0.0009300542,0.0017433888,0.0023245688,0.0078094946,0.012990805,0.005433332,0.005807623,0.0041336464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148316085,0.0000089781015,0.00006142584,0.000014390062,0.000009762232,0.000015923211,0.00008993668,0.00041167397,0.000074143056,0.9962798,0.0009862835,0.0020328183],"study_design_scores_gemma":[0.000010949295,0.000006220914,0.00004721399,0.000009833425,0.0000064889937,0.000047811052,0.000037013262,0.0025346654,0.00006975234,0.99527055,0.0019527383,0.0000068171985],"about_ca_topic_score_codex":0.0008835812,"about_ca_topic_score_gemma":0.00044802,"teacher_disagreement_score":0.02478908,"about_ca_system_score_codex":0.0023767734,"about_ca_system_score_gemma":0.002380119,"threshold_uncertainty_score":0.082927704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084110595,0.009377624,0.51133513,0.24158324,0.0091526415,0.0002190071,0.002544609,0.0013595044,0.14031763],"genre_scores_gemma":[0.70114845,0.009621942,0.18587478,0.04351823,0.01072224,0.00063488254,0.0033769996,0.001006637,0.044095837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627656,0.0013283507,0.00014222943,0.0010289589,0.000731116,0.0004926616],"domain_scores_gemma":[0.97874177,0.015832307,0.0010043185,0.0022641886,0.0013411887,0.0008161751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032729374,0.0012422381,0.0024735406,0.00068336434,0.0038827201,0.0046780887,0.0030964038,0.0057621365,0.019029861],"category_scores_gemma":[0.030596798,0.0005429167,0.00187153,0.0016553332,0.005428385,0.028932402,0.003871748,0.0100192735,0.0045843795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015229749,0.000107360895,0.0009497494,0.0002648012,0.00006724184,0.00013062061,0.0002791888,0.003527879,0.00049468357,0.9168688,0.050754596,0.026402801],"study_design_scores_gemma":[0.00003925703,0.00003455159,0.00016809937,0.00006230868,0.0000135309965,0.00008368501,0.00012434463,0.008458075,0.00016606587,0.9771845,0.01364552,0.000020078676],"about_ca_topic_score_codex":0.002218522,"about_ca_topic_score_gemma":0.0028651133,"teacher_disagreement_score":0.019029861,"about_ca_system_score_codex":0.0018319818,"about_ca_system_score_gemma":0.00211,"threshold_uncertainty_score":0.06366122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31666535,0.0018625106,0.2934544,0.07551897,0.0003500161,0.0005752123,0.00031295096,0.00016954211,0.31109104],"genre_scores_gemma":[0.9861692,0.00030287253,0.007505864,0.0006864269,0.000039804723,0.00011655048,0.000037252838,0.000020116206,0.0051217116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910114,0.0055762273,0.00021902497,0.001093339,0.0005315994,0.0015684576],"domain_scores_gemma":[0.97856253,0.01312458,0.0025247806,0.0015943225,0.0011989019,0.0029949762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010715689,0.00045426982,0.0006447352,0.0011672721,0.004681467,0.0067487312,0.002160325,0.0048276093,0.01832669],"category_scores_gemma":[0.039079867,0.00049005257,0.00074536423,0.0011649089,0.006853053,0.008458314,0.0064829052,0.003692288,0.0012020807],"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.000049561506,0.00008645955,0.0032249612,0.00007225696,0.000025912055,0.00023870064,0.0016279344,0.015615752,0.0002176194,0.9605369,0.0054542962,0.012849585],"study_design_scores_gemma":[0.00006118688,0.00005778975,0.0012822727,0.00011544979,0.000019845385,0.00014237151,0.004892773,0.05788688,0.00029228037,0.9072915,0.0279255,0.000032283435],"about_ca_topic_score_codex":0.010842438,"about_ca_topic_score_gemma":0.01395064,"teacher_disagreement_score":0.01832669,"about_ca_system_score_codex":0.0071123852,"about_ca_system_score_gemma":0.007554502,"threshold_uncertainty_score":0.06130892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093702696,0.0023864487,0.8683072,0.0023221648,0.00038510739,0.00033417702,0.0011972932,0.007333604,0.024031255],"genre_scores_gemma":[0.4939933,0.0008735317,0.4892865,0.00059317134,0.0003092255,0.000703709,0.0018356508,0.002301435,0.010103434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941451,0.0018120556,0.00033753493,0.0013718989,0.0013641956,0.0009692438],"domain_scores_gemma":[0.97530043,0.018265469,0.000995221,0.0029370585,0.0016026468,0.0008991972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061783367,0.0027193981,0.0021108484,0.0026508297,0.0017854373,0.0060336594,0.0043798764,0.0029170658,0.016556034],"category_scores_gemma":[0.039383963,0.001376541,0.0019567152,0.0030813506,0.0021730112,0.009976296,0.0034192544,0.0052239774,0.0030731515],"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.0021435674,0.00091880106,0.0047125053,0.0006796143,0.00040700147,0.00015617062,0.00067317695,0.5383974,0.0036994084,0.17165695,0.02574668,0.25080878],"study_design_scores_gemma":[0.00015031682,0.00005303521,0.0003433807,0.000038054786,0.00008258469,0.00005910409,0.000092915085,0.86524755,0.0013810142,0.1309215,0.0016075453,0.000022966646],"about_ca_topic_score_codex":0.007083867,"about_ca_topic_score_gemma":0.0149661675,"teacher_disagreement_score":0.016556034,"about_ca_system_score_codex":0.005181069,"about_ca_system_score_gemma":0.0050355257,"threshold_uncertainty_score":0.05538541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38046342,0.0032423227,0.34667057,0.025952123,0.00065532455,0.00032087212,0.00046381803,0.0003230919,0.24190849],"genre_scores_gemma":[0.98686403,0.0003328546,0.0065480764,0.00029489916,0.00021764377,0.0000890534,0.00003831016,0.000027008498,0.0055880435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883732,0.006943245,0.00042967824,0.0011884508,0.0021713434,0.000894016],"domain_scores_gemma":[0.8364828,0.14488058,0.007931912,0.006522926,0.002933218,0.0012483987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010098163,0.0010506015,0.0016225097,0.0017073398,0.0011944672,0.006231241,0.00145837,0.0064973864,0.014488503],"category_scores_gemma":[0.08466047,0.00074315415,0.0008367603,0.0010819043,0.0065271826,0.010034656,0.0025176061,0.004544912,0.0009297773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018477184,0.00014504872,0.00087504066,0.00019198302,0.00005258399,0.00013153792,0.00066701474,0.0047432836,0.00074676966,0.97559595,0.0011865528,0.015479487],"study_design_scores_gemma":[0.00005289333,0.000033923414,0.0003359113,0.000019137195,0.000014819306,0.000047543315,0.00007901297,0.0108533185,0.00028838747,0.98758984,0.0006735059,0.000011643849],"about_ca_topic_score_codex":0.0008750345,"about_ca_topic_score_gemma":0.00038706613,"teacher_disagreement_score":0.014488503,"about_ca_system_score_codex":0.0017607153,"about_ca_system_score_gemma":0.0017009501,"threshold_uncertainty_score":0.053404808},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29876193,0.00057387305,0.6616285,0.0039687743,0.000106732885,0.0005399981,0.0006486358,0.000371313,0.03340033],"genre_scores_gemma":[0.9507983,0.0004730947,0.034738805,0.00038774585,0.000111582274,0.00048401297,0.00016713003,0.00007186027,0.012767553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99239665,0.0043983897,0.00025755563,0.0011520627,0.0010833935,0.0007118953],"domain_scores_gemma":[0.958991,0.032127224,0.0029810718,0.0029831366,0.0010784584,0.0018391458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010086767,0.0010630727,0.0030084334,0.0011958486,0.0012071219,0.0033822895,0.003447311,0.0025592211,0.01069576],"category_scores_gemma":[0.032612145,0.00086074317,0.0013871487,0.0010579766,0.007012124,0.0061323093,0.0030145708,0.0029806416,0.0013033386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004141144,0.00007666686,0.0011561109,0.00010436591,0.00005930834,0.00034337575,0.0003113848,0.05053133,0.0014589796,0.93842536,0.0009151593,0.0062039047],"study_design_scores_gemma":[0.00025584266,0.00013247221,0.00049278745,0.000043973654,0.000033236072,0.00017970284,0.00010853464,0.42509973,0.00059099507,0.5718573,0.00114621,0.000059236427],"about_ca_topic_score_codex":0.0019191297,"about_ca_topic_score_gemma":0.0017739165,"teacher_disagreement_score":0.01069576,"about_ca_system_score_codex":0.0017788936,"about_ca_system_score_gemma":0.0011907507,"threshold_uncertainty_score":0.053344548},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001748099,0.0010470254,0.024638962,0.00086136727,0.00021143537,0.000015133888,0.000112869784,0.000048360733,0.97131675],"genre_scores_gemma":[0.17460246,0.0043898374,0.017776057,0.0009541013,0.0005179485,0.00011356981,0.00045762834,0.00021964492,0.8009687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949884,0.00012665248,0.000020252552,0.00010368273,0.00019132547,0.00005922743],"domain_scores_gemma":[0.9995233,0.00022446587,0.000032027514,0.00009716124,0.0000957384,0.000027375103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152576,0.00067458354,0.00043369207,0.001031031,0.0013243424,0.0035512822,0.0007827601,0.0010628328,0.05751907],"category_scores_gemma":[0.00217502,0.00031751755,0.00037380808,0.0013568134,0.002707112,0.004854837,0.0013014141,0.0025158094,0.013392043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014198412,0.0000036502097,0.000007804325,0.000010055894,7.6391154e-7,0.0000059099766,0.00003391244,0.00008571477,0.00004696302,0.9903446,0.004588972,0.00487028],"study_design_scores_gemma":[0.0000013680898,0.000002964448,0.000026581341,0.000015712003,0.0000015199846,0.000037283582,0.000028973418,0.00028036334,0.00009510225,0.9382395,0.0612683,0.000002384301],"about_ca_topic_score_codex":0.00095998927,"about_ca_topic_score_gemma":0.0013267532,"teacher_disagreement_score":0.05751907,"about_ca_system_score_codex":0.001667307,"about_ca_system_score_gemma":0.00082592224,"threshold_uncertainty_score":0.19242048},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011013261,0.012463633,0.0006599536,0.04273819,0.935297,0.000037050435,0.00032386,0.00007074819,0.008299355],"genre_scores_gemma":[0.0013187055,0.010310084,0.00033287116,0.014535812,0.90575343,0.000066584966,0.00046588446,0.00019458227,0.06702211],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986229,0.00021654674,0.00013421236,0.00026386615,0.00064091815,0.00012162808],"domain_scores_gemma":[0.99026835,0.0026111708,0.000677712,0.00033086468,0.0042168098,0.0018950758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020402903,0.002162538,0.0024030553,0.0030431543,0.0017904608,0.0062053315,0.0020373254,0.0042987815,0.082631536],"category_scores_gemma":[0.013164452,0.0005170075,0.0012135763,0.0021263873,0.00077864045,0.0039662486,0.0019449606,0.006465869,0.04862224],"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.000011031138,0.0000073945293,0.000013418307,0.00006770254,0.000002815209,0.000010178335,0.0000037385341,0.000028799433,0.000041168827,0.00026703885,0.994478,0.0050686933],"study_design_scores_gemma":[0.000016213193,0.00003022836,0.00035814283,0.00023203836,0.0000120743525,0.00005972603,0.000024710474,0.00024302483,0.000087856744,0.0024117234,0.9965107,0.000013469966],"about_ca_topic_score_codex":0.0015515197,"about_ca_topic_score_gemma":0.002341656,"teacher_disagreement_score":0.082631536,"about_ca_system_score_codex":0.0024003591,"about_ca_system_score_gemma":0.0020279323,"threshold_uncertainty_score":0.27643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0574979,0.0012837965,0.9172253,0.0020976039,0.00010945403,0.00006456106,0.000107213615,0.000057892652,0.021556232],"genre_scores_gemma":[0.9146421,0.0017724482,0.067453764,0.0006260549,0.00037450888,0.00037374496,0.00014976405,0.00005816613,0.014549468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986431,0.00075709366,0.00004786563,0.00015441343,0.00027232716,0.00012520616],"domain_scores_gemma":[0.9971944,0.0017750049,0.00031223436,0.0001231697,0.0003412971,0.0002538513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028954688,0.001213755,0.001076911,0.00079849135,0.00072537165,0.0018126114,0.0012783988,0.0015339529,0.0027825162],"category_scores_gemma":[0.0060743545,0.00043570157,0.0010400752,0.00056209316,0.0035700407,0.003642652,0.0019238245,0.0024737031,0.00024732575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010301049,0.000025686557,0.0002495656,0.000047445326,0.00002265268,0.000057583435,0.00009958306,0.05761143,0.00051334716,0.9391194,0.00050735124,0.001735833],"study_design_scores_gemma":[0.000010088183,0.000032662472,0.00019351985,0.00001805633,0.000007049501,0.000028053537,0.0000500789,0.47695208,0.0001306667,0.5213768,0.0011855805,0.000015290587],"about_ca_topic_score_codex":0.00320472,"about_ca_topic_score_gemma":0.0013875325,"teacher_disagreement_score":0.00320472,"about_ca_system_score_codex":0.0024279314,"about_ca_system_score_gemma":0.0013285954,"threshold_uncertainty_score":0.017615974},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17526685,0.0005042738,0.25754732,0.0037656424,0.00031587484,0.00032329204,0.00016997142,0.00050681026,0.5616],"genre_scores_gemma":[0.90875554,0.00019959308,0.013579612,0.0004660728,0.00008065344,0.00007350402,0.000043122818,0.000055593497,0.076746255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977164,0.00082188135,0.000106701256,0.00038123102,0.00060155295,0.0003722207],"domain_scores_gemma":[0.9924333,0.0031062139,0.0009679404,0.0017279472,0.0010949823,0.00066962285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031506799,0.0005141988,0.0006046497,0.0006892981,0.0008675163,0.0035370742,0.00090827025,0.0015296151,0.028598275],"category_scores_gemma":[0.01754941,0.00024088092,0.0007485938,0.00044804005,0.0011434179,0.0018160034,0.0017270647,0.0022044405,0.0035286187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018085241,0.00020358717,0.0022625024,0.00012415575,0.00007929693,0.00013700144,0.00022586124,0.0081444,0.0052684667,0.9229229,0.0060707754,0.05438021],"study_design_scores_gemma":[0.0002083902,0.0009556922,0.01005115,0.00013271162,0.00019692261,0.0018376873,0.00049346214,0.104542784,0.008911146,0.82478404,0.04777647,0.000109480774],"about_ca_topic_score_codex":0.00026635875,"about_ca_topic_score_gemma":0.00038306785,"teacher_disagreement_score":0.028598275,"about_ca_system_score_codex":0.0011140916,"about_ca_system_score_gemma":0.0011351332,"threshold_uncertainty_score":0.09567076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2784883,0.0016277251,0.6124773,0.009016072,0.0003956983,0.00029081083,0.00070610887,0.00040435852,0.09659361],"genre_scores_gemma":[0.96071327,0.0007087905,0.020255644,0.00042256867,0.00017751392,0.00013266884,0.00012257675,0.00006610187,0.017400954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665666,0.0015006477,0.00016255662,0.0004280771,0.00038971158,0.0008624138],"domain_scores_gemma":[0.98412746,0.011392965,0.0012872306,0.0010638076,0.0009399886,0.001188611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005268084,0.0013032133,0.0025425183,0.001018615,0.0017855358,0.0071329116,0.0027137669,0.0043962835,0.019717488],"category_scores_gemma":[0.0221371,0.0010814139,0.001609846,0.0012443928,0.0043533323,0.013046339,0.0050559235,0.0037980352,0.00134177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028830153,0.000085142805,0.0004957742,0.00009673972,0.000043183223,0.00029337357,0.00015543225,0.0717834,0.00069351017,0.9181453,0.0025777377,0.005342134],"study_design_scores_gemma":[0.00011803082,0.000068960515,0.00020063457,0.000034941757,0.000033141776,0.000088856665,0.0001033131,0.34056902,0.00021111961,0.6571179,0.0014070848,0.000047081376],"about_ca_topic_score_codex":0.004860507,"about_ca_topic_score_gemma":0.0024872548,"teacher_disagreement_score":0.019717488,"about_ca_system_score_codex":0.0029341287,"about_ca_system_score_gemma":0.0018218949,"threshold_uncertainty_score":0.06596154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10867761,0.0013215453,0.78901464,0.010380672,0.00055436837,0.00021653777,0.0014009057,0.0002965054,0.088137224],"genre_scores_gemma":[0.9421924,0.0010344262,0.03412788,0.0008521244,0.00043510058,0.00028113482,0.00019610733,0.00005312366,0.02082779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483466,0.0024587861,0.0002857615,0.0008132141,0.0008732534,0.00073436147],"domain_scores_gemma":[0.9838792,0.011583811,0.0016839555,0.0015148368,0.00068412925,0.0006541224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038731217,0.0015120246,0.0028559815,0.001095821,0.0011689467,0.0061786408,0.0020385415,0.004787145,0.0115466835],"category_scores_gemma":[0.017957866,0.0012778552,0.0010621161,0.0027528561,0.0022654072,0.0059036706,0.0041199266,0.003832549,0.0015598685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002475163,0.00011185762,0.00039585878,0.00019233325,0.00007518637,0.00040047974,0.00010868984,0.08136279,0.00201983,0.9018581,0.0033676338,0.009859763],"study_design_scores_gemma":[0.00014052763,0.00008898928,0.00031173672,0.000055879904,0.000056461762,0.00029674073,0.000088658235,0.42059827,0.00060368545,0.57550573,0.0021879163,0.00006538683],"about_ca_topic_score_codex":0.0011377757,"about_ca_topic_score_gemma":0.0006993362,"teacher_disagreement_score":0.0115466835,"about_ca_system_score_codex":0.0018230964,"about_ca_system_score_gemma":0.0012281945,"threshold_uncertainty_score":0.038627446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138462195,0.00007454211,0.98403674,0.00033560174,0.000051760366,0.000119893506,0.000054179305,0.00022240031,0.0012587406],"genre_scores_gemma":[0.70562804,0.000112728914,0.28828838,0.00033550133,0.00015601622,0.0003950566,0.000114521274,0.0001005558,0.0048691556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9857019,0.0071546324,0.000596852,0.0030434849,0.002430628,0.0010725677],"domain_scores_gemma":[0.97618085,0.013201623,0.0020259917,0.005470152,0.0020842622,0.0010370895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022310771,0.0012221227,0.001809869,0.001306027,0.0016121998,0.0034800195,0.0039238334,0.0020951033,0.005975451],"category_scores_gemma":[0.051402353,0.0006672035,0.0011163008,0.0012535045,0.0033133768,0.0068187215,0.004616121,0.0038340294,0.000820188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006792096,0.00030879246,0.005130763,0.00014920426,0.00017751104,0.00025102016,0.0009788849,0.25857854,0.0053689647,0.54728097,0.0039250692,0.17717111],"study_design_scores_gemma":[0.00006191846,0.00020267461,0.0007229022,0.000036001962,0.000044206754,0.00010516735,0.00008262643,0.654073,0.0025404757,0.33952314,0.0025449132,0.00006305881],"about_ca_topic_score_codex":0.0016817838,"about_ca_topic_score_gemma":0.0017811032,"teacher_disagreement_score":0.022310771,"about_ca_system_score_codex":0.0019560652,"about_ca_system_score_gemma":0.004404853,"threshold_uncertainty_score":0.1179921},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11451016,0.00642239,0.6171511,0.019645665,0.00074218365,0.00031270037,0.0010345151,0.00020647349,0.23997487],"genre_scores_gemma":[0.90419066,0.004602668,0.03242725,0.00072218536,0.00044760184,0.0003286542,0.0002528273,0.0000736062,0.056954514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872774,0.000679239,0.00003870857,0.00015232757,0.00019367762,0.00020822734],"domain_scores_gemma":[0.99643034,0.0025459433,0.00036526436,0.00011988081,0.00027295042,0.00026563462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016089174,0.0007283909,0.00091679615,0.001040606,0.0011228358,0.0029413204,0.0016880576,0.0023461138,0.016672425],"category_scores_gemma":[0.0077611348,0.0005413304,0.0012585362,0.0009825311,0.0020258846,0.004457884,0.0018228898,0.0020172256,0.0007515451],"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.000021108872,0.000031012354,0.00038599438,0.00004807737,0.000018516768,0.00007104772,0.00013666885,0.0804316,0.00017592094,0.9127078,0.002297149,0.0036750648],"study_design_scores_gemma":[0.000022111286,0.000025740455,0.0003892563,0.00003343851,0.000014035983,0.00004922587,0.00013996477,0.3826155,0.00009084763,0.60934204,0.00725783,0.000020091433],"about_ca_topic_score_codex":0.010425356,"about_ca_topic_score_gemma":0.008958756,"teacher_disagreement_score":0.016672425,"about_ca_system_score_codex":0.004490829,"about_ca_system_score_gemma":0.0020355133,"threshold_uncertainty_score":0.055774868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61771214,0.00084772916,0.2948709,0.003555235,0.0004140272,0.00073541125,0.00013545471,0.00043763113,0.08129142],"genre_scores_gemma":[0.97318,0.00016438917,0.02063544,0.00009314031,0.00009170952,0.00019980258,0.00006397686,0.000036019846,0.0055353744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345726,0.0035543593,0.0003263739,0.00069576246,0.0009438152,0.0010225212],"domain_scores_gemma":[0.97114646,0.018126125,0.003145935,0.0019570745,0.0026039411,0.0030204733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077686696,0.0008132798,0.00074244064,0.0018731172,0.0020758712,0.006634538,0.001516969,0.0024651883,0.009120538],"category_scores_gemma":[0.02943359,0.0005532736,0.00080403115,0.001675711,0.0013685335,0.0055443854,0.005345834,0.0013259226,0.0016072638],"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.002015148,0.0016840252,0.045121297,0.0012557454,0.00065092224,0.003712015,0.011561502,0.22756986,0.022877479,0.25734055,0.016248107,0.40996328],"study_design_scores_gemma":[0.0003184457,0.0019351548,0.011158316,0.00037943144,0.00029567856,0.00063935365,0.012521582,0.52294576,0.009339756,0.40992123,0.030410452,0.00013479507],"about_ca_topic_score_codex":0.0009963172,"about_ca_topic_score_gemma":0.0007509685,"teacher_disagreement_score":0.009120538,"about_ca_system_score_codex":0.0010688258,"about_ca_system_score_gemma":0.00216925,"threshold_uncertainty_score":0.041085184},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068104744,0.00087295606,0.91330206,0.0040633683,0.00013540995,0.00078992103,0.00040365077,0.00026390998,0.0120639345],"genre_scores_gemma":[0.6225803,0.000845054,0.36885473,0.0013984649,0.0002419688,0.0022688224,0.00044332657,0.00013071793,0.0032367443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95491016,0.030613545,0.0021765004,0.0056030415,0.005300499,0.0013962252],"domain_scores_gemma":[0.65939397,0.31269354,0.008852322,0.01147425,0.0054248073,0.002161062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.050142188,0.0011140157,0.0028409087,0.002413346,0.001100492,0.0048064603,0.003006449,0.0032686016,0.0033190534],"category_scores_gemma":[0.25161177,0.0011652996,0.00095693144,0.0013245922,0.006225778,0.006769738,0.0029743384,0.0044174953,0.0006353584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040522186,0.00020944569,0.0034013954,0.0002789507,0.00020444916,0.00014736471,0.00037426213,0.08943389,0.0011312814,0.8507225,0.002485765,0.051205494],"study_design_scores_gemma":[0.00019711253,0.0001407091,0.00061079557,0.000087634886,0.00003571182,0.00006920435,0.000065519176,0.1968484,0.0008189523,0.7998738,0.00122141,0.000030629835],"about_ca_topic_score_codex":0.0010138246,"about_ca_topic_score_gemma":0.0010491477,"teacher_disagreement_score":0.050142188,"about_ca_system_score_codex":0.0026378701,"about_ca_system_score_gemma":0.0036057266,"threshold_uncertainty_score":0.2651804},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001833863,0.041902974,0.0016733437,0.051171597,0.8786236,0.00004605886,0.0004149595,0.0001005153,0.025883501],"genre_scores_gemma":[0.003367214,0.036760703,0.001233862,0.01859861,0.826959,0.00009669456,0.00084534934,0.00040539887,0.11173314],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987411,0.00019392013,0.00010399009,0.00023993853,0.000596803,0.00012431924],"domain_scores_gemma":[0.99320096,0.0019405014,0.0004094905,0.00034017855,0.003060028,0.0010488644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017943076,0.0019328595,0.0018002522,0.0038113282,0.0016548464,0.0057184924,0.0018534511,0.0037967905,0.06883405],"category_scores_gemma":[0.01067388,0.00048266933,0.0012673151,0.0030114285,0.0010746123,0.003982185,0.0019464977,0.006987998,0.03670693],"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.000007675951,0.0000059615722,0.000014142843,0.00008922608,0.0000033289991,0.0000103960465,0.0000056868903,0.000043855143,0.000054533346,0.0014200703,0.99090344,0.0074416082],"study_design_scores_gemma":[0.000010877628,0.000022450391,0.00031117737,0.00035718738,0.000012257953,0.000066259934,0.00002509902,0.00018464099,0.00010094206,0.0055020596,0.9933941,0.000012906815],"about_ca_topic_score_codex":0.0023431524,"about_ca_topic_score_gemma":0.0029331732,"teacher_disagreement_score":0.06883405,"about_ca_system_score_codex":0.0026781603,"about_ca_system_score_gemma":0.0023458381,"threshold_uncertainty_score":0.23027283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10365247,0.003812876,0.7847363,0.0032284043,0.00016950963,0.00018392342,0.0005067297,0.00012414795,0.10358571],"genre_scores_gemma":[0.90722686,0.0027073654,0.07521925,0.00031117722,0.00031841992,0.00032397854,0.00037398786,0.000113556795,0.013405525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681586,0.0014136706,0.00016669578,0.00067211466,0.0006943876,0.00023727362],"domain_scores_gemma":[0.97772264,0.018504372,0.0011370191,0.0011881996,0.001123997,0.00032375756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049072704,0.0007805199,0.001479823,0.0013745793,0.0009368517,0.0048482777,0.0026923504,0.002279467,0.0060194377],"category_scores_gemma":[0.02294931,0.0005968579,0.0014264209,0.0020406204,0.0036243382,0.009936597,0.0016271229,0.004179449,0.000599529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008616898,0.000045558812,0.00034152108,0.000112269634,0.000040658768,0.000096676304,0.00020998485,0.010402899,0.0008760909,0.9752408,0.001289525,0.011257875],"study_design_scores_gemma":[0.000013991462,0.000030049952,0.00022854292,0.000035204568,0.000018906037,0.00008837531,0.00006376888,0.044226605,0.0005992021,0.95356333,0.0011197677,0.000012369945],"about_ca_topic_score_codex":0.0006635158,"about_ca_topic_score_gemma":0.0003976166,"teacher_disagreement_score":0.0060194377,"about_ca_system_score_codex":0.00195977,"about_ca_system_score_gemma":0.0009456402,"threshold_uncertainty_score":0.025952399},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09733077,0.0007924738,0.7108414,0.009189242,0.00029484293,0.0003536196,0.0009509663,0.0003979323,0.17984876],"genre_scores_gemma":[0.89182484,0.0008652282,0.074804,0.0011412231,0.0002869411,0.0005295871,0.00029453673,0.00017440508,0.030079199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958165,0.0022040203,0.00019377723,0.0005543367,0.00071339606,0.00051788724],"domain_scores_gemma":[0.98691064,0.0103892,0.0008936854,0.0006343388,0.0006993406,0.0004728371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048719184,0.0015000277,0.0016589091,0.0007556447,0.0010996053,0.006181288,0.0025702615,0.0055180485,0.00958773],"category_scores_gemma":[0.027153395,0.000768383,0.0008098689,0.0012775109,0.0033809575,0.007399119,0.0029492711,0.0032936102,0.0018393007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012366734,0.00004315145,0.000185105,0.00007264415,0.000020979296,0.000093472125,0.00014561907,0.011990699,0.00092823437,0.97697306,0.0027166451,0.006706637],"study_design_scores_gemma":[0.000045096367,0.000032386735,0.00006797851,0.00003477951,0.0000117616,0.00008405617,0.000105815845,0.06139546,0.0005863767,0.93631154,0.001305498,0.000019279873],"about_ca_topic_score_codex":0.00092241046,"about_ca_topic_score_gemma":0.00086157065,"teacher_disagreement_score":0.00958773,"about_ca_system_score_codex":0.002232148,"about_ca_system_score_gemma":0.0022086,"threshold_uncertainty_score":0.032074153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059776902,0.0014538461,0.8904326,0.0010884257,0.00012123505,0.00012305018,0.00008748152,0.00030609567,0.046610452],"genre_scores_gemma":[0.83827984,0.0013868302,0.1382849,0.00026990025,0.000119046344,0.0003789579,0.00014630136,0.000213526,0.0209207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992625,0.0003468172,0.000025986694,0.000118566124,0.00015551179,0.000090654394],"domain_scores_gemma":[0.99399936,0.0048519108,0.00027707763,0.00028848025,0.00040077197,0.00018242245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002163348,0.00094795047,0.0013196643,0.0006746173,0.00063926424,0.0016694678,0.0018317875,0.0018489284,0.004473527],"category_scores_gemma":[0.0150085855,0.00062381563,0.0009224944,0.0007352049,0.0018418771,0.002581928,0.002327553,0.0028311426,0.00064253056],"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.00013697777,0.0001121642,0.00052133866,0.0002387377,0.00009493205,0.00010656309,0.00020698024,0.488606,0.001695484,0.45770654,0.0043391665,0.046234988],"study_design_scores_gemma":[0.000019628764,0.000025043328,0.000090952424,0.00002036416,0.0000072499033,0.000025439303,0.000020375504,0.8347133,0.00024075423,0.16420089,0.00063004,0.000006043851],"about_ca_topic_score_codex":0.0025238802,"about_ca_topic_score_gemma":0.0016049913,"teacher_disagreement_score":0.004473527,"about_ca_system_score_codex":0.0016221592,"about_ca_system_score_gemma":0.001090819,"threshold_uncertainty_score":0.014965475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019651087,0.0115754735,0.4929231,0.00950378,0.0010382079,0.00035255548,0.0009464221,0.00030294055,0.46370643],"genre_scores_gemma":[0.62614423,0.023375636,0.14515477,0.0060167876,0.0029689756,0.0011491018,0.001159916,0.00026231093,0.19376823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851555,0.0004703045,0.0000754939,0.0002877262,0.00045525283,0.00019564846],"domain_scores_gemma":[0.9977234,0.0015091063,0.00019982886,0.00023561767,0.00018037407,0.0001515973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013583765,0.001080023,0.001085314,0.0011437621,0.0008314331,0.0056832847,0.0014341084,0.0036281492,0.009534618],"category_scores_gemma":[0.0044927993,0.00043170722,0.0012025629,0.001531143,0.002961181,0.0057529868,0.0012703519,0.003555302,0.0015503524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101506075,0.00002347326,0.00004600068,0.000052749096,0.00000591526,0.000018024573,0.000060793674,0.0011176153,0.00018923804,0.9837834,0.0050291223,0.009663464],"study_design_scores_gemma":[0.000022819759,0.000023136934,0.0001774027,0.00006832006,0.000017740278,0.00015691308,0.00008668514,0.011929102,0.00030048387,0.9544739,0.03272604,0.000017499837],"about_ca_topic_score_codex":0.0014255688,"about_ca_topic_score_gemma":0.0010073368,"teacher_disagreement_score":0.009534618,"about_ca_system_score_codex":0.0018511096,"about_ca_system_score_gemma":0.0013276606,"threshold_uncertainty_score":0.03189653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08143659,0.005130293,0.7088696,0.0065509705,0.00024081673,0.000148995,0.0008838776,0.0002167515,0.19652209],"genre_scores_gemma":[0.8908007,0.0053723506,0.07797887,0.00062537694,0.0007240507,0.00038873276,0.00053187256,0.0001326727,0.023445416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985178,0.0006587759,0.00009265353,0.00019587125,0.00039286024,0.00014216776],"domain_scores_gemma":[0.98757476,0.01057959,0.00060175714,0.00056630105,0.0005090489,0.00016865505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022880079,0.0007433089,0.00097285945,0.0012891723,0.0009928567,0.0047315746,0.0013818819,0.0021539787,0.0074311756],"category_scores_gemma":[0.013905786,0.0007967672,0.00092347,0.0019199474,0.0027035768,0.008204158,0.0010820745,0.003014988,0.0008566542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101314345,0.000013709922,0.00007543076,0.000035933033,0.0000071595305,0.00002428667,0.00007641036,0.0045606596,0.00021333815,0.9898673,0.00094853766,0.004167065],"study_design_scores_gemma":[0.0000038103046,0.0000048442616,0.00005584068,0.000012911811,0.0000036616514,0.000020127662,0.00001939241,0.012199717,0.0000873195,0.9869905,0.0005972553,0.000004678181],"about_ca_topic_score_codex":0.00080536655,"about_ca_topic_score_gemma":0.00070650387,"teacher_disagreement_score":0.0074311756,"about_ca_system_score_codex":0.0016655861,"about_ca_system_score_gemma":0.0009187576,"threshold_uncertainty_score":0.024859786},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016377227,0.024083963,0.4451644,0.0086271055,0.0019997805,0.00009512736,0.0008452113,0.00028945148,0.50251764],"genre_scores_gemma":[0.44489533,0.032867946,0.086956285,0.0017381293,0.0033580808,0.00050754193,0.0011356567,0.00028751988,0.42825365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996958,0.00008595277,0.00001298485,0.000050121034,0.00012293088,0.000032219996],"domain_scores_gemma":[0.9995314,0.00030957637,0.000042744017,0.000035501795,0.000047720652,0.00003313255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054653065,0.00075076637,0.00084426784,0.00052479416,0.00040863693,0.0019169142,0.00071147777,0.0009914001,0.011806137],"category_scores_gemma":[0.0016523345,0.00035793622,0.0004599096,0.0010999825,0.001165405,0.0016928344,0.000656742,0.0015499531,0.0015591037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145078675,0.0000191118,0.00007306241,0.000067941815,0.000016077931,0.000022719752,0.000045616063,0.022451593,0.00023694603,0.91458863,0.033863313,0.028600449],"study_design_scores_gemma":[0.000009867703,0.000012489265,0.00011806067,0.00003646466,0.0000054411694,0.000023352273,0.000033648732,0.031601768,0.00005361588,0.9388889,0.029209942,0.0000063382754],"about_ca_topic_score_codex":0.0025586698,"about_ca_topic_score_gemma":0.0028434938,"teacher_disagreement_score":0.011806137,"about_ca_system_score_codex":0.00096106087,"about_ca_system_score_gemma":0.0010408296,"threshold_uncertainty_score":0.03949547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015782727,0.0076293577,0.7494677,0.003810254,0.0006558562,0.000058627833,0.00027240918,0.00023711823,0.22208597],"genre_scores_gemma":[0.7727329,0.01054031,0.09450405,0.00085310993,0.0017635612,0.00031206655,0.00034747564,0.00018789632,0.118758574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954164,0.00015903513,0.000017659115,0.00005181756,0.00019692961,0.000032984393],"domain_scores_gemma":[0.9990344,0.0007130212,0.000055976212,0.00009065964,0.00008454091,0.000021446736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006343588,0.00041453063,0.00060312334,0.00038684628,0.00041631525,0.0016587678,0.0005616693,0.0008881861,0.0058573587],"category_scores_gemma":[0.0025485598,0.0003631704,0.00030261313,0.0008639042,0.0013555217,0.0019298493,0.0006193677,0.001436605,0.0008347136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059874374,0.000009468519,0.00002872156,0.000030517953,0.0000052354703,0.000012753638,0.000028593055,0.021257063,0.00021973973,0.95899016,0.0033582046,0.016053492],"study_design_scores_gemma":[0.000004817682,0.0000076491915,0.000064425825,0.000021348478,0.0000029030784,0.000012690167,0.0000096335225,0.04358978,0.00013913854,0.9485595,0.007582927,0.000005158258],"about_ca_topic_score_codex":0.0010265176,"about_ca_topic_score_gemma":0.00099557,"teacher_disagreement_score":0.0058573587,"about_ca_system_score_codex":0.0012408019,"about_ca_system_score_gemma":0.0007586718,"threshold_uncertainty_score":0.019594789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013093278,0.0003694818,0.9747421,0.0003550045,0.00004997532,0.000078624005,0.00019476228,0.000089061075,0.011027728],"genre_scores_gemma":[0.75948405,0.0013738949,0.224084,0.0002674161,0.000079563935,0.00055304426,0.00050668366,0.00012827913,0.013522941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998331,0.0008168426,0.00005863368,0.00033905345,0.00028212235,0.00017228498],"domain_scores_gemma":[0.99871874,0.00078410987,0.00018081043,0.00006819235,0.00016698024,0.00008108412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017195172,0.0018296744,0.0016472458,0.0013405686,0.000810857,0.0025693877,0.0018917305,0.0016422083,0.005912868],"category_scores_gemma":[0.0035288655,0.00072672474,0.0019999489,0.0020898639,0.0014112392,0.0031906853,0.0015954047,0.0027242156,0.0005195683],"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.000032261298,0.00002956161,0.00025713825,0.00007411666,0.00004576946,0.00013966174,0.00007222203,0.90456986,0.00039992583,0.08606125,0.0007542471,0.0075640343],"study_design_scores_gemma":[0.0000092323635,0.00002008582,0.000070817005,0.000008189521,0.000014848271,0.000027882277,0.000024505978,0.9538655,0.00007960432,0.045099244,0.000767289,0.000012861264],"about_ca_topic_score_codex":0.01273937,"about_ca_topic_score_gemma":0.008236632,"teacher_disagreement_score":0.01273937,"about_ca_system_score_codex":0.002649466,"about_ca_system_score_gemma":0.0017833803,"threshold_uncertainty_score":0.025330424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982569,0.0003713842,0.006232423,0.00027507512,0.000018357283,0.000099254816,0.00050366897,0.00008183218,0.009848941],"genre_scores_gemma":[0.9983594,0.00003149438,0.0007520467,0.000034886245,0.000007361463,0.000022547118,0.00020127828,0.000015265516,0.00057580613],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99782217,0.0007045354,0.00011496278,0.00046815904,0.0006321151,0.0002581862],"domain_scores_gemma":[0.9694408,0.019173026,0.0058749774,0.0026893734,0.0020063794,0.0008155715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025209289,0.00031463586,0.00048176383,0.0016601834,0.0003856814,0.002598825,0.0008431893,0.0006097871,0.013447068],"category_scores_gemma":[0.026405508,0.00022742903,0.00064034446,0.0018423761,0.0012787776,0.0016493811,0.0012513966,0.00094412913,0.001564166],"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.0003292494,0.00026478473,0.95240283,0.0002024674,0.00033336168,0.00018063313,0.0023587798,0.0017163393,0.001584035,0.0078751175,0.0006924249,0.03205996],"study_design_scores_gemma":[0.000011655757,0.00020567572,0.97978365,0.00005285505,0.00007418101,0.00015215715,0.002510785,0.005325035,0.00050710776,0.008436529,0.0029044675,0.000035772722],"about_ca_topic_score_codex":0.0042705634,"about_ca_topic_score_gemma":0.0033769384,"teacher_disagreement_score":0.013447068,"about_ca_system_score_codex":0.000773155,"about_ca_system_score_gemma":0.00072697754,"threshold_uncertainty_score":0.044984937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13203938,0.00014387608,0.8479232,0.0002985896,0.000034848243,0.00014937678,0.0001436741,0.00043505317,0.018832],"genre_scores_gemma":[0.74703246,0.00012343336,0.24598612,0.00007757077,0.000019551204,0.00026922402,0.00021975565,0.00009121095,0.006180631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992163,0.000376288,0.000027143835,0.00009914383,0.0001591378,0.00012193271],"domain_scores_gemma":[0.9979247,0.0015714865,0.00014514607,0.0000771822,0.00016092519,0.00012053625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161429,0.00076467666,0.0010355997,0.0010619512,0.0009879641,0.0014817923,0.0012516213,0.001073269,0.0081141135],"category_scores_gemma":[0.007969719,0.0005184317,0.00072286493,0.0005530424,0.0010711756,0.0019911712,0.0019229339,0.00078659144,0.00075291254],"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.00036584956,0.00011927465,0.0026057635,0.00022655215,0.00009909267,0.00046950954,0.0004365445,0.6869897,0.0015276644,0.2587586,0.0023809704,0.046020437],"study_design_scores_gemma":[0.000033092027,0.000045826106,0.0001923982,0.000018197568,0.000009767088,0.000067124725,0.00008242793,0.84978175,0.0011496091,0.14744765,0.0011560544,0.000016128504],"about_ca_topic_score_codex":0.002464882,"about_ca_topic_score_gemma":0.0032375185,"teacher_disagreement_score":0.0081141135,"about_ca_system_score_codex":0.0012598922,"about_ca_system_score_gemma":0.0010734908,"threshold_uncertainty_score":0.027144372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1330954,0.00034796234,0.84786296,0.00150964,0.00009217359,0.0001263583,0.00038185203,0.0006028815,0.015980693],"genre_scores_gemma":[0.86091965,0.00040167212,0.12272541,0.00024712106,0.000067970934,0.00025515744,0.00041494062,0.00012852447,0.014839662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944633,0.00019666256,0.000029844396,0.00014878232,0.000089760724,0.00008871067],"domain_scores_gemma":[0.99804497,0.0010977708,0.0002929455,0.0002446732,0.00014653544,0.00017305986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093377143,0.00059970043,0.0008131914,0.0005354099,0.0010475806,0.0018557522,0.0020803686,0.0018907721,0.0064449506],"category_scores_gemma":[0.004461189,0.0005274872,0.001028762,0.00050611846,0.0017787658,0.0037029441,0.0018974249,0.0016882658,0.0006230123],"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.000064391264,0.000033787986,0.0006681557,0.000034053086,0.000017963619,0.00015607859,0.00010385699,0.88363403,0.00047227246,0.10886303,0.000632485,0.0053197755],"study_design_scores_gemma":[0.000012451445,0.000008969184,0.000058443275,0.0000036950562,0.0000045660504,0.000021404332,0.000020081274,0.96749866,0.00015676607,0.031453956,0.00075526914,0.000005794852],"about_ca_topic_score_codex":0.006498476,"about_ca_topic_score_gemma":0.0071944245,"teacher_disagreement_score":0.006498476,"about_ca_system_score_codex":0.0012700998,"about_ca_system_score_gemma":0.0010009082,"threshold_uncertainty_score":0.02156055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016312823,0.0010462358,0.90341824,0.0043234816,0.0002533725,0.00009535847,0.00010802315,0.000047078185,0.07439539],"genre_scores_gemma":[0.80149066,0.0027485893,0.1529616,0.0019920676,0.0014226241,0.00056811183,0.00015172457,0.000116869574,0.038547736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962857,0.0020971452,0.0000957963,0.00045660147,0.0006919257,0.00037275915],"domain_scores_gemma":[0.99455583,0.0035748372,0.0006163105,0.0003906707,0.000517892,0.000344495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043239263,0.0010245729,0.0015181373,0.0013685706,0.0016550488,0.0034058483,0.0020851009,0.003580209,0.008150379],"category_scores_gemma":[0.010776045,0.0005793129,0.0019609446,0.00093350053,0.0066297823,0.0053709964,0.0036652423,0.004556019,0.0009578248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000674817,0.000011087921,0.00006513303,0.000016305788,0.000006545256,0.00003144411,0.000050719467,0.0070002275,0.0001285849,0.99058175,0.00060612167,0.0014953898],"study_design_scores_gemma":[0.000013736988,0.00001670917,0.000052216234,0.000014421758,0.0000037142836,0.000057127294,0.000021573343,0.034290977,0.00009306624,0.9629616,0.0024661806,0.0000086323535],"about_ca_topic_score_codex":0.00076483627,"about_ca_topic_score_gemma":0.0003588611,"teacher_disagreement_score":0.008150379,"about_ca_system_score_codex":0.0021532378,"about_ca_system_score_gemma":0.0014592834,"threshold_uncertainty_score":0.027265728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9435788,0.000117400916,0.03574523,0.0009794347,0.000025845056,0.00009162955,0.00009825392,0.00002632496,0.01933696],"genre_scores_gemma":[0.995233,0.00007039559,0.004053728,0.000042424726,0.0000039218517,0.00004602131,0.000022527756,0.0000052539117,0.0005227092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934655,0.00044229472,0.000019893081,0.000055615583,0.000056868645,0.00007883594],"domain_scores_gemma":[0.99501795,0.0039277025,0.00036832024,0.00018770552,0.00019315117,0.00030522142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013355032,0.00033784236,0.00053686963,0.00040681442,0.0007475235,0.0012508318,0.0008907032,0.0013397225,0.002065137],"category_scores_gemma":[0.008050544,0.00018317995,0.0005213321,0.00037623078,0.0012426724,0.0017319609,0.0010784386,0.0010756258,0.00009190437],"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.000107943335,0.00016742827,0.005333129,0.000062395644,0.000049990595,0.00045049994,0.0009289498,0.8900085,0.00082596776,0.099172354,0.0004620029,0.0024309198],"study_design_scores_gemma":[0.00003074001,0.00008181272,0.0005995184,0.000013056135,0.000011974701,0.000030231273,0.0003926067,0.9710056,0.00013519147,0.027198462,0.00048828224,0.000012528714],"about_ca_topic_score_codex":0.0070748474,"about_ca_topic_score_gemma":0.0061272485,"teacher_disagreement_score":0.0070748474,"about_ca_system_score_codex":0.00094884046,"about_ca_system_score_gemma":0.00090609124,"threshold_uncertainty_score":0.014067292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13903771,0.00041772306,0.83237016,0.0009395127,0.00008622867,0.00034111727,0.00020643206,0.00011203304,0.026489131],"genre_scores_gemma":[0.8886953,0.00052233203,0.09939694,0.00025878675,0.00011090704,0.00081674184,0.00016439684,0.000042465315,0.009992183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654996,0.0019098716,0.00016778355,0.00041332416,0.00050910655,0.00045005468],"domain_scores_gemma":[0.99258476,0.005610184,0.0007318022,0.00019770082,0.0004444529,0.00043105116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030024913,0.002080242,0.0018909465,0.0012765384,0.0010157456,0.0026453629,0.0017242047,0.001818537,0.0034586755],"category_scores_gemma":[0.011804979,0.0006485837,0.0014209868,0.001041765,0.0026435708,0.0039367513,0.001866344,0.0019374249,0.00039532883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020397933,0.00014310915,0.0008141072,0.0001791796,0.00011586646,0.00029472692,0.00026557318,0.25408354,0.0017437323,0.73420674,0.001158936,0.006790531],"study_design_scores_gemma":[0.000080938495,0.00007801504,0.00022284266,0.000021243435,0.000021858135,0.00007253591,0.00007468196,0.72088027,0.0004203271,0.27703917,0.0010554583,0.000032665237],"about_ca_topic_score_codex":0.0040839734,"about_ca_topic_score_gemma":0.0030482986,"teacher_disagreement_score":0.0040839734,"about_ca_system_score_codex":0.0030989954,"about_ca_system_score_gemma":0.0021862264,"threshold_uncertainty_score":0.022484899},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06834062,0.00027816556,0.92705387,0.00072613085,0.000033387525,0.00007597441,0.000059941114,0.000081580336,0.0033504332],"genre_scores_gemma":[0.92372936,0.00043041297,0.07043323,0.00022163804,0.000081193255,0.0002870234,0.000085086875,0.000038234946,0.004693843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984085,0.0009225111,0.000044479537,0.00027458207,0.00020818065,0.00014176905],"domain_scores_gemma":[0.99450386,0.0042593717,0.00055404723,0.00019093713,0.00026647822,0.00022535643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028048733,0.0010232609,0.0011415831,0.0005724058,0.0005221683,0.0012956883,0.00193211,0.0017372459,0.0016467111],"category_scores_gemma":[0.011296123,0.00055028923,0.0007869585,0.00048354015,0.002258046,0.0027962534,0.0015011937,0.0016395429,0.0001646539],"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.000042248404,0.0000398429,0.0006552395,0.00004520941,0.000049937513,0.00009677196,0.00008815752,0.8724347,0.00057473645,0.121107295,0.0003116125,0.0045542205],"study_design_scores_gemma":[0.0000071657905,0.000017187049,0.00006866649,0.0000025997635,0.0000031708125,0.0000102231,0.000009819071,0.9662239,0.00006517614,0.033449873,0.00013823445,0.0000039571632],"about_ca_topic_score_codex":0.004631744,"about_ca_topic_score_gemma":0.0033473775,"teacher_disagreement_score":0.004631744,"about_ca_system_score_codex":0.002005174,"about_ca_system_score_gemma":0.0010214024,"threshold_uncertainty_score":0.014833748},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10427935,0.0003068568,0.86343795,0.0014140245,0.00006281829,0.00016673988,0.00025158754,0.00017815844,0.029902525],"genre_scores_gemma":[0.80381304,0.00040656098,0.18635826,0.00018558966,0.000027821872,0.00024505384,0.00030021157,0.00012433963,0.008539217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.0004960531,0.000021690443,0.00017356698,0.000120650046,0.00014781507],"domain_scores_gemma":[0.9966761,0.0026389319,0.00018815696,0.00012741238,0.00018257873,0.00018673135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566678,0.0008606255,0.0012421777,0.001106828,0.0009337696,0.002091987,0.0022711407,0.0024074088,0.0150140505],"category_scores_gemma":[0.0076258318,0.00071505015,0.0013077952,0.0009777471,0.0015594874,0.00373074,0.002145446,0.0027669023,0.00069524505],"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.00015468537,0.00015874782,0.0005518794,0.00020320232,0.00007282818,0.00019869479,0.000236794,0.68502265,0.0009219999,0.2958336,0.0015759621,0.015068995],"study_design_scores_gemma":[0.00002938548,0.000053963653,0.00009505617,0.000023800176,0.000027908405,0.000031436637,0.00012424364,0.81399286,0.00020619413,0.1846285,0.0007739592,0.000012808656],"about_ca_topic_score_codex":0.008384163,"about_ca_topic_score_gemma":0.006792335,"teacher_disagreement_score":0.0150140505,"about_ca_system_score_codex":0.0012521615,"about_ca_system_score_gemma":0.003410642,"threshold_uncertainty_score":0.050226986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27158892,0.0038335365,0.6392017,0.0015824874,0.00019378742,0.00024500483,0.00048658325,0.00016491192,0.082702965],"genre_scores_gemma":[0.9422439,0.00095740135,0.052625526,0.000120809156,0.00020071564,0.00020193096,0.00032642932,0.000052700856,0.0032705038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414486,0.0023259271,0.00057133014,0.0010857991,0.0014701315,0.0004019691],"domain_scores_gemma":[0.9435698,0.04176639,0.004725505,0.0026472213,0.0058326446,0.001458442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010165459,0.000723968,0.0010367552,0.00489886,0.0021875375,0.0071458705,0.0026906647,0.0010736637,0.0050415713],"category_scores_gemma":[0.032668296,0.0005308322,0.0012502219,0.0036887974,0.00611425,0.010070825,0.0034291823,0.0023364204,0.00038907756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029191524,0.000022076376,0.00074951095,0.00005323246,0.000019595813,0.000028994062,0.00027939072,0.0017662726,0.00025362917,0.99228245,0.00024686212,0.004268752],"study_design_scores_gemma":[0.000014562745,0.00004300523,0.0009325491,0.00004625807,0.000032694446,0.000120170036,0.00028648274,0.024903439,0.00071697234,0.9713588,0.0015210292,0.000024037607],"about_ca_topic_score_codex":0.0006773553,"about_ca_topic_score_gemma":0.00074561854,"teacher_disagreement_score":0.010165459,"about_ca_system_score_codex":0.0023977456,"about_ca_system_score_gemma":0.0015518935,"threshold_uncertainty_score":0.053760707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44269374,0.0026749172,0.4058235,0.010335636,0.000622633,0.00072028174,0.0022766825,0.00079763663,0.13405503],"genre_scores_gemma":[0.9774162,0.0005823316,0.012729601,0.00045813737,0.00017227615,0.00014392633,0.000100317266,0.000053481977,0.008343727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936196,0.0026552433,0.00022210866,0.0012827085,0.0005972543,0.0016231176],"domain_scores_gemma":[0.968781,0.020423384,0.0051014028,0.0020676008,0.0020781145,0.0015484676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007422061,0.0018337265,0.0032822466,0.0017808328,0.0027743569,0.008542137,0.0029046033,0.006489514,0.0248601],"category_scores_gemma":[0.015836842,0.001665951,0.0031084497,0.001204879,0.0045372103,0.010892593,0.004694855,0.005249346,0.002010673],"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.0018596846,0.0009472062,0.004340265,0.00080753246,0.00029683672,0.003380642,0.00071317045,0.27693206,0.0061674016,0.6811819,0.008067932,0.0153053105],"study_design_scores_gemma":[0.00036486855,0.00032291422,0.0016400876,0.00010204481,0.00022451454,0.0005309201,0.00076653773,0.51638895,0.0012092417,0.47454935,0.0036785686,0.0002219194],"about_ca_topic_score_codex":0.009104284,"about_ca_topic_score_gemma":0.0060581304,"teacher_disagreement_score":0.0248601,"about_ca_system_score_codex":0.005038116,"about_ca_system_score_gemma":0.0041375956,"threshold_uncertainty_score":0.08316535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1703049,0.003451983,0.7839299,0.0034692448,0.00038025988,0.00016314397,0.00026702267,0.00028874047,0.03774479],"genre_scores_gemma":[0.93218935,0.0016244564,0.05543817,0.00031876992,0.00032163548,0.000292057,0.0001360901,0.000078230725,0.00960125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836797,0.0007948982,0.00009883619,0.0002373595,0.000317418,0.00018357014],"domain_scores_gemma":[0.9926386,0.0055110357,0.0007108068,0.00022825228,0.00032849843,0.0005828757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028446447,0.000848358,0.0010965096,0.0009159218,0.0006812568,0.0022542858,0.0012170057,0.0018340434,0.003357893],"category_scores_gemma":[0.015890896,0.000512496,0.00096449343,0.00050287356,0.0025949837,0.0034946948,0.0018436032,0.0023559143,0.00031499634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025463727,0.00001932222,0.00042809988,0.000049917307,0.000014952744,0.00008153733,0.0001597095,0.030373594,0.00057161937,0.9648849,0.00046046474,0.0029302982],"study_design_scores_gemma":[0.000037791626,0.000020693516,0.00035066882,0.000022074146,0.000010565776,0.00005009266,0.000049557155,0.35705525,0.00012425373,0.6408808,0.0013758999,0.000022241165],"about_ca_topic_score_codex":0.002803072,"about_ca_topic_score_gemma":0.0010340371,"teacher_disagreement_score":0.003357893,"about_ca_system_score_codex":0.0024836373,"about_ca_system_score_gemma":0.0010195592,"threshold_uncertainty_score":0.018020153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18964872,0.001479408,0.77283084,0.006311999,0.00021948268,0.00045856246,0.0012804968,0.0011328603,0.026637688],"genre_scores_gemma":[0.8693674,0.0012677194,0.11526797,0.00074407924,0.00035401038,0.0006372643,0.0012350173,0.00044487094,0.010681659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99321294,0.0028305023,0.00034389898,0.0012325278,0.0012782894,0.0011017746],"domain_scores_gemma":[0.954414,0.039002065,0.0016558849,0.0026131866,0.0011003915,0.0012144592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042829644,0.0021210357,0.002920105,0.000969775,0.0011288659,0.005664379,0.004200578,0.003188219,0.009308174],"category_scores_gemma":[0.03535702,0.0011019307,0.0019372026,0.0015822389,0.003734054,0.011445315,0.0040215612,0.006886663,0.0012337579],"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.00092110154,0.00036370856,0.0018029702,0.0005406373,0.0001657849,0.00020440666,0.0005867211,0.51901263,0.0020216054,0.4386172,0.0063419263,0.029421309],"study_design_scores_gemma":[0.00006554118,0.000048107464,0.00015704335,0.000021952897,0.00001874024,0.00003658057,0.000044512122,0.74844897,0.00046032542,0.2500086,0.0006691161,0.000020541302],"about_ca_topic_score_codex":0.0057136905,"about_ca_topic_score_gemma":0.00451497,"teacher_disagreement_score":0.009308174,"about_ca_system_score_codex":0.0044463063,"about_ca_system_score_gemma":0.0032363553,"threshold_uncertainty_score":0.032260418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04258975,0.000046768568,0.95464873,0.00022542795,0.000015467931,0.00012592626,0.000043628705,0.00033796718,0.0019663665],"genre_scores_gemma":[0.58405066,0.00008873288,0.41298762,0.00012559611,0.0000192097,0.00027213155,0.00015167953,0.00008730274,0.0022170788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975768,0.00093160593,0.00011394486,0.0006254489,0.0004366066,0.00031565168],"domain_scores_gemma":[0.9938273,0.004914193,0.00040311806,0.00040745508,0.00029681463,0.0001511096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026212176,0.00077166926,0.001267455,0.0006565968,0.0010024804,0.0017372535,0.0018687459,0.0011735483,0.0029709875],"category_scores_gemma":[0.009909649,0.00043292664,0.0008919716,0.0006030164,0.0020882424,0.0034327444,0.0023297088,0.0020439492,0.00035376422],"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.00052698934,0.00025174892,0.0023513979,0.0002926842,0.00012913173,0.000188119,0.0003781277,0.6450787,0.0045348224,0.2329452,0.0015515151,0.11177159],"study_design_scores_gemma":[0.000047511323,0.000059052152,0.00015681167,0.000008942288,0.000012230821,0.000046061497,0.00003722707,0.8797497,0.0021345788,0.11741012,0.00032329673,0.000014469269],"about_ca_topic_score_codex":0.0038710234,"about_ca_topic_score_gemma":0.004718797,"teacher_disagreement_score":0.0038710234,"about_ca_system_score_codex":0.0016387563,"about_ca_system_score_gemma":0.0028617107,"threshold_uncertainty_score":0.013862491},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32266775,0.00040265147,0.22200952,0.0040212614,0.00017606081,0.0011461867,0.0020991953,0.0006928587,0.44678453],"genre_scores_gemma":[0.946822,0.00041838753,0.01826229,0.00035717722,0.0000701612,0.0008284314,0.0006476569,0.00019762012,0.03239628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845433,0.00031537938,0.00009373457,0.00020385369,0.00020769342,0.0007249891],"domain_scores_gemma":[0.9950818,0.0021655646,0.00064112246,0.00025346427,0.00094859983,0.00090944674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001923517,0.001064951,0.001952992,0.0027260857,0.0022980846,0.0058499193,0.0018816914,0.0029332847,0.05139304],"category_scores_gemma":[0.01043098,0.00082791154,0.0012435426,0.0011830031,0.0018349148,0.0055236644,0.0035765027,0.0025553592,0.005740364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025332117,0.00014975556,0.0005940934,0.00019753732,0.000053449265,0.00044214036,0.0004918824,0.018402489,0.003578585,0.9649244,0.0050032237,0.005909119],"study_design_scores_gemma":[0.00024401817,0.00014262804,0.0011314901,0.00012877789,0.000044090153,0.000298153,0.0017398766,0.09709794,0.0015629664,0.89201945,0.005504785,0.00008586945],"about_ca_topic_score_codex":0.0033059805,"about_ca_topic_score_gemma":0.0031570676,"teacher_disagreement_score":0.05139304,"about_ca_system_score_codex":0.0018510214,"about_ca_system_score_gemma":0.0027570562,"threshold_uncertainty_score":0.1719268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22835793,0.0033796094,0.56309915,0.021636767,0.00038576586,0.00033391654,0.0031843933,0.00063517364,0.17898725],"genre_scores_gemma":[0.9035254,0.0027498866,0.06792422,0.0008737492,0.0009957349,0.00057963835,0.0018556319,0.00034064037,0.021155024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942788,0.0026387123,0.0002932954,0.00079991296,0.0013399586,0.0006494077],"domain_scores_gemma":[0.8935334,0.09715066,0.0024446019,0.004361974,0.001431323,0.00107803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005047435,0.0011450922,0.0023694232,0.00221184,0.00199555,0.010825988,0.004227151,0.003689144,0.024235006],"category_scores_gemma":[0.05931822,0.0015180504,0.002482226,0.004015149,0.0061084344,0.02181099,0.004528965,0.0067627113,0.0017547039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020164753,0.00008965103,0.0007838396,0.00020446723,0.000057863355,0.00007928898,0.00023061111,0.06093944,0.0002669394,0.9137725,0.006193838,0.017179959],"study_design_scores_gemma":[0.000019036062,0.000006891789,0.00010727364,0.000017395541,0.000010585449,0.00002947233,0.000041259227,0.051618155,0.0000937779,0.94746083,0.0005858504,0.000009395205],"about_ca_topic_score_codex":0.0020699746,"about_ca_topic_score_gemma":0.0015721021,"teacher_disagreement_score":0.024235006,"about_ca_system_score_codex":0.0038087254,"about_ca_system_score_gemma":0.0026520907,"threshold_uncertainty_score":0.08107418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20789973,0.00043043305,0.49573296,0.008220265,0.00049958355,0.00025374396,0.00033369442,0.000614005,0.28601548],"genre_scores_gemma":[0.787218,0.00029425073,0.14489748,0.0004144343,0.000112613285,0.00025661933,0.00012625736,0.00009831687,0.06658206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993574,0.0003389485,0.0000356342,0.000056619574,0.00012663926,0.000084788946],"domain_scores_gemma":[0.9988444,0.00072739465,0.00008901527,0.000072929266,0.00011274519,0.00015345808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893107,0.0004356798,0.00051774405,0.000660851,0.0011658897,0.0028258855,0.001417271,0.0022986936,0.019902809],"category_scores_gemma":[0.0067057465,0.0002706476,0.00041992782,0.0006446737,0.0013543023,0.002226713,0.002343586,0.0015000419,0.0012582258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012653199,0.000070340815,0.00017525576,0.0000990828,0.000010437973,0.00006765436,0.000303869,0.016032329,0.000834793,0.9614176,0.003947742,0.01691439],"study_design_scores_gemma":[0.00008966262,0.00006719469,0.00010332287,0.000032992964,0.00000992462,0.000062842104,0.00023670992,0.089661844,0.0002138396,0.90239453,0.0071102153,0.000016898712],"about_ca_topic_score_codex":0.00076920167,"about_ca_topic_score_gemma":0.0012296436,"teacher_disagreement_score":0.019902809,"about_ca_system_score_codex":0.0010859624,"about_ca_system_score_gemma":0.0014689484,"threshold_uncertainty_score":0.06658149},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089008294,0.0004003091,0.8990707,0.0013825423,0.00014391543,0.0003346657,0.00011143662,0.00027962102,0.009268554],"genre_scores_gemma":[0.9492813,0.00018640053,0.044518724,0.00020957318,0.00006115719,0.00039498723,0.000033924312,0.000042823125,0.0052711824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929645,0.004464825,0.00024037725,0.00084512634,0.0006769152,0.00080820755],"domain_scores_gemma":[0.96854514,0.023771465,0.0034133042,0.0012533204,0.0014398305,0.0015769786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0103745535,0.001899408,0.0018339866,0.0008515218,0.0008047375,0.0019820132,0.0022140658,0.003011872,0.006733595],"category_scores_gemma":[0.034716412,0.0012450271,0.0009767457,0.0004894644,0.0031102237,0.0031004366,0.0025426247,0.0027809648,0.0006647995],"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.0011709314,0.0005722883,0.001770496,0.0004942381,0.00016240284,0.00047046764,0.0007436142,0.5360987,0.006883341,0.41611704,0.001463376,0.03405306],"study_design_scores_gemma":[0.00047958246,0.00053529564,0.00047116284,0.000047483645,0.000041707215,0.00006916807,0.00009651531,0.702527,0.0012639798,0.29283807,0.0015601475,0.00006984431],"about_ca_topic_score_codex":0.0013403402,"about_ca_topic_score_gemma":0.0006628146,"teacher_disagreement_score":0.0103745535,"about_ca_system_score_codex":0.0022649947,"about_ca_system_score_gemma":0.0022835766,"threshold_uncertainty_score":0.054866552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991123,0.00014844238,0.00021683518,0.000020858255,0.0000017331434,0.0000046808577,0.000044087497,0.0000035904409,0.0004473578],"genre_scores_gemma":[0.9992716,0.000102673126,0.0003078234,0.000014943519,0.0000026867065,0.0000064894816,0.00007239778,0.0000028151505,0.00021856734],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995449,0.000089063775,0.000028571556,0.00013492626,0.000071643415,0.0001308929],"domain_scores_gemma":[0.9995726,0.000089251516,0.000118608004,0.000049999042,0.00005401151,0.00011560307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002649376,0.0001534551,0.0001934694,0.0005530424,0.00023056673,0.0007362103,0.00021557191,0.00047693096,0.00043816734],"category_scores_gemma":[0.00043859275,0.0001992196,0.0001539471,0.00031703056,0.00037068667,0.00035983886,0.0005806662,0.0003115364,0.00013612665],"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.00031776587,0.0000687101,0.055622417,0.000041108724,0.00002769227,0.00022147213,0.00038201793,0.00010493778,0.9371696,0.00026511494,0.000027361657,0.005751794],"study_design_scores_gemma":[0.000019901247,0.0009799137,0.89880294,0.000022484066,0.00006673446,0.001804853,0.0020789455,0.0013710688,0.09121982,0.00065070635,0.0029217335,0.00006086332],"about_ca_topic_score_codex":0.0005282195,"about_ca_topic_score_gemma":0.0009811517,"teacher_disagreement_score":0.0007362103,"about_ca_system_score_codex":0.00027955134,"about_ca_system_score_gemma":0.0002030547,"threshold_uncertainty_score":0.0020282269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7942442,0.0019793278,0.14645977,0.0017889292,0.00020663538,0.00012560948,0.00029543904,0.00011999213,0.054780167],"genre_scores_gemma":[0.9920786,0.00043656156,0.0038118341,0.00016963438,0.00005714745,0.000045101588,0.000044571632,0.000012477217,0.0033440576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.0003936367,0.00006543577,0.00025215055,0.0002044175,0.00017839579],"domain_scores_gemma":[0.9937469,0.0037298533,0.0011065517,0.0006537365,0.00037217076,0.00039076208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017316731,0.00061632803,0.0005996253,0.00058860733,0.0006724762,0.0012894382,0.00081003376,0.0010084382,0.0045104777],"category_scores_gemma":[0.0106823025,0.00019065622,0.00067329605,0.0004142257,0.0024598225,0.0020808538,0.0012502518,0.00069395424,0.00037747054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021486003,0.000102350175,0.018423012,0.00031871605,0.00018909214,0.0018561516,0.00090367394,0.046824686,0.015304396,0.87924963,0.0022537976,0.034359664],"study_design_scores_gemma":[0.00008112087,0.0002832936,0.015960068,0.000115592826,0.00017751561,0.004516297,0.0007211727,0.16913038,0.0057534208,0.79293054,0.010195921,0.00013474392],"about_ca_topic_score_codex":0.0008481757,"about_ca_topic_score_gemma":0.00052093767,"teacher_disagreement_score":0.0045104777,"about_ca_system_score_codex":0.00053252664,"about_ca_system_score_gemma":0.00040331853,"threshold_uncertainty_score":0.015089095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15485984,0.00026087963,0.8369485,0.0003179862,0.00005277178,0.00014489001,0.00032036152,0.00096370804,0.0061310194],"genre_scores_gemma":[0.71918595,0.00016415796,0.27373722,0.000093365146,0.000055724988,0.00020999847,0.0009194698,0.00027527762,0.005358754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864227,0.00048489546,0.00007852332,0.00030134356,0.00030264823,0.00019026338],"domain_scores_gemma":[0.9941176,0.0043699327,0.00031538407,0.00049552805,0.00043303653,0.00026849567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020541844,0.0015383177,0.0020892096,0.001628083,0.0009579335,0.003441298,0.003089799,0.0016934348,0.009169232],"category_scores_gemma":[0.015523347,0.0012186848,0.0011023569,0.0017225246,0.0014326192,0.005487304,0.0029864656,0.0017463871,0.00092505256],"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.0005502953,0.00017586112,0.0017932309,0.00016325242,0.000119855285,0.0000828923,0.00016401254,0.87543553,0.0011760946,0.061479274,0.0018745981,0.05698502],"study_design_scores_gemma":[0.000012309923,0.000017617383,0.000063978834,0.000005546824,0.0000067166516,0.000009185531,0.000031324722,0.954167,0.0002896247,0.045263465,0.00012922009,0.000003986192],"about_ca_topic_score_codex":0.005583975,"about_ca_topic_score_gemma":0.009285478,"teacher_disagreement_score":0.009169232,"about_ca_system_score_codex":0.0022785151,"about_ca_system_score_gemma":0.0016021987,"threshold_uncertainty_score":0.0306741},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07185144,0.011648029,0.6672044,0.020673703,0.0008086776,0.0001882592,0.0010497763,0.00028501483,0.2262907],"genre_scores_gemma":[0.8144123,0.0123570245,0.13225044,0.0019715505,0.0030622438,0.00066444714,0.001133173,0.00033125802,0.033817522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639195,0.0014841168,0.00018244523,0.00043682542,0.0011365882,0.00036807987],"domain_scores_gemma":[0.96142876,0.03511144,0.000756969,0.0014856535,0.00072126713,0.00049592654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035932355,0.0015338406,0.002323325,0.0018599143,0.0014691687,0.0068000564,0.0028587107,0.0022225736,0.010598583],"category_scores_gemma":[0.02320643,0.0010679141,0.0022337364,0.002947805,0.0060914615,0.014530307,0.0037654531,0.00851755,0.0008439735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030488836,0.000021390248,0.00013262084,0.00010084001,0.00002390621,0.000028128752,0.00008870629,0.018312957,0.00013439187,0.9713982,0.0026765978,0.0070516877],"study_design_scores_gemma":[0.000004798322,0.0000040007985,0.000059257673,0.00001494454,0.000004617389,0.000012591876,0.000013024349,0.020552304,0.00003410214,0.9784048,0.0008900463,0.000005540803],"about_ca_topic_score_codex":0.0022976594,"about_ca_topic_score_gemma":0.0015727085,"teacher_disagreement_score":0.010598583,"about_ca_system_score_codex":0.0044612414,"about_ca_system_score_gemma":0.0016838922,"threshold_uncertainty_score":0.035455763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50631595,0.0023063277,0.47344792,0.002126439,0.000096784475,0.00004615522,0.0005792724,0.00036794413,0.014713085],"genre_scores_gemma":[0.9894169,0.0004862334,0.007940135,0.000048369544,0.00013057735,0.000034566834,0.00016311136,0.00006352444,0.0017166589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898344,0.0003661884,0.000033721168,0.00025760318,0.00021340481,0.00014559094],"domain_scores_gemma":[0.9517694,0.04212877,0.0030908163,0.0012074738,0.0010872858,0.00071623985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024212478,0.0005375686,0.000799333,0.0021685471,0.00073702,0.0023064052,0.0015674871,0.001023077,0.0025239764],"category_scores_gemma":[0.029919218,0.00071875035,0.00067769235,0.001977762,0.0024959464,0.0040314994,0.0011236079,0.001902514,0.00021580432],"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.00010094715,0.0000805373,0.0151844565,0.00017219954,0.0001093829,0.00017999296,0.00041665576,0.33572465,0.0033446804,0.6115858,0.0031861989,0.029914448],"study_design_scores_gemma":[0.00000676294,0.000027420958,0.0047946805,0.000024603933,0.000024213337,0.00009149015,0.00006671741,0.7001868,0.000461651,0.293735,0.00055700983,0.000023716178],"about_ca_topic_score_codex":0.002066462,"about_ca_topic_score_gemma":0.002228342,"teacher_disagreement_score":0.0025239764,"about_ca_system_score_codex":0.0018435778,"about_ca_system_score_gemma":0.0007641594,"threshold_uncertainty_score":0.013376117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3276322,0.0007773207,0.6613373,0.002505776,0.00014819375,0.00011994242,0.0014550389,0.0007775001,0.0052467575],"genre_scores_gemma":[0.9636041,0.00033304453,0.033336956,0.00013208148,0.00009245649,0.00009335651,0.00057123695,0.00004333216,0.0017934188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995192,0.00015961153,0.00002613331,0.00015002812,0.0000836486,0.00006136835],"domain_scores_gemma":[0.99793375,0.0014013809,0.00029040594,0.00012845997,0.00017135731,0.00007475916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002112578,0.0007108756,0.0009307616,0.0011346531,0.0004905431,0.0013900163,0.0016945502,0.0012287591,0.0014042886],"category_scores_gemma":[0.006253817,0.00050606206,0.00084324676,0.0011244618,0.0005703714,0.0014144718,0.0010702091,0.0017878389,0.00024697112],"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.000033664346,0.000029654784,0.0059864568,0.000012849055,0.000049636423,0.00004222725,0.000040684634,0.9758789,0.00013944252,0.0033216712,0.00062816736,0.013836748],"study_design_scores_gemma":[0.0000015715162,0.000004156896,0.0003784854,0.0000021158257,0.0000035346438,0.0000044430994,0.000003631751,0.99778277,0.000020730597,0.0017282229,0.00006776847,0.0000025567238],"about_ca_topic_score_codex":0.020746484,"about_ca_topic_score_gemma":0.0125617655,"teacher_disagreement_score":0.020746484,"about_ca_system_score_codex":0.0008293442,"about_ca_system_score_gemma":0.0010142757,"threshold_uncertainty_score":0.04125142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04650705,0.0003566659,0.93817055,0.0012123488,0.00009960586,0.000063452666,0.00020459617,0.000101291625,0.013284468],"genre_scores_gemma":[0.81154114,0.00080155896,0.17374964,0.00029323765,0.00017359579,0.00026048708,0.0003174334,0.00012342971,0.012739486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976774,0.0014861603,0.00007913032,0.00025077965,0.0003130587,0.00019351453],"domain_scores_gemma":[0.9914664,0.007407321,0.00031654353,0.00027124688,0.00027454007,0.000263937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031421757,0.0010766673,0.0013022914,0.0014257235,0.00078236114,0.0027123517,0.0023959419,0.002272109,0.0071602147],"category_scores_gemma":[0.012274357,0.0007434903,0.0015082245,0.0025102547,0.0020609088,0.006485906,0.0013452857,0.0030973444,0.0007071694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001833331,0.0000815015,0.00056413247,0.00015087605,0.0000821069,0.00011340048,0.00031633934,0.27286303,0.0007977476,0.6972272,0.002357789,0.025262574],"study_design_scores_gemma":[0.000017151444,0.000025339685,0.00012034639,0.000010885125,0.000019143163,0.000040212577,0.000046203382,0.4653416,0.00009653519,0.53378856,0.0004687375,0.000025383775],"about_ca_topic_score_codex":0.0038970099,"about_ca_topic_score_gemma":0.0049049123,"teacher_disagreement_score":0.0071602147,"about_ca_system_score_codex":0.0018142755,"about_ca_system_score_gemma":0.001192506,"threshold_uncertainty_score":0.023953319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032560952,0.00029828766,0.95057136,0.0016529371,0.000085658394,0.00016408584,0.0001716397,0.00014007368,0.01435499],"genre_scores_gemma":[0.90449697,0.0004519173,0.08644871,0.0003952773,0.00012413369,0.00041441596,0.00013890903,0.000065638385,0.007464152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923603,0.0045356476,0.00029588508,0.0011761462,0.00083053875,0.00080144533],"domain_scores_gemma":[0.9707591,0.02168572,0.0033809335,0.0021059727,0.0010746783,0.0009935453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008709561,0.0015647723,0.0015402238,0.0010048519,0.0008655471,0.002820296,0.0020932558,0.0024515395,0.004830843],"category_scores_gemma":[0.026608555,0.0007610883,0.0009356028,0.0009396009,0.0042958357,0.003896197,0.0026827648,0.0027473608,0.0004657404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018729654,0.00007838868,0.00061840966,0.00014503484,0.00010373587,0.00018173602,0.00018714674,0.417224,0.00097348436,0.5660888,0.0012808284,0.012931174],"study_design_scores_gemma":[0.000074886564,0.00008019045,0.00012986673,0.00003124128,0.000020894486,0.000041985008,0.000036035904,0.6077307,0.00048077098,0.38951406,0.0018378285,0.000021594435],"about_ca_topic_score_codex":0.0015383081,"about_ca_topic_score_gemma":0.0011595064,"teacher_disagreement_score":0.008709561,"about_ca_system_score_codex":0.002907165,"about_ca_system_score_gemma":0.001993901,"threshold_uncertainty_score":0.04606116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22025071,0.0012566112,0.73566514,0.0019898422,0.00014884215,0.00017732984,0.00038117653,0.00018897487,0.03994138],"genre_scores_gemma":[0.9634075,0.00066657807,0.026802987,0.00016509651,0.00008567905,0.0001779296,0.00013462428,0.00002601913,0.008533627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980678,0.0010064862,0.00006001415,0.00031404255,0.00028906358,0.00026262397],"domain_scores_gemma":[0.9966288,0.0020609465,0.00068506075,0.00017502457,0.00020605064,0.00024408824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014832591,0.0011749275,0.0009966191,0.00087455224,0.00061279285,0.0015919949,0.0015118596,0.0011319402,0.002205795],"category_scores_gemma":[0.0075289514,0.0004067685,0.000523925,0.0010736126,0.002015297,0.0028462303,0.0010723063,0.0009999413,0.00027443765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000704883,0.00003289466,0.00048152235,0.000053255433,0.000038191927,0.0002234355,0.00013753965,0.3069077,0.0009822325,0.68537647,0.0010082021,0.004688005],"study_design_scores_gemma":[0.00005038488,0.000045946577,0.00028448662,0.000014250101,0.000012128288,0.00006722684,0.00007007452,0.6302888,0.00025472775,0.36653718,0.002355556,0.000019111654],"about_ca_topic_score_codex":0.0041763717,"about_ca_topic_score_gemma":0.0024158396,"teacher_disagreement_score":0.0041763717,"about_ca_system_score_codex":0.0023013647,"about_ca_system_score_gemma":0.00057726447,"threshold_uncertainty_score":0.016697645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042365454,0.00020962402,0.9504683,0.0003107117,0.000047297675,0.00004505907,0.00007111139,0.00013209792,0.006350232],"genre_scores_gemma":[0.9010678,0.00023307677,0.09338942,0.00009667283,0.000049849077,0.00011586477,0.0001263243,0.000117140255,0.004803884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986639,0.0007014429,0.00004013796,0.00027788663,0.00017103698,0.00014562572],"domain_scores_gemma":[0.99491006,0.0039139376,0.00029707875,0.0002954502,0.00038655248,0.00019688999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026691635,0.0010376747,0.0014203103,0.0010044901,0.0008136542,0.0016286938,0.0019892175,0.0013671246,0.005770277],"category_scores_gemma":[0.009886326,0.0005288447,0.0011970168,0.0011757716,0.0013240662,0.0034367826,0.002300457,0.0020040495,0.00042336565],"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.00020470239,0.00008782605,0.00073836965,0.00014265462,0.000088725574,0.00012320465,0.00028368665,0.7532277,0.0022284815,0.21390662,0.0016262735,0.027341774],"study_design_scores_gemma":[0.000004981567,0.000016916287,0.000054021286,0.0000047719036,0.000008830406,0.000008505191,0.00001556733,0.9459195,0.0001487612,0.05363899,0.00017471744,0.0000044651883],"about_ca_topic_score_codex":0.0036739227,"about_ca_topic_score_gemma":0.0026595856,"teacher_disagreement_score":0.005770277,"about_ca_system_score_codex":0.001492666,"about_ca_system_score_gemma":0.0012386823,"threshold_uncertainty_score":0.019303441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103188455,0.0011248105,0.8472839,0.0045217006,0.0004060571,0.0005381551,0.00026318073,0.0002869253,0.042386718],"genre_scores_gemma":[0.8491069,0.00089707196,0.12837812,0.0004483639,0.0002756805,0.00094096834,0.00015706498,0.00007848192,0.019717474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869848,0.008373635,0.0009319658,0.0009536138,0.0016913956,0.0010645258],"domain_scores_gemma":[0.9567096,0.03500227,0.002827138,0.0028322898,0.0014888297,0.0011398827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013688802,0.001122059,0.002201776,0.0014278215,0.0020434083,0.0068690847,0.004784559,0.005316957,0.008643263],"category_scores_gemma":[0.049595516,0.0010608864,0.0013600463,0.0017507044,0.0042821225,0.011089874,0.0032190704,0.004886871,0.001046468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011604319,0.00006959209,0.00013078305,0.000085537235,0.00002026248,0.000038095735,0.00016995089,0.015800685,0.0003080834,0.9733156,0.00096242235,0.008982902],"study_design_scores_gemma":[0.00009192547,0.000055509332,0.00007644175,0.000039484203,0.000015218075,0.000043455162,0.000032821015,0.056061093,0.0001680762,0.9418373,0.001553855,0.000024855586],"about_ca_topic_score_codex":0.000981172,"about_ca_topic_score_gemma":0.0007047054,"teacher_disagreement_score":0.013688802,"about_ca_system_score_codex":0.003920391,"about_ca_system_score_gemma":0.0032827193,"threshold_uncertainty_score":0.07239419},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018748008,0.002779672,0.5096489,0.022937037,0.0008795849,0.00027927797,0.0006410242,0.00029483455,0.44379163],"genre_scores_gemma":[0.8205393,0.0029174862,0.0944906,0.005878446,0.0010585821,0.0008320951,0.00054900866,0.00030897252,0.07342556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.979629,0.009164597,0.0011568222,0.0043785227,0.004131298,0.001539823],"domain_scores_gemma":[0.97267103,0.01374869,0.0026583113,0.006152663,0.0032396677,0.0015295775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012090431,0.00096479896,0.0012460551,0.0016464274,0.0041976827,0.01051082,0.0022701176,0.0047258427,0.025626112],"category_scores_gemma":[0.029723177,0.00064144144,0.0014097508,0.0019890924,0.014178516,0.016192356,0.009542993,0.006863866,0.0047927783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005485921,0.0000047212466,0.000106846855,0.000030662803,0.000006277199,0.000018676525,0.00030155294,0.0002475263,0.000075266966,0.99356973,0.001367911,0.004265248],"study_design_scores_gemma":[0.000004108553,0.000007793838,0.00008382395,0.000034575012,0.000004420539,0.000036296344,0.00018554818,0.00089771627,0.00011219474,0.9781994,0.020427091,0.0000069865855],"about_ca_topic_score_codex":0.0013477479,"about_ca_topic_score_gemma":0.0010386078,"teacher_disagreement_score":0.025626112,"about_ca_system_score_codex":0.0033261282,"about_ca_system_score_gemma":0.0036592188,"threshold_uncertainty_score":0.08572793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.155898,0.00046704337,0.75124884,0.0014536534,0.00017187645,0.0007636269,0.00091500574,0.00055327686,0.08852874],"genre_scores_gemma":[0.8909748,0.0005831667,0.07884179,0.00022560531,0.00008051196,0.0007735531,0.00049057615,0.00008604499,0.027944013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773103,0.0008955051,0.000074740274,0.00056767644,0.00048419664,0.00024696288],"domain_scores_gemma":[0.9934564,0.0025733656,0.0009938169,0.0015441407,0.0009415929,0.0004906076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018867879,0.00045698782,0.0005961666,0.0008899617,0.0016928635,0.0022417277,0.0014958562,0.0009823266,0.0073197912],"category_scores_gemma":[0.012224427,0.00032130082,0.0005142307,0.0008142324,0.0014099691,0.0037171855,0.00275309,0.0008431961,0.0009102273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047776095,0.000048400336,0.0013154462,0.00010986442,0.00003954233,0.00015927888,0.00040625292,0.034802105,0.0020821434,0.92974895,0.004681654,0.026558539],"study_design_scores_gemma":[0.00003722792,0.00010311712,0.0010741773,0.000047464488,0.000047677713,0.00064161816,0.00040118524,0.16127653,0.003495536,0.79090863,0.04193079,0.00003597348],"about_ca_topic_score_codex":0.0008258554,"about_ca_topic_score_gemma":0.001064879,"teacher_disagreement_score":0.0073197912,"about_ca_system_score_codex":0.0012174614,"about_ca_system_score_gemma":0.0011351882,"threshold_uncertainty_score":0.024487078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.490094,0.00043654942,0.48232785,0.0019775392,0.00007004342,0.00012543258,0.00016843902,0.00009814903,0.024701895],"genre_scores_gemma":[0.9894475,0.000118375036,0.0077434126,0.00011543951,0.000023837038,0.00006671671,0.000029354638,0.0000072509965,0.002448232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.0006096061,0.000032355423,0.00013306712,0.0001519748,0.00014515179],"domain_scores_gemma":[0.9962547,0.0028513065,0.00029553453,0.00009957777,0.0001735599,0.00032539474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013977734,0.00047567495,0.0008733198,0.00068384054,0.0006776565,0.0013728543,0.0009610384,0.0012891073,0.0024064449],"category_scores_gemma":[0.0054704053,0.00024041448,0.00049422384,0.00055167434,0.0020469606,0.0018127407,0.0011515811,0.0011326823,0.0001343074],"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.000154151,0.00006906036,0.0011123021,0.00008455934,0.00006844645,0.00025956717,0.0002922861,0.44090202,0.0029695495,0.54683584,0.0012682469,0.0059840335],"study_design_scores_gemma":[0.000038559057,0.00004987206,0.00022804707,0.000010757166,0.000008609919,0.000034781526,0.00008688747,0.74583787,0.00031195406,0.25268027,0.00070069614,0.00001162026],"about_ca_topic_score_codex":0.0023795608,"about_ca_topic_score_gemma":0.0017151054,"teacher_disagreement_score":0.0024064449,"about_ca_system_score_codex":0.0013983126,"about_ca_system_score_gemma":0.00044361493,"threshold_uncertainty_score":0.010145485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027346438,0.00047753772,0.95847535,0.0005407625,0.00007338365,0.0003018158,0.00043679398,0.0005082306,0.01183963],"genre_scores_gemma":[0.27847964,0.0012406552,0.7023123,0.00048047057,0.00024312391,0.0010999838,0.0025323126,0.0006095748,0.013001919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968194,0.0007875869,0.00023142307,0.0007871,0.00076016586,0.00061432895],"domain_scores_gemma":[0.9959001,0.002283576,0.0004819034,0.00058917113,0.00045886906,0.0002864344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021032558,0.0022129063,0.0018204733,0.0021309492,0.0012540353,0.0054477607,0.0039791316,0.0020182875,0.007701938],"category_scores_gemma":[0.010148895,0.00095770997,0.0020227202,0.002810256,0.0024290993,0.010374838,0.003768282,0.0042864433,0.001571241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078679404,0.00010174611,0.0006202589,0.00025203067,0.000049517817,0.00007129627,0.000439136,0.063175924,0.0010075278,0.8849068,0.0048378147,0.04445919],"study_design_scores_gemma":[0.000040337225,0.000034357614,0.00018489515,0.00005281249,0.000023870949,0.00008171626,0.00013607505,0.18007146,0.0007133808,0.81147504,0.0071563423,0.00002963702],"about_ca_topic_score_codex":0.0036792587,"about_ca_topic_score_gemma":0.0038705675,"teacher_disagreement_score":0.007701938,"about_ca_system_score_codex":0.0032633566,"about_ca_system_score_gemma":0.0021280209,"threshold_uncertainty_score":0.025765538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97932476,0.00016354352,0.006807238,0.00031081642,0.000012277033,0.000011103007,0.00007198671,0.000010082837,0.013288179],"genre_scores_gemma":[0.99740976,0.00006248771,0.0013534725,0.00002751433,0.0000033983938,0.000010571151,0.000037122474,0.000005230714,0.0010904177],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926263,0.00040423535,0.00001800664,0.00015653702,0.00006763205,0.00009095334],"domain_scores_gemma":[0.99703276,0.0011130321,0.0007160638,0.0003184935,0.00029747846,0.000522141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013813286,0.00020452173,0.00024196277,0.0005809725,0.0011022609,0.0031228526,0.0005192398,0.00060929626,0.0031679],"category_scores_gemma":[0.008349799,0.00026603922,0.0003510309,0.00038861937,0.0021559105,0.0017435646,0.0016937201,0.00084640516,0.0003179759],"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.0007040057,0.00037822334,0.43771142,0.000111981346,0.0002582917,0.0013817443,0.032325752,0.037414756,0.012027349,0.4058684,0.002609236,0.06920889],"study_design_scores_gemma":[0.00012732651,0.00048707222,0.39861557,0.00010314175,0.00021976962,0.0017731017,0.019886889,0.16300382,0.0031929894,0.38914618,0.02311821,0.0003257966],"about_ca_topic_score_codex":0.004278503,"about_ca_topic_score_gemma":0.0038887241,"teacher_disagreement_score":0.004278503,"about_ca_system_score_codex":0.0013914024,"about_ca_system_score_gemma":0.00037428108,"threshold_uncertainty_score":0.010597646},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85746783,0.0010531046,0.101020604,0.00061186665,0.000097150376,0.00008166687,0.0013082897,0.0002567473,0.038102735],"genre_scores_gemma":[0.98115015,0.00020150021,0.012290251,0.00006504379,0.000093682094,0.0000617251,0.00087888044,0.000030319334,0.0052284976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992143,0.00011715511,0.000053604384,0.00024329266,0.00018060158,0.00019107755],"domain_scores_gemma":[0.99750817,0.0008325562,0.0005060775,0.0002712506,0.0003106145,0.0005713457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046300367,0.00046122365,0.00047010847,0.0013124308,0.0012213239,0.0023349847,0.0006099824,0.0005033099,0.006643186],"category_scores_gemma":[0.0029440976,0.00031871066,0.0006483825,0.0010866352,0.0015769762,0.0018218126,0.0011965608,0.0009599915,0.00036314892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037491292,0.00010476127,0.007504687,0.00013699889,0.00007403184,0.0005776803,0.0008919548,0.015077039,0.005577669,0.9323796,0.0028146575,0.034486085],"study_design_scores_gemma":[0.00012307975,0.00032637856,0.006015012,0.00008228614,0.000053464093,0.0009309319,0.0007246493,0.047202084,0.003509747,0.91840446,0.02257426,0.000053741056],"about_ca_topic_score_codex":0.0011689122,"about_ca_topic_score_gemma":0.0010225524,"teacher_disagreement_score":0.006643186,"about_ca_system_score_codex":0.0009149358,"about_ca_system_score_gemma":0.00045784874,"threshold_uncertainty_score":0.022223651},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06299061,0.034607094,0.29410478,0.018135998,0.0011082916,0.00009788341,0.0010025229,0.00028327337,0.5876695],"genre_scores_gemma":[0.8439853,0.023205733,0.05421626,0.001112102,0.0034977288,0.00026691423,0.00093068846,0.00013727217,0.07264802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993538,0.00019948158,0.00003100533,0.00008823336,0.00026833813,0.000059190887],"domain_scores_gemma":[0.9981797,0.0012969178,0.0001193496,0.00015696141,0.00015639451,0.000090702575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056179217,0.00065281277,0.00082562916,0.0013625115,0.0008503177,0.0043470087,0.00068172056,0.00081763556,0.007921639],"category_scores_gemma":[0.0032979145,0.00042820335,0.0005986086,0.0018504305,0.0033661262,0.005799837,0.0012190806,0.0032521249,0.0009569406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003543735,0.000005227047,0.000043538024,0.000025515792,0.0000036394017,0.0000066192874,0.00005598166,0.0010055993,0.000076605626,0.9914452,0.0023300003,0.004998614],"study_design_scores_gemma":[0.0000017624383,0.0000020863768,0.000060045437,0.000006280366,0.0000012738766,0.00001360678,0.000013882588,0.0011629188,0.000021022965,0.994052,0.0046628183,0.0000023391663],"about_ca_topic_score_codex":0.0009989762,"about_ca_topic_score_gemma":0.0007642537,"teacher_disagreement_score":0.007921639,"about_ca_system_score_codex":0.00212381,"about_ca_system_score_gemma":0.0008211233,"threshold_uncertainty_score":0.026500523},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18775529,0.0022872542,0.617438,0.02021958,0.0009846988,0.00018542906,0.0012777534,0.00053638435,0.16931564],"genre_scores_gemma":[0.95695573,0.0011675273,0.019729033,0.0011291263,0.00059409597,0.00017614085,0.00028446637,0.00013642469,0.019827487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988475,0.00045853932,0.000040248764,0.00019190116,0.0002407866,0.00022103217],"domain_scores_gemma":[0.99153966,0.0058273287,0.0007975359,0.00059285044,0.00049464946,0.00074800046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029354205,0.0010732362,0.0014844079,0.0017031594,0.0014992494,0.0039204187,0.0022885446,0.002686986,0.023115948],"category_scores_gemma":[0.023874613,0.00062204164,0.0011396973,0.0010353823,0.003932537,0.008197647,0.00256559,0.0038795217,0.0015815226],"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.000030817013,0.000020020147,0.0003379673,0.000055066095,0.00001331248,0.000030254409,0.00006719408,0.009113164,0.00010291116,0.98184675,0.0047715404,0.0036110957],"study_design_scores_gemma":[0.000007989157,0.0000062066133,0.00009397755,0.000012255142,0.000003846863,0.000014924657,0.000025066856,0.037528,0.00002892845,0.9617582,0.0005156484,0.000004999659],"about_ca_topic_score_codex":0.002047824,"about_ca_topic_score_gemma":0.0019440601,"teacher_disagreement_score":0.023115948,"about_ca_system_score_codex":0.0013972578,"about_ca_system_score_gemma":0.0018931382,"threshold_uncertainty_score":0.07733059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020210627,0.030200113,0.020411344,0.0038037766,0.0011763945,0.00005891893,0.00048010374,0.00019244099,0.9416558],"genre_scores_gemma":[0.05034432,0.048312277,0.025910204,0.003038929,0.0012501735,0.00023169651,0.0010468614,0.0002805197,0.869585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997693,0.00005564643,0.000011488755,0.000038249866,0.0000984917,0.000026925773],"domain_scores_gemma":[0.9998591,0.00006084042,0.000011307546,0.000015232765,0.000037337173,0.000016226115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032782863,0.0006893681,0.0005873588,0.00065905944,0.0007820272,0.0032216036,0.0004493846,0.0007782369,0.044817008],"category_scores_gemma":[0.0009611071,0.00029427654,0.0004460189,0.0017557148,0.00100632,0.0028816564,0.0007134927,0.0018875037,0.020228175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016246342,0.000026332516,0.00011734259,0.0002808143,0.0000098199625,0.0000585526,0.0003606124,0.000961796,0.00035724643,0.743991,0.15262936,0.10119093],"study_design_scores_gemma":[0.0000053975764,0.000017786091,0.00033049632,0.0002600311,0.000008479125,0.0001776181,0.00016962603,0.0007476136,0.00018240299,0.40956205,0.5885288,0.000009679199],"about_ca_topic_score_codex":0.0012648797,"about_ca_topic_score_gemma":0.0029609546,"teacher_disagreement_score":0.044817008,"about_ca_system_score_codex":0.0010902871,"about_ca_system_score_gemma":0.000973528,"threshold_uncertainty_score":0.1499278},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19581674,0.0022599238,0.33386236,0.045110628,0.00042853618,0.00046505406,0.0012537735,0.00036950727,0.42043343],"genre_scores_gemma":[0.9528362,0.00058327214,0.008015542,0.0009487217,0.00024316071,0.00019924444,0.00013569964,0.000037169757,0.037000943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950906,0.002703136,0.00015325681,0.00065918744,0.00063737464,0.0007563674],"domain_scores_gemma":[0.98791796,0.00841125,0.0012304976,0.0006299552,0.0007440157,0.0010663073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052602836,0.0010483599,0.0013141682,0.0012384775,0.0014865446,0.006028329,0.0021777558,0.0067251134,0.022437843],"category_scores_gemma":[0.013330284,0.0005887849,0.0011319596,0.0017864777,0.0047640246,0.0048693,0.002454237,0.0036306493,0.0017714106],"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.000100255,0.000086206004,0.00072570547,0.000055207416,0.00003899277,0.0003413416,0.00031001255,0.035846982,0.0002146096,0.9560883,0.0024243752,0.0037680282],"study_design_scores_gemma":[0.00018468323,0.00008883689,0.0004533951,0.000033519,0.000032564098,0.00017882521,0.0002455538,0.12243286,0.000099101686,0.86638427,0.009832185,0.000034236837],"about_ca_topic_score_codex":0.005009148,"about_ca_topic_score_gemma":0.00246554,"teacher_disagreement_score":0.022437843,"about_ca_system_score_codex":0.0049198065,"about_ca_system_score_gemma":0.0021603045,"threshold_uncertainty_score":0.07506204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063585944,0.00092939584,0.8673157,0.0017896004,0.0000994864,0.00017949152,0.0003375569,0.000091544774,0.0656713],"genre_scores_gemma":[0.9390576,0.0008207584,0.046859775,0.0005522674,0.00022114844,0.00036905328,0.0003176345,0.00006733348,0.01173443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737835,0.0013305136,0.00011420709,0.00034172242,0.0004985307,0.00033661837],"domain_scores_gemma":[0.9923097,0.0057493984,0.00048512258,0.00023990349,0.00077224895,0.000443703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002468899,0.0010857225,0.0010373303,0.0009450661,0.0008178237,0.0019859616,0.0013124545,0.0015196544,0.007633258],"category_scores_gemma":[0.013186748,0.0004356075,0.00093292975,0.0008565366,0.002888735,0.004388645,0.0024538916,0.0020070195,0.0007362622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023669192,0.000025473282,0.00025098823,0.00007755946,0.000013320995,0.0001316935,0.00012799473,0.046582725,0.00076256954,0.9472728,0.0010559148,0.0036753188],"study_design_scores_gemma":[0.000018306355,0.00003363078,0.00012744132,0.000024968875,0.000003834089,0.00007968247,0.00007200496,0.22988933,0.00014006118,0.76782787,0.0017693687,0.000013455421],"about_ca_topic_score_codex":0.002013997,"about_ca_topic_score_gemma":0.0011404211,"teacher_disagreement_score":0.007633258,"about_ca_system_score_codex":0.0015978257,"about_ca_system_score_gemma":0.0010388275,"threshold_uncertainty_score":0.025535822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8875443,0.00036560485,0.094644405,0.00020964147,0.00001764371,0.00018446425,0.0004327362,0.00010584045,0.016495328],"genre_scores_gemma":[0.98659074,0.00009059933,0.011586384,0.00003799777,0.0000116819065,0.00011688877,0.0002402101,0.00001824426,0.0013073124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990269,0.00035582195,0.00008669146,0.0001924011,0.0001851848,0.0001529576],"domain_scores_gemma":[0.9925728,0.0044919467,0.001421811,0.00053477584,0.00047532795,0.0005033921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010534428,0.00039545566,0.0005718586,0.0022130527,0.0009151489,0.0025589045,0.0007394024,0.00071979634,0.0036689725],"category_scores_gemma":[0.008818708,0.000328387,0.0005850448,0.0015196712,0.0018464685,0.0027318292,0.0010871508,0.00061720714,0.0002836807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070298376,0.0003530739,0.05039224,0.0002904473,0.00015706029,0.00040156944,0.0030148171,0.12472545,0.006531681,0.7516608,0.002913206,0.058856636],"study_design_scores_gemma":[0.000071622264,0.00018413136,0.013984142,0.00006611651,0.000034380704,0.00019931461,0.0011116897,0.36546785,0.0015928397,0.6136271,0.0035953955,0.000065418],"about_ca_topic_score_codex":0.00450832,"about_ca_topic_score_gemma":0.0045946073,"teacher_disagreement_score":0.00450832,"about_ca_system_score_codex":0.0016243289,"about_ca_system_score_gemma":0.0007153153,"threshold_uncertainty_score":0.012273908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049509857,0.0023243113,0.9028301,0.009364112,0.00030790374,0.0004305366,0.00027393832,0.0005223941,0.034436863],"genre_scores_gemma":[0.90415096,0.00089258695,0.08509564,0.0007261748,0.00031367163,0.00069922954,0.000110309105,0.00009656197,0.007914813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96597075,0.022840083,0.0018349335,0.0036245806,0.004333868,0.0013956903],"domain_scores_gemma":[0.7816096,0.17740613,0.012020444,0.019995105,0.00735062,0.0016181539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03923146,0.0016323779,0.0041958913,0.002266881,0.0013037279,0.007241195,0.005535146,0.008548674,0.009714323],"category_scores_gemma":[0.23746331,0.001423788,0.0015505562,0.0016421503,0.0070157903,0.013959635,0.0057264767,0.0064273803,0.0012279693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000264528,0.00017406887,0.0016627464,0.0004781166,0.00026492742,0.00025421006,0.0001968533,0.042827524,0.000534101,0.9210858,0.0019873197,0.030269925],"study_design_scores_gemma":[0.00014829528,0.00010005303,0.00034971864,0.00011082775,0.0000656095,0.00008963642,0.00007812981,0.076758504,0.0004884883,0.9196431,0.0021386489,0.000029038754],"about_ca_topic_score_codex":0.0014102806,"about_ca_topic_score_gemma":0.000981105,"teacher_disagreement_score":0.03923146,"about_ca_system_score_codex":0.002534475,"about_ca_system_score_gemma":0.003568898,"threshold_uncertainty_score":0.20747828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92623883,0.000289373,0.05618368,0.0027571996,0.00008154982,0.00009016323,0.000087852546,0.00006286687,0.014208382],"genre_scores_gemma":[0.99611855,0.000066136556,0.0033227894,0.00014275977,0.000016461685,0.000012926202,0.000019439274,0.0000064523942,0.00029445696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994177,0.0032742165,0.00029644286,0.00078383076,0.000942124,0.0005265307],"domain_scores_gemma":[0.9532474,0.029203074,0.009769787,0.0038955589,0.0025522206,0.0013319026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0112585705,0.0003958411,0.0006438724,0.0006718254,0.00070681603,0.0036036728,0.001187458,0.0025552097,0.0033709686],"category_scores_gemma":[0.06586025,0.00050593837,0.00059678085,0.00055234047,0.003081393,0.0040576183,0.0017729983,0.0033620016,0.00032195242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032191442,0.0014759344,0.1922201,0.0011155981,0.0015061639,0.0027366679,0.028773082,0.18067907,0.039072506,0.37875524,0.0039833514,0.16646315],"study_design_scores_gemma":[0.0003231114,0.001165906,0.06818413,0.00026234795,0.00045668508,0.0006056265,0.008174555,0.22175388,0.010367384,0.67845047,0.0099069355,0.0003489425],"about_ca_topic_score_codex":0.0019936953,"about_ca_topic_score_gemma":0.0016786556,"teacher_disagreement_score":0.0112585705,"about_ca_system_score_codex":0.0012227078,"about_ca_system_score_gemma":0.00082658604,"threshold_uncertainty_score":0.059541762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010428011,0.00007665843,0.9862345,0.00014584998,0.000013545657,0.00006924607,0.000032019314,0.00022679463,0.0027733648],"genre_scores_gemma":[0.4023798,0.00020983943,0.5906088,0.00024539465,0.000044098746,0.00064566743,0.0002090647,0.00032315176,0.005334305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987674,0.00063666276,0.000040557705,0.00017827004,0.0002322088,0.00014491413],"domain_scores_gemma":[0.99665916,0.0026878784,0.0002350254,0.00011435145,0.00020443348,0.00009909175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028120433,0.001491109,0.0013430242,0.0011414465,0.00060947833,0.0019959765,0.0010811435,0.0014535201,0.0047439863],"category_scores_gemma":[0.00931505,0.00074119854,0.001011604,0.0008548399,0.0019959414,0.0015478852,0.0016680594,0.002387591,0.0007898479],"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.000054294935,0.00006925928,0.0003658713,0.000078583056,0.000022622015,0.000045502988,0.000068683024,0.9354291,0.0008643448,0.040663186,0.00063332537,0.021705287],"study_design_scores_gemma":[0.000007783129,0.000022755217,0.000028265173,0.000009381829,0.0000032187634,0.000007202366,0.000016162294,0.9783563,0.0003133969,0.021022068,0.00020930497,0.000004182697],"about_ca_topic_score_codex":0.0028797688,"about_ca_topic_score_gemma":0.002952599,"teacher_disagreement_score":0.0047439863,"about_ca_system_score_codex":0.0017997264,"about_ca_system_score_gemma":0.0019779755,"threshold_uncertainty_score":0.015870214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61211133,0.00070551364,0.3079028,0.0052313423,0.00022852376,0.0004399392,0.00009536232,0.00014883846,0.073136285],"genre_scores_gemma":[0.98384756,0.00013737947,0.009252644,0.00013103291,0.000036056743,0.00014486535,0.0000122528745,0.000016852799,0.006421352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99396175,0.0041509434,0.0002235972,0.00046955002,0.000523211,0.00067091413],"domain_scores_gemma":[0.96718675,0.027815731,0.0020206603,0.0010276405,0.00082222227,0.0011270279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008797152,0.00067379867,0.0019588182,0.00074592413,0.0015657999,0.0044128066,0.002013832,0.0037577925,0.0074617025],"category_scores_gemma":[0.036433168,0.0007124443,0.0010382913,0.0005302234,0.0045855027,0.0051346053,0.002559843,0.0031335158,0.00033388782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026888403,0.00021714404,0.0014464373,0.00016824329,0.00014491836,0.00035958967,0.0009509785,0.08810929,0.00092737935,0.89752704,0.0013287073,0.00855135],"study_design_scores_gemma":[0.00013112648,0.00012575205,0.0005157358,0.000035064015,0.00003640952,0.00007216452,0.00029433522,0.20716913,0.00028545267,0.79012716,0.0011721554,0.00003557213],"about_ca_topic_score_codex":0.0031067997,"about_ca_topic_score_gemma":0.0018561461,"teacher_disagreement_score":0.008797152,"about_ca_system_score_codex":0.002103578,"about_ca_system_score_gemma":0.0019286247,"threshold_uncertainty_score":0.046524346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7613542,0.0008155216,0.058968414,0.0049780672,0.0002197899,0.00041552016,0.0003520689,0.0020168626,0.1708795],"genre_scores_gemma":[0.96482885,0.0004313337,0.01858087,0.00028627142,0.00005181474,0.00006711353,0.00017567007,0.00028869807,0.01528936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947184,0.00014913075,0.000020768086,0.00007921808,0.00015794743,0.00012113784],"domain_scores_gemma":[0.99837995,0.0005316809,0.00017669846,0.0004179341,0.00020758728,0.00028609965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008627356,0.00035532445,0.00023031647,0.0007026414,0.0020125676,0.0037351258,0.0012988559,0.000494818,0.0076971473],"category_scores_gemma":[0.0046600397,0.00019292157,0.00023699855,0.0010021286,0.001677236,0.0044104713,0.0030822733,0.00076623907,0.00108742],"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.001681291,0.0009418586,0.029120676,0.00040753648,0.00011837716,0.0015631436,0.014583769,0.026019221,0.028138973,0.3495864,0.04752559,0.5003131],"study_design_scores_gemma":[0.00055589306,0.0007407017,0.020178458,0.00035710775,0.00013826152,0.0009759641,0.02558862,0.23581246,0.052379485,0.28325108,0.37979308,0.00022888444],"about_ca_topic_score_codex":0.009676606,"about_ca_topic_score_gemma":0.017492823,"teacher_disagreement_score":0.009676606,"about_ca_system_score_codex":0.0014561788,"about_ca_system_score_gemma":0.001916065,"threshold_uncertainty_score":0.025749505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02899646,0.0026447498,0.43259677,0.00833023,0.0005876154,0.00031257927,0.0002687593,0.0002996554,0.5259631],"genre_scores_gemma":[0.8185848,0.0028922858,0.051819228,0.0033824437,0.0007348996,0.0006416795,0.00019361978,0.00036986425,0.12138125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958652,0.0015566455,0.00016408425,0.000587123,0.0013897266,0.00043725554],"domain_scores_gemma":[0.9905828,0.0060509345,0.0008902962,0.0011750851,0.0009229209,0.00037788867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004180479,0.0007717409,0.0007298305,0.0012425936,0.0014484801,0.0041588396,0.001798608,0.0025746063,0.026583994],"category_scores_gemma":[0.015752753,0.00053398695,0.001625364,0.0011860196,0.0071217827,0.0056828456,0.0027825441,0.005122237,0.0022887883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015474161,0.00003375731,0.0004213345,0.000051169856,0.000020563844,0.000068688736,0.00039922545,0.0030081628,0.00033701904,0.9842663,0.0023781213,0.009000233],"study_design_scores_gemma":[0.000018450475,0.000052080057,0.0006367557,0.000055799144,0.000020641235,0.00014275115,0.00013691896,0.0058889408,0.00036868674,0.973239,0.019418944,0.000021029828],"about_ca_topic_score_codex":0.0019498763,"about_ca_topic_score_gemma":0.0011923403,"teacher_disagreement_score":0.026583994,"about_ca_system_score_codex":0.0027653857,"about_ca_system_score_gemma":0.0015074285,"threshold_uncertainty_score":0.088932335},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028004444,0.007949729,0.07621465,0.19701232,0.20389871,0.0015051811,0.2367762,0.008921761,0.264921],"genre_scores_gemma":[0.05564376,0.007557105,0.04730372,0.029867876,0.04720532,0.0028451935,0.08194938,0.0062091835,0.7214185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979011,0.00042178438,0.0002100863,0.00038428797,0.0009142572,0.00016858467],"domain_scores_gemma":[0.9613153,0.010827918,0.00075887947,0.0036337771,0.02233279,0.0011313953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003946458,0.0012748658,0.0018775004,0.00516753,0.0019465366,0.002203026,0.0024355403,0.0026016147,0.70549226],"category_scores_gemma":[0.06836357,0.0005910295,0.0017376149,0.006265744,0.00057204225,0.0031824214,0.0023367961,0.0026056725,0.26733524],"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.000024675928,0.000018328747,0.0000785743,0.00007764342,0.000013299967,0.000041496394,0.00002085537,0.00008598367,0.00011316772,0.002757614,0.98852485,0.008243419],"study_design_scores_gemma":[0.00029124183,0.00004511984,0.003514542,0.00031504687,0.000107074266,0.00039978806,0.00016970238,0.0024283363,0.001275808,0.04938387,0.9418917,0.0001778308],"about_ca_topic_score_codex":0.025858844,"about_ca_topic_score_gemma":0.0282762,"teacher_disagreement_score":0.70549226,"about_ca_system_score_codex":0.0034048655,"about_ca_system_score_gemma":0.0024322926,"threshold_uncertainty_score":0.42007953},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028004444,0.007949729,0.07621465,0.19701232,0.20389871,0.0015051811,0.2367762,0.008921761,0.264921],"genre_scores_gemma":[0.05564376,0.007557105,0.04730372,0.029867876,0.04720532,0.0028451935,0.08194938,0.0062091835,0.7214185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979011,0.00042178438,0.0002100863,0.00038428797,0.0009142572,0.00016858467],"domain_scores_gemma":[0.9613153,0.010827918,0.00075887947,0.0036337771,0.02233279,0.0011313953],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003946458,0.0012748658,0.0018775004,0.00516753,0.0019465366,0.002203026,0.0024355403,0.0026016147,0.70549226],"category_scores_gemma":[0.06836357,0.0005910295,0.0017376149,0.006265744,0.00057204225,0.0031824214,0.0023367961,0.0026056725,0.26733524],"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.000024675928,0.000018328747,0.0000785743,0.00007764342,0.000013299967,0.000041496394,0.00002085537,0.00008598367,0.00011316772,0.002757614,0.98852485,0.008243419],"study_design_scores_gemma":[0.00029124183,0.00004511984,0.003514542,0.00031504687,0.000107074266,0.00039978806,0.00016970238,0.0024283363,0.001275808,0.04938387,0.9418917,0.0001778308],"about_ca_topic_score_codex":0.025858844,"about_ca_topic_score_gemma":0.0282762,"teacher_disagreement_score":0.9960535,"about_ca_system_score_codex":0.0034048655,"about_ca_system_score_gemma":0.0024322926,"threshold_uncertainty_score":0.42007953},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16393596,0.0013815801,0.35017863,0.030430237,0.0011514152,0.00045021035,0.00045139305,0.00047869782,0.4515419],"genre_scores_gemma":[0.9290537,0.00037811673,0.014084136,0.0013682803,0.00047478004,0.00026324074,0.000082220926,0.000071415845,0.054224122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492645,0.0027823693,0.00016425508,0.0006969848,0.00093895785,0.00049098104],"domain_scores_gemma":[0.97541237,0.019521609,0.0010345491,0.002456187,0.0009888258,0.00058646925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046814694,0.0009507055,0.0014713696,0.0009724555,0.0009851641,0.003596453,0.0013385065,0.0049797525,0.019467562],"category_scores_gemma":[0.0413538,0.0008550688,0.0007463593,0.000907372,0.0020002364,0.0047140406,0.00232719,0.0051817675,0.0032735828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017187161,0.00014621165,0.00035275216,0.00017691913,0.000057611138,0.000120047414,0.00024836976,0.0056276843,0.000764419,0.9651779,0.0066784346,0.020477835],"study_design_scores_gemma":[0.00007550078,0.000040788465,0.00022088361,0.000021621929,0.000020466996,0.00008903524,0.000046597124,0.02678753,0.00020971139,0.97071123,0.0017652253,0.000011475493],"about_ca_topic_score_codex":0.0005760761,"about_ca_topic_score_gemma":0.00035179476,"teacher_disagreement_score":0.019467562,"about_ca_system_score_codex":0.001117163,"about_ca_system_score_gemma":0.0010673917,"threshold_uncertainty_score":0.065125465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3509786,0.00042923348,0.63375986,0.0043220106,0.00012795854,0.00015766782,0.0002092667,0.00029334894,0.009722127],"genre_scores_gemma":[0.97965646,0.00020457785,0.014982832,0.00022292716,0.000079836675,0.000077639816,0.00004158527,0.000030021956,0.004704054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971879,0.0017052949,0.00009893916,0.00037568389,0.00030734562,0.00032496513],"domain_scores_gemma":[0.8866966,0.09941524,0.0045298776,0.003459324,0.0039754654,0.0019235351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009259028,0.00053720677,0.0018323794,0.0011297324,0.0012291488,0.0024514883,0.0027437443,0.0031778323,0.004043301],"category_scores_gemma":[0.06335508,0.00069744297,0.0006630692,0.0008477996,0.0041831755,0.0052078483,0.003161947,0.002107641,0.00036598774],"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.00036248763,0.00012517875,0.0019657833,0.00016219476,0.00007372815,0.0001948588,0.00025847313,0.43088844,0.0013003484,0.54474497,0.0021057741,0.017817799],"study_design_scores_gemma":[0.00003910881,0.000043542157,0.00022500074,0.000013560859,0.000010791592,0.00002954775,0.00002848998,0.7692854,0.00031420437,0.22976638,0.00023011077,0.000013785527],"about_ca_topic_score_codex":0.00244232,"about_ca_topic_score_gemma":0.0014704677,"teacher_disagreement_score":0.009259028,"about_ca_system_score_codex":0.0023370073,"about_ca_system_score_gemma":0.0015564398,"threshold_uncertainty_score":0.048967004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.163411,0.0011993396,0.6493743,0.010514251,0.00024548575,0.0005534112,0.0036320984,0.00039036354,0.17067978],"genre_scores_gemma":[0.88580734,0.0012676296,0.05244583,0.0007953432,0.00025386317,0.00071339874,0.0015750363,0.00016772564,0.056973837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804986,0.0007642208,0.00008028332,0.0004347212,0.0002849585,0.00038600358],"domain_scores_gemma":[0.9980312,0.001064543,0.00032680327,0.00012270466,0.00019988976,0.00025487825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707505,0.0014976022,0.0013827896,0.0010478252,0.0015792879,0.0029099474,0.0023248387,0.0040396564,0.020631367],"category_scores_gemma":[0.005174536,0.0008624257,0.0011098238,0.0022964485,0.0019469536,0.0049783424,0.0038493595,0.0022310736,0.0012855754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020619581,0.00017168366,0.0018321639,0.00026869407,0.00011624953,0.00086239626,0.00027755598,0.40379125,0.00084087136,0.55585027,0.013215329,0.022567306],"study_design_scores_gemma":[0.00016132562,0.00013344143,0.00096831284,0.00010484131,0.00006807129,0.00065291004,0.00048410613,0.3505282,0.00084443536,0.6113032,0.03469318,0.000057989557],"about_ca_topic_score_codex":0.0043163965,"about_ca_topic_score_gemma":0.0030176865,"teacher_disagreement_score":0.020631367,"about_ca_system_score_codex":0.0024060614,"about_ca_system_score_gemma":0.0019156748,"threshold_uncertainty_score":0.06901884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6418357,0.0020354071,0.21617137,0.016277341,0.00023786961,0.0003823753,0.0003103242,0.00036291298,0.122386806],"genre_scores_gemma":[0.9896784,0.00034740954,0.0069915964,0.00014779727,0.00009350303,0.00009427702,0.00002421742,0.00003283655,0.0025899047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955721,0.0024782086,0.00017170634,0.0006690002,0.00066709216,0.00044185252],"domain_scores_gemma":[0.9778331,0.01419138,0.0035732337,0.0013771051,0.0011130304,0.0019122622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006156933,0.0006572138,0.0009631219,0.0022092843,0.0025721742,0.007250394,0.0016260876,0.002648171,0.0067123594],"category_scores_gemma":[0.032664347,0.0006493293,0.0007979289,0.0012909374,0.0067541935,0.010490665,0.003934843,0.0014606662,0.0006904043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018928199,0.00021802372,0.01368317,0.00023004014,0.00012142511,0.0009283432,0.005080502,0.024663141,0.002524694,0.9232852,0.0019418274,0.027134359],"study_design_scores_gemma":[0.00021916165,0.00018823206,0.005866231,0.00012875594,0.00013014107,0.0003241246,0.0031407608,0.11972564,0.0012320481,0.8521604,0.01678498,0.000099471545],"about_ca_topic_score_codex":0.0031128074,"about_ca_topic_score_gemma":0.0014238518,"teacher_disagreement_score":0.007250394,"about_ca_system_score_codex":0.001806582,"about_ca_system_score_gemma":0.0017267426,"threshold_uncertainty_score":0.03256136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06328214,0.00022493232,0.92734796,0.000838332,0.00006605232,0.00030175087,0.000055635162,0.00020134305,0.007681834],"genre_scores_gemma":[0.6985485,0.0002689044,0.29281968,0.00014816163,0.00005491645,0.0006236677,0.0000600911,0.000031016523,0.007445131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976877,0.0012054091,0.00011765782,0.00038928248,0.0003700314,0.00022996114],"domain_scores_gemma":[0.9922083,0.0035949317,0.0015432042,0.0012102358,0.00065959705,0.0007836813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004214233,0.0006305595,0.00072894775,0.0010003224,0.0017229583,0.0020005086,0.0033647588,0.0020736007,0.004282761],"category_scores_gemma":[0.008418978,0.0004660973,0.0010359342,0.000888788,0.0025830949,0.0035763734,0.0028827458,0.0013552475,0.0006207905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025293892,0.00035171522,0.0018959044,0.00022378906,0.00026895784,0.0004516718,0.0008277255,0.12609577,0.012226646,0.8011074,0.0027367196,0.053560715],"study_design_scores_gemma":[0.00038884624,0.0007662074,0.0012721011,0.00008554067,0.0001668113,0.0006912924,0.00041942598,0.5636085,0.007587374,0.40741074,0.017474584,0.00012856883],"about_ca_topic_score_codex":0.0012139931,"about_ca_topic_score_gemma":0.0011913407,"teacher_disagreement_score":0.004282761,"about_ca_system_score_codex":0.0011611604,"about_ca_system_score_gemma":0.0015343546,"threshold_uncertainty_score":0.02228725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031781406,0.0005935968,0.97996336,0.0006400299,0.0000790123,0.00007920181,0.00005568719,0.00004702982,0.015363889],"genre_scores_gemma":[0.45048985,0.0040273652,0.50418276,0.00055825786,0.000557975,0.00087233714,0.00018674847,0.00020653714,0.038918164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989536,0.00059907086,0.000030080013,0.000095326075,0.00022362983,0.00009817455],"domain_scores_gemma":[0.99907506,0.00070362136,0.00004626471,0.000031031464,0.00008693765,0.000057142646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013555875,0.0016924983,0.0016946574,0.0007287355,0.00068050117,0.002466068,0.0027852948,0.0022195787,0.0063720387],"category_scores_gemma":[0.0031052022,0.0010602928,0.0013250761,0.001582101,0.0017298105,0.0025004689,0.0015611686,0.0032450042,0.00050566474],"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.00002217136,0.00005089319,0.000059312028,0.000080834536,0.00003700279,0.000053389915,0.00007390721,0.65868556,0.0004353099,0.32499525,0.0024225584,0.013083837],"study_design_scores_gemma":[0.000017250743,0.000025724203,0.00003340599,0.000021494587,0.000012635195,0.00001986361,0.000022080498,0.7830786,0.000103222534,0.21391319,0.0027426528,0.000009868363],"about_ca_topic_score_codex":0.005692764,"about_ca_topic_score_gemma":0.0061717522,"teacher_disagreement_score":0.0063720387,"about_ca_system_score_codex":0.0020333536,"about_ca_system_score_gemma":0.0020786617,"threshold_uncertainty_score":0.021316588},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075335696,0.49707866,0.004239377,0.41993082,0.03225871,0.00003735821,0.00026011493,0.00007262496,0.045368996],"genre_scores_gemma":[0.064733565,0.51979864,0.009819442,0.11086496,0.1245143,0.0003216626,0.0005756447,0.000338062,0.1690337],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972681,0.0010923673,0.00014690838,0.00052081066,0.00083792576,0.00013387876],"domain_scores_gemma":[0.98841697,0.007642903,0.00038826556,0.00043186848,0.0026271942,0.0004927979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005055727,0.0012641925,0.0013863386,0.0015693242,0.0017479714,0.004655923,0.0010465393,0.0031184412,0.0125343995],"category_scores_gemma":[0.020884069,0.00061149267,0.00082969986,0.0031050309,0.004841946,0.0063753007,0.0017722144,0.007895965,0.0066427584],"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.000020027426,0.00002627514,0.00012939147,0.00023255727,0.0000133054755,0.000034507004,0.0004400686,0.00016923131,0.000057846588,0.044475418,0.9123193,0.04208214],"study_design_scores_gemma":[0.000014214087,0.000020341118,0.0008797598,0.00094889855,0.000009815267,0.00009198031,0.0006104606,0.00021046253,0.000052338626,0.086337745,0.910796,0.000028013459],"about_ca_topic_score_codex":0.0048408704,"about_ca_topic_score_gemma":0.0028857286,"teacher_disagreement_score":0.0125343995,"about_ca_system_score_codex":0.004954072,"about_ca_system_score_gemma":0.0030148318,"threshold_uncertainty_score":0.04193175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71951187,0.0018004433,0.18391313,0.0012707649,0.00016926475,0.00017798138,0.0014215871,0.00024892198,0.09148604],"genre_scores_gemma":[0.9768753,0.0004942533,0.013453475,0.0001423233,0.00008523602,0.00006293325,0.0006066172,0.000028137758,0.008251764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.00026576864,0.000035588386,0.00016673048,0.00012566838,0.0001811811],"domain_scores_gemma":[0.995852,0.002285226,0.0007079728,0.0003940128,0.00029461127,0.0004660798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006195779,0.00043391992,0.00061500043,0.0009408094,0.00080820645,0.0030989852,0.001120594,0.00079925754,0.0077409567],"category_scores_gemma":[0.005599873,0.00033590014,0.00049398345,0.0011370128,0.0012499886,0.0030405803,0.0011421313,0.000890701,0.0003993983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047206643,0.00012293573,0.0056026834,0.00021926138,0.00010457288,0.00051833456,0.00057715806,0.031154621,0.0034015814,0.88641596,0.008266883,0.06314397],"study_design_scores_gemma":[0.00011461463,0.00007775506,0.0042680986,0.000055613993,0.00006753505,0.0007600854,0.00038330606,0.07367427,0.0009673096,0.90556186,0.014038696,0.000030929416],"about_ca_topic_score_codex":0.0019630857,"about_ca_topic_score_gemma":0.0023392653,"teacher_disagreement_score":0.0077409567,"about_ca_system_score_codex":0.00090626907,"about_ca_system_score_gemma":0.00047240322,"threshold_uncertainty_score":0.025896013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027478167,0.19135949,0.2664629,0.017192207,0.02716409,0.00047455038,0.0064923163,0.002723704,0.4853829],"genre_scores_gemma":[0.011422744,0.08713869,0.053315904,0.0013045911,0.0024403927,0.00019655164,0.004039724,0.0012306082,0.8389108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993517,0.00008862642,0.000028348892,0.00011676785,0.0003663646,0.00004828513],"domain_scores_gemma":[0.9990355,0.00030311206,0.000024458002,0.00007801924,0.00045897064,0.00009997158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011756098,0.0017053775,0.0015794383,0.0019133823,0.0008288674,0.0045143054,0.0014174073,0.0011245951,0.065420926],"category_scores_gemma":[0.00260195,0.0007629079,0.00052741956,0.0031555058,0.0010177182,0.002661662,0.00094346184,0.0020764186,0.021984672],"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.000023520062,0.000030451742,0.000080570084,0.0003099789,0.000016026217,0.00003337065,0.000073844436,0.0027268664,0.00048364836,0.030076956,0.8131625,0.15298228],"study_design_scores_gemma":[0.000015297883,0.00002439604,0.00046012635,0.00033114344,0.000016356997,0.0001253897,0.00007632496,0.006191181,0.00044719357,0.036274716,0.9560159,0.00002198532],"about_ca_topic_score_codex":0.04556714,"about_ca_topic_score_gemma":0.11089026,"teacher_disagreement_score":0.065420926,"about_ca_system_score_codex":0.004683387,"about_ca_system_score_gemma":0.003923742,"threshold_uncertainty_score":0.21885478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006241401,0.005130158,0.74037594,0.004961238,0.00077312434,0.00011639751,0.00017507463,0.00010243968,0.24212417],"genre_scores_gemma":[0.49634308,0.016314592,0.32210597,0.0016030982,0.0022106473,0.0013697224,0.0004620325,0.00042423705,0.15916659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975435,0.0011690396,0.00010593122,0.00035273383,0.000593917,0.00023487418],"domain_scores_gemma":[0.99746007,0.0019181588,0.00014280733,0.00018564866,0.00017149663,0.00012194147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029066438,0.0011307644,0.0014203016,0.0008564954,0.0015531909,0.005113489,0.0025933415,0.003100454,0.012925052],"category_scores_gemma":[0.0055234265,0.00076598616,0.0014635852,0.0023400255,0.004187876,0.0066236584,0.0024817088,0.0052732937,0.0019439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049082464,0.000010950061,0.000017452316,0.000039808943,0.000006462588,0.000011383915,0.000054519587,0.0059981905,0.000060087074,0.9845146,0.0026373947,0.006644304],"study_design_scores_gemma":[0.0000041808717,0.0000039215024,0.000014068494,0.000025995561,0.0000022718873,0.000009241182,0.000028416945,0.009422914,0.00004113054,0.98455286,0.0058903014,0.0000046662267],"about_ca_topic_score_codex":0.0022667495,"about_ca_topic_score_gemma":0.0016400284,"teacher_disagreement_score":0.012925052,"about_ca_system_score_codex":0.0032484885,"about_ca_system_score_gemma":0.0025831738,"threshold_uncertainty_score":0.04323864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006359092,0.000059573635,0.00012244811,0.00013398663,0.000025829639,0.00001869747,0.997629,0.00040415165,0.0009703988],"genre_scores_gemma":[0.0018099652,0.00007177066,0.00074101286,0.000074662064,0.000011405812,0.00013892938,0.9959288,0.000071842216,0.0011515454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988142,0.00027216738,0.0001353006,0.0002667752,0.00030210312,0.00020952309],"domain_scores_gemma":[0.9964958,0.0013598539,0.00030728578,0.00087065756,0.0006708552,0.00029554684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013663521,0.0015228797,0.00095302355,0.0037478392,0.0009417296,0.002210465,0.002150012,0.0019169371,0.08842791],"category_scores_gemma":[0.008604542,0.0004994446,0.0013853962,0.0064887092,0.0004451851,0.0014499935,0.0017695129,0.001488843,0.0658006],"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.000084755295,0.00005540489,0.0019139879,0.00042168557,0.000026916136,0.000017012242,0.000027222639,0.0006326014,0.000054828804,0.00084349257,0.991738,0.0041841595],"study_design_scores_gemma":[0.0007186036,0.00008863459,0.016995655,0.0005432422,0.00006616782,0.00013731844,0.0003870981,0.0034842433,0.000913626,0.0076243505,0.9689686,0.00007249421],"about_ca_topic_score_codex":0.019472761,"about_ca_topic_score_gemma":0.037688684,"teacher_disagreement_score":0.08842791,"about_ca_system_score_codex":0.0014424092,"about_ca_system_score_gemma":0.0017757888,"threshold_uncertainty_score":0.29582077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005827352,0.000032329037,0.00006451312,0.000045223303,0.000014756325,0.000006438358,0.99848264,0.0005622032,0.0007336251],"genre_scores_gemma":[0.00022952323,0.000041013533,0.00027364437,0.000053447162,0.0000043739383,0.000049579736,0.9986161,0.00016526562,0.0005670511],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990416,0.00012864551,0.0001208801,0.00034947126,0.00020126317,0.00015806807],"domain_scores_gemma":[0.9979367,0.000576408,0.00017165094,0.0005714745,0.00052686885,0.00021683487],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008712594,0.0017307822,0.0014563474,0.0041833324,0.00090654846,0.0025881063,0.0026793529,0.0018986949,0.1429823],"category_scores_gemma":[0.0058480417,0.00077248446,0.0012844029,0.008066283,0.00039684767,0.002095858,0.0023027929,0.0018396588,0.20978746],"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.000034037937,0.000012467069,0.0005612951,0.0005518083,0.00001778678,0.00001855095,0.000024606292,0.0001953461,0.00011852329,0.00046419128,0.9959632,0.0020381417],"study_design_scores_gemma":[0.00007329948,0.000008738743,0.0019820742,0.00017895298,0.000014796632,0.00003853942,0.00008285073,0.00027350328,0.00019223714,0.0010549104,0.9960824,0.000017611363],"about_ca_topic_score_codex":0.019137185,"about_ca_topic_score_gemma":0.031124717,"teacher_disagreement_score":0.8570177,"about_ca_system_score_codex":0.0014280702,"about_ca_system_score_gemma":0.002169634,"threshold_uncertainty_score":0.47832346},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06987068,0.0076937666,0.02560285,0.11479565,0.0005142046,0.0002499131,0.0004029689,0.00023816692,0.78063166],"genre_scores_gemma":[0.93615407,0.0065407543,0.016938936,0.00403649,0.00009021004,0.00011739201,0.0002715185,0.00009916302,0.035751544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9952238,0.0018260137,0.00007347542,0.0003070628,0.0018428318,0.00072681485],"domain_scores_gemma":[0.99592775,0.0014605579,0.00016541989,0.00022579254,0.0013571165,0.0008633613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005426526,0.0006085259,0.00029617277,0.0022403554,0.010474877,0.011486586,0.0016376138,0.001976786,0.010039072],"category_scores_gemma":[0.009913787,0.0003211373,0.00041108814,0.0036901047,0.014155707,0.0035442142,0.0054149963,0.003036738,0.00072300143],"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.00006736328,0.000055139568,0.0029882172,0.00015479058,0.000018434213,0.00019364404,0.014980237,0.0028775774,0.00030730752,0.846631,0.03362188,0.0981044],"study_design_scores_gemma":[0.00004703172,0.000044078308,0.008003598,0.0004202455,0.00002233848,0.00012004968,0.019445851,0.0147913415,0.0006476151,0.29455963,0.66176456,0.00013364185],"about_ca_topic_score_codex":0.939317,"about_ca_topic_score_gemma":0.95505685,"teacher_disagreement_score":0.10857237,"about_ca_system_score_codex":0.10857237,"about_ca_system_score_gemma":0.086091205,"threshold_uncertainty_score":0.7877514},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24710421,0.0118229985,0.0028310132,0.0016651767,0.0016224608,0.00029556325,0.007950289,0.00056578056,0.7261425],"genre_scores_gemma":[0.7626556,0.004920821,0.0078072124,0.0009801169,0.00045838256,0.00017813747,0.006351085,0.00015298919,0.21649556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99989855,0.000009126254,0.000004772364,0.000030751093,0.000026675616,0.000030057145],"domain_scores_gemma":[0.99980885,0.000024625004,0.00003128994,0.000013984962,0.000035673762,0.00008559078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014920894,0.00035853387,0.00013816434,0.00060240354,0.0009908798,0.0005090315,0.00031096485,0.00036071468,0.061408017],"category_scores_gemma":[0.00033588381,0.000108131295,0.00012073274,0.00027743253,0.00025568737,0.00026648017,0.0008577753,0.00034196713,0.015048932],"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.0010454679,0.00013350573,0.051700268,0.0013535748,0.00005001864,0.004188735,0.0010830391,0.00035907832,0.015632326,0.011959488,0.11437015,0.7981243],"study_design_scores_gemma":[0.000036426085,0.00008729276,0.060750693,0.00017663716,0.000016102971,0.0071012657,0.00057527656,0.00018177279,0.0028183246,0.00091643183,0.92732346,0.000016277752],"about_ca_topic_score_codex":0.005702229,"about_ca_topic_score_gemma":0.012256702,"teacher_disagreement_score":0.061408017,"about_ca_system_score_codex":0.0004176823,"about_ca_system_score_gemma":0.00077387295,"threshold_uncertainty_score":0.20543027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65486,0.0008691624,0.27399707,0.0047657317,0.00011472582,0.00014873523,0.00027094732,0.00008644827,0.06488718],"genre_scores_gemma":[0.96478504,0.00027713276,0.022301331,0.00025881352,0.00007151596,0.000080213395,0.00007107639,0.00006562667,0.012089308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998044,0.0012752052,0.000039776598,0.00018200299,0.00022822084,0.00023084036],"domain_scores_gemma":[0.9826224,0.014480816,0.0009786014,0.00064244535,0.00056920573,0.0007066714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043056244,0.00064278074,0.0017827792,0.0012731059,0.0012419157,0.0034944639,0.00276461,0.0031278296,0.012997788],"category_scores_gemma":[0.028428065,0.0008279632,0.001423473,0.0011525649,0.0034363433,0.0056326417,0.002538911,0.0033560952,0.0005383193],"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.00020475884,0.00017776867,0.002164881,0.00014456238,0.00013317725,0.00025131542,0.0005705026,0.19099098,0.0015191525,0.7893977,0.0017153708,0.012729769],"study_design_scores_gemma":[0.000084653286,0.00008990265,0.0021364733,0.00003121678,0.00004775755,0.00013475717,0.0001766417,0.44773352,0.00016590914,0.5483515,0.0009951483,0.00005245291],"about_ca_topic_score_codex":0.0044529117,"about_ca_topic_score_gemma":0.0035427879,"teacher_disagreement_score":0.012997788,"about_ca_system_score_codex":0.002348204,"about_ca_system_score_gemma":0.0013609882,"threshold_uncertainty_score":0.043481886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017470425,0.02248607,0.5753084,0.020709855,0.0010132028,0.00011644033,0.00066756184,0.00028325064,0.36194488],"genre_scores_gemma":[0.63950205,0.027983857,0.2235774,0.0029798595,0.0027271681,0.0004930487,0.0012070711,0.00029258238,0.10123699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871194,0.0007162031,0.00004467359,0.00015706068,0.00024633587,0.00012381667],"domain_scores_gemma":[0.9972926,0.0020167937,0.00010974444,0.0002250015,0.00021833698,0.00013746394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015266998,0.00077423657,0.00072509213,0.0014174586,0.0011888575,0.0031713364,0.0014036682,0.0012164899,0.01446054],"category_scores_gemma":[0.0045168046,0.00045633133,0.00094666064,0.0024311405,0.0030067146,0.0026135487,0.0019219365,0.0040632896,0.0015284627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004302007,0.000019632775,0.0001344826,0.00004957526,0.00001670277,0.000016206242,0.000063985295,0.008506998,0.000040065912,0.9738522,0.008126533,0.009169334],"study_design_scores_gemma":[0.0000045792144,0.0000038962407,0.00007920626,0.000028621975,0.0000036001259,0.000010718327,0.00004204611,0.012604249,0.000018683542,0.9734225,0.013779206,0.0000026552525],"about_ca_topic_score_codex":0.0037084525,"about_ca_topic_score_gemma":0.0049702823,"teacher_disagreement_score":0.01446054,"about_ca_system_score_codex":0.003392752,"about_ca_system_score_gemma":0.0020546673,"threshold_uncertainty_score":0.04837531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31162497,0.00045372045,0.6448765,0.0035613861,0.00017608759,0.000483613,0.0012952132,0.00031728702,0.037211217],"genre_scores_gemma":[0.94263345,0.0002841212,0.042257033,0.00024795652,0.00009187858,0.000451337,0.00035587518,0.00004287981,0.013635464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968195,0.0017318622,0.000090794325,0.0005622388,0.00041033304,0.0003852811],"domain_scores_gemma":[0.9951633,0.0029262234,0.00075107,0.00041203503,0.00020832923,0.00053903286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027585025,0.0017147199,0.001692276,0.0008029355,0.0010106623,0.0028054963,0.002987207,0.0034554931,0.0062632835],"category_scores_gemma":[0.0075324406,0.00055859494,0.0009284185,0.0013694305,0.002269134,0.0036256763,0.0026323912,0.0019688508,0.00084377965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007705186,0.00035785182,0.0026826195,0.00022803743,0.0002088735,0.0015041488,0.00093665667,0.39548045,0.0029085171,0.57384545,0.0033969753,0.017679812],"study_design_scores_gemma":[0.00030926347,0.00027642865,0.00059415057,0.000031645297,0.00006630309,0.00021574467,0.00023522027,0.6909518,0.00056160556,0.2999043,0.0068025505,0.0000509747],"about_ca_topic_score_codex":0.0028427679,"about_ca_topic_score_gemma":0.0019263908,"teacher_disagreement_score":0.0062632835,"about_ca_system_score_codex":0.0019316257,"about_ca_system_score_gemma":0.0012179438,"threshold_uncertainty_score":0.020952761},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34613946,0.00043573242,0.58177286,0.0031356043,0.0000735354,0.00024954855,0.00039077058,0.00062220055,0.06718019],"genre_scores_gemma":[0.9763575,0.00015734024,0.01873686,0.00019596909,0.000043212036,0.00016445848,0.00007867279,0.000052118092,0.00421398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959046,0.0015880063,0.00024339222,0.0008758875,0.0008328616,0.00055534317],"domain_scores_gemma":[0.9844163,0.0091472585,0.002355029,0.0024769823,0.0010999764,0.0005045219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004598783,0.0007051982,0.0012597211,0.0012533051,0.0011401317,0.0030350883,0.0018584233,0.0023609956,0.0042705615],"category_scores_gemma":[0.033948734,0.00048151176,0.0013355986,0.0010217441,0.0030199299,0.0044274866,0.0036136468,0.002378592,0.0007980117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002250013,0.00006597178,0.0022620982,0.00013671482,0.000084642415,0.00033310644,0.0006195481,0.0709099,0.0062987553,0.90150046,0.0019843525,0.015579374],"study_design_scores_gemma":[0.00007447767,0.000053955642,0.0006142692,0.000031429663,0.000022524513,0.00015388292,0.00010536493,0.16725245,0.0022883655,0.82758945,0.0017873457,0.000026425878],"about_ca_topic_score_codex":0.0011739401,"about_ca_topic_score_gemma":0.0005013124,"teacher_disagreement_score":0.004598783,"about_ca_system_score_codex":0.0020795441,"about_ca_system_score_gemma":0.0009976722,"threshold_uncertainty_score":0.02432096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05126687,0.0011816694,0.89965,0.0015438707,0.00040998406,0.00020467138,0.00029699985,0.00041206062,0.04503399],"genre_scores_gemma":[0.91448265,0.00054490624,0.059499495,0.00020000094,0.00021216618,0.00025701727,0.00016969554,0.00009311292,0.02454103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.00041420778,0.00003289667,0.00019308153,0.0002734904,0.00023503299],"domain_scores_gemma":[0.996849,0.00211097,0.00016538528,0.00030255254,0.0003588103,0.00021331856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483856,0.000902881,0.0016417283,0.0005901491,0.0008844471,0.0022206753,0.0013454721,0.0011165858,0.0080675],"category_scores_gemma":[0.0057587335,0.0004242953,0.00034130336,0.0014344088,0.00091123045,0.0014204397,0.0017493814,0.0010106002,0.00078025484],"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.0005316454,0.00013443844,0.00028613253,0.00015971539,0.00006640667,0.00022588746,0.00008315532,0.7883342,0.0031454652,0.12278367,0.010327029,0.07392222],"study_design_scores_gemma":[0.000065809225,0.000027325425,0.00011250866,0.000008708454,0.000014944137,0.000043349897,0.000022652943,0.942539,0.00066590396,0.054057438,0.0024334537,0.000008905358],"about_ca_topic_score_codex":0.0030272305,"about_ca_topic_score_gemma":0.0036020777,"teacher_disagreement_score":0.0080675,"about_ca_system_score_codex":0.0015830819,"about_ca_system_score_gemma":0.0013659748,"threshold_uncertainty_score":0.026988447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.761567,0.0005663142,0.19574197,0.0032835228,0.0001532813,0.00027035782,0.00045481024,0.000643191,0.03731965],"genre_scores_gemma":[0.9851703,0.00009127894,0.011678161,0.00021010169,0.000021634463,0.00019646501,0.000094801806,0.00002509321,0.0025122438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932979,0.004874292,0.00015795174,0.0007801012,0.0004133167,0.00047644606],"domain_scores_gemma":[0.9563701,0.032074966,0.003644279,0.005425785,0.000967509,0.001517392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008149135,0.00055145804,0.0011373195,0.00057809014,0.0009332049,0.0024731583,0.0014941684,0.001505785,0.011824386],"category_scores_gemma":[0.039823357,0.0003222346,0.0005859941,0.0006637862,0.0022491983,0.0029011308,0.0019931528,0.001842726,0.0012677406],"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.0042894934,0.002065604,0.023263542,0.0003966637,0.0004731975,0.00046654325,0.0011434797,0.23806685,0.006528877,0.64339983,0.008266232,0.071639635],"study_design_scores_gemma":[0.0010174119,0.0015318041,0.0042896825,0.00008285993,0.00008413613,0.00019124319,0.0007030611,0.5624096,0.0031479595,0.4176641,0.008788831,0.00008922],"about_ca_topic_score_codex":0.0028770592,"about_ca_topic_score_gemma":0.0022508479,"teacher_disagreement_score":0.011824386,"about_ca_system_score_codex":0.0015272812,"about_ca_system_score_gemma":0.001222111,"threshold_uncertainty_score":0.043097258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3614829,0.05093043,0.008894364,0.18194057,0.00055833725,0.00011355487,0.0006260196,0.000063657695,0.39539015],"genre_scores_gemma":[0.93333566,0.020826342,0.003974366,0.0046189716,0.000073453586,0.00006316173,0.00009197772,0.00005311573,0.03696297],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99830997,0.001095962,0.000035436904,0.000121258905,0.0002560288,0.0001814052],"domain_scores_gemma":[0.99448276,0.0039542546,0.00029207568,0.00019776139,0.0005984676,0.0004747466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035750177,0.00032398058,0.00034870082,0.0019813757,0.0097923195,0.01246798,0.0018085988,0.0021899408,0.0057912483],"category_scores_gemma":[0.009532173,0.00028055315,0.00015048817,0.0045895963,0.029447377,0.008641265,0.0050338656,0.003172704,0.00026933942],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.0000530589,0.0000820897,0.0055537918,0.00034289842,0.000012547392,0.00042563234,0.49231735,0.0005893471,0.0001688334,0.38531426,0.021834752,0.09330549],"study_design_scores_gemma":[0.00001033223,0.000017312537,0.008005719,0.00093582575,0.000014612834,0.00014667668,0.73883575,0.0007522086,0.00017111389,0.11181924,0.13925242,0.00003880231],"about_ca_topic_score_codex":0.66073954,"about_ca_topic_score_gemma":0.8246684,"teacher_disagreement_score":0.33926046,"about_ca_system_score_codex":0.021213287,"about_ca_system_score_gemma":0.023658087,"threshold_uncertainty_score":0.6825168},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042155673,0.0036009857,0.0002596653,0.0045036864,0.0010368406,0.000052778607,0.0032359983,0.00012694094,0.98676157],"genre_scores_gemma":[0.0019766376,0.0007244593,0.00010797228,0.0021613997,0.00015443545,0.00005373289,0.00034615918,0.00004853135,0.9944266],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933547,0.00007921014,0.000043633372,0.00010117603,0.00028292486,0.00015754365],"domain_scores_gemma":[0.99954116,0.00011596327,0.000030280324,0.000032009033,0.00022930923,0.0000514162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809329,0.0013049708,0.00038995687,0.0012495023,0.005204855,0.003376643,0.0010691824,0.004936664,0.25282192],"category_scores_gemma":[0.002450601,0.00082975323,0.00039522088,0.0017802913,0.0012290798,0.0016734694,0.0015301483,0.0043989117,0.16181014],"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.00001210373,0.000009042385,0.000079416175,0.000034109533,0.0000011462384,0.000034277276,0.00016062993,0.000034005465,0.000035965128,0.023990486,0.965089,0.010519817],"study_design_scores_gemma":[0.0000044715725,0.0000038731905,0.0006221096,0.00007485009,0.0000011843811,0.00002679806,0.00009524469,0.000019999417,0.00003761987,0.0013185827,0.9977896,0.000005578938],"about_ca_topic_score_codex":0.20914516,"about_ca_topic_score_gemma":0.46703136,"teacher_disagreement_score":0.25282192,"about_ca_system_score_codex":0.004368907,"about_ca_system_score_gemma":0.0033766625,"threshold_uncertainty_score":0.8457736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881087,0.00012545707,0.0042641265,0.00013304064,0.000012584885,0.000027401727,0.0020615053,0.00008570896,0.0051814774],"genre_scores_gemma":[0.98968875,0.00012896382,0.006844741,0.000037489863,0.000013027827,0.000034510515,0.0014981551,0.000017505463,0.0017368755],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999493,0.00006679573,0.000010673616,0.00010832581,0.00022434587,0.000096801574],"domain_scores_gemma":[0.99908197,0.00021185081,0.0001988663,0.00006981716,0.00029157475,0.00014589024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004237076,0.0002507446,0.00022886078,0.0005586511,0.0008653723,0.00055394345,0.0004542129,0.00022675931,0.0016344907],"category_scores_gemma":[0.0015171553,0.00020105783,0.00018934695,0.0008021895,0.0003838026,0.0004541802,0.00063302135,0.0005070393,0.00014066348],"study_design_candidate":"bench_or_experimental","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.0012815867,0.00029917172,0.5723052,0.00021062714,0.0003091292,0.0011216816,0.0010284269,0.016840717,0.3314223,0.012630382,0.0071027474,0.055448074],"study_design_scores_gemma":[0.00008774065,0.00036386462,0.78623974,0.000021809235,0.00007324897,0.00034775643,0.00035890136,0.03492019,0.1612355,0.002075619,0.014163959,0.000111705944],"about_ca_topic_score_codex":0.064103656,"about_ca_topic_score_gemma":0.12708272,"teacher_disagreement_score":0.93589634,"about_ca_system_score_codex":0.0019875907,"about_ca_system_score_gemma":0.0010779015,"threshold_uncertainty_score":0.12746108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1427494,0.0073501607,0.41284692,0.017629571,0.0008305824,0.00026325576,0.0004446975,0.000088329034,0.41779712],"genre_scores_gemma":[0.8801858,0.0021771626,0.056360453,0.0011362705,0.00025125258,0.0002833081,0.0002834048,0.000056791127,0.05926557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999493,0.0002876625,0.000017061579,0.000059128488,0.00008077684,0.000062378436],"domain_scores_gemma":[0.99936324,0.00037347156,0.00008299997,0.00002816581,0.00006889988,0.00008326358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097145856,0.000497844,0.00047677325,0.0007110189,0.0010901776,0.0017399241,0.000759853,0.0015718378,0.009645707],"category_scores_gemma":[0.0033082077,0.00015401022,0.00056742626,0.0006015899,0.0013278244,0.002016767,0.0010346742,0.0012576141,0.00058684876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034676905,0.000036484536,0.0016786656,0.00008090065,0.000032175267,0.00031038813,0.00048682943,0.04861651,0.00045275566,0.9273485,0.0065957974,0.014326355],"study_design_scores_gemma":[0.000016583133,0.000041429437,0.0011288334,0.00006042515,0.000020255357,0.0002894916,0.0004339276,0.15820642,0.00016042213,0.8128125,0.026813207,0.00001649229],"about_ca_topic_score_codex":0.0023548948,"about_ca_topic_score_gemma":0.0021907622,"teacher_disagreement_score":0.009645707,"about_ca_system_score_codex":0.0013001553,"about_ca_system_score_gemma":0.0007483185,"threshold_uncertainty_score":0.032268107},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037100402,0.000008380909,0.00022914316,0.00006186302,0.000017267534,0.00003708093,0.9979309,0.00025764413,0.0010867383],"genre_scores_gemma":[0.018433461,0.000090496615,0.004640573,0.00041259,0.000066131564,0.0015861725,0.9597151,0.0010499444,0.014005448],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.999689,0.000056867357,0.000041931118,0.0000767051,0.00006334478,0.00007207585],"domain_scores_gemma":[0.9906399,0.007346212,0.0004325843,0.000398548,0.00085042755,0.00033231665],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009064931,0.00084237865,0.00093887385,0.002356828,0.00075055857,0.0013045184,0.0015570949,0.0010454814,0.9067546],"category_scores_gemma":[0.014144032,0.0006002586,0.00085382554,0.0030875923,0.00024919215,0.0014998177,0.0010135729,0.0006233274,0.17811945],"study_design_candidate":"observational","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.00013283199,0.00009813462,0.004153566,0.0012407792,0.000053894702,0.000050640156,0.00011226784,0.0010497143,0.00006390286,0.00087567506,0.9842876,0.007880926],"study_design_scores_gemma":[0.005607937,0.00037952707,0.09526813,0.0029954126,0.00032848713,0.00041765784,0.001586271,0.008243137,0.0007375101,0.023772066,0.8603977,0.00026620328],"about_ca_topic_score_codex":0.02160573,"about_ca_topic_score_gemma":0.044728644,"teacher_disagreement_score":0.97839427,"about_ca_system_score_codex":0.00095911615,"about_ca_system_score_gemma":0.001406535,"threshold_uncertainty_score":0.13300318},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014282397,0.051444303,0.010169721,0.20260409,0.005466849,0.00006283717,0.0009685806,0.00026987572,0.7147314],"genre_scores_gemma":[0.3825283,0.072458476,0.006290708,0.021690322,0.0035873197,0.00018334234,0.00075415,0.00022299944,0.51228434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993381,0.00020335268,0.000026732945,0.00015310508,0.00016419185,0.00011458197],"domain_scores_gemma":[0.9977284,0.001325636,0.00020455426,0.00012353995,0.00035879956,0.0002590083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009202847,0.00055530894,0.0008330136,0.0006528629,0.0015707801,0.005397748,0.0007806609,0.002764463,0.07791295],"category_scores_gemma":[0.0032891363,0.00023967109,0.00022349734,0.0011763732,0.0020370772,0.0031117585,0.0013235449,0.003646538,0.015289439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014744178,0.00007315999,0.0013978683,0.000246405,0.00002020722,0.00032053067,0.0001947559,0.0010611344,0.0001933522,0.698893,0.2216681,0.07578406],"study_design_scores_gemma":[0.000048265203,0.000044044566,0.0018093551,0.00032009586,0.00001693315,0.00020397725,0.00039373912,0.002362794,0.00023997165,0.33977187,0.65475696,0.000031969725],"about_ca_topic_score_codex":0.0038735874,"about_ca_topic_score_gemma":0.0040274765,"teacher_disagreement_score":0.07791295,"about_ca_system_score_codex":0.0038766393,"about_ca_system_score_gemma":0.0018836458,"threshold_uncertainty_score":0.2606448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12338022,0.0015501918,0.694837,0.019383473,0.000382707,0.00027635894,0.0012097495,0.00030870904,0.15867159],"genre_scores_gemma":[0.9433393,0.0012687135,0.020889271,0.0007561766,0.00032237972,0.00026480627,0.00014510077,0.00009697354,0.032917317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981534,0.0007949283,0.00007417757,0.0002969934,0.00032896723,0.0003515946],"domain_scores_gemma":[0.99200237,0.006125199,0.0006156431,0.0002454688,0.0004346806,0.00057660067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003837165,0.0011320432,0.0017655317,0.0011357226,0.0009777374,0.004268518,0.0022533059,0.004043562,0.0110778995],"category_scores_gemma":[0.013846604,0.0010489088,0.0011396458,0.0009257707,0.0028930218,0.0059547205,0.0018148818,0.0035255505,0.0007613472],"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.00013349297,0.000043129327,0.00030746736,0.00011376977,0.0000693046,0.00021161183,0.00012496773,0.19157924,0.00074483,0.79657674,0.0047997907,0.005295738],"study_design_scores_gemma":[0.000076040815,0.000055743058,0.00025423028,0.00005015285,0.00003586037,0.00010808754,0.0000721783,0.38065493,0.00025706497,0.6154375,0.002950901,0.000047299087],"about_ca_topic_score_codex":0.004221144,"about_ca_topic_score_gemma":0.0030105065,"teacher_disagreement_score":0.0110778995,"about_ca_system_score_codex":0.0040398003,"about_ca_system_score_gemma":0.0024199456,"threshold_uncertainty_score":0.037059307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7966356,0.0004389831,0.12299463,0.0020917244,0.000054129712,0.00019469636,0.00029704327,0.00009512,0.077198096],"genre_scores_gemma":[0.9832503,0.00018581528,0.00991401,0.00005952928,0.000013192993,0.000041538802,0.000061147584,0.000008705601,0.006465671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936193,0.00029110487,0.000022288272,0.00012994591,0.00008279849,0.000111898335],"domain_scores_gemma":[0.9970393,0.0014328837,0.00070647243,0.00018406742,0.00020185356,0.00043551743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015034662,0.00024293642,0.0003889945,0.00054899394,0.0013427723,0.0020908476,0.0009165363,0.001640019,0.009147351],"category_scores_gemma":[0.007015508,0.00033805307,0.00043110436,0.0005317767,0.0020344441,0.0035729238,0.0013635663,0.00076161826,0.00059583253],"study_design_candidate":"simulation_or_modeling","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.00074476487,0.0002496601,0.013304767,0.00015398859,0.00008259861,0.001269431,0.0013899994,0.15825167,0.0052631036,0.77111334,0.006284083,0.041892577],"study_design_scores_gemma":[0.0002586781,0.00022203053,0.00971761,0.0000560988,0.00007996374,0.0004632585,0.0014247718,0.61230576,0.002071692,0.3597608,0.0135753285,0.000063948726],"about_ca_topic_score_codex":0.006276605,"about_ca_topic_score_gemma":0.0060788733,"teacher_disagreement_score":0.9937234,"about_ca_system_score_codex":0.0018902636,"about_ca_system_score_gemma":0.0009222632,"threshold_uncertainty_score":0.030600905},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017945448,0.008666453,0.8717217,0.0067013814,0.0013454944,0.00021267027,0.0008061334,0.0029003273,0.08970048],"genre_scores_gemma":[0.22765003,0.0107359765,0.5858334,0.0012361972,0.0015585375,0.00058649434,0.0028704861,0.0025616114,0.16696727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804723,0.00048224055,0.00008271529,0.00061880675,0.0006162382,0.00015288078],"domain_scores_gemma":[0.996536,0.0021014146,0.0001091541,0.00038478273,0.00064513134,0.00022340925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017523717,0.0017141136,0.0024876,0.0020277847,0.001569611,0.0045280447,0.0021830301,0.0014259471,0.030580929],"category_scores_gemma":[0.009624158,0.0010480019,0.001347771,0.003119734,0.001503303,0.006432712,0.0032258264,0.004528112,0.016390711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021389278,0.00018319418,0.0008964547,0.00048609165,0.000059815902,0.00009533036,0.00027795086,0.018299168,0.002680148,0.7309464,0.052821923,0.1930397],"study_design_scores_gemma":[0.00008860772,0.0001076475,0.00062768406,0.0002682377,0.00006046712,0.00020310303,0.00015231298,0.092226356,0.006960274,0.7909834,0.10823094,0.0000910259],"about_ca_topic_score_codex":0.0035928104,"about_ca_topic_score_gemma":0.002928838,"teacher_disagreement_score":0.030580929,"about_ca_system_score_codex":0.0030187601,"about_ca_system_score_gemma":0.0014384126,"threshold_uncertainty_score":0.102303445},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00159116,0.0066863387,0.00044897507,0.00330213,0.0010901261,0.00006302649,0.0063338676,0.0003031559,0.98018116],"genre_scores_gemma":[0.0033736094,0.0020374777,0.00023123488,0.00037935266,0.000047639896,0.000020161538,0.001093531,0.00010534002,0.99271154],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991769,0.00007663189,0.000039795174,0.0002491638,0.0002786149,0.00017892712],"domain_scores_gemma":[0.9987312,0.0001550078,0.00007583018,0.00011789921,0.00054185715,0.00037818492],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003466275,0.0012809309,0.0008763628,0.0009893752,0.004996653,0.0058958097,0.00087512867,0.0019575078,0.80649287],"category_scores_gemma":[0.0013459936,0.00052164745,0.0005488976,0.0023411212,0.0010463973,0.001552201,0.0027774256,0.00181586,0.4293087],"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.00017729109,0.0000463763,0.0018406581,0.00076177664,0.000027322409,0.001458114,0.0009814226,0.00061547663,0.0013311892,0.019007966,0.8293151,0.14443731],"study_design_scores_gemma":[0.000009108298,0.0000127207095,0.0017138225,0.00015454389,0.000004159803,0.00010192453,0.00028254886,0.000058629776,0.00009920235,0.0006373115,0.99691737,0.0000086794535],"about_ca_topic_score_codex":0.17360692,"about_ca_topic_score_gemma":0.45007628,"teacher_disagreement_score":0.82639307,"about_ca_system_score_codex":0.0071450993,"about_ca_system_score_gemma":0.0075966753,"threshold_uncertainty_score":0.34519285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5084167,0.008090808,0.25437978,0.023764309,0.00038278627,0.00019447213,0.00092398573,0.00032846682,0.20351869],"genre_scores_gemma":[0.9812992,0.0013671332,0.007123698,0.0001403421,0.00007469901,0.000047384056,0.00012994894,0.000018298171,0.009799179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890447,0.00045944468,0.00003833892,0.00016242912,0.00016783325,0.00026748792],"domain_scores_gemma":[0.994985,0.0028515738,0.0008487816,0.000398915,0.00038756037,0.0005282083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028448163,0.0005420261,0.0007571876,0.00047848444,0.0010915638,0.0022359437,0.0009201772,0.0013279244,0.007183238],"category_scores_gemma":[0.008812534,0.00040024845,0.0004160477,0.00079971965,0.0029069257,0.0017420349,0.0015166431,0.0009102841,0.00042781697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004134371,0.000057448553,0.006463761,0.00021725378,0.00015446602,0.0003575157,0.0009022498,0.36775827,0.0011887084,0.5656708,0.021113977,0.03570207],"study_design_scores_gemma":[0.00032062765,0.00014760163,0.007074147,0.000106072934,0.00009578049,0.000109007575,0.00051712117,0.5819407,0.0011795019,0.37981457,0.028639887,0.000054958324],"about_ca_topic_score_codex":0.0743648,"about_ca_topic_score_gemma":0.072438404,"teacher_disagreement_score":0.0743648,"about_ca_system_score_codex":0.0072944555,"about_ca_system_score_gemma":0.0037216325,"threshold_uncertainty_score":0.14786386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20962158,0.0002550824,0.7840667,0.00040719818,0.000056408848,0.000120600016,0.00021853756,0.0005035271,0.004750398],"genre_scores_gemma":[0.8411463,0.00017909335,0.15469255,0.00009540127,0.000047168272,0.00013599764,0.00044614205,0.00014770728,0.0031096227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998599,0.00053368957,0.00007390333,0.0003033827,0.00028432815,0.00020574036],"domain_scores_gemma":[0.9910937,0.0071099414,0.0004372726,0.00051703455,0.0005212065,0.00032093856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002479808,0.0015147517,0.002072758,0.0019808316,0.0010172767,0.0034483303,0.0026211292,0.0016775259,0.006320016],"category_scores_gemma":[0.022437192,0.0010590144,0.00092934293,0.0016969532,0.001746802,0.005526185,0.0022687714,0.001918673,0.0005658495],"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.00034147818,0.00018892658,0.00180778,0.00013929485,0.00012209493,0.00006694782,0.00017133591,0.889561,0.00084291794,0.07448585,0.0010947767,0.031177552],"study_design_scores_gemma":[0.000013879387,0.000018492907,0.000064799286,0.0000056210365,0.000009013505,0.0000085080555,0.0000335461,0.93663687,0.00024082305,0.06285974,0.00010469165,0.000004062318],"about_ca_topic_score_codex":0.0074103056,"about_ca_topic_score_gemma":0.011630747,"teacher_disagreement_score":0.0074103056,"about_ca_system_score_codex":0.002341953,"about_ca_system_score_gemma":0.002028114,"threshold_uncertainty_score":0.021142602},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18735133,0.001093369,0.7903905,0.0023519131,0.00012627439,0.0001860865,0.00028121035,0.0004930945,0.017726205],"genre_scores_gemma":[0.9669561,0.00041724817,0.02664153,0.00022512478,0.00012353915,0.00012409709,0.00009653711,0.00009036671,0.0053254394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959461,0.0018770788,0.00013108639,0.0006672683,0.00060153054,0.00077688164],"domain_scores_gemma":[0.97680116,0.017744925,0.0020797106,0.0017318306,0.00072921655,0.0009132035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007392965,0.0015033274,0.0017340974,0.00059657806,0.0007856315,0.0023301612,0.002667429,0.002383093,0.0045604887],"category_scores_gemma":[0.025340578,0.00068615505,0.0013609767,0.0007246379,0.0031017694,0.003965765,0.0025565007,0.0035443893,0.00052797364],"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.00044887955,0.000137802,0.0010462239,0.00011778772,0.00008861777,0.00015685458,0.00011684959,0.9118779,0.00192239,0.075892225,0.0011688397,0.0070256973],"study_design_scores_gemma":[0.000029650453,0.00007851012,0.00017072164,0.000008620853,0.000013832495,0.000043614236,0.00002042681,0.9672387,0.00034556448,0.031808306,0.00023017582,0.000011924401],"about_ca_topic_score_codex":0.0023908347,"about_ca_topic_score_gemma":0.0010301999,"teacher_disagreement_score":0.007392965,"about_ca_system_score_codex":0.003026888,"about_ca_system_score_gemma":0.0017839117,"threshold_uncertainty_score":0.039098144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28189206,0.0008708114,0.47806656,0.010071496,0.0012952638,0.00026297796,0.0007485367,0.000840866,0.22595139],"genre_scores_gemma":[0.9366675,0.00023601908,0.022924226,0.0005918096,0.00012649863,0.0001095451,0.00014915293,0.00007782949,0.03911735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838877,0.0004483035,0.000086926004,0.00046854487,0.00036465764,0.00024286132],"domain_scores_gemma":[0.99662673,0.0009813133,0.0004855783,0.00092942774,0.0005159581,0.0004610548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015268705,0.0006754333,0.0010470654,0.00050561,0.0010542836,0.0034015845,0.0009248102,0.0026919332,0.022756707],"category_scores_gemma":[0.012246119,0.0006258028,0.00033461401,0.00061585684,0.0016172049,0.004165299,0.0026955712,0.002547228,0.004268131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003298127,0.00008286277,0.0017237546,0.00006953525,0.000052380845,0.00032429525,0.00031647208,0.031097842,0.003377691,0.93275726,0.0075473143,0.02232084],"study_design_scores_gemma":[0.00013478663,0.00018791997,0.0013947551,0.000038006572,0.000044440538,0.00033877924,0.00043242145,0.21137829,0.0027439643,0.7605322,0.02271997,0.000054360808],"about_ca_topic_score_codex":0.0009215723,"about_ca_topic_score_gemma":0.0006170589,"teacher_disagreement_score":0.022756707,"about_ca_system_score_codex":0.0011228085,"about_ca_system_score_gemma":0.0011153468,"threshold_uncertainty_score":0.07612872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52189183,0.0004903582,0.46115455,0.0017278511,0.000060255035,0.00015800972,0.00023382483,0.00018394475,0.014099332],"genre_scores_gemma":[0.98112744,0.00020894036,0.014251996,0.00007987149,0.000021748303,0.000095150084,0.00011776267,0.000056733108,0.004040407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863535,0.0007763259,0.00003733955,0.00022281171,0.00011961654,0.00020850296],"domain_scores_gemma":[0.9617076,0.032836594,0.002411669,0.0008640398,0.0009367219,0.0012433194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035989697,0.0011005438,0.0022492968,0.0020643717,0.0014655294,0.0032413,0.0027862445,0.0028031347,0.007750397],"category_scores_gemma":[0.03433084,0.0009872053,0.0016221412,0.0016330765,0.0038237115,0.0060093864,0.0029968696,0.00323103,0.0005566661],"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.00035775808,0.00017968767,0.0014305473,0.00020614738,0.00016884893,0.00031533,0.00067707285,0.64841187,0.0015959585,0.3398263,0.0011065509,0.0057240063],"study_design_scores_gemma":[0.00004058473,0.0000503354,0.00020030416,0.00001531569,0.000021069602,0.000019939987,0.0001491615,0.8547575,0.00018134601,0.14438014,0.00016410284,0.000020150997],"about_ca_topic_score_codex":0.008243485,"about_ca_topic_score_gemma":0.0056539457,"teacher_disagreement_score":0.008243485,"about_ca_system_score_codex":0.0019772067,"about_ca_system_score_gemma":0.0016081701,"threshold_uncertainty_score":0.025927663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11204671,0.0006851512,0.86617976,0.0019054533,0.00015167662,0.000105479055,0.00015354974,0.00022604925,0.018546142],"genre_scores_gemma":[0.97675055,0.00038117453,0.01473659,0.00039238643,0.00008135473,0.00015871423,0.000080536156,0.00008602972,0.0073327054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985745,0.00078265206,0.000032717442,0.00014233292,0.00025260763,0.00021513163],"domain_scores_gemma":[0.99491656,0.0036881275,0.0004621479,0.00015450032,0.00044908677,0.00032964186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027957908,0.001227222,0.001337078,0.001040259,0.00071214535,0.0014397852,0.0012888163,0.0015865699,0.003395431],"category_scores_gemma":[0.01123088,0.00045868746,0.0008269606,0.0005182449,0.002725015,0.0023358704,0.0018082759,0.0016638364,0.00026569373],"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.00013806892,0.000053521122,0.000599465,0.000094673276,0.00006199612,0.00023936754,0.00013146126,0.6611865,0.002366234,0.3304167,0.0016206052,0.0030913472],"study_design_scores_gemma":[0.000011073034,0.000023072529,0.00012413238,0.0000075792327,0.000006146578,0.000014265702,0.000027872244,0.93031186,0.00015946788,0.06909252,0.00020993306,0.000012064223],"about_ca_topic_score_codex":0.0047748233,"about_ca_topic_score_gemma":0.001688904,"teacher_disagreement_score":0.0047748233,"about_ca_system_score_codex":0.0019674366,"about_ca_system_score_gemma":0.0013288903,"threshold_uncertainty_score":0.014785707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5254565,0.0006036576,0.43957135,0.0024443555,0.00010364128,0.00015749168,0.00027138522,0.00016257317,0.031228995],"genre_scores_gemma":[0.97834843,0.00021139497,0.016242204,0.00016475347,0.00001985958,0.00010069622,0.000060379512,0.000012603153,0.00483968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982255,0.00063897937,0.00009615911,0.0004154832,0.0003448743,0.0002790098],"domain_scores_gemma":[0.99483055,0.003468376,0.0005975777,0.00025536385,0.00037938447,0.00046871454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029069022,0.00053403043,0.0012361724,0.00072798174,0.0008052664,0.0025054538,0.0017625282,0.0018129357,0.0048883967],"category_scores_gemma":[0.012346376,0.00027231267,0.0007237473,0.00070238987,0.0020368544,0.0031252734,0.0014534101,0.0019554715,0.0005092499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020338163,0.00015308993,0.0050623664,0.00016823615,0.00013915778,0.0007417337,0.0009872882,0.2303342,0.008273746,0.73432565,0.0013859518,0.018225145],"study_design_scores_gemma":[0.000032723885,0.00006540843,0.001162633,0.000023341987,0.000025377823,0.00020680478,0.00024083229,0.78993714,0.0004939532,0.20695868,0.0008164728,0.000036684505],"about_ca_topic_score_codex":0.003512503,"about_ca_topic_score_gemma":0.0014747952,"teacher_disagreement_score":0.0048883967,"about_ca_system_score_codex":0.001584645,"about_ca_system_score_gemma":0.0007461812,"threshold_uncertainty_score":0.01635325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39409494,0.0013666886,0.51317644,0.002558555,0.00010758151,0.00021460775,0.00042125126,0.00024964454,0.08781024],"genre_scores_gemma":[0.9606939,0.00064528594,0.033580605,0.00021831668,0.00007042803,0.000179899,0.000099394776,0.00006517772,0.0044469247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963052,0.0021768443,0.0001436237,0.00035373017,0.00037609448,0.00064441445],"domain_scores_gemma":[0.9831803,0.012345898,0.0019102945,0.0012505588,0.00071940356,0.00059353595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005094399,0.0010321656,0.001775014,0.0012192456,0.0013178084,0.0035439392,0.0017085528,0.0018484603,0.0114465505],"category_scores_gemma":[0.031137774,0.00093495764,0.001216545,0.0012837009,0.0027810412,0.009957564,0.0030457783,0.0023664052,0.00052771904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035934884,0.00020672739,0.001369797,0.00018005514,0.00008122945,0.00021044577,0.0003162326,0.08582679,0.0018527443,0.8910658,0.0015153692,0.017015565],"study_design_scores_gemma":[0.00014786141,0.0000982309,0.00084132195,0.000070500144,0.000048484824,0.00010019126,0.00014507635,0.21119791,0.0010013295,0.78385335,0.0024487134,0.000047021258],"about_ca_topic_score_codex":0.002209218,"about_ca_topic_score_gemma":0.0024863048,"teacher_disagreement_score":0.0114465505,"about_ca_system_score_codex":0.002286391,"about_ca_system_score_gemma":0.0013439347,"threshold_uncertainty_score":0.038292587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12325224,0.00052848633,0.86320776,0.0016116793,0.000046684654,0.00018530714,0.00019227555,0.000107370346,0.0108681815],"genre_scores_gemma":[0.88006896,0.00062915805,0.11407753,0.00015658383,0.00006104948,0.00033060147,0.00017865714,0.000037680784,0.0044596824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945766,0.003801511,0.0001473667,0.00072117196,0.0005208857,0.00023247734],"domain_scores_gemma":[0.98891056,0.008518984,0.0010812116,0.0006509444,0.00039935723,0.0004388236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005159217,0.0009740647,0.0012042674,0.0009924944,0.001256533,0.00291617,0.0015351496,0.0015964487,0.0040491736],"category_scores_gemma":[0.017508112,0.0005363492,0.0010138492,0.0014161074,0.0024781984,0.0064458726,0.002769863,0.0019575031,0.00036522528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012366427,0.00009127931,0.0025300947,0.00014843844,0.00012515922,0.00021309669,0.00057315646,0.3483335,0.0007817678,0.61407715,0.0014947098,0.031507973],"study_design_scores_gemma":[0.00002801714,0.00003193442,0.00053856714,0.000019215118,0.000019554509,0.000039568153,0.00014011537,0.48736274,0.00018950755,0.5100611,0.0015530508,0.000016672459],"about_ca_topic_score_codex":0.002449198,"about_ca_topic_score_gemma":0.002466035,"teacher_disagreement_score":0.005159217,"about_ca_system_score_codex":0.0025018656,"about_ca_system_score_gemma":0.0009278785,"threshold_uncertainty_score":0.02728486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024093583,0.00012227331,0.97085583,0.0005427913,0.000026008773,0.00014236412,0.00008738796,0.00033853957,0.0037911613],"genre_scores_gemma":[0.45917466,0.00018349363,0.5375448,0.00025453456,0.000042263728,0.0003741628,0.0001981237,0.0001149792,0.0021129698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995723,0.0027831406,0.00016457292,0.0006185503,0.0004767924,0.00023393297],"domain_scores_gemma":[0.9779142,0.018920032,0.0008884266,0.001268832,0.00050147186,0.00050700357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051256837,0.0011627582,0.0009480552,0.00096009084,0.0011509138,0.0038541239,0.002958536,0.001588579,0.0049183546],"category_scores_gemma":[0.027659435,0.00087467395,0.002411386,0.0007881742,0.0043950817,0.006495112,0.003833769,0.0032793449,0.00062308746],"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.00017881877,0.00019610362,0.001903043,0.00029935347,0.00015207562,0.00046242826,0.0024695212,0.38574263,0.0024650518,0.56809074,0.0017279525,0.036312286],"study_design_scores_gemma":[0.000033255368,0.000031460517,0.00008283969,0.000019647012,0.000022051738,0.00006073306,0.00013638886,0.69884676,0.00060631963,0.29869995,0.001439943,0.00002059429],"about_ca_topic_score_codex":0.005540167,"about_ca_topic_score_gemma":0.0068158545,"teacher_disagreement_score":0.005540167,"about_ca_system_score_codex":0.0017150294,"about_ca_system_score_gemma":0.0019686073,"threshold_uncertainty_score":0.027107537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75343925,0.0010792254,0.1919921,0.0053836037,0.00016863759,0.00017120373,0.00047120897,0.00013370517,0.047161095],"genre_scores_gemma":[0.9834145,0.0003261368,0.010876889,0.00016614459,0.00002595669,0.000099756995,0.00006669412,0.00001942491,0.0050045503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00049304025,0.000028535427,0.000101569996,0.000070356014,0.00011006441],"domain_scores_gemma":[0.9935334,0.0043046414,0.00097027695,0.00035661148,0.00033249674,0.00050266454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015458291,0.00065566855,0.0007893919,0.00074802723,0.0009905164,0.0023404986,0.0016735864,0.0031439865,0.0047747507],"category_scores_gemma":[0.012797444,0.00047678736,0.0008241322,0.0005599585,0.002310527,0.0026437063,0.002002324,0.0018305288,0.00044298763],"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.00010652907,0.00009625375,0.006261521,0.000067596826,0.00007109588,0.0005067307,0.0009980284,0.8242504,0.0009337552,0.16078682,0.0010871261,0.004834121],"study_design_scores_gemma":[0.000034845467,0.000045150442,0.00062773394,0.000015857007,0.000017402797,0.00004951727,0.00021904791,0.94871336,0.000084878426,0.04917662,0.0009962701,0.000019338608],"about_ca_topic_score_codex":0.010828301,"about_ca_topic_score_gemma":0.006566734,"teacher_disagreement_score":0.010828301,"about_ca_system_score_codex":0.0017433754,"about_ca_system_score_gemma":0.0009927801,"threshold_uncertainty_score":0.021530569},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07956312,0.00064710877,0.9118765,0.001499274,0.000088191126,0.00009081073,0.000121721736,0.0006955416,0.0054177316],"genre_scores_gemma":[0.90482116,0.00043753805,0.090167396,0.00056430313,0.00009793202,0.00020111505,0.00027475358,0.0001968189,0.0032390452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672544,0.0012447861,0.00013222295,0.0009719657,0.0005433967,0.000382207],"domain_scores_gemma":[0.97989446,0.016108034,0.0010000165,0.0016522995,0.0009797331,0.00036547874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005437594,0.0015000569,0.0022184935,0.0007364099,0.0007197531,0.0019401034,0.0026690555,0.0028441537,0.0038116428],"category_scores_gemma":[0.05111409,0.0008544189,0.0009898872,0.0004496012,0.0027909838,0.0059352485,0.0021598984,0.004939785,0.00074143027],"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.0005201143,0.00027082232,0.0067705945,0.00043012883,0.00025979363,0.00024586904,0.00046059646,0.7606884,0.0027534978,0.1416321,0.003161007,0.08280707],"study_design_scores_gemma":[0.000020889916,0.00008187708,0.00025533192,0.000032793476,0.000017025692,0.00007416168,0.000038681006,0.921116,0.0009758867,0.07690855,0.00046591775,0.000012835706],"about_ca_topic_score_codex":0.002677291,"about_ca_topic_score_gemma":0.0021008092,"teacher_disagreement_score":0.005437594,"about_ca_system_score_codex":0.0018273679,"about_ca_system_score_gemma":0.0017390837,"threshold_uncertainty_score":0.028757095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49998665,0.00030474458,0.4916473,0.0011726234,0.000038704708,0.00012104309,0.0001727039,0.00015729961,0.0063990126],"genre_scores_gemma":[0.9737791,0.000254519,0.022778505,0.00011409453,0.000030716208,0.00009982908,0.0000729312,0.000025333999,0.00284497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798405,0.0010235716,0.00008068643,0.00041763947,0.00019350185,0.0003005915],"domain_scores_gemma":[0.9787829,0.017744089,0.0019642245,0.00046181606,0.00052459905,0.00052238745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004916705,0.0012751403,0.0024806939,0.0006872978,0.00066276663,0.0021372084,0.0016441849,0.002927873,0.002898944],"category_scores_gemma":[0.021495948,0.00087906455,0.0010440178,0.00054120703,0.0028544609,0.0052870563,0.0010836249,0.0022296875,0.00036063354],"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.00039182216,0.0002164574,0.0022323034,0.00014173979,0.0001497349,0.0004795119,0.0005696943,0.8388921,0.0027733485,0.14490248,0.00083571626,0.008415097],"study_design_scores_gemma":[0.000063488,0.000116925745,0.00036544143,0.000010984707,0.000022139368,0.00004213335,0.000104787774,0.9275109,0.0005964305,0.0709004,0.00023247542,0.000033900167],"about_ca_topic_score_codex":0.0037402944,"about_ca_topic_score_gemma":0.0022557857,"teacher_disagreement_score":0.004916705,"about_ca_system_score_codex":0.0017358515,"about_ca_system_score_gemma":0.001100915,"threshold_uncertainty_score":0.026002347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029036146,0.00029894078,0.961266,0.0007960173,0.00005038774,0.000108296335,0.00010528161,0.000075628705,0.008263286],"genre_scores_gemma":[0.77195436,0.0007173236,0.21829411,0.00029251174,0.00012761063,0.00037325636,0.0001801233,0.000058491634,0.008002122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779236,0.0011283852,0.000067325345,0.0004574152,0.00029016522,0.00026436354],"domain_scores_gemma":[0.99516886,0.0039170175,0.00029993427,0.00019196652,0.00022401677,0.000198197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026299374,0.0010931753,0.0015821084,0.0006051216,0.0007323536,0.001609407,0.0020906366,0.0016915181,0.0032486676],"category_scores_gemma":[0.007931827,0.00047509428,0.0008805388,0.0012995617,0.0022595495,0.0033078417,0.0021672072,0.0019693945,0.00029639393],"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.00007828163,0.000060851075,0.0003325778,0.00014742857,0.00007471289,0.00015403377,0.00014511164,0.734521,0.0006126634,0.24844772,0.001420744,0.014004928],"study_design_scores_gemma":[0.00003156455,0.00003057935,0.000088858396,0.000011303846,0.000011391416,0.00002850684,0.000046108802,0.8207126,0.0002554585,0.17786406,0.00090809126,0.000011451366],"about_ca_topic_score_codex":0.0049496996,"about_ca_topic_score_gemma":0.003564131,"teacher_disagreement_score":0.0049496996,"about_ca_system_score_codex":0.0022296645,"about_ca_system_score_gemma":0.0017732505,"threshold_uncertainty_score":0.016177416},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09825839,0.007509579,0.31647134,0.0056701954,0.00063393987,0.00020317479,0.00021972181,0.00011650874,0.5709172],"genre_scores_gemma":[0.8904932,0.0034568263,0.021567477,0.00032663028,0.0002867931,0.00013511305,0.00007215807,0.000048217036,0.083613604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965835,0.00014624011,0.000008909167,0.00003075576,0.00008873296,0.00006692775],"domain_scores_gemma":[0.9996239,0.00025902313,0.000023326049,0.000024393927,0.000027754471,0.00004155479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048960384,0.00050095364,0.0005938542,0.00031681877,0.0007466577,0.0021332896,0.0009988387,0.0012132782,0.005974584],"category_scores_gemma":[0.0017843201,0.00023995806,0.00037445294,0.0007162825,0.001500434,0.0028107492,0.0009095888,0.0015301292,0.00043778424],"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.000016666283,0.000022930351,0.00006118645,0.0000316929,0.00000519225,0.00003538108,0.000069602705,0.021793418,0.00026480472,0.9659732,0.0033978003,0.0083282],"study_design_scores_gemma":[0.00001142454,0.000012624558,0.00014411217,0.000025548949,0.0000052332352,0.000044809367,0.0001049829,0.0947871,0.00013419901,0.89665985,0.008060265,0.000009855673],"about_ca_topic_score_codex":0.0041054212,"about_ca_topic_score_gemma":0.003501292,"teacher_disagreement_score":0.005974584,"about_ca_system_score_codex":0.002158154,"about_ca_system_score_gemma":0.0009895684,"threshold_uncertainty_score":0.019986987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49296397,0.00097088126,0.39286125,0.0031193604,0.00013144537,0.00016414946,0.0003578109,0.00045789988,0.10897325],"genre_scores_gemma":[0.95377123,0.00031563613,0.031050658,0.00019177869,0.00006924004,0.00018249004,0.00014503699,0.00007195941,0.014201989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998389,0.0006633679,0.00008138919,0.0003251844,0.00022942551,0.0003116475],"domain_scores_gemma":[0.9956825,0.0025226139,0.00063510495,0.00036465828,0.00033215026,0.00046297588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002506133,0.00051429024,0.0012598803,0.0011687563,0.0024611542,0.002158082,0.0013024018,0.0024484943,0.007812],"category_scores_gemma":[0.012234347,0.00062745175,0.0015043697,0.00076240394,0.0029137502,0.0032975886,0.0027047908,0.002052758,0.000491979],"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.000067426256,0.000030395222,0.0010987747,0.000065063476,0.000025381729,0.00017970086,0.00042653395,0.014287616,0.0007307268,0.9751048,0.0014772995,0.00650636],"study_design_scores_gemma":[0.000067637404,0.000054933993,0.0008161449,0.00003449879,0.000016748743,0.0002518358,0.0002858443,0.078563385,0.00063420413,0.9147625,0.0044832826,0.000028998302],"about_ca_topic_score_codex":0.002214657,"about_ca_topic_score_gemma":0.0018911816,"teacher_disagreement_score":0.007812,"about_ca_system_score_codex":0.0017388486,"about_ca_system_score_gemma":0.0008130148,"threshold_uncertainty_score":0.026133716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7770039,0.0013461261,0.09466326,0.00444328,0.00012949944,0.00022076716,0.00031449736,0.000061276536,0.12181734],"genre_scores_gemma":[0.9925568,0.00023203866,0.004227866,0.00008680174,0.000022602118,0.00007509564,0.000040866267,0.0000072618896,0.0027506242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975694,0.0017037102,0.000090983674,0.00016399426,0.0001981377,0.00027385776],"domain_scores_gemma":[0.9891662,0.008463994,0.0006831647,0.00047556736,0.00047786688,0.0007331034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028649878,0.00053340575,0.00080688327,0.00066685927,0.00074318855,0.0031022248,0.0016610428,0.00108013,0.0068700253],"category_scores_gemma":[0.020749038,0.00029894095,0.0006906327,0.0007447741,0.0021986272,0.005010051,0.0022080832,0.0019509204,0.00025500666],"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.00029658392,0.00018408238,0.006725557,0.00017779996,0.00010368024,0.0003161761,0.00094237906,0.07803075,0.00059704296,0.8856596,0.0031965715,0.023769734],"study_design_scores_gemma":[0.00009396155,0.00017514762,0.0040135365,0.00006248668,0.0000706539,0.00018391886,0.0010975292,0.37414506,0.00023680352,0.6166877,0.0031903572,0.000042831205],"about_ca_topic_score_codex":0.0068921507,"about_ca_topic_score_gemma":0.0069205547,"teacher_disagreement_score":0.0068921507,"about_ca_system_score_codex":0.0011212085,"about_ca_system_score_gemma":0.0011393494,"threshold_uncertainty_score":0.022982538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010333952,0.050358042,0.21894206,0.013429367,0.0011707862,0.00012281927,0.0004179132,0.00025399477,0.70497113],"genre_scores_gemma":[0.49316934,0.07847239,0.16080517,0.0037787096,0.0043555396,0.000914695,0.0017305019,0.0003237369,0.2564499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990361,0.0004419305,0.000048277794,0.00012231784,0.00028722762,0.00006418395],"domain_scores_gemma":[0.9974268,0.0020374008,0.00010693153,0.00018055225,0.00020595088,0.000042419382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021612921,0.001141372,0.0012831753,0.0015179551,0.0013325575,0.005663849,0.0017524986,0.0028400684,0.015575895],"category_scores_gemma":[0.007243567,0.00090077746,0.00070149323,0.0036731074,0.0055854605,0.0078078983,0.0010178437,0.004002218,0.0029626726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057595503,0.000017032125,0.0000514386,0.00008227221,0.00000647854,0.000013885832,0.00009826825,0.0011174651,0.000058604608,0.97608304,0.010848893,0.01161699],"study_design_scores_gemma":[0.0000034543705,0.0000013777816,0.000020731504,0.000029200966,0.0000019739743,0.000010781488,0.000019008281,0.00083186966,0.000015325264,0.9916677,0.0073964032,0.000002196894],"about_ca_topic_score_codex":0.0020209614,"about_ca_topic_score_gemma":0.0025792758,"teacher_disagreement_score":0.015575895,"about_ca_system_score_codex":0.0026945306,"about_ca_system_score_gemma":0.0015762084,"threshold_uncertainty_score":0.0521065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57545406,0.0010452162,0.27578866,0.0027169134,0.00007104782,0.00007811007,0.00022083189,0.00009388828,0.14453132],"genre_scores_gemma":[0.9924142,0.00024979285,0.004118784,0.00008926195,0.00003352828,0.000026382486,0.00003428036,0.00002873468,0.0030050087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928755,0.00034920423,0.000020471562,0.00010152513,0.00011791956,0.00012333538],"domain_scores_gemma":[0.9950765,0.0035858413,0.00047428044,0.00020340424,0.00038141862,0.00027870925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637836,0.00045230403,0.000782307,0.0012641798,0.00080951944,0.0027482507,0.00082291075,0.00092702056,0.007385669],"category_scores_gemma":[0.0063311593,0.00020376434,0.00054504775,0.0010748319,0.0045384616,0.0036933427,0.0019386128,0.0014963911,0.0003616042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006177469,0.000036785335,0.0009217258,0.00005424795,0.000014197816,0.00011259803,0.00016872911,0.038631674,0.0015589653,0.95365894,0.00067712006,0.0041032494],"study_design_scores_gemma":[0.000013859922,0.000031045474,0.00089946605,0.000037706013,0.00001070737,0.00007695217,0.00019117784,0.091848105,0.0005903598,0.90504676,0.001241513,0.0000123176915],"about_ca_topic_score_codex":0.0018830227,"about_ca_topic_score_gemma":0.0008639202,"teacher_disagreement_score":0.007385669,"about_ca_system_score_codex":0.002106506,"about_ca_system_score_gemma":0.00080807746,"threshold_uncertainty_score":0.024707556},"labels":[],"label_agreement":null}]}