{"meta":{"query_hash":"1fb3a78d8e29","filters":{"venue":"Adaptive Agents and Multi-Agents Systems"},"cohort_total":63,"direct_labels_cover":0,"predictions_cover":63,"exported":63,"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/1fb3a78d8e29","api":"https://metacan.xera.ac/api/v1/cohort?venue=Adaptive+Agents+and+Multi-Agents+Systems"},"results":[{"id":"W108564685","doi":"10.5555/2484920.2484946","title":"The impact of culture on crowd dynamics: an empirical approach","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":21,"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":"Crowds; Pedestrian; Crowd simulation; Macro; Computer science; Crowd psychology; Set (abstract data type); Domain (mathematical analysis); Dynamics (music); Human–computer interaction; Data science; Simulation; Artificial intelligence; Computer security; Transport engineering; Sociology; Engineering; Mathematics","score_opus":0.04528727989469312,"score_gpt":0.3138364174435642,"score_spread":0.2685491375488711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108564685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9738685,0.00050739833,0.017793689,0.0000144653295,0.00038509717,0.0011072789,0.00011538163,0.00013413261,0.0060740616],"genre_scores_gemma":[0.9980672,0.00014614934,0.0003233029,0.0000233864,0.00005120345,0.00007524768,0.000056315115,0.0000376912,0.0012195006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988457,0.00009572805,0.0003260151,0.00022689707,0.00022200981,0.00028364736],"domain_scores_gemma":[0.9992795,0.000036395246,0.00008555369,0.00030411815,0.000118860626,0.00017555295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015572253,0.00024477483,0.00024508304,0.00005425565,0.00015663162,0.00012547767,0.00019928851,0.00013177673,0.000018887615],"category_scores_gemma":[0.000016018,0.00014709614,0.0001013121,0.00011613265,0.00006718734,0.00019029668,0.000032881355,0.00017321005,0.000040136812],"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.00019990095,0.0024016078,0.1403901,0.00053367304,0.0034848999,0.000020080888,0.020533023,0.7324818,0.0024464855,0.0077474774,0.056022316,0.03373866],"study_design_scores_gemma":[0.0004885085,0.00015311452,0.07974432,0.000025575535,0.000014346379,0.000004905686,0.0019826123,0.9171114,0.0000062224344,0.000015249606,0.0002875588,0.00016621308],"about_ca_topic_score_codex":0.0004921257,"about_ca_topic_score_gemma":0.000028648914,"teacher_disagreement_score":0.1846296,"about_ca_system_score_codex":0.0001397829,"about_ca_system_score_gemma":0.000014180968,"threshold_uncertainty_score":0.59984064},"labels":[],"label_agreement":null},{"id":"W136985510","doi":"10.5555/2034396.2034517","title":"Escaping local optima in POMDP planning as inference","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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":"Inference; Partially observable Markov decision process; Local optimum; Reinforcement learning; Computer science; Mathematical optimization; Observable; Greedy algorithm; Artificial intelligence; Machine learning; Mathematics; Markov chain; Markov model","score_opus":0.14580520123192156,"score_gpt":0.3207535313869368,"score_spread":0.17494833015501524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136985510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03692525,0.00034758777,0.95564127,0.000009500646,0.0006961336,0.0004958632,0.000001530719,0.000107558466,0.005775293],"genre_scores_gemma":[0.9844389,0.00005264179,0.0144496225,0.00014135843,0.000031294392,0.00003574352,0.000003146525,0.000020943364,0.00082635484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778146,0.00017562736,0.0005130767,0.00059405656,0.0003895269,0.0005462286],"domain_scores_gemma":[0.99893075,0.000086265194,0.00024499654,0.00044975846,0.000090721165,0.0001974884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042809665,0.0002922819,0.000330724,0.00023062402,0.00016323398,0.00018255274,0.00070974196,0.00012311478,0.000019902594],"category_scores_gemma":[0.00006657723,0.0002723748,0.00004996403,0.00027730025,0.00008966195,0.0006984895,0.0005076737,0.00026578925,0.00014011325],"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.00006434666,0.00035194223,0.13716485,0.00017200805,0.0002686074,0.00085955625,0.04207514,0.7818159,0.00015617364,0.025463112,0.000440442,0.01116796],"study_design_scores_gemma":[0.0009258892,0.00018930185,0.049014412,0.0003496743,0.000008620755,0.000021895758,0.0013820856,0.9471146,0.00006440315,0.000028640703,0.0005655186,0.00033494705],"about_ca_topic_score_codex":0.0014594301,"about_ca_topic_score_gemma":0.000008596812,"teacher_disagreement_score":0.94751364,"about_ca_system_score_codex":0.00010344989,"about_ca_system_score_gemma":0.000057257228,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W145585440","doi":"10.5555/2484920.2485185","title":"Model based approach to detect emergent behavior in multi-agent systems","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","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":"Carleton University; University of Calgary","funders":"","keywords":"Agent-oriented software engineering; Computer science; Unified Modeling Language; Sequence diagram; Software engineering; Software deployment; Multi-agent system; Software; Software development; Systems engineering; Artificial intelligence; Engineering","score_opus":0.18208004838312175,"score_gpt":0.3285164316386605,"score_spread":0.14643638325553876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145585440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035384286,0.0009465194,0.9583864,0.000018137529,0.001370559,0.0034529916,0.000027503393,0.00036346295,0.000050118786],"genre_scores_gemma":[0.58331436,0.000034169443,0.4141683,0.00007526844,0.00002444198,0.0018128268,0.00000536127,0.000043961358,0.0005213135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960795,0.00044036368,0.00081587443,0.0012166714,0.00055845553,0.00088915403],"domain_scores_gemma":[0.99795026,0.00016519458,0.00022522135,0.00096230896,0.00021693455,0.0004800956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007690073,0.00057659385,0.0006914908,0.0004546794,0.00017287576,0.00026934416,0.0010161216,0.00020134568,0.0000033832578],"category_scores_gemma":[0.00020103695,0.00051530363,0.00011988389,0.00052579766,0.000051491294,0.0006245443,0.00051025784,0.00028902662,0.000083129635],"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.000009368571,0.00035031777,0.0016440199,0.00012238587,0.000049323673,0.000026724761,0.0009139729,0.99104464,0.0013796035,0.0003183563,0.00029409153,0.0038471895],"study_design_scores_gemma":[0.001177567,0.00011012802,0.016933851,0.00012403147,0.000018681196,0.000011191568,0.00034066368,0.9803486,0.000104399835,0.000011504774,0.00022558763,0.0005938289],"about_ca_topic_score_codex":0.0013354352,"about_ca_topic_score_gemma":0.000016057775,"teacher_disagreement_score":0.54793006,"about_ca_system_score_codex":0.00029578243,"about_ca_system_score_gemma":0.000058449965,"threshold_uncertainty_score":0.9997299},"labels":[],"label_agreement":null},{"id":"W1514520309","doi":"10.5555/1838206.1838534","title":"On multi-robot area coverage","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","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":"Robot; Task (project management); Computer science; Point (geometry); Path (computing); Mobile robot; Actuator; Motion planning; Robot kinematics; Human–computer interaction; Robot control; Task analysis; Artificial intelligence; Real-time computing; Engineering; Computer network; Systems engineering","score_opus":0.07079121496115787,"score_gpt":0.2913392058689059,"score_spread":0.22054799090774801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514520309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081233084,0.0001584605,0.9108025,0.00008421673,0.005271426,0.0009505602,0.000053748387,0.00028918678,0.0011568492],"genre_scores_gemma":[0.93250316,0.000028345085,0.06369387,0.00038088058,0.00011890171,0.00006824553,0.000012542878,0.000036431826,0.00315764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972617,0.00016613281,0.00045324845,0.00094812526,0.00054510735,0.0006256665],"domain_scores_gemma":[0.9981196,0.00017975725,0.00026679353,0.0009015305,0.00014120541,0.00039112606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047429634,0.0004267689,0.00043310778,0.00018723086,0.00035087467,0.00034069107,0.00087916834,0.0002020207,0.000018097766],"category_scores_gemma":[0.00012779416,0.00036175718,0.00009688722,0.00023841261,0.000090845686,0.0004350137,0.00033381404,0.00047884264,0.00029630738],"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.0005692892,0.018408172,0.16860227,0.0010746125,0.00491483,0.011187028,0.0518564,0.22318624,0.055644654,0.15143578,0.07816609,0.23495464],"study_design_scores_gemma":[0.0021607683,0.00019786123,0.05746984,0.00013125625,0.000018111254,0.000077910845,0.00008345091,0.9363019,0.00011510291,0.000036406716,0.0028980921,0.00050929555],"about_ca_topic_score_codex":0.00042701705,"about_ca_topic_score_gemma":0.0000148642675,"teacher_disagreement_score":0.8512701,"about_ca_system_score_codex":0.000055578774,"about_ca_system_score_gemma":0.000052721847,"threshold_uncertainty_score":0.9998834},"labels":[],"label_agreement":null},{"id":"W1530765895","doi":"10.5555/1402821.1402883","title":"A new approach to cooperative pathfinding","year":2008,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":27,"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":"Pathfinding; Computer science; Plan (archaeology); Fidelity; Path (computing); Human–computer interaction; Distributed computing; Operations research; Artificial intelligence; Shortest path problem; Theoretical computer science; Engineering; Computer network","score_opus":0.13236742723817527,"score_gpt":0.29515774679958934,"score_spread":0.16279031956141407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530765895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011494715,0.0002707916,0.98306286,0.00004801481,0.00093141414,0.0009140591,0.000014552175,0.00015561003,0.0031080085],"genre_scores_gemma":[0.62683976,0.00003667596,0.36235756,0.00032476833,0.0001638395,0.00007971437,0.000008374624,0.000029290028,0.01016005],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975634,0.00019159156,0.00037714813,0.00087211584,0.0004634947,0.00053225545],"domain_scores_gemma":[0.99861157,0.00006234862,0.00014159216,0.00051797356,0.00012767375,0.00053882576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030694527,0.00032401478,0.0004074562,0.00018277214,0.00044711353,0.00017923817,0.0006804323,0.00010088472,0.000005064367],"category_scores_gemma":[0.000060479633,0.00028003982,0.0000590499,0.00045701096,0.00004262282,0.00043464033,0.00037578185,0.00017182012,0.00026947638],"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.00020671249,0.00363677,0.05771827,0.00036338484,0.002524965,0.0039361347,0.30631348,0.22095668,0.0028663373,0.049599513,0.2837064,0.068171345],"study_design_scores_gemma":[0.0015683045,0.00019104748,0.029005012,0.00013433845,0.000016571252,0.0003317742,0.0007286678,0.9617422,0.000061307546,0.000006281556,0.005627213,0.0005872498],"about_ca_topic_score_codex":0.00075156934,"about_ca_topic_score_gemma":0.0000013553037,"teacher_disagreement_score":0.74078554,"about_ca_system_score_codex":0.000094278075,"about_ca_system_score_gemma":0.0001160442,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W1540112079","doi":"10.5555/1402821.1402866","title":"Using adaptive consultation of experts to improve convergence rates in multiagent learning","year":2008,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Advanced Bandit Algorithms Research","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":"Regret; Computer science; Outcome (game theory); Convergence (economics); Advice (programming); Multi-agent system; Set (abstract data type); Class (philosophy); Nash equilibrium; Process (computing); Frame (networking); Order (exchange); Artificial intelligence; Machine learning; Mathematical optimization; Mathematics","score_opus":0.367641049994208,"score_gpt":0.4650858587974098,"score_spread":0.09744480880320183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540112079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8197591,0.0007808242,0.17714377,0.000013888059,0.0006300095,0.0015319034,0.000049875583,0.000022101585,0.000068566835],"genre_scores_gemma":[0.99175745,0.00023576836,0.0063284477,0.00003332399,0.000052217703,0.00009751283,0.000004917284,0.00003124081,0.0014591061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950941,0.0006916448,0.0011726994,0.0009642953,0.0014996672,0.00057757384],"domain_scores_gemma":[0.99681085,0.0009305387,0.0005401592,0.000376847,0.0010159275,0.00032567422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013806135,0.00032500655,0.00067517196,0.0006197505,0.00033084746,0.00008605754,0.0004379018,0.00012789338,0.00007067435],"category_scores_gemma":[0.0023008855,0.00026559297,0.000089831294,0.0009860127,0.0002778324,0.0006866425,0.00031724395,0.00022771313,0.00006998549],"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.0019909611,0.0016119785,0.2587844,0.00012429756,0.00047720684,0.00096953666,0.0912426,0.5048854,0.09240387,0.00022129092,0.0010347406,0.04625373],"study_design_scores_gemma":[0.0030031467,0.0003891104,0.055269748,0.00022472885,0.000010675572,0.000024249097,0.027378341,0.9081517,0.004278557,0.000026724281,0.00083297753,0.00041004346],"about_ca_topic_score_codex":0.0023187057,"about_ca_topic_score_gemma":0.000086690176,"teacher_disagreement_score":0.40326634,"about_ca_system_score_codex":0.00019361575,"about_ca_system_score_gemma":0.0001270729,"threshold_uncertainty_score":0.9999796},"labels":[],"label_agreement":null},{"id":"W1546624303","doi":"10.5555/1838206.1838442","title":"An investigation of representations of combinatorial auctions","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction 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":"Treewidth; Combinatorial auction; Chordal graph; Partial k-tree; Combinatorics; Computer science; Graph; Mathematics; Equivalence (formal languages); Discrete mathematics; Theoretical computer science; Pathwidth; Line graph; Common value auction; 1-planar graph","score_opus":0.14548509585147926,"score_gpt":0.4075015803021488,"score_spread":0.2620164844506695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546624303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828719,0.000022377571,0.013978566,0.00006191059,0.0017325369,0.0005309624,0.00013728149,0.000024245746,0.00064023817],"genre_scores_gemma":[0.99765164,0.00000753097,0.0013913403,0.000015189652,0.000111609224,0.000054764758,0.000018858334,0.0000095985115,0.00073946133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979023,0.00029722386,0.00076222915,0.0003760189,0.00053890713,0.00012332866],"domain_scores_gemma":[0.9977007,0.00029555673,0.0006350165,0.00059787143,0.0006054621,0.00016538211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011667529,0.000116583964,0.0002609617,0.00020889376,0.00025794827,0.00005815409,0.00032872186,0.00009804152,0.00010456251],"category_scores_gemma":[0.00029683477,0.00009589645,0.000069150585,0.00048647792,0.0003701012,0.00042928365,0.000057522633,0.00013042294,0.000028074814],"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.000094799056,0.0010511404,0.19862945,0.000035229587,0.0002067822,0.0000021055193,0.010419953,0.0016403521,0.16926713,0.60983324,0.0045831525,0.00423666],"study_design_scores_gemma":[0.003959744,0.0005010951,0.7925549,0.00007745244,0.00017946528,0.000035051493,0.028194629,0.08024022,0.023982028,0.0601239,0.009514314,0.00063721865],"about_ca_topic_score_codex":0.0005133945,"about_ca_topic_score_gemma":0.00003664988,"teacher_disagreement_score":0.5939254,"about_ca_system_score_codex":0.000008777112,"about_ca_system_score_gemma":0.000047015525,"threshold_uncertainty_score":0.39105436},"labels":[],"label_agreement":null},{"id":"W1555338578","doi":"10.5555/1838206.1838401","title":"Using bisimulation for policy transfer in MDPs","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"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":"Markov decision process; Computer science; Bisimulation; Artificial intelligence; Markov process; Work (physics); Theoretical computer science; Mathematics","score_opus":0.12857996272755987,"score_gpt":0.35545820968810005,"score_spread":0.22687824696054018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555338578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1618139,0.000026264355,0.8362215,0.00004938491,0.00080224563,0.0008798485,0.0000063392627,0.0000451384,0.00015538743],"genre_scores_gemma":[0.9801678,0.00001168891,0.019095128,0.00009867714,0.00012352393,0.000032717973,0.000005768107,0.00002053577,0.00044414547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853426,0.00007165417,0.00038294308,0.000400286,0.00024061528,0.0003702175],"domain_scores_gemma":[0.99929094,0.00008075221,0.00009036305,0.00031810463,0.00010358646,0.00011627182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035890916,0.00019336004,0.00022717183,0.0002670496,0.00015818907,0.00018188183,0.0003343244,0.0001205586,0.0000025455508],"category_scores_gemma":[0.000060862738,0.0001790246,0.000057315458,0.00027192888,0.000042862008,0.00047370096,0.00008850333,0.0001677586,0.000008193044],"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.00003427463,0.00018166618,0.02503603,0.00014244662,0.000113428876,0.000017063106,0.004427384,0.9009987,0.00936086,0.05498131,0.00009625358,0.0046105785],"study_design_scores_gemma":[0.0014193809,0.00007965182,0.012048979,0.00005056735,0.000008773159,0.000005859238,0.000058001155,0.98372823,0.00012531437,0.000028313218,0.0022469927,0.00019993626],"about_ca_topic_score_codex":0.0011033905,"about_ca_topic_score_gemma":0.000055137803,"teacher_disagreement_score":0.8183539,"about_ca_system_score_codex":0.00007082217,"about_ca_system_score_gemma":0.00006606551,"threshold_uncertainty_score":0.73004115},"labels":[],"label_agreement":null},{"id":"W1584723732","doi":"10.5555/1838206.1838443","title":"Parameterizing the winner determination problem for combinatorial auctions","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction 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":"Combinatorial auction; Parameterized complexity; Common value auction; Computer science; Bidding; Mathematical optimization; Leverage (statistics); Computational complexity theory; Theoretical computer science; Mathematics; Artificial intelligence; Algorithm; Economics","score_opus":0.172506683914167,"score_gpt":0.4008345885727295,"score_spread":0.2283279046585625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584723732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6560442,0.00011075951,0.32389322,0.0010281594,0.011191333,0.0053130947,0.000279478,0.00014596073,0.0019938056],"genre_scores_gemma":[0.9924403,0.000007334947,0.0026867837,0.00009253387,0.00035204436,0.0006494501,0.000010492001,0.000017151408,0.0037439035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807596,0.00021275479,0.00054872583,0.00047938697,0.0004424459,0.00024072774],"domain_scores_gemma":[0.9979243,0.0007262316,0.00037903537,0.00046453447,0.00038669226,0.00011920518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018388003,0.00016896367,0.00021630886,0.00008730882,0.0010848269,0.00037243386,0.0004155589,0.000112032074,0.000044330918],"category_scores_gemma":[0.00044233902,0.0001053398,0.00010484557,0.0002831829,0.00020076902,0.00034344432,0.00009305704,0.0001838872,0.000083215455],"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.00029824203,0.0015146848,0.009850868,0.00006645482,0.0004061435,0.0000067180504,0.010819923,0.0009072021,0.028617546,0.7612389,0.037497167,0.14877619],"study_design_scores_gemma":[0.0036594707,0.00029676218,0.021024369,0.000050845778,0.00015377584,0.000074435455,0.008312573,0.20418137,0.0011031837,0.053742055,0.70668525,0.0007159094],"about_ca_topic_score_codex":0.000069258334,"about_ca_topic_score_gemma":0.000023807152,"teacher_disagreement_score":0.7074968,"about_ca_system_score_codex":0.000022003254,"about_ca_system_score_gemma":0.000024699946,"threshold_uncertainty_score":0.83437204},"labels":[],"label_agreement":null},{"id":"W1722021969","doi":"10.5555/2484920.2485197","title":"Rating players in games with real-valued outcomes","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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 Alberta","funders":"","keywords":"Computer science; Order (exchange); Value (mathematics); Population; Focus (optics); Game theory; Rational agent; Artificial intelligence; Machine learning; Mathematical economics; Mathematics; Economics","score_opus":0.07056963481023519,"score_gpt":0.2546227073203595,"score_spread":0.18405307251012432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722021969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096835,0.0007127399,0.0013098065,0.000062529514,0.0003562564,0.0007657885,0.00005727835,0.000027269974,0.0057399813],"genre_scores_gemma":[0.9931896,0.00044142705,0.00047249265,0.00016540848,0.000042280048,0.000107656866,0.00001371683,0.000033731987,0.0055337385],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983309,0.000017842704,0.00068108825,0.00048861105,0.0000805896,0.00040095966],"domain_scores_gemma":[0.9991057,0.000028033624,0.00040587655,0.00027176118,0.000050589413,0.00013807291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000343098,0.00025591772,0.0005666283,0.000229667,0.00012438289,0.00016421909,0.00015106105,0.00008934631,0.00020689989],"category_scores_gemma":[0.000019111376,0.00021207902,0.000060774804,0.00017695468,0.00005803342,0.00037868033,0.000055423065,0.00013450198,0.00021294916],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010921641,0.00009467849,0.9886392,0.000035122117,0.00012549713,0.000014827793,0.001094048,0.0012672179,0.0000042405236,0.007882223,0.0005060277,0.00032604148],"study_design_scores_gemma":[0.0012783275,0.00007428673,0.73101413,0.000071128874,0.0000075164025,0.0000034589148,0.0010944101,0.26353446,0.0000023434816,0.000040773342,0.002586332,0.0002928556],"about_ca_topic_score_codex":0.018105036,"about_ca_topic_score_gemma":0.00030416684,"teacher_disagreement_score":0.26226723,"about_ca_system_score_codex":0.000079355304,"about_ca_system_score_gemma":0.00001415188,"threshold_uncertainty_score":0.9884335},"labels":[],"label_agreement":null},{"id":"W181767045","doi":"10.5555/2484920.2485213","title":"On the analysis of joining communities of agent-basedweb services","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","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; Concordia University","funders":"","keywords":"Web service; World Wide Web; Computer science; WS-Policy; Key (lock); Incentive; Mechanism (biology); Services computing; Business; Web development; Knowledge management; Computer security; Web application security","score_opus":0.04024602118495016,"score_gpt":0.2550220696143017,"score_spread":0.21477604842935152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181767045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877325,0.00043002423,0.009881866,0.00014409846,0.0002956683,0.00059095875,0.000051697858,0.00004354278,0.0008295991],"genre_scores_gemma":[0.99792254,0.00006240211,0.00083092076,0.00097314524,0.000017998167,0.000056961166,0.000020868401,0.000013345607,0.00010178984],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979682,0.0003878101,0.0005577311,0.0003112845,0.00047567522,0.00029927806],"domain_scores_gemma":[0.99774766,0.00044286437,0.0005281595,0.000892297,0.00028167586,0.00010733022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036547464,0.00026515016,0.00052763853,0.00039880138,0.00024104935,0.0001304212,0.0011590599,0.00007198331,0.000058962647],"category_scores_gemma":[0.000004500845,0.00016987612,0.00017130282,0.00088129065,0.00009232293,0.00030671642,0.0004189958,0.00014622844,0.000020175336],"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.00023750105,0.0037600857,0.2901104,0.0031711354,0.029459966,0.00004847553,0.3641022,0.091989465,0.008155543,0.17770405,0.0016909896,0.029570153],"study_design_scores_gemma":[0.0007004253,0.00022261994,0.14690581,0.00039614952,0.00036325812,0.0000022380661,0.020279352,0.82949835,0.00050094456,0.0001085916,0.00072359253,0.0002986583],"about_ca_topic_score_codex":0.017455075,"about_ca_topic_score_gemma":0.00090016547,"teacher_disagreement_score":0.7375089,"about_ca_system_score_codex":0.000016450836,"about_ca_system_score_gemma":0.000019314752,"threshold_uncertainty_score":0.98908776},"labels":[],"label_agreement":null},{"id":"W189510620","doi":"10.5555/1838206.1838300","title":"Optimal policy switching algorithms for reinforcement learning","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Function approximation; Term (time); Function (biology); Artificial intelligence; Mathematical optimization; Q-learning; Machine learning; Algorithm; Mathematics; Artificial neural network; Engineering","score_opus":0.05548713756434804,"score_gpt":0.3163627497273219,"score_spread":0.2608756121629739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189510620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013757881,0.00008064912,0.98219275,0.00011634703,0.0016838941,0.0011918395,0.0000027518963,0.0001990298,0.0007748594],"genre_scores_gemma":[0.91898805,0.00006690561,0.075395055,0.00017970368,0.00037848618,0.00013834532,0.0000158374,0.000043164524,0.0047944486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973838,0.000094315365,0.0005935272,0.0006824409,0.00050600007,0.0007399363],"domain_scores_gemma":[0.99838734,0.00014134031,0.00041046325,0.00053597783,0.00021848109,0.00030638085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072665,0.00037481345,0.0003739524,0.00026392174,0.00065535295,0.00064293534,0.00076277903,0.00016346038,0.000008847484],"category_scores_gemma":[0.00020196152,0.00034143234,0.00012512278,0.00025157747,0.00005588511,0.00081182533,0.0005037243,0.00048936723,0.00004698865],"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.000021244261,0.000070264236,0.0013390088,0.00009151302,0.00022526308,0.000018112321,0.0033704054,0.96173525,0.002095703,0.017861316,0.00046847452,0.012703452],"study_design_scores_gemma":[0.001594601,0.00029063065,0.0011245162,0.00008843073,0.000020960106,0.000023605333,0.0003784449,0.9735807,0.00015025215,0.000009275698,0.02235008,0.00038845857],"about_ca_topic_score_codex":0.0005621783,"about_ca_topic_score_gemma":0.0000059151853,"teacher_disagreement_score":0.9067977,"about_ca_system_score_codex":0.00009004336,"about_ca_system_score_gemma":0.000104732666,"threshold_uncertainty_score":0.9999038},"labels":[],"label_agreement":null},{"id":"W1900134344","doi":"10.5555/1838206.1838478","title":"Symbolic model checking for agent interactions","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Formal Methods in Verification","field":"Computer Science","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":"Model checking; Computer science; Symbolic trajectory evaluation; Semantics (computer science); Computation tree logic; Protocol (science); Programming language; Theoretical computer science; Formal verification; Temporal logic; Modalities; Cryptographic protocol; Symbolic execution; Computer security; Software; Cryptography","score_opus":0.1435389464135784,"score_gpt":0.3691226349973471,"score_spread":0.2255836885837687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1900134344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06582937,0.00007114671,0.9291603,0.000050099392,0.003045302,0.00096440647,0.00002712022,0.000120739875,0.00073151424],"genre_scores_gemma":[0.6896264,0.00002024338,0.3085379,0.0001063008,0.0001014839,0.0002497817,0.0000059988874,0.00001899,0.0013328715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838614,0.00008310314,0.00039334633,0.0005426608,0.0002341059,0.00036063432],"domain_scores_gemma":[0.9987394,0.00006698974,0.00024110016,0.00057430496,0.00019781746,0.00018034117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853276,0.0002219401,0.0002397846,0.00014124953,0.00034447896,0.00023540483,0.00055684,0.00009677074,0.0000050104445],"category_scores_gemma":[0.00010683919,0.00020188477,0.00009025479,0.00015404323,0.00005343045,0.00072205096,0.00021309365,0.00022436294,0.00002881381],"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.00012160418,0.0017518029,0.0045778984,0.00049496366,0.0007514494,0.000023407883,0.022779644,0.017112505,0.0673995,0.76025856,0.00643498,0.1182937],"study_design_scores_gemma":[0.00054942654,0.000051388757,0.003162407,0.00004115466,0.000018688876,0.000018316165,0.00016904986,0.98490274,0.0006442966,0.00017553041,0.010037361,0.00022962417],"about_ca_topic_score_codex":0.00012624777,"about_ca_topic_score_gemma":0.000023145143,"teacher_disagreement_score":0.96779025,"about_ca_system_score_codex":0.000056143017,"about_ca_system_score_gemma":0.00004002815,"threshold_uncertainty_score":0.8232622},"labels":[],"label_agreement":null},{"id":"W1965168983","doi":"10.1109/aamas.2004.79","title":"Building a Multi-Agent System for Automatic Negotiation in Web Service Applications","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","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":"Université de Montréal","funders":"","keywords":"Interoperability; The Internet; Automation; Web service; Computer science; Negotiation; Context (archaeology); World Wide Web; Service (business); Service-oriented architecture; Software engineering; Engineering; Business","score_opus":0.059328003844414404,"score_gpt":0.30034803407894534,"score_spread":0.24102003023453095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965168983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0899353,0.00066942425,0.90208024,0.00016348342,0.0011485458,0.0054978137,0.000074703974,0.00037469,0.000055775043],"genre_scores_gemma":[0.92712104,0.00004493963,0.07007895,0.00017136743,0.0001499809,0.0022122716,0.000033207936,0.000054699187,0.00013351973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961952,0.00024106301,0.0011756293,0.001137214,0.00053367205,0.0007172137],"domain_scores_gemma":[0.99778765,0.00012623775,0.00067953375,0.00076194044,0.0003393889,0.00030522078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090400834,0.00050965615,0.00064095756,0.00046768607,0.0004738917,0.00037832628,0.00076258223,0.00023585821,0.0000026320126],"category_scores_gemma":[0.000040760922,0.0004857953,0.00014531198,0.00080256764,0.000032531203,0.00091727707,0.00024790908,0.00017749304,0.000087364024],"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.00025479315,0.010487045,0.04166197,0.019675467,0.002646079,0.00031174946,0.05894387,0.2549711,0.059335135,0.4725707,0.0015091058,0.077633],"study_design_scores_gemma":[0.0061497767,0.000088628156,0.016275438,0.0007839164,0.00004895991,0.00003790654,0.0011684664,0.9718735,0.00023438812,0.000038288155,0.002733422,0.000567294],"about_ca_topic_score_codex":0.0017459779,"about_ca_topic_score_gemma":0.00051782187,"teacher_disagreement_score":0.83718574,"about_ca_system_score_codex":0.00073530304,"about_ca_system_score_gemma":0.00015638962,"threshold_uncertainty_score":0.9997594},"labels":[],"label_agreement":null},{"id":"W2058345792","doi":"10.1109/aamas.2004.192","title":"Negotiating Gestalt: Artistic Expression and Coalition Formation in Multiagent Systems","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Slime Mold and Myxomycetes Research","field":"Engineering","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":"Negotiation; Gestalt psychology; Expression (computer science); Painting; Representation (politics); Computer science; Control (management); Space (punctuation); Human–computer interaction; Autonomous agent; Artificial intelligence; Art; Visual arts; Sociology; Epistemology; Political science; Politics; Programming language","score_opus":0.05349610606819741,"score_gpt":0.2763378046049061,"score_spread":0.22284169853670868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058345792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97679347,0.0045639137,0.01588796,0.000009564122,0.00076767366,0.0014622293,0.000075458025,0.00013824167,0.0003014613],"genre_scores_gemma":[0.9983994,0.0007287853,0.00035249256,0.000010645727,0.00008756414,0.00018949037,0.000051966734,0.00004179226,0.00013789073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982734,0.00012037418,0.0004963417,0.00032022982,0.0003298318,0.0004598645],"domain_scores_gemma":[0.9993919,0.00006341085,0.00009262138,0.00018067322,0.000068084104,0.00020330856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028042405,0.00026099492,0.00030708234,0.00020785785,0.0001581685,0.00019668123,0.00009180565,0.00013268167,0.0000053125304],"category_scores_gemma":[0.000042880536,0.0002396063,0.000030548556,0.00013914407,0.000039936564,0.0004542508,0.00007791572,0.00019611973,0.000024712821],"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.000113160946,0.00049124827,0.029424483,0.0033520442,0.00024030171,0.00045389734,0.012546759,0.8630063,0.082502894,0.0017393212,0.001007639,0.005121969],"study_design_scores_gemma":[0.0032738124,0.00009651033,0.048735727,0.0011517023,0.000021586846,0.000065886816,0.0040568006,0.9403732,0.00091633317,0.000008198643,0.0009197807,0.0003804756],"about_ca_topic_score_codex":0.0013317514,"about_ca_topic_score_gemma":0.000039309904,"teacher_disagreement_score":0.081586555,"about_ca_system_score_codex":0.00023590848,"about_ca_system_score_gemma":0.000011828015,"threshold_uncertainty_score":0.9770861},"labels":[],"label_agreement":null},{"id":"W2067164575","doi":"10.1109/aamas.2004.225","title":"RedAgent-2003: An Autonomous Market-Based Supply-Chain Management Agent","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction 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":"McGill University","funders":"","keywords":"Computer science; Supply chain; Competition (biology); Key (lock); Autonomous agent; Supply chain management; Order (exchange); Heuristic; Domain (mathematical analysis); Industrial organization; Risk analysis (engineering); Operations research; Business; Artificial intelligence; Computer security; Marketing; Engineering","score_opus":0.12065370169704831,"score_gpt":0.36219677373254566,"score_spread":0.24154307203549735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067164575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36665004,0.0010922215,0.5979459,0.0009584814,0.004302322,0.0068976358,0.0006851889,0.0005423421,0.020925839],"genre_scores_gemma":[0.9695865,0.000073990734,0.0050174203,0.00058254105,0.00013305417,0.0003763305,0.00004902406,0.000046598212,0.024134522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952723,0.00058539386,0.0010831554,0.0012859321,0.0011762391,0.00059698516],"domain_scores_gemma":[0.9972222,0.0001242297,0.00052502577,0.0011846505,0.00039014805,0.00055378507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024255814,0.00044083464,0.00049498543,0.00040638735,0.0008486777,0.0004432055,0.0008407523,0.00015658155,0.0006910112],"category_scores_gemma":[0.00013456716,0.00036008828,0.00014658118,0.00091137056,0.00024291418,0.0004663935,0.00022288802,0.00018650082,0.00072238746],"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.0016802874,0.01275578,0.025409013,0.0003700384,0.0023010655,0.0014535179,0.015172273,0.15561612,0.0015901886,0.43350354,0.110470705,0.23967747],"study_design_scores_gemma":[0.0120973345,0.00083788123,0.14720546,0.00035761308,0.00032260802,0.00010460302,0.026718995,0.21233413,0.00060818007,0.007231264,0.58992815,0.0022537718],"about_ca_topic_score_codex":0.00033652753,"about_ca_topic_score_gemma":0.000047616053,"teacher_disagreement_score":0.60293645,"about_ca_system_score_codex":0.00023589961,"about_ca_system_score_gemma":0.00009504773,"threshold_uncertainty_score":0.9998851},"labels":[],"label_agreement":null},{"id":"W2080977664","doi":"10.1109/aamas.2004.31","title":"A Study of Limited-Precision, Incremental Elicitation in Auctions","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction 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 Toronto","funders":"","keywords":"Computer science; Common value auction; Mathematics; Statistics","score_opus":0.23534547740435424,"score_gpt":0.41986437181124664,"score_spread":0.1845188944068924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080977664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840295,0.000091091686,0.013645161,0.000056444896,0.00037235164,0.0012816001,0.0000397538,0.000023088493,0.00046104947],"genre_scores_gemma":[0.9986912,0.000024032212,0.00043932148,0.00003775376,0.000038218495,0.00015697943,0.0000066622747,0.000011839534,0.00059402117],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9972133,0.000358005,0.00096908753,0.00052102667,0.00074990734,0.00018864137],"domain_scores_gemma":[0.9985148,0.00025552567,0.0004219202,0.0004120039,0.0002838234,0.00011193485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013886034,0.00016580937,0.0003191617,0.00044320378,0.00026737095,0.00008404146,0.00030830747,0.00007005656,0.000041585936],"category_scores_gemma":[0.00032356972,0.00013237758,0.000057336805,0.00090101897,0.00009190387,0.00037087983,0.00012631051,0.00011477811,0.00010432729],"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.0009224226,0.0321693,0.48417366,0.000068160254,0.0009906569,0.00012562629,0.18075392,0.14676654,0.012380941,0.077220015,0.0054013,0.05902745],"study_design_scores_gemma":[0.009182845,0.0009722941,0.72827977,0.00015890133,0.00007378665,0.00003432328,0.24055417,0.010844143,0.00047263235,0.005752669,0.0031756067,0.00049883715],"about_ca_topic_score_codex":0.0013601081,"about_ca_topic_score_gemma":0.0004075488,"teacher_disagreement_score":0.24410613,"about_ca_system_score_codex":0.000084939355,"about_ca_system_score_gemma":0.000031861207,"threshold_uncertainty_score":0.53982013},"labels":[],"label_agreement":null},{"id":"W2102177865","doi":"10.5555/1838206.1838528","title":"Coalition detection and identification","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Experimental Behavioral Economics Studies","field":"Social 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":"Identification (biology); Computer science; Population; Internet privacy; Public relations; Data science; Computer security; Knowledge management; Political science; Sociology","score_opus":0.07904217333949029,"score_gpt":0.3523602975403669,"score_spread":0.27331812420087664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102177865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99516016,0.0002477203,0.00045450224,0.000065697066,0.001497946,0.0006135244,0.000022699282,0.000048182897,0.0018895665],"genre_scores_gemma":[0.99797183,0.00026242554,0.00011756746,0.000029925033,0.000119713295,0.0000854741,0.00000555297,0.0000108575805,0.0013966217],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990813,0.00009810101,0.00021728613,0.000282191,0.00013544629,0.00018565421],"domain_scores_gemma":[0.99954826,0.000025223168,0.00013718793,0.00010229312,0.000072502735,0.00011451635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039910205,0.00010878177,0.0001329537,0.00005500207,0.000706804,0.00015798233,0.000068622,0.00009286345,0.000018671353],"category_scores_gemma":[0.00003424103,0.00011038684,0.000024514833,0.00005674735,0.00022481206,0.00032422866,0.0000529229,0.00009464508,0.000032257165],"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.00014007672,0.0010099388,0.29376528,0.000128715,0.00040023905,0.00002257511,0.11539141,0.000017018026,0.47068608,0.06304174,0.0014891161,0.05390782],"study_design_scores_gemma":[0.0031209623,0.00024103212,0.7952189,0.00009915631,0.00017325883,0.000018465285,0.11501788,0.012533548,0.0068288483,0.00040056335,0.065171175,0.0011761922],"about_ca_topic_score_codex":0.010891577,"about_ca_topic_score_gemma":0.004504797,"teacher_disagreement_score":0.50145364,"about_ca_system_score_codex":0.00006496662,"about_ca_system_score_gemma":0.000012749778,"threshold_uncertainty_score":0.995695},"labels":[],"label_agreement":null},{"id":"W2105888928","doi":"10.5555/2343896.2344007","title":"Detecting and identifying coalitions","year":2012,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Population; Risk analysis (engineering); Business","score_opus":0.39964016734424845,"score_gpt":0.4423090878843384,"score_spread":0.04266892054008997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105888928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9504225,0.0014170156,0.044473253,0.000064227315,0.0006872566,0.0005837023,0.00006517047,0.0000543071,0.0022325122],"genre_scores_gemma":[0.9955357,0.00004920459,0.0007338856,0.00009727835,0.00013618253,0.00007553087,0.0000035859819,0.000014878797,0.003353754],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99795514,0.00032788017,0.0004940006,0.00039998232,0.00045326393,0.00036974886],"domain_scores_gemma":[0.99847364,0.00049874425,0.00024785122,0.0003432373,0.00013682173,0.000299696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021223235,0.00016955298,0.0002526758,0.0001474619,0.00065417046,0.0003034175,0.0002215593,0.00007173748,0.000088166074],"category_scores_gemma":[0.00036626778,0.00013175755,0.000054805667,0.00027485527,0.00012468905,0.00056815584,0.00019874898,0.000117144555,0.0002660062],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001252159,0.0015700004,0.62489164,0.00017958262,0.00073034316,0.000032654727,0.052063826,0.00036182985,0.016907362,0.17304687,0.009824811,0.12026588],"study_design_scores_gemma":[0.002619103,0.00012059064,0.790402,0.00025909158,0.00019785675,0.00022083794,0.06607859,0.038963635,0.00073848746,0.0054907748,0.09380262,0.0011064362],"about_ca_topic_score_codex":0.0001847073,"about_ca_topic_score_gemma":0.000017037728,"teacher_disagreement_score":0.16755609,"about_ca_system_score_codex":0.000023365266,"about_ca_system_score_gemma":0.000009829195,"threshold_uncertainty_score":0.5372917},"labels":[],"label_agreement":null},{"id":"W2107952055","doi":"10.5555/2343896.2343940","title":"Analysis of methods for solving MDPs","year":2012,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Formal Methods in Verification","field":"Computer Science","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":"Convergence (economics); Mathematical proof; Simple (philosophy); Computer science; Mathematical optimization; Value (mathematics); Function (biology); Bellman equation; Power iteration; Markov decision process; Applied mathematics; Mathematics; Algorithm; Iterative method; Markov process; Statistics","score_opus":0.18693710335017455,"score_gpt":0.4286122566916662,"score_spread":0.24167515334149164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107952055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015751788,0.0013200291,0.98097765,0.0000070626893,0.0010752048,0.0005907039,0.000020643516,0.000042632102,0.00021426781],"genre_scores_gemma":[0.4701879,0.00003948016,0.52945966,0.000027950638,0.00003404672,0.00006580222,0.00000474426,0.000008320038,0.00017206711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982892,0.00033943998,0.00047984996,0.00034698006,0.00017178278,0.00037274076],"domain_scores_gemma":[0.99851733,0.00023609349,0.00039132373,0.00050737854,0.00018898412,0.00015890456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023207332,0.00017371553,0.00043669887,0.0003138215,0.00014311897,0.000063048945,0.00043844353,0.0000882672,0.0000054057123],"category_scores_gemma":[0.00019302584,0.00015054556,0.00016071156,0.0006275414,0.000049468155,0.00066330016,0.00018729195,0.000064629436,0.0000040208733],"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.00012456944,0.0017212216,0.13319367,0.00075396785,0.010563517,0.0000024995045,0.032540694,0.004266448,0.020910267,0.29649648,0.0010906822,0.498336],"study_design_scores_gemma":[0.00036384948,0.000058899495,0.07356718,0.000026159147,0.00031896555,0.0000020553848,0.00032480047,0.9191619,0.0010612167,0.000016555367,0.0049162763,0.0001821136],"about_ca_topic_score_codex":0.00017453585,"about_ca_topic_score_gemma":0.0000021062706,"teacher_disagreement_score":0.9148955,"about_ca_system_score_codex":0.000050664963,"about_ca_system_score_gemma":0.00001577665,"threshold_uncertainty_score":0.613907},"labels":[],"label_agreement":null},{"id":"W2111063504","doi":"10.1109/aamas.2004.142","title":"Improving Modeling of Other Agents Using Stereotypes and Compactification of Observations","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","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 Calgary","funders":"","keywords":"Stereotype (UML); Compactification (mathematics); Computer science; k-nearest neighbors algorithm; Artificial intelligence; Econometrics; Mathematics","score_opus":0.19384959096504983,"score_gpt":0.31117455534595767,"score_spread":0.11732496438090784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111063504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5357512,0.0003252101,0.46309388,0.000013415064,0.0002684948,0.0004803244,0.00002355061,0.000022247807,0.000021668193],"genre_scores_gemma":[0.9783913,0.000038076523,0.021404052,0.00002963223,0.000035719204,0.000014878359,0.0000067417614,0.000020688134,0.00005894569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998106,0.00012442567,0.0007214188,0.00046219793,0.00034629437,0.00023967757],"domain_scores_gemma":[0.998525,0.000036813904,0.0006654218,0.0003976021,0.00025916865,0.000115997915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003941456,0.00022471734,0.00038765726,0.00018942014,0.00018365945,0.00008710937,0.00026200997,0.00009801951,0.0000024273056],"category_scores_gemma":[0.000031653235,0.00020454435,0.000063188185,0.00022877599,0.000053308133,0.00070137664,0.00014391531,0.000078256875,0.0000021546105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00014010778,0.0021084056,0.13650888,0.0022412927,0.0013021415,0.00001883785,0.038933806,0.5485894,0.21906015,0.03947184,0.00007629338,0.011548856],"study_design_scores_gemma":[0.0012192723,0.00006029095,0.02443042,0.00032159957,0.000036736743,0.0000066539146,0.00059238105,0.9723502,0.000724205,0.000028991784,0.0000376305,0.00019163042],"about_ca_topic_score_codex":0.007487637,"about_ca_topic_score_gemma":0.00004825767,"teacher_disagreement_score":0.44264007,"about_ca_system_score_codex":0.000078371115,"about_ca_system_score_gemma":0.000054057495,"threshold_uncertainty_score":0.9991216},"labels":[],"label_agreement":null},{"id":"W2123268776","doi":"10.1109/aamas.2004.145","title":"Improving User Satisfaction in Agent-Based Electronic Marketplaces by Reputation Modelling and Adjustable Product Quality","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":79,"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":"Reputation; Quality (philosophy); Product (mathematics); Reinforcement learning; Purchasing; Exploit; Computer science; Value (mathematics); Business; Marketing; Computer security; Artificial intelligence; Machine learning","score_opus":0.11356323354125197,"score_gpt":0.3651636397994741,"score_spread":0.2516004062582221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123268776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6857045,0.0008196257,0.31233516,0.00008654069,0.0001592991,0.0007666867,0.00003762953,0.000034426845,0.000056106044],"genre_scores_gemma":[0.99702996,0.000118247546,0.001074105,0.00006982981,0.000036026042,0.00013097137,0.000018742083,0.000018791756,0.0015033322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969911,0.0004746495,0.00077356695,0.0008427313,0.00055139355,0.00036658166],"domain_scores_gemma":[0.9986341,0.00022767248,0.0004960765,0.00034158106,0.00017391761,0.0001266258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028361788,0.00021919484,0.00031006095,0.00020020774,0.00037384083,0.00025221566,0.00014874103,0.00008943169,0.000026412643],"category_scores_gemma":[0.00023027945,0.00018649576,0.00004681814,0.000419831,0.000089039386,0.0006878322,0.000053146974,0.00018081344,0.00002383533],"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.0009928498,0.0011429809,0.13538645,0.00027197105,0.00022796892,0.000014294246,0.0056305816,0.7454301,0.014790859,0.0200224,0.0015095616,0.07457996],"study_design_scores_gemma":[0.0067909798,0.0002518297,0.11088386,0.0002313426,0.000081685575,0.000021825175,0.0133461505,0.8519894,0.0025211985,0.004360235,0.00845,0.0010715324],"about_ca_topic_score_codex":0.004734028,"about_ca_topic_score_gemma":0.00034992275,"teacher_disagreement_score":0.31132543,"about_ca_system_score_codex":0.00020371756,"about_ca_system_score_gemma":0.0000846237,"threshold_uncertainty_score":0.76050764},"labels":[],"label_agreement":null},{"id":"W2143499977","doi":"10.1109/aamas.2004.171","title":"Model Sharing in Multiagent Systems","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","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 Saskatchewan","funders":"","keywords":"Computer science; Multi-agent system; Agent-based model; Agent-based social simulation; Distributed computing; Artificial intelligence","score_opus":0.1133346570670415,"score_gpt":0.2978018557228957,"score_spread":0.1844671986558542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143499977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30929932,0.002099033,0.6827202,0.000086265194,0.0023965256,0.0024413625,0.000035975765,0.00026001316,0.00066132424],"genre_scores_gemma":[0.99249315,0.00022077163,0.0053660953,0.00011958885,0.00011782059,0.0002684365,0.000014073771,0.00005032337,0.0013497646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959056,0.00017385521,0.0010713044,0.0013192259,0.0007108722,0.0008191474],"domain_scores_gemma":[0.9980768,0.000044618107,0.0004436043,0.00090135157,0.00016371332,0.00036989877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086255616,0.000531534,0.0006597813,0.0004259295,0.0003051436,0.0005113197,0.00094441004,0.0002341726,0.0000040388795],"category_scores_gemma":[0.00003894211,0.00048375138,0.00012678475,0.00044422294,0.000051599352,0.0011227765,0.0005208336,0.0002729954,0.000115862545],"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.000048249014,0.0013037076,0.029285971,0.00054945826,0.00031071508,0.00035568478,0.013492027,0.87407166,0.002615697,0.07542408,0.00052150275,0.0020212685],"study_design_scores_gemma":[0.0034691931,0.00007394753,0.017018143,0.00051222846,0.000016754027,0.000038052458,0.00058860565,0.9769346,0.00005994065,0.000070415845,0.00067011605,0.0005480198],"about_ca_topic_score_codex":0.0060388613,"about_ca_topic_score_gemma":0.00022414734,"teacher_disagreement_score":0.6831938,"about_ca_system_score_codex":0.00044803834,"about_ca_system_score_gemma":0.00009044474,"threshold_uncertainty_score":0.9997614},"labels":[],"label_agreement":null},{"id":"W2157501503","doi":"10.5555/1402795.1402817","title":"Cooperative search for optimizing pipeline operations","year":2008,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction 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":"TransCanada (Canada); University of Calgary","funders":"","keywords":"Computer science; Pipeline (software); State (computer science); Beam search; Search and rescue; Search algorithm; Energy (signal processing); Mathematical optimization; Distributed computing; Artificial intelligence; Algorithm","score_opus":0.34903643798788536,"score_gpt":0.42891797323251013,"score_spread":0.07988153524462477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157501503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13622598,0.00032379865,0.8589824,0.00030525558,0.00052372,0.001827035,0.00031184623,0.00005750186,0.0014424692],"genre_scores_gemma":[0.9609297,0.000111380614,0.005957823,0.00022507149,0.00017904869,0.00034441552,0.00003356839,0.000021268104,0.03219772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752647,0.00031060787,0.00066580554,0.0006462569,0.00054274383,0.00030810043],"domain_scores_gemma":[0.997942,0.0004511283,0.00012528297,0.0004077547,0.0008517957,0.00022209216],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012501447,0.00020691943,0.00034289938,0.0001728977,0.0015341664,0.00020242672,0.0003572441,0.000088270586,0.0001501959],"category_scores_gemma":[0.00029275683,0.00015447513,0.000099469464,0.0004088395,0.00022715738,0.00042095207,0.000119397904,0.0001248729,0.00025747562],"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.00071504264,0.0029694377,0.011549071,0.000073146395,0.00084280473,0.00008167937,0.047954198,0.5457987,0.009089498,0.21321052,0.14338546,0.024330422],"study_design_scores_gemma":[0.002392427,0.0001901693,0.0032974975,0.000039112343,0.000036069152,0.00007972788,0.013543319,0.9097008,0.0011140947,0.00013388958,0.06903137,0.00044153145],"about_ca_topic_score_codex":0.00015979618,"about_ca_topic_score_gemma":0.000021582895,"teacher_disagreement_score":0.85302454,"about_ca_system_score_codex":0.00004249494,"about_ca_system_score_gemma":0.000077472105,"threshold_uncertainty_score":0.9997657},"labels":[],"label_agreement":null},{"id":"W2160070657","doi":"10.5555/2772879.2773478","title":"Exploiting Objects as Artifacts in Multi-Agent Based Social Simulations: Extended Abstract","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Language and cultural evolution","field":"Social 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 Windsor","funders":"","keywords":"Artifact (error); Social learning; Computer science; Margin (machine learning); Population; Artificial intelligence; Social network (sociolinguistics); Machine learning; Knowledge management; World Wide Web; Sociology; Social media","score_opus":0.21739492152212178,"score_gpt":0.38830544025226765,"score_spread":0.17091051873014587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160070657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920022,0.0007726973,0.00090621086,0.00016105613,0.0008781544,0.00148446,0.000043877862,0.00014102606,0.003610346],"genre_scores_gemma":[0.9971093,0.000033790235,0.0003612224,0.00023548304,0.00025960748,0.0000747154,0.00004621748,0.0000260085,0.0018536745],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99728405,0.0004365084,0.00050281617,0.0004891845,0.0006792783,0.00060814637],"domain_scores_gemma":[0.9988482,0.00008925872,0.00027988796,0.00015008291,0.00027084746,0.0003617493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081470254,0.00026986332,0.00033329043,0.00014153897,0.0006562339,0.00020224301,0.00019087522,0.00021329985,0.000099024735],"category_scores_gemma":[0.00044818915,0.0002396621,0.0000898113,0.00032078184,0.00013751329,0.00063082244,0.00006133399,0.0001947145,0.0001537735],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00076086266,0.005848298,0.08076295,0.0003859048,0.00068761915,0.0012777923,0.82954055,0.026554478,0.0059455754,0.0060777413,0.0058998372,0.036258403],"study_design_scores_gemma":[0.014257684,0.00030991813,0.34824133,0.0006884409,0.00015255806,0.000009411483,0.4077354,0.20473905,0.00029103324,0.00020054901,0.021484613,0.0018899728],"about_ca_topic_score_codex":0.02018531,"about_ca_topic_score_gemma":0.0056099934,"teacher_disagreement_score":0.4218051,"about_ca_system_score_codex":0.00043178388,"about_ca_system_score_gemma":0.00022637617,"threshold_uncertainty_score":0.9863394},"labels":[],"label_agreement":null},{"id":"W2164846267","doi":"10.5555/1838206.1838479","title":"An agent communication protocol for resolving conflicts","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","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":"Protocol (science); Argumentation theory; Computer science; Persuasion; Set (abstract data type); Communications protocol; Theoretical computer science; Artificial intelligence; Epistemology; Programming language; Computer network; Social psychology","score_opus":0.1142804543862047,"score_gpt":0.37020684032688433,"score_spread":0.2559263859406796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164846267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044490814,0.00010601139,0.7347949,0.00022791098,0.0023414625,0.21644127,0.00007870739,0.00051102234,0.0010078775],"genre_scores_gemma":[0.86028695,0.000010191657,0.028530203,0.00020151315,0.00021242748,0.10972265,0.00003637753,0.000048592727,0.0009510804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726,0.00032308383,0.0007060366,0.0007933742,0.000426095,0.0004914551],"domain_scores_gemma":[0.99730766,0.00012804104,0.0005466868,0.001302361,0.00036762535,0.0003476214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011313307,0.00035557625,0.0003811093,0.00016726497,0.00066010136,0.00055867113,0.0010089335,0.0002118557,0.000020155432],"category_scores_gemma":[0.00007149742,0.00031020367,0.00010037875,0.00017476975,0.00007286555,0.0010789747,0.00023823658,0.00024674943,0.000034494282],"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.0010818975,0.011543507,0.08961641,0.004334798,0.0020257058,0.00014172788,0.08842598,0.0038037756,0.22384772,0.3876557,0.054510277,0.13301249],"study_design_scores_gemma":[0.003961466,0.00028314325,0.029047176,0.00019222342,0.000019587573,0.000020973293,0.00031675567,0.79653704,0.00062998006,0.000048250156,0.16842112,0.0005223051],"about_ca_topic_score_codex":0.00092618726,"about_ca_topic_score_gemma":0.00018758178,"teacher_disagreement_score":0.81579614,"about_ca_system_score_codex":0.00006039477,"about_ca_system_score_gemma":0.000052446117,"threshold_uncertainty_score":0.99993503},"labels":[],"label_agreement":null},{"id":"W2165274745","doi":"10.1109/aamas.2004.188","title":"Multiagent Planning as Control Synthesis","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","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":"Computer science; Distributed computing; Multi-agent system; Event (particle physics); Control (management); Relation (database); Constraint (computer-aided design); Simple (philosophy); Software; Supervisory control; Artificial intelligence; Engineering; Data mining; Programming language","score_opus":0.07099639763208417,"score_gpt":0.2985471640996341,"score_spread":0.22755076646754996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165274745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11803217,0.0024595512,0.8747199,0.00012896438,0.0018869856,0.0011761519,0.000034315348,0.0003137999,0.0012481592],"genre_scores_gemma":[0.9873607,0.000074238174,0.011333579,0.00037041595,0.00015355568,0.00021429092,0.0000024953617,0.00004421813,0.0004464729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649894,0.0002797328,0.0007288306,0.0010295989,0.0007228869,0.00074001687],"domain_scores_gemma":[0.99802047,0.00021607657,0.00037201232,0.00079950615,0.00018338974,0.00040853722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007512894,0.0004691849,0.0006141269,0.00026376746,0.00044447172,0.000407201,0.0009695783,0.00018039002,0.000009535928],"category_scores_gemma":[0.00016570512,0.00041542016,0.00014061027,0.00032090317,0.000074579206,0.00067758706,0.00034551357,0.0002155661,0.0002471623],"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.00032363532,0.0025267075,0.026535373,0.00076428294,0.0034854175,0.004140807,0.034646235,0.820695,0.0062550483,0.05714758,0.0027213467,0.040758558],"study_design_scores_gemma":[0.0053947223,0.00020810765,0.007416565,0.0011050979,0.00008923578,0.00026299732,0.0013453214,0.97713745,0.00051349314,0.000116941665,0.005425885,0.0009841772],"about_ca_topic_score_codex":0.0012393205,"about_ca_topic_score_gemma":0.00000856383,"teacher_disagreement_score":0.86932856,"about_ca_system_score_codex":0.00026351566,"about_ca_system_score_gemma":0.00010484539,"threshold_uncertainty_score":0.99982977},"labels":[],"label_agreement":null},{"id":"W2169619645","doi":"10.5555/2484920.2485084","title":"Smart exploration in reinforcement learning using absolute temporal difference errors","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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":"","keywords":"Reinforcement learning; Temporal difference learning; Computer science; State (computer science); Function (biology); Artificial intelligence; Function approximation; Control (management); Machine learning; Algorithm; Artificial neural network","score_opus":0.10786902931368043,"score_gpt":0.29261669850862043,"score_spread":0.18474766919494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169619645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19021417,0.00009192763,0.80751556,0.00004357572,0.00065648585,0.0010363704,5.4796874e-7,0.00009644435,0.00034494352],"genre_scores_gemma":[0.98867625,0.00006678287,0.0075289807,0.000087236214,0.000039929088,0.00010096997,0.000013319356,0.000025036648,0.0034614785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973987,0.00024853885,0.0006908059,0.000579794,0.00051942316,0.0005627802],"domain_scores_gemma":[0.99879235,0.00005292565,0.00041341243,0.0004035714,0.00014936985,0.00018839812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040137747,0.00032611203,0.00034950432,0.0002562618,0.00028385973,0.00042298902,0.00047226055,0.00011409763,0.000018984176],"category_scores_gemma":[0.000053513948,0.00029877533,0.00004944437,0.0003205286,0.000058721984,0.00142779,0.00041003432,0.00029259428,0.00010844462],"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.0000063530565,0.000053837342,0.03842801,0.00005249882,0.000057399055,0.00001976851,0.0036247906,0.95502543,0.00065677223,0.0008062542,0.00012522622,0.0011436484],"study_design_scores_gemma":[0.0008635098,0.00016043265,0.043647103,0.00019243409,0.000008756949,0.0000060316706,0.00079188094,0.95343333,0.000026982183,0.000012293648,0.0005362582,0.00032097168],"about_ca_topic_score_codex":0.00421482,"about_ca_topic_score_gemma":0.000032241234,"teacher_disagreement_score":0.79998654,"about_ca_system_score_codex":0.00019103264,"about_ca_system_score_gemma":0.000048797912,"threshold_uncertainty_score":0.9999464},"labels":[],"label_agreement":null},{"id":"W2181417941","doi":"","title":"One-Sided Matching with Dynamic Preferences (Doctoral Consortium)","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Matching (statistics); Computer science; Set (abstract data type); Resource allocation; Optimal matching; Function (biology); Scheduling (production processes); Dynamic decision-making; Mechanism design; Mathematical optimization; Artificial intelligence; Mathematical economics; Economics; Mathematics","score_opus":0.19683862078797457,"score_gpt":0.28583406160738745,"score_spread":0.08899544081941288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181417941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9791884,0.002329112,0.008994284,0.000035880665,0.0010966249,0.00085165614,0.00019035637,0.00010242258,0.0072113033],"genre_scores_gemma":[0.9941095,0.000059580947,0.00064593164,0.00007350931,0.000086018925,0.00007290951,0.000026490561,0.000046793466,0.004879253],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978339,0.00013781026,0.0007675038,0.0006659129,0.00012653846,0.00046835316],"domain_scores_gemma":[0.99852586,0.000071741604,0.00063815544,0.00035774172,0.000095147756,0.00031138308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010047015,0.0003171711,0.0007034141,0.00018215373,0.00018329805,0.00021947338,0.00026428947,0.00013429548,0.000041663097],"category_scores_gemma":[0.00007132544,0.00029732578,0.00006766044,0.00016293957,0.00012534272,0.00036649924,0.000094683615,0.00018567815,0.00036144542],"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.00091568386,0.0017602213,0.67616284,0.00080015545,0.0028750477,0.00015789058,0.03316357,0.0054507777,0.00021660747,0.27415353,0.0016688,0.0026748597],"study_design_scores_gemma":[0.028906057,0.0037677311,0.5970475,0.0042715133,0.00038654296,0.00030605515,0.04656102,0.24699576,0.00012169865,0.024752172,0.040397577,0.006486388],"about_ca_topic_score_codex":0.0028280392,"about_ca_topic_score_gemma":0.00016188117,"teacher_disagreement_score":0.24940136,"about_ca_system_score_codex":0.00011959584,"about_ca_system_score_gemma":0.000035124234,"threshold_uncertainty_score":0.9999479},"labels":[],"label_agreement":null},{"id":"W2182474583","doi":"10.5555/2772879.2772886","title":"Decision-theoretic Clustering of Strategies","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Gambling Behavior and Treatments","field":"Psychology","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 Waterloo; University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Constrained clustering; Greedy algorithm; Metric (unit); Correlation clustering; Mathematical optimization; Artificial intelligence; Machine learning; Data mining; Mathematics; CURE data clustering algorithm; Algorithm","score_opus":0.24976908939266285,"score_gpt":0.4187938455534094,"score_spread":0.16902475616074658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182474583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715986,0.0012860746,0.016757421,0.0000063188513,0.0027222596,0.0006820042,0.00007204599,0.000057346257,0.0068179183],"genre_scores_gemma":[0.9966406,0.00003143542,0.0010915138,0.000016731154,0.00004807918,0.000066164685,0.0000132129635,0.000035260095,0.0020569568],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99834746,0.00015851483,0.00044390684,0.0004145792,0.00030718237,0.00032838524],"domain_scores_gemma":[0.9989501,0.0000716053,0.00020488189,0.00037466182,0.00015994978,0.00023877426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030522578,0.0002500716,0.0003762729,0.00013821054,0.00007924324,0.00006624263,0.00017840369,0.00012975295,0.00009851574],"category_scores_gemma":[0.000023727536,0.00020216171,0.000074318494,0.00012391791,0.00012348936,0.00014343666,0.00010228231,0.00009607287,0.00014458645],"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.003077884,0.008695107,0.7264142,0.00047163016,0.004259768,0.002006987,0.09682046,0.004961812,0.0009181739,0.049913198,0.013027086,0.08943368],"study_design_scores_gemma":[0.027039709,0.002632313,0.83514374,0.000983245,0.0008656881,0.0003378243,0.09111179,0.030940523,0.00012455077,0.0009443609,0.008310519,0.0015657587],"about_ca_topic_score_codex":0.0016908568,"about_ca_topic_score_gemma":0.000042821892,"teacher_disagreement_score":0.1087295,"about_ca_system_score_codex":0.00004964239,"about_ca_system_score_gemma":0.000036270958,"threshold_uncertainty_score":0.82439154},"labels":[],"label_agreement":null},{"id":"W2182604253","doi":"","title":"On Ability to Autonomously Execute Agent Programs with Sensing — Extended Abstract","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","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; University of Toronto","funders":"","keywords":"Computer science; Deliberation; Set (abstract data type); Programming language; Semantics (computer science); Answer set programming; State (computer science); Situation calculus; Artificial intelligence; Theoretical computer science","score_opus":0.04886104234643238,"score_gpt":0.27673081927630583,"score_spread":0.22786977692987345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182604253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73031837,0.00022407463,0.2611887,0.00013448567,0.0012197384,0.0025613646,0.000013317545,0.00040093288,0.0039390153],"genre_scores_gemma":[0.9843619,0.000013976499,0.01442525,0.00025785292,0.00008751104,0.00006292649,0.0000072656103,0.00003364905,0.0007496836],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9970223,0.00011496596,0.0004629366,0.0011590647,0.00051826134,0.0007225107],"domain_scores_gemma":[0.99816567,0.000055325414,0.00023885719,0.00078388886,0.00022228932,0.0005339713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048004708,0.0004713239,0.0004675853,0.00013734226,0.00037669748,0.00044038208,0.0005216388,0.0001248017,0.0000056321282],"category_scores_gemma":[0.00004095025,0.00034649266,0.00010643286,0.00032743497,0.00009856452,0.00037019933,0.0002561222,0.00021592442,0.00017760441],"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.0013233953,0.015303855,0.013349175,0.0012214483,0.0024754864,0.0056927283,0.11699008,0.039695133,0.0047944034,0.15270224,0.0032295983,0.64322245],"study_design_scores_gemma":[0.026538044,0.013065245,0.6452294,0.004371793,0.0003612261,0.0009930024,0.006026462,0.25933522,0.0022926668,0.0024265728,0.032169953,0.007190432],"about_ca_topic_score_codex":0.0010273475,"about_ca_topic_score_gemma":0.00016313963,"teacher_disagreement_score":0.636032,"about_ca_system_score_codex":0.00032228514,"about_ca_system_score_gemma":0.00012599646,"threshold_uncertainty_score":0.99989873},"labels":[],"label_agreement":null},{"id":"W2185548553","doi":"10.5555/2615731.2615791","title":"Reputation-aware task allocation for human trustees","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Reputation; Task (project management); Computer science; Workload; Delegation; Crowdsourcing; Resource allocation; Operations research; Economics; Computer network; World Wide Web; Mathematics","score_opus":0.04947797062188094,"score_gpt":0.2924733497182121,"score_spread":0.24299537909633115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185548553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09325492,0.0001407629,0.904435,0.000081079714,0.00076057605,0.0007977804,0.000011125106,0.00015207831,0.00036672832],"genre_scores_gemma":[0.9925984,0.0000093719855,0.005027448,0.00017173325,0.00015733516,0.000114844,0.000026931782,0.000023916195,0.0018699877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982788,0.00016139889,0.00038453098,0.00060605665,0.00024376315,0.00032543772],"domain_scores_gemma":[0.99882853,0.00010955403,0.00024153592,0.00045549226,0.00021923953,0.0001456249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005587741,0.00021914525,0.00026471014,0.00010624847,0.0005378046,0.00033891885,0.0003054861,0.00009297681,0.0000023505256],"category_scores_gemma":[0.00005948356,0.00019943427,0.000074803764,0.00010726278,0.00004670738,0.0003299899,0.00010215838,0.000076633194,0.000016795335],"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.00018415535,0.0022903439,0.027318202,0.0023651607,0.0017957708,0.000080346996,0.062857784,0.047662355,0.03644472,0.35111833,0.03744551,0.43043733],"study_design_scores_gemma":[0.0014451034,0.00021413183,0.00871352,0.00017976397,0.000032259584,0.000016196404,0.0006635374,0.9708052,0.00029580222,0.00022861798,0.017041316,0.0003645129],"about_ca_topic_score_codex":0.00040271162,"about_ca_topic_score_gemma":0.000032920703,"teacher_disagreement_score":0.9231429,"about_ca_system_score_codex":0.000049961283,"about_ca_system_score_gemma":0.000021456575,"threshold_uncertainty_score":0.8132694},"labels":[],"label_agreement":null},{"id":"W2190606234","doi":"10.5555/2936924.2936996","title":"State of the Art Control of Atari Games Using Shallow Reinforcement Learning","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":56,"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":"Reinforcement learning; Computer science; Benchmark (surveying); Representation (politics); Artificial intelligence; Set (abstract data type); Strengths and weaknesses; Simple (philosophy); Key (lock); Artificial neural network; Feature learning; Machine learning","score_opus":0.04777979186199204,"score_gpt":0.2658761195988801,"score_spread":0.21809632773688803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190606234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050363656,0.0001757146,0.9479423,0.000039669387,0.0005319819,0.0006639892,0.000005972487,0.000029415032,0.00024727706],"genre_scores_gemma":[0.9947135,0.00009203773,0.0016289494,0.00004644096,0.000019934329,0.000011730282,0.0000010307002,0.00001693143,0.003469455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779034,0.00025492578,0.0006700302,0.00034907128,0.00058349804,0.0003521264],"domain_scores_gemma":[0.9981955,0.00013612019,0.00081560365,0.0005317581,0.00022418995,0.00009679316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052271097,0.00022492904,0.00038640344,0.00009769399,0.00015125652,0.000059257316,0.0006308009,0.000054532775,0.0000082491515],"category_scores_gemma":[0.00009829664,0.00013250689,0.00011320847,0.00017235176,0.00014066712,0.00042951145,0.00039655645,0.00011814454,0.000013191845],"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.00002873874,0.00004502024,0.037428465,0.00008640031,0.00030138262,0.000005115685,0.0012895962,0.94823545,0.007769123,0.0011858004,0.00007662026,0.0035483064],"study_design_scores_gemma":[0.0018921403,0.00018039558,0.012169218,0.0006079295,0.00003565308,0.0000052535484,0.00011524757,0.98184663,0.0007525636,0.000006083937,0.002207422,0.00018147426],"about_ca_topic_score_codex":0.00024973557,"about_ca_topic_score_gemma":0.0000063140183,"teacher_disagreement_score":0.9463134,"about_ca_system_score_codex":0.00007828774,"about_ca_system_score_gemma":0.000060895745,"threshold_uncertainty_score":0.5403474},"labels":[],"label_agreement":null},{"id":"W2207815291","doi":"10.5555/2772879.2773387","title":"Quality and Budget Aware Task Allocation for Spatial Crowdsourcing","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Crowdsourcing; Reputation; Computer science; Task (project management); Quality (philosophy); Field (mathematics); Budget constraint; Trustworthiness; Computer security; World Wide Web; Engineering; Economics; Microeconomics","score_opus":0.11764615710736107,"score_gpt":0.32829033621983045,"score_spread":0.21064417911246938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207815291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18861397,0.0005550627,0.80863035,0.0001576255,0.000929346,0.0008242006,0.000028683207,0.00012040187,0.00014036767],"genre_scores_gemma":[0.993108,0.000021744556,0.005784993,0.00021088103,0.00017974467,0.00007757151,0.000017832863,0.00002532646,0.0005739085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780667,0.0002464427,0.00047523607,0.00071222516,0.00034838423,0.00041103308],"domain_scores_gemma":[0.99847704,0.00012591349,0.00027715837,0.00044261682,0.0003255557,0.00035171115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011406122,0.00027583382,0.0003736472,0.00010159897,0.00035252605,0.0004081026,0.00027249777,0.00012371383,8.393608e-7],"category_scores_gemma":[0.00013995274,0.00025116495,0.000062259765,0.00012731536,0.00007523593,0.0003939093,0.00023433228,0.000111158464,0.000008975973],"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.0010290392,0.0027177993,0.18490009,0.0031101997,0.0023558312,0.00027797252,0.1238473,0.025218286,0.01831085,0.04729099,0.045313194,0.5456284],"study_design_scores_gemma":[0.0031491155,0.0002473766,0.031000275,0.00018638543,0.000037445654,0.00004533188,0.0022112702,0.95090055,0.00024100934,0.00013103634,0.011277998,0.00057220703],"about_ca_topic_score_codex":0.0026028876,"about_ca_topic_score_gemma":0.0000899623,"teacher_disagreement_score":0.92568225,"about_ca_system_score_codex":0.00008425104,"about_ca_system_score_gemma":0.00007002073,"threshold_uncertainty_score":0.99999404},"labels":[],"label_agreement":null},{"id":"W2220059168","doi":"10.5555/2772879.2773464","title":"Voting with Social Influence: Using Arguments to Uncover Ground Truth","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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":"Ground truth; Voting; Estimator; Computer science; Social network (sociolinguistics); Class (philosophy); Social choice theory; Artificial intelligence; Mathematical economics; Mathematics; Social media; Political science; Statistics; Law","score_opus":0.08594709231979451,"score_gpt":0.32997753807344793,"score_spread":0.2440304457536534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220059168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853276,0.000033122888,0.012524122,0.000017764823,0.0006099879,0.00059762306,0.00011150385,0.000025010648,0.00075327826],"genre_scores_gemma":[0.99813575,9.4812515e-7,0.00072303205,0.0001165081,0.00031122172,0.00003873241,0.000019796202,0.000036532474,0.0006174579],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99827844,0.00010101273,0.0003435845,0.00043719012,0.0004015943,0.000438202],"domain_scores_gemma":[0.9990162,0.000023160623,0.00023102274,0.00013841261,0.00026076642,0.00033038534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002478187,0.00028814524,0.0003487731,0.000073428586,0.00039986704,0.00024395657,0.00016799108,0.000067200875,0.000013005704],"category_scores_gemma":[0.000010124616,0.0002479243,0.00005878911,0.00021387261,0.00007375494,0.0003550998,0.00013914365,0.0001410897,0.000032682117],"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.00026989388,0.0007955443,0.8820356,0.00009227993,0.001289886,0.000039844406,0.024254382,0.033516664,0.00035907986,0.052655227,0.00086883927,0.0038227614],"study_design_scores_gemma":[0.015573015,0.0010290907,0.51928514,0.0010509678,0.00042892765,0.00001637794,0.052764684,0.388215,0.00006407481,0.0007810154,0.01726088,0.0035308343],"about_ca_topic_score_codex":0.005271079,"about_ca_topic_score_gemma":0.000016650067,"teacher_disagreement_score":0.36275047,"about_ca_system_score_codex":0.00013032007,"about_ca_system_score_gemma":0.00009727743,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W2257265444","doi":"10.5555/2034396.2034511","title":"SR-APL: a model for a programming language for rational BDI agents with prioritized goals","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","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":"Deliberation; Computer science; Rationality; Declarative programming; Plan (archaeology); Programming language; Artificial intelligence; Knowledge management; Programming paradigm; Inductive programming; Epistemology","score_opus":0.1285531246108941,"score_gpt":0.310251174366983,"score_spread":0.18169804975608891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257265444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038956508,0.00039891797,0.95341897,0.000040115017,0.0006227487,0.006057269,0.00017807345,0.00018206262,0.00014535685],"genre_scores_gemma":[0.8309045,0.000023157972,0.16391186,0.00014127632,0.00014115428,0.0019269382,0.000074006355,0.00005728454,0.0028198552],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996991,0.0001348143,0.0007046687,0.0009760159,0.0005014875,0.00069201377],"domain_scores_gemma":[0.9981552,0.00009588844,0.0005331693,0.00052034407,0.00040192285,0.0002934942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069699174,0.00045440358,0.0005564601,0.00018785294,0.00046670524,0.00027992256,0.00053730595,0.00016632696,0.000009074235],"category_scores_gemma":[0.000057669047,0.00036757014,0.00017528194,0.00019949973,0.00005922715,0.0007872132,0.00014618026,0.000103360486,0.000012885729],"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.0062305355,0.013406056,0.05620624,0.0089546675,0.009333673,0.00046505424,0.44329605,0.010347965,0.010103821,0.22517763,0.037221666,0.17925665],"study_design_scores_gemma":[0.00589041,0.00035507523,0.0046931743,0.00024535164,0.00008046829,0.000019906873,0.0009625597,0.9837708,0.00012335865,0.000049256003,0.003275579,0.00053406315],"about_ca_topic_score_codex":0.00041221455,"about_ca_topic_score_gemma":0.00012740542,"teacher_disagreement_score":0.9734228,"about_ca_system_score_codex":0.000110382614,"about_ca_system_score_gemma":0.000119189426,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W2273410534","doi":"10.5555/2615731.2617504","title":"Modeling agent trustworthiness with credibility for message recommendation in social networks","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Access Control and Trust","field":"Social 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":"Credibility; Computer science; Trustworthiness; Recommender system; Similarity (geometry); Source credibility; Multi-agent system; World Wide Web; Internet privacy; Artificial intelligence","score_opus":0.09187409978039231,"score_gpt":0.3414822652082259,"score_spread":0.2496081654278336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273410534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3599719,0.00032881202,0.63028187,0.00054008985,0.0012782216,0.003143894,0.00006227739,0.0001132572,0.004279653],"genre_scores_gemma":[0.9982437,0.00008234686,0.00033048904,0.00013527815,0.0005544193,0.0002578725,0.00004359204,0.0000213755,0.00033091646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.0004682997,0.00041075543,0.00048824967,0.00026860196,0.00048144255],"domain_scores_gemma":[0.999228,0.00012359995,0.00018804328,0.0001255753,0.00019076522,0.0001440201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016879832,0.00021550873,0.00038545448,0.00008112032,0.0008904341,0.00016777155,0.00018356612,0.00016489018,0.00002307158],"category_scores_gemma":[0.00008905531,0.00017771871,0.00006656124,0.00019255377,0.000104812294,0.00039330334,0.000054133634,0.00014791076,0.0000023340972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0021554863,0.0018675434,0.26568428,0.0004170085,0.00083531655,0.000019536265,0.04761667,0.35159564,0.0000110719575,0.076749705,0.0018704138,0.2511773],"study_design_scores_gemma":[0.0025678612,0.00006368012,0.018014032,0.000062995816,0.000043512155,3.8525363e-7,0.0037820267,0.9691888,2.913402e-7,0.00007376714,0.005955501,0.00024713454],"about_ca_topic_score_codex":0.007671809,"about_ca_topic_score_gemma":0.005119307,"teacher_disagreement_score":0.6382718,"about_ca_system_score_codex":0.00013126263,"about_ca_system_score_gemma":0.00004644402,"threshold_uncertainty_score":0.9989362},"labels":[],"label_agreement":null},{"id":"W2286609364","doi":"10.5555/2034396.2034427","title":"Basis function discovery using spectral clustering and bisimulation metrics","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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; Markov decision process; Cluster analysis; Set (abstract data type); Bellman equation; State space; Feature (linguistics); Function (biology); Artificial intelligence; State (computer science); Markov process; Feature vector; Basis (linear algebra); Markov chain; Focus (optics); Machine learning; Quality (philosophy); Mathematical optimization; Algorithm; Mathematics","score_opus":0.14918220564433027,"score_gpt":0.28652763876973,"score_spread":0.1373454331253997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286609364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12833378,0.00026557516,0.8696133,0.0000036020547,0.0009960233,0.00037077474,0.0000026693733,0.000063598425,0.00035067543],"genre_scores_gemma":[0.9788097,0.00009338306,0.020390544,0.000048505346,0.000063030864,0.000006573576,0.00000332187,0.000018997582,0.0005659135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984564,0.00011411441,0.00034914282,0.00045685412,0.00031192502,0.0003115565],"domain_scores_gemma":[0.9992169,0.000048668433,0.00024215119,0.00029133083,0.00007817714,0.00012274449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030954406,0.00021770186,0.00022460305,0.00025203536,0.000253276,0.00033366322,0.00020691496,0.00008396067,0.0000046092073],"category_scores_gemma":[0.00003305678,0.00019780599,0.000045355846,0.00031790385,0.00004314338,0.0013424325,0.0003038566,0.000115363444,0.000008150586],"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.00012404373,0.00026796898,0.19966733,0.00031111191,0.0007124136,0.00008396649,0.009321653,0.7661524,0.0013734722,0.0076108496,0.00014433397,0.01423049],"study_design_scores_gemma":[0.00059911836,0.00013990465,0.0693329,0.000066407985,0.000041888412,0.000012732263,0.00025071614,0.92907757,0.000054034397,0.000011110762,0.00020019917,0.0002134316],"about_ca_topic_score_codex":0.0006761878,"about_ca_topic_score_gemma":0.000008371321,"teacher_disagreement_score":0.85047597,"about_ca_system_score_codex":0.00008098525,"about_ca_system_score_gemma":0.000018259052,"threshold_uncertainty_score":0.8066294},"labels":[],"label_agreement":null},{"id":"W2288689989","doi":"10.5555/2615731.2616084","title":"Correlated multi-dimensional qos metrics for trust evaluation within web services","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Access Control and Trust","field":"Social 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":"Concordia University","funders":"","keywords":"Quality of service; Computer science; Reputation; Mobile QoS; Web service; Service (business); Latent Dirichlet allocation; Selection (genetic algorithm); Service provider; Dirichlet distribution; Task (project management); Computer network; Data mining; World Wide Web; Information retrieval; Topic model; Mathematics; Machine learning","score_opus":0.09265999085829293,"score_gpt":0.3506057261559008,"score_spread":0.2579457352976079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288689989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95917743,0.0026257779,0.017350337,0.0002499706,0.009017084,0.0071382215,0.00026409223,0.00025667148,0.0039204303],"genre_scores_gemma":[0.99470145,0.00005430279,0.0011312024,0.00024452596,0.0003896484,0.0002579555,0.00007281867,0.000031046857,0.0031170642],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700356,0.00062169635,0.0005103886,0.0005472258,0.0008578405,0.00045926552],"domain_scores_gemma":[0.9980682,0.00028312337,0.00044798775,0.00020455768,0.0007209521,0.00027515285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002529974,0.00026884736,0.00039572298,0.00019156444,0.0010211193,0.00022018598,0.00028685262,0.000240463,0.00007436358],"category_scores_gemma":[0.00036584926,0.00022623254,0.00010390608,0.00034845594,0.00013602567,0.00043792863,0.00007755905,0.00013717929,0.00006447821],"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.0023499946,0.006609926,0.59713227,0.0016573566,0.0061102686,0.00006162249,0.122364774,0.0463039,0.0031954607,0.075984895,0.015605688,0.122623876],"study_design_scores_gemma":[0.0049771257,0.00009960943,0.018713543,0.00009740044,0.00021397947,0.0000011809528,0.0040535824,0.95277536,0.000008866142,0.00003630115,0.018717349,0.00030571196],"about_ca_topic_score_codex":0.0056173126,"about_ca_topic_score_gemma":0.001645822,"teacher_disagreement_score":0.90647143,"about_ca_system_score_codex":0.00013980024,"about_ca_system_score_gemma":0.00013363111,"threshold_uncertainty_score":0.92254955},"labels":[],"label_agreement":null},{"id":"W2290471876","doi":"10.5555/2615731.2615789","title":"A logical theory of robot localization","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","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":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Robot; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Task (project management); Domain (mathematical analysis); Extension (predicate logic); Action (physics); Logical conjunction; Theoretical computer science; Mathematics; Programming language; Engineering; Machine learning; Systems engineering","score_opus":0.060617050818150615,"score_gpt":0.27013361654936147,"score_spread":0.20951656573121086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290471876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00977846,0.0005986213,0.9837585,0.0000135085,0.00065089104,0.0003499826,0.0000039803176,0.00007369015,0.0047723763],"genre_scores_gemma":[0.9957339,0.00005886996,0.0025937231,0.00012321633,0.00008068187,0.000021826987,0.0000045910074,0.000011603673,0.0013715528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982403,0.000426234,0.00034421074,0.00045067296,0.00025817758,0.0002804091],"domain_scores_gemma":[0.9989684,0.00012339828,0.00022173987,0.00036931364,0.00016468423,0.00015241813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067301036,0.00019808052,0.00032534995,0.00008286768,0.00015038595,0.00008520986,0.00043599078,0.00010960399,0.00001526936],"category_scores_gemma":[0.00011122344,0.00014530499,0.00007300517,0.00018477417,0.00010048219,0.00022748664,0.00024630767,0.00008095968,0.000049250175],"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.000062217645,0.00088885607,0.024395669,0.00021296472,0.00026264729,0.000027843962,0.0069060177,0.0032561787,0.00061285135,0.91789204,0.0017786153,0.04370407],"study_design_scores_gemma":[0.0015031181,0.0003542011,0.03723232,0.00014095454,0.000032556087,0.000020178726,0.00033699576,0.94856924,0.00019488217,0.0013947017,0.009869374,0.0003514632],"about_ca_topic_score_codex":0.00010002217,"about_ca_topic_score_gemma":0.000007624856,"teacher_disagreement_score":0.9859555,"about_ca_system_score_codex":0.000028221977,"about_ca_system_score_gemma":0.000021002346,"threshold_uncertainty_score":0.59253657},"labels":[],"label_agreement":null},{"id":"W2293023860","doi":"10.5555/2772879.2773541","title":"Emotional Interactions between Artificial Companion Agents and the Elderly","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Innovative Human-Technology Interaction","field":"Computer Science","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":"Economic shortage; Bridge (graph theory); Population; Psychology; Computer science; Applied psychology; Artificial intelligence; Medicine; Environmental health","score_opus":0.16526824575205465,"score_gpt":0.3399170186184293,"score_spread":0.17464877286637467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293023860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6786213,0.00017489852,0.31372362,0.0013746257,0.0034229942,0.0011990045,0.00004369142,0.00020372572,0.001236153],"genre_scores_gemma":[0.9970963,0.000014945398,0.0013850434,0.00018996916,0.00024265875,0.000072363146,0.000025394575,0.000017586071,0.00095574046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774134,0.00039877498,0.00054225174,0.00056807284,0.00041288126,0.00033665943],"domain_scores_gemma":[0.99852705,0.00015607309,0.00036948314,0.0003996408,0.00040506062,0.00014269003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006996644,0.00027824726,0.00035667178,0.00024262267,0.0004963218,0.00033165785,0.00047201826,0.000120394645,0.000013110297],"category_scores_gemma":[0.00009519628,0.00020764918,0.00006210778,0.00030481792,0.00030531522,0.00084046915,0.0003983702,0.0003778445,0.00011970594],"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.000582408,0.0018557062,0.09974833,0.00017210784,0.0032960635,0.0001921102,0.034886185,0.0008912756,0.0011439539,0.67359686,0.064772785,0.11886221],"study_design_scores_gemma":[0.0099793775,0.0009283851,0.27204615,0.00047274915,0.00018442245,0.0003445198,0.0077247685,0.6409013,0.0003588635,0.0046765567,0.06117507,0.0012078176],"about_ca_topic_score_codex":0.0005232437,"about_ca_topic_score_gemma":0.000047179634,"teacher_disagreement_score":0.6689203,"about_ca_system_score_codex":0.00014296062,"about_ca_system_score_gemma":0.000043805678,"threshold_uncertainty_score":0.84676874},"labels":[],"label_agreement":null},{"id":"W2293507961","doi":"10.5555/2772879.2773548","title":"One-Sided Matching with Dynamic Preferences","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Matching (statistics); Computer science; Set (abstract data type); Function (biology); Resource allocation; Scheduling (production processes); Sequential game; Mechanism design; Optimal matching; Contrast (vision); Game theory; Mathematical optimization; Mathematical economics; Artificial intelligence; Economics; Mathematics","score_opus":0.16363275091144538,"score_gpt":0.2740471760258787,"score_spread":0.1104144251144333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293507961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96693975,0.0024217202,0.016070949,0.00004501442,0.0010459893,0.00085740385,0.00015392092,0.00010432514,0.012360907],"genre_scores_gemma":[0.99356234,0.000063800864,0.0007463915,0.000067445624,0.000080125785,0.00006956376,0.00002108415,0.000043865715,0.005345411],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99810284,0.000113264716,0.00064960483,0.0006090512,0.00011188327,0.00041332806],"domain_scores_gemma":[0.99872243,0.00006100225,0.0005331268,0.0003358002,0.000078544974,0.000269076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009922164,0.00027963865,0.0006087131,0.00016927281,0.00017098688,0.00018950463,0.00024968942,0.00011985536,0.000030192246],"category_scores_gemma":[0.00006067974,0.0002601006,0.000057762492,0.00015569812,0.00008585756,0.00033758293,0.00008856243,0.00016346756,0.0003929615],"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.0010248078,0.0023454567,0.47379324,0.0011278423,0.0037737528,0.00017492656,0.06104506,0.009063665,0.00023357126,0.43971673,0.002324186,0.0053767688],"study_design_scores_gemma":[0.027734114,0.0037898591,0.48793563,0.0044261306,0.00033839775,0.0002822982,0.05672893,0.3242237,0.00009923174,0.038913824,0.049127776,0.0064000967],"about_ca_topic_score_codex":0.0023470754,"about_ca_topic_score_gemma":0.00012762034,"teacher_disagreement_score":0.4008029,"about_ca_system_score_codex":0.00010669548,"about_ca_system_score_gemma":0.000025629575,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2295665692","doi":"10.5555/2034396.2034406","title":"Efficient planning in R-max","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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 Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Mathematical optimization; Markov decision process; Value (mathematics); Artificial intelligence; Algorithm; Machine learning; Mathematics; Markov process","score_opus":0.12420306409074311,"score_gpt":0.2922210493630056,"score_spread":0.16801798527226247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295665692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12270224,0.00041306223,0.8687607,0.000011317719,0.0012011789,0.0006809322,0.000002480599,0.00012166927,0.0061064237],"genre_scores_gemma":[0.98909694,0.00001631232,0.009579816,0.00009156671,0.000028606688,0.000033327186,0.0000019193765,0.000017700742,0.0011338238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810076,0.00014237272,0.0004327447,0.000508761,0.00034721775,0.00046816777],"domain_scores_gemma":[0.9991097,0.000046265293,0.0002006228,0.0004206666,0.00006413563,0.00015863072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042251803,0.00023463389,0.00026968287,0.00020774035,0.00013801084,0.000114041955,0.0005529722,0.00008858023,0.000011621731],"category_scores_gemma":[0.00003259089,0.00020878576,0.000046026882,0.00026052014,0.00005130504,0.00017912613,0.0003597204,0.00018314294,0.00009271448],"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.000030323103,0.00034852253,0.09871728,0.000088483765,0.00014194654,0.00040542154,0.028145386,0.85856813,0.00012663633,0.011050082,0.0006090404,0.0017687627],"study_design_scores_gemma":[0.0008460768,0.000105486295,0.082523204,0.00015895507,0.000006765047,0.000012160609,0.0006013604,0.91456467,0.000031554224,0.0000055886926,0.00090606976,0.0002381151],"about_ca_topic_score_codex":0.0005488077,"about_ca_topic_score_gemma":0.000003993842,"teacher_disagreement_score":0.8663947,"about_ca_system_score_codex":0.000078637466,"about_ca_system_score_gemma":0.000027432681,"threshold_uncertainty_score":0.8514036},"labels":[],"label_agreement":null},{"id":"W2399400183","doi":"10.5555/2615731.2616114","title":"An agent-based game for the predictive diagnosis of parkinson's disease","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","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":"University of British Columbia","funders":"","keywords":"Disease; Computer science; Dimension (graph theory); Parkinson's disease; Artificial intelligence; Psychology; Medicine; Pathology","score_opus":0.049102521491156646,"score_gpt":0.3015570224745988,"score_spread":0.2524545009834422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399400183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914613,0.003597511,0.0959218,0.00021357779,0.0009659889,0.00587211,0.0017299457,0.00011308094,0.00012469408],"genre_scores_gemma":[0.99636775,0.0002935711,0.00062117144,0.00039684708,0.00017439929,0.0016377082,0.00015109312,0.00006155594,0.00029587673],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99787766,0.00020746802,0.00040975012,0.00063802855,0.00045178118,0.00041532214],"domain_scores_gemma":[0.9979458,0.00025992782,0.00029992347,0.0006139662,0.00023883817,0.00064158015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035113332,0.00036657447,0.0005350933,0.000118014286,0.00023257169,0.000048596437,0.00018534766,0.00009703527,0.00003598085],"category_scores_gemma":[0.00012367294,0.00024315817,0.00023945808,0.00012480214,0.00013793832,0.00012783801,0.000045389068,0.00008943386,0.000011328595],"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.0058383415,0.008379606,0.9379359,0.0012987212,0.0035824005,0.00015541153,0.0013666188,0.0031624716,0.0004276664,0.0015503195,0.0031349107,0.03316767],"study_design_scores_gemma":[0.006988733,0.0012252125,0.5645131,0.00032528784,0.0012443566,0.000002827778,0.00040341774,0.3680252,0.0002736729,0.000024357785,0.056738414,0.00023539692],"about_ca_topic_score_codex":0.0003384327,"about_ca_topic_score_gemma":0.000013783528,"teacher_disagreement_score":0.37342274,"about_ca_system_score_codex":0.00008112643,"about_ca_system_score_gemma":0.000087866305,"threshold_uncertainty_score":0.99157023},"labels":[],"label_agreement":null},{"id":"W2404625657","doi":"10.5555/2615731.2616149","title":"Imputation, social choice, and partial preferences","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Imputation (statistics); Missing data; Conceptualization; Computer science; Artificial intelligence; Machine learning; Preference; Social choice theory; Statistics; Mathematics","score_opus":0.09478026045088839,"score_gpt":0.2753525177555754,"score_spread":0.180572257304687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404625657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9763652,0.0011395193,0.0141585935,0.00006984799,0.0012298323,0.00057327957,0.00013223343,0.00006743336,0.006264055],"genre_scores_gemma":[0.99718004,0.000051046452,0.000099794204,0.000092096,0.00037300916,0.000050238315,0.0000144875385,0.00002381245,0.0021154631],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998412,0.00013463726,0.00058118504,0.0005003519,0.000060435057,0.00031136026],"domain_scores_gemma":[0.99916977,0.00008914514,0.00042506316,0.0001424769,0.000045248773,0.00012831633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411097,0.00021330186,0.0004546896,0.000110726985,0.00033848613,0.00017193894,0.00012964472,0.00012650898,0.00003850895],"category_scores_gemma":[0.00010068,0.00021061847,0.000055591066,0.000093070536,0.000101006466,0.00021800799,0.000070237315,0.000105020845,0.00014434785],"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.000052388128,0.0003054935,0.54774415,0.0003517014,0.0005045026,0.0000039072397,0.009532149,0.00019943004,0.000048109057,0.43168625,0.002327711,0.007244233],"study_design_scores_gemma":[0.0037888275,0.00033557168,0.70954347,0.00013710548,0.00005016912,0.0000146626235,0.001549595,0.15438901,0.000017888788,0.004129336,0.12512708,0.0009172944],"about_ca_topic_score_codex":0.0009501271,"about_ca_topic_score_gemma":0.00002284391,"teacher_disagreement_score":0.4275569,"about_ca_system_score_codex":0.00002657489,"about_ca_system_score_gemma":0.00000655975,"threshold_uncertainty_score":0.8588772},"labels":[],"label_agreement":null},{"id":"W2406539874","doi":"10.5555/2034396.2034454","title":"Smart walkers!: enhancing the mobility of the elderly","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","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":"Computer science; Classifier (UML); Activity recognition; Discriminant; Sigmoid function; Intelligent sensor; Linear discriminant analysis; Artificial intelligence; Machine learning; Human–computer interaction; Random forest; Data mining; Wireless sensor network; Artificial neural network; Computer network","score_opus":0.1021268820539132,"score_gpt":0.26767368446236034,"score_spread":0.16554680240844716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406539874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.770035,0.0006887199,0.21910213,0.00014009482,0.0035428475,0.0027106719,0.00004631692,0.00012784825,0.003606314],"genre_scores_gemma":[0.9982302,0.000019748315,0.000403037,0.00009918848,0.000046949237,0.0000984774,8.4247165e-7,0.000015378737,0.0010861771],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974694,0.0006017905,0.00060168444,0.0005370192,0.00044972994,0.0003403804],"domain_scores_gemma":[0.9979431,0.000202289,0.0004625594,0.0010148039,0.00026279446,0.0001144639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010060404,0.000252117,0.00035864435,0.00006281816,0.00033253306,0.00010083726,0.0010165059,0.000092893984,0.000022242488],"category_scores_gemma":[0.00007959804,0.00014632684,0.00016113327,0.00031037163,0.0001768399,0.00044719654,0.00050889206,0.00019132961,0.00004137057],"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.0004134399,0.007693349,0.30461916,0.0017607464,0.0048032356,0.00015877408,0.22184773,0.00017413398,0.031143278,0.026512839,0.0104496535,0.39042366],"study_design_scores_gemma":[0.005031208,0.0011765172,0.80705255,0.0014083277,0.00025066687,0.00024594893,0.014667059,0.12757052,0.01858737,0.00040627774,0.021935606,0.0016679087],"about_ca_topic_score_codex":0.0044041513,"about_ca_topic_score_gemma":0.00034665153,"teacher_disagreement_score":0.5024334,"about_ca_system_score_codex":0.000057909478,"about_ca_system_score_gemma":0.00006796909,"threshold_uncertainty_score":0.6657789},"labels":[],"label_agreement":null},{"id":"W2406623448","doi":"10.5555/2615731.2616087","title":"Policy optimization by marginal-map probabilistic inference in generative models","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Waterloo","funders":"","keywords":"Partially observable Markov decision process; Inference; Computer science; Mathematical optimization; Generative model; Bounded function; Benchmark (surveying); Probabilistic logic; Machine learning; Artificial intelligence; Algorithm; Mathematics; Generative grammar; Markov model; Markov chain","score_opus":0.03596804359116691,"score_gpt":0.2878306369712302,"score_spread":0.2518625933800633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406623448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004409754,0.0002042871,0.9935559,0.000252152,0.0003250711,0.00055079645,0.00001635414,0.00008184145,0.0006038528],"genre_scores_gemma":[0.96790993,0.000066107736,0.029798377,0.00021526201,0.00010377088,0.00009281952,0.000023506836,0.00001895733,0.0017712833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978576,0.00044720274,0.00036956772,0.0006364839,0.00029737712,0.00039180543],"domain_scores_gemma":[0.99904174,0.00012022646,0.00019271873,0.00035093524,0.00012129661,0.00017309886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365471,0.0002701982,0.00031549475,0.00018946819,0.00017946985,0.00025032993,0.00042509072,0.000091787246,0.0000050027165],"category_scores_gemma":[0.00014006243,0.00023316308,0.00003741258,0.00031242575,0.000055759338,0.0005186242,0.00021878036,0.00018816988,0.000017895565],"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.000005898322,0.00014748714,0.00092839164,0.000044471628,0.000025447664,0.0000057276475,0.0014903863,0.97169626,0.00002749147,0.020179745,0.00029790812,0.005150808],"study_design_scores_gemma":[0.00086914847,0.000115221344,0.0008838316,0.00009517078,0.0000055032688,0.0000031477662,0.000062570456,0.9965168,0.0000061084957,0.00034409895,0.0008332927,0.0002651038],"about_ca_topic_score_codex":0.0019010738,"about_ca_topic_score_gemma":0.000023751592,"teacher_disagreement_score":0.9637575,"about_ca_system_score_codex":0.000088249755,"about_ca_system_score_gemma":0.00005898947,"threshold_uncertainty_score":0.95081145},"labels":[],"label_agreement":null},{"id":"W2407630320","doi":"10.5555/2615731.2617513","title":"Distributed multiagent resource allocation with adaptive preemption for dynamic tasks","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","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 Waterloo","funders":"","keywords":"Preemption; Computer science; Distributed computing; Resource allocation; Task (project management); Multi-agent system; Resource (disambiguation); Resource management (computing); Computer network; Artificial intelligence; Engineering; Operating system","score_opus":0.038351474185839625,"score_gpt":0.26888200538747953,"score_spread":0.2305305312016399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407630320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045853212,0.000271672,0.9495759,0.00014020895,0.0006371316,0.0030365067,0.00015151202,0.00021316747,0.00012066293],"genre_scores_gemma":[0.98286146,0.000036796584,0.014960858,0.00013137705,0.0001295352,0.00059483765,0.0002776383,0.00005309463,0.0009543819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964766,0.00043717588,0.0007026116,0.0011543928,0.00060536683,0.0006238372],"domain_scores_gemma":[0.99770564,0.00019357151,0.0006637858,0.0007676881,0.00035457945,0.00031475828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086620706,0.00050588604,0.00052969623,0.00020269859,0.00052034116,0.00030295496,0.0005605409,0.0002109262,0.000004650448],"category_scores_gemma":[0.0000715199,0.00041377006,0.00012183234,0.0003030443,0.00008099747,0.0007170703,0.00017998555,0.00016674868,0.000035622663],"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.005414161,0.011829084,0.0616479,0.005330591,0.008902498,0.00020267954,0.06935686,0.24099398,0.03157808,0.21292259,0.040539317,0.31128228],"study_design_scores_gemma":[0.0034386986,0.0006223289,0.037198573,0.0002728656,0.00006992859,0.000019661396,0.0005828123,0.9423602,0.00012802357,0.000022915414,0.014747116,0.00053685],"about_ca_topic_score_codex":0.00056015764,"about_ca_topic_score_gemma":0.00014455231,"teacher_disagreement_score":0.93700826,"about_ca_system_score_codex":0.00023987518,"about_ca_system_score_gemma":0.000047976067,"threshold_uncertainty_score":0.99983144},"labels":[],"label_agreement":null},{"id":"W2465754415","doi":"10.5555/2936924.2936979","title":"The Echo Chamber: Strategic Voting and Homophily in Social Networks","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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":"University of Waterloo","funders":"","keywords":"Homophily; Voting; Politics; Population; Social network (sociolinguistics); Voter model; Echo (communications protocol); Ideology; Phenomenon; Political science; Microeconomics; Computer science; Economics; Sociology; Computer security; Social psychology; Law; Social media; Psychology; Mathematics","score_opus":0.04929803298486006,"score_gpt":0.29339422801641696,"score_spread":0.24409619503155688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465754415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99169403,0.0005727443,0.003880329,0.00016178332,0.0006136239,0.00060701993,0.00007570615,0.000020926243,0.0023738476],"genre_scores_gemma":[0.9985834,0.00014375706,0.000017919396,0.000029294317,0.00035915783,0.000045178072,0.0000046120895,0.000018143981,0.00079855224],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987795,0.00012634136,0.00030397056,0.00029435562,0.00013072914,0.00036511233],"domain_scores_gemma":[0.9994883,0.00009567285,0.00016837727,0.00009996586,0.000056248322,0.00009142675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029866328,0.00018634486,0.00022157002,0.00003110001,0.00056736905,0.0001582524,0.00009953793,0.00006934791,0.000008713757],"category_scores_gemma":[0.000003645392,0.00011540308,0.000051639156,0.00008975585,0.00013414964,0.00013250898,0.0000981189,0.00012640057,0.0000065346358],"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.00007568533,0.00030290717,0.61075705,0.000038702667,0.00045940484,0.000024064324,0.0042478465,0.00061565446,0.00019518226,0.33578408,0.00038984232,0.047109604],"study_design_scores_gemma":[0.006321154,0.00017508521,0.5335445,0.000550065,0.000061260595,0.000005458594,0.016182832,0.43433407,0.0000053090275,0.0029706776,0.004665696,0.0011838971],"about_ca_topic_score_codex":0.0010696403,"about_ca_topic_score_gemma":0.00007491709,"teacher_disagreement_score":0.4337184,"about_ca_system_score_codex":0.000031298194,"about_ca_system_score_gemma":0.000021378084,"threshold_uncertainty_score":0.47060013},"labels":[],"label_agreement":null},{"id":"W2467276603","doi":"10.5555/2936924.2937201","title":"Investigating the Characteristics of One-Sided Matching Mechanisms: (Extended Abstract)","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Comparability; Matching (statistics); Probabilistic logic; Computer science; Dictatorship; Space (punctuation); Mechanism (biology); Task (project management); Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Economics; Epistemology; Political science","score_opus":0.10171893914074176,"score_gpt":0.2588623865931234,"score_spread":0.15714344745238162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467276603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96570957,0.00055262644,0.028889142,0.00015499342,0.0012813758,0.00084266724,0.00045965772,0.00005858409,0.0020513886],"genre_scores_gemma":[0.99716836,0.00009406549,0.00054797786,0.000108235974,0.00012225818,0.000048210743,0.0000071602285,0.00004217166,0.001861552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977903,0.000109411085,0.0011526134,0.00046622125,0.000106832835,0.0003746321],"domain_scores_gemma":[0.9978251,0.0002752822,0.0012730483,0.00041447073,0.00007640802,0.00013567509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625599,0.00026031106,0.0006307005,0.00011971198,0.00024255409,0.00008709798,0.00031917944,0.00012781279,0.00007546003],"category_scores_gemma":[0.00029384208,0.00018182595,0.00011035367,0.00011185153,0.00014370495,0.00023637169,0.00012219646,0.00013824551,0.0001671598],"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.000056461202,0.00041983445,0.03448032,0.0004787495,0.0008771533,0.000014512546,0.008496135,0.000040740277,0.013151461,0.936724,0.00027642172,0.0049841786],"study_design_scores_gemma":[0.0059188353,0.00044339037,0.90043783,0.004067403,0.00013509704,0.000051780164,0.006829965,0.010519904,0.0017008836,0.0626836,0.0054524234,0.0017588702],"about_ca_topic_score_codex":0.00088576,"about_ca_topic_score_gemma":0.000011955372,"teacher_disagreement_score":0.8740404,"about_ca_system_score_codex":0.00006096806,"about_ca_system_score_gemma":0.000016182905,"threshold_uncertainty_score":0.7414647},"labels":[],"label_agreement":null},{"id":"W2479077205","doi":"10.5555/2936924.2937144","title":"Convergence and Quality of Iterative Voting under Non-Scoring Rules: (Extended Abstract)","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Voting; Convergence (economics); Computer science; Quality (philosophy); Iterative method; Social choice theory; Anti-plurality voting; Cardinal voting systems; Mathematical optimization; Algorithm; Mathematical economics; Mathematics; Economics; Political science","score_opus":0.1481050922965997,"score_gpt":0.30445444729394866,"score_spread":0.15634935499734895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479077205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9728614,0.0012603739,0.022156008,0.00002362666,0.00082725,0.0005294886,0.0003278833,0.000028877756,0.0019851013],"genre_scores_gemma":[0.9969792,0.00018457387,0.0002321813,0.00003635205,0.00008309442,0.000031183732,0.000004515056,0.000029099214,0.0024197963],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99769396,0.0001021135,0.0011393017,0.0006176564,0.000086294785,0.0003606738],"domain_scores_gemma":[0.99825495,0.00022989124,0.0009989254,0.00026749785,0.00009221973,0.00015653188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014658544,0.00027436728,0.000711976,0.00014361019,0.00016903754,0.00006775562,0.00017058462,0.00012622632,0.00006641935],"category_scores_gemma":[0.00012572437,0.00022496625,0.00009040811,0.00009103087,0.00017065831,0.00036655506,0.000110402936,0.00010247811,0.00010676156],"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.00016468564,0.00038124243,0.51872987,0.0008298827,0.0007809198,0.000012594934,0.0074657705,0.00010618872,0.006329121,0.46331602,0.00011140882,0.0017722978],"study_design_scores_gemma":[0.003476592,0.00017591393,0.98172957,0.001023683,0.000022873593,0.000010244282,0.002996762,0.007148131,0.0005509977,0.0010819616,0.0010691507,0.0007141409],"about_ca_topic_score_codex":0.0014411003,"about_ca_topic_score_gemma":0.000024896017,"teacher_disagreement_score":0.4629997,"about_ca_system_score_codex":0.00006609747,"about_ca_system_score_gemma":0.000012580841,"threshold_uncertainty_score":0.9173857},"labels":[],"label_agreement":null},{"id":"W2494900181","doi":"10.5555/2936924.2936947","title":"Strategy-Proofness in the Stable Matching Problem with Couples","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Matching (statistics); Complementarity (molecular biology); Stable marriage problem; Preference; Set (abstract data type); Computer science; Mathematical economics; Pareto principle; Stability (learning theory); Economics; Microeconomics; Mathematical optimization; Mathematics; Statistics","score_opus":0.08909092805595974,"score_gpt":0.25137584936900165,"score_spread":0.1622849213130419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494900181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975434,0.0021143635,0.012858631,0.00014091712,0.0003512111,0.001481865,0.00020496245,0.000048777332,0.007365245],"genre_scores_gemma":[0.9955309,0.00011420143,0.00014004736,0.00006591947,0.00007188257,0.00015510985,0.000004977613,0.000033709843,0.0038832594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99818337,0.00014242576,0.00062156335,0.0005189613,0.0000923764,0.00044130342],"domain_scores_gemma":[0.9990079,0.00012146318,0.00041435318,0.00033643024,0.00003953333,0.00008031578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609966,0.0002536167,0.00045040285,0.00012983897,0.00019429595,0.00018221524,0.0003112181,0.00008959535,0.000041440515],"category_scores_gemma":[0.000019706598,0.00014572057,0.000046384823,0.00018108923,0.00008806914,0.00034901928,0.000053328335,0.00012362181,0.000139649],"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.00025044705,0.000775795,0.4081325,0.0005355697,0.0004757508,0.0001241179,0.013637824,0.0018963295,0.0002800459,0.5697916,0.00080112787,0.0032988556],"study_design_scores_gemma":[0.024390215,0.002063346,0.7553023,0.0056725857,0.00012567622,0.0003354585,0.050954,0.0375052,0.00013410168,0.025207015,0.094025455,0.004284639],"about_ca_topic_score_codex":0.0021130696,"about_ca_topic_score_gemma":0.00019239618,"teacher_disagreement_score":0.54458463,"about_ca_system_score_codex":0.00006897611,"about_ca_system_score_gemma":0.000016949969,"threshold_uncertainty_score":0.59423125},"labels":[],"label_agreement":null},{"id":"W2523006798","doi":"10.5555/2936924.2937242","title":"Strategic Voting and Social Networks: (Doctoral Consortium)","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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":"Affect (linguistics); Voting; Everyday life; Outcome (game theory); Population; Computer science; Politics; Social choice theory; Sociology; Political science; Public relations; Microeconomics; Economics; Communication","score_opus":0.08410439711991427,"score_gpt":0.306347443168548,"score_spread":0.22224304604863374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523006798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98359835,0.00026956544,0.013606315,0.000082617466,0.0006763453,0.00045539238,0.00016728592,0.000036542922,0.001107611],"genre_scores_gemma":[0.9983399,0.000032778506,0.000067549176,0.00005222586,0.000401429,0.00002978601,0.000013108354,0.000022609405,0.0010405991],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986972,0.00010420045,0.0003202671,0.00036362294,0.00014567006,0.00036900185],"domain_scores_gemma":[0.99942493,0.000053702388,0.00020818756,0.00009364898,0.00008709213,0.00013246405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017255178,0.00022510909,0.0002936543,0.000035742385,0.0003856866,0.00014438582,0.000100089856,0.00007624621,0.0000523856],"category_scores_gemma":[0.0000024585888,0.00016550407,0.000068039175,0.00006036927,0.00015819322,0.00018160438,0.000096533215,0.00009758852,0.00001409164],"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.000055064353,0.00029936558,0.6363819,0.00006341423,0.0006817021,0.00001604736,0.0020438982,0.00024469392,0.00049747084,0.3408712,0.0006839355,0.018161282],"study_design_scores_gemma":[0.012501668,0.00043465456,0.4677392,0.00093650783,0.00028463712,0.000011325943,0.019615835,0.48008174,0.00003171655,0.0018344959,0.013698598,0.0028296285],"about_ca_topic_score_codex":0.0008378014,"about_ca_topic_score_gemma":0.000012683819,"teacher_disagreement_score":0.47983706,"about_ca_system_score_codex":0.00002689468,"about_ca_system_score_gemma":0.000025920775,"threshold_uncertainty_score":0.674906},"labels":[],"label_agreement":null},{"id":"W2531256015","doi":"10.5555/2936924.2937219","title":"A Kinect-based Interactive Game to Improve the Cognitive Inhibition of the Elderly: (Demonstration)","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Mind wandering and attention","field":"Neuroscience","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":"Cognition; Personalization; Computer science; Theme (computing); Game play; Process (computing); Human–computer interaction; Psychology; Multimedia; World Wide Web","score_opus":0.05845525293081405,"score_gpt":0.29000513439508596,"score_spread":0.2315498814642719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531256015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746736,0.000020613685,0.02241277,0.0004242678,0.0006559697,0.0012907505,0.00020446176,0.000022575725,0.00029494794],"genre_scores_gemma":[0.9984584,0.0000091326465,0.000017471164,0.00031217307,0.00005540365,0.00013204262,0.000001992448,0.0000150703245,0.0009983218],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846447,0.0003314351,0.00029891919,0.00039787614,0.00029245348,0.00021485143],"domain_scores_gemma":[0.9990147,0.00030424973,0.00027323773,0.00020485563,0.00012533303,0.00007765889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019896393,0.00017325702,0.00016890428,0.000062982916,0.0002083987,0.000057685327,0.00013563881,0.000053658256,0.000022763697],"category_scores_gemma":[0.00034587152,0.0000825857,0.00008609102,0.00017438864,0.00015731857,0.00017912009,0.000082205814,0.00009695304,0.00003560294],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033531073,0.00042899724,0.0035700104,0.00006139883,0.00007796088,0.000012779531,0.002216899,0.00010311043,0.96146446,0.0007110194,0.00045561002,0.030562414],"study_design_scores_gemma":[0.007950813,0.0015694234,0.11551636,0.002992676,0.00018060606,0.000033953635,0.0045018247,0.02218079,0.841955,0.00009295179,0.0023272072,0.0006983907],"about_ca_topic_score_codex":0.0001534348,"about_ca_topic_score_gemma":0.000023831702,"teacher_disagreement_score":0.11950948,"about_ca_system_score_codex":0.000044056407,"about_ca_system_score_gemma":0.00003517346,"threshold_uncertainty_score":0.3367747},"labels":[],"label_agreement":null},{"id":"W2620615090","doi":"10.5555/3091125.3091250","title":"Distant Truth: Bias Under Vote Distortion Costs","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Nash equilibrium; Voting; Computer science; Distortion (music); Outcome (game theory); Surprise; Set (abstract data type); Social choice theory; Econometrics; Mathematical economics; Mathematics; Social psychology; Bandwidth (computing); Psychology","score_opus":0.20115803981468233,"score_gpt":0.29770024886114627,"score_spread":0.09654220904646393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620615090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466056,0.0028105935,0.025378965,0.00013183075,0.00784083,0.001124676,0.00060692645,0.00010690983,0.015393633],"genre_scores_gemma":[0.9907749,0.00012815766,0.000068136505,0.00006008065,0.00023561831,0.000055471395,0.000027854521,0.000049536135,0.0086002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99780107,0.000102265614,0.0008237092,0.0007205379,0.00009712136,0.00045528862],"domain_scores_gemma":[0.9976549,0.00007727305,0.001173064,0.00080986094,0.000058933343,0.00022594184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011135543,0.00032204684,0.00062591484,0.00013289222,0.00085884565,0.00047513854,0.0004158488,0.0001645373,0.000039911538],"category_scores_gemma":[0.00023084201,0.00031526654,0.00014335917,0.000058182835,0.00017128291,0.0004430297,0.00015543318,0.00016412859,0.00040989163],"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.00018102823,0.0006177056,0.3878356,0.0002632208,0.0007880718,0.00007370565,0.0021105474,0.00027443407,0.00009931234,0.6029382,0.0020662982,0.002751922],"study_design_scores_gemma":[0.0047294972,0.00028474999,0.88010436,0.0005606143,0.00007006936,0.000035938592,0.0016593559,0.043967467,0.00005752911,0.0032468315,0.06392293,0.0013606312],"about_ca_topic_score_codex":0.0036980493,"about_ca_topic_score_gemma":0.00013112965,"teacher_disagreement_score":0.59969133,"about_ca_system_score_codex":0.00021964553,"about_ca_system_score_gemma":0.000012326471,"threshold_uncertainty_score":0.99992996},"labels":[],"label_agreement":null},{"id":"W2620853660","doi":"10.5555/3091125.3091207","title":"Forward Actor-Critic for Nonlinear Function Approximation in Reinforcement Learning","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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 Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Bellman equation; Function approximation; Nonlinear system; Function (biology); Class (philosophy); Artificial intelligence; Temporal difference learning; Mathematical optimization; Machine learning; Artificial neural network; Mathematics","score_opus":0.07223075096191683,"score_gpt":0.309418597286914,"score_spread":0.23718784632499718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620853660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012294425,0.00008575003,0.9839391,0.000060002047,0.0011879375,0.0017537753,0.0000026723205,0.000078016245,0.0005983266],"genre_scores_gemma":[0.98591125,0.00007322879,0.011038232,0.00006920133,0.00011312218,0.00022707904,0.000032956756,0.000024876646,0.0025100673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980228,0.00009896817,0.00051600416,0.0005155409,0.00039231364,0.00045437337],"domain_scores_gemma":[0.998518,0.000079762955,0.0004985808,0.00060206285,0.00017385899,0.00012777219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006936602,0.00025441914,0.00030798165,0.00016410781,0.0007158094,0.0007739886,0.0005820224,0.000118046555,0.0000041819376],"category_scores_gemma":[0.00023320618,0.00024108116,0.00006871614,0.000077733646,0.00005591044,0.0013659816,0.00032099447,0.00020003799,0.000028512359],"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.00013435516,0.00016962418,0.018791592,0.0005424324,0.0002547882,0.00001923575,0.0033818057,0.9513159,0.0005697796,0.010778279,0.0004754629,0.013566741],"study_design_scores_gemma":[0.0021147248,0.0003722293,0.011879541,0.00026723067,0.000022021486,0.0000028697157,0.00032784385,0.9791633,0.000051736213,0.000019775842,0.005518189,0.0002605273],"about_ca_topic_score_codex":0.00023033629,"about_ca_topic_score_gemma":0.000012891886,"teacher_disagreement_score":0.97361684,"about_ca_system_score_codex":0.0001364622,"about_ca_system_score_gemma":0.000039194805,"threshold_uncertainty_score":0.9831004},"labels":[],"label_agreement":null},{"id":"W2621346283","doi":"10.5555/3091125.3091215","title":"Divide and Conquer: Using Geographic Manipulation to Win District-Based Elections","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":34,"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":"Gerrymandering; Ballot; Divide and conquer algorithms; Computer science; Voting; Redistricting; Secret ballot; Political science; Computer security; Law; Algorithm; Politics; Democracy","score_opus":0.16505426797796252,"score_gpt":0.302302601841162,"score_spread":0.13724833386319946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621346283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432294,0.00073346746,0.052878227,0.000090434645,0.00084964203,0.000850488,0.0002317435,0.000042664084,0.0010939523],"genre_scores_gemma":[0.9985039,0.000033195003,0.00023764437,0.00008689786,0.00011141735,0.000051684212,0.000013819006,0.000031731404,0.00092968123],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984473,0.000074054486,0.00053779525,0.00054430537,0.000062089915,0.0003344517],"domain_scores_gemma":[0.9986813,0.000058057132,0.00056670385,0.00043530524,0.00005723238,0.00020138436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070581544,0.00023508866,0.00042997903,0.00025499938,0.0009471124,0.00041195826,0.00019130128,0.00011393416,0.000030693922],"category_scores_gemma":[0.00015290997,0.00025171076,0.00007237884,0.00010087644,0.00009092241,0.00028213474,0.000097249926,0.00010793434,0.00006800283],"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.000036925016,0.00013853898,0.94101524,0.0001005837,0.0001971623,0.000011295124,0.0004599307,0.001026636,0.000193562,0.05625463,0.00020199188,0.00036351182],"study_design_scores_gemma":[0.0014374439,0.00013297993,0.81696403,0.00024505457,0.000038708808,0.000012236146,0.00021786646,0.17226136,0.000032452528,0.0006344024,0.007485597,0.0005378625],"about_ca_topic_score_codex":0.0046176575,"about_ca_topic_score_gemma":0.00007673866,"teacher_disagreement_score":0.17123471,"about_ca_system_score_codex":0.000066978355,"about_ca_system_score_gemma":0.000009993149,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W2621370674","doi":"10.5555/3091125.3091251","title":"A Restricted Markov Tree Model for Inference and Generation in Social Choice with Incomplete Preferences","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Computer science; Inference; Graphical model; Consistency (knowledge bases); Machine learning; Markov chain; Intuition; Markov model; Ranking (information retrieval); Artificial intelligence; Tree (set theory); Probabilistic logic; Social choice theory; Data mining; Mathematics; Mathematical economics","score_opus":0.24764105549389467,"score_gpt":0.3200695065619617,"score_spread":0.07242845106806703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621370674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97708255,0.00034530266,0.01949986,0.000051260267,0.00021792333,0.0010477289,0.0002909727,0.000019063318,0.0014453087],"genre_scores_gemma":[0.9971264,0.00007030891,0.0007123099,0.000025099589,0.00015499743,0.00019890515,0.000027237853,0.000022034543,0.0016627082],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985779,0.000059423684,0.00050166337,0.000518744,0.000054655728,0.00028763388],"domain_scores_gemma":[0.99890155,0.00006982522,0.00063940295,0.0002472763,0.000061068364,0.000080883336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895331,0.00021492859,0.00046620256,0.00014426534,0.0006049654,0.00031374377,0.0002165886,0.000121990764,0.000003820153],"category_scores_gemma":[0.00014819353,0.00019895073,0.00003527239,0.000056132427,0.00010446559,0.0003833971,0.00008321104,0.000102383034,0.0000054001407],"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.00037540338,0.00038019483,0.8845105,0.00045313293,0.0003817456,0.000009758411,0.008260901,0.002050811,0.00027082796,0.097638026,0.00071967626,0.0049489895],"study_design_scores_gemma":[0.0021227968,0.000112028894,0.30709997,0.00007551853,0.000011433756,0.0000016173218,0.00018039571,0.6890396,0.000003706248,0.00053865986,0.0005707817,0.00024353563],"about_ca_topic_score_codex":0.0018812155,"about_ca_topic_score_gemma":0.0011819646,"teacher_disagreement_score":0.6869888,"about_ca_system_score_codex":0.000048982598,"about_ca_system_score_gemma":0.000019189343,"threshold_uncertainty_score":0.81129754},"labels":[],"label_agreement":null},{"id":"W29505111","doi":"10.1111/mmi.13947","title":"Koko: engineering affective applications","year":2009,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","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":"National Institute of Allergy and Infectious Diseases; Canadian Institutes of Health Research; National Institutes of Health","keywords":"Affect (linguistics); Entertainment; Computer science; Empathy; Multimedia; Human–computer interaction; Psychology; Social psychology; Visual arts; Communication","score_opus":0.04968349176655432,"score_gpt":0.295271183228059,"score_spread":0.2455876914615047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29505111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014001813,0.00068309775,0.9825608,0.00010466367,0.0004848475,0.0010111479,0.000008821124,0.00022485021,0.0009199165],"genre_scores_gemma":[0.98877996,0.00006645044,0.010196839,0.00016145593,0.000114336464,0.00013054282,0.000002411756,0.000012715484,0.00053527026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985089,0.00006178454,0.0002968409,0.00052808307,0.00024888953,0.00035553172],"domain_scores_gemma":[0.99906963,0.00007922012,0.00012033001,0.00043495686,0.00011761838,0.00017821978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020830263,0.00022352037,0.00022859026,0.0001223232,0.00019111551,0.0001984608,0.00050600886,0.00008080398,0.0000051742127],"category_scores_gemma":[0.000030762014,0.00020615148,0.00006142166,0.00028327055,0.000037030226,0.0004368215,0.00012746964,0.00012998386,0.00013263672],"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.000040508454,0.0017510863,0.0068481187,0.00014655494,0.00059424527,0.00020856419,0.015924899,0.032106645,0.010595874,0.41717264,0.004561822,0.51004905],"study_design_scores_gemma":[0.00027951738,0.00019242727,0.021471255,0.00009165641,0.000019588917,0.000028810944,0.00044212892,0.9565611,0.0011543058,0.0003355133,0.018950393,0.0004733436],"about_ca_topic_score_codex":0.00016262889,"about_ca_topic_score_gemma":0.000006223776,"teacher_disagreement_score":0.9747782,"about_ca_system_score_codex":0.0000737529,"about_ca_system_score_gemma":0.000020836938,"threshold_uncertainty_score":0.84066135},"labels":[],"label_agreement":null},{"id":"W2963606302","doi":"10.5555/2936924.2936943","title":"Budgetary Effects on Pricing Equilibrium in Online Markets","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction 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 Toronto","funders":"","keywords":"Submodular set function; Budget constraint; Market clearing; Valuation (finance); Nash equilibrium; Microeconomics; Clearing; Economics; Mathematical economics; Uniqueness; Monotone polygon; Mathematical optimization; Mathematics","score_opus":0.1186784481878477,"score_gpt":0.37016680573510363,"score_spread":0.25148835754725596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963606302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98515636,0.00024391433,0.010991704,0.00044311158,0.0008550954,0.0009229877,0.000087511406,0.000049385668,0.0012499136],"genre_scores_gemma":[0.99016005,0.00004734593,0.00022524143,0.0003030025,0.00014868223,0.000074357624,0.000005079903,0.00001985811,0.009016408],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9970942,0.00057787966,0.000644279,0.00071851443,0.0006220882,0.0003430003],"domain_scores_gemma":[0.99751025,0.001373602,0.00028708568,0.0005200929,0.00011793798,0.00019105153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014249999,0.00023310709,0.0003650427,0.00029071362,0.00014712731,0.000087069915,0.0003871729,0.00010015475,0.00009598412],"category_scores_gemma":[0.0005853157,0.00013693451,0.00007924107,0.0004024576,0.0000946385,0.0003265221,0.00016298807,0.00011357064,0.00044540034],"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.0014013733,0.0033933076,0.23407869,0.00017273228,0.00045471528,0.00032919185,0.0040996484,0.0011274638,0.044690594,0.019005612,0.026332673,0.664914],"study_design_scores_gemma":[0.005346712,0.00036734226,0.915326,0.0008740133,0.00003852335,0.000032081076,0.0022207322,0.02508329,0.0017512074,0.002421549,0.04578923,0.0007493405],"about_ca_topic_score_codex":0.00007753031,"about_ca_topic_score_gemma":0.000019476061,"teacher_disagreement_score":0.6812473,"about_ca_system_score_codex":0.000072495764,"about_ca_system_score_gemma":0.00002314742,"threshold_uncertainty_score":0.5724869},"labels":[],"label_agreement":null},{"id":"W3022125085","doi":"10.5555/2615731.2615757","title":"Progression and verification of situation calculus agents with bounded beliefs","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","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":"York University","funders":"","keywords":"Situation calculus; Decidability; Bounded function; Action (physics); Computer science; Domain (mathematical analysis); Object (grammar); Temporal logic; Belief revision; Calculus (dental); Order (exchange); Mathematics; Theoretical computer science; Discrete mathematics; Artificial intelligence","score_opus":0.03857713149392297,"score_gpt":0.2800804080179356,"score_spread":0.24150327652401263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022125085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4300418,0.0008761049,0.5648608,0.000051498253,0.0005786489,0.0012052688,0.0000090253825,0.00010462977,0.0022722534],"genre_scores_gemma":[0.9942533,0.000094490424,0.004965886,0.000039381994,0.00005767642,0.000055960078,0.000014094731,0.000015070862,0.0005041866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982525,0.00021500232,0.00033081076,0.0005484571,0.00038121542,0.00027197687],"domain_scores_gemma":[0.9988298,0.000049486647,0.00035319917,0.000379319,0.00021865837,0.00016955359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045337563,0.00022634139,0.00029933284,0.00010041852,0.00025055438,0.0001504921,0.00026961963,0.00010118529,0.000003756439],"category_scores_gemma":[0.00004767858,0.00016420803,0.000035006036,0.00018993713,0.00011024568,0.00039841977,0.00015775493,0.00008361433,0.000013904148],"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.00061789225,0.0046031713,0.20809653,0.0020374248,0.0014582693,0.0001003271,0.08109641,0.0007092004,0.01494788,0.2482328,0.004609274,0.4334908],"study_design_scores_gemma":[0.0031144326,0.0007811298,0.28330937,0.00042981456,0.000056611494,0.000028779574,0.00038062088,0.7053881,0.00088853977,0.00010968083,0.00507032,0.00044255482],"about_ca_topic_score_codex":0.00022659825,"about_ca_topic_score_gemma":0.000032903277,"teacher_disagreement_score":0.70467895,"about_ca_system_score_codex":0.00004460428,"about_ca_system_score_gemma":0.000034427976,"threshold_uncertainty_score":0.6696209},"labels":[],"label_agreement":null},{"id":"W3140464205","doi":"","title":"Investigating the characteristics of one-sided matching mechanisms","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Computer science; Matching (statistics); Mathematics; Statistics","score_opus":0.10926594919314152,"score_gpt":0.2541527099557087,"score_spread":0.14488676076256718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140464205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9276592,0.00052938785,0.06752864,0.00016155324,0.0012935754,0.0007542121,0.00037771644,0.000049510127,0.001646213],"genre_scores_gemma":[0.99663997,0.00007849398,0.00062632357,0.0001136623,0.00011232219,0.000043474654,0.0000051919997,0.00003683872,0.0023437233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99805313,0.00014164776,0.0009745806,0.00041095034,0.00008945834,0.00033022682],"domain_scores_gemma":[0.99817914,0.00023463131,0.0010328634,0.0003734209,0.00006317602,0.00011677607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014770504,0.0002241982,0.00057110575,0.00010514149,0.00022471124,0.000072248404,0.0002870093,0.00010660203,0.00005124188],"category_scores_gemma":[0.0002554304,0.00015348177,0.00009446022,0.00011214091,0.00012926193,0.0001907092,0.0001275177,0.00010805232,0.00014717237],"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.000026711316,0.00018765786,0.04949922,0.00024483431,0.00048627323,0.0000060223133,0.0057068923,0.000026364836,0.0068744393,0.9345158,0.00017870689,0.0022470786],"study_design_scores_gemma":[0.0114524895,0.0009879706,0.7851835,0.0076948353,0.00025842016,0.00009854651,0.012344644,0.035476595,0.0033214183,0.1251157,0.014699197,0.0033666862],"about_ca_topic_score_codex":0.0007529811,"about_ca_topic_score_gemma":0.000008852188,"teacher_disagreement_score":0.8094001,"about_ca_system_score_codex":0.00005064976,"about_ca_system_score_gemma":0.000012015306,"threshold_uncertainty_score":0.6258805},"labels":[],"label_agreement":null},{"id":"W79747542","doi":"10.5555/1838206.1838398","title":"Quasi deterministic POMDPs and DecPOMDPs","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Observability; Observable; Computer science; Extension (predicate logic); Markov decision process; Mathematical optimization; Hierarchy; Class (philosophy); Polynomial hierarchy; Theoretical computer science; Mathematics; Time complexity; Markov process; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.06089110723984551,"score_gpt":0.29445388733306554,"score_spread":0.23356278009322004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79747542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41273412,0.0005313704,0.5831632,0.000098774486,0.0018181792,0.00051987916,0.000018522485,0.00023716553,0.0008787758],"genre_scores_gemma":[0.98154813,0.00011154685,0.017425181,0.00020176928,0.00008969058,0.00003811142,0.0000023656537,0.000018891815,0.00056433724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820757,0.00010438392,0.00034557443,0.0006671663,0.0002665242,0.00040880108],"domain_scores_gemma":[0.9988149,0.0000864259,0.000146456,0.0004877208,0.000118415155,0.00034610167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034847998,0.00027847546,0.0002983526,0.0000996164,0.00028733304,0.00038803992,0.0004693137,0.00014669656,0.0000062613803],"category_scores_gemma":[0.000045305365,0.00023835855,0.000044998094,0.00012641268,0.000095164665,0.00036596507,0.00030192945,0.00026831083,0.000050973653],"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.0001399736,0.005027362,0.07085575,0.000928858,0.0012502689,0.0013226812,0.029724037,0.00026622706,0.019784175,0.4813318,0.0057453373,0.38362354],"study_design_scores_gemma":[0.001013412,0.0002952911,0.020660287,0.00009280324,0.000034248835,0.00017483521,0.00019057443,0.9709721,0.00007948837,0.0003857544,0.0055859736,0.00051520613],"about_ca_topic_score_codex":0.00033477347,"about_ca_topic_score_gemma":0.00004643788,"teacher_disagreement_score":0.9707059,"about_ca_system_score_codex":0.000016624614,"about_ca_system_score_gemma":0.00005065727,"threshold_uncertainty_score":0.971998},"labels":[],"label_agreement":null}]}